Files
entt/classentt_1_1dense__set.html
2025-03-19 15:49:42 +01:00

2980 lines
183 KiB
HTML

<!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" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>EnTT: entt::dense_set&lt; Type, Hash, KeyEqual, Allocator &gt; 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>
<script type="text/javascript" src="clipboard.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="cookie.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen-awesome.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 id="projectrow">
<td id="projectalign">
<div id="projectname">EnTT<span id="projectnumber">&#160;3.15.0</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(0); });
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('',true,false,'search.php','Search',false);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){ initResizable(false); });
/* @license-end */
</script>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="namespaceentt.html">entt</a></li><li class="navelem"><a class="el" href="classentt_1_1dense__set.html">dense_set</a></li> </ul>
</div>
</div><!-- top -->
<div id="doc-content">
<div class="header">
<div class="summary">
<a href="#pub-types">Public Types</a> &#124;
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="classentt_1_1dense__set-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">entt::dense_set&lt; Type, Hash, KeyEqual, Allocator &gt; Class Template Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Associative container for unique objects of a given type.
<a href="#details">More...</a></p>
<p><code>#include &lt;<a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>&gt;</code></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-types" name="pub-types"></a>
Public Types</h2></td></tr>
<tr class="memitem:a8c83fbdb7d106f60f98d3ae3f395abc2" id="r_a8c83fbdb7d106f60f98d3ae3f395abc2"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> = Allocator</td></tr>
<tr class="memdesc:a8c83fbdb7d106f60f98d3ae3f395abc2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Allocator type. <br /></td></tr>
<tr class="separator:a8c83fbdb7d106f60f98d3ae3f395abc2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a404f1b7ec2ba2fe41d72f4deacf3ed3f" id="r_a404f1b7ec2ba2fe41d72f4deacf3ed3f"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a404f1b7ec2ba2fe41d72f4deacf3ed3f">key_type</a> = Type</td></tr>
<tr class="memdesc:a404f1b7ec2ba2fe41d72f4deacf3ed3f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Key type of the container. <br /></td></tr>
<tr class="separator:a404f1b7ec2ba2fe41d72f4deacf3ed3f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a42092d77add471a91a60b0aebd515829" id="r_a42092d77add471a91a60b0aebd515829"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> = Type</td></tr>
<tr class="memdesc:a42092d77add471a91a60b0aebd515829"><td class="mdescLeft">&#160;</td><td class="mdescRight">Value type of the container. <br /></td></tr>
<tr class="separator:a42092d77add471a91a60b0aebd515829"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3355912feda8db49d87b75247f824ce0" id="r_a3355912feda8db49d87b75247f824ce0"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> = std::size_t</td></tr>
<tr class="memdesc:a3355912feda8db49d87b75247f824ce0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Unsigned integer type. <br /></td></tr>
<tr class="separator:a3355912feda8db49d87b75247f824ce0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a12f11ca5f036cb6f606952e2e506179c" id="r_a12f11ca5f036cb6f606952e2e506179c"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a12f11ca5f036cb6f606952e2e506179c">difference_type</a> = std::ptrdiff_t</td></tr>
<tr class="memdesc:a12f11ca5f036cb6f606952e2e506179c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Signed integer type. <br /></td></tr>
<tr class="separator:a12f11ca5f036cb6f606952e2e506179c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2fb78f57d6f35f6235468e4aadb2fe0e" id="r_a2fb78f57d6f35f6235468e4aadb2fe0e"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> = Hash</td></tr>
<tr class="memdesc:a2fb78f57d6f35f6235468e4aadb2fe0e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Type of function to use to hash the elements. <br /></td></tr>
<tr class="separator:a2fb78f57d6f35f6235468e4aadb2fe0e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a266d306cce7016dba8fdbf3790a0cb39" id="r_a266d306cce7016dba8fdbf3790a0cb39"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> = KeyEqual</td></tr>
<tr class="memdesc:a266d306cce7016dba8fdbf3790a0cb39"><td class="mdescLeft">&#160;</td><td class="mdescRight">Type of function to use to compare the elements for equality. <br /></td></tr>
<tr class="separator:a266d306cce7016dba8fdbf3790a0cb39"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a44f127ff9c4a0fa1c8284f7d072bd5c3" id="r_a44f127ff9c4a0fa1c8284f7d072bd5c3"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a> = internal::dense_set_iterator&lt;typename packed_container_type::iterator&gt;</td></tr>
<tr class="memdesc:a44f127ff9c4a0fa1c8284f7d072bd5c3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Random access iterator type. <br /></td></tr>
<tr class="separator:a44f127ff9c4a0fa1c8284f7d072bd5c3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a271e1e1f94361e8156c6de5a81746943" id="r_a271e1e1f94361e8156c6de5a81746943"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> = internal::dense_set_iterator&lt;typename packed_container_type::const_iterator&gt;</td></tr>
<tr class="memdesc:a271e1e1f94361e8156c6de5a81746943"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constant random access iterator type. <br /></td></tr>
<tr class="separator:a271e1e1f94361e8156c6de5a81746943"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8b91ff4841d5fc46d02544d71825822a" id="r_a8b91ff4841d5fc46d02544d71825822a"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8b91ff4841d5fc46d02544d71825822a">reverse_iterator</a> = std::reverse_iterator&lt;<a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>&gt;</td></tr>
<tr class="memdesc:a8b91ff4841d5fc46d02544d71825822a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Reverse iterator type. <br /></td></tr>
<tr class="separator:a8b91ff4841d5fc46d02544d71825822a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5a9f859755987f8844be29ad84cc37b6" id="r_a5a9f859755987f8844be29ad84cc37b6"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5a9f859755987f8844be29ad84cc37b6">const_reverse_iterator</a> = std::reverse_iterator&lt;<a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a>&gt;</td></tr>
<tr class="memdesc:a5a9f859755987f8844be29ad84cc37b6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constant reverse iterator type. <br /></td></tr>
<tr class="separator:a5a9f859755987f8844be29ad84cc37b6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a83489efab7359c9c31d910844d96faa5" id="r_a83489efab7359c9c31d910844d96faa5"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a83489efab7359c9c31d910844d96faa5">local_iterator</a> = internal::dense_set_local_iterator&lt;typename packed_container_type::iterator&gt;</td></tr>
<tr class="memdesc:a83489efab7359c9c31d910844d96faa5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Forward iterator type. <br /></td></tr>
<tr class="separator:a83489efab7359c9c31d910844d96faa5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0be70471e45867b1d18aa9ee57376496" id="r_a0be70471e45867b1d18aa9ee57376496"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0be70471e45867b1d18aa9ee57376496">const_local_iterator</a> = internal::dense_set_local_iterator&lt;typename packed_container_type::const_iterator&gt;</td></tr>
<tr class="memdesc:a0be70471e45867b1d18aa9ee57376496"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constant forward iterator type. <br /></td></tr>
<tr class="separator:a0be70471e45867b1d18aa9ee57376496"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:acb2185a8bef7bb0e248a61605c3b0bca" id="r_acb2185a8bef7bb0e248a61605c3b0bca"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acb2185a8bef7bb0e248a61605c3b0bca">dense_set</a> ()</td></tr>
<tr class="memdesc:acb2185a8bef7bb0e248a61605c3b0bca"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default constructor. <br /></td></tr>
<tr class="separator:acb2185a8bef7bb0e248a61605c3b0bca"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac6e88655aa8ad10f1abec3f096c64161" id="r_ac6e88655aa8ad10f1abec3f096c64161"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac6e88655aa8ad10f1abec3f096c64161">dense_set</a> (const <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> &amp;allocator)</td></tr>
<tr class="memdesc:ac6e88655aa8ad10f1abec3f096c64161"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs an empty container with a given allocator. <br /></td></tr>
<tr class="separator:ac6e88655aa8ad10f1abec3f096c64161"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7f5c5416bd4134d1709a13073f3682bc" id="r_a7f5c5416bd4134d1709a13073f3682bc"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7f5c5416bd4134d1709a13073f3682bc">dense_set</a> (const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> cnt, const <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> &amp;allocator)</td></tr>
<tr class="memdesc:a7f5c5416bd4134d1709a13073f3682bc"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs an empty container with a given allocator and user supplied minimal number of buckets. <br /></td></tr>
<tr class="separator:a7f5c5416bd4134d1709a13073f3682bc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6b6ebde571ce025b298aa580b2b77e5b" id="r_a6b6ebde571ce025b298aa580b2b77e5b"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6b6ebde571ce025b298aa580b2b77e5b">dense_set</a> (const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> cnt, const <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &amp;hash, const <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> &amp;allocator)</td></tr>
<tr class="memdesc:a6b6ebde571ce025b298aa580b2b77e5b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs an empty container with a given allocator, hash function and user supplied minimal number of buckets. <br /></td></tr>
<tr class="separator:a6b6ebde571ce025b298aa580b2b77e5b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad29198f1dc4accffa9fc9859af956df3" id="r_ad29198f1dc4accffa9fc9859af956df3"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad29198f1dc4accffa9fc9859af956df3">dense_set</a> (const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> cnt, const <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &amp;hash=<a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a>{}, const <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &amp;equal=<a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a>{}, const <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> &amp;allocator=<a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a>{})</td></tr>
<tr class="memdesc:ad29198f1dc4accffa9fc9859af956df3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs an empty container with a given allocator, hash function, compare function and user supplied minimal number of buckets. <br /></td></tr>
<tr class="separator:ad29198f1dc4accffa9fc9859af956df3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa84caa4b8ea63cc40d7c96158a35760f" id="r_aa84caa4b8ea63cc40d7c96158a35760f"><td class="memItemLeft" align="right" valign="top"><a id="aa84caa4b8ea63cc40d7c96158a35760f" name="aa84caa4b8ea63cc40d7c96158a35760f"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>dense_set</b> (const <a class="el" href="classentt_1_1dense__set.html">dense_set</a> &amp;)=default</td></tr>
<tr class="memdesc:aa84caa4b8ea63cc40d7c96158a35760f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default copy constructor. <br /></td></tr>
<tr class="separator:aa84caa4b8ea63cc40d7c96158a35760f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a68b3b28b433da48bece9ff3abf1d476e" id="r_a68b3b28b433da48bece9ff3abf1d476e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a68b3b28b433da48bece9ff3abf1d476e">dense_set</a> (const <a class="el" href="classentt_1_1dense__set.html">dense_set</a> &amp;other, const <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> &amp;allocator)</td></tr>
<tr class="memdesc:a68b3b28b433da48bece9ff3abf1d476e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Allocator-extended copy constructor. <br /></td></tr>
<tr class="separator:a68b3b28b433da48bece9ff3abf1d476e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab2a4eef9bb92ac32b118c155e643795e" id="r_ab2a4eef9bb92ac32b118c155e643795e"><td class="memItemLeft" align="right" valign="top"><a id="ab2a4eef9bb92ac32b118c155e643795e" name="ab2a4eef9bb92ac32b118c155e643795e"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>dense_set</b> (<a class="el" href="classentt_1_1dense__set.html">dense_set</a> &amp;&amp;) noexcept=default</td></tr>
<tr class="memdesc:ab2a4eef9bb92ac32b118c155e643795e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default move constructor. <br /></td></tr>
<tr class="separator:ab2a4eef9bb92ac32b118c155e643795e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ada9ee844d6f84e1670da4088f0e38361" id="r_ada9ee844d6f84e1670da4088f0e38361"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ada9ee844d6f84e1670da4088f0e38361">dense_set</a> (<a class="el" href="classentt_1_1dense__set.html">dense_set</a> &amp;&amp;other, const <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> &amp;allocator)</td></tr>
<tr class="memdesc:ada9ee844d6f84e1670da4088f0e38361"><td class="mdescLeft">&#160;</td><td class="mdescRight">Allocator-extended move constructor. <br /></td></tr>
<tr class="separator:ada9ee844d6f84e1670da4088f0e38361"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a878bf99193783308b365997219a34cbf" id="r_a878bf99193783308b365997219a34cbf"><td class="memItemLeft" align="right" valign="top"><a id="a878bf99193783308b365997219a34cbf" name="a878bf99193783308b365997219a34cbf"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>~dense_set</b> ()=default</td></tr>
<tr class="memdesc:a878bf99193783308b365997219a34cbf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default destructor. <br /></td></tr>
<tr class="separator:a878bf99193783308b365997219a34cbf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad26d7ce37fefc322767d3df9a2c83da6" id="r_ad26d7ce37fefc322767d3df9a2c83da6"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classentt_1_1dense__set.html">dense_set</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad26d7ce37fefc322767d3df9a2c83da6">operator=</a> (const <a class="el" href="classentt_1_1dense__set.html">dense_set</a> &amp;)=default</td></tr>
<tr class="memdesc:ad26d7ce37fefc322767d3df9a2c83da6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default copy assignment operator. <br /></td></tr>
<tr class="separator:ad26d7ce37fefc322767d3df9a2c83da6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a49d41accce8880851a66504317b2690c" id="r_a49d41accce8880851a66504317b2690c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classentt_1_1dense__set.html">dense_set</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a49d41accce8880851a66504317b2690c">operator=</a> (<a class="el" href="classentt_1_1dense__set.html">dense_set</a> &amp;&amp;) noexcept=default</td></tr>
<tr class="memdesc:a49d41accce8880851a66504317b2690c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default move assignment operator. <br /></td></tr>
<tr class="separator:a49d41accce8880851a66504317b2690c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab1199b43ef81b1fab9d52a0c1275dd56" id="r_ab1199b43ef81b1fab9d52a0c1275dd56"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab1199b43ef81b1fab9d52a0c1275dd56">swap</a> (<a class="el" href="classentt_1_1dense__set.html">dense_set</a> &amp;other) noexcept</td></tr>
<tr class="memdesc:ab1199b43ef81b1fab9d52a0c1275dd56"><td class="mdescLeft">&#160;</td><td class="mdescRight">Exchanges the contents with those of a given container. <br /></td></tr>
<tr class="separator:ab1199b43ef81b1fab9d52a0c1275dd56"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae130fd3c8ef0c3899ac2ba45fb6a1965" id="r_ae130fd3c8ef0c3899ac2ba45fb6a1965"><td class="memItemLeft" align="right" valign="top">constexpr <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae130fd3c8ef0c3899ac2ba45fb6a1965">get_allocator</a> () const noexcept</td></tr>
<tr class="memdesc:ae130fd3c8ef0c3899ac2ba45fb6a1965"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the associated allocator. <br /></td></tr>
<tr class="separator:ae130fd3c8ef0c3899ac2ba45fb6a1965"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a72d096d037d026cde4c1cae27dc326ba" id="r_a72d096d037d026cde4c1cae27dc326ba"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a72d096d037d026cde4c1cae27dc326ba">cbegin</a> () const noexcept</td></tr>
<tr class="memdesc:a72d096d037d026cde4c1cae27dc326ba"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns an iterator to the beginning. <br /></td></tr>
<tr class="separator:a72d096d037d026cde4c1cae27dc326ba"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2130895a2b9e794841b3afe3c6f793bb" id="r_a2130895a2b9e794841b3afe3c6f793bb"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2130895a2b9e794841b3afe3c6f793bb">begin</a> () const noexcept</td></tr>
<tr class="memdesc:a2130895a2b9e794841b3afe3c6f793bb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns an iterator to the beginning. <br /></td></tr>
<tr class="separator:a2130895a2b9e794841b3afe3c6f793bb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aff5d31abe96f4a71dd5d661e7f4feae1" id="r_aff5d31abe96f4a71dd5d661e7f4feae1"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aff5d31abe96f4a71dd5d661e7f4feae1">begin</a> () noexcept</td></tr>
<tr class="memdesc:aff5d31abe96f4a71dd5d661e7f4feae1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns an iterator to the beginning. <br /></td></tr>
<tr class="separator:aff5d31abe96f4a71dd5d661e7f4feae1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a29506e74715ef7fa560eb4726cff34ee" id="r_a29506e74715ef7fa560eb4726cff34ee"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a29506e74715ef7fa560eb4726cff34ee">cend</a> () const noexcept</td></tr>
<tr class="memdesc:a29506e74715ef7fa560eb4726cff34ee"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns an iterator to the end. <br /></td></tr>
<tr class="separator:a29506e74715ef7fa560eb4726cff34ee"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acba121addd4d2f1d273ed6c1d9ce711d" id="r_acba121addd4d2f1d273ed6c1d9ce711d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acba121addd4d2f1d273ed6c1d9ce711d">end</a> () const noexcept</td></tr>
<tr class="memdesc:acba121addd4d2f1d273ed6c1d9ce711d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns an iterator to the end. <br /></td></tr>
<tr class="separator:acba121addd4d2f1d273ed6c1d9ce711d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9969d69b8cd34bffe4fc0f0be83d16fa" id="r_a9969d69b8cd34bffe4fc0f0be83d16fa"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9969d69b8cd34bffe4fc0f0be83d16fa">end</a> () noexcept</td></tr>
<tr class="memdesc:a9969d69b8cd34bffe4fc0f0be83d16fa"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns an iterator to the end. <br /></td></tr>
<tr class="separator:a9969d69b8cd34bffe4fc0f0be83d16fa"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ecb4af728c919ff111a03cf79bc4dd3" id="r_a0ecb4af728c919ff111a03cf79bc4dd3"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a5a9f859755987f8844be29ad84cc37b6">const_reverse_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ecb4af728c919ff111a03cf79bc4dd3">crbegin</a> () const noexcept</td></tr>
<tr class="memdesc:a0ecb4af728c919ff111a03cf79bc4dd3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a reverse iterator to the beginning. <br /></td></tr>
<tr class="separator:a0ecb4af728c919ff111a03cf79bc4dd3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac979c28743c3adbda7405b8603116631" id="r_ac979c28743c3adbda7405b8603116631"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a5a9f859755987f8844be29ad84cc37b6">const_reverse_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac979c28743c3adbda7405b8603116631">rbegin</a> () const noexcept</td></tr>
<tr class="memdesc:ac979c28743c3adbda7405b8603116631"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a reverse iterator to the beginning. <br /></td></tr>
<tr class="separator:ac979c28743c3adbda7405b8603116631"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a38daeb37b2315869173227374e16ca0d" id="r_a38daeb37b2315869173227374e16ca0d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a8b91ff4841d5fc46d02544d71825822a">reverse_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a38daeb37b2315869173227374e16ca0d">rbegin</a> () noexcept</td></tr>
<tr class="memdesc:a38daeb37b2315869173227374e16ca0d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a reverse iterator to the beginning. <br /></td></tr>
<tr class="separator:a38daeb37b2315869173227374e16ca0d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ade757a21f4fc8d6db7bc594ad8157a59" id="r_ade757a21f4fc8d6db7bc594ad8157a59"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a5a9f859755987f8844be29ad84cc37b6">const_reverse_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ade757a21f4fc8d6db7bc594ad8157a59">crend</a> () const noexcept</td></tr>
<tr class="memdesc:ade757a21f4fc8d6db7bc594ad8157a59"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a reverse iterator to the end. <br /></td></tr>
<tr class="separator:ade757a21f4fc8d6db7bc594ad8157a59"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a77c4ca141381ddc6c09fd1ef2b594509" id="r_a77c4ca141381ddc6c09fd1ef2b594509"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a5a9f859755987f8844be29ad84cc37b6">const_reverse_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a77c4ca141381ddc6c09fd1ef2b594509">rend</a> () const noexcept</td></tr>
<tr class="memdesc:a77c4ca141381ddc6c09fd1ef2b594509"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a reverse iterator to the end. <br /></td></tr>
<tr class="separator:a77c4ca141381ddc6c09fd1ef2b594509"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae8c26808f90a31003009127bce24f346" id="r_ae8c26808f90a31003009127bce24f346"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a8b91ff4841d5fc46d02544d71825822a">reverse_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae8c26808f90a31003009127bce24f346">rend</a> () noexcept</td></tr>
<tr class="memdesc:ae8c26808f90a31003009127bce24f346"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a reverse iterator to the end. <br /></td></tr>
<tr class="separator:ae8c26808f90a31003009127bce24f346"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6a6ca36a20f2ad2af73161eb71c5aba2" id="r_a6a6ca36a20f2ad2af73161eb71c5aba2"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6a6ca36a20f2ad2af73161eb71c5aba2">empty</a> () const noexcept</td></tr>
<tr class="memdesc:a6a6ca36a20f2ad2af73161eb71c5aba2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks whether a container is empty. <br /></td></tr>
<tr class="separator:a6a6ca36a20f2ad2af73161eb71c5aba2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a51a05fcfc23785b7f38bd48b46ebf178" id="r_a51a05fcfc23785b7f38bd48b46ebf178"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a51a05fcfc23785b7f38bd48b46ebf178">size</a> () const noexcept</td></tr>
<tr class="memdesc:a51a05fcfc23785b7f38bd48b46ebf178"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the number of elements in a container. <br /></td></tr>
<tr class="separator:a51a05fcfc23785b7f38bd48b46ebf178"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4c6b94ce7998769b18635a11a7c044de" id="r_a4c6b94ce7998769b18635a11a7c044de"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4c6b94ce7998769b18635a11a7c044de">max_size</a> () const noexcept</td></tr>
<tr class="memdesc:a4c6b94ce7998769b18635a11a7c044de"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the maximum possible number of elements. <br /></td></tr>
<tr class="separator:a4c6b94ce7998769b18635a11a7c044de"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a00f6e4f5dd97cbf86554ec14799d2865" id="r_a00f6e4f5dd97cbf86554ec14799d2865"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a00f6e4f5dd97cbf86554ec14799d2865">clear</a> () noexcept</td></tr>
<tr class="memdesc:a00f6e4f5dd97cbf86554ec14799d2865"><td class="mdescLeft">&#160;</td><td class="mdescRight">Clears the container. <br /></td></tr>
<tr class="separator:a00f6e4f5dd97cbf86554ec14799d2865"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a818d80686b709f02cec08f5fc082e279" id="r_a818d80686b709f02cec08f5fc082e279"><td class="memItemLeft" align="right" valign="top">std::pair&lt; <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>, bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a818d80686b709f02cec08f5fc082e279">insert</a> (const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;value)</td></tr>
<tr class="memdesc:a818d80686b709f02cec08f5fc082e279"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts an element into the container, if it does not exist. <br /></td></tr>
<tr class="separator:a818d80686b709f02cec08f5fc082e279"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac1c11ba7070fd958ada9dab7b9106ec6" id="r_ac1c11ba7070fd958ada9dab7b9106ec6"><td class="memItemLeft" align="right" valign="top">std::pair&lt; <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>, bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac1c11ba7070fd958ada9dab7b9106ec6">insert</a> (<a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;&amp;value)</td></tr>
<tr class="memdesc:ac1c11ba7070fd958ada9dab7b9106ec6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts an element into the container, if it does not exist. <br /></td></tr>
<tr class="separator:ac1c11ba7070fd958ada9dab7b9106ec6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae52c7f8b38e6bfc15e421fcc8021ba15" id="r_ae52c7f8b38e6bfc15e421fcc8021ba15"><td class="memTemplParams" colspan="2">template&lt;typename It&gt; </td></tr>
<tr class="memitem:ae52c7f8b38e6bfc15e421fcc8021ba15"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae52c7f8b38e6bfc15e421fcc8021ba15">insert</a> (It first, It last)</td></tr>
<tr class="memdesc:ae52c7f8b38e6bfc15e421fcc8021ba15"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts elements into the container, if they do not exist. <br /></td></tr>
<tr class="separator:ae52c7f8b38e6bfc15e421fcc8021ba15"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a47d3197d0c31a680cb7d9379f8a3c3d3" id="r_a47d3197d0c31a680cb7d9379f8a3c3d3"><td class="memTemplParams" colspan="2">template&lt;typename... Args&gt; </td></tr>
<tr class="memitem:a47d3197d0c31a680cb7d9379f8a3c3d3"><td class="memTemplItemLeft" align="right" valign="top">std::pair&lt; <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>, bool &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a47d3197d0c31a680cb7d9379f8a3c3d3">emplace</a> (Args &amp;&amp;...args)</td></tr>
<tr class="memdesc:a47d3197d0c31a680cb7d9379f8a3c3d3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs an element in-place, if it does not exist. <br /></td></tr>
<tr class="separator:a47d3197d0c31a680cb7d9379f8a3c3d3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad4ada548c135e15f963efcbdac476e1b" id="r_ad4ada548c135e15f963efcbdac476e1b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad4ada548c135e15f963efcbdac476e1b">erase</a> (<a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> pos)</td></tr>
<tr class="memdesc:ad4ada548c135e15f963efcbdac476e1b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Removes an element from a given position. <br /></td></tr>
<tr class="separator:ad4ada548c135e15f963efcbdac476e1b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2c82fe5721d008445d6bb9af2448cbcd" id="r_a2c82fe5721d008445d6bb9af2448cbcd"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2c82fe5721d008445d6bb9af2448cbcd">erase</a> (<a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> first, <a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> last)</td></tr>
<tr class="memdesc:a2c82fe5721d008445d6bb9af2448cbcd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Removes the given elements from a container. <br /></td></tr>
<tr class="separator:a2c82fe5721d008445d6bb9af2448cbcd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abe614f630f49556a49f65c7ed3e1183a" id="r_abe614f630f49556a49f65c7ed3e1183a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abe614f630f49556a49f65c7ed3e1183a">erase</a> (const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;value)</td></tr>
<tr class="memdesc:abe614f630f49556a49f65c7ed3e1183a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Removes the element associated with a given value. <br /></td></tr>
<tr class="separator:abe614f630f49556a49f65c7ed3e1183a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8d3596e86387eb57317a565f23b3d7b9" id="r_a8d3596e86387eb57317a565f23b3d7b9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8d3596e86387eb57317a565f23b3d7b9">count</a> (const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;key) const</td></tr>
<tr class="memdesc:a8d3596e86387eb57317a565f23b3d7b9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the number of elements matching a value (either 1 or 0). <br /></td></tr>
<tr class="separator:a8d3596e86387eb57317a565f23b3d7b9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae07fa72742e52a2a2823252487af5263" id="r_ae07fa72742e52a2a2823252487af5263"><td class="memTemplParams" colspan="2">template&lt;typename Other&gt; </td></tr>
<tr class="memitem:ae07fa72742e52a2a2823252487af5263"><td class="memTemplItemLeft" align="right" valign="top">std::enable_if_t&lt; <a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &gt; &amp;&amp;<a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &gt;, std::conditional_t&lt; false, Other, <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae07fa72742e52a2a2823252487af5263">count</a> (const Other &amp;key) const</td></tr>
<tr class="memdesc:ae07fa72742e52a2a2823252487af5263"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the number of elements matching a key (either 1 or 0). <br /></td></tr>
<tr class="separator:ae07fa72742e52a2a2823252487af5263"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3cb64f1ed07507fc9ecbc6f94e582e44" id="r_a3cb64f1ed07507fc9ecbc6f94e582e44"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3cb64f1ed07507fc9ecbc6f94e582e44">find</a> (const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;value)</td></tr>
<tr class="memdesc:a3cb64f1ed07507fc9ecbc6f94e582e44"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds an element with a given value. <br /></td></tr>
<tr class="separator:a3cb64f1ed07507fc9ecbc6f94e582e44"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6e8732dc86fd8f04f585deebb0b39ad5" id="r_a6e8732dc86fd8f04f585deebb0b39ad5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6e8732dc86fd8f04f585deebb0b39ad5">find</a> (const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;value) const</td></tr>
<tr class="memdesc:a6e8732dc86fd8f04f585deebb0b39ad5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds an element with a given value. <br /></td></tr>
<tr class="separator:a6e8732dc86fd8f04f585deebb0b39ad5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad75a164225ececfa173b230e587b46c6" id="r_ad75a164225ececfa173b230e587b46c6"><td class="memTemplParams" colspan="2">template&lt;typename Other&gt; </td></tr>
<tr class="memitem:ad75a164225ececfa173b230e587b46c6"><td class="memTemplItemLeft" align="right" valign="top">std::enable_if_t&lt; <a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &gt; &amp;&amp;<a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &gt;, std::conditional_t&lt; false, Other, <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a> &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad75a164225ececfa173b230e587b46c6">find</a> (const Other &amp;value)</td></tr>
<tr class="memdesc:ad75a164225ececfa173b230e587b46c6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds an element that compares <em>equivalent</em> to a given value. <br /></td></tr>
<tr class="separator:ad75a164225ececfa173b230e587b46c6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9ef9e51dc8219cfd2427a7594ff4bf65" id="r_a9ef9e51dc8219cfd2427a7594ff4bf65"><td class="memTemplParams" colspan="2">template&lt;typename Other&gt; </td></tr>
<tr class="memitem:a9ef9e51dc8219cfd2427a7594ff4bf65"><td class="memTemplItemLeft" align="right" valign="top">std::enable_if_t&lt; <a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &gt; &amp;&amp;<a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &gt;, std::conditional_t&lt; false, Other, <a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a9ef9e51dc8219cfd2427a7594ff4bf65">find</a> (const Other &amp;value) const</td></tr>
<tr class="memdesc:a9ef9e51dc8219cfd2427a7594ff4bf65"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds an element with a given value. <br /></td></tr>
<tr class="separator:a9ef9e51dc8219cfd2427a7594ff4bf65"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5a20617f3bdbf845f746856efbbb99ef" id="r_a5a20617f3bdbf845f746856efbbb99ef"><td class="memItemLeft" align="right" valign="top">std::pair&lt; <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>, <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5a20617f3bdbf845f746856efbbb99ef">equal_range</a> (const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;value)</td></tr>
<tr class="memdesc:a5a20617f3bdbf845f746856efbbb99ef"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a range containing all elements with a given value. <br /></td></tr>
<tr class="separator:a5a20617f3bdbf845f746856efbbb99ef"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af11a86dfc5bd93593a947522fa70bc13" id="r_af11a86dfc5bd93593a947522fa70bc13"><td class="memItemLeft" align="right" valign="top">std::pair&lt; <a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a>, <a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af11a86dfc5bd93593a947522fa70bc13">equal_range</a> (const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;value) const</td></tr>
<tr class="memdesc:af11a86dfc5bd93593a947522fa70bc13"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a range containing all elements with a given value. <br /></td></tr>
<tr class="separator:af11a86dfc5bd93593a947522fa70bc13"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6207a4c30c9dbc48ebd45f139114144e" id="r_a6207a4c30c9dbc48ebd45f139114144e"><td class="memTemplParams" colspan="2">template&lt;typename Other&gt; </td></tr>
<tr class="memitem:a6207a4c30c9dbc48ebd45f139114144e"><td class="memTemplItemLeft" align="right" valign="top">std::enable_if_t&lt; <a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &gt; &amp;&amp;<a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &gt;, std::conditional_t&lt; false, Other, std::pair&lt; <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>, <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a> &gt; &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a6207a4c30c9dbc48ebd45f139114144e">equal_range</a> (const Other &amp;value)</td></tr>
<tr class="memdesc:a6207a4c30c9dbc48ebd45f139114144e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a range containing all elements that compare <em>equivalent</em> to a given value. <br /></td></tr>
<tr class="separator:a6207a4c30c9dbc48ebd45f139114144e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aec681fa3aabf02aaf7666123946817b8" id="r_aec681fa3aabf02aaf7666123946817b8"><td class="memTemplParams" colspan="2">template&lt;typename Other&gt; </td></tr>
<tr class="memitem:aec681fa3aabf02aaf7666123946817b8"><td class="memTemplItemLeft" align="right" valign="top">std::enable_if_t&lt; <a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &gt; &amp;&amp;<a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &gt;, std::conditional_t&lt; false, Other, std::pair&lt; <a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a>, <a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> &gt; &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aec681fa3aabf02aaf7666123946817b8">equal_range</a> (const Other &amp;value) const</td></tr>
<tr class="memdesc:aec681fa3aabf02aaf7666123946817b8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a range containing all elements with a given value. <br /></td></tr>
<tr class="separator:aec681fa3aabf02aaf7666123946817b8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afd77a2703fb72d17f382f5cb1aeb24b2" id="r_afd77a2703fb72d17f382f5cb1aeb24b2"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afd77a2703fb72d17f382f5cb1aeb24b2">contains</a> (const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;value) const</td></tr>
<tr class="memdesc:afd77a2703fb72d17f382f5cb1aeb24b2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks if the container contains an element with a given value. <br /></td></tr>
<tr class="separator:afd77a2703fb72d17f382f5cb1aeb24b2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2f15a3c269ae641901904a3806ee128a" id="r_a2f15a3c269ae641901904a3806ee128a"><td class="memTemplParams" colspan="2">template&lt;typename Other&gt; </td></tr>
<tr class="memitem:a2f15a3c269ae641901904a3806ee128a"><td class="memTemplItemLeft" align="right" valign="top">std::enable_if_t&lt; <a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &gt; &amp;&amp;<a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &gt;, std::conditional_t&lt; false, Other, bool &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a2f15a3c269ae641901904a3806ee128a">contains</a> (const Other &amp;value) const</td></tr>
<tr class="memdesc:a2f15a3c269ae641901904a3806ee128a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks if the container contains an element that compares <em>equivalent</em> to a given value. <br /></td></tr>
<tr class="separator:a2f15a3c269ae641901904a3806ee128a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af66d225983e161e2f5b6bcd839dd295e" id="r_af66d225983e161e2f5b6bcd839dd295e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a0be70471e45867b1d18aa9ee57376496">const_local_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af66d225983e161e2f5b6bcd839dd295e">cbegin</a> (const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> index) const</td></tr>
<tr class="memdesc:af66d225983e161e2f5b6bcd839dd295e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns an iterator to the beginning of a given bucket. <br /></td></tr>
<tr class="separator:af66d225983e161e2f5b6bcd839dd295e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af40a2a303dddc229bce36516d18921d5" id="r_af40a2a303dddc229bce36516d18921d5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a0be70471e45867b1d18aa9ee57376496">const_local_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af40a2a303dddc229bce36516d18921d5">begin</a> (const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> index) const</td></tr>
<tr class="memdesc:af40a2a303dddc229bce36516d18921d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns an iterator to the beginning of a given bucket. <br /></td></tr>
<tr class="separator:af40a2a303dddc229bce36516d18921d5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af5dfa9caba33563b1678e85d2774609c" id="r_af5dfa9caba33563b1678e85d2774609c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a83489efab7359c9c31d910844d96faa5">local_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af5dfa9caba33563b1678e85d2774609c">begin</a> (const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> index)</td></tr>
<tr class="memdesc:af5dfa9caba33563b1678e85d2774609c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns an iterator to the beginning of a given bucket. <br /></td></tr>
<tr class="separator:af5dfa9caba33563b1678e85d2774609c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8b88d43b273bf11855fe1df801f3a27c" id="r_a8b88d43b273bf11855fe1df801f3a27c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a0be70471e45867b1d18aa9ee57376496">const_local_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8b88d43b273bf11855fe1df801f3a27c">cend</a> (const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> index) const</td></tr>
<tr class="memdesc:a8b88d43b273bf11855fe1df801f3a27c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns an iterator to the end of a given bucket. <br /></td></tr>
<tr class="separator:a8b88d43b273bf11855fe1df801f3a27c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab5fa4899ccdf38b575c7467da213ffa4" id="r_ab5fa4899ccdf38b575c7467da213ffa4"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a0be70471e45867b1d18aa9ee57376496">const_local_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab5fa4899ccdf38b575c7467da213ffa4">end</a> (const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> index) const</td></tr>
<tr class="memdesc:ab5fa4899ccdf38b575c7467da213ffa4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns an iterator to the end of a given bucket. <br /></td></tr>
<tr class="separator:ab5fa4899ccdf38b575c7467da213ffa4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a64228ede854cfd6b98665e98ba724542" id="r_a64228ede854cfd6b98665e98ba724542"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a83489efab7359c9c31d910844d96faa5">local_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a64228ede854cfd6b98665e98ba724542">end</a> (const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> index)</td></tr>
<tr class="memdesc:a64228ede854cfd6b98665e98ba724542"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns an iterator to the end of a given bucket. <br /></td></tr>
<tr class="separator:a64228ede854cfd6b98665e98ba724542"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4ad74d3386c317d8aa2f9a2c88f410e4" id="r_a4ad74d3386c317d8aa2f9a2c88f410e4"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4ad74d3386c317d8aa2f9a2c88f410e4">bucket_count</a> () const</td></tr>
<tr class="memdesc:a4ad74d3386c317d8aa2f9a2c88f410e4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the number of buckets. <br /></td></tr>
<tr class="separator:a4ad74d3386c317d8aa2f9a2c88f410e4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac3410a73c0331657be2da1c8f0855949" id="r_ac3410a73c0331657be2da1c8f0855949"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac3410a73c0331657be2da1c8f0855949">max_bucket_count</a> () const</td></tr>
<tr class="memdesc:ac3410a73c0331657be2da1c8f0855949"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the maximum number of buckets. <br /></td></tr>
<tr class="separator:ac3410a73c0331657be2da1c8f0855949"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a001d564dcf11933f59592f15709830d0" id="r_a001d564dcf11933f59592f15709830d0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a001d564dcf11933f59592f15709830d0">bucket_size</a> (const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> index) const</td></tr>
<tr class="memdesc:a001d564dcf11933f59592f15709830d0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the number of elements in a given bucket. <br /></td></tr>
<tr class="separator:a001d564dcf11933f59592f15709830d0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a36a7137bfb36d2ca5026d986710cc05a" id="r_a36a7137bfb36d2ca5026d986710cc05a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a36a7137bfb36d2ca5026d986710cc05a">bucket</a> (const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;value) const</td></tr>
<tr class="memdesc:a36a7137bfb36d2ca5026d986710cc05a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the bucket for a given element. <br /></td></tr>
<tr class="separator:a36a7137bfb36d2ca5026d986710cc05a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abceb56d6788f953e79b6d6924bfcbfe2" id="r_abceb56d6788f953e79b6d6924bfcbfe2"><td class="memItemLeft" align="right" valign="top">float&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abceb56d6788f953e79b6d6924bfcbfe2">load_factor</a> () const</td></tr>
<tr class="memdesc:abceb56d6788f953e79b6d6924bfcbfe2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the average number of elements per bucket. <br /></td></tr>
<tr class="separator:abceb56d6788f953e79b6d6924bfcbfe2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aeb02fd08b390059b8c1cffc39a6f40f1" id="r_aeb02fd08b390059b8c1cffc39a6f40f1"><td class="memItemLeft" align="right" valign="top">float&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeb02fd08b390059b8c1cffc39a6f40f1">max_load_factor</a> () const</td></tr>
<tr class="memdesc:aeb02fd08b390059b8c1cffc39a6f40f1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the maximum average number of elements per bucket. <br /></td></tr>
<tr class="separator:aeb02fd08b390059b8c1cffc39a6f40f1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab740b6ce89b700657c796b7388563569" id="r_ab740b6ce89b700657c796b7388563569"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab740b6ce89b700657c796b7388563569">max_load_factor</a> (const float value)</td></tr>
<tr class="memdesc:ab740b6ce89b700657c796b7388563569"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the desired maximum average number of elements per bucket. <br /></td></tr>
<tr class="separator:ab740b6ce89b700657c796b7388563569"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ade485155ec5ec107a0c3582aa848e376" id="r_ade485155ec5ec107a0c3582aa848e376"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ade485155ec5ec107a0c3582aa848e376">rehash</a> (const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> cnt)</td></tr>
<tr class="memdesc:ade485155ec5ec107a0c3582aa848e376"><td class="mdescLeft">&#160;</td><td class="mdescRight">Reserves at least the specified number of buckets and regenerates the hash table. <br /></td></tr>
<tr class="separator:ade485155ec5ec107a0c3582aa848e376"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a899d206bbac4c0fe88f16a4ce2215b4a" id="r_a899d206bbac4c0fe88f16a4ce2215b4a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a899d206bbac4c0fe88f16a4ce2215b4a">reserve</a> (const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> cnt)</td></tr>
<tr class="memdesc:a899d206bbac4c0fe88f16a4ce2215b4a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Reserves space for at least the specified number of elements and regenerates the hash table. <br /></td></tr>
<tr class="separator:a899d206bbac4c0fe88f16a4ce2215b4a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7f9a2eaac7725273d76b340f6e46c821" id="r_a7f9a2eaac7725273d76b340f6e46c821"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7f9a2eaac7725273d76b340f6e46c821">hash_function</a> () const</td></tr>
<tr class="memdesc:a7f9a2eaac7725273d76b340f6e46c821"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the function used to hash the elements. <br /></td></tr>
<tr class="separator:a7f9a2eaac7725273d76b340f6e46c821"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2520bd4106132dab9a4c71ef8388e186" id="r_a2520bd4106132dab9a4c71ef8388e186"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2520bd4106132dab9a4c71ef8388e186">key_eq</a> () const</td></tr>
<tr class="memdesc:a2520bd4106132dab9a4c71ef8388e186"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the function used to compare elements for equality. <br /></td></tr>
<tr class="separator:a2520bd4106132dab9a4c71ef8388e186"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><div class="compoundTemplParams">template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt;<br />
class entt::dense_set&lt; Type, Hash, KeyEqual, Allocator &gt;</div><p>Associative container for unique objects of a given type. </p>
<p>Internally, elements are organized into buckets. Which bucket an element is placed into depends entirely on its hash. Elements with the same hash code appear in the same bucket.</p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">Type</td><td>Value type of the associative container. </td></tr>
<tr><td class="paramname">Hash</td><td>Type of function to use to hash the values. </td></tr>
<tr><td class="paramname">KeyEqual</td><td>Type of function to use to compare the values for equality. </td></tr>
<tr><td class="paramname">Allocator</td><td>Type of allocator used to manage memory and elements. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00220">220</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div><h2 class="groupheader">Member Typedef Documentation</h2>
<a id="a8c83fbdb7d106f60f98d3ae3f395abc2" name="a8c83fbdb7d106f60f98d3ae3f395abc2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8c83fbdb7d106f60f98d3ae3f395abc2">&#9670;&#160;</a></span>allocator_type</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::allocator_type = Allocator</td>
</tr>
</table>
</div><div class="memdoc">
<p>Allocator type. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00291">291</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a271e1e1f94361e8156c6de5a81746943" name="a271e1e1f94361e8156c6de5a81746943"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a271e1e1f94361e8156c6de5a81746943">&#9670;&#160;</a></span>const_iterator</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::const_iterator = internal::dense_set_iterator&lt;typename packed_container_type::const_iterator&gt;</td>
</tr>
</table>
</div><div class="memdoc">
<p>Constant random access iterator type. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00307">307</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a0be70471e45867b1d18aa9ee57376496" name="a0be70471e45867b1d18aa9ee57376496"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0be70471e45867b1d18aa9ee57376496">&#9670;&#160;</a></span>const_local_iterator</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::const_local_iterator = internal::dense_set_local_iterator&lt;typename packed_container_type::const_iterator&gt;</td>
</tr>
</table>
</div><div class="memdoc">
<p>Constant forward iterator type. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00315">315</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a5a9f859755987f8844be29ad84cc37b6" name="a5a9f859755987f8844be29ad84cc37b6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5a9f859755987f8844be29ad84cc37b6">&#9670;&#160;</a></span>const_reverse_iterator</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::const_reverse_iterator = std::reverse_iterator&lt;<a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a>&gt;</td>
</tr>
</table>
</div><div class="memdoc">
<p>Constant reverse iterator type. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00311">311</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a12f11ca5f036cb6f606952e2e506179c" name="a12f11ca5f036cb6f606952e2e506179c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a12f11ca5f036cb6f606952e2e506179c">&#9670;&#160;</a></span>difference_type</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::difference_type = std::ptrdiff_t</td>
</tr>
</table>
</div><div class="memdoc">
<p>Signed integer type. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00299">299</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a2fb78f57d6f35f6235468e4aadb2fe0e" name="a2fb78f57d6f35f6235468e4aadb2fe0e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2fb78f57d6f35f6235468e4aadb2fe0e">&#9670;&#160;</a></span>hasher</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::hasher = Hash</td>
</tr>
</table>
</div><div class="memdoc">
<p>Type of function to use to hash the elements. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00301">301</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a44f127ff9c4a0fa1c8284f7d072bd5c3" name="a44f127ff9c4a0fa1c8284f7d072bd5c3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">&#9670;&#160;</a></span>iterator</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::iterator = internal::dense_set_iterator&lt;typename packed_container_type::iterator&gt;</td>
</tr>
</table>
</div><div class="memdoc">
<p>Random access iterator type. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00305">305</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a266d306cce7016dba8fdbf3790a0cb39" name="a266d306cce7016dba8fdbf3790a0cb39"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a266d306cce7016dba8fdbf3790a0cb39">&#9670;&#160;</a></span>key_equal</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::key_equal = KeyEqual</td>
</tr>
</table>
</div><div class="memdoc">
<p>Type of function to use to compare the elements for equality. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00303">303</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a404f1b7ec2ba2fe41d72f4deacf3ed3f" name="a404f1b7ec2ba2fe41d72f4deacf3ed3f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a404f1b7ec2ba2fe41d72f4deacf3ed3f">&#9670;&#160;</a></span>key_type</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::key_type = Type</td>
</tr>
</table>
</div><div class="memdoc">
<p>Key type of the container. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00293">293</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a83489efab7359c9c31d910844d96faa5" name="a83489efab7359c9c31d910844d96faa5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a83489efab7359c9c31d910844d96faa5">&#9670;&#160;</a></span>local_iterator</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::local_iterator = internal::dense_set_local_iterator&lt;typename packed_container_type::iterator&gt;</td>
</tr>
</table>
</div><div class="memdoc">
<p>Forward iterator type. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00313">313</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a8b91ff4841d5fc46d02544d71825822a" name="a8b91ff4841d5fc46d02544d71825822a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8b91ff4841d5fc46d02544d71825822a">&#9670;&#160;</a></span>reverse_iterator</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::reverse_iterator = std::reverse_iterator&lt;<a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>&gt;</td>
</tr>
</table>
</div><div class="memdoc">
<p>Reverse iterator type. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00309">309</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a3355912feda8db49d87b75247f824ce0" name="a3355912feda8db49d87b75247f824ce0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3355912feda8db49d87b75247f824ce0">&#9670;&#160;</a></span>size_type</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::size_type = std::size_t</td>
</tr>
</table>
</div><div class="memdoc">
<p>Unsigned integer type. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00297">297</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a42092d77add471a91a60b0aebd515829" name="a42092d77add471a91a60b0aebd515829"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a42092d77add471a91a60b0aebd515829">&#9670;&#160;</a></span>value_type</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::value_type = Type</td>
</tr>
</table>
</div><div class="memdoc">
<p>Value type of the container. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00295">295</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="acb2185a8bef7bb0e248a61605c3b0bca" name="acb2185a8bef7bb0e248a61605c3b0bca"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acb2185a8bef7bb0e248a61605c3b0bca">&#9670;&#160;</a></span>dense_set() <span class="overload">[1/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::dense_set </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Default constructor. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00318">318</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ac6e88655aa8ad10f1abec3f096c64161" name="ac6e88655aa8ad10f1abec3f096c64161"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac6e88655aa8ad10f1abec3f096c64161">&#9670;&#160;</a></span>dense_set() <span class="overload">[2/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::dense_set </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>allocator</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel explicit">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Constructs an empty container with a given allocator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">allocator</td><td>The allocator to use. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00325">325</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a7f5c5416bd4134d1709a13073f3682bc" name="a7f5c5416bd4134d1709a13073f3682bc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7f5c5416bd4134d1709a13073f3682bc">&#9670;&#160;</a></span>dense_set() <span class="overload">[3/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::dense_set </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a></td> <td class="paramname"><span class="paramname"><em>cnt</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>allocator</em></span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Constructs an empty container with a given allocator and user supplied minimal number of buckets. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cnt</td><td>Minimal number of buckets. </td></tr>
<tr><td class="paramname">allocator</td><td>The allocator to use. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00334">334</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a6b6ebde571ce025b298aa580b2b77e5b" name="a6b6ebde571ce025b298aa580b2b77e5b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6b6ebde571ce025b298aa580b2b77e5b">&#9670;&#160;</a></span>dense_set() <span class="overload">[4/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::dense_set </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a></td> <td class="paramname"><span class="paramname"><em>cnt</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &amp;</td> <td class="paramname"><span class="paramname"><em>hash</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>allocator</em></span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Constructs an empty container with a given allocator, hash function and user supplied minimal number of buckets. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cnt</td><td>Minimal number of buckets. </td></tr>
<tr><td class="paramname">hash</td><td>Hash function to use. </td></tr>
<tr><td class="paramname">allocator</td><td>The allocator to use. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00344">344</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ad29198f1dc4accffa9fc9859af956df3" name="ad29198f1dc4accffa9fc9859af956df3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad29198f1dc4accffa9fc9859af956df3">&#9670;&#160;</a></span>dense_set() <span class="overload">[5/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::dense_set </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a></td> <td class="paramname"><span class="paramname"><em>cnt</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &amp;</td> <td class="paramname"><span class="paramname"><em>hash</em></span><span class="paramdefsep"> = </span><span class="paramdefval"><a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a>{}</span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &amp;</td> <td class="paramname"><span class="paramname"><em>equal</em></span><span class="paramdefsep"> = </span><span class="paramdefval"><a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a>{}</span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>allocator</em></span><span class="paramdefsep"> = </span><span class="paramdefval"><a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a>{}</span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel explicit">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Constructs an empty container with a given allocator, hash function, compare function and user supplied minimal number of buckets. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cnt</td><td>Minimal number of buckets. </td></tr>
<tr><td class="paramname">hash</td><td>Hash function to use. </td></tr>
<tr><td class="paramname">equal</td><td>Compare function to use. </td></tr>
<tr><td class="paramname">allocator</td><td>The allocator to use. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00355">355</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a68b3b28b433da48bece9ff3abf1d476e" name="a68b3b28b433da48bece9ff3abf1d476e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a68b3b28b433da48bece9ff3abf1d476e">&#9670;&#160;</a></span>dense_set() <span class="overload">[6/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::dense_set </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classentt_1_1dense__set.html">dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>other</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>allocator</em></span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Allocator-extended copy constructor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">other</td><td>The instance to copy from. </td></tr>
<tr><td class="paramname">allocator</td><td>The allocator to use. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00369">369</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ada9ee844d6f84e1670da4088f0e38361" name="ada9ee844d6f84e1670da4088f0e38361"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ada9ee844d6f84e1670da4088f0e38361">&#9670;&#160;</a></span>dense_set() <span class="overload">[7/7]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::dense_set </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classentt_1_1dense__set.html">dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt; &amp;&amp;</td> <td class="paramname"><span class="paramname"><em>other</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>allocator</em></span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Allocator-extended move constructor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">other</td><td>The instance to move from. </td></tr>
<tr><td class="paramname">allocator</td><td>The allocator to use. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00382">382</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a2130895a2b9e794841b3afe3c6f793bb" name="a2130895a2b9e794841b3afe3c6f793bb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2130895a2b9e794841b3afe3c6f793bb">&#9670;&#160;</a></span>begin() <span class="overload">[1/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::begin </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns an iterator to the beginning. </p>
<p>If the array is empty, the returned iterator will be equal to <code><a class="el" href="#acba121addd4d2f1d273ed6c1d9ce711d" title="Returns an iterator to the end.">end()</a></code>.</p>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the first instance of the internal array. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00433">433</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="aff5d31abe96f4a71dd5d661e7f4feae1" name="aff5d31abe96f4a71dd5d661e7f4feae1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aff5d31abe96f4a71dd5d661e7f4feae1">&#9670;&#160;</a></span>begin() <span class="overload">[2/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::begin </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns an iterator to the beginning. </p>
<p>If the array is empty, the returned iterator will be equal to <code><a class="el" href="#acba121addd4d2f1d273ed6c1d9ce711d" title="Returns an iterator to the end.">end()</a></code>.</p>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the first instance of the internal array. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00438">438</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="af5dfa9caba33563b1678e85d2774609c" name="af5dfa9caba33563b1678e85d2774609c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af5dfa9caba33563b1678e85d2774609c">&#9670;&#160;</a></span>begin() <span class="overload">[3/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a83489efab7359c9c31d910844d96faa5">local_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::begin </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a></td> <td class="paramname"><span class="paramname"><em>index</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns an iterator to the beginning of a given bucket. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">index</td><td>An index of a bucket to access. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the beginning of the given bucket. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00780">780</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="af40a2a303dddc229bce36516d18921d5" name="af40a2a303dddc229bce36516d18921d5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af40a2a303dddc229bce36516d18921d5">&#9670;&#160;</a></span>begin() <span class="overload">[4/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a0be70471e45867b1d18aa9ee57376496">const_local_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::begin </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a></td> <td class="paramname"><span class="paramname"><em>index</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns an iterator to the beginning of a given bucket. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">index</td><td>An index of a bucket to access. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the beginning of the given bucket. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00771">771</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a36a7137bfb36d2ca5026d986710cc05a" name="a36a7137bfb36d2ca5026d986710cc05a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a36a7137bfb36d2ca5026d986710cc05a">&#9670;&#160;</a></span>bucket()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::bucket </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the bucket for a given element. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>The value of the element to examine. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The bucket for the given element. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00841">841</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a4ad74d3386c317d8aa2f9a2c88f410e4" name="a4ad74d3386c317d8aa2f9a2c88f410e4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4ad74d3386c317d8aa2f9a2c88f410e4">&#9670;&#160;</a></span>bucket_count()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::bucket_count </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the number of buckets. </p>
<dl class="section return"><dt>Returns</dt><dd>The number of buckets. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00815">815</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a001d564dcf11933f59592f15709830d0" name="a001d564dcf11933f59592f15709830d0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a001d564dcf11933f59592f15709830d0">&#9670;&#160;</a></span>bucket_size()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::bucket_size </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a></td> <td class="paramname"><span class="paramname"><em>index</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the number of elements in a given bucket. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">index</td><td>The index of the bucket to examine. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The number of elements in the given bucket. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00832">832</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a72d096d037d026cde4c1cae27dc326ba" name="a72d096d037d026cde4c1cae27dc326ba"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a72d096d037d026cde4c1cae27dc326ba">&#9670;&#160;</a></span>cbegin() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::cbegin </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns an iterator to the beginning. </p>
<p>If the array is empty, the returned iterator will be equal to <code><a class="el" href="#acba121addd4d2f1d273ed6c1d9ce711d" title="Returns an iterator to the end.">end()</a></code>.</p>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the first instance of the internal array. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00428">428</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="af66d225983e161e2f5b6bcd839dd295e" name="af66d225983e161e2f5b6bcd839dd295e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af66d225983e161e2f5b6bcd839dd295e">&#9670;&#160;</a></span>cbegin() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a0be70471e45867b1d18aa9ee57376496">const_local_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::cbegin </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a></td> <td class="paramname"><span class="paramname"><em>index</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns an iterator to the beginning of a given bucket. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">index</td><td>An index of a bucket to access. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the beginning of the given bucket. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00762">762</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a29506e74715ef7fa560eb4726cff34ee" name="a29506e74715ef7fa560eb4726cff34ee"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a29506e74715ef7fa560eb4726cff34ee">&#9670;&#160;</a></span>cend() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::cend </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns an iterator to the end. </p>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the element following the last instance of the internal array. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00447">447</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a8b88d43b273bf11855fe1df801f3a27c" name="a8b88d43b273bf11855fe1df801f3a27c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8b88d43b273bf11855fe1df801f3a27c">&#9670;&#160;</a></span>cend() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a0be70471e45867b1d18aa9ee57376496">const_local_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::cend </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a></td> <td class="paramname"><span class="paramname"><em>index</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns an iterator to the end of a given bucket. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">index</td><td>An index of a bucket to access. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the end of the given bucket. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00789">789</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a00f6e4f5dd97cbf86554ec14799d2865" name="a00f6e4f5dd97cbf86554ec14799d2865"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a00f6e4f5dd97cbf86554ec14799d2865">&#9670;&#160;</a></span>clear()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::clear </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Clears the container. </p>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00526">526</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a2f15a3c269ae641901904a3806ee128a" name="a2f15a3c269ae641901904a3806ee128a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2f15a3c269ae641901904a3806ee128a">&#9670;&#160;</a></span>contains() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<div class="memtemplate">
template&lt;typename Other&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::enable_if_t&lt; <a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &gt; &amp;&amp;<a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &gt;, std::conditional_t&lt; false, Other, bool &gt; &gt; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::contains </td>
<td>(</td>
<td class="paramtype">const Other &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Checks if the container contains an element that compares <em>equivalent</em> to a given value. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">Other</td><td>Type of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>True if there is such an element, false otherwise. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00753">753</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="afd77a2703fb72d17f382f5cb1aeb24b2" name="afd77a2703fb72d17f382f5cb1aeb24b2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afd77a2703fb72d17f382f5cb1aeb24b2">&#9670;&#160;</a></span>contains() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::contains </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Checks if the container contains an element with a given value. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>True if there is such an element, false otherwise. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00740">740</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ae07fa72742e52a2a2823252487af5263" name="ae07fa72742e52a2a2823252487af5263"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae07fa72742e52a2a2823252487af5263">&#9670;&#160;</a></span>count() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<div class="memtemplate">
template&lt;typename Other&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::enable_if_t&lt; <a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &gt; &amp;&amp;<a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &gt;, std::conditional_t&lt; false, Other, <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> &gt; &gt; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::count </td>
<td>(</td>
<td class="paramtype">const Other &amp;</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the number of elements matching a key (either 1 or 0). </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">Other</td><td>Type of the key value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">key</td><td>Key value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Number of elements matching the key (either 1 or 0). </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00656">656</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a8d3596e86387eb57317a565f23b3d7b9" name="a8d3596e86387eb57317a565f23b3d7b9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8d3596e86387eb57317a565f23b3d7b9">&#9670;&#160;</a></span>count() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::count </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the number of elements matching a value (either 1 or 0). </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">key</td><td>Key value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Number of elements matching the key (either 1 or 0). </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00644">644</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a0ecb4af728c919ff111a03cf79bc4dd3" name="a0ecb4af728c919ff111a03cf79bc4dd3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ecb4af728c919ff111a03cf79bc4dd3">&#9670;&#160;</a></span>crbegin()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a5a9f859755987f8844be29ad84cc37b6">const_reverse_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::crbegin </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a reverse iterator to the beginning. </p>
<p>If the array is empty, the returned iterator will be equal to <code><a class="el" href="#ae8c26808f90a31003009127bce24f346" title="Returns a reverse iterator to the end.">rend()</a></code>.</p>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the first instance of the reversed internal array. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00468">468</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ade757a21f4fc8d6db7bc594ad8157a59" name="ade757a21f4fc8d6db7bc594ad8157a59"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ade757a21f4fc8d6db7bc594ad8157a59">&#9670;&#160;</a></span>crend()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a5a9f859755987f8844be29ad84cc37b6">const_reverse_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::crend </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a reverse iterator to the end. </p>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the element following the last instance of the reversed internal array. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00487">487</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a47d3197d0c31a680cb7d9379f8a3c3d3" name="a47d3197d0c31a680cb7d9379f8a3c3d3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a47d3197d0c31a680cb7d9379f8a3c3d3">&#9670;&#160;</a></span>emplace()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<div class="memtemplate">
template&lt;typename... Args&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::pair&lt; <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>, bool &gt; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::emplace </td>
<td>(</td>
<td class="paramtype">Args &amp;&amp;...</td> <td class="paramname"><span class="paramname"><em>args</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Constructs an element in-place, if it does not exist. </p>
<p>The element is also constructed when the container already has the key, in which case the newly constructed object is destroyed immediately.</p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">Args</td><td>Types of arguments to forward to the constructor of the element. </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">args</td><td>Arguments to forward to the constructor of the element. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00575">575</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a6a6ca36a20f2ad2af73161eb71c5aba2" name="a6a6ca36a20f2ad2af73161eb71c5aba2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6a6ca36a20f2ad2af73161eb71c5aba2">&#9670;&#160;</a></span>empty()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::empty </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Checks whether a container is empty. </p>
<dl class="section return"><dt>Returns</dt><dd>True if the container is empty, false otherwise. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00505">505</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="acba121addd4d2f1d273ed6c1d9ce711d" name="acba121addd4d2f1d273ed6c1d9ce711d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acba121addd4d2f1d273ed6c1d9ce711d">&#9670;&#160;</a></span>end() <span class="overload">[1/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::end </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns an iterator to the end. </p>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the element following the last instance of the internal array. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00452">452</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a9969d69b8cd34bffe4fc0f0be83d16fa" name="a9969d69b8cd34bffe4fc0f0be83d16fa"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9969d69b8cd34bffe4fc0f0be83d16fa">&#9670;&#160;</a></span>end() <span class="overload">[2/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::end </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns an iterator to the end. </p>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the element following the last instance of the internal array. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00457">457</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a64228ede854cfd6b98665e98ba724542" name="a64228ede854cfd6b98665e98ba724542"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a64228ede854cfd6b98665e98ba724542">&#9670;&#160;</a></span>end() <span class="overload">[3/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a83489efab7359c9c31d910844d96faa5">local_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::end </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a></td> <td class="paramname"><span class="paramname"><em>index</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns an iterator to the end of a given bucket. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">index</td><td>An index of a bucket to access. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the end of the given bucket. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00807">807</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ab5fa4899ccdf38b575c7467da213ffa4" name="ab5fa4899ccdf38b575c7467da213ffa4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab5fa4899ccdf38b575c7467da213ffa4">&#9670;&#160;</a></span>end() <span class="overload">[4/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a0be70471e45867b1d18aa9ee57376496">const_local_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::end </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a></td> <td class="paramname"><span class="paramname"><em>index</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns an iterator to the end of a given bucket. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">index</td><td>An index of a bucket to access. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the end of the given bucket. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00798">798</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a6207a4c30c9dbc48ebd45f139114144e" name="a6207a4c30c9dbc48ebd45f139114144e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6207a4c30c9dbc48ebd45f139114144e">&#9670;&#160;</a></span>equal_range() <span class="overload">[1/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<div class="memtemplate">
template&lt;typename Other&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::enable_if_t&lt; <a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &gt; &amp;&amp;<a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &gt;, std::conditional_t&lt; false, Other, std::pair&lt; <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>, <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a> &gt; &gt; &gt; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::equal_range </td>
<td>(</td>
<td class="paramtype">const Other &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a range containing all elements that compare <em>equivalent</em> to a given value. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">Other</td><td>Type of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A pair of iterators pointing to the first element and past the last element of the range. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00722">722</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="aec681fa3aabf02aaf7666123946817b8" name="aec681fa3aabf02aaf7666123946817b8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aec681fa3aabf02aaf7666123946817b8">&#9670;&#160;</a></span>equal_range() <span class="overload">[2/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<div class="memtemplate">
template&lt;typename Other&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::enable_if_t&lt; <a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &gt; &amp;&amp;<a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &gt;, std::conditional_t&lt; false, Other, std::pair&lt; <a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a>, <a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> &gt; &gt; &gt; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::equal_range </td>
<td>(</td>
<td class="paramtype">const Other &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a range containing all elements with a given value. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A pair of iterators pointing to the first element and past the last element of the range. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00730">730</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a5a20617f3bdbf845f746856efbbb99ef" name="a5a20617f3bdbf845f746856efbbb99ef"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5a20617f3bdbf845f746856efbbb99ef">&#9670;&#160;</a></span>equal_range() <span class="overload">[3/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::pair&lt; <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>, <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a> &gt; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::equal_range </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a range containing all elements with a given value. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A pair of iterators pointing to the first element and past the last element of the range. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00701">701</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="af11a86dfc5bd93593a947522fa70bc13" name="af11a86dfc5bd93593a947522fa70bc13"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af11a86dfc5bd93593a947522fa70bc13">&#9670;&#160;</a></span>equal_range() <span class="overload">[4/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::pair&lt; <a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a>, <a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> &gt; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::equal_range </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a range containing all elements with a given value. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A pair of iterators pointing to the first element and past the last element of the range. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00707">707</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="abe614f630f49556a49f65c7ed3e1183a" name="abe614f630f49556a49f65c7ed3e1183a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abe614f630f49556a49f65c7ed3e1183a">&#9670;&#160;</a></span>erase() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::erase </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Removes the element associated with a given value. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value of an element to remove. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Number of elements removed (either 0 or 1). </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00626">626</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a2c82fe5721d008445d6bb9af2448cbcd" name="a2c82fe5721d008445d6bb9af2448cbcd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2c82fe5721d008445d6bb9af2448cbcd">&#9670;&#160;</a></span>erase() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::erase </td>
<td>(</td>
<td class="paramtype"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a></td> <td class="paramname"><span class="paramname"><em>first</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a></td> <td class="paramname"><span class="paramname"><em>last</em></span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Removes the given elements from a container. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">first</td><td>An iterator to the first element of the range of elements. </td></tr>
<tr><td class="paramname">last</td><td>An iterator past the last element of the range of elements. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator following the last removed element. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00611">611</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ad4ada548c135e15f963efcbdac476e1b" name="ad4ada548c135e15f963efcbdac476e1b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad4ada548c135e15f963efcbdac476e1b">&#9670;&#160;</a></span>erase() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::erase </td>
<td>(</td>
<td class="paramtype"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a></td> <td class="paramname"><span class="paramname"><em>pos</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Removes an element from a given position. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">pos</td><td>An iterator to the element to remove. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator following the removed element. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00599">599</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ad75a164225ececfa173b230e587b46c6" name="ad75a164225ececfa173b230e587b46c6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad75a164225ececfa173b230e587b46c6">&#9670;&#160;</a></span>find() <span class="overload">[1/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<div class="memtemplate">
template&lt;typename Other&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::enable_if_t&lt; <a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &gt; &amp;&amp;<a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &gt;, std::conditional_t&lt; false, Other, <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a> &gt; &gt; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::find </td>
<td>(</td>
<td class="paramtype">const Other &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Finds an element that compares <em>equivalent</em> to a given value. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">Other</td><td>Type of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator to an element with the given value. If no such element is found, a past-the-end iterator is returned. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00684">684</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a9ef9e51dc8219cfd2427a7594ff4bf65" name="a9ef9e51dc8219cfd2427a7594ff4bf65"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9ef9e51dc8219cfd2427a7594ff4bf65">&#9670;&#160;</a></span>find() <span class="overload">[2/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<div class="memtemplate">
template&lt;typename Other&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::enable_if_t&lt; <a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> &gt; &amp;&amp;<a class="el" href="namespaceentt.html#a5fd3998d86cc531f800d0104478771f4">is_transparent_v</a>&lt; <a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> &gt;, std::conditional_t&lt; false, Other, <a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> &gt; &gt; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::find </td>
<td>(</td>
<td class="paramtype">const Other &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Finds an element with a given value. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator to an element with the given value. If no such element is found, a past-the-end iterator is returned. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00691">691</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a3cb64f1ed07507fc9ecbc6f94e582e44" name="a3cb64f1ed07507fc9ecbc6f94e582e44"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3cb64f1ed07507fc9ecbc6f94e582e44">&#9670;&#160;</a></span>find() <span class="overload">[3/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::find </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Finds an element with a given value. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator to an element with the given value. If no such element is found, a past-the-end iterator is returned. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00666">666</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a6e8732dc86fd8f04f585deebb0b39ad5" name="a6e8732dc86fd8f04f585deebb0b39ad5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6e8732dc86fd8f04f585deebb0b39ad5">&#9670;&#160;</a></span>find() <span class="overload">[4/4]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a271e1e1f94361e8156c6de5a81746943">const_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::find </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Finds an element with a given value. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value of an element to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator to an element with the given value. If no such element is found, a past-the-end iterator is returned. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00671">671</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ae130fd3c8ef0c3899ac2ba45fb6a1965" name="ae130fd3c8ef0c3899ac2ba45fb6a1965"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae130fd3c8ef0c3899ac2ba45fb6a1965">&#9670;&#160;</a></span>get_allocator()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a8c83fbdb7d106f60f98d3ae3f395abc2">allocator_type</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::get_allocator </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel constexpr">constexpr</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the associated allocator. </p>
<dl class="section return"><dt>Returns</dt><dd>The associated allocator. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00417">417</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a7f9a2eaac7725273d76b340f6e46c821" name="a7f9a2eaac7725273d76b340f6e46c821"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7f9a2eaac7725273d76b340f6e46c821">&#9670;&#160;</a></span>hash_function()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a2fb78f57d6f35f6235468e4aadb2fe0e">hasher</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::hash_function </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the function used to hash the elements. </p>
<dl class="section return"><dt>Returns</dt><dd>The function used to hash the elements. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00909">909</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a818d80686b709f02cec08f5fc082e279" name="a818d80686b709f02cec08f5fc082e279"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a818d80686b709f02cec08f5fc082e279">&#9670;&#160;</a></span>insert() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::pair&lt; <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>, bool &gt; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::insert </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts an element into the container, if it does not exist. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>An element to insert into the container. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00539">539</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ae52c7f8b38e6bfc15e421fcc8021ba15" name="ae52c7f8b38e6bfc15e421fcc8021ba15"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae52c7f8b38e6bfc15e421fcc8021ba15">&#9670;&#160;</a></span>insert() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<div class="memtemplate">
template&lt;typename It&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::insert </td>
<td>(</td>
<td class="paramtype">It</td> <td class="paramname"><span class="paramname"><em>first</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">It</td> <td class="paramname"><span class="paramname"><em>last</em></span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts elements into the container, if they do not exist. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">It</td><td>Type of input iterator. </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">first</td><td>An iterator to the first element of the range of elements. </td></tr>
<tr><td class="paramname">last</td><td>An iterator past the last element of the range of elements. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00555">555</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ac1c11ba7070fd958ada9dab7b9106ec6" name="ac1c11ba7070fd958ada9dab7b9106ec6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac1c11ba7070fd958ada9dab7b9106ec6">&#9670;&#160;</a></span>insert() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::pair&lt; <a class="el" href="#a44f127ff9c4a0fa1c8284f7d072bd5c3">iterator</a>, bool &gt; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="#a42092d77add471a91a60b0aebd515829">value_type</a> &amp;&amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts an element into the container, if it does not exist. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>An element to insert into the container. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00544">544</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a2520bd4106132dab9a4c71ef8388e186" name="a2520bd4106132dab9a4c71ef8388e186"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2520bd4106132dab9a4c71ef8388e186">&#9670;&#160;</a></span>key_eq()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a266d306cce7016dba8fdbf3790a0cb39">key_equal</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::key_eq </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the function used to compare elements for equality. </p>
<dl class="section return"><dt>Returns</dt><dd>The function used to compare elements for equality. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00917">917</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="abceb56d6788f953e79b6d6924bfcbfe2" name="abceb56d6788f953e79b6d6924bfcbfe2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abceb56d6788f953e79b6d6924bfcbfe2">&#9670;&#160;</a></span>load_factor()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">float <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::load_factor </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the average number of elements per bucket. </p>
<dl class="section return"><dt>Returns</dt><dd>The average number of elements per bucket. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00849">849</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ac3410a73c0331657be2da1c8f0855949" name="ac3410a73c0331657be2da1c8f0855949"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac3410a73c0331657be2da1c8f0855949">&#9670;&#160;</a></span>max_bucket_count()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::max_bucket_count </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the maximum number of buckets. </p>
<dl class="section return"><dt>Returns</dt><dd>The maximum number of buckets. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00823">823</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="aeb02fd08b390059b8c1cffc39a6f40f1" name="aeb02fd08b390059b8c1cffc39a6f40f1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aeb02fd08b390059b8c1cffc39a6f40f1">&#9670;&#160;</a></span>max_load_factor() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">float <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::max_load_factor </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the maximum average number of elements per bucket. </p>
<dl class="section return"><dt>Returns</dt><dd>The maximum average number of elements per bucket. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00857">857</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ab740b6ce89b700657c796b7388563569" name="ab740b6ce89b700657c796b7388563569"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab740b6ce89b700657c796b7388563569">&#9670;&#160;</a></span>max_load_factor() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::max_load_factor </td>
<td>(</td>
<td class="paramtype">const float</td> <td class="paramname"><span class="paramname"><em>value</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Sets the desired maximum average number of elements per bucket. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>A desired maximum average number of elements per bucket. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00865">865</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a4c6b94ce7998769b18635a11a7c044de" name="a4c6b94ce7998769b18635a11a7c044de"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4c6b94ce7998769b18635a11a7c044de">&#9670;&#160;</a></span>max_size()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::max_size </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the maximum possible number of elements. </p>
<dl class="section return"><dt>Returns</dt><dd>Maximum possible number of elements. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00521">521</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ad26d7ce37fefc322767d3df9a2c83da6" name="ad26d7ce37fefc322767d3df9a2c83da6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad26d7ce37fefc322767d3df9a2c83da6">&#9670;&#160;</a></span>operator=() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classentt_1_1dense__set.html">dense_set</a> &amp; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classentt_1_1dense__set.html">dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt; &amp;</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel default">default</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Default copy assignment operator. </p>
<dl class="section return"><dt>Returns</dt><dd>This container. </dd></dl>
</div>
</div>
<a id="a49d41accce8880851a66504317b2690c" name="a49d41accce8880851a66504317b2690c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a49d41accce8880851a66504317b2690c">&#9670;&#160;</a></span>operator=() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classentt_1_1dense__set.html">dense_set</a> &amp; <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classentt_1_1dense__set.html">dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt; &amp;&amp;</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel default">default</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Default move assignment operator. </p>
<dl class="section return"><dt>Returns</dt><dd>This container. </dd></dl>
</div>
</div>
<a id="ac979c28743c3adbda7405b8603116631" name="ac979c28743c3adbda7405b8603116631"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac979c28743c3adbda7405b8603116631">&#9670;&#160;</a></span>rbegin() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a5a9f859755987f8844be29ad84cc37b6">const_reverse_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::rbegin </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a reverse iterator to the beginning. </p>
<p>If the array is empty, the returned iterator will be equal to <code><a class="el" href="#ae8c26808f90a31003009127bce24f346" title="Returns a reverse iterator to the end.">rend()</a></code>.</p>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the first instance of the reversed internal array. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00473">473</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a38daeb37b2315869173227374e16ca0d" name="a38daeb37b2315869173227374e16ca0d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a38daeb37b2315869173227374e16ca0d">&#9670;&#160;</a></span>rbegin() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a8b91ff4841d5fc46d02544d71825822a">reverse_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::rbegin </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a reverse iterator to the beginning. </p>
<p>If the array is empty, the returned iterator will be equal to <code><a class="el" href="#ae8c26808f90a31003009127bce24f346" title="Returns a reverse iterator to the end.">rend()</a></code>.</p>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the first instance of the reversed internal array. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00478">478</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ade485155ec5ec107a0c3582aa848e376" name="ade485155ec5ec107a0c3582aa848e376"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ade485155ec5ec107a0c3582aa848e376">&#9670;&#160;</a></span>rehash()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::rehash </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a></td> <td class="paramname"><span class="paramname"><em>cnt</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Reserves at least the specified number of buckets and regenerates the hash table. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cnt</td><td>New number of buckets. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00876">876</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a77c4ca141381ddc6c09fd1ef2b594509" name="a77c4ca141381ddc6c09fd1ef2b594509"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a77c4ca141381ddc6c09fd1ef2b594509">&#9670;&#160;</a></span>rend() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a5a9f859755987f8844be29ad84cc37b6">const_reverse_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::rend </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a reverse iterator to the end. </p>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the element following the last instance of the reversed internal array. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00492">492</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ae8c26808f90a31003009127bce24f346" name="ae8c26808f90a31003009127bce24f346"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae8c26808f90a31003009127bce24f346">&#9670;&#160;</a></span>rend() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a8b91ff4841d5fc46d02544d71825822a">reverse_iterator</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::rend </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a reverse iterator to the end. </p>
<dl class="section return"><dt>Returns</dt><dd>An iterator to the element following the last instance of the reversed internal array. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00497">497</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a899d206bbac4c0fe88f16a4ce2215b4a" name="a899d206bbac4c0fe88f16a4ce2215b4a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a899d206bbac4c0fe88f16a4ce2215b4a">&#9670;&#160;</a></span>reserve()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::reserve </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a></td> <td class="paramname"><span class="paramname"><em>cnt</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Reserves space for at least the specified number of elements and regenerates the hash table. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cnt</td><td>New number of elements. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00900">900</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="a51a05fcfc23785b7f38bd48b46ebf178" name="a51a05fcfc23785b7f38bd48b46ebf178"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a51a05fcfc23785b7f38bd48b46ebf178">&#9670;&#160;</a></span>size()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="#a3355912feda8db49d87b75247f824ce0">size_type</a> <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::size </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel nodiscard">nodiscard</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the number of elements in a container. </p>
<dl class="section return"><dt>Returns</dt><dd>Number of elements in a container. </dd></dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00513">513</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<a id="ab1199b43ef81b1fab9d52a0c1275dd56" name="ab1199b43ef81b1fab9d52a0c1275dd56"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab1199b43ef81b1fab9d52a0c1275dd56">&#9670;&#160;</a></span>swap()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Type, typename Hash, typename KeyEqual, typename Allocator&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classentt_1_1dense__set.html">entt::dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt;::swap </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classentt_1_1dense__set.html">dense_set</a>&lt; Type, Hash, KeyEqual, Allocator &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>other</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel noexcept">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Exchanges the contents with those of a given container. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">other</td><td>Container to exchange the content with. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="dense__set_8hpp_source.html#l00406">406</a> of file <a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>src/entt/container/<a class="el" href="dense__set_8hpp_source.html">dense_set.hpp</a></li>
</ul>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2
</small></address>
</div><!-- doc-content -->
</body>
</html>