cpp
/
JoltPhysics
mirror of https://github.com/jrouwe/JoltPhysics.git


			
				
					
						
						
							123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170
							<!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.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Jolt Physics: HashTable&lt; Key, KeyValue, HashTableDetail, Hash, KeyEqual &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="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<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>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
  extensions: ["tex2jax.js"],
  jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr id="projectrow">
  <td id="projectlogo"><img alt="Logo" src="LogoSmall.png"/></td>
  <td id="projectalign">
   <div id="projectname">Jolt Physics
   </div>
   <div id="projectbrief">A multi core friendly Game Physics Engine</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<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',true);
  $(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('class_hash_table.html',''); initResizable(true); });
/* @license-end */
</script>
<div id="doc-content">
<!-- 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 class="header">
  <div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#pub-types">Public Types</a> &#124;
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pro-methods">Protected Member Functions</a> &#124;
<a href="class_hash_table-members.html">List of all members</a>  </div>
  <div class="headertitle"><div class="title">HashTable&lt; Key, KeyValue, HashTableDetail, Hash, KeyEqual &gt; Class Template Reference</div></div>
</div><!--header-->
<div class="contents">

<p><code>#include &lt;<a class="el" href="_hash_table_8h_source.html">HashTable.h</a>&gt;</code></p>
<div class="dynheader">
Inheritance diagram for HashTable&lt; Key, KeyValue, HashTableDetail, Hash, KeyEqual &gt;:</div>
<div class="dyncontent">
 <div class="center">
  <img src="class_hash_table.png" usemap="#HashTable_3C_20Key_2C_20KeyValue_2C_20HashTableDetail_2C_20Hash_2C_20KeyEqual_20_3E_map" alt=""/>
  <map id="HashTable_3C_20Key_2C_20KeyValue_2C_20HashTableDetail_2C_20Hash_2C_20KeyEqual_20_3E_map" name="HashTable_3C_20Key_2C_20KeyValue_2C_20HashTableDetail_2C_20Hash_2C_20KeyEqual_20_3E_map">
<area href="class_unordered_map.html" alt="UnorderedMap&lt; ContactKey, ListenerContactValue &gt;" shape="rect" coords="485,56,960,80"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; SwingConeLimits, GeometryRef, SwingConeLimitsHasher &gt;" shape="rect" coords="485,112,960,136"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; SwingPyramidLimits, GeometryRef, SwingPyramidLimitsHasher &gt;" shape="rect" coords="485,168,960,192"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; float, GeometryRef &gt;" shape="rect" coords="485,224,960,248"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; TaperedCylinder, GeometryRef, TaperedCylinderHasher &gt;" shape="rect" coords="485,280,960,304"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; uint32, Ref &gt;" shape="rect" coords="485,336,960,360"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; GeometryRef, uint32 &gt;" shape="rect" coords="485,392,960,416"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; string_view, const RTTI * &gt;" shape="rect" coords="485,448,960,472"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; uint32, const RTTI * &gt;" shape="rect" coords="485,504,960,528"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; uint32, String &gt;" shape="rect" coords="485,560,960,584"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; String, uint32 &gt;" shape="rect" coords="485,616,960,640"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; String, ClassDescription &gt;" shape="rect" coords="485,672,960,696"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; Identifier, ObjectInfo &gt;" shape="rect" coords="485,728,960,752"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; const void *, ObjectInfo &gt;" shape="rect" coords="485,784,960,808"/>
<area href="class_unordered_set.html" alt="UnorderedSet&lt; const RTTI * &gt;" shape="rect" coords="485,840,960,864"/>
<area href="class_unordered_map.html" alt="UnorderedMap&lt; Key, Value, Hash, KeyEqual &gt;" shape="rect" coords="485,896,960,920"/>
<area href="class_unordered_set.html" alt="UnorderedSet&lt; Key, Hash, KeyEqual &gt;" shape="rect" coords="485,952,960,976"/>
  </map>
