C++ suggest change

std::forward_list

Introduction

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 a 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.

Remarks

Adding, removing and moving the elements within the list, or across several lists, does not invalidate the iterators currently referring to other elements in the list. However, an iterator or reference referring to an element is invalidated when the corresponding element is removed (via erase_after) from the list. std::forward_list meets the requirements of Container (except for the size member function and that operator==’s complexity is always linear), AllocatorAwareContainer and SequenceContainer.

Feedback about page:

Feedback:
Optional: your email if you want me to get back to you:

std::forward_list/
Example
Methods

Table Of Contents
35 std::forward_list
63 RAII
85 RTTI
  ↑ ↓ to navigate     ↵ to select     Esc to close