Is there a sorted container in the STL? What I mean is following: I have an std::vector<Foo>, where Foo is a custom made class. I also have a comparator of some sort which will compare the ...

When I do this: std::vector<int> hello; Everything works great. However, when I make it a vector of references instead: std::vector<int &> hello; I get horrible errors like ...

Every standard container has a begin and end method for returning iterators for that container. However, C++11 has apparently introduced free functions called std::begin and std::end which call the...

I've been reading up on STL containers in my book on C++, specifically the section on the STL and its containers. Now I do understand each and every one of them have their own specific properties, ...

I have a container with shared_ptr<>, e.g. a vector<shared_ptr<string>> v and I'd like to iterate over v indicating const-ness. This code: vector<shared_ptr<string>&gt...

I have a number of unrelated types that all support the same operations through overloaded free functions (ad hoc polymorphism): struct A {}; void use(int x) { std::cout << "int = " <&lt...

The STL reference seems to make a conceptual difference between : 'Sequence containers' (array vector deque forward_list list) on one hand 'Associative containers' (set multiset map multimap unor...

It often happens to me to have a a container C (or whatever kind of wrapper class, even smart pointers) for a type T1, and want to convert such C<T1> into C<T2>, where T2 is compatible ...

Is there is a difference between size_t and container::size_type? What I understand is size_t is more generic and can be used for any size_types. But is container::size_type optimized for specifi...