Difference between revisions of "cpp/container/forward list"
(add template params) |
(fmt) |
||
| Line 14: | Line 14: | ||
{{tt|std::forward_list}} meets the requirements of {{concept|Container}} (except for the {{tt|size()}} member function), {{concept|AllocatorAwareContainer}} and {{concept|SequenceContainer}}. | {{tt|std::forward_list}} meets the requirements of {{concept|Container}} (except for the {{tt|size()}} member function), {{concept|AllocatorAwareContainer}} and {{concept|SequenceContainer}}. | ||
| − | + | ===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 <forward_list>
|
||
| template< class T, |
(since C++11) | |
std::forward_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 implemented as singly-linked list and essentially does not have any overhead compared to its implementation in C. Compared to std::list this container provides more space efficient storage when bidirectional iteration is not needed.
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::forward_list meets the requirements of Template:concept (except for the size() member function), Template:concept and Template:concept.
Contents |
