Difference between revisions of "cpp/container/list"
From cppreference.com
m (Text replace - "{{tdcl" to "{{dcl") |
m (Text replace - "container/tdcl" to "container/dcl") |
||
Line 15: | Line 15: | ||
{{dcl list begin}} | {{dcl list begin}} | ||
{{dcl list hitem | Member type | Definition}} | {{dcl list hitem | Member type | Definition}} | ||
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list value_type | list}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list allocator_type | list}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list size_type | list}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list difference_type | list}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list reference | list}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list const_reference | list}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list pointer | list}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list const_pointer | list}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list iterator | list}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list const_iterator | list}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list reverse_iterator | list}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list const_reverse_iterator | list}} |
{{dcl list end}} | {{dcl list end}} | ||
Revision as of 02:06, 12 June 2012
Template:cpp/container/list/sidebar
Defined in header <list>
|
||
template< class T, |
||
List is a container which supports fast insertion and removal of elements from anywhere from the container. Fast random access is not supported. It is implemented as double-linked list. Compared to std::forward_list this container provides bidirectional iteration capability while being less space efficient.
std::list
meets the requirements of Template:concept, Template:concept, Template:concept and Template:concept.
Contents |