stl_list.h File Reference

#include <bits/concept_check.h>

Include dependency graph for stl_list.h:

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

Go to the source code of this file.

Namespaces
namespace	std
Classes
struct	std::List_iterator< Type, Ref, Ptr >
	A list::iterator. More...
class	std::list< Type, Alloc >
	A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence. More...
Functions
template<typename Type, typename Alloc> bool	operator== (const list< Type, Alloc > &x, const list< Type, Alloc > &y)
	List equality comparison.
template<typename Type, typename Alloc> bool	operator< (const list< Type, Alloc > &x, const list< Type, Alloc > &y)
	List ordering relation.
template<typename Type, typename Alloc> bool	operator!= (const list< Type, Alloc > &x, const list< Type, Alloc > &y)
	Based on operator==.
template<typename Type, typename Alloc> bool	operator> (const list< Type, Alloc > &x, const list< Type, Alloc > &y)
	Based on operator<.
template<typename Type, typename Alloc> bool	operator<= (const list< Type, Alloc > &x, const list< Type, Alloc > &y)
	Based on operator<.
template<typename Type, typename Alloc> bool	operator>= (const list< Type, Alloc > &x, const list< Type, Alloc > &y)
	Based on operator<.
template<typename Type, typename Alloc> void	swap (list< Type, Alloc > &x, list< Type, Alloc > &y)
	See std::list::swap().

---

Detailed Description

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

Definition in file stl_list.h.

---

Function Documentation

template<typename Type, typename Alloc> bool operator!= (  const list< Type, Alloc > &  x, const list< Type, Alloc > &  y )  [inline]

Based on operator==. Definition at line 1149 of file stl_list.h.

template<typename Type, typename Alloc> bool operator< (  const list< Type, Alloc > &  x, const list< Type, Alloc > &  y )  [inline]

List ordering relation. Parameters: x  A list. y  A list of the same type as x. Returns: True iff x is lexographically less than y. This is a total ordering relation. It is linear in the size of the lists. The elements must be comparable with <. See std::lexographical_compare() for how the determination is made. Definition at line 1140 of file stl_list.h.

template<typename Type, typename Alloc> bool operator<= (  const list< Type, Alloc > &  x, const list< Type, Alloc > &  y )  [inline]

Based on operator<. Definition at line 1161 of file stl_list.h. References std::list< Type, Alloc >::swap().

template<typename Type, typename Alloc> bool operator== (  const list< Type, Alloc > &  x, const list< Type, Alloc > &  y )  [inline]

List equality comparison. Parameters: x  A list. y  A list of the same type as x. Returns: True iff the size and elements of the lists are equal. This is an equivalence relation. It is linear in the size of the lists. Lists are considered equivalent if their sizes are equal, and if corresponding elements compare equal. Definition at line 1112 of file stl_list.h.

template<typename Type, typename Alloc> bool operator> (  const list< Type, Alloc > &  x, const list< Type, Alloc > &  y )  [inline]

Based on operator<. Definition at line 1155 of file stl_list.h.

template<typename Type, typename Alloc> bool operator>= (  const list< Type, Alloc > &  x, const list< Type, Alloc > &  y )  [inline]

Based on operator<. Definition at line 1167 of file stl_list.h.

template<typename Type, typename Alloc> void swap (  list< Type, Alloc > &  x, list< Type, Alloc > &  y )  [inline]

See std::list::swap(). Definition at line 1173 of file stl_list.h.

---