Difference between revisions of "cpp/container/list"
From cppreference.com
(add template params) |
(fmt) |
||
| Line 14: | Line 14: | ||
{{tt|std::list}} meets the requirements of {{concept|Container}}, {{concept|AllocatorAwareContainer}}, {{concept|SequenceContainer}} and {{concept|ReversibleContainer}}. | {{tt|std::list}} meets the requirements of {{concept|Container}}, {{concept|AllocatorAwareContainer}}, {{concept|SequenceContainer}} and {{concept|ReversibleContainer}}. | ||
| − | + | ===Template parameters=== | |
{{param list begin}} | {{param list begin}} | ||
{{param list template | cpp/container/param list T | deque}} | {{param list template | cpp/container/param list T | deque}} | ||
Revision as of 16:03, 12 May 2013
| Defined in header <list>
|
||
| template< class T, |
||
std::list is a container that supports fast insertion and removal of elements from anywhere in the container. Fast random access is not supported. It is usually implemented as double-linked list. Compared to std::forward_list this container provides bidirectional iteration capability while being less space efficient.
Addition, removal and moving the elements within the list or across several lists does not invalidate the iterators. An iterator is invalidated only when the corresponding element is deleted.
std::list meets the requirements of Template:concept, Template:concept, Template:concept and Template:concept.
Contents |
