Standard C++ Library Class Reference

X::const_reverse_iterator An iterator type pointing to const T
A reversible container provides the following member functions:
rbegin() Returns a reverse_iterator or a const_reverse_iterator pointing past the
end of the collection
rend() Returns a reverse_iterator or a const_reverse_iterator pointing to the
first element in the collection.
●
Sequences
In addition to the requirements for containers, the following requirements hold for sequences:
iterator and const_iterator must be forward iterators, bidirectional iterators or random
access iterators.
●
A sequence provides the following constructors:
X(n, t) Constructs a container with n copies of t.
X(i, j) Constructs a container with elements from the range [i,j).
●
A sequence provides the following member functions:
insert(p,t) Inserts the element t in front of the position identified by the iterator p.
insert(p,n,t) Inserts n copies of t in front of the position identified by the iterator p.
insert(p,i,j) Inserts elements from the range [i,j) in front of the position identified by
the the iterator p.
erase(q) Erases the element pointed to by the iterator q.
erase(q1,q2) Erases the elements in the range [q1,q2).
●
A sequence may also provide the following member functions if they can be
implemented with constant time complexity.
front() Returns the element pointed to by begin()
back() Returns the element pointed to by end()
push_front(x) Inserts the element x at begin()
push_back(x) Inserts the element x at end()
pop_front() Erases the element at begin()
pop_back() Erases the element at end() -1
operator[](n) Returns the element at a.begin() + n
●