<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: std::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="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</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 id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</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">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a07719.html','');});
/* @license-end */
</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="#pro-types">Protected Types</a> |
<a href="#pro-methods">Protected Member Functions</a> |
<a href="#pro-static-methods">Static Protected Member Functions</a> |
<a href="#pro-attribs">Protected Attributes</a> |
<a href="a07716.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">std::list< _Tp, _Alloc > Class Template Reference<div class="ingroups"><a class="el" href="a01463.html">Containers</a> » <a class="el" href="a01464.html">Sequences</a></div></div> </div>
</div><!--header-->
<div class="contents">
<div class="dynheader">
Inheritance diagram for std::list< _Tp, _Alloc >:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="a07718.svg" width="151" height="123"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<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:ad67bacd1be3bb3a67e85f582efcf2e4a"><td class="memItemLeft" align="right" valign="top"><a id="ad67bacd1be3bb3a67e85f582efcf2e4a"></a>
typedef _Alloc </td><td class="memItemRight" valign="bottom"><b>allocator_type</b></td></tr>
<tr class="separator:ad67bacd1be3bb3a67e85f582efcf2e4a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a19d9c9d8c5155e7dcf05a7d6f4279368"><td class="memItemLeft" align="right" valign="top"><a id="a19d9c9d8c5155e7dcf05a7d6f4279368"></a>
typedef <a class="el" href="a07651.html">_List_const_iterator</a>< _Tp > </td><td class="memItemRight" valign="bottom"><b>const_iterator</b></td></tr>
<tr class="separator:a19d9c9d8c5155e7dcf05a7d6f4279368"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abd26154a3dc8572c4fdc1fec6f6b2c7b"><td class="memItemLeft" align="right" valign="top"><a id="abd26154a3dc8572c4fdc1fec6f6b2c7b"></a>
typedef _Tp_alloc_traits::const_pointer </td><td class="memItemRight" valign="bottom"><b>const_pointer</b></td></tr>
<tr class="separator:abd26154a3dc8572c4fdc1fec6f6b2c7b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a111254c1d1de9c4a1c96482f98c51a45"><td class="memItemLeft" align="right" valign="top"><a id="a111254c1d1de9c4a1c96482f98c51a45"></a>
typedef _Tp_alloc_traits::const_reference </td><td class="memItemRight" valign="bottom"><b>const_reference</b></td></tr>
<tr class="separator:a111254c1d1de9c4a1c96482f98c51a45"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a704c8179c60596d31f264f5bbcacaa16"><td class="memItemLeft" align="right" valign="top"><a id="a704c8179c60596d31f264f5bbcacaa16"></a>
typedef <a class="el" href="a07615.html">std::reverse_iterator</a>< <a class="el" href="a07651.html">const_iterator</a> > </td><td class="memItemRight" valign="bottom"><b>const_reverse_iterator</b></td></tr>
<tr class="separator:a704c8179c60596d31f264f5bbcacaa16"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af2ccbe70441b5b3b8c98d6f24f9a4f14"><td class="memItemLeft" align="right" valign="top"><a id="af2ccbe70441b5b3b8c98d6f24f9a4f14"></a>
typedef ptrdiff_t </td><td class="memItemRight" valign="bottom"><b>difference_type</b></td></tr>
<tr class="separator:af2ccbe70441b5b3b8c98d6f24f9a4f14"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:afbf585c4c41f2b122dc943a26e91ae57"><td class="memItemLeft" align="right" valign="top"><a id="afbf585c4c41f2b122dc943a26e91ae57"></a>
typedef <a class="el" href="a07647.html">_List_iterator</a>< _Tp > </td><td class="memItemRight" valign="bottom"><b>iterator</b></td></tr>
<tr class="separator:afbf585c4c41f2b122dc943a26e91ae57"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a86d32d2e3f23a4c3030524dd4adcfd8c"><td class="memItemLeft" align="right" valign="top"><a id="a86d32d2e3f23a4c3030524dd4adcfd8c"></a>
typedef _Tp_alloc_traits::pointer </td><td class="memItemRight" valign="bottom"><b>pointer</b></td></tr>
<tr class="separator:a86d32d2e3f23a4c3030524dd4adcfd8c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac6860a623a577b77378657b50e67891b"><td class="memItemLeft" align="right" valign="top"><a id="ac6860a623a577b77378657b50e67891b"></a>
typedef _Tp_alloc_traits::reference </td><td class="memItemRight" valign="bottom"><b>reference</b></td></tr>
<tr class="separator:ac6860a623a577b77378657b50e67891b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a21d6ca4e318829934bd93edcb5a7e408"><td class="memItemLeft" align="right" valign="top"><a id="a21d6ca4e318829934bd93edcb5a7e408"></a>
typedef <a class="el" href="a07615.html">std::reverse_iterator</a>< <a class="el" href="a07647.html">iterator</a> > </td><td class="memItemRight" valign="bottom"><b>reverse_iterator</b></td></tr>
<tr class="separator:a21d6ca4e318829934bd93edcb5a7e408"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ace80f20d536929e4383ee3e100206492"><td class="memItemLeft" align="right" valign="top"><a id="ace80f20d536929e4383ee3e100206492"></a>
typedef size_t </td><td class="memItemRight" valign="bottom"><b>size_type</b></td></tr>
<tr class="separator:ace80f20d536929e4383ee3e100206492"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4021b03ec1e0f14d638f35122ac9542a"><td class="memItemLeft" align="right" valign="top"><a id="a4021b03ec1e0f14d638f35122ac9542a"></a>
typedef _Tp </td><td class="memItemRight" valign="bottom"><b>value_type</b></td></tr>
<tr class="separator:a4021b03ec1e0f14d638f35122ac9542a"><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:a8bd45a3517b01002de6debdb401d9170"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a> ()=default</td></tr>
<tr class="separator:a8bd45a3517b01002de6debdb401d9170"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7b6d1424066dbfd18daebac90d143837"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a7b6d1424066dbfd18daebac90d143837">list</a> (const allocator_type &__a) noexcept</td></tr>
<tr class="separator:a7b6d1424066dbfd18daebac90d143837"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3f6568813bbdefbd94cbde64e3e45366"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a3f6568813bbdefbd94cbde64e3e45366">list</a> (size_type __n, const allocator_type &__a=allocator_type())</td></tr>
<tr class="separator:a3f6568813bbdefbd94cbde64e3e45366"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac739777416320440d35c6de1a42ba818"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#ac739777416320440d35c6de1a42ba818">list</a> (size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())</td></tr>
<tr class="separator:ac739777416320440d35c6de1a42ba818"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aec4657b924fb0c29b7d3e347a2da97f0"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#aec4657b924fb0c29b7d3e347a2da97f0">list</a> (const <a class="el" href="a07719.html">list</a> &__x)</td></tr>
<tr class="separator:aec4657b924fb0c29b7d3e347a2da97f0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a138af8bc9ad16e2d9f1f51057b50a786"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a138af8bc9ad16e2d9f1f51057b50a786">list</a> (<a class="el" href="a07719.html">list</a> &&)=default</td></tr>
<tr class="separator:a138af8bc9ad16e2d9f1f51057b50a786"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abc914a91c0740ca3f52168d0b631dbf8"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#abc914a91c0740ca3f52168d0b631dbf8">list</a> (<a class="el" href="a01655.html">initializer_list</a>< value_type > __l, const allocator_type &__a=allocator_type())</td></tr>
<tr class="separator:abc914a91c0740ca3f52168d0b631dbf8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1ff1c87518dacaf728fff2e8769b30f9"><td class="memItemLeft" align="right" valign="top"><a id="a1ff1c87518dacaf728fff2e8769b30f9"></a>
 </td><td class="memItemRight" valign="bottom"><b>list</b> (const <a class="el" href="a07719.html">list</a> &__x, const allocator_type &__a)</td></tr>
<tr class="separator:a1ff1c87518dacaf728fff2e8769b30f9"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0338d5bb2371613e4ce1c255bb33a5dd"><td class="memItemLeft" align="right" valign="top"><a id="a0338d5bb2371613e4ce1c255bb33a5dd"></a>
 </td><td class="memItemRight" valign="bottom"><b>list</b> (<a class="el" href="a07719.html">list</a> &&__x, const allocator_type &__a) noexcept(_Node_alloc_traits::_S_always_equal())</td></tr>
