<!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::unordered_set< _Value, _Hash, _Pred, _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('a08007.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> |
<a href="#friends">Friends</a> |
<a href="a08004.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">std::unordered_set< _Value, _Hash, _Pred, _Alloc > Class Template Reference<div class="ingroups"><a class="el" href="a01463.html">Containers</a> » <a class="el" href="a01466.html">Unordered Associative</a></div></div> </div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:a1f83ff00c35e85978dced4fb3ff6772e"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::key_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a></td></tr>
<tr class="separator:a1f83ff00c35e85978dced4fb3ff6772e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a14e45fe3da6c5bb759688d5aed9183ff"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::value_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a></td></tr>
<tr class="separator:a14e45fe3da6c5bb759688d5aed9183ff"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3dcd37e44a7c63ca0b0b1a61d3d074d7"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::hasher </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a></td></tr>
<tr class="separator:a3dcd37e44a7c63ca0b0b1a61d3d074d7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a721448c1c7b74465ccfcd51d86a9400c"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::key_equal </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a></td></tr>
<tr class="separator:a721448c1c7b74465ccfcd51d86a9400c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9bba281b4f65b14513a532e398d37642"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::allocator_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a></td></tr>
<tr class="separator:a9bba281b4f65b14513a532e398d37642"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:af18aca91916dd9537f3c33cd7746b0f4"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::pointer </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#af18aca91916dd9537f3c33cd7746b0f4">pointer</a></td></tr>
<tr class="separator:af18aca91916dd9537f3c33cd7746b0f4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a64c2420ac682e15e195863aecf2bcb8b"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::const_pointer </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a64c2420ac682e15e195863aecf2bcb8b">const_pointer</a></td></tr>
<tr class="separator:a64c2420ac682e15e195863aecf2bcb8b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a111a313624cf9219526288500218d406"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a111a313624cf9219526288500218d406">reference</a></td></tr>
<tr class="separator:a111a313624cf9219526288500218d406"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a795d0f609bd9032858d61acc386ee11a"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a795d0f609bd9032858d61acc386ee11a">const_reference</a></td></tr>
<tr class="separator:a795d0f609bd9032858d61acc386ee11a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a02fe876578c29d71f3b0e63ae959fc9e"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a></td></tr>
<tr class="separator:a02fe876578c29d71f3b0e63ae959fc9e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a77ac106cb24d3c809aa1dac59b508f46"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::const_iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a></td></tr>
<tr class="separator:a77ac106cb24d3c809aa1dac59b508f46"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a41daefac0150734553a1b8ae994520e6"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::local_iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a41daefac0150734553a1b8ae994520e6">local_iterator</a></td></tr>
<tr class="separator:a41daefac0150734553a1b8ae994520e6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad71108e3e7466e69cf84def961574aec"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::const_local_iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a></td></tr>
<tr class="separator:ad71108e3e7466e69cf84def961574aec"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a489606b8c31cc86a461912f292dac389"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::size_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a></td></tr>
<tr class="separator:a489606b8c31cc86a461912f292dac389"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a78081fffb25f4c7c28a59c7cf4218c51"><td class="memItemLeft" align="right" valign="top">typedef _Hashtable::difference_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a78081fffb25f4c7c28a59c7cf4218c51">difference_type</a></td></tr>
<tr class="separator:a78081fffb25f4c7c28a59c7cf4218c51"><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:aace23136ea294ea67dcfe292b896b110"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a> ()=default</td></tr>
<tr class="separator:aace23136ea294ea67dcfe292b896b110"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aca41292a5bd6091c80f15eb124d35b05"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#aca41292a5bd6091c80f15eb124d35b05">unordered_set</a> (<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n, const <a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a> &__hf=<a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>(), const <a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a> &__eql=<a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>(), const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> &__a=<a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>())</td></tr>
<tr class="separator:aca41292a5bd6091c80f15eb124d35b05"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:adbea625ce309dd45648ae7d2d2fae5ad"><td class="memTemplParams" colspan="2">template<typename _InputIterator > </td></tr>
<tr class="memitem:adbea625ce309dd45648ae7d2d2fae5ad"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a08007.html#adbea625ce309dd45648ae7d2d2fae5ad">unordered_set</a> (_InputIterator __first, _InputIterator __last, <a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n=0, const <a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a> &__hf=<a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>(), const <a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a> &__eql=<a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>(), const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> &__a=<a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>())</td></tr>
<tr class="separator:adbea625ce309dd45648ae7d2d2fae5ad"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a815061eb273a5be6b49a311e755262e4"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a815061eb273a5be6b49a311e755262e4">unordered_set</a> (const <a class="el" href="a08007.html">unordered_set</a> &)=default</td></tr>
<tr class="separator:a815061eb273a5be6b49a311e755262e4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a56d5c94753b23d219090f7dba60fac59"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a56d5c94753b23d219090f7dba60fac59">unordered_set</a> (<a class="el" href="a08007.html">unordered_set</a> &&)=default</td></tr>
<tr class="separator:a56d5c94753b23d219090f7dba60fac59"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5d4ca5472cfe1e526ea39765ef1eba0c"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a5d4ca5472cfe1e526ea39765ef1eba0c">unordered_set</a> (const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> &__a)</td></tr>
<tr class="separator:a5d4ca5472cfe1e526ea39765ef1eba0c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac6c6b69b311c66ca7d09013935f0cb09"><td class="memItemLeft" align="right" valign="top"><a id="ac6c6b69b311c66ca7d09013935f0cb09"></a>
 </td><td class="memItemRight" valign="bottom"><b>unordered_set</b> (const <a class="el" href="a08007.html">unordered_set</a> &__uset, const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> &__a)</td></tr>
<tr class="separator:ac6c6b69b311c66ca7d09013935f0cb09"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac0f98fcafe4229b4e52625f4be5ad68f"><td class="memItemLeft" align="right" valign="top"><a id="ac0f98fcafe4229b4e52625f4be5ad68f"></a>
 </td><td class="memItemRight" valign="bottom"><b>unordered_set</b> (<a class="el" href="a08007.html">unordered_set</a> &&__uset, const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> &__a)</td></tr>
<tr class="separator:ac0f98fcafe4229b4e52625f4be5ad68f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a060e030a56e63250f388344e5888702a"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a060e030a56e63250f388344e5888702a">unordered_set</a> (<a class="el" href="a01655.html">initializer_list</a>< <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> > __l, <a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n=0, const <a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a> &__hf=<a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>(), const <a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a> &__eql=<a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>(), const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> &__a=<a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>())</td></tr>
<tr class="separator:a060e030a56e63250f388344e5888702a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a39f93223621ef44e8165d5c021793049"><td class="memItemLeft" align="right" valign="top"><a id="a39f93223621ef44e8165d5c021793049"></a>
 </td><td class="memItemRight" valign="bottom"><b>unordered_set</b> (<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n, const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> &__a)</td></tr>
<tr class="separator:a39f93223621ef44e8165d5c021793049"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af7d8a48ea68dbfcdc542737837ad01cf"><td class="memItemLeft" align="right" valign="top"><a id="af7d8a48ea68dbfcdc542737837ad01cf"></a>
 </td><td class="memItemRight" valign="bottom"><b>unordered_set</b> (<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n, const <a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a> &__hf, const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> &__a)</td></tr>
<tr class="separator:af7d8a48ea68dbfcdc542737837ad01cf"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab6cef2d8f35ac02d862e5f6be404a936"><td class="memTemplParams" colspan="2"><a id="ab6cef2d8f35ac02d862e5f6be404a936"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:ab6cef2d8f35ac02d862e5f6be404a936"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><b>unordered_set</b> (_InputIterator __first, _InputIterator __last, <a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n, const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> &__a)</td></tr>
<tr class="separator:ab6cef2d8f35ac02d862e5f6be404a936"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2dca7180189296a96b39b4a9ffd6ec6d"><td class="memTemplParams" colspan="2"><a id="a2dca7180189296a96b39b4a9ffd6ec6d"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:a2dca7180189296a96b39b4a9ffd6ec6d"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><b>unordered_set</b> (_InputIterator __first, _InputIterator __last, <a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n, const <a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a> &__hf, const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> &__a)</td></tr>
<tr class="separator:a2dca7180189296a96b39b4a9ffd6ec6d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a228c39a44620350f4f14664582f460d3"><td class="memItemLeft" align="right" valign="top"><a id="a228c39a44620350f4f14664582f460d3"></a>
 </td><td class="memItemRight" valign="bottom"><b>unordered_set</b> (<a class="el" href="a01655.html">initializer_list</a>< <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> > __l, <a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n, const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> &__a)</td></tr>
<tr class="separator:a228c39a44620350f4f14664582f460d3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ace7f8139dc75df3d1dea322ef8118956"><td class="memItemLeft" align="right" valign="top"><a id="ace7f8139dc75df3d1dea322ef8118956"></a>
 </td><td class="memItemRight" valign="bottom"><b>unordered_set</b> (<a class="el" href="a01655.html">initializer_list</a>< <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> > __l, <a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n, const <a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a> &__hf, const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> &__a)</td></tr>
<tr class="separator:ace7f8139dc75df3d1dea322ef8118956"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a37eb98ba94f1c3979662cb677b812648"><td class="memItemLeft" align="right" valign="top"><a id="a37eb98ba94f1c3979662cb677b812648"></a>
<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td><td class="memItemRight" valign="bottom"><b>bucket</b> (const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> &__key) const</td></tr>
<tr class="separator:a37eb98ba94f1c3979662cb677b812648"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae5b2e99866a8b463ab6f9fe577f08297"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#ae5b2e99866a8b463ab6f9fe577f08297">bucket_count</a> () const noexcept</td></tr>
<tr class="separator:ae5b2e99866a8b463ab6f9fe577f08297"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1b62253ea0fd0b5cdfb8149276e1df77"><td class="memItemLeft" align="right" valign="top"><a id="a1b62253ea0fd0b5cdfb8149276e1df77"></a>
<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td><td class="memItemRight" valign="bottom"><b>bucket_size</b> (<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n) const</td></tr>
<tr class="separator:a1b62253ea0fd0b5cdfb8149276e1df77"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4bc73af25660f155f196c73298073f27"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a4bc73af25660f155f196c73298073f27">cbegin</a> () const noexcept</td></tr>
<tr class="separator:a4bc73af25660f155f196c73298073f27"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a155f3d6e9b8a3a59bb03969355ae5f73"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a155f3d6e9b8a3a59bb03969355ae5f73">cend</a> () const noexcept</td></tr>
<tr class="separator:a155f3d6e9b8a3a59bb03969355ae5f73"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad8049c5e823b2e158de097c48b4bcb0d"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#ad8049c5e823b2e158de097c48b4bcb0d">clear</a> () noexcept</td></tr>
<tr class="separator:ad8049c5e823b2e158de097c48b4bcb0d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1f89dfe5f4807151e3829f060b103efc"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a1f89dfe5f4807151e3829f060b103efc">count</a> (const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> &__x) const</td></tr>
<tr class="separator:a1f89dfe5f4807151e3829f060b103efc"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae5af2f1d8d0746c3db3357561a73c6f7"><td class="memTemplParams" colspan="2">template<typename... _Args> </td></tr>
<tr class="memitem:ae5af2f1d8d0746c3db3357561a73c6f7"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a07767.html">std::pair</a>< <a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a>, bool > </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a08007.html#ae5af2f1d8d0746c3db3357561a73c6f7">emplace</a> (_Args &&... __args)</td></tr>
<tr class="separator:ae5af2f1d8d0746c3db3357561a73c6f7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8d66aca929c29059391648628f2e250b"><td class="memTemplParams" colspan="2">template<typename... _Args> </td></tr>
<tr class="memitem:a8d66aca929c29059391648628f2e250b"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a08007.html#a8d66aca929c29059391648628f2e250b">emplace_hint</a> (<a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __pos, _Args &&... __args)</td></tr>
<tr class="separator:a8d66aca929c29059391648628f2e250b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4e8d8d725e5ce055255edf7f58bbf726"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a4e8d8d725e5ce055255edf7f58bbf726">empty</a> () const noexcept</td></tr>
<tr class="separator:a4e8d8d725e5ce055255edf7f58bbf726"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac935f6a3b65fe0e5629ada1699c86868"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#ac935f6a3b65fe0e5629ada1699c86868">erase</a> (const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> &__x)</td></tr>
<tr class="separator:ac935f6a3b65fe0e5629ada1699c86868"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:acd7b3eed2fde01c393da9d14f1aa03b9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#acd7b3eed2fde01c393da9d14f1aa03b9">erase</a> (<a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __first, <a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __last)</td></tr>
<tr class="separator:acd7b3eed2fde01c393da9d14f1aa03b9"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:acf6e31142497379c81e5853765ffd9a4"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#acf6e31142497379c81e5853765ffd9a4">get_allocator</a> () const noexcept</td></tr>
<tr class="separator:acf6e31142497379c81e5853765ffd9a4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7e199daf0d314f4d3e72f1e694571a8b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a7e199daf0d314f4d3e72f1e694571a8b">hash_function</a> () const</td></tr>
<tr class="separator:a7e199daf0d314f4d3e72f1e694571a8b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab8d7bdf04f958f040cfd842c6e2d7b6b"><td class="memTemplParams" colspan="2">template<typename _InputIterator > </td></tr>
<tr class="memitem:ab8d7bdf04f958f040cfd842c6e2d7b6b"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a08007.html#ab8d7bdf04f958f040cfd842c6e2d7b6b">insert</a> (_InputIterator __first, _InputIterator __last)</td></tr>
<tr class="separator:ab8d7bdf04f958f040cfd842c6e2d7b6b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:adaa06dc3ca7393564cf03ce38cbe5d74"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#adaa06dc3ca7393564cf03ce38cbe5d74">insert</a> (<a class="el" href="a01655.html">initializer_list</a>< <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> > __l)</td></tr>
<tr class="separator:adaa06dc3ca7393564cf03ce38cbe5d74"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a91423e12bcd7c66a7b92c919af9e61a2"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a91423e12bcd7c66a7b92c919af9e61a2">key_eq</a> () const</td></tr>
<tr class="separator:a91423e12bcd7c66a7b92c919af9e61a2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6e7300347a4173c3ad35217600d28f50"><td class="memItemLeft" align="right" valign="top">float </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a6e7300347a4173c3ad35217600d28f50">load_factor</a> () const noexcept</td></tr>
<tr class="separator:a6e7300347a4173c3ad35217600d28f50"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:afc90e16afa79bd929b49590dc8637b00"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#afc90e16afa79bd929b49590dc8637b00">max_bucket_count</a> () const noexcept</td></tr>
<tr class="separator:afc90e16afa79bd929b49590dc8637b00"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac182f2597af135950bfc3b1cd09575ec"><td class="memItemLeft" align="right" valign="top">float </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#ac182f2597af135950bfc3b1cd09575ec">max_load_factor</a> () const noexcept</td></tr>
<tr class="separator:ac182f2597af135950bfc3b1cd09575ec"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a086929d624211470ff2b20a0ba23a86d"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a086929d624211470ff2b20a0ba23a86d">max_load_factor</a> (float __z)</td></tr>
<tr class="separator:a086929d624211470ff2b20a0ba23a86d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:afbad50ec9cd24208c2b33f35aa50f371"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#afbad50ec9cd24208c2b33f35aa50f371">max_size</a> () const noexcept</td></tr>
<tr class="separator:afbad50ec9cd24208c2b33f35aa50f371"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a28b4eb4e12733c87d05ecd05c23e4269"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html">unordered_set</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a28b4eb4e12733c87d05ecd05c23e4269">operator=</a> (const <a class="el" href="a08007.html">unordered_set</a> &)=default</td></tr>
<tr class="separator:a28b4eb4e12733c87d05ecd05c23e4269"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae40948838a04772d6e2e0281ccbde1f3"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html">unordered_set</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#ae40948838a04772d6e2e0281ccbde1f3">operator=</a> (<a class="el" href="a08007.html">unordered_set</a> &&)=default</td></tr>
<tr class="separator:ae40948838a04772d6e2e0281ccbde1f3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3c34d8e0d4bfc8c91c4b54b5199edc04"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html">unordered_set</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a3c34d8e0d4bfc8c91c4b54b5199edc04">operator=</a> (<a class="el" href="a01655.html">initializer_list</a>< <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> > __l)</td></tr>
<tr class="separator:a3c34d8e0d4bfc8c91c4b54b5199edc04"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6f3606a68d349ec1e1e5de56116a39fd"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a6f3606a68d349ec1e1e5de56116a39fd">rehash</a> (<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)</td></tr>
<tr class="separator:a6f3606a68d349ec1e1e5de56116a39fd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aeb44171c81ee124bbb21a113ff318530"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#aeb44171c81ee124bbb21a113ff318530">reserve</a> (<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)</td></tr>
<tr class="separator:aeb44171c81ee124bbb21a113ff318530"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a73ec5052e45a7a980d1968a0805a32dd"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a73ec5052e45a7a980d1968a0805a32dd">size</a> () const noexcept</td></tr>
<tr class="separator:a73ec5052e45a7a980d1968a0805a32dd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a688f24d7010519e2bfa001db6fe180e7"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a688f24d7010519e2bfa001db6fe180e7">swap</a> (<a class="el" href="a08007.html">unordered_set</a> &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))</td></tr>
<tr class="separator:a688f24d7010519e2bfa001db6fe180e7"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:af200bc1dbcbedeabebd796791807ae31"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#af200bc1dbcbedeabebd796791807ae31">begin</a> () noexcept</td></tr>
<tr class="separator:af200bc1dbcbedeabebd796791807ae31"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3d563863f9fd94aa7573fecb9c027c23"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a3d563863f9fd94aa7573fecb9c027c23">begin</a> () const noexcept</td></tr>
<tr class="separator:a3d563863f9fd94aa7573fecb9c027c23"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:aa28c45008761a27eecdaeefaab68fa0e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#aa28c45008761a27eecdaeefaab68fa0e">end</a> () noexcept</td></tr>
<tr class="separator:aa28c45008761a27eecdaeefaab68fa0e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9ead8905955f0942591a17d70f8405c8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a9ead8905955f0942591a17d70f8405c8">end</a> () const noexcept</td></tr>
<tr class="separator:a9ead8905955f0942591a17d70f8405c8"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:ac9fa0bc82f5e6fae38a8d225f468608d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07767.html">std::pair</a>< <a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a>, bool > </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#ac9fa0bc82f5e6fae38a8d225f468608d">insert</a> (const <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> &__x)</td></tr>
<tr class="separator:ac9fa0bc82f5e6fae38a8d225f468608d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abc0147e25845cc780f71f1b14cd41cce"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07767.html">std::pair</a>< <a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a>, bool > </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#abc0147e25845cc780f71f1b14cd41cce">insert</a> (<a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> &&__x)</td></tr>
<tr class="separator:abc0147e25845cc780f71f1b14cd41cce"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:a6b211cbe01ddf94104caf45b393ae933"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a6b211cbe01ddf94104caf45b393ae933">insert</a> (<a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __hint, const <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> &__x)</td></tr>
<tr class="separator:a6b211cbe01ddf94104caf45b393ae933"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9e27a7160d0253be3bc02bf9c2fd4d62"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a9e27a7160d0253be3bc02bf9c2fd4d62">insert</a> (<a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __hint, <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> &&__x)</td></tr>
<tr class="separator:a9e27a7160d0253be3bc02bf9c2fd4d62"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:acef2fe55c494314acad1104ba1488cf6"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#acef2fe55c494314acad1104ba1488cf6">erase</a> (<a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __position)</td></tr>
<tr class="separator:acef2fe55c494314acad1104ba1488cf6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5475af91b7b075f1315091b522eacd3e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a5475af91b7b075f1315091b522eacd3e">erase</a> (<a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> __position)</td></tr>
<tr class="separator:a5475af91b7b075f1315091b522eacd3e"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:af673d30d52e825e4f8da4c8770f0589b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#af673d30d52e825e4f8da4c8770f0589b">find</a> (const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> &__x)</td></tr>
<tr class="separator:af673d30d52e825e4f8da4c8770f0589b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1f05b3fd1a72e6b246b0e5ce8d0937cf"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a1f05b3fd1a72e6b246b0e5ce8d0937cf">find</a> (const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> &__x) const</td></tr>
<tr class="separator:a1f05b3fd1a72e6b246b0e5ce8d0937cf"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:ae91bd4ef581ac83337d7cced559349e2"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07767.html">std::pair</a>< <a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a>, <a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> > </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#ae91bd4ef581ac83337d7cced559349e2">equal_range</a> (const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> &__x)</td></tr>
<tr class="separator:ae91bd4ef581ac83337d7cced559349e2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae5f593da6d71d91fb83d2e6023ad8d87"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07767.html">std::pair</a>< <a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a>, <a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> > </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#ae5f593da6d71d91fb83d2e6023ad8d87">equal_range</a> (const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> &__x) const</td></tr>
<tr class="separator:ae5f593da6d71d91fb83d2e6023ad8d87"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:aab994b1b759354f0bdd30f6e04b86b68"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a41daefac0150734553a1b8ae994520e6">local_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#aab994b1b759354f0bdd30f6e04b86b68">begin</a> (<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)</td></tr>
<tr class="separator:aab994b1b759354f0bdd30f6e04b86b68"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a28389b5527a3ee6a52adc2ee72e67029"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a28389b5527a3ee6a52adc2ee72e67029">begin</a> (<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n) const</td></tr>
<tr class="separator:a28389b5527a3ee6a52adc2ee72e67029"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a30a15b1c31e75c9cfd56a4b3f24fe1ce"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a30a15b1c31e75c9cfd56a4b3f24fe1ce">cbegin</a> (<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n) const</td></tr>
<tr class="separator:a30a15b1c31e75c9cfd56a4b3f24fe1ce"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:a70a807c039d620efcfd2b96048c3471a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#a41daefac0150734553a1b8ae994520e6">local_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a70a807c039d620efcfd2b96048c3471a">end</a> (<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)</td></tr>
<tr class="separator:a70a807c039d620efcfd2b96048c3471a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a124d7201aeadabc2a92e74fde00ec347"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a124d7201aeadabc2a92e74fde00ec347">end</a> (<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n) const</td></tr>
<tr class="separator:a124d7201aeadabc2a92e74fde00ec347"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5f19f51483e14e3006bf1d6c0c7ec00a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a08007.html#a5f19f51483e14e3006bf1d6c0c7ec00a">cend</a> (<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n) const</td></tr>
<tr class="separator:a5f19f51483e14e3006bf1d6c0c7ec00a"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="friends"></a>
Friends</h2></td></tr>
<tr class="memitem:a80e2d4dd8607efe9b83eabe170e0baae"><td class="memTemplParams" colspan="2"><a id="a80e2d4dd8607efe9b83eabe170e0baae"></a>
template<typename _Value1 , typename _Hash1 , typename _Pred1 , typename _Alloc1 > </td></tr>
<tr class="memitem:a80e2d4dd8607efe9b83eabe170e0baae"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><b>operator==</b> (const <a class="el" href="a08007.html">unordered_set</a>< _Value1, _Hash1, _Pred1, _Alloc1 > &, const <a class="el" href="a08007.html">unordered_set</a>< _Value1, _Hash1, _Pred1, _Alloc1 > &)</td></tr>
<tr class="separator:a80e2d4dd8607efe9b83eabe170e0baae"><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 _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>><br />
class std::unordered_set< _Value, _Hash, _Pred, _Alloc ></h3>
<p>A standard container composed of unique keys (containing at most one of each key value) in which the elements' keys are the elements themselves. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">_Value</td><td>Type of key objects. </td></tr>
<tr><td class="paramname">_Hash</td><td>Hashing function object type, defaults to hash<_Value>.</td></tr>
<tr><td class="paramname">_Pred</td><td>Predicate function object type, defaults to equal_to<_Value>.</td></tr>
<tr><td class="paramname">_Alloc</td><td>Allocator type, defaults to allocator<_Key>.</td></tr>
</table>
</dd>
</dl>
<p>Meets the requirements of a <a href="tables.html#65">container</a>, and <a href="tables.html#xx">unordered associative container</a></p>
<p>Base is _Hashtable, dispatched at compile time via template alias __uset_hashtable. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00097">97</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div><h2 class="groupheader">Member Typedef Documentation</h2>
<a id="a9bba281b4f65b14513a532e398d37642"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9bba281b4f65b14513a532e398d37642">◆ </a></span>allocator_type</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::allocator_type <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Public typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00110">110</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a77ac106cb24d3c809aa1dac59b508f46"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a77ac106cb24d3c809aa1dac59b508f46">◆ </a></span>const_iterator</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::const_iterator <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Iterator-related typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00120">120</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="ad71108e3e7466e69cf84def961574aec"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad71108e3e7466e69cf84def961574aec">◆ </a></span>const_local_iterator</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::const_local_iterator <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Iterator-related typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00122">122</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a64c2420ac682e15e195863aecf2bcb8b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a64c2420ac682e15e195863aecf2bcb8b">◆ </a></span>const_pointer</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::const_pointer <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a64c2420ac682e15e195863aecf2bcb8b">const_pointer</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Iterator-related typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00116">116</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a795d0f609bd9032858d61acc386ee11a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a795d0f609bd9032858d61acc386ee11a">◆ </a></span>const_reference</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::const_reference <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a795d0f609bd9032858d61acc386ee11a">const_reference</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Iterator-related typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00118">118</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a78081fffb25f4c7c28a59c7cf4218c51"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a78081fffb25f4c7c28a59c7cf4218c51">◆ </a></span>difference_type</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::difference_type <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a78081fffb25f4c7c28a59c7cf4218c51">difference_type</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Iterator-related typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00124">124</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a3dcd37e44a7c63ca0b0b1a61d3d074d7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3dcd37e44a7c63ca0b0b1a61d3d074d7">◆ </a></span>hasher</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::hasher <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Public typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00108">108</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a02fe876578c29d71f3b0e63ae959fc9e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a02fe876578c29d71f3b0e63ae959fc9e">◆ </a></span>iterator</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::iterator <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Iterator-related typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00119">119</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a721448c1c7b74465ccfcd51d86a9400c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a721448c1c7b74465ccfcd51d86a9400c">◆ </a></span>key_equal</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::key_equal <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Public typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00109">109</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a1f83ff00c35e85978dced4fb3ff6772e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1f83ff00c35e85978dced4fb3ff6772e">◆ </a></span>key_type</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::key_type <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Public typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00106">106</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a41daefac0150734553a1b8ae994520e6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a41daefac0150734553a1b8ae994520e6">◆ </a></span>local_iterator</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::local_iterator <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a41daefac0150734553a1b8ae994520e6">local_iterator</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Iterator-related typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00121">121</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="af18aca91916dd9537f3c33cd7746b0f4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af18aca91916dd9537f3c33cd7746b0f4">◆ </a></span>pointer</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::pointer <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#af18aca91916dd9537f3c33cd7746b0f4">pointer</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Iterator-related typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00115">115</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a111a313624cf9219526288500218d406"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a111a313624cf9219526288500218d406">◆ </a></span>reference</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::reference <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a111a313624cf9219526288500218d406">reference</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Iterator-related typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00117">117</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a489606b8c31cc86a461912f292dac389"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a489606b8c31cc86a461912f292dac389">◆ </a></span>size_type</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::size_type <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Iterator-related typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00123">123</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a14e45fe3da6c5bb759688d5aed9183ff"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a14e45fe3da6c5bb759688d5aed9183ff">◆ </a></span>value_type</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef _Hashtable::value_type <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Public typedefs. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00107">107</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<h2 class="groupheader">Constructor & Destructor Documentation</h2>
<a id="aace23136ea294ea67dcfe292b896b110"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aace23136ea294ea67dcfe292b896b110">◆ </a></span>unordered_set() <span class="overload">[1/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html">unordered_set</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>Default constructor. </p>
</div>
</div>
<a id="aca41292a5bd6091c80f15eb124d35b05"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aca41292a5bd6091c80f15eb124d35b05">◆ </a></span>unordered_set() <span class="overload">[2/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html">unordered_set</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td>
<td class="paramname"><em>__n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a> & </td>
<td class="paramname"><em>__hf</em> = <code><a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>()</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a> & </td>
<td class="paramname"><em>__eql</em> = <code><a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>()</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> & </td>
<td class="paramname"><em>__a</em> = <code><a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>()</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>Default constructor creates no elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>Minimal initial number of buckets. </td></tr>
<tr><td class="paramname">__hf</td><td>A hash functor. </td></tr>
<tr><td class="paramname">__eql</td><td>A key equality functor. </td></tr>
<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="a00626_source.html#l00145">145</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="adbea625ce309dd45648ae7d2d2fae5ad"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adbea625ce309dd45648ae7d2d2fae5ad">◆ </a></span>unordered_set() <span class="overload">[3/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<div class="memtemplate">
template<typename _InputIterator > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html">unordered_set</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"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td>
<td class="paramname"><em>__n</em> = <code>0</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a> & </td>
<td class="paramname"><em>__hf</em> = <code><a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>()</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a> & </td>
<td class="paramname"><em>__eql</em> = <code><a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>()</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> & </td>
<td class="paramname"><em>__a</em> = <code><a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>()</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 an unordered_set 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">__n</td><td>Minimal initial number of buckets. </td></tr>
<tr><td class="paramname">__hf</td><td>A hash functor. </td></tr>
<tr><td class="paramname">__eql</td><td>A key equality functor. </td></tr>
<tr><td class="paramname">__a</td><td>An allocator object.</td></tr>
</table>
</dd>
</dl>
<p>Create an unordered_set consisting of copies of the elements from [__first,__last). This is linear in N (where N is distance(__first,__last)). </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00166">166</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a815061eb273a5be6b49a311e755262e4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a815061eb273a5be6b49a311e755262e4">◆ </a></span>unordered_set() <span class="overload">[4/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html">unordered_set</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a08007.html">unordered_set</a>< _Value, _Hash, _Pred, _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>Copy constructor. </p>
</div>
</div>
<a id="a56d5c94753b23d219090f7dba60fac59"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a56d5c94753b23d219090f7dba60fac59">◆ </a></span>unordered_set() <span class="overload">[5/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html">unordered_set</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html">unordered_set</a>< _Value, _Hash, _Pred, _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>Move constructor. </p>
</div>
</div>
<a id="a5d4ca5472cfe1e526ea39765ef1eba0c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5d4ca5472cfe1e526ea39765ef1eba0c">◆ </a></span>unordered_set() <span class="overload">[6/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html">unordered_set</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> & </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> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates an unordered_set 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="a00626_source.html#l00185">185</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a060e030a56e63250f388344e5888702a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a060e030a56e63250f388344e5888702a">◆ </a></span>unordered_set() <span class="overload">[7/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::<a class="el" href="a08007.html">unordered_set</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01655.html">initializer_list</a>< <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> > </td>
<td class="paramname"><em>__l</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td>
<td class="paramname"><em>__n</em> = <code>0</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a> & </td>
<td class="paramname"><em>__hf</em> = <code><a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>()</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a> & </td>
<td class="paramname"><em>__eql</em> = <code><a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>()</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> & </td>
<td class="paramname"><em>__a</em> = <code><a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>()</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 an unordered_set 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. </td></tr>
<tr><td class="paramname">__n</td><td>Minimal initial number of buckets. </td></tr>
<tr><td class="paramname">__hf</td><td>A hash functor. </td></tr>
<tr><td class="paramname">__eql</td><td>A key equality functor. </td></tr>
<tr><td class="paramname">__a</td><td>An allocator object.</td></tr>
</table>
</dd>
</dl>
<p>Create an unordered_set consisting of copies of the elements in the list. This is linear in N (where N is <em>__l.size()</em>). </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00220">220</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="af200bc1dbcbedeabebd796791807ae31"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af200bc1dbcbedeabebd796791807ae31">◆ </a></span>begin() <span class="overload">[1/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _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-only (constant) iterator that points to the first element in the unordered_set. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00319">319</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a3d563863f9fd94aa7573fecb9c027c23"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3d563863f9fd94aa7573fecb9c027c23">◆ </a></span>begin() <span class="overload">[2/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _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 unordered_set. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00323">323</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="aab994b1b759354f0bdd30f6e04b86b68"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aab994b1b759354f0bdd30f6e04b86b68">◆ </a></span>begin() <span class="overload">[3/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a41daefac0150734553a1b8ae994520e6">local_iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::begin </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator pointing to the first bucket element. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The bucket index. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A read-only local iterator. </dd></dl>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00726">726</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a28389b5527a3ee6a52adc2ee72e67029"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a28389b5527a3ee6a52adc2ee72e67029">◆ </a></span>begin() <span class="overload">[4/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::begin </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator pointing to the first bucket element. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The bucket index. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A read-only local iterator. </dd></dl>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00730">730</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="ae5b2e99866a8b463ab6f9fe577f08297"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae5b2e99866a8b463ab6f9fe577f08297">◆ </a></span>bucket_count()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::bucket_count </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 buckets of the unordered_set. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00692">692</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a4bc73af25660f155f196c73298073f27"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4bc73af25660f155f196c73298073f27">◆ </a></span>cbegin() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _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 unordered_set. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00346">346</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a30a15b1c31e75c9cfd56a4b3f24fe1ce"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a30a15b1c31e75c9cfd56a4b3f24fe1ce">◆ </a></span>cbegin() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::cbegin </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator pointing to the first bucket element. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The bucket index. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A read-only local iterator. </dd></dl>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00734">734</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a155f3d6e9b8a3a59bb03969355ae5f73"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a155f3d6e9b8a3a59bb03969355ae5f73">◆ </a></span>cend() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _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 unordered_set. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00354">354</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a5f19f51483e14e3006bf1d6c0c7ec00a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5f19f51483e14e3006bf1d6c0c7ec00a">◆ </a></span>cend() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::cend </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator pointing to one past the last bucket elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The bucket index. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A read-only local iterator. </dd></dl>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00754">754</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="ad8049c5e823b2e158de097c48b4bcb0d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad8049c5e823b2e158de097c48b4bcb0d">◆ </a></span>clear()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _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 elements in an unordered_set. 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="a00626_source.html#l00572">572</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a1f89dfe5f4807151e3829f060b103efc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1f89dfe5f4807151e3829f060b103efc">◆ </a></span>count()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::count </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> & </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Finds the number of elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>Element to located. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Number of elements with specified key.</dd></dl>
<p>This function only makes sense for unordered_multisets; for unordered_set the result will either be 0 (not present) or 1 (present). </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00667">667</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="ae5af2f1d8d0746c3db3357561a73c6f7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae5af2f1d8d0746c3db3357561a73c6f7">◆ </a></span>emplace()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </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="a07767.html">std::pair</a><<a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a>, bool> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::emplace </td>
<td>(</td>
<td class="paramtype">_Args &&... </td>
<td class="paramname"><em>__args</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Attempts to build and insert an element into the unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__args</td><td>Arguments used to generate an element. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A pair, of which the first element is an iterator that points to the possibly inserted element, and the second is a bool that is true if the element was actually inserted.</dd></dl>
<p>This function attempts to build and insert an element into the unordered_set. An unordered_set relies on unique keys and thus an element is only inserted if it is not already present in the unordered_set.</p>
<p>Insertion requires amortized constant time. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00376">376</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a8d66aca929c29059391648628f2e250b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8d66aca929c29059391648628f2e250b">◆ </a></span>emplace_hint()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </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="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::emplace_hint </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> </td>
<td class="paramname"><em>__pos</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_Args &&... </td>
<td class="paramname"><em>__args</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Attempts to insert an element into the unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__pos</td><td>An iterator that serves as a hint as to where the element should be inserted. </td></tr>
<tr><td class="paramname">__args</td><td>Arguments used to generate the element to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator that points to the element with key equivalent to the one generated from <em>__args</em> (may or may not be the element itself).</dd></dl>
<p>This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument emplace() does. Note that the first parameter is only a hint and can potentially improve the performance of the insertion process. A bad hint would cause no gains in efficiency.</p>
<p>For more on <em>hinting</em>, see: <a href="https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints">https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</a></p>
<p>Insertion requires amortized constant time. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00402">402</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a4e8d8d725e5ce055255edf7f58bbf726"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4e8d8d725e5ce055255edf7f58bbf726">◆ </a></span>empty()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _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 unordered_set is empty. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00298">298</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="aa28c45008761a27eecdaeefaab68fa0e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa28c45008761a27eecdaeefaab68fa0e">◆ </a></span>end() <span class="overload">[1/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _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-only (constant) iterator that points one past the last element in the unordered_set. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00333">333</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a9ead8905955f0942591a17d70f8405c8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9ead8905955f0942591a17d70f8405c8">◆ </a></span>end() <span class="overload">[2/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _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 unordered_set. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00337">337</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a70a807c039d620efcfd2b96048c3471a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a70a807c039d620efcfd2b96048c3471a">◆ </a></span>end() <span class="overload">[3/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a41daefac0150734553a1b8ae994520e6">local_iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::end </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator pointing to one past the last bucket elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The bucket index. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A read-only local iterator. </dd></dl>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00746">746</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a124d7201aeadabc2a92e74fde00ec347"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a124d7201aeadabc2a92e74fde00ec347">◆ </a></span>end() <span class="overload">[4/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::end </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator pointing to one past the last bucket elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The bucket index. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A read-only local iterator. </dd></dl>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00750">750</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="ae91bd4ef581ac83337d7cced559349e2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae91bd4ef581ac83337d7cced559349e2">◆ </a></span>equal_range() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07767.html">std::pair</a><<a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a>, <a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a>> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::equal_range </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> & </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>Finds a subsequence matching given key. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>Key to be located. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Pair of iterators that possibly points to the subsequence matching given key.</dd></dl>
<p>This function probably only makes sense for multisets. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00680">680</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="ae5f593da6d71d91fb83d2e6023ad8d87"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae5f593da6d71d91fb83d2e6023ad8d87">◆ </a></span>equal_range() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07767.html">std::pair</a><<a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a>, <a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a>> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::equal_range </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> & </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Finds a subsequence matching given key. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>Key to be located. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Pair of iterators that possibly points to the subsequence matching given key.</dd></dl>
<p>This function probably only makes sense for multisets. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00684">684</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="acef2fe55c494314acad1104ba1488cf6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acef2fe55c494314acad1104ba1488cf6">◆ </a></span>erase() <span class="overload">[1/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::erase </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">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">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Erases an element from an unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>An iterator pointing to the element to be erased. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the element immediately following <em>__position</em> prior to the element being erased. If no such element exists, end() is returned.</dd></dl>
<p>This function erases an element, pointed to by the given iterator, from an unordered_set. Note 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="a00626_source.html#l00522">522</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a5475af91b7b075f1315091b522eacd3e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5475af91b7b075f1315091b522eacd3e">◆ </a></span>erase() <span class="overload">[2/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::erase </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">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">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Erases an element from an unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>An iterator pointing to the element to be erased. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the element immediately following <em>__position</em> prior to the element being erased. If no such element exists, end() is returned.</dd></dl>
<p>This function erases an element, pointed to by the given iterator, from an unordered_set. Note 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="a00626_source.html#l00527">527</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="ac935f6a3b65fe0e5629ada1699c86868"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac935f6a3b65fe0e5629ada1699c86868">◆ </a></span>erase() <span class="overload">[3/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::erase </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> & </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>Erases elements according to the provided key. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>Key of element to be erased. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The number of elements erased.</dd></dl>
<p>This function erases all the elements located by the given key from an unordered_set. For an unordered_set the result of this function can only be 0 (not present) or 1 (present). Note 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="a00626_source.html#l00544">544</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="acd7b3eed2fde01c393da9d14f1aa03b9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acd7b3eed2fde01c393da9d14f1aa03b9">◆ </a></span>erase() <span class="overload">[4/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::erase </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">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="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> </td>
<td class="paramname"><em>__last</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Erases a [__first,__last) range of elements from an unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Iterator pointing to the start of the range to be erased. </td></tr>
<tr><td class="paramname">__last</td><td>Iterator pointing to the end of the range to be erased. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The iterator <em>__last</em>.</dd></dl>
<p>This function erases a sequence of elements from an unordered_set. Note 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="a00626_source.html#l00562">562</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="af673d30d52e825e4f8da4c8770f0589b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af673d30d52e825e4f8da4c8770f0589b">◆ </a></span>find() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::find </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> & </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>Tries to locate an element in an unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>Element to be located. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Iterator pointing to sought-after element, or end() if not found.</dd></dl>
<p>This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( <code>end()</code> ) iterator. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00649">649</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a1f05b3fd1a72e6b246b0e5ce8d0937cf"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1f05b3fd1a72e6b246b0e5ce8d0937cf">◆ </a></span>find() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::find </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a> & </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Tries to locate an element in an unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>Element to be located. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Iterator pointing to sought-after element, or end() if not found.</dd></dl>
<p>This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( <code>end()</code> ) iterator. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00653">653</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="acf6e31142497379c81e5853765ffd9a4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acf6e31142497379c81e5853765ffd9a4">◆ </a></span>get_allocator()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _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>Returns the allocator object used by the unordered_set. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00291">291</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a7e199daf0d314f4d3e72f1e694571a8b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7e199daf0d314f4d3e72f1e694571a8b">◆ </a></span>hash_function()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::hash_function </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the hash functor object with which the unordered_set was constructed. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00625">625</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="ac9fa0bc82f5e6fae38a8d225f468608d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac9fa0bc82f5e6fae38a8d225f468608d">◆ </a></span>insert() <span class="overload">[1/6]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07767.html">std::pair</a><<a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a>, bool> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> & </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>Attempts to insert an element into the unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>Element to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A pair, of which the first element is an iterator that points to the possibly inserted element, and the second is a bool that is true if the element was actually inserted.</dd></dl>
<p>This function attempts to insert an element into the unordered_set. An unordered_set relies on unique keys and thus an element is only inserted if it is not already present in the unordered_set.</p>
<p>Insertion requires amortized constant time. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00420">420</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="abc0147e25845cc780f71f1b14cd41cce"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abc0147e25845cc780f71f1b14cd41cce">◆ </a></span>insert() <span class="overload">[2/6]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07767.html">std::pair</a><<a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a>, bool> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> && </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>Attempts to insert an element into the unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>Element to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A pair, of which the first element is an iterator that points to the possibly inserted element, and the second is a bool that is true if the element was actually inserted.</dd></dl>
<p>This function attempts to insert an element into the unordered_set. An unordered_set relies on unique keys and thus an element is only inserted if it is not already present in the unordered_set.</p>
<p>Insertion requires amortized constant time. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00424">424</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a6b211cbe01ddf94104caf45b393ae933"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6b211cbe01ddf94104caf45b393ae933">◆ </a></span>insert() <span class="overload">[3/6]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> </td>
<td class="paramname"><em>__hint</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> & </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>Attempts to insert an element into the unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__hint</td><td>An iterator that serves as a hint as to where the element should be inserted. </td></tr>
<tr><td class="paramname">__x</td><td>Element to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator that points to the element with key of <em>__x</em> (may or may not be the element passed in).</dd></dl>
<p>This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument insert() does. Note that the first parameter is only a hint and can potentially improve the performance of the insertion process. A bad hint would cause no gains in efficiency.</p>
<p>For more on <em>hinting</em>, see: <a href="https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints">https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</a></p>
<p>Insertion requires amortized constant. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00449">449</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a9e27a7160d0253be3bc02bf9c2fd4d62"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9e27a7160d0253be3bc02bf9c2fd4d62">◆ </a></span>insert() <span class="overload">[4/6]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> </td>
<td class="paramname"><em>__hint</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> && </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>Attempts to insert an element into the unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__hint</td><td>An iterator that serves as a hint as to where the element should be inserted. </td></tr>
<tr><td class="paramname">__x</td><td>Element to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator that points to the element with key of <em>__x</em> (may or may not be the element passed in).</dd></dl>
<p>This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument insert() does. Note that the first parameter is only a hint and can potentially improve the performance of the insertion process. A bad hint would cause no gains in efficiency.</p>
<p>For more on <em>hinting</em>, see: <a href="https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints">https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</a></p>
<p>Insertion requires amortized constant. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00453">453</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="ab8d7bdf04f958f040cfd842c6e2d7b6b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab8d7bdf04f958f040cfd842c6e2d7b6b">◆ </a></span>insert() <span class="overload">[5/6]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<div class="memtemplate">
template<typename _InputIterator > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::insert </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>A template function that attempts to insert 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 start of the range to be inserted. </td></tr>
<tr><td class="paramname">__last</td><td>Iterator pointing to the end of the range.</td></tr>
</table>
</dd>
</dl>
<p>Complexity similar to that of the range constructor. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00468">468</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="adaa06dc3ca7393564cf03ce38cbe5d74"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adaa06dc3ca7393564cf03ce38cbe5d74">◆ </a></span>insert() <span class="overload">[6/6]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01655.html">initializer_list</a>< <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> > </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>Attempts to insert a list of elements into the unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__l</td><td>A std::initializer_list<value_type> of elements to be inserted.</td></tr>
</table>
</dd>
</dl>
<p>Complexity similar to that of the range constructor. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00479">479</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a91423e12bcd7c66a7b92c919af9e61a2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a91423e12bcd7c66a7b92c919af9e61a2">◆ </a></span>key_eq()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::key_eq </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the key comparison object with which the unordered_set was constructed. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00631">631</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a6e7300347a4173c3ad35217600d28f50"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6e7300347a4173c3ad35217600d28f50">◆ </a></span>load_factor()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">float <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::load_factor </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 average number of elements per bucket. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00762">762</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="afc90e16afa79bd929b49590dc8637b00"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afc90e16afa79bd929b49590dc8637b00">◆ </a></span>max_bucket_count()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::max_bucket_count </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 maximum number of buckets of the unordered_set. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00697">697</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="ac182f2597af135950bfc3b1cd09575ec"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac182f2597af135950bfc3b1cd09575ec">◆ </a></span>max_load_factor() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">float <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::max_load_factor </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 positive number that the unordered_set tries to keep the load factor less than or equal to. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00768">768</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a086929d624211470ff2b20a0ba23a86d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a086929d624211470ff2b20a0ba23a86d">◆ </a></span>max_load_factor() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::max_load_factor </td>
<td>(</td>
<td class="paramtype">float </td>
<td class="paramname"><em>__z</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>Change the unordered_set maximum load factor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__z</td><td>The new maximum load factor. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00776">776</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="afbad50ec9cd24208c2b33f35aa50f371"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afbad50ec9cd24208c2b33f35aa50f371">◆ </a></span>max_size()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _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 maximum size of the unordered_set. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00308">308</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a28b4eb4e12733c87d05ecd05c23e4269"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a28b4eb4e12733c87d05ecd05c23e4269">◆ </a></span>operator=() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html">unordered_set</a>& <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a08007.html">unordered_set</a>< _Value, _Hash, _Pred, _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>Copy assignment operator. </p>
</div>
</div>
<a id="ae40948838a04772d6e2e0281ccbde1f3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae40948838a04772d6e2e0281ccbde1f3">◆ </a></span>operator=() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html">unordered_set</a>& <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html">unordered_set</a>< _Value, _Hash, _Pred, _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>Move assignment operator. </p>
</div>
</div>
<a id="a3c34d8e0d4bfc8c91c4b54b5199edc04"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3c34d8e0d4bfc8c91c4b54b5199edc04">◆ </a></span>operator=() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html">unordered_set</a>& <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01655.html">initializer_list</a>< <a class="el" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a> > </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>Unordered_set list assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__l</td><td>An initializer_list.</td></tr>
</table>
</dd>
</dl>
<p>This function fills an unordered_set with copies of the elements in the initializer list <em>__l</em>.</p>
<p>Note that the assignment completely changes the unordered_set and that the resulting unordered_set's size is the same as the number of elements assigned. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00283">283</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a6f3606a68d349ec1e1e5de56116a39fd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6f3606a68d349ec1e1e5de56116a39fd">◆ </a></span>rehash()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::rehash </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>May rehash the unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The new number of buckets.</td></tr>
</table>
</dd>
</dl>
<p>Rehash will occur only if the new number of buckets respect the unordered_set maximum load factor. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00787">787</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="aeb44171c81ee124bbb21a113ff318530"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aeb44171c81ee124bbb21a113ff318530">◆ </a></span>reserve()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::reserve </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Prepare the unordered_set for a specified number of elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>Number of elements required.</td></tr>
</table>
</dd>
</dl>
<p>Same as rehash(ceil(n / max_load_factor())). </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00798">798</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a73ec5052e45a7a980d1968a0805a32dd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a73ec5052e45a7a980d1968a0805a32dd">◆ </a></span>size()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _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 size of the unordered_set. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00303">303</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<a id="a688f24d7010519e2bfa001db6fe180e7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a688f24d7010519e2bfa001db6fe180e7">◆ </a></span>swap()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a08007.html">std::unordered_set</a>< _Value, _Hash, _Pred, _Alloc >::swap </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a08007.html">unordered_set</a>< _Value, _Hash, _Pred, _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 unordered_set. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>An unordered_set of the same element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>This exchanges the elements between two sets in constant time. Note that the global std::swap() function is specialized such that std::swap(s1,s2) will feed to this function. </p>
<p class="definition">Definition at line <a class="el" href="a00626_source.html#l00585">585</a> of file <a class="el" href="a00626_source.html">unordered_set.h</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li><a class="el" href="a00626_source.html">unordered_set.h</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="a08007.html">unordered_set</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
>
4071
