stl_iterator.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	std
namespace	__gnu_cxx
Functions
template<typename Iterator>
bool	operator== (const reverse_iterator< Iterator > &x, const reverse_iterator< Iterator > &y)
template<typename Container>
back_insert_iterator< Container >	back_inserter (Container &x)
template<typename Container>
front_insert_iterator< Container >	front_inserter (Container &x)
template<typename Container, typename Iterator>
insert_iterator< Container >	inserter (Container &x, Iterator __i)

---

Detailed Description

This is an internal header file, included by other library headers. You should not attempt to use it directly.

This file implements reverse_iterator, back_insert_iterator, front_insert_iterator, insert_iterator, normal_iterator, and their supporting functions and overloaded operators.

Definition in file stl_iterator.h.

---

Function Documentation

template<typename Container> back_insert_iterator<Container> std::back_inserter (  Container &  x  )  [inline]

Parameters: x  A container of arbitrary type. Returns: An instance of back_insert_iterator working on x. This wrapper function helps in creating back_insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you. Definition at line 397 of file stl_iterator.h.

template<typename Container> front_insert_iterator<Container> std::front_inserter (  Container &  x  )  [inline]

Parameters: x  A container of arbitrary type. Returns: An instance of front_insert_iterator working on x. This wrapper function helps in creating front_insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you. Definition at line 471 of file stl_iterator.h.

template<typename Container, typename Iterator> insert_iterator<Container> std::inserter (  Container &  x, Iterator  __i )  [inline]

Parameters: x  A container of arbitrary type. Returns: An instance of insert_iterator working on x. This wrapper function helps in creating insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you. Definition at line 567 of file stl_iterator.h.

template<typename Iterator> bool std::operator== (  const reverse_iterator< Iterator > &  x, const reverse_iterator< Iterator > &  y )  [inline]

Parameters: x  A reverse_iterator. y  A reverse_iterator. Returns: A simple bool. Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another. Definition at line 277 of file stl_iterator.h. References std::reverse_iterator< Iterator >::base().

---