Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/container/forward list"

From cppreference.com
< cpp‎ | container
(+concepts)
m
Line 8: Line 8:
 
}}  
 
}}  
  
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 lists 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|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 14:36, 24 May 2012

Template:cpp/container/forward list/sidebar

Defined in header <forward_list>
template<

    class T,
    class Allocator = std::allocator<T>

> class forward_list;
(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

Member types

Template:tdcl list begin Template:tdcl list hitem Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list end

Member functions

Template:cpp/container/dcl list constructorTemplate:cpp/container/dcl list destructorTemplate:cpp/container/dcl list operator=Template:cpp/container/dcl list assignTemplate:cpp/container/dcl list get allocatorTemplate:cpp/container/dcl list frontTemplate:cpp/container/dcl list before beginTemplate:cpp/container/dcl list beginTemplate:cpp/container/dcl list endTemplate:cpp/container/dcl list emptyTemplate:cpp/container/dcl list max sizeTemplate:cpp/container/dcl list clearTemplate:cpp/container/dcl list insert afterTemplate:cpp/container/dcl list emplace afterTemplate:cpp/container/dcl list erase afterTemplate:cpp/container/dcl list push frontTemplate:cpp/container/dcl list emplace frontTemplate:cpp/container/dcl list pop frontTemplate:cpp/container/dcl list resizeTemplate:cpp/container/dcl list swapTemplate:cpp/container/dcl list mergeTemplate:cpp/container/dcl list splice afterTemplate:cpp/container/dcl list removeTemplate:cpp/container/dcl list reverseTemplate:cpp/container/dcl list uniqueTemplate:cpp/container/dcl list sort
Element access
Iterators
Capacity
Modifiers
Operations

Non-member functions

Template:cpp/container/dcl list operator cmpTemplate:cpp/container/dcl list swap2