Difference between revisions of "cpp/container/forward list"
From cppreference.com
m (r2.7.3) (Robot: Adding de, es, fr, it, ja, pt, ru, zh) |
(regularizing its name) |
||
| Line 8: | Line 8: | ||
}} | }} | ||
| − | + | {{tt|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 {{c|std::list}} this container provides more space efficient storage when bidirectional iteration is not needed. | |
{{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}}. | ||
Revision as of 18:06, 6 November 2012
| 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.
std::forward_list meets the requirements of Template:concept (except for the size() member function), Template:concept and Template:concept.
Contents |