<tr class="separator:a0338d5bb2371613e4ce1c255bb33a5dd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad905b1f7f844c8715c654439611804a1"><td class="memTemplParams" colspan="2">template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </td></tr>
<tr class="memitem:ad905b1f7f844c8715c654439611804a1"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07719.html#ad905b1f7f844c8715c654439611804a1">list</a> (_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())</td></tr>
<tr class="separator:ad905b1f7f844c8715c654439611804a1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6520eeff66a82d7b6e5eacffdcb2da6e"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a6520eeff66a82d7b6e5eacffdcb2da6e">~list</a> ()=default</td></tr>
<tr class="separator:a6520eeff66a82d7b6e5eacffdcb2da6e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9f1a22c8bd2a8d5ecacab44644f513db"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a9f1a22c8bd2a8d5ecacab44644f513db">assign</a> (size_type __n, const value_type &__val)</td></tr>
<tr class="separator:a9f1a22c8bd2a8d5ecacab44644f513db"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6527fbbec76ab1a8a4a80c04e6fcac70"><td class="memTemplParams" colspan="2">template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </td></tr>
<tr class="memitem:a6527fbbec76ab1a8a4a80c04e6fcac70"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07719.html#a6527fbbec76ab1a8a4a80c04e6fcac70">assign</a> (_InputIterator __first, _InputIterator __last)</td></tr>
<tr class="separator:a6527fbbec76ab1a8a4a80c04e6fcac70"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a396193b1480defeaa5f3367ca15ec35e"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a396193b1480defeaa5f3367ca15ec35e">assign</a> (<a class="el" href="a01655.html">initializer_list</a>< value_type > __l)</td></tr>
<tr class="separator:a396193b1480defeaa5f3367ca15ec35e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9567c3ee9243b0159cb036f17ea74b53"><td class="memItemLeft" align="right" valign="top">reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a9567c3ee9243b0159cb036f17ea74b53">back</a> () noexcept</td></tr>
<tr class="separator:a9567c3ee9243b0159cb036f17ea74b53"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac43aac14d7c69657442718428b082aaf"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#ac43aac14d7c69657442718428b082aaf">back</a> () const noexcept</td></tr>
<tr class="separator:ac43aac14d7c69657442718428b082aaf"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1a0d75e77ac53db35e3cdf85ad6d3fa3"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07647.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a> () noexcept</td></tr>
<tr class="separator:a1a0d75e77ac53db35e3cdf85ad6d3fa3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:acd7d9dc641209c8e429d291db8f2de25"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07651.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#acd7d9dc641209c8e429d291db8f2de25">begin</a> () const noexcept</td></tr>
<tr class="separator:acd7d9dc641209c8e429d291db8f2de25"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aac9c52d90a45482d052dbb4b2040b6da"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07651.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#aac9c52d90a45482d052dbb4b2040b6da">cbegin</a> () const noexcept</td></tr>
<tr class="separator:aac9c52d90a45482d052dbb4b2040b6da"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a702400622789c3e0f1171369f803fcb8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07651.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a702400622789c3e0f1171369f803fcb8">cend</a> () const noexcept</td></tr>
<tr class="separator:a702400622789c3e0f1171369f803fcb8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae36feac84d9e8125b700ce5189ed9e95"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#ae36feac84d9e8125b700ce5189ed9e95">clear</a> () noexcept</td></tr>
<tr class="separator:ae36feac84d9e8125b700ce5189ed9e95"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab0c1a4886327c94160ec35419c516f64"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07615.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#ab0c1a4886327c94160ec35419c516f64">crbegin</a> () const noexcept</td></tr>
<tr class="separator:ab0c1a4886327c94160ec35419c516f64"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af9bc7bbe49c3f41b0dfaa3acd5c89e12"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07615.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#af9bc7bbe49c3f41b0dfaa3acd5c89e12">crend</a> () const noexcept</td></tr>
<tr class="separator:af9bc7bbe49c3f41b0dfaa3acd5c89e12"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1b89836dea3d2950a96e485677fe3c30"><td class="memTemplParams" colspan="2">template<typename... _Args> </td></tr>
<tr class="memitem:a1b89836dea3d2950a96e485677fe3c30"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a07647.html">iterator</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07719.html#a1b89836dea3d2950a96e485677fe3c30">emplace</a> (<a class="el" href="a07651.html">const_iterator</a> __position, _Args &&... __args)</td></tr>
<tr class="separator:a1b89836dea3d2950a96e485677fe3c30"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad81dcd9c4f2b6f61951ac5aacd7454f1"><td class="memTemplParams" colspan="2"><a id="ad81dcd9c4f2b6f61951ac5aacd7454f1"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:ad81dcd9c4f2b6f61951ac5aacd7454f1"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>emplace_back</b> (_Args &&... __args)</td></tr>
<tr class="separator:ad81dcd9c4f2b6f61951ac5aacd7454f1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab1698b8277e2511560c27562ffec87dd"><td class="memTemplParams" colspan="2"><a id="ab1698b8277e2511560c27562ffec87dd"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:ab1698b8277e2511560c27562ffec87dd"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>emplace_front</b> (_Args &&... __args)</td></tr>
<tr class="separator:ab1698b8277e2511560c27562ffec87dd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af558a1b206e6fdf40921aeaba0383dbe"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#af558a1b206e6fdf40921aeaba0383dbe">empty</a> () const noexcept</td></tr>
<tr class="separator:af558a1b206e6fdf40921aeaba0383dbe"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aba82f0b94c1ed15ccacea0e98aa6cff6"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07647.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a> () noexcept</td></tr>
<tr class="separator:aba82f0b94c1ed15ccacea0e98aa6cff6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a39a7a20ed70dd4018608a3522d83124d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07651.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a39a7a20ed70dd4018608a3522d83124d">end</a> () const noexcept</td></tr>
<tr class="separator:a39a7a20ed70dd4018608a3522d83124d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aee5d29fe9b6e9494a71022ca980502be"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07647.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#aee5d29fe9b6e9494a71022ca980502be">erase</a> (<a class="el" href="a07651.html">const_iterator</a> __position) noexcept</td></tr>
<tr class="separator:aee5d29fe9b6e9494a71022ca980502be"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a927ad4d7e4673d4b2b33a16de379671b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07647.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a927ad4d7e4673d4b2b33a16de379671b">erase</a> (<a class="el" href="a07651.html">const_iterator</a> __first, <a class="el" href="a07651.html">const_iterator</a> __last) noexcept</td></tr>
<tr class="separator:a927ad4d7e4673d4b2b33a16de379671b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad4367625f1676f2fc0d56b891db683fe"><td class="memItemLeft" align="right" valign="top">reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#ad4367625f1676f2fc0d56b891db683fe">front</a> () noexcept</td></tr>
<tr class="separator:ad4367625f1676f2fc0d56b891db683fe"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5393c199d92f965d065b677f2230e51e"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a5393c199d92f965d065b677f2230e51e">front</a> () const noexcept</td></tr>
<tr class="separator:a5393c199d92f965d065b677f2230e51e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a31f6032941520f4d9187fdf8284ae914"><td class="memItemLeft" align="right" valign="top">allocator_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a31f6032941520f4d9187fdf8284ae914">get_allocator</a> () const noexcept</td></tr>
<tr class="separator:a31f6032941520f4d9187fdf8284ae914"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0b44f76b96a458895a1e8c6e4057b8dd"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07647.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd">insert</a> (<a class="el" href="a07651.html">const_iterator</a> __position, const value_type &__x)</td></tr>
<tr class="separator:a0b44f76b96a458895a1e8c6e4057b8dd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2b70528dcf0f77ddb45429d463de07e4"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07647.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a2b70528dcf0f77ddb45429d463de07e4">insert</a> (<a class="el" href="a07651.html">const_iterator</a> __position, value_type &&__x)</td></tr>
<tr class="separator:a2b70528dcf0f77ddb45429d463de07e4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af9214e29cd05b8446678285415fb6f1e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07647.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#af9214e29cd05b8446678285415fb6f1e">insert</a> (<a class="el" href="a07651.html">const_iterator</a> __p, <a class="el" href="a01655.html">initializer_list</a>< value_type > __l)</td></tr>
<tr class="separator:af9214e29cd05b8446678285415fb6f1e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3660a3d042a5605cde9ecc59e4b9b17c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07647.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a3660a3d042a5605cde9ecc59e4b9b17c">insert</a> (<a class="el" href="a07651.html">const_iterator</a> __position, size_type __n, const value_type &__x)</td></tr>
<tr class="separator:a3660a3d042a5605cde9ecc59e4b9b17c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9a552f1f8f2fd43351184e6676b1fea1"><td class="memTemplParams" colspan="2">template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </td></tr>
<tr class="memitem:a9a552f1f8f2fd43351184e6676b1fea1"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a07647.html">iterator</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07719.html#a9a552f1f8f2fd43351184e6676b1fea1">insert</a> (<a class="el" href="a07651.html">const_iterator</a> __position, _InputIterator __first, _InputIterator __last)</td></tr>
<tr class="separator:a9a552f1f8f2fd43351184e6676b1fea1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac0642b1d26b07dcf28d5fd72bfbdd6d1"><td class="memItemLeft" align="right" valign="top">size_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#ac0642b1d26b07dcf28d5fd72bfbdd6d1">max_size</a> () const noexcept</td></tr>
<tr class="separator:ac0642b1d26b07dcf28d5fd72bfbdd6d1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4d6a44991e6e9a4f1d74236e7d6fc012"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a> (<a class="el" href="a07719.html">list</a> &&__x)</td></tr>
<tr class="separator:a4d6a44991e6e9a4f1d74236e7d6fc012"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a88fef823ab0946e8335c8bb6d5722ef1"><td class="memItemLeft" align="right" valign="top"><a id="a88fef823ab0946e8335c8bb6d5722ef1"></a>
void </td><td class="memItemRight" valign="bottom"><b>merge</b> (<a class="el" href="a07719.html">list</a> &__x)</td></tr>
<tr class="separator:a88fef823ab0946e8335c8bb6d5722ef1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a44306154a6f093d8168eff45b90aa3ad"><td class="memTemplParams" colspan="2">template<typename _StrictWeakOrdering > </td></tr>
<tr class="memitem:a44306154a6f093d8168eff45b90aa3ad"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07719.html#a44306154a6f093d8168eff45b90aa3ad">merge</a> (<a class="el" href="a07719.html">list</a> &&__x, _StrictWeakOrdering __comp)</td></tr>
<tr class="separator:a44306154a6f093d8168eff45b90aa3ad"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a08bcae0211248b423b1f0f077226f8e3"><td class="memTemplParams" colspan="2"><a id="a08bcae0211248b423b1f0f077226f8e3"></a>
template<typename _StrictWeakOrdering > </td></tr>
<tr class="memitem:a08bcae0211248b423b1f0f077226f8e3"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>merge</b> (<a class="el" href="a07719.html">list</a> &__x, _StrictWeakOrdering __comp)</td></tr>
<tr class="separator:a08bcae0211248b423b1f0f077226f8e3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a35a994d029c0e0cf92abf1f468cfa140"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07719.html">list</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a35a994d029c0e0cf92abf1f468cfa140">operator=</a> (const <a class="el" href="a07719.html">list</a> &__x)</td></tr>
<tr class="separator:a35a994d029c0e0cf92abf1f468cfa140"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8f9b65b72c23e8c124c5f4a6e11013e0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07719.html">list</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a8f9b65b72c23e8c124c5f4a6e11013e0">operator=</a> (<a class="el" href="a07719.html">list</a> &&__x) noexcept(_Node_alloc_traits::_S_nothrow_move())</td></tr>
<tr class="separator:a8f9b65b72c23e8c124c5f4a6e11013e0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7b554a6eab6e57e565eedb7da72a83c5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07719.html">list</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a7b554a6eab6e57e565eedb7da72a83c5">operator=</a> (<a class="el" href="a01655.html">initializer_list</a>< value_type > __l)</td></tr>
<tr class="separator:a7b554a6eab6e57e565eedb7da72a83c5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a437f35446fc4e342d4df581335191a69"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a437f35446fc4e342d4df581335191a69">pop_back</a> () noexcept</td></tr>
<tr class="separator:a437f35446fc4e342d4df581335191a69"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad744f7f3b84fc57c973ed2d3bb25a33e"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#ad744f7f3b84fc57c973ed2d3bb25a33e">pop_front</a> () noexcept</td></tr>
<tr class="separator:ad744f7f3b84fc57c973ed2d3bb25a33e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a164bc4a9a0f40d98579507cfa9bb0313"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a164bc4a9a0f40d98579507cfa9bb0313">push_back</a> (const value_type &__x)</td></tr>
<tr class="separator:a164bc4a9a0f40d98579507cfa9bb0313"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4ada838020423dbbe528a87fc8c2737a"><td class="memItemLeft" align="right" valign="top"><a id="a4ada838020423dbbe528a87fc8c2737a"></a>
void </td><td class="memItemRight" valign="bottom"><b>push_back</b> (value_type &&__x)</td></tr>
<tr class="separator:a4ada838020423dbbe528a87fc8c2737a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a43ce26ebd4c6a1789692b7d377f332f3"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a43ce26ebd4c6a1789692b7d377f332f3">push_front</a> (const value_type &__x)</td></tr>
<tr class="separator:a43ce26ebd4c6a1789692b7d377f332f3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7c103b131bdd1a7df4648ba3b480be50"><td class="memItemLeft" align="right" valign="top"><a id="a7c103b131bdd1a7df4648ba3b480be50"></a>
void </td><td class="memItemRight" valign="bottom"><b>push_front</b> (value_type &&__x)</td></tr>
<tr class="separator:a7c103b131bdd1a7df4648ba3b480be50"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8a4cacefc7a58e913f2e9876df0d59de"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07615.html">reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a8a4cacefc7a58e913f2e9876df0d59de">rbegin</a> () noexcept</td></tr>
<tr class="separator:a8a4cacefc7a58e913f2e9876df0d59de"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3ba0b1fa92ccc5268e64c0023632aee7"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07615.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a3ba0b1fa92ccc5268e64c0023632aee7">rbegin</a> () const noexcept</td></tr>
<tr class="separator:a3ba0b1fa92ccc5268e64c0023632aee7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad2334ed28f60c39412ac8cacfa14643d"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#ad2334ed28f60c39412ac8cacfa14643d">remove</a> (const _Tp &__value)</td></tr>
<tr class="separator:ad2334ed28f60c39412ac8cacfa14643d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:adbed771a216e1f1db299bf13c0049177"><td class="memTemplParams" colspan="2">template<typename _Predicate > </td></tr>
<tr class="memitem:adbed771a216e1f1db299bf13c0049177"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07719.html#adbed771a216e1f1db299bf13c0049177">remove_if</a> (_Predicate)</td></tr>
<tr class="separator:adbed771a216e1f1db299bf13c0049177"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4018c8137dc053cfd04641f1ab4b070e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07615.html">reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a4018c8137dc053cfd04641f1ab4b070e">rend</a> () noexcept</td></tr>
<tr class="separator:a4018c8137dc053cfd04641f1ab4b070e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af134c3c02479d6b40c4b6dd9784ff9b2"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07615.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#af134c3c02479d6b40c4b6dd9784ff9b2">rend</a> () const noexcept</td></tr>
<tr class="separator:af134c3c02479d6b40c4b6dd9784ff9b2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a06a57b2ab785e15264e7f36742c4b0dc"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a06a57b2ab785e15264e7f36742c4b0dc">resize</a> (size_type __new_size)</td></tr>
<tr class="separator:a06a57b2ab785e15264e7f36742c4b0dc"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a235d2bb37c9a5d9323c123ebd060cebc"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a235d2bb37c9a5d9323c123ebd060cebc">resize</a> (size_type __new_size, const value_type &__x)</td></tr>
<tr class="separator:a235d2bb37c9a5d9323c123ebd060cebc"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7d420a62c310cd992f52c016293f969a"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a7d420a62c310cd992f52c016293f969a">reverse</a> () noexcept</td></tr>
<tr class="separator:a7d420a62c310cd992f52c016293f969a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4b6c305dd92e3c76213778feba213da2"><td class="memItemLeft" align="right" valign="top">size_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a4b6c305dd92e3c76213778feba213da2">size</a> () const noexcept</td></tr>
<tr class="separator:a4b6c305dd92e3c76213778feba213da2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a150b5b104440ea65709e70a7f2eba06b"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a150b5b104440ea65709e70a7f2eba06b">sort</a> ()</td></tr>
<tr class="separator:a150b5b104440ea65709e70a7f2eba06b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a96029060c6dd54dc811b3c0d59b06537"><td class="memTemplParams" colspan="2">template<typename _StrictWeakOrdering > </td></tr>
<tr class="memitem:a96029060c6dd54dc811b3c0d59b06537"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07719.html#a96029060c6dd54dc811b3c0d59b06537">sort</a> (_StrictWeakOrdering)</td></tr>
<tr class="separator:a96029060c6dd54dc811b3c0d59b06537"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae27f8110bc96c70775f1654e978b4c5f"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a> (<a class="el" href="a07651.html">const_iterator</a> __position, <a class="el" href="a07719.html">list</a> &&__x) noexcept</td></tr>
<tr class="separator:ae27f8110bc96c70775f1654e978b4c5f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa42f3a62becb6253e59e99d95da300cd"><td class="memItemLeft" align="right" valign="top"><a id="aa42f3a62becb6253e59e99d95da300cd"></a>
void </td><td class="memItemRight" valign="bottom"><b>splice</b> (<a class="el" href="a07651.html">const_iterator</a> __position, <a class="el" href="a07719.html">list</a> &__x) noexcept</td></tr>
<tr class="separator:aa42f3a62becb6253e59e99d95da300cd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a11428bfeda40f933f26428bf432907db"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a11428bfeda40f933f26428bf432907db">splice</a> (<a class="el" href="a07651.html">const_iterator</a> __position, <a class="el" href="a07719.html">list</a> &&__x, <a class="el" href="a07651.html">const_iterator</a> __i) noexcept</td></tr>
<tr class="separator:a11428bfeda40f933f26428bf432907db"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa9275ed20653d145bd3c324e0b0422c3"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#aa9275ed20653d145bd3c324e0b0422c3">splice</a> (<a class="el" href="a07651.html">const_iterator</a> __position, <a class="el" href="a07719.html">list</a> &__x, <a class="el" href="a07651.html">const_iterator</a> __i) noexcept</td></tr>
<tr class="separator:aa9275ed20653d145bd3c324e0b0422c3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa4a9d0e45f35bc5c51ee5b1646304bb6"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#aa4a9d0e45f35bc5c51ee5b1646304bb6">splice</a> (<a class="el" href="a07651.html">const_iterator</a> __position, <a class="el" href="a07719.html">list</a> &&__x, <a class="el" href="a07651.html">const_iterator</a> __first, <a class="el" href="a07651.html">const_iterator</a> __last) noexcept</td></tr>
<tr class="separator:aa4a9d0e45f35bc5c51ee5b1646304bb6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5e2e8e3c78743063a5223b09a7f7abf6"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a5e2e8e3c78743063a5223b09a7f7abf6">splice</a> (<a class="el" href="a07651.html">const_iterator</a> __position, <a class="el" href="a07719.html">list</a> &__x, <a class="el" href="a07651.html">const_iterator</a> __first, <a class="el" href="a07651.html">const_iterator</a> __last) noexcept</td></tr>
<tr class="separator:a5e2e8e3c78743063a5223b09a7f7abf6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:afca54335268365fbe964394a8fe5df1b"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#afca54335268365fbe964394a8fe5df1b">swap</a> (<a class="el" href="a07719.html">list</a> &__x) noexcept</td></tr>
<tr class="separator:afca54335268365fbe964394a8fe5df1b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a30b4690883a5219b9dc98233364d2e49"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07719.html#a30b4690883a5219b9dc98233364d2e49">unique</a> ()</td></tr>
<tr class="separator:a30b4690883a5219b9dc98233364d2e49"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a69c3de1ee48297d2d375a11044694cf5"><td class="memTemplParams" colspan="2">template<typename _BinaryPredicate > </td></tr>
<tr class="memitem:a69c3de1ee48297d2d375a11044694cf5"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07719.html#a69c3de1ee48297d2d375a11044694cf5">unique</a> (_BinaryPredicate)</td></tr>
<tr class="separator:a69c3de1ee48297d2d375a11044694cf5"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-types"></a>
Protected Types</h2></td></tr>
<tr class="memitem:a2055df77ce05a254ff1f9aa88bbaef45"><td class="memItemLeft" align="right" valign="top"><a id="a2055df77ce05a254ff1f9aa88bbaef45"></a>
typedef <a class="el" href="a07707.html">_List_node</a>< _Tp > </td><td class="memItemRight" valign="bottom"><b>_Node</b></td></tr>
<tr class="separator:a2055df77ce05a254ff1f9aa88bbaef45"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:a2491a2c47454a8320b0699dfcf4f3bb0"><td class="memTemplParams" colspan="2"><a id="a2491a2c47454a8320b0699dfcf4f3bb0"></a>
template<typename _Integer > </td></tr>
<tr class="memitem:a2491a2c47454a8320b0699dfcf4f3bb0"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_assign_dispatch</b> (_Integer __n, _Integer __val, __true_type)</td></tr>
<tr class="separator:a2491a2c47454a8320b0699dfcf4f3bb0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8e5c106436ea0d1bab7a24751278b4fd"><td class="memTemplParams" colspan="2"><a id="a8e5c106436ea0d1bab7a24751278b4fd"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:a8e5c106436ea0d1bab7a24751278b4fd"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_assign_dispatch</b> (_InputIterator __first, _InputIterator __last, __false_type)</td></tr>
<tr class="separator:a8e5c106436ea0d1bab7a24751278b4fd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3f06d66d4c34fad49d433a531795e025"><td class="memItemLeft" align="right" valign="top"><a id="a3f06d66d4c34fad49d433a531795e025"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_check_equal_allocators</b> (<a class="el" href="a07719.html">list</a> &__x) noexcept</td></tr>
<tr class="separator:a3f06d66d4c34fad49d433a531795e025"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a73d6ecc880d686ffd7ac6d9e66f982c8"><td class="memItemLeft" align="right" valign="top"><a id="a73d6ecc880d686ffd7ac6d9e66f982c8"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_clear</b> () noexcept</td></tr>
<tr class="separator:a73d6ecc880d686ffd7ac6d9e66f982c8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a751c5b84e439b1647db6b733bbaa570f"><td class="memTemplParams" colspan="2">template<typename... _Args> </td></tr>
<tr class="memitem:a751c5b84e439b1647db6b733bbaa570f"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a07707.html">_Node</a> * </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07719.html#a751c5b84e439b1647db6b733bbaa570f">_M_create_node</a> (_Args &&... __args)</td></tr>
<tr class="separator:a751c5b84e439b1647db6b733bbaa570f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad361566a31dcc1de936d347f3b5f1af9"><td class="memItemLeft" align="right" valign="top"><a id="ad361566a31dcc1de936d347f3b5f1af9"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_dec_size</b> (size_t)</td></tr>
<tr class="separator:ad361566a31dcc1de936d347f3b5f1af9"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:adf3e36aba3b534e1ad1c76513ea62335"><td class="memItemLeft" align="right" valign="top"><a id="adf3e36aba3b534e1ad1c76513ea62335"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_default_append</b> (size_type __n)</td></tr>
<tr class="separator:adf3e36aba3b534e1ad1c76513ea62335"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8d86a5d5f4ea440fc1603dfc674988b5"><td class="memItemLeft" align="right" valign="top"><a id="a8d86a5d5f4ea440fc1603dfc674988b5"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_default_initialize</b> (size_type __n)</td></tr>
<tr class="separator:a8d86a5d5f4ea440fc1603dfc674988b5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a313d989f4f66156b0660b524da6bb0b6"><td class="memItemLeft" align="right" valign="top"><a id="a313d989f4f66156b0660b524da6bb0b6"></a>
size_t </td><td class="memItemRight" valign="bottom"><b>_M_distance</b> (const void *, const void *) const</td></tr>
<tr class="separator:a313d989f4f66156b0660b524da6bb0b6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a42e3643274f247e40e217bea86244392"><td class="memItemLeft" align="right" valign="top"><a id="a42e3643274f247e40e217bea86244392"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_erase</b> (<a class="el" href="a07647.html">iterator</a> __position) noexcept</td></tr>
<tr class="separator:a42e3643274f247e40e217bea86244392"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3201f1acaa5d2457684c7da0dbdddbb0"><td class="memItemLeft" align="right" valign="top"><a id="a3201f1acaa5d2457684c7da0dbdddbb0"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_fill_assign</b> (size_type __n, const value_type &__val)</td></tr>
<tr class="separator:a3201f1acaa5d2457684c7da0dbdddbb0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0941ba190c165903066bab4392248881"><td class="memItemLeft" align="right" valign="top"><a id="a0941ba190c165903066bab4392248881"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_fill_initialize</b> (size_type __n, const value_type &__x)</td></tr>
<tr class="separator:a0941ba190c165903066bab4392248881"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af5df269f7ea9b0e82f616b330b03750f"><td class="memItemLeft" align="right" valign="top"><a id="af5df269f7ea9b0e82f616b330b03750f"></a>
_Node_alloc_traits::pointer </td><td class="memItemRight" valign="bottom"><b>_M_get_node</b> ()</td></tr>
<tr class="separator:af5df269f7ea9b0e82f616b330b03750f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af5df269f7ea9b0e82f616b330b03750f"><td class="memItemLeft" align="right" valign="top"><a id="af5df269f7ea9b0e82f616b330b03750f"></a>
_Node_alloc_traits::pointer </td><td class="memItemRight" valign="bottom"><b>_M_get_node</b> ()</td></tr>
<tr class="separator:af5df269f7ea9b0e82f616b330b03750f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9d4c256c21faaf07a7db4c4e103e9149"><td class="memItemLeft" align="right" valign="top"><a id="a9d4c256c21faaf07a7db4c4e103e9149"></a>
_Node_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Node_allocator</b> () noexcept</td></tr>
<tr class="separator:a9d4c256c21faaf07a7db4c4e103e9149"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af26cbb212a32aae5703787176d9cb252"><td class="memItemLeft" align="right" valign="top"><a id="af26cbb212a32aae5703787176d9cb252"></a>
const _Node_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Node_allocator</b> () const noexcept</td></tr>
<tr class="separator:af26cbb212a32aae5703787176d9cb252"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9d4c256c21faaf07a7db4c4e103e9149"><td class="memItemLeft" align="right" valign="top"><a id="a9d4c256c21faaf07a7db4c4e103e9149"></a>
_Node_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Node_allocator</b> () noexcept</td></tr>
<tr class="separator:a9d4c256c21faaf07a7db4c4e103e9149"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af26cbb212a32aae5703787176d9cb252"><td class="memItemLeft" align="right" valign="top"><a id="af26cbb212a32aae5703787176d9cb252"></a>
const _Node_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Node_allocator</b> () const noexcept</td></tr>
<tr class="separator:af26cbb212a32aae5703787176d9cb252"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a651e0276ce483204a32971c6486bad27"><td class="memItemLeft" align="right" valign="top"><a id="a651e0276ce483204a32971c6486bad27"></a>
size_t </td><td class="memItemRight" valign="bottom"><b>_M_get_size</b> () const</td></tr>
<tr class="separator:a651e0276ce483204a32971c6486bad27"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0fdcc101f658bb341d15aab0dc2292c4"><td class="memItemLeft" align="right" valign="top"><a id="a0fdcc101f658bb341d15aab0dc2292c4"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_inc_size</b> (size_t)</td></tr>
<tr class="separator:a0fdcc101f658bb341d15aab0dc2292c4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af0f2eea752c475c0d9b8f90a8a4fa5f1"><td class="memItemLeft" align="right" valign="top"><a id="af0f2eea752c475c0d9b8f90a8a4fa5f1"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_init</b> () noexcept</td></tr>
<tr class="separator:af0f2eea752c475c0d9b8f90a8a4fa5f1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aad0ff0405a043c97ad856d634a23fa02"><td class="memTemplParams" colspan="2"><a id="aad0ff0405a043c97ad856d634a23fa02"></a>
template<typename _Integer > </td></tr>
<tr class="memitem:aad0ff0405a043c97ad856d634a23fa02"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_initialize_dispatch</b> (_Integer __n, _Integer __x, __true_type)</td></tr>
<tr class="separator:aad0ff0405a043c97ad856d634a23fa02"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a523eadd75ce0db6141fb31bbfd4d5192"><td class="memTemplParams" colspan="2"><a id="a523eadd75ce0db6141fb31bbfd4d5192"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:a523eadd75ce0db6141fb31bbfd4d5192"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_initialize_dispatch</b> (_InputIterator __first, _InputIterator __last, __false_type)</td></tr>
<tr class="separator:a523eadd75ce0db6141fb31bbfd4d5192"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae220be61f8301c22ba98a5e7086914ff"><td class="memTemplParams" colspan="2"><a id="ae220be61f8301c22ba98a5e7086914ff"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:ae220be61f8301c22ba98a5e7086914ff"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_insert</b> (<a class="el" href="a07647.html">iterator</a> __position, _Args &&... __args)</td></tr>
<tr class="separator:ae220be61f8301c22ba98a5e7086914ff"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abc999f2088f5523e930c37a1d10104ad"><td class="memItemLeft" align="right" valign="top"><a id="abc999f2088f5523e930c37a1d10104ad"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_move_assign</b> (<a class="el" href="a07719.html">list</a> &&__x, <a class="el" href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">true_type</a>) noexcept</td></tr>
<tr class="separator:abc999f2088f5523e930c37a1d10104ad"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a02c240ac9aabde195ee82d334e558f71"><td class="memItemLeft" align="right" valign="top"><a id="a02c240ac9aabde195ee82d334e558f71"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_move_assign</b> (<a class="el" href="a07719.html">list</a> &&__x, <a class="el" href="a01479.html#gaebe6729ab5488ecc76c762873d226857">false_type</a>)</td></tr>
<tr class="separator:a02c240ac9aabde195ee82d334e558f71"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a08277ed97d7e1d57c7b9399b83b56d27"><td class="memItemLeft" align="right" valign="top"><a id="a08277ed97d7e1d57c7b9399b83b56d27"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_move_nodes</b> (<a class="el" href="a07711.html">_List_base</a> &&__x)</td></tr>
<tr class="separator:a08277ed97d7e1d57c7b9399b83b56d27"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae163459b1a2a50f96b8114fb3ef3edc4"><td class="memItemLeft" align="right" valign="top"><a id="ae163459b1a2a50f96b8114fb3ef3edc4"></a>
size_t </td><td class="memItemRight" valign="bottom"><b>_M_node_count</b> () const</td></tr>
<tr class="separator:ae163459b1a2a50f96b8114fb3ef3edc4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4639d9996be9b90bbe0e9fdf721ba25c"><td class="memItemLeft" align="right" valign="top"><a id="a4639d9996be9b90bbe0e9fdf721ba25c"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_put_node</b> (typename _Node_alloc_traits::pointer __p) noexcept</td></tr>
<tr class="separator:a4639d9996be9b90bbe0e9fdf721ba25c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4639d9996be9b90bbe0e9fdf721ba25c"><td class="memItemLeft" align="right" valign="top"><a id="a4639d9996be9b90bbe0e9fdf721ba25c"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_put_node</b> (typename _Node_alloc_traits::pointer __p) noexcept</td></tr>
<tr class="separator:a4639d9996be9b90bbe0e9fdf721ba25c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2f6fc1a7380b812862f64e266dfac6f7"><td class="memItemLeft" align="right" valign="top"><a id="a2f6fc1a7380b812862f64e266dfac6f7"></a>
<a class="el" href="a07651.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><b>_M_resize_pos</b> (size_type &__new_size) const</td></tr>
<tr class="separator:a2f6fc1a7380b812862f64e266dfac6f7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6946cc2765e971a83992163f4cb1dbc4"><td class="memItemLeft" align="right" valign="top"><a id="a6946cc2765e971a83992163f4cb1dbc4"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_set_size</b> (size_t)</td></tr>
<tr class="separator:a6946cc2765e971a83992163f4cb1dbc4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8861d241a35bbc8bbe6c3f009afa3ed2"><td class="memItemLeft" align="right" valign="top"><a id="a8861d241a35bbc8bbe6c3f009afa3ed2"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_transfer</b> (<a class="el" href="a07647.html">iterator</a> __position, <a class="el" href="a07647.html">iterator</a> __first, <a class="el" href="a07647.html">iterator</a> __last)</td></tr>
<tr class="separator:a8861d241a35bbc8bbe6c3f009afa3ed2"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-static-methods"></a>
Static Protected Member Functions</h2></td></tr>
<tr class="memitem:a730d6d81e7678c3af33a52a9b64d7a55"><td class="memItemLeft" align="right" valign="top"><a id="a730d6d81e7678c3af33a52a9b64d7a55"></a>
static size_t </td><td class="memItemRight" valign="bottom"><b>_S_distance</b> (const <a class="el" href="a07699.html">__detail::_List_node_base</a> *__first, const <a class="el" href="a07699.html">__detail::_List_node_base</a> *__last)</td></tr>
<tr class="separator:a730d6d81e7678c3af33a52a9b64d7a55"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a393b905126a9c3c2475b9402e2e8d7e0"><td class="memItemLeft" align="right" valign="top"><a id="a393b905126a9c3c2475b9402e2e8d7e0"></a>
static size_t </td><td class="memItemRight" valign="bottom"><b>_S_distance</b> (<a class="el" href="a07651.html">const_iterator</a>, <a class="el" href="a07651.html">const_iterator</a>)</td></tr>
<tr class="separator:a393b905126a9c3c2475b9402e2e8d7e0"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-attribs"></a>
Protected Attributes</h2></td></tr>
<tr class="memitem:a45d8f4028ca2ab10185bbf5da58c8c10"><td class="memItemLeft" align="right" valign="top"><a id="a45d8f4028ca2ab10185bbf5da58c8c10"></a>
_List_impl </td><td class="memItemRight" valign="bottom"><b>_M_impl</b></td></tr>
<tr class="separator:a45d8f4028ca2ab10185bbf5da58c8c10"><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 = std::allocator<_Tp>><br />
class std::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>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">_Tp</td><td>Type of element. </td></tr>
<tr><td class="paramname">_Alloc</td><td>Allocator type, defaults to allocator<_Tp>.</td></tr>
</table>
</dd>
</dl>
<p>Meets the requirements of a <a href="tables.html#65">container</a>, a <a href="tables.html#66">reversible container</a>, and 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>doubly</em> <em>linked</em> list. Traversal up and down 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 std::vector and std::deque, 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, std::list provides specialized algorithms unique to linked lists, such as splicing, sorting, and in-place reversal.</p>
<p>A couple points on memory allocation for list<Tp>:</p>
<p>First, we never actually allocate a Tp, we allocate List_node<Tp>'s and trust [20.1.5]/4 to DTRT. This is to ensure that after elements from list<X,Alloc1> are spliced into list<X,Alloc2>, destroying the memory of the second list is a valid operation, i.e., Alloc1 giveth and Alloc2 taketh away.</p>
<p>Second, a list conceptually represented as </p><div class="fragment"><div class="line">A <---> B <---> C <---> D</div></div><!-- fragment --><p> is actually circular; a link exists between A and D. The list class holds (as its only data member) a private list::iterator pointing to <em>D</em>, not to <em>A!</em> To get to the head of the list, we start at the tail and move forward by one. When this member iterator's next/previous pointers refer to itself, the list is empty. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00564">564</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
<a id="a8bd45a3517b01002de6debdb401d9170"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8bd45a3517b01002de6debdb401d9170">◆ </a></span>list() <span class="overload">[1/8]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::<a class="el" href="a07719.html">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">default</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates a list with no elements. </p>
</div>
</div>
<a id="a7b6d1424066dbfd18daebac90d143837"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7b6d1424066dbfd18daebac90d143837">◆ </a></span>list() <span class="overload">[2/8]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::<a class="el" href="a07719.html">list</a> </td>
<td>(</td>
<td class="paramtype">const allocator_type & </td>
<td class="paramname"><em>__a</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 class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates a list with no elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__a</td><td>An allocator object. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00691">691</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a3f6568813bbdefbd94cbde64e3e45366"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3f6568813bbdefbd94cbde64e3e45366">◆ </a></span>list() <span class="overload">[3/8]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::<a class="el" href="a07719.html">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 allocator_type & </td>
<td class="paramname"><em>__a</em> = <code>allocator_type()</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 class="mlabel">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates a 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>
<tr><td class="paramname">__a</td><td>An allocator object.</td></tr>
</table>
</dd>
</dl>
<p>This constructor fills the list with <em>__n</em> default constructed elements. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00704">704</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="ac739777416320440d35c6de1a42ba818"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac739777416320440d35c6de1a42ba818">◆ </a></span>list() <span class="overload">[4/8]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::<a class="el" href="a07719.html">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 value_type & </td>
<td class="paramname"><em>__value</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const allocator_type & </td>
<td class="paramname"><em>__a</em> = <code>allocator_type()</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 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">__a</td><td>An allocator object.</td></tr>
</table>
</dd>
</dl>
<p>This constructor fills the list with <em>__n</em> copies of <em>__value</em>. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00716">716</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="aec4657b924fb0c29b7d3e347a2da97f0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aec4657b924fb0c29b7d3e347a2da97f0">◆ </a></span>list() <span class="overload">[5/8]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::<a class="el" href="a07719.html">list</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a07719.html">list</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__x</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>List copy constructor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A list of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>The newly-created list uses a copy of the allocation object used by <em>__x</em> (unless the allocator traits dictate a different object). </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00743">743</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a138af8bc9ad16e2d9f1f51057b50a786"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a138af8bc9ad16e2d9f1f51057b50a786">◆ </a></span>list() <span class="overload">[6/8]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::<a class="el" href="a07719.html">list</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc > && </td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">default</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>List move constructor. </p>
<p>The newly-created list contains the exact contents of the moved instance. The contents of the moved instance are a valid, but unspecified list. </p>
</div>
</div>
<a id="abc914a91c0740ca3f52168d0b631dbf8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abc914a91c0740ca3f52168d0b631dbf8">◆ </a></span>list() <span class="overload">[7/8]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::<a class="el" href="a07719.html">list</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01655.html">initializer_list</a>< value_type > </td>
<td class="paramname"><em>__l</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const allocator_type & </td>
<td class="paramname"><em>__a</em> = <code>allocator_type()</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 list from an initializer_list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__l</td><td>An initializer_list of value_type. </td></tr>
<tr><td class="paramname">__a</td><td>An allocator object.</td></tr>
</table>
</dd>
</dl>
<p>Create a list consisting of copies of the elements in the initializer_list <em>__l</em>. This is linear in __l.size(). </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00766">766</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="ad905b1f7f844c8715c654439611804a1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad905b1f7f844c8715c654439611804a1">◆ </a></span>list() <span class="overload">[8/8]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<div class="memtemplate">
template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::<a class="el" href="a07719.html">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 allocator_type & </td>
<td class="paramname"><em>__a</em> = <code>allocator_type()</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 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">__a</td><td>An allocator object.</td></tr>
</table>
</dd>
</dl>
<p>Create a 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 class="definition">Definition at line <a class="el" href="a00557_source.html#l00811">811</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a6520eeff66a82d7b6e5eacffdcb2da6e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6520eeff66a82d7b6e5eacffdcb2da6e">◆ </a></span>~list()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::~<a class="el" href="a07719.html">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">default</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>No explicit dtor needed as the _Base dtor takes care of things. The _Base dtor only erases the elements, and note 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>
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a751c5b84e439b1647db6b733bbaa570f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a751c5b84e439b1647db6b733bbaa570f">◆ </a></span>_M_create_node()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::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="a07707.html">_Node</a>* <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::_M_create_node </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 class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__args</td><td>An instance of user data.</td></tr>
</table>
</dd>
</dl>
<p>Allocates space for a new node and constructs a copy of <em>__args</em> in it. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00640">640</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a9f1a22c8bd2a8d5ecacab44644f513db"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9f1a22c8bd2a8d5ecacab44644f513db">◆ </a></span>assign() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::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 value_type & </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 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 list with <em>__n</em> copies of the given value. Note that the assignment completely changes the list and that the resulting list's size is the same as the number of elements assigned. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00897">897</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00557_source.html#l00879">std::list< __inp, __rebind_inp >::operator=()</a>.</p>
</div>
</div>
<a id="a6527fbbec76ab1a8a4a80c04e6fcac70"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6527fbbec76ab1a8a4a80c04e6fcac70">◆ </a></span>assign() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<div class="memtemplate">
template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::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 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 list with copies of the elements in the range [<em>__first</em>,<em>__last</em>).</p>
<p>Note that the assignment completely changes the list and that the resulting list's size is the same as the number of elements assigned. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00916">916</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a396193b1480defeaa5f3367ca15ec35e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a396193b1480defeaa5f3367ca15ec35e">◆ </a></span>assign() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::assign </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01655.html">initializer_list</a>< value_type > </td>
<td class="paramname"><em>__l</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 initializer_list to a list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__l</td><td>An initializer_list of value_type.</td></tr>
</table>
</dd>
</dl>
<p>Replace the contents of the list with copies of the elements in the initializer_list <em>__l</em>. This is linear in __l.size(). </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00938">938</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a9567c3ee9243b0159cb036f17ea74b53"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9567c3ee9243b0159cb036f17ea74b53">◆ </a></span>back() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">reference <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::back </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 reference to the data at the last element of the list. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01138">1138</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="ac43aac14d7c69657442718428b082aaf"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac43aac14d7c69657442718428b082aaf">◆ </a></span>back() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">const_reference <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::back </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) reference to the data at the last element of the list. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01150">1150</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a1a0d75e77ac53db35e3cdf85ad6d3fa3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1a0d75e77ac53db35e3cdf85ad6d3fa3">◆ </a></span>begin() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07647.html">iterator</a> <a class="el" href="a07719.html">std::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 list. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00953">953</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00557_source.html#l01053">std::list< __inp, __rebind_inp >::crend()</a>, <a class="el" href="a00557_source.html#l01122">std::list< __inp, __rebind_inp >::front()</a>, <a class="el" href="a00389_source.html#l00118">std::list< __inp, __rebind_inp >::insert()</a>, <a class="el" href="a00557_source.html#l00743">std::list< __inp, __rebind_inp >::list()</a>, <a class="el" href="a00389_source.html#l00375">std::list< __inp, __rebind_inp >::merge()</a>, <a class="el" href="a00557_source.html#l02021">std::operator<()</a>, <a class="el" href="a00389_source.html#l00268">std::list< __inp, __rebind_inp >::operator=()</a>, <a class="el" href="a00557_source.html#l01987">std::operator==()</a>, <a class="el" href="a00557_source.html#l01205">std::list< __inp, __rebind_inp >::pop_front()</a>, <a class="el" href="a00557_source.html#l01169">std::list< __inp, __rebind_inp >::push_front()</a>, <a class="el" href="a00557_source.html#l01007">std::list< __inp, __rebind_inp >::rend()</a>, and <a class="el" href="a00557_source.html#l01526">std::list< __inp, __rebind_inp >::splice()</a>.</p>
</div>
</div>
<a id="acd7d9dc641209c8e429d291db8f2de25"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acd7d9dc641209c8e429d291db8f2de25">◆ </a></span>begin() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07651.html">const_iterator</a> <a class="el" href="a07719.html">std::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 list. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00962">962</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="aac9c52d90a45482d052dbb4b2040b6da"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aac9c52d90a45482d052dbb4b2040b6da">◆ </a></span>cbegin()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07651.html">const_iterator</a> <a class="el" href="a07719.html">std::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 list. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01026">1026</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a702400622789c3e0f1171369f803fcb8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a702400622789c3e0f1171369f803fcb8">◆ </a></span>cend()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07651.html">const_iterator</a> <a class="el" href="a07719.html">std::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 list. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01035">1035</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="ae36feac84d9e8125b700ce5189ed9e95"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae36feac84d9e8125b700ce5189ed9e95">◆ </a></span>clear()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::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. 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 class="definition">Definition at line <a class="el" href="a00557_source.html#l01506">1506</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="ab0c1a4886327c94160ec35419c516f64"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab0c1a4886327c94160ec35419c516f64">◆ </a></span>crbegin()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07615.html">const_reverse_iterator</a> <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::crbegin </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) reverse iterator that points to the last element in the list. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01044">1044</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="af9bc7bbe49c3f41b0dfaa3acd5c89e12"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af9bc7bbe49c3f41b0dfaa3acd5c89e12">◆ </a></span>crend()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07615.html">const_reverse_iterator</a> <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::crend </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) reverse iterator that points to one before the first element in the list. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01053">1053</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a1b89836dea3d2950a96e485677fe3c30"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1b89836dea3d2950a96e485677fe3c30">◆ </a></span>emplace()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename... _Args> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc >::<a class="el" href="a07647.html">iterator</a> list::emplace </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__position</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>
</div><div class="memdoc">
<p>Constructs object in list before specified iterator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>A const_iterator into the 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)...) before the specified location. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references. </p>
<p class="definition">Definition at line <a class="el" href="a00389_source.html#l00090">90</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00557_source.html#l01316">std::list< __inp, __rebind_inp >::insert()</a>.</p>
</div>
</div>
<a id="af558a1b206e6fdf40921aeaba0383dbe"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af558a1b206e6fdf40921aeaba0383dbe">◆ </a></span>empty()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="a07719.html">std::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 list is empty. (Thus begin() would equal end().) </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01063">1063</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00389_source.html#l00134">std::list< __inp, __rebind_inp >::insert()</a>, and <a class="el" href="a00557_source.html#l01526">std::list< __inp, __rebind_inp >::splice()</a>.</p>
</div>
</div>
<a id="aba82f0b94c1ed15ccacea0e98aa6cff6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aba82f0b94c1ed15ccacea0e98aa6cff6">◆ </a></span>end() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07647.html">iterator</a> <a class="el" href="a07719.html">std::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 list. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00971">971</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00557_source.html#l01138">std::list< __inp, __rebind_inp >::back()</a>, <a class="el" href="a00557_source.html#l01044">std::list< __inp, __rebind_inp >::crbegin()</a>, <a class="el" href="a00557_source.html#l00743">std::list< __inp, __rebind_inp >::list()</a>, <a class="el" href="a00389_source.html#l00375">std::list< __inp, __rebind_inp >::merge()</a>, <a class="el" href="a00557_source.html#l02021">std::operator<()</a>, <a class="el" href="a00389_source.html#l00268">std::list< __inp, __rebind_inp >::operator=()</a>, <a class="el" href="a00557_source.html#l01987">std::operator==()</a>, <a class="el" href="a00557_source.html#l01219">std::list< __inp, __rebind_inp >::push_back()</a>, <a class="el" href="a00557_source.html#l00989">std::list< __inp, __rebind_inp >::rbegin()</a>, and <a class="el" href="a00557_source.html#l01526">std::list< __inp, __rebind_inp >::splice()</a>.</p>
</div>
</div>
<a id="a39a7a20ed70dd4018608a3522d83124d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a39a7a20ed70dd4018608a3522d83124d">◆ </a></span>end() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07651.html">const_iterator</a> <a class="el" href="a07719.html">std::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 (constant) iterator that points one past the last element in the list. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00980">980</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="aee5d29fe9b6e9494a71022ca980502be"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aee5d29fe9b6e9494a71022ca980502be">◆ </a></span>erase() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc >::<a class="el" href="a07647.html">iterator</a> list::erase </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Remove element at given position. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>Iterator pointing to element to be erased. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the next element (or end()).</dd></dl>
<p>This function will erase the element at the given position and thus shorten the list by one.</p>
<p>Due to the nature of a 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 class="definition">Definition at line <a class="el" href="a00389_source.html#l00152">152</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00557_source.html#l01464">std::list< __inp, __rebind_inp >::erase()</a>.</p>
</div>
</div>
<a id="a927ad4d7e4673d4b2b33a16de379671b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a927ad4d7e4673d4b2b33a16de379671b">◆ </a></span>erase() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07647.html">iterator</a> <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::erase </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07651.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 class="mlabel">noexcept</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">__first</td><td>Iterator pointing to 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>An iterator pointing to the element pointed to by <em>last</em> prior to erasing (or end()).</dd></dl>
<p>This function will erase the elements in the range <em></em>[first,last) and shorten the 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 class="definition">Definition at line <a class="el" href="a00557_source.html#l01464">1464</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="ad4367625f1676f2fc0d56b891db683fe"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad4367625f1676f2fc0d56b891db683fe">◆ </a></span>front() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">reference <a class="el" href="a07719.html">std::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 class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read/write reference to the data at the first element of the list. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01122">1122</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a5393c199d92f965d065b677f2230e51e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5393c199d92f965d065b677f2230e51e">◆ </a></span>front() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">const_reference <a class="el" href="a07719.html">std::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 class="mlabel">noexcept</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 list. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01130">1130</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a31f6032941520f4d9187fdf8284ae914"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a31f6032941520f4d9187fdf8284ae914">◆ </a></span>get_allocator()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">allocator_type <a class="el" href="a07719.html">std::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 class="definition">Definition at line <a class="el" href="a00557_source.html#l00944">944</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a0b44f76b96a458895a1e8c6e4057b8dd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0b44f76b96a458895a1e8c6e4057b8dd">◆ </a></span>insert() <span class="overload">[1/5]</span></h2>
<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="a07719.html">list</a>< _Tp, _Alloc >::<a class="el" href="a07647.html">iterator</a> list::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__x</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts given value into list before specified iterator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>A const_iterator into the list. </td></tr>
<tr><td class="paramname">__x</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 before the specified location. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references. </p>
<p class="definition">Definition at line <a class="el" href="a00389_source.html#l00103">103</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00557_source.html#l01335">std::list< __inp, __rebind_inp >::insert()</a>.</p>
</div>
</div>
<a id="a2b70528dcf0f77ddb45429d463de07e4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2b70528dcf0f77ddb45429d463de07e4">◆ </a></span>insert() <span class="overload">[2/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07647.html">iterator</a> <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">value_type && </td>
<td class="paramname"><em>__x</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 rvalue into list before specified iterator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>A const_iterator into the list. </td></tr>
<tr><td class="paramname">__x</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 rvalue before the specified location. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01316">1316</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="af9214e29cd05b8446678285415fb6f1e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af9214e29cd05b8446678285415fb6f1e">◆ </a></span>insert() <span class="overload">[3/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07647.html">iterator</a> <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__p</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a01655.html">initializer_list</a>< value_type > </td>
<td class="paramname"><em>__l</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 initializer_list into list before specified const_iterator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__p</td><td>A const_iterator into the list. </td></tr>
<tr><td class="paramname">__l</td><td>An initializer_list of value_type. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the first element inserted (or __position).</dd></dl>
<p>This function will insert copies of the data in the initializer_list <em>l</em> into the list before the location specified by <em>p</em>.</p>
<p>This operation is linear in the number of elements inserted and does not invalidate iterators and references. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01335">1335</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a3660a3d042a5605cde9ecc59e4b9b17c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3660a3d042a5605cde9ecc59e4b9b17c">◆ </a></span>insert() <span class="overload">[4/5]</span></h2>
<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="a07719.html">list</a>< _Tp, _Alloc >::<a class="el" href="a07647.html">iterator</a> list::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__position</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 value_type & </td>
<td class="paramname"><em>__x</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 list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>A const_iterator into the list. </td></tr>
<tr><td class="paramname">__n</td><td>Number of elements to be inserted. </td></tr>
<tr><td class="paramname">__x</td><td>Data to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the first element inserted (or __position).</dd></dl>
<p>This function will insert a specified number of copies of the given data before the location specified by <em>position</em>.</p>
<p>This operation is linear in the number of elements inserted and does not invalidate iterators and references. </p>
<p class="definition">Definition at line <a class="el" href="a00389_source.html#l00118">118</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<a id="a9a552f1f8f2fd43351184e6676b1fea1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9a552f1f8f2fd43351184e6676b1fea1">◆ </a></span>insert() <span class="overload">[5/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename _InputIterator , typename > </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc >::<a class="el" href="a07647.html">iterator</a> list::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__position</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 list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>A const_iterator into the 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 first element inserted (or __position).</dd></dl>
<p>This function will insert copies of the data in the range [<em>first</em>,<em>last</em>) into the list before the location specified by <em>position</em>.</p>
<p>This operation is linear in the number of elements inserted and does not invalidate iterators and references. </p>
<p class="definition">Definition at line <a class="el" href="a00389_source.html#l00134">134</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<a id="ac0642b1d26b07dcf28d5fd72bfbdd6d1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac0642b1d26b07dcf28d5fd72bfbdd6d1">◆ </a></span>max_size()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">size_type <a class="el" href="a07719.html">std::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 size() of the largest possible list. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01073">1073</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a4d6a44991e6e9a4f1d74236e7d6fc012"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4d6a44991e6e9a4f1d74236e7d6fc012">◆ </a></span>merge() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname">void list::merge </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td></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">__x</td><td>Sorted list to merge.</td></tr>
</table>
</dd>
</dl>
<p>Assumes that both <em>__x</em> and this list are sorted according to operator<(). Merges elements of <em>__x</em> into this list in sorted order, leaving <em>__x</em> empty when complete. Elements in this list precede elements in <em>__x</em> that are equal. </p>
<p class="definition">Definition at line <a class="el" href="a00389_source.html#l00375">375</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<a id="a44306154a6f093d8168eff45b90aa3ad"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a44306154a6f093d8168eff45b90aa3ad">◆ </a></span>merge() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename _StrictWeakOrdering > </div>
<table class="memname">
<tr>
<td class="memname">void list::merge </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__x</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_StrictWeakOrdering </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="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">_StrictWeakOrdering</td><td>Comparison function defining sort order. </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>Sorted list to merge. </td></tr>
<tr><td class="paramname">__comp</td><td>Comparison functor.</td></tr>
</table>
</dd>
</dl>
<p>Assumes that both <em>__x</em> and this list are sorted according to StrictWeakOrdering. Merges elements of <em>__x</em> into this list in sorted order, leaving <em>__x</em> empty when complete. Elements in this list precede elements in <em>__x</em> that are equivalent according to StrictWeakOrdering(). </p>
<p class="definition">Definition at line <a class="el" href="a00389_source.html#l00422">422</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<a id="a35a994d029c0e0cf92abf1f468cfa140"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a35a994d029c0e0cf92abf1f468cfa140">◆ </a></span>operator=() <span class="overload">[1/3]</span></h2>
<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="a07719.html">list</a>< _Tp, _Alloc > & list::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a07719.html">list</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>List assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A list of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>All the elements of <em>__x</em> are copied.</p>
<p>Whether the allocator is copied depends on the allocator traits. </p>
<p class="definition">Definition at line <a class="el" href="a00389_source.html#l00268">268</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<a id="a8f9b65b72c23e8c124c5f4a6e11013e0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8f9b65b72c23e8c124c5f4a6e11013e0">◆ </a></span>operator=() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">list</a>& <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__x</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>List move assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A list of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>The contents of <em>__x</em> are moved into this list (without copying).</p>
<p>Afterwards <em>__x</em> is a valid, but unspecified list</p>
<p>Whether the allocator is moved depends on the allocator traits. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00861">861</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a7b554a6eab6e57e565eedb7da72a83c5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7b554a6eab6e57e565eedb7da72a83c5">◆ </a></span>operator=() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07719.html">list</a>& <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01655.html">initializer_list</a>< value_type > </td>
<td class="paramname"><em>__l</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>List initializer list assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__l</td><td>An initializer_list of value_type.</td></tr>
</table>
</dd>
</dl>
<p>Replace the contents of the list with copies of the elements in the initializer_list <em>__l</em>. This is linear in l.size(). </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00879">879</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a437f35446fc4e342d4df581335191a69"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a437f35446fc4e342d4df581335191a69">◆ </a></span>pop_back()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::pop_back </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>Removes last element. </p>
<p>This is a typical stack operation. It shrinks the list by one. Due to the nature of a 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 last element's data is needed, it should be retrieved before pop_back() is called. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01254">1254</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="ad744f7f3b84fc57c973ed2d3bb25a33e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad744f7f3b84fc57c973ed2d3bb25a33e">◆ </a></span>pop_front()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::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 class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Removes first element. </p>
<p>This is a typical stack operation. It shrinks the list by one. Due to the nature of a 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 pop_front() is called. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01205">1205</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a164bc4a9a0f40d98579507cfa9bb0313"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a164bc4a9a0f40d98579507cfa9bb0313">◆ </a></span>push_back()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::push_back </td>
<td>(</td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__x</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 end of the list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</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 end of the list and assigns the given data to it. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01219">1219</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a43ce26ebd4c6a1789692b7d377f332f3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a43ce26ebd4c6a1789692b7d377f332f3">◆ </a></span>push_front()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::push_front </td>
<td>(</td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__x</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 list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</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 list and assigns the given data to it. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01169">1169</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a8a4cacefc7a58e913f2e9876df0d59de"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8a4cacefc7a58e913f2e9876df0d59de">◆ </a></span>rbegin() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07615.html">reverse_iterator</a> <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::rbegin </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 reverse iterator that points to the last element in the list. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00989">989</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a3ba0b1fa92ccc5268e64c0023632aee7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3ba0b1fa92ccc5268e64c0023632aee7">◆ </a></span>rbegin() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07615.html">const_reverse_iterator</a> <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::rbegin </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) reverse iterator that points to the last element in the list. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l00998">998</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="ad2334ed28f60c39412ac8cacfa14643d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad2334ed28f60c39412ac8cacfa14643d">◆ </a></span>remove()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname">void list::remove </td>
<td>(</td>
<td class="paramtype">const _Tp & </td>
<td class="paramname"><em>__value</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">__value</td><td>The value to remove.</td></tr>
</table>
</dd>
</dl>
<p>Removes every element in the list equal to <em>value</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 class="definition">Definition at line <a class="el" href="a00389_source.html#l00326">326</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<a id="adbed771a216e1f1db299bf13c0049177"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adbed771a216e1f1db299bf13c0049177">◆ </a></span>remove_if()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename _Predicate > </div>
<table class="memname">
<tr>
<td class="memname">void list::remove_if </td>
<td>(</td>
<td class="paramtype">_Predicate </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="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">_Predicate</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 class="definition">Definition at line <a class="el" href="a00389_source.html#l00515">515</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<a id="a4018c8137dc053cfd04641f1ab4b070e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4018c8137dc053cfd04641f1ab4b070e">◆ </a></span>rend() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07615.html">reverse_iterator</a> <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::rend </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 reverse iterator that points to one before the first element in the list. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01007">1007</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="af134c3c02479d6b40c4b6dd9784ff9b2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af134c3c02479d6b40c4b6dd9784ff9b2">◆ </a></span>rend() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07615.html">const_reverse_iterator</a> <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::rend </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) reverse iterator that points to one before the first element in the list. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01016">1016</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a06a57b2ab785e15264e7f36742c4b0dc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a06a57b2ab785e15264e7f36742c4b0dc">◆ </a></span>resize() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname">void list::resize </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__new_size</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Resizes the list to the specified number of elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__new_size</td><td>Number of elements the list should contain.</td></tr>
</table>
</dd>
</dl>
<p>This function will resize the list to the specified number of elements. If the number is smaller than the list's current size the list is truncated, otherwise default constructed elements are appended. </p>
<p class="definition">Definition at line <a class="el" href="a00389_source.html#l00231">231</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<a id="a235d2bb37c9a5d9323c123ebd060cebc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a235d2bb37c9a5d9323c123ebd060cebc">◆ </a></span>resize() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname">void list::resize </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__new_size</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__x</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Resizes the list to the specified number of elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__new_size</td><td>Number of elements the list should contain. </td></tr>
<tr><td class="paramname">__x</td><td>Data with which new elements should be populated.</td></tr>
</table>
</dd>
</dl>
<p>This function will resize the list to the specified number of elements. If the number is smaller than the list's current size the list is truncated, otherwise the list is extended and new elements are populated with given data. </p>
<p class="definition">Definition at line <a class="el" href="a00389_source.html#l00243">243</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<a id="a7d420a62c310cd992f52c016293f969a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7d420a62c310cd992f52c016293f969a">◆ </a></span>reverse()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::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 class="definition">Definition at line <a class="el" href="a00557_source.html#l01790">1790</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a4b6c305dd92e3c76213778feba213da2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4b6c305dd92e3c76213778feba213da2">◆ </a></span>size()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">size_type <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::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 number of elements in the list. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01068">1068</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00389_source.html#l00375">std::list< __inp, __rebind_inp >::merge()</a>, and <a class="el" href="a00557_source.html#l01987">std::operator==()</a>.</p>
</div>
</div>
<a id="a150b5b104440ea65709e70a7f2eba06b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a150b5b104440ea65709e70a7f2eba06b">◆ </a></span>sort() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname">void list::sort </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Sort the elements. </p>
<p>Sorts the elements of this list in NlogN time. Equivalent elements remain in list order. </p>
<p class="definition">Definition at line <a class="el" href="a00389_source.html#l00468">468</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<a id="a96029060c6dd54dc811b3c0d59b06537"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a96029060c6dd54dc811b3c0d59b06537">◆ </a></span>sort() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename _StrictWeakOrdering > </div>
<table class="memname">
<tr>
<td class="memname">void list::sort </td>
<td>(</td>
<td class="paramtype">_StrictWeakOrdering </td>
<td class="paramname"><em>__comp</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Sort the elements according to comparison function. </p>
<p>Sorts the elements of this list in NlogN time. Equivalent elements remain in list order. </p>
<p class="definition">Definition at line <a class="el" href="a00389_source.html#l00554">554</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<a id="ae27f8110bc96c70775f1654e978b4c5f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae27f8110bc96c70775f1654e978b4c5f">◆ </a></span>splice() <span class="overload">[1/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::splice </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__x</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 class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Insert contents of another list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>Iterator referencing the element to insert before. </td></tr>
<tr><td class="paramname">__x</td><td>Source list.</td></tr>
</table>
</dd>
</dl>
<p>The elements of <em>__x</em> are inserted in constant time in front of the element referenced by <em>__position</em>. <em>__x</em> becomes an empty list.</p>
<p>Requires this != <em>__x</em>. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01526">1526</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00557_source.html#l01603">std::list< __inp, __rebind_inp >::splice()</a>.</p>
</div>
</div>
<a id="a11428bfeda40f933f26428bf432907db"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a11428bfeda40f933f26428bf432907db">◆ </a></span>splice() <span class="overload">[2/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::splice </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__x</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__i</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 class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Insert element from another list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>Const_iterator referencing the element to insert before. </td></tr>
<tr><td class="paramname">__x</td><td>Source list. </td></tr>
<tr><td class="paramname">__i</td><td>Const_iterator referencing the element to move.</td></tr>
</table>
</dd>
</dl>
<p>Removes the element in list <em>__x</em> referenced by <em>__i</em> and inserts it into the current list before <em>__position</em>. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01561">1561</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="aa9275ed20653d145bd3c324e0b0422c3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa9275ed20653d145bd3c324e0b0422c3">◆ </a></span>splice() <span class="overload">[3/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::splice </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__x</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__i</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 class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Insert element from another list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>Const_iterator referencing the element to insert before. </td></tr>
<tr><td class="paramname">__x</td><td>Source list. </td></tr>
<tr><td class="paramname">__i</td><td>Const_iterator referencing the element to move.</td></tr>
</table>
</dd>
</dl>
<p>Removes the element in list <em>__x</em> referenced by <em>__i</em> and inserts it into the current list before <em>__position</em>. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01603">1603</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="aa4a9d0e45f35bc5c51ee5b1646304bb6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa4a9d0e45f35bc5c51ee5b1646304bb6">◆ </a></span>splice() <span class="overload">[4/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::splice </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__x</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07651.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 class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Insert range from another list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>Const_iterator referencing the element to insert before. </td></tr>
<tr><td class="paramname">__x</td><td>Source list. </td></tr>
<tr><td class="paramname">__first</td><td>Const_iterator referencing the start of range in x. </td></tr>
<tr><td class="paramname">__last</td><td>Const_iterator referencing the end of range in x.</td></tr>
</table>
</dd>
</dl>
<p>Removes elements in the range [__first,__last) and inserts them before <em>__position</em> in constant time.</p>
<p>Undefined if <em>__position</em> is in [__first,__last). </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01622">1622</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a5e2e8e3c78743063a5223b09a7f7abf6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5e2e8e3c78743063a5223b09a7f7abf6">◆ </a></span>splice() <span class="overload">[5/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::splice </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__x</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07651.html">const_iterator</a> </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07651.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 class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Insert range from another list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>Const_iterator referencing the element to insert before. </td></tr>
<tr><td class="paramname">__x</td><td>Source list. </td></tr>
<tr><td class="paramname">__first</td><td>Const_iterator referencing the start of range in x. </td></tr>
<tr><td class="paramname">__last</td><td>Const_iterator referencing the end of range in x.</td></tr>
</table>
</dd>
</dl>
<p>Removes elements in the range [__first,__last) and inserts them before <em>__position</em> in constant time.</p>
<p>Undefined if <em>__position</em> is in [__first,__last). </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01672">1672</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="afca54335268365fbe964394a8fe5df1b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afca54335268365fbe964394a8fe5df1b">◆ </a></span>swap()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07719.html">std::list</a>< _Tp, _Alloc >::swap </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07719.html">list</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__x</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>Swaps data with another list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A 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>Whether the allocators are swapped depends on the allocator traits. </p>
<p class="definition">Definition at line <a class="el" href="a00557_source.html#l01486">1486</a> of file <a class="el" href="a00557_source.html">stl_list.h</a>.</p>
</div>
</div>
<a id="a30b4690883a5219b9dc98233364d2e49"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a30b4690883a5219b9dc98233364d2e49">◆ </a></span>unique() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname">void list::unique </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></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 class="definition">Definition at line <a class="el" href="a00389_source.html#l00354">354</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<a id="a69c3de1ee48297d2d375a11044694cf5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a69c3de1ee48297d2d375a11044694cf5">◆ </a></span>unique() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename _BinaryPredicate > </div>
<table class="memname">
<tr>
<td class="memname">void list::unique </td>
<td>(</td>
<td class="paramtype">_BinaryPredicate </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="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">_BinaryPredicate</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 class="definition">Definition at line <a class="el" href="a00389_source.html#l00533">533</a> of file <a class="el" href="a00389_source.html">list.tcc</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="a00557_source.html">stl_list.h</a></li>
<li><a class="el" href="a00389_source.html">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="a01541.html">std</a></li><li class="navelem"><a class="el" href="a07719.html">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.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
3975
