deploy: c47794f

classstep20_1_1least__recently__used_1_1cache-members.html

@@ -79,7 +79,7 @@
 
 <p>This is the complete list of members for <a class="el" href="classstep20_1_1least__recently__used_1_1cache.html">step20::least_recently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a>, including all inherited members.</p>
 <table class="directory">
-  <tr class="even"><td class="entry"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html#a536ea1924994f0a78a6b721a3d1fcf04">cache</a>(size_t capacity)</td><td class="entry"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html">step20::least_recently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">explicit</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html#afe5c3618a93a5b424edc6d44791c9838">cache</a>(std::size_t capacity)</td><td class="entry"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html">step20::least_recently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">explicit</span></td></tr>
   <tr class="odd"><td class="entry"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html#aa4f4eeea0547d7f296ccef2f87b023dc">find</a>(const Key &amp;key)</td><td class="entry"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html">step20::least_recently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html#af4d61f4bd66686f8b12a3029dd5e39a8">insert_or_assign</a>(const Key &amp;key, const T &amp;val)</td><td class="entry"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html">step20::least_recently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
 </table></div><!-- contents -->

classstep20_1_1least__recently__used_1_1cache.html

@@ -87,8 +87,8 @@
 <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:a536ea1924994f0a78a6b721a3d1fcf04"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html#a536ea1924994f0a78a6b721a3d1fcf04">cache</a> (size_t capacity)</td></tr>
-<tr class="separator:a536ea1924994f0a78a6b721a3d1fcf04"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:afe5c3618a93a5b424edc6d44791c9838"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html#afe5c3618a93a5b424edc6d44791c9838">cache</a> (std::size_t capacity)</td></tr>
+<tr class="separator:afe5c3618a93a5b424edc6d44791c9838"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa4f4eeea0547d7f296ccef2f87b023dc"><td class="memItemLeft" align="right" valign="top">const T *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html#aa4f4eeea0547d7f296ccef2f87b023dc">find</a> (const Key &amp;key)</td></tr>
 <tr class="separator:aa4f4eeea0547d7f296ccef2f87b023dc"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af4d61f4bd66686f8b12a3029dd5e39a8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html#af4d61f4bd66686f8b12a3029dd5e39a8">insert_or_assign</a> (const Key &amp;key, const T &amp;val)</td></tr>
@@ -98,8 +98,8 @@
 <div class="textblock"><div class="compoundTemplParams">template&lt;class Key, class T, class Hash = std::hash&lt;Key&gt;, class KeyEqual = std::equal_to&lt;Key&gt;&gt;<br />
 class step20::least_recently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</div><p>An O(1) algorithm for implementing the LRU cache eviction scheme. </p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
-<a id="a536ea1924994f0a78a6b721a3d1fcf04" name="a536ea1924994f0a78a6b721a3d1fcf04"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#a536ea1924994f0a78a6b721a3d1fcf04">&#9670;&#160;</a></span>cache()</h2>
+<a id="afe5c3618a93a5b424edc6d44791c9838" name="afe5c3618a93a5b424edc6d44791c9838"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#afe5c3618a93a5b424edc6d44791c9838">&#9670;&#160;</a></span>cache()</h2>
 
 <div class="memitem">
 <div class="memproto">
@@ -112,7 +112,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a536ea1924994f0a78a6b721a
         <tr>
           <td class="memname"><a class="el" href="classstep20_1_1least__recently__used_1_1cache.html">step20::least_recently_used::cache</a>&lt; Key, T, Hash, KeyEqual &gt;::cache </td>
           <td>(</td>
-          <td class="paramtype">size_t&#160;</td>
+          <td class="paramtype">std::size_t&#160;</td>
           <td class="paramname"><em>capacity</em></td><td>)</td>
           <td></td>
         </tr>

functions.html

@@ -82,7 +82,7 @@ <h3><a id="index_b" name="index_b"></a>- b -</h3><ul>
 
 
 <h3><a id="index_c" name="index_c"></a>- c -</h3><ul>