</div></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Const iterator.  <a href="class_hash_table_1_1const__iterator.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_table_1_1iterator.html">iterator</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Non-const iterator.  <a href="class_hash_table_1_1iterator.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><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:a9e0354e8e22ff27d0548a4d5b62b30ed" id="r_a9e0354e8e22ff27d0548a4d5b62b30ed"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9e0354e8e22ff27d0548a4d5b62b30ed">value_type</a> = KeyValue</td></tr>
<tr class="memdesc:a9e0354e8e22ff27d0548a4d5b62b30ed"><td class="mdescLeft">&#160;</td><td class="mdescRight">Properties.  <br /></td></tr>
<tr class="separator:a9e0354e8e22ff27d0548a4d5b62b30ed"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa6e132946e0d852c08166229712780b5" id="r_aa6e132946e0d852c08166229712780b5"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a> = <a class="el" href="_core_8h.html#a8f95e75e58492e87412191fabadd8ca8">uint32</a></td></tr>
<tr class="separator:aa6e132946e0d852c08166229712780b5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2dab10b4f1528f7c3e57ca31813e085e" id="r_a2dab10b4f1528f7c3e57ca31813e085e"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2dab10b4f1528f7c3e57ca31813e085e">difference_type</a> = ptrdiff_t</td></tr>
<tr class="separator:a2dab10b4f1528f7c3e57ca31813e085e"><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:a5666542a5c019d4e136ad904420d9c12" id="r_a5666542a5c019d4e136ad904420d9c12"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5666542a5c019d4e136ad904420d9c12">HashTable</a> ()=default</td></tr>
<tr class="memdesc:a5666542a5c019d4e136ad904420d9c12"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default constructor.  <br /></td></tr>
<tr class="separator:a5666542a5c019d4e136ad904420d9c12"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5229f49c49334a4809200e423f96f9cb" id="r_a5229f49c49334a4809200e423f96f9cb"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5229f49c49334a4809200e423f96f9cb">HashTable</a> (const <a class="el" href="class_hash_table.html">HashTable</a> &amp;inRHS)</td></tr>
<tr class="memdesc:a5229f49c49334a4809200e423f96f9cb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Copy constructor.  <br /></td></tr>
<tr class="separator:a5229f49c49334a4809200e423f96f9cb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a84b110219a8be1df516230e797fda034" id="r_a84b110219a8be1df516230e797fda034"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a84b110219a8be1df516230e797fda034">HashTable</a> (<a class="el" href="class_hash_table.html">HashTable</a> &amp;&amp;ioRHS) noexcept</td></tr>
<tr class="memdesc:a84b110219a8be1df516230e797fda034"><td class="mdescLeft">&#160;</td><td class="mdescRight">Move constructor.  <br /></td></tr>
<tr class="separator:a84b110219a8be1df516230e797fda034"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:affd3cd3786f20a0bff6485f422b040f2" id="r_affd3cd3786f20a0bff6485f422b040f2"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_hash_table.html">HashTable</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#affd3cd3786f20a0bff6485f422b040f2">operator=</a> (const <a class="el" href="class_hash_table.html">HashTable</a> &amp;inRHS)</td></tr>
<tr class="memdesc:affd3cd3786f20a0bff6485f422b040f2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assignment operator.  <br /></td></tr>
<tr class="separator:affd3cd3786f20a0bff6485f422b040f2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2a21cffd58e0be50fd71c2cb445b8234" id="r_a2a21cffd58e0be50fd71c2cb445b8234"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_hash_table.html">HashTable</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2a21cffd58e0be50fd71c2cb445b8234">operator=</a> (<a class="el" href="class_hash_table.html">HashTable</a> &amp;&amp;ioRHS) noexcept</td></tr>
<tr class="memdesc:a2a21cffd58e0be50fd71c2cb445b8234"><td class="mdescLeft">&#160;</td><td class="mdescRight">Move assignment operator.  <br /></td></tr>
<tr class="separator:a2a21cffd58e0be50fd71c2cb445b8234"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a636d476adbffc2eb46acf9f39d75760d" id="r_a636d476adbffc2eb46acf9f39d75760d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a636d476adbffc2eb46acf9f39d75760d">~HashTable</a> ()</td></tr>
<tr class="memdesc:a636d476adbffc2eb46acf9f39d75760d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Destructor.  <br /></td></tr>
<tr class="separator:a636d476adbffc2eb46acf9f39d75760d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a288e464fb83b4fc31f8506ddff191d0b" id="r_a288e464fb83b4fc31f8506ddff191d0b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a288e464fb83b4fc31f8506ddff191d0b">reserve</a> (<a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a> inMaxSize)</td></tr>
<tr class="memdesc:a288e464fb83b4fc31f8506ddff191d0b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Reserve memory for a certain number of elements.  <br /></td></tr>
<tr class="separator:a288e464fb83b4fc31f8506ddff191d0b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3c220708a3fb98e6b2b90762cc9fa07f" id="r_a3c220708a3fb98e6b2b90762cc9fa07f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3c220708a3fb98e6b2b90762cc9fa07f">clear</a> ()</td></tr>
<tr class="memdesc:a3c220708a3fb98e6b2b90762cc9fa07f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Destroy the entire hash table.  <br /></td></tr>
<tr class="separator:a3c220708a3fb98e6b2b90762cc9fa07f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa24e3348e2360519ed0debef8e3fe48b" id="r_aa24e3348e2360519ed0debef8e3fe48b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa24e3348e2360519ed0debef8e3fe48b">ClearAndKeepMemory</a> ()</td></tr>
<tr class="memdesc:aa24e3348e2360519ed0debef8e3fe48b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Destroy the entire hash table but keeps the memory allocated.  <br /></td></tr>
<tr class="separator:aa24e3348e2360519ed0debef8e3fe48b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a64d9f63b5f1af4430e033691d985ba23" id="r_a64d9f63b5f1af4430e033691d985ba23"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_hash_table_1_1iterator.html">iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a64d9f63b5f1af4430e033691d985ba23">begin</a> ()</td></tr>
<tr class="memdesc:a64d9f63b5f1af4430e033691d985ba23"><td class="mdescLeft">&#160;</td><td class="mdescRight">Iterator to first element.  <br /></td></tr>
<tr class="separator:a64d9f63b5f1af4430e033691d985ba23"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3fd1542c6f9087d63323416fda0e08c5" id="r_a3fd1542c6f9087d63323416fda0e08c5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_hash_table_1_1iterator.html">iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3fd1542c6f9087d63323416fda0e08c5">end</a> ()</td></tr>
<tr class="memdesc:a3fd1542c6f9087d63323416fda0e08c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Iterator to one beyond last element.  <br /></td></tr>
<tr class="separator:a3fd1542c6f9087d63323416fda0e08c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adbce8b2de5b0269fd0cdc3dde8747e4d" id="r_adbce8b2de5b0269fd0cdc3dde8747e4d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adbce8b2de5b0269fd0cdc3dde8747e4d">begin</a> () const</td></tr>
<tr class="memdesc:adbce8b2de5b0269fd0cdc3dde8747e4d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Iterator to first element.  <br /></td></tr>
<tr class="separator:adbce8b2de5b0269fd0cdc3dde8747e4d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6c3e727ae8276d6da7aae9058d91713e" id="r_a6c3e727ae8276d6da7aae9058d91713e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6c3e727ae8276d6da7aae9058d91713e">end</a> () const</td></tr>
<tr class="memdesc:a6c3e727ae8276d6da7aae9058d91713e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Iterator to one beyond last element.  <br /></td></tr>
<tr class="separator:a6c3e727ae8276d6da7aae9058d91713e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5ba58aac4668c7c8906d6f00a7181ee0" id="r_a5ba58aac4668c7c8906d6f00a7181ee0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5ba58aac4668c7c8906d6f00a7181ee0">cbegin</a> () const</td></tr>
<tr class="memdesc:a5ba58aac4668c7c8906d6f00a7181ee0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Iterator to first element.  <br /></td></tr>
<tr class="separator:a5ba58aac4668c7c8906d6f00a7181ee0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7557480de53b5b5b940bb38d46f1a6d5" id="r_a7557480de53b5b5b940bb38d46f1a6d5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7557480de53b5b5b940bb38d46f1a6d5">cend</a> () const</td></tr>
<tr class="memdesc:a7557480de53b5b5b940bb38d46f1a6d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Iterator to one beyond last element.  <br /></td></tr>
<tr class="separator:a7557480de53b5b5b940bb38d46f1a6d5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ade9da55303c18d6212d28515447a9a5b" id="r_ade9da55303c18d6212d28515447a9a5b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ade9da55303c18d6212d28515447a9a5b">bucket_count</a> () const</td></tr>
<tr class="memdesc:ade9da55303c18d6212d28515447a9a5b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Number of buckets in the table.  <br /></td></tr>
<tr class="separator:ade9da55303c18d6212d28515447a9a5b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a40281814275bc8c120e63a96e232cbd1" id="r_a40281814275bc8c120e63a96e232cbd1"><td class="memItemLeft" align="right" valign="top">constexpr <a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a40281814275bc8c120e63a96e232cbd1">max_bucket_count</a> () const</td></tr>
<tr class="memdesc:a40281814275bc8c120e63a96e232cbd1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Max number of buckets that the table can have.  <br /></td></tr>
<tr class="separator:a40281814275bc8c120e63a96e232cbd1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa983a56c22510c95ade8ae48d4da781e" id="r_aa983a56c22510c95ade8ae48d4da781e"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa983a56c22510c95ade8ae48d4da781e">empty</a> () const</td></tr>
<tr class="memdesc:aa983a56c22510c95ade8ae48d4da781e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Check if there are no elements in the table.  <br /></td></tr>
<tr class="separator:aa983a56c22510c95ade8ae48d4da781e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a54c7ec0bad84c09fc0e54160229aa42d" id="r_a54c7ec0bad84c09fc0e54160229aa42d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a54c7ec0bad84c09fc0e54160229aa42d">size</a> () const</td></tr>
<tr class="memdesc:a54c7ec0bad84c09fc0e54160229aa42d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Number of elements in the table.  <br /></td></tr>
<tr class="separator:a54c7ec0bad84c09fc0e54160229aa42d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a89c0fbd55855fa96624374957e8d807e" id="r_a89c0fbd55855fa96624374957e8d807e"><td class="memItemLeft" align="right" valign="top">constexpr <a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a89c0fbd55855fa96624374957e8d807e">max_size</a> () const</td></tr>
<tr class="memdesc:a89c0fbd55855fa96624374957e8d807e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Max number of elements that the table can hold.  <br /></td></tr>
<tr class="separator:a89c0fbd55855fa96624374957e8d807e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab95fc88c65616bd424a596658265594f" id="r_ab95fc88c65616bd424a596658265594f"><td class="memItemLeft" align="right" valign="top">constexpr float&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab95fc88c65616bd424a596658265594f">max_load_factor</a> () const</td></tr>
<tr class="memdesc:ab95fc88c65616bd424a596658265594f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the max load factor for this table (max number of elements / number of buckets)  <br /></td></tr>
<tr class="separator:ab95fc88c65616bd424a596658265594f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac4a1aea8a17c4fb88d07678846f17c24" id="r_ac4a1aea8a17c4fb88d07678846f17c24"><td class="memItemLeft" align="right" valign="top">std::pair&lt; <a class="el" href="class_hash_table_1_1iterator.html">iterator</a>, bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac4a1aea8a17c4fb88d07678846f17c24">insert</a> (const <a class="el" href="#a9e0354e8e22ff27d0548a4d5b62b30ed">value_type</a> &amp;inValue)</td></tr>
<tr class="memdesc:ac4a1aea8a17c4fb88d07678846f17c24"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insert a new element, returns iterator and if the element was inserted.  <br /></td></tr>
<tr class="separator:ac4a1aea8a17c4fb88d07678846f17c24"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7541e945573a40408181fd63260cafb6" id="r_a7541e945573a40408181fd63260cafb6"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7541e945573a40408181fd63260cafb6">find</a> (const Key &amp;inKey) const</td></tr>
<tr class="memdesc:a7541e945573a40408181fd63260cafb6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find an element, returns iterator to element or <a class="el" href="#a3fd1542c6f9087d63323416fda0e08c5" title="Iterator to one beyond last element.">end()</a> if not found.  <br /></td></tr>
<tr class="separator:a7541e945573a40408181fd63260cafb6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad52f6fe9d50a71976d2bf00be01378e4" id="r_ad52f6fe9d50a71976d2bf00be01378e4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad52f6fe9d50a71976d2bf00be01378e4">erase</a> (const <a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a> &amp;inIterator)</td></tr>
<tr class="memdesc:ad52f6fe9d50a71976d2bf00be01378e4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Erase an element by iterator.  <br /></td></tr>
<tr class="separator:ad52f6fe9d50a71976d2bf00be01378e4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af056bc485a0dcade6a0745ee64bbb293" id="r_af056bc485a0dcade6a0745ee64bbb293"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af056bc485a0dcade6a0745ee64bbb293">erase</a> (const Key &amp;inKey)</td></tr>
<tr class="memdesc:af056bc485a0dcade6a0745ee64bbb293"><td class="mdescLeft">&#160;</td><td class="mdescRight">Erase an element by key.  <br /></td></tr>
<tr class="separator:af056bc485a0dcade6a0745ee64bbb293"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a59abad316a005ca41480cad0b8f1015a" id="r_a59abad316a005ca41480cad0b8f1015a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a59abad316a005ca41480cad0b8f1015a">swap</a> (<a class="el" href="class_hash_table.html">HashTable</a> &amp;ioRHS) noexcept</td></tr>
<tr class="memdesc:a59abad316a005ca41480cad0b8f1015a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Swap the contents of two hash tables.  <br /></td></tr>
<tr class="separator:a59abad316a005ca41480cad0b8f1015a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abdbff1cecce246b92c74406b300d0433" id="r_abdbff1cecce246b92c74406b300d0433"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abdbff1cecce246b92c74406b300d0433">rehash</a> (<a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a>)</td></tr>
<tr class="separator:abdbff1cecce246b92c74406b300d0433"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-methods" name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:a3c968f0c587c2e368188247147500307" id="r_a3c968f0c587c2e368188247147500307"><td class="memItemLeft" align="right" valign="top">KeyValue &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3c968f0c587c2e368188247147500307">GetElement</a> (<a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a> inIndex) const</td></tr>
<tr class="memdesc:a3c968f0c587c2e368188247147500307"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get an element by index.  <br /></td></tr>
<tr class="separator:a3c968f0c587c2e368188247147500307"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9fc364bfa705f850741658b59a7c93a8" id="r_a9fc364bfa705f850741658b59a7c93a8"><td class="memTemplParams" colspan="2">template&lt;bool InsertAfterGrow = false&gt; </td></tr>
<tr class="memitem:a9fc364bfa705f850741658b59a7c93a8"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a9fc364bfa705f850741658b59a7c93a8">InsertKey</a> (const Key &amp;inKey, <a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a> &amp;outIndex)</td></tr>
<tr class="separator:a9fc364bfa705f850741658b59a7c93a8"><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;class Key, class KeyValue, class HashTableDetail, class <a class="el" href="struct_hash.html">Hash</a>, class KeyEqual&gt;<br />
class HashTable&lt; Key, KeyValue, HashTableDetail, Hash, KeyEqual &gt;</div><p>Helper class for implementing an <a class="el" href="class_unordered_set.html">UnorderedSet</a> or <a class="el" href="class_unordered_map.html">UnorderedMap</a> Based on CppCon 2017: Matt Kulukundis "Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step" See: <a href="https://www.youtube.com/watch?v=ncHmEUmJZf4">https://www.youtube.com/watch?v=ncHmEUmJZf4</a> </p>
</div><h2 class="groupheader">Member Typedef Documentation</h2>
<a id="a2dab10b4f1528f7c3e57ca31813e085e" name="a2dab10b4f1528f7c3e57ca31813e085e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2dab10b4f1528f7c3e57ca31813e085e">&#9670;&#160;</a></span>difference_type</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">using <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::difference_type = ptrdiff_t</td>
        </tr>
      </table>
