#include <bits/concept_check.h>
Go to the source code of this file.
Namespaces | |
namespace | std |
Classes | |
struct | std::List_node_base |
struct | std::List_node< Type > |
struct | std::List_iterator< Type > |
A list::iterator. More... | |
struct | std::List_const_iterator< Type > |
A list::const_iterator. More... | |
class | std::List_base< Type, Alloc > |
struct | std::List_base< Type, Alloc >::List_impl |
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... | |
Defines | |
#define | LISTH |
Functions | |
template<typename Val> | |
bool | std::operator== (const List_iterator< Val > &x, const List_const_iterator< Val > &y) |
template<typename Val> | |
bool | std::operator!= (const List_iterator< Val > &x, const List_const_iterator< Val > &y) |
template<typename Type, typename Alloc> | |
bool | std::operator== (const list< Type, Alloc > &x, const list< Type, Alloc > &y) |
List equality comparison. | |
template<typename Type, typename Alloc> | |
bool | std::operator< (const list< Type, Alloc > &x, const list< Type, Alloc > &y) |
List ordering relation. | |
template<typename Type, typename Alloc> | |
bool | std::operator!= (const list< Type, Alloc > &x, const list< Type, Alloc > &y) |
Based on operator==. | |
template<typename Type, typename Alloc> | |
bool | std::operator> (const list< Type, Alloc > &x, const list< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
bool | std::operator<= (const list< Type, Alloc > &x, const list< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
bool | std::operator>= (const list< Type, Alloc > &x, const list< Type, Alloc > &y) |
Based on operator<. | |
template<typename Type, typename Alloc> | |
void | std::swap (list< Type, Alloc > &x, list< Type, Alloc > &y) |
See std::list::swap(). |
Definition in file stl_list.h.