-<li>cache()&#160;:&#160;<a class="el" href="classstep20_1_1least__frequently__used_1_1cache.html#af7446054d1fcde8a58b653ff58829fc1">step20::least_frequently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a>, <a class="el" href="classstep20_1_1least__recently__used_1_1cache.html#a536ea1924994f0a78a6b721a3d1fcf04">step20::least_recently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a></li>
+<li>cache()&#160;:&#160;<a class="el" href="classstep20_1_1least__frequently__used_1_1cache.html#af7446054d1fcde8a58b653ff58829fc1">step20::least_frequently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a>, <a class="el" href="classstep20_1_1least__recently__used_1_1cache.html#afe5c3618a93a5b424edc6d44791c9838">step20::least_recently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a></li>
 <li>child_node&#160;:&#160;<a class="el" href="structstep20_1_1suffix__tree_1_1edge__type.html#af22401faffe82d132478c811e385a869">step20::suffix_tree&lt; Char, Size, Map &gt;::edge_type</a></li>
 <li>clear()&#160;:&#160;<a class="el" href="classstep20_1_1suffix__tree.html#ad36ae576e6c2d90a99b0726327c4b52e">step20::suffix_tree&lt; Char, Size, Map &gt;</a></li>
 <li>comp()&#160;:&#160;<a class="el" href="classstep20_1_1suffix__array.html#a9724f18e699e969a0376d3de53048285">step20::suffix_array&lt; Char, Size, Compare &gt;</a></li>

functions_func.html

@@ -82,7 +82,7 @@ <h3><a id="index_b" name="index_b"></a>- b -</h3><ul>
 
 
 <h3><a id="index_c" name="index_c"></a>- c -</h3><ul>
-<li>cache()&#160;:&#160;<a class="el" href="classstep20_1_1least__frequently__used_1_1cache.html#af7446054d1fcde8a58b653ff58829fc1">step20::least_frequently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a>, <a class="el" href="classstep20_1_1least__recently__used_1_1cache.html#a536ea1924994f0a78a6b721a3d1fcf04">step20::least_recently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a></li>
+<li>cache()&#160;:&#160;<a class="el" href="classstep20_1_1least__frequently__used_1_1cache.html#af7446054d1fcde8a58b653ff58829fc1">step20::least_frequently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a>, <a class="el" href="classstep20_1_1least__recently__used_1_1cache.html#afe5c3618a93a5b424edc6d44791c9838">step20::least_recently_used::cache&lt; Key, T, Hash, KeyEqual &gt;</a></li>
 <li>clear()&#160;:&#160;<a class="el" href="classstep20_1_1suffix__tree.html#ad36ae576e6c2d90a99b0726327c4b52e">step20::suffix_tree&lt; Char, Size, Map &gt;</a></li>
 <li>comp()&#160;:&#160;<a class="el" href="classstep20_1_1suffix__array.html#a9724f18e699e969a0376d3de53048285">step20::suffix_array&lt; Char, Size, Compare &gt;</a></li>
 </ul>

least__recently__used_8hpp_source.html

