Standard C++ Library Reference ISO/IEC (VERSION3)

back_insert_iterator::operator=
back_insert_iterator&
operator=(typename Container::const_reference val);
The member function evaluates container. push_back(val), then returns *this.
back_insert_iterator::reference
typedef typename Container::reference reference;
The type describes a reference to an element of the sequence controlled by the associated container.
back_inserter
template<class Container>
back_insert_iterator<Container> back_inserter(Container& cont);
The template function returns back_insert_iterator<Container>(cont).
bidirectional_iterator_tag
struct bidirectional_iterator_tag
: public forward_iterator_tag {
};
The type is the same as iterator<Iter>::iterator_category when Iter describes an
object that can serve as a bidirectional iterator.
distance
template<class Init>
typename iterator_traits<InIt>::difference_type
distance(InIt first, InIt last);
The template function sets a count N to zero. It then effectively advances first and increments N
until first == last. If InIt is a random-access iterator type, the function evaluates the
expression N += last - first. Otherwise, it performs each iterator increment by evaluating
++first. The function returns N.
forward_iterator_tag
struct forward_iterator_tag
: public input_iterator_tag {
};
The type is the same as iterator<Iter>::iterator_category when Iter describes an