</div><div class="memdoc">

</div>
</div>
<a id="aa6e132946e0d852c08166229712780b5" name="aa6e132946e0d852c08166229712780b5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa6e132946e0d852c08166229712780b5">&#9670;&#160;</a></span>size_type</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">using <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::size_type = <a class="el" href="_core_8h.html#a8f95e75e58492e87412191fabadd8ca8">uint32</a></td>
        </tr>
      </table>
</div><div class="memdoc">

</div>
</div>
<a id="a9e0354e8e22ff27d0548a4d5b62b30ed" name="a9e0354e8e22ff27d0548a4d5b62b30ed"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9e0354e8e22ff27d0548a4d5b62b30ed">&#9670;&#160;</a></span>value_type</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">using <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::value_type = KeyValue</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Properties. </p>

</div>
</div>
<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a5666542a5c019d4e136ad904420d9c12" name="a5666542a5c019d4e136ad904420d9c12"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5666542a5c019d4e136ad904420d9c12">&#9670;&#160;</a></span>HashTable() <span class="overload">[1/3]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;<a class="el" href="class_hash_table.html">::HashTable</a> </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">default</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Default constructor. </p>

</div>
</div>
<a id="a5229f49c49334a4809200e423f96f9cb" name="a5229f49c49334a4809200e423f96f9cb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5229f49c49334a4809200e423f96f9cb">&#9670;&#160;</a></span>HashTable() <span class="overload">[2/3]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;<a class="el" href="class_hash_table.html">::HashTable</a> </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>inRHS</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Copy constructor. </p>