@@ -139,10 +139,10 @@
 <div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>          <span class="keyword">class </span>KeyEqual = std::equal_to&lt;Key&gt;&gt;</div>
 <div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="classstep20_1_1least__recently__used_1_1cache.html">   67</a></span><span class="keyword">class </span><a class="code hl_class" href="classstep20_1_1least__recently__used_1_1cache.html">cache</a> {</div>
 <div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    detail::linked_hash_map&lt;Key, T, Hash, KeyEqual&gt; map_;</div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordtype">size_t</span> capacity_;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::size_t capacity_;</div>
 <div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
 <div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="keyword">public</span>:</div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="classstep20_1_1least__recently__used_1_1cache.html#a536ea1924994f0a78a6b721a3d1fcf04">   72</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="classstep20_1_1least__recently__used_1_1cache.html#a536ea1924994f0a78a6b721a3d1fcf04">cache</a>(<span class="keywordtype">size_t</span> capacity) : capacity_(capacity) {}</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="classstep20_1_1least__recently__used_1_1cache.html#afe5c3618a93a5b424edc6d44791c9838">   72</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="classstep20_1_1least__recently__used_1_1cache.html#afe5c3618a93a5b424edc6d44791c9838">cache</a>(std::size_t capacity) : capacity_(capacity) {}</div>
 <div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
 <div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="classstep20_1_1least__recently__used_1_1cache.html#aa4f4eeea0547d7f296ccef2f87b023dc">   75</a></span>    <span class="keyword">const</span> T* <a class="code hl_function" href="classstep20_1_1least__recently__used_1_1cache.html#aa4f4eeea0547d7f296ccef2f87b023dc">find</a>(<span class="keyword">const</span> Key&amp; key)</div>
 <div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    {</div>
@@ -170,9 +170,9 @@
 <div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
 <div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="preprocessor">#endif  </span><span class="comment">// STEP20_LEAST_RECENTLY_USED_HPP</span></div>
 <div class="ttc" id="aclassstep20_1_1least__recently__used_1_1cache_html"><div class="ttname"><a href="classstep20_1_1least__recently__used_1_1cache.html">step20::least_recently_used::cache</a></div><div class="ttdoc">An O(1) algorithm for implementing the LRU cache eviction scheme.</div><div class="ttdef"><b>Definition</b> least_recently_used.hpp:67</div></div>
-<div class="ttc" id="aclassstep20_1_1least__recently__used_1_1cache_html_a536ea1924994f0a78a6b721a3d1fcf04"><div class="ttname"><a href="classstep20_1_1least__recently__used_1_1cache.html#a536ea1924994f0a78a6b721a3d1fcf04">step20::least_recently_used::cache::cache</a></div><div class="ttdeci">cache(size_t capacity)</div><div class="ttdef"><b>Definition</b> least_recently_used.hpp:72</div></div>
 <div class="ttc" id="aclassstep20_1_1least__recently__used_1_1cache_html_aa4f4eeea0547d7f296ccef2f87b023dc"><div class="ttname"><a href="classstep20_1_1least__recently__used_1_1cache.html#aa4f4eeea0547d7f296ccef2f87b023dc">step20::least_recently_used::cache::find</a></div><div class="ttdeci">const T * find(const Key &amp;key)</div><div class="ttdef"><b>Definition</b> least_recently_used.hpp:75</div></div>
 <div class="ttc" id="aclassstep20_1_1least__recently__used_1_1cache_html_af4d61f4bd66686f8b12a3029dd5e39a8"><div class="ttname"><a href="classstep20_1_1least__recently__used_1_1cache.html#af4d61f4bd66686f8b12a3029dd5e39a8">step20::least_recently_used::cache::insert_or_assign</a></div><div class="ttdeci">void insert_or_assign(const Key &amp;key, const T &amp;val)</div><div class="ttdef"><b>Definition</b> least_recently_used.hpp:86</div></div>
+<div class="ttc" id="aclassstep20_1_1least__recently__used_1_1cache_html_afe5c3618a93a5b424edc6d44791c9838"><div class="ttname"><a href="classstep20_1_1least__recently__used_1_1cache.html#afe5c3618a93a5b424edc6d44791c9838">step20::least_recently_used::cache::cache</a></div><div class="ttdeci">cache(std::size_t capacity)</div><div class="ttdef"><b>Definition</b> least_recently_used.hpp:72</div></div>
 <div class="ttc" id="anamespacestep20_1_1least__recently__used_html"><div class="ttname"><a href="namespacestep20_1_1least__recently__used.html">step20::least_recently_used</a></div><div class="ttdef"><b>Definition</b> least_recently_used.hpp:9</div></div>
 <div class="ttc" id="anamespacestep20_html_af47f479f3240776c8f54f1a767d066f0"><div class="ttname"><a href="namespacestep20.html#af47f479f3240776c8f54f1a767d066f0">step20::to</a></div><div class="ttdeci">To to(From &amp;&amp;from)</div><div class="ttdef"><b>Definition</b> to.hpp:13</div></div>
 </div><!-- fragment --></div><!-- contents -->

search/functions_2.js

@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['cache_0',['cache',['../classstep20_1_1least__frequently__used_1_1cache.html#af7446054d1fcde8a58b653ff58829fc1',1,'step20::least_frequently_used::cache::cache()'],['../classstep20_1_1least__recently__used_1_1cache.html#a536ea1924994f0a78a6b721a3d1fcf04',1,'step20::least_recently_used::cache::cache()']]],
+  ['cache_0',['cache',['../classstep20_1_1least__frequently__used_1_1cache.html#af7446054d1fcde8a58b653ff58829fc1',1,'step20::least_frequently_used::cache::cache()'],['../classstep20_1_1least__recently__used_1_1cache.html#afe5c3618a93a5b424edc6d44791c9838',1,'step20::least_recently_used::cache::cache()']]],
   ['clear_1',['clear',['../classstep20_1_1suffix__tree.html#ad36ae576e6c2d90a99b0726327c4b52e',1,'step20::suffix_tree']]],
   ['comp_2',['comp',['../classstep20_1_1suffix__array.html#a9724f18e699e969a0376d3de53048285',1,'step20::suffix_array']]],
   ['copy_3',['copy',['../namespacestep20_1_1longest__common__subsequence.html#a8eca8dbcb5b59cc84f78de054faf5dab',1,'step20::longest_common_subsequence::copy()'],['../namespacestep20_1_1longest__common__substring.html#a98ec271555c59680fe0d092802cc53d0',1,'step20::longest_common_substring::copy()']]]