Namespaces
Variants
Views
Actions

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

From cppreference.com
< cpp‎ | container
m (Text replace - "{{dcl list begin}} {{dcl list h1 | Member functions}}" to "===Member functions=== {{dcl list begin}}")
m (Text replace - "{{tdcl list begin}} {{tdcl list h1 | Member types}}" to "===Member types=== {{tdcl list begin}}")
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 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 lists this container provides more space efficient storage, when bidirectional iteration is not needed.  
  
 +
===Member types===
 
{{tdcl list begin}}
 
{{tdcl list begin}}
−
{{tdcl list h1 | Member types}}
 
 
{{tdcl list hitem | Member type | Definition}}
 
{{tdcl list hitem | Member type | Definition}}
 
{{tdcl list template | cpp/container/tdcl list value_type | forward_list}}
 
{{tdcl list template | cpp/container/tdcl list value_type | forward_list}}

Revision as of 16:07, 18 August 2011

Template:cpp/container/forward list/sidebar

Defined in header <forward_list>
template<

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

> class forward_list;
 Template:mark c++11 feature

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.

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 remove ifTemplate:cpp/container/dcl list reverseTemplate:cpp/container/dcl list uniqueTemplate:cpp/container/dcl list sortTemplate:cpp/container/dcl list operator compTemplate:cpp/container/dcl list std swap
Element access
Iterators
Capacity
Modifiers
Operations

Non-member functions

Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/forward_list&oldid=9166"