</div>
</div>
<a id="a84b110219a8be1df516230e797fda034" name="a84b110219a8be1df516230e797fda034"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a84b110219a8be1df516230e797fda034">&#9670;&#160;</a></span>HashTable() <span class="overload">[3/3]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;<a class="el" href="class_hash_table.html">::HashTable</a> </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt; &amp;&amp;</td>          <td class="paramname"><span class="paramname"><em>ioRHS</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Move constructor. </p>

</div>
</div>
<a id="a636d476adbffc2eb46acf9f39d75760d" name="a636d476adbffc2eb46acf9f39d75760d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a636d476adbffc2eb46acf9f39d75760d">&#9670;&#160;</a></span>~HashTable()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::~<a class="el" href="class_hash_table.html">HashTable</a> </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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Destructor. </p>

</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a64d9f63b5f1af4430e033691d985ba23" name="a64d9f63b5f1af4430e033691d985ba23"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a64d9f63b5f1af4430e033691d985ba23">&#9670;&#160;</a></span>begin() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table_1_1iterator.html">iterator</a> <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Iterator to first element. </p>

</div>
</div>
<a id="adbce8b2de5b0269fd0cdc3dde8747e4d" name="adbce8b2de5b0269fd0cdc3dde8747e4d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adbce8b2de5b0269fd0cdc3dde8747e4d">&#9670;&#160;</a></span>begin() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a> <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Iterator to first element. </p>

