All containers must meet basic requirements.

The swap(), equal() and lexicographical_compare() algorithms are defined in the algorithm library for more information see Algorithms Library .

The member function size() returns the number of elements in a container.

The member function begin() returns an iterator to the first element and end returns an iterator to the last element.

If begin() equals end() the container is empty.

Copy constructors for container types copy and allocator argument from their first parameter. All other constructors take an Allocator reference argument.

The member function get_allocator() returns a copy of the Allocator object used in construction of the container.

If an iterator type of the container is bi-directional or a random access iterator the container is reversible.