Difference between revisions of "cpp/container/forward list"
From cppreference.com
| Line 10: | Line 10: | ||
Forward 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 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. | Forward 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 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|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}}. |
===Member types=== | ===Member types=== | ||
Revision as of 17:34, 19 July 2012
| Defined in header <forward_list>
|
||
| template< class T, |
(since C++11) | |
Forward 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 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 |