</div>
</div>
<a id="ade9da55303c18d6212d28515447a9a5b" name="ade9da55303c18d6212d28515447a9a5b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ade9da55303c18d6212d28515447a9a5b">&#9670;&#160;</a></span>bucket_count()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a> <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Number of buckets in the table. </p>

</div>
</div>
<a id="a5ba58aac4668c7c8906d6f00a7181ee0" name="a5ba58aac4668c7c8906d6f00a7181ee0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5ba58aac4668c7c8906d6f00a7181ee0">&#9670;&#160;</a></span>cbegin()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a> <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Iterator to first element. </p>

</div>
</div>
<a id="a7557480de53b5b5b940bb38d46f1a6d5" name="a7557480de53b5b5b940bb38d46f1a6d5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7557480de53b5b5b940bb38d46f1a6d5">&#9670;&#160;</a></span>cend()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a> <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Iterator to one beyond last element. </p>

</div>
</div>
<a id="a3c220708a3fb98e6b2b90762cc9fa07f" name="a3c220708a3fb98e6b2b90762cc9fa07f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3c220708a3fb98e6b2b90762cc9fa07f">&#9670;&#160;</a></span>clear()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Destroy the entire hash table. </p>

</div>
</div>
<a id="aa24e3348e2360519ed0debef8e3fe48b" name="aa24e3348e2360519ed0debef8e3fe48b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa24e3348e2360519ed0debef8e3fe48b">&#9670;&#160;</a></span>ClearAndKeepMemory()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::ClearAndKeepMemory </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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Destroy the entire hash table but keeps the memory allocated. </p>

