Why is using classic for loops as iterators in stl considered bad?

I’ve read a couple of articles (example) that consider the classic

How does a priority_queue maintain a heap on a deque efficiently?

In the C++ STL, priority_queue (heap) can be used with any underlying container, such as a deque. How does the implementation stay O(log n) if deques don’t swap an item in index a with index b in constant time?

What is the point of using lists over vectors, in C++?

I’ve run 3 different experiments involving C++ lists and vectors.

How do objects fit into modern C++ (stl, policy-classes, functional) style?

I’m a bit confused so the question is a bit confusing. TL;dr: how to mix STL and OOP?

QT-C++ vs Generic C++ and STL [closed]

Closed 10 years ago.

Two-Dimensional vector in C++ – inefficient with dynamic-sized sub vectors?

I know that std::vector uses a contiguous block of memory, but I often see people use vectors of vectors, even when they modify the number of elements in these vectors contained within an outer vector. Won’t this lead to efficiency problems when an inner vector need to be resized as all the following vectors will have to have their elements moved as well?

Are there languages that expand on the STL’s iterator types? [closed]

Closed 10 years ago.

Why isn’t there parallel reduction in the Standard Template Library?

Alexander Stepanov stated in talks and interviews that his realization that eventually lead him to generic programming and the Standard Template Library, was from the case of the parallel reduction algorithm.

What’s wrong with statically linking the STL into multiple shared libraries?

Here is the scenario:

What’s wrong with statically linking the STL into multiple shared libraries?

Here is the scenario: