<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.3"/>
<title>libstdc++: std::forward_list< _Tp, _Alloc > Class Template Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.3 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('a00666.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="summary">
<a href="#pub-types">Public Types</a> |
<a href="#pub-methods">Public Member Functions</a> |
<a href="#pri-methods">Private Member Functions</a> |
<a href="#pri-attribs">Private Attributes</a> |
<a href="a02859.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">std::forward_list< _Tp, _Alloc > Class Template Reference<div class="ingroups"><a class="el" href="a01625.html">Sequences</a></div></div> </div>
</div><!--header-->
<div class="contents">
<div class="dynheader">
Inheritance diagram for std::forward_list< _Tp, _Alloc >:</div>
<div class="dyncontent">
<div class="center"><img src="a02860.png" border="0" usemap="#std_1_1forward__list_3_01___tp_00_01___alloc_01_4_inherit__map" alt="Inheritance graph"/></div>
<map name="std_1_1forward__list_3_01___tp_00_01___alloc_01_4_inherit__map" id="std_1_1forward__list_3_01___tp_00_01___alloc_01_4_inherit__map">
<area shape="rect" id="node2" href="a00511.html" title="Base class for forward_list." alt="" coords="4,6,133,45"/></map>
<center><span class="legend">[<a target="top" href="graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr class="memitem:aeeb9e091f2ec71ac3ec43ae40ad23cdc"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="aeeb9e091f2ec71ac3ec43ae40ad23cdc"></a>
typedef _Alloc </td><td class="memItemRight" valign="bottom"><b>allocator_type</b></td></tr>
<tr class="separator:aeeb9e091f2ec71ac3ec43ae40ad23cdc"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8986dcf913e6fd9e9159b9e32972d064"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a8986dcf913e6fd9e9159b9e32972d064"></a>
typedef <br class="typebreak"/>
<a class="el" href="a00512.html">_Fwd_list_const_iterator</a>< _Tp > </td><td class="memItemRight" valign="bottom"><b>const_iterator</b></td></tr>
<tr class="separator:a8986dcf913e6fd9e9159b9e32972d064"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab351fd30e75e823dec0a6797db5619c8"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ab351fd30e75e823dec0a6797db5619c8"></a>
typedef <br class="typebreak"/>
_Tp_alloc_type::const_pointer </td><td class="memItemRight" valign="bottom"><b>const_pointer</b></td></tr>
<tr class="separator:ab351fd30e75e823dec0a6797db5619c8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a373009e512f4d1076b029b6611bdcdc6"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a373009e512f4d1076b029b6611bdcdc6"></a>
typedef <br class="typebreak"/>
_Tp_alloc_type::const_reference </td><td class="memItemRight" valign="bottom"><b>const_reference</b></td></tr>
<tr class="separator:a373009e512f4d1076b029b6611bdcdc6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:afb9fe5edb731512e042492ce69e0ab84"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="afb9fe5edb731512e042492ce69e0ab84"></a>
typedef std::ptrdiff_t </td><td class="memItemRight" valign="bottom"><b>difference_type</b></td></tr>
<tr class="separator:afb9fe5edb731512e042492ce69e0ab84"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2e5dfae1f90956c3d11d1e9810e69dfd"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a2e5dfae1f90956c3d11d1e9810e69dfd"></a>
typedef <a class="el" href="a00513.html">_Fwd_list_iterator</a>< _Tp > </td><td class="memItemRight" valign="bottom"><b>iterator</b></td></tr>
<tr class="separator:a2e5dfae1f90956c3d11d1e9810e69dfd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abcc40888e941a9669ec0d752603a97c5"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="abcc40888e941a9669ec0d752603a97c5"></a>
typedef _Tp_alloc_type::pointer </td><td class="memItemRight" valign="bottom"><b>pointer</b></td></tr>
<tr class="separator:abcc40888e941a9669ec0d752603a97c5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa99ea8d8fb0f90a1f537fbaec6c0d087"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="aa99ea8d8fb0f90a1f537fbaec6c0d087"></a>
typedef _Tp_alloc_type::reference </td><td class="memItemRight" valign="bottom"><b>reference</b></td></tr>
<tr class="separator:aa99ea8d8fb0f90a1f537fbaec6c0d087"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6e4d80899cdbf11e9d33980b19b033c6"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a6e4d80899cdbf11e9d33980b19b033c6"></a>
typedef std::size_t </td><td class="memItemRight" valign="bottom"><b>size_type</b></td></tr>
<tr class="separator:a6e4d80899cdbf11e9d33980b19b033c6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9402218544bbdc492896abf05081ff00"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a9402218544bbdc492896abf05081ff00"></a>
typedef _Tp </td><td class="memItemRight" valign="bottom"><b>value_type</b></td></tr>
<tr class="separator:a9402218544bbdc492896abf05081ff00"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a4ea6f76639b1ac20d4a9c7e0d5f1b455"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a4ea6f76639b1ac20d4a9c7e0d5f1b455">forward_list</a> (const _Alloc &__al=_Alloc())</td></tr>
<tr class="separator:a4ea6f76639b1ac20d4a9c7e0d5f1b455"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a43d0c48b0ef128ee0431be85c8fdd843"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a43d0c48b0ef128ee0431be85c8fdd843">forward_list</a> (const <a class="el" href="a00666.html">forward_list</a> &__list, const _Alloc &__al)</td></tr>
<tr class="separator:a43d0c48b0ef128ee0431be85c8fdd843"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa714c31e9321dc4960846f9960ff9be1"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#aa714c31e9321dc4960846f9960ff9be1">forward_list</a> (<a class="el" href="a00666.html">forward_list</a> &&__list, const _Alloc &__al)</td></tr>
<tr class="separator:aa714c31e9321dc4960846f9960ff9be1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac757182e9c04cf8ba20ac91e69a8a77c"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#ac757182e9c04cf8ba20ac91e69a8a77c">forward_list</a> (size_type __n)</td></tr>
<tr class="separator:ac757182e9c04cf8ba20ac91e69a8a77c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a81dc09fa341ed4c54da852f6a430bba2"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a81dc09fa341ed4c54da852f6a430bba2">forward_list</a> (size_type __n, const _Tp &__value, const _Alloc &__al=_Alloc())</td></tr>
<tr class="separator:a81dc09fa341ed4c54da852f6a430bba2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab34e93efd2528e818304a12847fffaee"><td class="memTemplParams" colspan="2">template<typename _InputIterator > </td></tr>
<tr class="memitem:ab34e93efd2528e818304a12847fffaee"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00666.html#ab34e93efd2528e818304a12847fffaee">forward_list</a> (_InputIterator __first, _InputIterator __last, const _Alloc &__al=_Alloc())</td></tr>
<tr class="separator:ab34e93efd2528e818304a12847fffaee"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a642ecbf961b6a99a7deb77e676e71cac"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a642ecbf961b6a99a7deb77e676e71cac">forward_list</a> (const <a class="el" href="a00666.html">forward_list</a> &__list)</td></tr>
<tr class="separator:a642ecbf961b6a99a7deb77e676e71cac"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a50ebbc7875934e6f5e5a0665deb2a263"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a50ebbc7875934e6f5e5a0665deb2a263">forward_list</a> (<a class="el" href="a00666.html">forward_list</a> &&__list) noexcept</td></tr>
<tr class="separator:a50ebbc7875934e6f5e5a0665deb2a263"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a925933047508f0bd16df276c4f0261e4"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a925933047508f0bd16df276c4f0261e4">forward_list</a> (<a class="el" href="a00727.html">std::initializer_list</a>< _Tp > __il, const _Alloc &__al=_Alloc())</td></tr>
<tr class="separator:a925933047508f0bd16df276c4f0261e4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a30c16633a2af635de7b7646ab8c29e46"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a30c16633a2af635de7b7646ab8c29e46">~forward_list</a> () noexcept</td></tr>
<tr class="separator:a30c16633a2af635de7b7646ab8c29e46"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a343dfbc665dcba46807c34b835fa02b5"><td class="memTemplParams" colspan="2">template<typename _InputIterator > </td></tr>
<tr class="memitem:a343dfbc665dcba46807c34b835fa02b5"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00666.html#a343dfbc665dcba46807c34b835fa02b5">assign</a> (_InputIterator __first, _InputIterator __last)</td></tr>
<tr class="separator:a343dfbc665dcba46807c34b835fa02b5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a834314c2bf6e162dab99f07f1d6c551d"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a834314c2bf6e162dab99f07f1d6c551d">assign</a> (size_type __n, const _Tp &__val)</td></tr>
<tr class="separator:a834314c2bf6e162dab99f07f1d6c551d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:adcaa8789d2741f6b65603b41c8aba63f"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#adcaa8789d2741f6b65603b41c8aba63f">assign</a> (<a class="el" href="a00727.html">std::initializer_list</a>< _Tp > __il)</td></tr>
<tr class="separator:adcaa8789d2741f6b65603b41c8aba63f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4becc964d2aa37c756215139094d8ff8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00513.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a4becc964d2aa37c756215139094d8ff8">before_begin</a> () noexcept</td></tr>
<tr class="separator:a4becc964d2aa37c756215139094d8ff8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1b8f8d9f8c5572304785f24529c297c6"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00512.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a1b8f8d9f8c5572304785f24529c297c6">before_begin</a> () const noexcept</td></tr>
<tr class="separator:a1b8f8d9f8c5572304785f24529c297c6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a141f3a112d865e3125cb105b429c2a63"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00513.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a141f3a112d865e3125cb105b429c2a63">begin</a> () noexcept</td></tr>
<tr class="separator:a141f3a112d865e3125cb105b429c2a63"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8913be197ae32ed6898686dfa3f1bfdf"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00512.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a8913be197ae32ed6898686dfa3f1bfdf">begin</a> () const noexcept</td></tr>
<tr class="separator:a8913be197ae32ed6898686dfa3f1bfdf"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8e747964c0b29e83f50020110f4b1d72"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00512.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a8e747964c0b29e83f50020110f4b1d72">cbefore_begin</a> () const noexcept</td></tr>
<tr class="separator:a8e747964c0b29e83f50020110f4b1d72"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ace31decae76d75133e08418f392a78b3"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00512.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#ace31decae76d75133e08418f392a78b3">cbegin</a> () const noexcept</td></tr>
<tr class="separator:ace31decae76d75133e08418f392a78b3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aaa651df81ec5161454becd5198407986"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00512.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#aaa651df81ec5161454becd5198407986">cend</a> () const noexcept</td></tr>
<tr class="separator:aaa651df81ec5161454becd5198407986"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa88c1d40b71b3724ca63da3b66d4a5e0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#aa88c1d40b71b3724ca63da3b66d4a5e0">clear</a> () noexcept</td></tr>
<tr class="separator:aa88c1d40b71b3724ca63da3b66d4a5e0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2feb7ce24255caa63a050e0db8bd0b81"><td class="memTemplParams" colspan="2">template<typename... _Args> </td></tr>
<tr class="memitem:a2feb7ce24255caa63a050e0db8bd0b81"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00513.html">iterator</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00666.html#a2feb7ce24255caa63a050e0db8bd0b81">emplace_after</a> (<a class="el" href="a00512.html">const_iterator</a> __pos, _Args &&...__args)</td></tr>
<tr class="separator:a2feb7ce24255caa63a050e0db8bd0b81"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5d2a4c75c633f66907ebadbafe3810f4"><td class="memTemplParams" colspan="2">template<typename... _Args> </td></tr>
<tr class="memitem:a5d2a4c75c633f66907ebadbafe3810f4"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00666.html#a5d2a4c75c633f66907ebadbafe3810f4">emplace_front</a> (_Args &&...__args)</td></tr>
<tr class="separator:a5d2a4c75c633f66907ebadbafe3810f4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab0a3479429315d1735f3d6b15817b01e"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#ab0a3479429315d1735f3d6b15817b01e">empty</a> () const noexcept</td></tr>
<tr class="separator:ab0a3479429315d1735f3d6b15817b01e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7f64feff678dd8cb85d35bd9b08fde54"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00513.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a7f64feff678dd8cb85d35bd9b08fde54">end</a> () noexcept</td></tr>
<tr class="separator:a7f64feff678dd8cb85d35bd9b08fde54"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9a320037c76fc8f0e6f60784dcec1383"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00512.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a9a320037c76fc8f0e6f60784dcec1383">end</a> () const noexcept</td></tr>
<tr class="separator:a9a320037c76fc8f0e6f60784dcec1383"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a369164fbcb598a49bbd7297eb6f2c5b0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00513.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a369164fbcb598a49bbd7297eb6f2c5b0">erase_after</a> (<a class="el" href="a00512.html">const_iterator</a> __pos)</td></tr>
<tr class="separator:a369164fbcb598a49bbd7297eb6f2c5b0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa779e251eac11a2d84fa9a2b65921bae"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00513.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#aa779e251eac11a2d84fa9a2b65921bae">erase_after</a> (<a class="el" href="a00512.html">const_iterator</a> __pos, <a class="el" href="a00512.html">const_iterator</a> __last)</td></tr>
<tr class="separator:aa779e251eac11a2d84fa9a2b65921bae"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa2daca181da8d9a22ecc19e4a7364b1f"><td class="memItemLeft" align="right" valign="top">reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#aa2daca181da8d9a22ecc19e4a7364b1f">front</a> ()</td></tr>
<tr class="separator:aa2daca181da8d9a22ecc19e4a7364b1f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3e6371e588094bd3278608c0e732cac4"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a3e6371e588094bd3278608c0e732cac4">front</a> () const </td></tr>
<tr class="separator:a3e6371e588094bd3278608c0e732cac4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab66a5f239cf5fe9431700b756e711b4a"><td class="memItemLeft" align="right" valign="top">allocator_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#ab66a5f239cf5fe9431700b756e711b4a">get_allocator</a> () const noexcept</td></tr>
<tr class="separator:ab66a5f239cf5fe9431700b756e711b4a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6f8e1063932912fb3e245b7c8116ed1f"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00513.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a6f8e1063932912fb3e245b7c8116ed1f">insert_after</a> (<a class="el" href="a00512.html">const_iterator</a> __pos, const _Tp &__val)</td></tr>
<tr class="separator:a6f8e1063932912fb3e245b7c8116ed1f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:acde2adcdc4a7398d0179a9acd9933dd0"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="acde2adcdc4a7398d0179a9acd9933dd0"></a>
<a class="el" href="a00513.html">iterator</a> </td><td class="memItemRight" valign="bottom"><b>insert_after</b> (<a class="el" href="a00512.html">const_iterator</a> __pos, _Tp &&__val)</td></tr>
<tr class="separator:acde2adcdc4a7398d0179a9acd9933dd0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4921af283fd230d563266ca0ce14a455"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00513.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a4921af283fd230d563266ca0ce14a455">insert_after</a> (<a class="el" href="a00512.html">const_iterator</a> __pos, size_type __n, const _Tp &__val)</td></tr>
<tr class="separator:a4921af283fd230d563266ca0ce14a455"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa13fa60094712eb047dcb4653b0ed95e"><td class="memTemplParams" colspan="2">template<typename _InputIterator > </td></tr>
<tr class="memitem:aa13fa60094712eb047dcb4653b0ed95e"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00513.html">iterator</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00666.html#aa13fa60094712eb047dcb4653b0ed95e">insert_after</a> (<a class="el" href="a00512.html">const_iterator</a> __pos, _InputIterator __first, _InputIterator __last)</td></tr>
<tr class="separator:aa13fa60094712eb047dcb4653b0ed95e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9739cbb5af18ac9976288f6c9c072bb0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00513.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a9739cbb5af18ac9976288f6c9c072bb0">insert_after</a> (<a class="el" href="a00512.html">const_iterator</a> __pos, <a class="el" href="a00727.html">std::initializer_list</a>< _Tp > __il)</td></tr>
<tr class="separator:a9739cbb5af18ac9976288f6c9c072bb0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae19c74808b1bc8e53bdc229fd3d389fa"><td class="memItemLeft" align="right" valign="top">size_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#ae19c74808b1bc8e53bdc229fd3d389fa">max_size</a> () const noexcept</td></tr>
<tr class="separator:ae19c74808b1bc8e53bdc229fd3d389fa"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4794e46af448c443019e9b36640744ab"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a4794e46af448c443019e9b36640744ab">merge</a> (<a class="el" href="a00666.html">forward_list</a> &&__list)</td></tr>
<tr class="separator:a4794e46af448c443019e9b36640744ab"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0e2e8369ed2d6b846842cd6f153d6745"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a0e2e8369ed2d6b846842cd6f153d6745"></a>
void </td><td class="memItemRight" valign="bottom"><b>merge</b> (<a class="el" href="a00666.html">forward_list</a> &__list)</td></tr>
<tr class="separator:a0e2e8369ed2d6b846842cd6f153d6745"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0de7b075b73cc0a843447ad75cba4b87"><td class="memTemplParams" colspan="2">template<typename _Comp > </td></tr>
<tr class="memitem:a0de7b075b73cc0a843447ad75cba4b87"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00666.html#a0de7b075b73cc0a843447ad75cba4b87">merge</a> (<a class="el" href="a00666.html">forward_list</a> &&__list, _Comp __comp)</td></tr>
<tr class="separator:a0de7b075b73cc0a843447ad75cba4b87"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a21960d00c20f7c502b03727f38a95510"><td class="memTemplParams" colspan="2"><a class="anchor" id="a21960d00c20f7c502b03727f38a95510"></a>
template<typename _Comp > </td></tr>
<tr class="memitem:a21960d00c20f7c502b03727f38a95510"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>merge</b> (<a class="el" href="a00666.html">forward_list</a> &__list, _Comp __comp)</td></tr>
<tr class="separator:a21960d00c20f7c502b03727f38a95510"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a78c1273fb53228cab655addd77f9cd25"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00666.html">forward_list</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a78c1273fb53228cab655addd77f9cd25">operator=</a> (const <a class="el" href="a00666.html">forward_list</a> &__list)</td></tr>
<tr class="separator:a78c1273fb53228cab655addd77f9cd25"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad51349eb5e8727d7726b2ebdc14d3306"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00666.html">forward_list</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#ad51349eb5e8727d7726b2ebdc14d3306">operator=</a> (<a class="el" href="a00666.html">forward_list</a> &&__list)</td></tr>
<tr class="separator:ad51349eb5e8727d7726b2ebdc14d3306"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6b8dfcf0c3aad308699e909186c39f2b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00666.html">forward_list</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a6b8dfcf0c3aad308699e909186c39f2b">operator=</a> (<a class="el" href="a00727.html">std::initializer_list</a>< _Tp > __il)</td></tr>
<tr class="separator:a6b8dfcf0c3aad308699e909186c39f2b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ace75c01c591425341e21b6404e7f9e90"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#ace75c01c591425341e21b6404e7f9e90">pop_front</a> ()</td></tr>
<tr class="separator:ace75c01c591425341e21b6404e7f9e90"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac2d708075d40071265f0a376591ba1d7"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#ac2d708075d40071265f0a376591ba1d7">push_front</a> (const _Tp &__val)</td></tr>
<tr class="separator:ac2d708075d40071265f0a376591ba1d7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a164e352752ccca11cddb4270ea9df360"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a164e352752ccca11cddb4270ea9df360"></a>
void </td><td class="memItemRight" valign="bottom"><b>push_front</b> (_Tp &&__val)</td></tr>
<tr class="separator:a164e352752ccca11cddb4270ea9df360"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aea8b894eab1beaf02326b7c118bc5c5c"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#aea8b894eab1beaf02326b7c118bc5c5c">remove</a> (const _Tp &__val)</td></tr>
<tr class="separator:aea8b894eab1beaf02326b7c118bc5c5c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab4f0f2dbdbfbd38a94a2241ccfe6c3d8"><td class="memTemplParams" colspan="2">template<typename _Pred > </td></tr>
<tr class="memitem:ab4f0f2dbdbfbd38a94a2241ccfe6c3d8"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00666.html#ab4f0f2dbdbfbd38a94a2241ccfe6c3d8">remove_if</a> (_Pred __pred)</td></tr>
<tr class="separator:ab4f0f2dbdbfbd38a94a2241ccfe6c3d8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a73ffca07b591237200b852caf7040057"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a73ffca07b591237200b852caf7040057">resize</a> (size_type __sz)</td></tr>
<tr class="separator:a73ffca07b591237200b852caf7040057"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abfb248e17d0392a8caf5c46683102332"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#abfb248e17d0392a8caf5c46683102332">resize</a> (size_type __sz, const value_type &__val)</td></tr>
<tr class="separator:abfb248e17d0392a8caf5c46683102332"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2ab1413dfa1c6858634407a44504a368"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a2ab1413dfa1c6858634407a44504a368">reverse</a> () noexcept</td></tr>
<tr class="separator:a2ab1413dfa1c6858634407a44504a368"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4bb37711f3350692a1246d7781967ea6"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a4bb37711f3350692a1246d7781967ea6">sort</a> ()</td></tr>
<tr class="separator:a4bb37711f3350692a1246d7781967ea6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3f59eaf1f58f480eafa906d68d408682"><td class="memTemplParams" colspan="2">template<typename _Comp > </td></tr>
<tr class="memitem:a3f59eaf1f58f480eafa906d68d408682"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00666.html#a3f59eaf1f58f480eafa906d68d408682">sort</a> (_Comp __comp)</td></tr>
<tr class="separator:a3f59eaf1f58f480eafa906d68d408682"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a53944489ea030ef467cf9e2f0defd1c0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a53944489ea030ef467cf9e2f0defd1c0">splice_after</a> (<a class="el" href="a00512.html">const_iterator</a> __pos, <a class="el" href="a00666.html">forward_list</a> &&__list)</td></tr>
<tr class="separator:a53944489ea030ef467cf9e2f0defd1c0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a070d8169f10978ed4d9cfcb23a0f99af"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a070d8169f10978ed4d9cfcb23a0f99af"></a>
void </td><td class="memItemRight" valign="bottom"><b>splice_after</b> (<a class="el" href="a00512.html">const_iterator</a> __pos, <a class="el" href="a00666.html">forward_list</a> &__list)</td></tr>
<tr class="separator:a070d8169f10978ed4d9cfcb23a0f99af"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8fa1931f312fd4ab822a8fe610ce3107"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a8fa1931f312fd4ab822a8fe610ce3107">splice_after</a> (<a class="el" href="a00512.html">const_iterator</a> __pos, <a class="el" href="a00666.html">forward_list</a> &&__list, <a class="el" href="a00512.html">const_iterator</a> __i)</td></tr>
<tr class="separator:a8fa1931f312fd4ab822a8fe610ce3107"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a93314c0f3652146ebc296598454866c3"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a93314c0f3652146ebc296598454866c3"></a>
void </td><td class="memItemRight" valign="bottom"><b>splice_after</b> (<a class="el" href="a00512.html">const_iterator</a> __pos, <a class="el" href="a00666.html">forward_list</a> &__list, <a class="el" href="a00512.html">const_iterator</a> __i)</td></tr>
<tr class="separator:a93314c0f3652146ebc296598454866c3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a048f9cd9ea4fae7eca3eba2564deb94e"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a048f9cd9ea4fae7eca3eba2564deb94e">splice_after</a> (<a class="el" href="a00512.html">const_iterator</a> __pos, <a class="el" href="a00666.html">forward_list</a> &&, <a class="el" href="a00512.html">const_iterator</a> __before, <a class="el" href="a00512.html">const_iterator</a> __last)</td></tr>
<tr class="separator:a048f9cd9ea4fae7eca3eba2564deb94e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:afa6864097a037cc63f6521ecf506a524"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="afa6864097a037cc63f6521ecf506a524"></a>
void </td><td class="memItemRight" valign="bottom"><b>splice_after</b> (<a class="el" href="a00512.html">const_iterator</a> __pos, <a class="el" href="a00666.html">forward_list</a> &, <a class="el" href="a00512.html">const_iterator</a> __before, <a class="el" href="a00512.html">const_iterator</a> __last)</td></tr>
<tr class="separator:afa6864097a037cc63f6521ecf506a524"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a64729c5eb3469e110bf4b2f1a11e9bec"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a64729c5eb3469e110bf4b2f1a11e9bec">swap</a> (<a class="el" href="a00666.html">forward_list</a> &__list)</td></tr>
<tr class="separator:a64729c5eb3469e110bf4b2f1a11e9bec"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a19e7b4dff2a67a168cc39712a9372c43"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00666.html#a19e7b4dff2a67a168cc39712a9372c43">unique</a> ()</td></tr>
<tr class="separator:a19e7b4dff2a67a168cc39712a9372c43"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1daa70e14ec845a288cec10962d3585b"><td class="memTemplParams" colspan="2">template<typename _BinPred > </td></tr>
<tr class="memitem:a1daa70e14ec845a288cec10962d3585b"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00666.html#a1daa70e14ec845a288cec10962d3585b">unique</a> (_BinPred __binary_pred)</td></tr>
<tr class="separator:a1daa70e14ec845a288cec10962d3585b"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:a849da4c7e9124a1bb290221afb73a0f4"><td class="memTemplParams" colspan="2"><a class="anchor" id="a849da4c7e9124a1bb290221afb73a0f4"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:a849da4c7e9124a1bb290221afb73a0f4"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00514.html">_Node</a> * </td><td class="memTemplItemRight" valign="bottom"><b>_M_create_node</b> (_Args &&...__args)</td></tr>
<tr class="separator:a849da4c7e9124a1bb290221afb73a0f4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a80f8d69b4600fa7dfdd7d0293124ba49"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a80f8d69b4600fa7dfdd7d0293124ba49"></a>
<a class="el" href="a00515.html">_Fwd_list_node_base</a> * </td><td class="memItemRight" valign="bottom"><b>_M_erase_after</b> (<a class="el" href="a00515.html">_Fwd_list_node_base</a> *__pos)</td></tr>
<tr class="separator:a80f8d69b4600fa7dfdd7d0293124ba49"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa7322642fe384de82cc11892c62eb486"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="aa7322642fe384de82cc11892c62eb486"></a>
<a class="el" href="a00515.html">_Fwd_list_node_base</a> * </td><td class="memItemRight" valign="bottom"><b>_M_erase_after</b> (<a class="el" href="a00515.html">_Fwd_list_node_base</a> *__pos, <a class="el" href="a00515.html">_Fwd_list_node_base</a> *__last)</td></tr>
<tr class="separator:aa7322642fe384de82cc11892c62eb486"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8ace28b7c09c640ff2c7732c70c0fd44"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a8ace28b7c09c640ff2c7732c70c0fd44"></a>
<a class="el" href="a00514.html">_Node</a> * </td><td class="memItemRight" valign="bottom"><b>_M_get_node</b> ()</td></tr>
<tr class="separator:a8ace28b7c09c640ff2c7732c70c0fd44"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a116b9556f3c78e3955602e581f6f5114"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a116b9556f3c78e3955602e581f6f5114"></a>
_Node_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Node_allocator</b> () noexcept</td></tr>
<tr class="separator:a116b9556f3c78e3955602e581f6f5114"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a12700940821979ac842e0e03db5fb035"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a12700940821979ac842e0e03db5fb035"></a>
const _Node_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Node_allocator</b> () const noexcept</td></tr>
<tr class="separator:a12700940821979ac842e0e03db5fb035"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a92b5ff02908fdb1ac2db9c65a44f430a"><td class="memTemplParams" colspan="2"><a class="anchor" id="a92b5ff02908fdb1ac2db9c65a44f430a"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:a92b5ff02908fdb1ac2db9c65a44f430a"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00515.html">_Fwd_list_node_base</a> * </td><td class="memTemplItemRight" valign="bottom"><b>_M_insert_after</b> (<a class="el" href="a00512.html">const_iterator</a> __pos, _Args &&...__args)</td></tr>
<tr class="separator:a92b5ff02908fdb1ac2db9c65a44f430a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae0f51315083912d93235f6b381f78fc7"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ae0f51315083912d93235f6b381f78fc7"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_put_node</b> (<a class="el" href="a00514.html">_Node</a> *__p)</td></tr>
<tr class="separator:ae0f51315083912d93235f6b381f78fc7"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:ac6bf6f00098525035160524e1a865fd3"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ac6bf6f00098525035160524e1a865fd3"></a>
_Fwd_list_impl </td><td class="memItemRight" valign="bottom"><b>_M_impl</b></td></tr>
<tr class="separator:ac6bf6f00098525035160524e1a865fd3"><td class="memSeparator" colspan="2"> </td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><h3>template<typename _Tp, typename _Alloc = allocator<_Tp>><br/>
class std::forward_list< _Tp, _Alloc ></h3>
<p>A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence. </p>
<p>Meets the requirements of a <a href="tables.html#65">container</a>, a <a href="tables.html#67">sequence</a>, including the <a href="tables.html#68">optional sequence requirements</a> with the exception of <code>at</code> and <code>operator</code>[].</p>
<p>This is a <em>singly</em> <em>linked</em> list. Traversal up the list requires linear time, but adding and removing elements (or <em>nodes</em>) is done in constant time, regardless of where the change takes place. Unlike <a class="el" href="a00957.html" title="A standard container which offers fixed time access to individual elements in any order...">std::vector</a> and <a class="el" href="a00646.html" title="A standard container using fixed-size memory allocation and constant-time manipulation of elements at...">std::deque</a>, random-access iterators are not provided, so subscripting ( <code></code>[] ) access is not allowed. For algorithms which only need sequential access, this lack makes no difference.</p>
<p>Also unlike the other standard containers, <a class="el" href="a00666.html" title="A standard container with linear time access to elements, and fixed time insertion/deletion at any po...">std::forward_list</a> provides specialized algorithms unique to linked lists, such as splicing, sorting, and in-place reversal.</p>
<p>A couple points on memory allocation for forward_list<Tp>:</p>
<p>First, we never actually allocate a Tp, we allocate Fwd_list_node<Tp>'s and trust [20.1.5]/4 to DTRT. This is to ensure that after elements from forward_list<X,Alloc1> are spliced into forward_list<X,Alloc2>, destroying the memory of the second list is a valid operation, i.e., Alloc1 giveth and Alloc2 taketh away. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00405">405</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
<a class="anchor" id="a4ea6f76639b1ac20d4a9c7e0d5f1b455"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::<a class="el" href="a00666.html">forward_list</a> </td>
<td>(</td>
<td class="paramtype">const _Alloc & </td>
<td class="paramname"><em>__al</em> = <code>_Alloc()</code></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates a forward_list with no elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__al</td><td>An allocator object. </td></tr>
</table>
</dd>
</dl>
<p>Definition at line <a class="el" href="a01196_source.html#l00435">435</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a43d0c48b0ef128ee0431be85c8fdd843"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::<a class="el" href="a00666.html">forward_list</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__list</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const _Alloc & </td>
<td class="paramname"><em>__al</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Copy constructor with allocator argument. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__list</td><td>Input list to copy. </td></tr>
<tr><td class="paramname">__al</td><td>An allocator object. </td></tr>
</table>
</dd>
</dl>
<p>Definition at line <a class="el" href="a01196_source.html#l00444">444</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="aa714c31e9321dc4960846f9960ff9be1"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::<a class="el" href="a00666.html">forward_list</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__list</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const _Alloc & </td>
<td class="paramname"><em>__al</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Move constructor with allocator argument. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__list</td><td>Input list to move. </td></tr>
<tr><td class="paramname">__al</td><td>An allocator object. </td></tr>
</table>
</dd>
</dl>
<p>Definition at line <a class="el" href="a01196_source.html#l00453">453</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="ac757182e9c04cf8ba20ac91e69a8a77c"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::<a class="el" href="a00666.html">forward_list</a> </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates a forward_list with default constructed elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The number of elements to initially create.</td></tr>
</table>
</dd>
</dl>
<p>This constructor creates the forward_list with <em>__n</em> default constructed elements. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00465">465</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a81dc09fa341ed4c54da852f6a430bba2"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::<a class="el" href="a00666.html">forward_list</a> </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const _Tp & </td>
<td class="paramname"><em>__value</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const _Alloc & </td>
<td class="paramname"><em>__al</em> = <code>_Alloc()</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates a forward_list with copies of an exemplar element. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The number of elements to initially create. </td></tr>
<tr><td class="paramname">__value</td><td>An element to copy. </td></tr>
<tr><td class="paramname">__al</td><td>An allocator object.</td></tr>
</table>
</dd>
</dl>
<p>This constructor fills the forward_list with <em>__n</em> copies of <em>__value</em>. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00478">478</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="ab34e93efd2528e818304a12847fffaee"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<div class="memtemplate">
template<typename _InputIterator > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::<a class="el" href="a00666.html">forward_list</a> </td>
<td>(</td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const _Alloc & </td>
<td class="paramname"><em>__al</em> = <code>_Alloc()</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Builds a forward_list from a range. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>An input iterator. </td></tr>
<tr><td class="paramname">__last</td><td>An input iterator. </td></tr>
<tr><td class="paramname">__al</td><td>An allocator object.</td></tr>
</table>
</dd>
</dl>
<p>Create a forward_list consisting of copies of the elements from [<em>__first</em>,<em>__last</em>). This is linear in N (where N is distance(<em>__first</em>,<em>__last</em>)). </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00494">494</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a642ecbf961b6a99a7deb77e676e71cac"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::<a class="el" href="a00666.html">forward_list</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__list</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>The forward_list copy constructor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__list</td><td>A forward_list of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>The newly-created forward_list uses a copy of the allocation object used by <em>__list</em>. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00511">511</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>References <a class="el" href="a01196_source.html#l00672">std::forward_list< _Tp, _Alloc >::begin()</a>, and <a class="el" href="a01196_source.html#l00690">std::forward_list< _Tp, _Alloc >::end()</a>.</p>
</div>
</div>
<a class="anchor" id="a50ebbc7875934e6f5e5a0665deb2a263"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::<a class="el" href="a00666.html">forward_list</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__list</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>The forward_list move constructor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__list</td><td>A forward_list of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>The newly-created forward_list contains the exact contents of <em><a class="el" href="a00666.html" title="A standard container with linear time access to elements, and fixed time insertion/deletion at any po...">forward_list</a></em>. The contents of <em>__list</em> are a valid, but unspecified forward_list. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00524">524</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a925933047508f0bd16df276c4f0261e4"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::<a class="el" href="a00666.html">forward_list</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00727.html">std::initializer_list</a>< _Tp > </td>
<td class="paramname"><em>__il</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const _Alloc & </td>
<td class="paramname"><em>__al</em> = <code>_Alloc()</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Builds a forward_list from an <a class="el" href="a00727.html" title="initializer_list">initializer_list</a>. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__il</td><td>An <a class="el" href="a00727.html" title="initializer_list">initializer_list</a> of value_type. </td></tr>
<tr><td class="paramname">__al</td><td>An allocator object.</td></tr>
</table>
</dd>
</dl>
<p>Create a forward_list consisting of copies of the elements in the <a class="el" href="a00727.html" title="initializer_list">initializer_list</a> <em>__il</em>. This is linear in <a class="el" href="a01604.html#a07a6b1e7078b72c0ddd334fe26bd349f" title="Returns the total number of bits.">__il.size()</a>. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00535">535</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a30c16633a2af635de7b7646ab8c29e46"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::~<a class="el" href="a00666.html">forward_list</a> </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>The <a class="el" href="a00666.html" title="A standard container with linear time access to elements, and fixed time insertion/deletion at any po...">forward_list</a> dtor. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00543">543</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a class="anchor" id="a343dfbc665dcba46807c34b835fa02b5"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<div class="memtemplate">
template<typename _InputIterator > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::assign </td>
<td>(</td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__last</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Assigns a range to a forward_list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>An input iterator. </td></tr>
<tr><td class="paramname">__last</td><td>An input iterator.</td></tr>
</table>
</dd>
</dl>
<p>This function fills a forward_list with copies of the elements in the range [<em>__first</em>,<em>__last</em>).</p>
<p>Note that the assignment completely changes the forward_list and that the number of elements of the resulting forward_list's is the same as the number of elements assigned. Old data is lost. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00605">605</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>References <a class="el" href="a01196_source.html#l00717">std::forward_list< _Tp, _Alloc >::cbefore_begin()</a>, <a class="el" href="a01196_source.html#l01023">std::forward_list< _Tp, _Alloc >::clear()</a>, and <a class="el" href="a01196_source.html#l00856">std::forward_list< _Tp, _Alloc >::insert_after()</a>.</p>
<p>Referenced by <a class="el" href="a01196_source.html#l00585">std::forward_list< _Tp, _Alloc >::operator=()</a>.</p>
</div>
</div>
<a class="anchor" id="a834314c2bf6e162dab99f07f1d6c551d"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::assign </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const _Tp & </td>
<td class="paramname"><em>__val</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Assigns a given value to a forward_list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>Number of elements to be assigned. </td></tr>
<tr><td class="paramname">__val</td><td>Value to be assigned.</td></tr>
</table>
</dd>
</dl>
<p>This function fills a forward_list with <em>__n</em> copies of the given value. Note that the assignment completely changes the forward_list, and that the resulting forward_list has __n elements. Old data is lost. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00622">622</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>References <a class="el" href="a01196_source.html#l00717">std::forward_list< _Tp, _Alloc >::cbefore_begin()</a>, <a class="el" href="a01196_source.html#l01023">std::forward_list< _Tp, _Alloc >::clear()</a>, and <a class="el" href="a01196_source.html#l00856">std::forward_list< _Tp, _Alloc >::insert_after()</a>.</p>
</div>
</div>
<a class="anchor" id="adcaa8789d2741f6b65603b41c8aba63f"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::assign </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00727.html">std::initializer_list</a>< _Tp > </td>
<td class="paramname"><em>__il</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Assigns an <a class="el" href="a00727.html" title="initializer_list">initializer_list</a> to a forward_list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__il</td><td>An <a class="el" href="a00727.html" title="initializer_list">initializer_list</a> of value_type.</td></tr>
</table>
</dd>
</dl>
<p>Replace the contents of the forward_list with copies of the elements in the <a class="el" href="a00727.html" title="initializer_list">initializer_list</a> <em>__il</em>. This is linear in <a class="el" href="a01604.html#a07a6b1e7078b72c0ddd334fe26bd349f" title="Returns the total number of bits.">il.size()</a>. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00637">637</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>References <a class="el" href="a01196_source.html#l00717">std::forward_list< _Tp, _Alloc >::cbefore_begin()</a>, <a class="el" href="a01196_source.html#l01023">std::forward_list< _Tp, _Alloc >::clear()</a>, and <a class="el" href="a01196_source.html#l00856">std::forward_list< _Tp, _Alloc >::insert_after()</a>.</p>
</div>
</div>
<a class="anchor" id="a4becc964d2aa37c756215139094d8ff8"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00513.html">iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::before_begin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read/write iterator that points before the first element in the forward_list. Iteration is done in ordinary element order. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00655">655</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>Referenced by <a class="el" href="a01197_source.html#l00264">std::forward_list< _Tp, _Alloc >::insert_after()</a>.</p>
</div>
</div>
<a class="anchor" id="a1b8f8d9f8c5572304785f24529c297c6"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00512.html">const_iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::before_begin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator that points before the first element in the forward_list. Iteration is done in ordinary element order. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00664">664</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a141f3a112d865e3125cb105b429c2a63"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00513.html">iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::begin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read/write iterator that points to the first element in the forward_list. Iteration is done in ordinary element order. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00672">672</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>Referenced by <a class="el" href="a01196_source.html#l00511">std::forward_list< _Tp, _Alloc >::forward_list()</a>.</p>
</div>
</div>
<a class="anchor" id="a8913be197ae32ed6898686dfa3f1bfdf"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00512.html">const_iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::begin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator that points to the first element in the forward_list. Iteration is done in ordinary element order. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00681">681</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a8e747964c0b29e83f50020110f4b1d72"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00512.html">const_iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::cbefore_begin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator that points before the first element in the forward_list. Iteration is done in ordinary element order. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00717">717</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>Referenced by <a class="el" href="a01196_source.html#l00605">std::forward_list< _Tp, _Alloc >::assign()</a>, <a class="el" href="a01196_source.html#l00783">std::forward_list< _Tp, _Alloc >::emplace_front()</a>, and <a class="el" href="a01196_source.html#l00798">std::forward_list< _Tp, _Alloc >::push_front()</a>.</p>
</div>
</div>
<a class="anchor" id="ace31decae76d75133e08418f392a78b3"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00512.html">const_iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::cbegin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator that points to the first element in the forward_list. Iteration is done in ordinary element order. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00708">708</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>Referenced by <a class="el" href="a01197_source.html#l00145">std::forward_list< _Tp, _Alloc >::operator=()</a>, and <a class="el" href="a01197_source.html#l00380">std::operator==()</a>.</p>
</div>
</div>
<a class="anchor" id="aaa651df81ec5161454becd5198407986"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00512.html">const_iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::cend </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator that points one past the last element in the forward_list. Iteration is done in ordinary element order. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00726">726</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>Referenced by <a class="el" href="a01197_source.html#l00145">std::forward_list< _Tp, _Alloc >::operator=()</a>, and <a class="el" href="a01197_source.html#l00380">std::operator==()</a>.</p>
</div>
</div>
<a class="anchor" id="aa88c1d40b71b3724ca63da3b66d4a5e0"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::clear </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Erases all the elements. </p>
<p>Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l01023">1023</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>Referenced by <a class="el" href="a01196_source.html#l00605">std::forward_list< _Tp, _Alloc >::assign()</a>, and <a class="el" href="a01196_source.html#l00567">std::forward_list< _Tp, _Alloc >::operator=()</a>.</p>
</div>
</div>
<a class="anchor" id="a2feb7ce24255caa63a050e0db8bd0b81"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<div class="memtemplate">
template<typename... _Args> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00513.html">iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::emplace_after </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__pos</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_Args &&... </td>
<td class="paramname"><em>__args</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Constructs object in forward_list after the specified iterator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__pos</td><td>A const_iterator into the forward_list. </td></tr>
<tr><td class="paramname">__args</td><td>Arguments. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator that points to the inserted data.</dd></dl>
<p>This function will insert an object of type T constructed with T(std::forward<Args>(args)...) after the specified location. Due to the nature of a forward_list this operation can be done in constant time, and does not invalidate iterators and references. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00839">839</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a5d2a4c75c633f66907ebadbafe3810f4"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<div class="memtemplate">
template<typename... _Args> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::emplace_front </td>
<td>(</td>
<td class="paramtype">_Args &&... </td>
<td class="paramname"><em>__args</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Constructs object in forward_list at the front of the list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__args</td><td>Arguments.</td></tr>
</table>
</dd>
</dl>
<p>This function will insert an object of type Tp constructed with Tp(std::forward<Args>(args)...) at the front of the list Due to the nature of a forward_list this operation can be done in constant time, and does not invalidate iterators and references. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00783">783</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>References <a class="el" href="a01196_source.html#l00717">std::forward_list< _Tp, _Alloc >::cbefore_begin()</a>.</p>
</div>
</div>
<a class="anchor" id="ab0a3479429315d1735f3d6b15817b01e"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::empty </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns true if the forward_list is empty. (Thus <a class="el" href="a00666.html#a141f3a112d865e3125cb105b429c2a63">begin()</a> would equal <a class="el" href="a00666.html#a7f64feff678dd8cb85d35bd9b08fde54">end()</a>.) </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00734">734</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>Referenced by <a class="el" href="a01197_source.html#l00279">std::forward_list< _Tp, _Alloc >::insert_after()</a>.</p>
</div>
</div>
<a class="anchor" id="a7f64feff678dd8cb85d35bd9b08fde54"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00513.html">iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::end </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read/write iterator that points one past the last element in the forward_list. Iteration is done in ordinary element order. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00690">690</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>Referenced by <a class="el" href="a01196_source.html#l00511">std::forward_list< _Tp, _Alloc >::forward_list()</a>, and <a class="el" href="a01197_source.html#l00264">std::forward_list< _Tp, _Alloc >::insert_after()</a>.</p>
</div>
</div>
<a class="anchor" id="a9a320037c76fc8f0e6f60784dcec1383"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00512.html">const_iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::end </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only iterator that points one past the last element in the forward_list. Iteration is done in ordinary element order. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00699">699</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a369164fbcb598a49bbd7297eb6f2c5b0"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00513.html">iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::erase_after </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__pos</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Removes the element pointed to by the iterator following <code>pos</code>. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__pos</td><td>Iterator pointing before element to be erased. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the element following the one that was erased, or <a class="el" href="a00666.html#a7f64feff678dd8cb85d35bd9b08fde54">end()</a> if no such element exists.</dd></dl>
<p>This function will erase the element at the given position and thus shorten the forward_list by one.</p>
<p>Due to the nature of a forward_list this operation can be done in constant time, and only invalidates iterators/references to the element being removed. The user is also cautioned that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00941">941</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="aa779e251eac11a2d84fa9a2b65921bae"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00513.html">iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::erase_after </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__pos</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__last</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Remove a range of elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__pos</td><td>Iterator pointing before the first element to be erased. </td></tr>
<tr><td class="paramname">__last</td><td>Iterator pointing to one past the last element to be erased. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>@ __last.</dd></dl>
<p>This function will erase the elements in the range <em></em>(__pos,__last) and shorten the forward_list accordingly.</p>
<p>This operation is linear time in the size of the range and only invalidates iterators/references to the element being removed. The user is also cautioned that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00964">964</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="aa2daca181da8d9a22ecc19e4a7364b1f"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">reference <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::front </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read/write reference to the data at the first element of the forward_list. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00751">751</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a3e6371e588094bd3278608c0e732cac4"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">const_reference <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::front </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) reference to the data at the first element of the forward_list. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00762">762</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="ab66a5f239cf5fe9431700b756e711b4a"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">allocator_type <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::get_allocator </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Get a copy of the memory allocation object. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00645">645</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a6f8e1063932912fb3e245b7c8116ed1f"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00513.html">iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::insert_after </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__pos</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const _Tp & </td>
<td class="paramname"><em>__val</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts given value into forward_list after specified iterator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__pos</td><td>An iterator into the forward_list. </td></tr>
<tr><td class="paramname">__val</td><td>Data to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator that points to the inserted data.</dd></dl>
<p>This function will insert a copy of the given value after the specified location. Due to the nature of a forward_list this operation can be done in constant time, and does not invalidate iterators and references. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00856">856</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>Referenced by <a class="el" href="a01196_source.html#l00605">std::forward_list< _Tp, _Alloc >::assign()</a>.</p>
</div>
</div>
<a class="anchor" id="a4921af283fd230d563266ca0ce14a455"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc >::<a class="el" href="a00513.html">iterator</a> forward_list::insert_after </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__pos</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const _Tp & </td>
<td class="paramname"><em>__val</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts a number of copies of given data into the forward_list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__pos</td><td>An iterator into the forward_list. </td></tr>
<tr><td class="paramname">__n</td><td>Number of elements to be inserted. </td></tr>
<tr><td class="paramname">__val</td><td>Data to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the last inserted copy of <em>val</em> or <em>pos</em> if <em>n</em> == 0.</dd></dl>
<p>This function will insert a specified number of copies of the given data after the location specified by <em>pos</em>.</p>
<p>This operation is linear in the number of elements inserted and does not invalidate iterators and references. </p>
<p>Definition at line <a class="el" href="a01197_source.html#l00264">264</a> of file <a class="el" href="a01197_source.html">forward_list.tcc</a>.</p>
<p>References <a class="el" href="a01196_source.html#l00655">std::forward_list< _Tp, _Alloc >::before_begin()</a>, and <a class="el" href="a01196_source.html#l00690">std::forward_list< _Tp, _Alloc >::end()</a>.</p>
</div>
</div>
<a class="anchor" id="aa13fa60094712eb047dcb4653b0ed95e"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename _InputIterator > </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc >::<a class="el" href="a00513.html">iterator</a> forward_list::insert_after </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__pos</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__last</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts a range into the forward_list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__pos</td><td>An iterator into the forward_list. </td></tr>
<tr><td class="paramname">__first</td><td>An input iterator. </td></tr>
<tr><td class="paramname">__last</td><td>An input iterator. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the last inserted element or <em>__pos</em> if <em>__first</em> == <em>__last</em>.</dd></dl>
<p>This function will insert copies of the data in the range [<em>__first</em>,<em>__last</em>) into the forward_list after the location specified by <em>__pos</em>.</p>
<p>This operation is linear in the number of elements inserted and does not invalidate iterators and references. </p>
<p>Definition at line <a class="el" href="a01197_source.html#l00279">279</a> of file <a class="el" href="a01197_source.html">forward_list.tcc</a>.</p>
<p>References <a class="el" href="a01196_source.html#l00655">std::forward_list< _Tp, _Alloc >::before_begin()</a>, <a class="el" href="a01196_source.html#l00734">std::forward_list< _Tp, _Alloc >::empty()</a>, and <a class="el" href="a01196_source.html#l00690">std::forward_list< _Tp, _Alloc >::end()</a>.</p>
</div>
</div>
<a class="anchor" id="a9739cbb5af18ac9976288f6c9c072bb0"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00513.html">iterator</a> <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::insert_after </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__pos</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00727.html">std::initializer_list</a>< _Tp > </td>
<td class="paramname"><em>__il</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts the contents of an <a class="el" href="a00727.html" title="initializer_list">initializer_list</a> into forward_list after the specified iterator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__pos</td><td>An iterator into the forward_list. </td></tr>
<tr><td class="paramname">__il</td><td>An <a class="el" href="a00727.html" title="initializer_list">initializer_list</a> of value_type. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the last inserted element or <em>__pos</em> if <em>__il</em> is empty.</dd></dl>
<p>This function will insert copies of the data in the <a class="el" href="a00727.html" title="initializer_list">initializer_list</a> <em>__il</em> into the forward_list before the location specified by <em>__pos</em>.</p>
<p>This operation is linear in the number of elements inserted and does not invalidate iterators and references. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00920">920</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>References <a class="el" href="a01196_source.html#l00920">std::forward_list< _Tp, _Alloc >::insert_after()</a>.</p>
<p>Referenced by <a class="el" href="a01196_source.html#l00920">std::forward_list< _Tp, _Alloc >::insert_after()</a>.</p>
</div>
</div>
<a class="anchor" id="ae19c74808b1bc8e53bdc229fd3d389fa"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">size_type <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::max_size </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the largest possible number of elements of forward_list. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00741">741</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a4794e46af448c443019e9b36640744ab"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::merge </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__list</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Merge sorted lists. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__list</td><td>Sorted list to merge.</td></tr>
</table>
</dd>
</dl>
<p>Assumes that both <em>list</em> and this list are sorted according to operator<(). Merges elements of <em>__list</em> into this list in sorted order, leaving <em>__list</em> empty when complete. Elements in this list precede elements in <em>__list</em> that are equal. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l01161">1161</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>References <a class="el" href="a01196_source.html#l01161">std::forward_list< _Tp, _Alloc >::merge()</a>.</p>
<p>Referenced by <a class="el" href="a01196_source.html#l01161">std::forward_list< _Tp, _Alloc >::merge()</a>.</p>
</div>
</div>
<a class="anchor" id="a0de7b075b73cc0a843447ad75cba4b87"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename _Comp > </div>
<table class="memname">
<tr>
<td class="memname">void forward_list::merge </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__list</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_Comp </td>
<td class="paramname"><em>__comp</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Merge sorted lists according to comparison function. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__list</td><td>Sorted list to merge. </td></tr>
<tr><td class="paramname">__comp</td><td>Comparison function defining sort order.</td></tr>
</table>
</dd>
</dl>
<p>Assumes that both <em>__list</em> and this list are sorted according to comp. Merges elements of <em>__list</em> into this list in sorted order, leaving <em>__list</em> empty when complete. Elements in this list precede elements in <em>__list</em> that are equivalent according to comp(). </p>
<p>Definition at line <a class="el" href="a01197_source.html#l00358">358</a> of file <a class="el" href="a01197_source.html">forward_list.tcc</a>.</p>
</div>
</div>
<a class="anchor" id="a78c1273fb53228cab655addd77f9cd25"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > & forward_list::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__list</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>The forward_list assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__list</td><td>A forward_list of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>All the elements of <em>__list</em> are copied, but unlike the copy constructor, the allocator object is not copied. </p>
<p>Definition at line <a class="el" href="a01197_source.html#l00145">145</a> of file <a class="el" href="a01197_source.html">forward_list.tcc</a>.</p>
<p>References <a class="el" href="a01239_source.html#l00089">std::begin()</a>, <a class="el" href="a01196_source.html#l00708">std::forward_list< _Tp, _Alloc >::cbegin()</a>, <a class="el" href="a01196_source.html#l00726">std::forward_list< _Tp, _Alloc >::cend()</a>, and <a class="el" href="a01239_source.html#l00099">std::end()</a>.</p>
</div>
</div>
<a class="anchor" id="ad51349eb5e8727d7726b2ebdc14d3306"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">forward_list</a>& <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__list</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>The forward_list move assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__list</td><td>A forward_list of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>The contents of <em>__list</em> are moved into this forward_list (without copying). <em>__list</em> is a valid, but unspecified forward_list </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00567">567</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>References <a class="el" href="a01196_source.html#l01023">std::forward_list< _Tp, _Alloc >::clear()</a>, and <a class="el" href="a01196_source.html#l00981">std::forward_list< _Tp, _Alloc >::swap()</a>.</p>
</div>
</div>
<a class="anchor" id="a6b8dfcf0c3aad308699e909186c39f2b"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00666.html">forward_list</a>& <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00727.html">std::initializer_list</a>< _Tp > </td>
<td class="paramname"><em>__il</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>The forward_list initializer list assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__il</td><td>An <a class="el" href="a00727.html" title="initializer_list">initializer_list</a> of value_type.</td></tr>
</table>
</dd>
</dl>
<p>Replace the contents of the forward_list with copies of the elements in the <a class="el" href="a00727.html" title="initializer_list">initializer_list</a> <em>__il</em>. This is linear in <a class="el" href="a01604.html#a07a6b1e7078b72c0ddd334fe26bd349f" title="Returns the total number of bits.">__il.size()</a>. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00585">585</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>References <a class="el" href="a01196_source.html#l00605">std::forward_list< _Tp, _Alloc >::assign()</a>.</p>
</div>
</div>
<a class="anchor" id="ace75c01c591425341e21b6404e7f9e90"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::pop_front </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Removes first element. </p>
<p>This is a typical stack operation. It shrinks the forward_list by one. Due to the nature of a forward_list this operation can be done in constant time, and only invalidates iterators/references to the element being removed.</p>
<p>Note that no data is returned, and if the first element's data is needed, it should be retrieved before <a class="el" href="a00666.html#ace75c01c591425341e21b6404e7f9e90" title="Removes first element.">pop_front()</a> is called. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00821">821</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="ac2d708075d40071265f0a376591ba1d7"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::push_front </td>
<td>(</td>
<td class="paramtype">const _Tp & </td>
<td class="paramname"><em>__val</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Add data to the front of the forward_list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__val</td><td>Data to be added.</td></tr>
</table>
</dd>
</dl>
<p>This is a typical stack operation. The function creates an element at the front of the forward_list and assigns the given data to it. Due to the nature of a forward_list this operation can be done in constant time, and does not invalidate iterators and references. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00798">798</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>References <a class="el" href="a01196_source.html#l00717">std::forward_list< _Tp, _Alloc >::cbefore_begin()</a>.</p>
</div>
</div>
<a class="anchor" id="aea8b894eab1beaf02326b7c118bc5c5c"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname">void forward_list::remove </td>
<td>(</td>
<td class="paramtype">const _Tp & </td>
<td class="paramname"><em>__val</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Remove all elements equal to value. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__val</td><td>The value to remove.</td></tr>
</table>
</dd>
</dl>
<p>Removes every element in the list equal to <em>__val</em>. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility. </p>
<p>Definition at line <a class="el" href="a01197_source.html#l00292">292</a> of file <a class="el" href="a01197_source.html">forward_list.tcc</a>.</p>
<p>References <a class="el" href="a01312_source.html#l00047">std::__addressof()</a>.</p>
</div>
</div>
<a class="anchor" id="ab4f0f2dbdbfbd38a94a2241ccfe6c3d8"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename _Pred > </div>
<table class="memname">
<tr>
<td class="memname">void forward_list::remove_if </td>
<td>(</td>
<td class="paramtype">_Pred </td>
<td class="paramname"><em>__pred</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Remove all elements satisfying a predicate. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__pred</td><td>Unary predicate function or object.</td></tr>
</table>
</dd>
</dl>
<p>Removes every element in the list for which the predicate returns true. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility. </p>
<p>Definition at line <a class="el" href="a01197_source.html#l00321">321</a> of file <a class="el" href="a01197_source.html">forward_list.tcc</a>.</p>
</div>
</div>
<a class="anchor" id="a73ffca07b591237200b852caf7040057"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname">void forward_list::resize </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__sz</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Resizes the forward_list to the specified number of elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__sz</td><td>Number of elements the forward_list should contain.</td></tr>
</table>
</dd>
</dl>
<p>This function will resize the forward_list to the specified number of elements. If the number is smaller than the forward_list's current number of elements the forward_list is truncated, otherwise the forward_list is extended and the new elements are default constructed. </p>
<p>Definition at line <a class="el" href="a01197_source.html#l00190">190</a> of file <a class="el" href="a01197_source.html">forward_list.tcc</a>.</p>
<p>References <a class="el" href="a01239_source.html#l00099">std::end()</a>.</p>
</div>
</div>
<a class="anchor" id="abfb248e17d0392a8caf5c46683102332"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname">void forward_list::resize </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__sz</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__val</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Resizes the forward_list to the specified number of elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__sz</td><td>Number of elements the forward_list should contain. </td></tr>
<tr><td class="paramname">__val</td><td>Data with which new elements should be populated.</td></tr>
</table>
</dd>
</dl>
<p>This function will resize the forward_list to the specified number of elements. If the number is smaller than the forward_list's current number of elements the forward_list is truncated, otherwise the forward_list is extended and new elements are populated with given data. </p>
<p>Definition at line <a class="el" href="a01197_source.html#l00209">209</a> of file <a class="el" href="a01197_source.html">forward_list.tcc</a>.</p>
<p>References <a class="el" href="a01239_source.html#l00099">std::end()</a>.</p>
</div>
</div>
<a class="anchor" id="a2ab1413dfa1c6858634407a44504a368"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::reverse </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Reverse the elements in list. </p>
<p>Reverse the order of elements in the list in linear time. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l01214">1214</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a4bb37711f3350692a1246d7781967ea6"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::sort </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Sort the elements of the list. </p>
<p>Sorts the elements of this list in NlogN time. Equivalent elements remain in list order. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l01195">1195</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>References <a class="el" href="a01196_source.html#l01195">std::forward_list< _Tp, _Alloc >::sort()</a>.</p>
<p>Referenced by <a class="el" href="a01196_source.html#l01195">std::forward_list< _Tp, _Alloc >::sort()</a>.</p>
</div>
</div>
<a class="anchor" id="a3f59eaf1f58f480eafa906d68d408682"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , class _Alloc > </div>
<div class="memtemplate">
template<typename _Comp > </div>
<table class="memname">
<tr>
<td class="memname">void forward_list::sort </td>
<td>(</td>
<td class="paramtype">_Comp </td>
<td class="paramname"><em>__comp</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Sort the <a class="el" href="a00666.html" title="A standard container with linear time access to elements, and fixed time insertion/deletion at any po...">forward_list</a> using a comparison function. </p>
<p>Sorts the elements of this list in NlogN time. Equivalent elements remain in list order. </p>
<p>Definition at line <a class="el" href="a01197_source.html#l00404">404</a> of file <a class="el" href="a01197_source.html">forward_list.tcc</a>.</p>
</div>
</div>
<a class="anchor" id="a53944489ea030ef467cf9e2f0defd1c0"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::splice_after </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__pos</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__list</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Insert contents of another forward_list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__pos</td><td>Iterator referencing the element to insert after. </td></tr>
<tr><td class="paramname">__list</td><td>Source list.</td></tr>
</table>
</dd>
</dl>
<p>The elements of <em>list</em> are inserted in constant time after the element referenced by <em>pos</em>. <em>list</em> becomes an empty list.</p>
<p>Requires this != <em>x</em>. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l01040">1040</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a8fa1931f312fd4ab822a8fe610ce3107"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname">void forward_list::splice_after </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__pos</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__list</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__i</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Insert element from another forward_list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__pos</td><td>Iterator referencing the element to insert after. </td></tr>
<tr><td class="paramname">__list</td><td>Source list. </td></tr>
<tr><td class="paramname">__i</td><td>Iterator referencing the element before the element to move.</td></tr>
</table>
</dd>
</dl>
<p>Removes the element in list <em>list</em> referenced by <em>i</em> and inserts it into the current list after <em>pos</em>. </p>
<p>Definition at line <a class="el" href="a01197_source.html#l00247">247</a> of file <a class="el" href="a01197_source.html">forward_list.tcc</a>.</p>
</div>
</div>
<a class="anchor" id="a048f9cd9ea4fae7eca3eba2564deb94e"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::splice_after </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__pos</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > && </td>
<td class="paramname">, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__before</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00512.html">const_iterator</a> </td>
<td class="paramname"><em>__last</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Insert range from another forward_list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__pos</td><td>Iterator referencing the element to insert after. </td></tr>
<tr><td class="paramname">__list</td><td>Source list. </td></tr>
<tr><td class="paramname">__before</td><td>Iterator referencing before the start of range in list. </td></tr>
<tr><td class="paramname">__last</td><td>Iterator referencing the end of range in list.</td></tr>
</table>
</dd>
</dl>
<p>Removes elements in the range (__before,__last) and inserts them after <em>__pos</em> in constant time.</p>
<p>Undefined if <em>__pos</em> is in (__before,__last). </p>
<p>Definition at line <a class="el" href="a01196_source.html#l01083">1083</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
</div>
</div>
<a class="anchor" id="a64729c5eb3469e110bf4b2f1a11e9bec"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::swap </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00666.html">forward_list</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__list</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Swaps data with another forward_list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__list</td><td>A forward_list of the same element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>This exchanges the elements between two lists in constant time. Note that the global std::swap() function is specialized such that std::swap(l1,l2) will feed to this function. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l00981">981</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>Referenced by <a class="el" href="a01196_source.html#l00567">std::forward_list< _Tp, _Alloc >::operator=()</a>, and <a class="el" href="a01196_source.html#l01313">std::swap()</a>.</p>
</div>
</div>
<a class="anchor" id="a19e7b4dff2a67a168cc39712a9372c43"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00666.html">std::forward_list</a>< _Tp, _Alloc >::unique </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Remove consecutive duplicate elements. </p>
<p>For each consecutive set of elements with the same value, remove all but the first one. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility. </p>
<p>Definition at line <a class="el" href="a01196_source.html#l01132">1132</a> of file <a class="el" href="a01196_source.html">forward_list.h</a>.</p>
<p>References <a class="el" href="a01196_source.html#l01132">std::forward_list< _Tp, _Alloc >::unique()</a>.</p>
<p>Referenced by <a class="el" href="a01196_source.html#l01132">std::forward_list< _Tp, _Alloc >::unique()</a>.</p>
</div>
</div>
<a class="anchor" id="a1daa70e14ec845a288cec10962d3585b"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename _BinPred > </div>
<table class="memname">
<tr>
<td class="memname">void forward_list::unique </td>
<td>(</td>
<td class="paramtype">_BinPred </td>
<td class="paramname"><em>__binary_pred</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Remove consecutive elements satisfying a predicate. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__binary_pred</td><td>Binary predicate function or object.</td></tr>
</table>
</dd>
</dl>
<p>For each consecutive set of elements [first,last) that satisfy predicate(first,i) where i is an iterator in [first,last), remove all but the first one. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility. </p>
<p>Definition at line <a class="el" href="a01197_source.html#l00337">337</a> of file <a class="el" href="a01197_source.html">forward_list.tcc</a>.</p>
<p>References <a class="el" href="a01239_source.html#l00089">std::begin()</a>, and <a class="el" href="a01239_source.html#l00099">std::end()</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="a01196_source.html">forward_list.h</a></li>
<li><a class="el" href="a01197_source.html">forward_list.tcc</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="a01604.html">std</a></li><li class="navelem"><a class="el" href="a00666.html">forward_list</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.3 </li>
</ul>
</div>
</body>
</html>