</div>
</div>
<a id="aa983a56c22510c95ade8ae48d4da781e" name="aa983a56c22510c95ade8ae48d4da781e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa983a56c22510c95ade8ae48d4da781e">&#9670;&#160;</a></span>empty()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Check if there are no elements in the table. </p>

</div>
</div>
<a id="a3fd1542c6f9087d63323416fda0e08c5" name="a3fd1542c6f9087d63323416fda0e08c5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3fd1542c6f9087d63323416fda0e08c5">&#9670;&#160;</a></span>end() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table_1_1iterator.html">iterator</a> <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Iterator to one beyond last element. </p>

</div>
</div>
<a id="a6c3e727ae8276d6da7aae9058d91713e" name="a6c3e727ae8276d6da7aae9058d91713e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6c3e727ae8276d6da7aae9058d91713e">&#9670;&#160;</a></span>end() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a> <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Iterator to one beyond last element. </p>

</div>
</div>
<a id="ad52f6fe9d50a71976d2bf00be01378e4" name="ad52f6fe9d50a71976d2bf00be01378e4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad52f6fe9d50a71976d2bf00be01378e4">&#9670;&#160;</a></span>erase() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::erase </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>inIterator</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Erase an element by iterator. </p>

</div>
</div>
<a id="af056bc485a0dcade6a0745ee64bbb293" name="af056bc485a0dcade6a0745ee64bbb293"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af056bc485a0dcade6a0745ee64bbb293">&#9670;&#160;</a></span>erase() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a> <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::erase </td>
          <td>(</td>
          <td class="paramtype">const Key &amp;</td>          <td class="paramname"><span class="paramname"><em>inKey</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Erase an element by key. </p>

</div>
</div>
<a id="a7541e945573a40408181fd63260cafb6" name="a7541e945573a40408181fd63260cafb6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7541e945573a40408181fd63260cafb6">&#9670;&#160;</a></span>find()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table_1_1const__iterator.html">const_iterator</a> <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::find </td>
          <td>(</td>
          <td class="paramtype">const Key &amp;</td>          <td class="paramname"><span class="paramname"><em>inKey</em></span></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Find an element, returns iterator to element or <a class="el" href="#a3fd1542c6f9087d63323416fda0e08c5" title="Iterator to one beyond last element.">end()</a> if not found. </p>

</div>
</div>
<a id="a3c968f0c587c2e368188247147500307" name="a3c968f0c587c2e368188247147500307"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3c968f0c587c2e368188247147500307">&#9670;&#160;</a></span>GetElement()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">KeyValue &amp; <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::GetElement </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a></td>          <td class="paramname"><span class="paramname"><em>inIndex</em></span></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Get an element by index. </p>

</div>
</div>
<a id="ac4a1aea8a17c4fb88d07678846f17c24" name="ac4a1aea8a17c4fb88d07678846f17c24"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac4a1aea8a17c4fb88d07678846f17c24">&#9670;&#160;</a></span>insert()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">std::pair&lt; <a class="el" href="class_hash_table_1_1iterator.html">iterator</a>, bool &gt; <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::insert </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="#a9e0354e8e22ff27d0548a4d5b62b30ed">value_type</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>inValue</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Insert a new element, returns iterator and if the element was inserted. </p>

</div>
</div>
<a id="a9fc364bfa705f850741658b59a7c93a8" name="a9fc364bfa705f850741658b59a7c93a8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9fc364bfa705f850741658b59a7c93a8">&#9670;&#160;</a></span>InsertKey()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<div class="memtemplate">
template&lt;bool InsertAfterGrow = false&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::InsertKey </td>
          <td>(</td>
          <td class="paramtype">const Key &amp;</td>          <td class="paramname"><span class="paramname"><em>inKey</em></span>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>outIndex</em></span>&#160;)</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Insert a key into the map, returns true if the element was inserted, false if it already existed. outIndex is the index at which the element should be constructed / where it is located. </p>

</div>
</div>
<a id="a40281814275bc8c120e63a96e232cbd1" name="a40281814275bc8c120e63a96e232cbd1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a40281814275bc8c120e63a96e232cbd1">&#9670;&#160;</a></span>max_bucket_count()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a> <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span><span class="mlabel">constexpr</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Max number of buckets that the table can have. </p>

</div>
</div>
<a id="ab95fc88c65616bd424a596658265594f" name="ab95fc88c65616bd424a596658265594f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab95fc88c65616bd424a596658265594f">&#9670;&#160;</a></span>max_load_factor()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">float <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span><span class="mlabel">constexpr</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Get the max load factor for this table (max number of elements / number of buckets) </p>

</div>
</div>
<a id="a89c0fbd55855fa96624374957e8d807e" name="a89c0fbd55855fa96624374957e8d807e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a89c0fbd55855fa96624374957e8d807e">&#9670;&#160;</a></span>max_size()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a> <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span><span class="mlabel">constexpr</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Max number of elements that the table can hold. </p>

</div>
</div>
<a id="affd3cd3786f20a0bff6485f422b040f2" name="affd3cd3786f20a0bff6485f422b040f2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#affd3cd3786f20a0bff6485f422b040f2">&#9670;&#160;</a></span>operator=() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table.html">HashTable</a> &amp; <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::operator= </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>inRHS</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Assignment operator. </p>

</div>
</div>
<a id="a2a21cffd58e0be50fd71c2cb445b8234" name="a2a21cffd58e0be50fd71c2cb445b8234"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2a21cffd58e0be50fd71c2cb445b8234">&#9670;&#160;</a></span>operator=() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_hash_table.html">HashTable</a> &amp; <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::operator= </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt; &amp;&amp;</td>          <td class="paramname"><span class="paramname"><em>ioRHS</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Move assignment operator. </p>

</div>
</div>
<a id="abdbff1cecce246b92c74406b300d0433" name="abdbff1cecce246b92c74406b300d0433"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abdbff1cecce246b92c74406b300d0433">&#9670;&#160;</a></span>rehash()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::rehash </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a></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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>In place re-hashing of all elements in the table. Removes all cBucketDeleted elements The std version takes a bucket count, but we just re-hash to the same size. </p>

</div>
</div>
<a id="a288e464fb83b4fc31f8506ddff191d0b" name="a288e464fb83b4fc31f8506ddff191d0b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a288e464fb83b4fc31f8506ddff191d0b">&#9670;&#160;</a></span>reserve()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::reserve </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a></td>          <td class="paramname"><span class="paramname"><em>inMaxSize</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Reserve memory for a certain number of elements. </p>

</div>
</div>
<a id="a54c7ec0bad84c09fc0e54160229aa42d" name="a54c7ec0bad84c09fc0e54160229aa42d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a54c7ec0bad84c09fc0e54160229aa42d">&#9670;&#160;</a></span>size()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="#aa6e132946e0d852c08166229712780b5">size_type</a> <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &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</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Number of elements in the table. </p>

</div>
</div>
<a id="a59abad316a005ca41480cad0b8f1015a" name="a59abad316a005ca41480cad0b8f1015a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a59abad316a005ca41480cad0b8f1015a">&#9670;&#160;</a></span>swap()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Key , class KeyValue , class HashTableDetail , class <a class="el" href="struct_hash.html">Hash</a> , class KeyEqual &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt;::swap </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="class_hash_table.html">HashTable</a>&lt; Key, KeyValue, HashTableDetail, <a class="el" href="struct_hash.html">Hash</a>, KeyEqual &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>ioRHS</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Swap the contents of two hash tables. </p>

</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>Jolt/Core/<a class="el" href="_hash_table_8h_source.html">HashTable.h</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="class_hash_table.html">HashTable</a></li>
    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
  </ul>
</div>
</body>
</html>