backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-20 20:07:45 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for ffef54470d

Browse Source
This commit is contained in:
realstealthninja
2024-10-22 14:06:47 +00:00
parent b98db53ab4
commit 4c55e5257f
221 changed files with 4878 additions and 1509 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
annotated.html
View File

@@ -201,6 +201,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
<tr id="row_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_13_0_" class="arrow" onclick="dynsection.toggleFolder('13_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/dde/namespaceothers_1_1_cache.html" target="_self">Cache</a></td><td class="desc"><a class="el" href="db/dde/namespaceothers_1_1_cache.html" title="Cache algorithm.">Cache</a> algorithm </td></tr>
<tr id="row_13_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html" target="_self">D_Node</a></td><td class="desc"><a class="el" href="db/d8b/struct_node.html">Node</a> for a doubly linked list with data, prev and next pointers </td></tr>
<tr id="row_13_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html" target="_self">LFUCache</a></td><td class="desc"><a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html" title="LFUCache.">LFUCache</a> </td></tr>
<tr id="row_13_0_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" target="_self">LRUCache</a></td><td class="desc"><a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" title="LRUCache.">LRUCache</a> </td></tr>
<tr id="row_13_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_13_1_" class="arrow" onclick="dynsection.toggleFolder('13_1_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>iterative_tree_traversals</b></td><td class="desc"></td></tr>
<tr id="row_13_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" target="_self">BinaryTree</a></td><td class="desc">Defines the functions associated with the binary tree </td></tr>
<tr id="row_13_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>

3
annotated_dup.js
View File

@@ -125,7 +125,8 @@ var annotated_dup =
[ "others", "d0/d6f/namespaceothers.html", [
[ "Cache", "db/dde/namespaceothers_1_1_cache.html", [
[ "D_Node", "de/d21/classothers_1_1_cache_1_1_d___node.html", "de/d21/classothers_1_1_cache_1_1_d___node" ],
[ "LFUCache", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache" ]
[ "LFUCache", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache" ],
[ "LRUCache", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache" ]
] ],
[ "iterative_tree_traversals", null, [
[ "BinaryTree", "d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html", "d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree" ],

2
classes.html
View File

@@ -141,7 +141,7 @@ $(function(){initNavTree('classes.html',''); initResizable(true); });
<dd><a class="el" href="da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a> (machine_learning::k_nearest_neighbors)</dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_L" name="letter_L">L</a></dt>
<dd><a class="el" href="db/d82/classlarge__number.html">large_number</a></dd><dd><a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">LFUCache</a> (<a class="el" href="db/dde/namespaceothers_1_1_cache.html">others::Cache</a>)</dd><dd><a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> (data_structures::linked_list)</dd><dd><a class="el" href="d0/dff/structlinkedlist.html">linkedlist</a></dd><dd><a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> (data_structures::linked_list)</dd><dd><a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html">list</a> (data_structures::list_array)</dd><dd><a class="el" href="d8/d10/structlist.html">list</a></dd><dd><a class="el" href="d7/da4/struct_list_node.html">ListNode</a></dd><dd><a class="el" href="da/d21/class_longest___substring.html">Longest_Substring</a></dd><dd><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)</dd><dd><a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">LRUCache</a> (others::lru_cache)</dd></dl>
<dd><a class="el" href="db/d82/classlarge__number.html">large_number</a></dd><dd><a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">LFUCache</a> (<a class="el" href="db/dde/namespaceothers_1_1_cache.html">others::Cache</a>)</dd><dd><a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> (data_structures::linked_list)</dd><dd><a class="el" href="d0/dff/structlinkedlist.html">linkedlist</a></dd><dd><a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> (data_structures::linked_list)</dd><dd><a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html">list</a> (data_structures::list_array)</dd><dd><a class="el" href="d8/d10/structlist.html">list</a></dd><dd><a class="el" href="d7/da4/struct_list_node.html">ListNode</a></dd><dd><a class="el" href="da/d21/class_longest___substring.html">Longest_Substring</a></dd><dd><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)</dd><dd><a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">LRUCache</a> (<a class="el" href="db/dde/namespaceothers_1_1_cache.html">others::Cache</a>)</dd><dd><a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">LRUCache</a> (others::lru_cache)</dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_M" name="letter_M">M</a></dt>
<dd><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> (divide_and_conquer::strassens_multiplication)</dd><dd><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a></dd><dd><a class="el" href="d5/d29/struct_min_heap_node.html">MinHeapNode</a></dd><dd><a class="el" href="d1/d77/structmst.html">mst</a></dd></dl>

136
d1/d35/classothers_1_1_cache_1_1_l_r_u_cache-members.html Normal file
View File

@@ -0,0 +1,136 @@
<!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>Algorithms_in_C++: Member List</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", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/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="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</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(1); });
/* @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('d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.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="headertitle"><div class="title">others::Cache::LRUCache&lt; K, V &gt; Member List</div></div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a>, including all inherited members.</p>
<table class="directory">
<tr class="even"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a></td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a">capacity</a>() const</td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e">empty</a>() const</td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">get</a>(K key)</td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a></td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f">LRUCache</a>(int _capacity)</td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &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="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4">make_recent</a>(CacheNode&lt; K, V &gt; *node_ptr)</td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a></td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7">pop_back</a>()</td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2">push_front</a>(CacheNode&lt; K, V &gt; *node_ptr)</td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45">put</a>(K key, V value)</td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1">size</a>() const</td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">tail</a></td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06">~LRUCache</a>()</td><td class="entry"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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>

13
d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.map Normal file
View File

@@ -0,0 +1,13 @@
<map id="others::Cache::LRUCache&lt; K, V &gt;" name="others::Cache::LRUCache&lt; K, V &gt;">
<area shape="rect" id="Node000001" title="LRUCache." alt="" coords="637,68,814,109"/>
<area shape="rect" id="Node000002" href="$de/d21/classothers_1_1_cache_1_1_d___node.html" title=" " alt="" coords="121,11,280,52"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="295,29,361,31,444,36,526,46,637,66,637,72,525,51,443,42,361,37,295,34"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map.html" title=" " alt="" coords="385,61,525,117"/>
<area shape="poly" id="edge6_Node000005_Node000002" title=" " alt="" coords="296,50,385,70,384,76,295,55"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="5,57,44,83"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="58,60,120,46,121,52,59,65"/>
<area shape="poly" id="edge5_Node000005_Node000003" title=" " alt="" coords="60,71,121,76,385,85,385,90,121,81,59,76"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="409,141,502,167"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="516,137,638,107,639,112,517,142"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="541,86,637,86,637,91,541,91"/>
</map>

1
d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.md5 Normal file
View File

@@ -0,0 +1 @@
000048512d2af21496e0d3a3054ece76

205
d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg Normal file
View File

@@ -0,0 +1,205 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: others::Cache::LRUCache&lt; K, V &gt; Pages: 1 -->
<!--zoomable 129 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<defs>
<circle id="rim" cx="0" cy="0" r="7"/>
<circle id="rim2" cx="0" cy="0" r="3.5"/>
<g id="zoomPlus">
<use xlink:href="#rim" fill="#404040"><set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/></use>
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="zoomMin">
<use xlink:href="#rim" fill="#404040"><set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/></use>
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="arrowUp" transform="translate(30 24)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowRight" transform="rotate(90) translate(36 -43)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowDown" transform="rotate(180) translate(-30 -48)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowLeft" transform="rotate(270) translate(-36 17)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="resetDef">
<use xlink:href="#rim2" fill="#404040"><set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/></use>
</g>
</defs>
<script type="application/ecmascript">
var viewWidth = 614;
var viewHeight = 129;
var sectionId = 'dynsection-0';
</script>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>others::Cache::LRUCache&lt; K, V &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="LRUCache.">
<polygon fill="#999999" stroke="#666666" points="606.3,-73.88 474.05,-73.88 474.05,-43.38 606.3,-43.38 606.3,-73.88"/>
<text text-anchor="start" x="482.05" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="540.17" y="-49.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../de/d21/classothers_1_1_cache_1_1_d___node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="206.05,-116.88 86.55,-116.88 86.55,-86.38 206.05,-86.38 206.05,-116.88"/>
<text text-anchor="start" x="94.55" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::D_Node</text>
<text text-anchor="middle" x="146.3" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node2&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.35,-101.3C233.59,-100.99 250.81,-100.47 266.8,-99.62 321.72,-96.72 335.62,-96.5 390.05,-88.62 417.62,-84.63 447.8,-78.84 473.74,-73.4"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="217.74,-97.79 207.8,-101.46 217.86,-104.79 217.74,-97.79"/>
</a>
</g>
<text text-anchor="middle" x="337.42" y="-111.66" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> head</text>
<text text-anchor="middle" x="337.42" y="-100.41" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">tail</text>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="390.05,-79.5 284.8,-79.5 284.8,-37.75 390.05,-37.75 390.05,-79.5"/>
<text text-anchor="start" x="292.8" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
<text text-anchor="start" x="292.8" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, others::Cache::</text>
<text text-anchor="middle" x="337.42" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">D_Node&lt; K, V &gt; * &gt;</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge6_Node000005_Node000002" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge6_Node000005_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.44,-85.68C239.66,-80.63 263.82,-75.13 284.52,-70.43"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="216.81,-82.23 207.84,-87.86 218.37,-89.06 216.81,-82.23"/>
</a>
</g>
<text text-anchor="middle" x="245.42" y="-85.73" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="28.8,-82.25 0,-82.25 0,-63 28.8,-63 28.8,-82.25"/>
<text text-anchor="middle" x="14.4" y="-68.75" font-family="Helvetica,sans-Serif" font-size="10.00">K</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M39.77,-78.07C52.98,-81.01 69.92,-84.8 86.34,-88.46"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="40.81,-74.71 30.29,-75.95 39.29,-81.54 40.81,-74.71"/>
</a>
</g>
<text text-anchor="middle" x="57.67" y="-85.42" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge5_Node000005_Node000003" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M40.64,-70.06C54.23,-68.76 71.29,-67.28 86.55,-66.38 155,-62.31 234.14,-60.31 284.7,-59.38"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="40.41,-66.56 30.8,-71.02 41.09,-73.53 40.41,-66.56"/>
</a>
</g>
<text text-anchor="middle" x="146.3" y="-68.12" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="372.42,-19.25 302.42,-19.25 302.42,0 372.42,0 372.42,-19.25"/>
<text text-anchor="middle" x="337.42" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint32_t</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node1 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node4&#45;&gt;Node1</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M383.51,-20.63C410.45,-27.2 445.1,-35.66 474.87,-42.93"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="384.49,-17.27 373.95,-18.3 382.83,-24.07 384.49,-17.27"/>
</a>
</g>
<text text-anchor="middle" x="432.05" y="-38.81" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> _capacity</text>
</g>
<!-- Node5&#45;&gt;Node1 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node5&#45;&gt;Node1</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M401.73,-58.62C424.68,-58.62 450.63,-58.62 473.76,-58.62"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="401.9,-55.13 391.9,-58.63 401.9,-62.13 401.9,-55.13"/>
</a>
</g>
<text text-anchor="middle" x="432.05" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> node_map</text>
</g>
</g>
</svg>
<g id="navigator" transform="translate(0 0)" fill="#404254">
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
<use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
<use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
<use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
<use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
</g>
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
<g id="arrow_out" transform="scale(0.3 0.3)">
<a xlink:href="classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg" target="_base">
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
<path id="arrow"
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
style="fill:#404040;"/>
</a>
</g>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 10 KiB

122
d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg Normal file
View File

@@ -0,0 +1,122 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: others::Cache::LRUCache&lt; K, V &gt; Pages: 1 -->
<svg width="614pt" height="129pt"
viewBox="0.00 0.00 614.30 129.16" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 125.16)">
<title>others::Cache::LRUCache&lt; K, V &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="LRUCache.">
<polygon fill="#999999" stroke="#666666" points="606.3,-73.88 474.05,-73.88 474.05,-43.38 606.3,-43.38 606.3,-73.88"/>
<text text-anchor="start" x="482.05" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="540.17" y="-49.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../de/d21/classothers_1_1_cache_1_1_d___node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="206.05,-116.88 86.55,-116.88 86.55,-86.38 206.05,-86.38 206.05,-116.88"/>
<text text-anchor="start" x="94.55" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::D_Node</text>
<text text-anchor="middle" x="146.3" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node2&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.35,-101.3C233.59,-100.99 250.81,-100.47 266.8,-99.62 321.72,-96.72 335.62,-96.5 390.05,-88.62 417.62,-84.63 447.8,-78.84 473.74,-73.4"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="217.74,-97.79 207.8,-101.46 217.86,-104.79 217.74,-97.79"/>
</a>
</g>
<text text-anchor="middle" x="337.42" y="-111.66" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> head</text>
<text text-anchor="middle" x="337.42" y="-100.41" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">tail</text>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="390.05,-79.5 284.8,-79.5 284.8,-37.75 390.05,-37.75 390.05,-79.5"/>
<text text-anchor="start" x="292.8" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
<text text-anchor="start" x="292.8" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, others::Cache::</text>
<text text-anchor="middle" x="337.42" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">D_Node&lt; K, V &gt; * &gt;</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge6_Node000005_Node000002" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge6_Node000005_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.44,-85.68C239.66,-80.63 263.82,-75.13 284.52,-70.43"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="216.81,-82.23 207.84,-87.86 218.37,-89.06 216.81,-82.23"/>
</a>
</g>
<text text-anchor="middle" x="245.42" y="-85.73" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="28.8,-82.25 0,-82.25 0,-63 28.8,-63 28.8,-82.25"/>
<text text-anchor="middle" x="14.4" y="-68.75" font-family="Helvetica,sans-Serif" font-size="10.00">K</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M39.77,-78.07C52.98,-81.01 69.92,-84.8 86.34,-88.46"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="40.81,-74.71 30.29,-75.95 39.29,-81.54 40.81,-74.71"/>
</a>
</g>
<text text-anchor="middle" x="57.67" y="-85.42" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge5_Node000005_Node000003" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M40.64,-70.06C54.23,-68.76 71.29,-67.28 86.55,-66.38 155,-62.31 234.14,-60.31 284.7,-59.38"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="40.41,-66.56 30.8,-71.02 41.09,-73.53 40.41,-66.56"/>
</a>
</g>
<text text-anchor="middle" x="146.3" y="-68.12" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="372.42,-19.25 302.42,-19.25 302.42,0 372.42,0 372.42,-19.25"/>
<text text-anchor="middle" x="337.42" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint32_t</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node1 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node4&#45;&gt;Node1</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M383.51,-20.63C410.45,-27.2 445.1,-35.66 474.87,-42.93"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="384.49,-17.27 373.95,-18.3 382.83,-24.07 384.49,-17.27"/>
</a>
</g>
<text text-anchor="middle" x="432.05" y="-38.81" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> _capacity</text>
</g>
<!-- Node5&#45;&gt;Node1 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node5&#45;&gt;Node1</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M401.73,-58.62C424.68,-58.62 450.63,-58.62 473.76,-58.62"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="401.9,-55.13 391.9,-58.63 401.9,-62.13 401.9,-55.13"/>
</a>
</g>
<text text-anchor="middle" x="432.05" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> node_map</text>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 6.5 KiB

11
d4/d89/lru__cache2_8cpp__incl.map Normal file
View File

@@ -0,0 +1,11 @@
<map id="others/lru_cache2.cpp" name="others/lru_cache2.cpp">
<area shape="rect" id="Node000001" title="Implementation for [LRU Cache] (https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Leas..." alt="" coords="94,5,243,31"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,79,70,105"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,34,74,74,71,69,145,29"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="94,79,154,105"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="163,33,142,67,137,64,159,30"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="178,79,249,105"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="178,30,200,64,196,67,173,33"/>
<area shape="rect" id="Node000005" title=" " alt="" coords="273,79,383,105"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="196,29,288,70,286,75,194,34"/>
</map>

1
d4/d89/lru__cache2_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
e1492a5cdea2a46801d6a759537c77be

119
d4/d89/lru__cache2_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,119 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: others/lru_cache2.cpp Pages: 1 -->
<svg width="292pt" height="83pt"
viewBox="0.00 0.00 291.50 82.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.5)">
<title>others/lru_cache2.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Implementation for [LRU Cache] (https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Leas...">
<polygon fill="#999999" stroke="#666666" points="178.12,-74.5 66.12,-74.5 66.12,-55.25 178.12,-55.25 178.12,-74.5"/>
<text text-anchor="middle" x="122.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">others/lru_cache2.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
<text text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.5,-54.84C90.44,-46.66 67.98,-34.46 50.47,-24.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="52.62,-22.12 42.16,-20.43 49.28,-28.27 52.62,-22.12"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="111.75,-19.25 66.5,-19.25 66.5,0 111.75,0 111.75,-19.25"/>
<text text-anchor="middle" x="89.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.68,-55.08C112.35,-48.11 106.16,-38.12 100.74,-29.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="103.73,-27.55 95.49,-20.9 97.78,-31.24 103.73,-27.55"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="182.88,-19.25 129.38,-19.25 129.38,0 182.88,0 182.88,-19.25"/>
<text text-anchor="middle" x="156.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M127.74,-55.08C132.24,-48.03 138.71,-37.9 144.34,-29.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="147.14,-31.2 149.57,-20.88 141.24,-27.43 147.14,-31.2"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="283.5,-19.25 200.75,-19.25 200.75,0 283.5,0 283.5,-19.25"/>
<text text-anchor="middle" x="242.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">unordered_map</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M142.48,-54.84C161.36,-46.47 189.71,-33.88 211.35,-24.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="212.56,-27.57 220.29,-20.32 209.73,-21.17 212.56,-27.57"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.6 KiB

93
d4/d89/lru__cache2_8cpp__incl_org.svg Normal file
View File

@@ -0,0 +1,93 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: others/lru_cache2.cpp Pages: 1 -->
<svg width="292pt" height="83pt"
viewBox="0.00 0.00 291.50 82.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.5)">
<title>others/lru_cache2.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Implementation for [LRU Cache] (https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Leas...">
<polygon fill="#999999" stroke="#666666" points="178.12,-74.5 66.12,-74.5 66.12,-55.25 178.12,-55.25 178.12,-74.5"/>
<text text-anchor="middle" x="122.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">others/lru_cache2.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
<text text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.5,-54.84C90.44,-46.66 67.98,-34.46 50.47,-24.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="52.62,-22.12 42.16,-20.43 49.28,-28.27 52.62,-22.12"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="111.75,-19.25 66.5,-19.25 66.5,0 111.75,0 111.75,-19.25"/>
<text text-anchor="middle" x="89.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.68,-55.08C112.35,-48.11 106.16,-38.12 100.74,-29.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="103.73,-27.55 95.49,-20.9 97.78,-31.24 103.73,-27.55"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="182.88,-19.25 129.38,-19.25 129.38,0 182.88,0 182.88,-19.25"/>
<text text-anchor="middle" x="156.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M127.74,-55.08C132.24,-48.03 138.71,-37.9 144.34,-29.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="147.14,-31.2 149.57,-20.88 141.24,-27.43 147.14,-31.2"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="283.5,-19.25 200.75,-19.25 200.75,0 283.5,0 283.5,-19.25"/>
<text text-anchor="middle" x="242.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">unordered_map</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M142.48,-54.84C161.36,-46.47 189.71,-33.88 211.35,-24.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="212.56,-27.57 220.29,-20.32 209.73,-21.17 212.56,-27.57"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.9 KiB

7
d5/ddb/classothers_1_1_cache_1_1_d___node-members.html
View File

@@ -111,9 +111,10 @@ $(function(){initNavTree('de/d21/classothers_1_1_cache_1_1_d___node.html','../..
<p>This is the complete list of members for <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &gt;</a>, including all inherited members.</p>
<table class="directory">
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>D_Node</b>(T data) (defined in <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &gt;</a>)</td><td class="entry"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &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="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a></td><td class="entry"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &gt;</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a99420ff7864ecea51429fe61f9c6cb14">next</a></td><td class="entry"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &gt;</a></td><td class="entry"></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a1c5295011209f1241fa0aac827129414">prev</a></td><td class="entry"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &gt;</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>D_Node</b>(T data) (defined in <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &gt;</a>)</td><td class="entry"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &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="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a></td><td class="entry"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &gt;</a></td><td class="entry"></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">next</a></td><td class="entry"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &gt;</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a></td><td class="entry"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &gt;</a></td><td class="entry"></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->

651
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html Normal file
View File

@@ -0,0 +1,651 @@
<!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>Algorithms_in_C++: others::Cache::LRUCache&lt; K, V &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", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/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="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</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(1); });
/* @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('d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.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="#pub-methods">Public Member Functions</a> &#124;
<a href="#pri-methods">Private Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="../../d1/d35/classothers_1_1_cache_1_1_l_r_u_cache-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">others::Cache::LRUCache&lt; K, V &gt; Class Template Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" title="LRUCache.">LRUCache</a>.
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for others::Cache::LRUCache&lt; K, V &gt;:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg" width="100%" height="429"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a8980cbbc9cf0a98a9592b40c4d6ec28f" id="r_a8980cbbc9cf0a98a9592b40c4d6ec28f"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8980cbbc9cf0a98a9592b40c4d6ec28f">LRUCache</a> (int <a class="el" href="#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>)</td></tr>
<tr class="memdesc:a8980cbbc9cf0a98a9592b40c4d6ec28f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructor, Initialize the head and tail pointers to nullptr and initialize the _capacity of the cache. <br /></td></tr>
<tr class="separator:a8980cbbc9cf0a98a9592b40c4d6ec28f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5ee34fcee480f21bb6f68a34f0f69b45" id="r_a5ee34fcee480f21bb6f68a34f0f69b45"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5ee34fcee480f21bb6f68a34f0f69b45">put</a> (K key, V value)</td></tr>
<tr class="memdesc:a5ee34fcee480f21bb6f68a34f0f69b45"><td class="mdescLeft">&#160;</td><td class="mdescRight">upsert a key-value pair <br /></td></tr>
<tr class="separator:a5ee34fcee480f21bb6f68a34f0f69b45"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac1be0357ecc7c34144f3d9a63c6cb3ea" id="r_ac1be0357ecc7c34144f3d9a63c6cb3ea"><td class="memItemLeft" align="right" valign="top">V&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac1be0357ecc7c34144f3d9a63c6cb3ea">get</a> (K key)</td></tr>
<tr class="memdesc:ac1be0357ecc7c34144f3d9a63c6cb3ea"><td class="mdescLeft">&#160;</td><td class="mdescRight">get the value of the key-value pair if exists <br /></td></tr>
<tr class="separator:ac1be0357ecc7c34144f3d9a63c6cb3ea"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1b709333874b4633ee02a3661cd042e1" id="r_a1b709333874b4633ee02a3661cd042e1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1b709333874b4633ee02a3661cd042e1">size</a> () const</td></tr>
<tr class="memdesc:a1b709333874b4633ee02a3661cd042e1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the number of items present in the cache. <br /></td></tr>
<tr class="separator:a1b709333874b4633ee02a3661cd042e1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af8edfe5a7def5d5b846463041c33136a" id="r_af8edfe5a7def5d5b846463041c33136a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af8edfe5a7def5d5b846463041c33136a">capacity</a> () const</td></tr>
<tr class="memdesc:af8edfe5a7def5d5b846463041c33136a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the total capacity of the cache. <br /></td></tr>
<tr class="separator:af8edfe5a7def5d5b846463041c33136a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab8b6a6aa95db678596bc2a49e864683e" id="r_ab8b6a6aa95db678596bc2a49e864683e"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab8b6a6aa95db678596bc2a49e864683e">empty</a> () const</td></tr>
<tr class="memdesc:ab8b6a6aa95db678596bc2a49e864683e"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns whether the cache is empty or not <br /></td></tr>
<tr class="separator:ab8b6a6aa95db678596bc2a49e864683e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6d855ff72ad6fe548eb564b7f87abe06" id="r_a6d855ff72ad6fe548eb564b7f87abe06"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d855ff72ad6fe548eb564b7f87abe06">~LRUCache</a> ()</td></tr>
<tr class="memdesc:a6d855ff72ad6fe548eb564b7f87abe06"><td class="mdescLeft">&#160;</td><td class="mdescRight">destructs the cache, iterates on the map and deletes every node present in the cache. <br /></td></tr>
<tr class="separator:a6d855ff72ad6fe548eb564b7f87abe06"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:a2e53b5ad1368d87da501f61473eb9ea2" id="r_a2e53b5ad1368d87da501f61473eb9ea2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2e53b5ad1368d87da501f61473eb9ea2">push_front</a> (<a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *node_ptr)</td></tr>
<tr class="memdesc:a2e53b5ad1368d87da501f61473eb9ea2"><td class="mdescLeft">&#160;</td><td class="mdescRight">push the node to the front of the linked list. <br /></td></tr>
<tr class="separator:a2e53b5ad1368d87da501f61473eb9ea2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad022d494b40f82417340b113445e79a4" id="r_ad022d494b40f82417340b113445e79a4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad022d494b40f82417340b113445e79a4">make_recent</a> (<a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *node_ptr)</td></tr>
<tr class="memdesc:ad022d494b40f82417340b113445e79a4"><td class="mdescLeft">&#160;</td><td class="mdescRight">move the existing node in the list to the beginning of the list. <br /></td></tr>
<tr class="separator:ad022d494b40f82417340b113445e79a4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab211a4be58491bf11834cae88a0c44f7" id="r_ab211a4be58491bf11834cae88a0c44f7"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab211a4be58491bf11834cae88a0c44f7">pop_back</a> ()</td></tr>
<tr class="memdesc:ab211a4be58491bf11834cae88a0c44f7"><td class="mdescLeft">&#160;</td><td class="mdescRight">pop the last node in the linked list. <br /></td></tr>
<tr class="separator:ab211a4be58491bf11834cae88a0c44f7"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a042bb403f4452ad8c669fbf87ef82821" id="r_a042bb403f4452ad8c669fbf87ef82821"><td class="memItemLeft" align="right" valign="top"><a id="a042bb403f4452ad8c669fbf87ef82821" name="a042bb403f4452ad8c669fbf87ef82821"></a>
<a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *&#160;</td><td class="memItemRight" valign="bottom"><b>head</b></td></tr>
<tr class="memdesc:a042bb403f4452ad8c669fbf87ef82821"><td class="mdescLeft">&#160;</td><td class="mdescRight">head of the doubly linked list <br /></td></tr>
<tr class="separator:a042bb403f4452ad8c669fbf87ef82821"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a448121f391a71f4cf88c3cb6c4cf3100" id="r_a448121f391a71f4cf88c3cb6c4cf3100"><td class="memItemLeft" align="right" valign="top"><a id="a448121f391a71f4cf88c3cb6c4cf3100" name="a448121f391a71f4cf88c3cb6c4cf3100"></a>
<a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *&#160;</td><td class="memItemRight" valign="bottom"><b>tail</b></td></tr>
<tr class="memdesc:a448121f391a71f4cf88c3cb6c4cf3100"><td class="mdescLeft">&#160;</td><td class="mdescRight">tail of the doubly linked list <br /></td></tr>
<tr class="separator:a448121f391a71f4cf88c3cb6c4cf3100"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af34bb8b8eaa34cc499b4fed30b9d05fc" id="r_af34bb8b8eaa34cc499b4fed30b9d05fc"><td class="memItemLeft" align="right" valign="top"><a id="af34bb8b8eaa34cc499b4fed30b9d05fc" name="af34bb8b8eaa34cc499b4fed30b9d05fc"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a>&#160;</td><td class="memItemRight" valign="bottom"><b>_capacity</b></td></tr>
<tr class="memdesc:af34bb8b8eaa34cc499b4fed30b9d05fc"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum capacity of the cache <br /></td></tr>
<tr class="separator:af34bb8b8eaa34cc499b4fed30b9d05fc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8dab0f69410484f772946befd24cc3c5" id="r_a8dab0f69410484f772946befd24cc3c5"><td class="memItemLeft" align="right" valign="top"><a id="a8dab0f69410484f772946befd24cc3c5" name="a8dab0f69410484f772946befd24cc3c5"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; K, <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; * &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>node_map</b></td></tr>
<tr class="memdesc:a8dab0f69410484f772946befd24cc3c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">maps the key to the node address <br /></td></tr>
<tr class="separator:a8dab0f69410484f772946befd24cc3c5"><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 K, typename V&gt;<br />
class others::Cache::LRUCache&lt; K, V &gt;</div><p><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" title="LRUCache.">LRUCache</a>. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">K</td><td>type of key in the LRU </td></tr>
<tr><td class="paramname">V</td><td>type of value in the LRU </td></tr>
</table>
</dd>
</dl>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a8980cbbc9cf0a98a9592b40c4d6ec28f" name="a8980cbbc9cf0a98a9592b40c4d6ec28f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8980cbbc9cf0a98a9592b40c4d6ec28f">&#9670;&#160;</a></span>LRUCache()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename K , typename V &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &gt;::LRUCache </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>_capacity</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">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Constructor, Initialize the head and tail pointers to nullptr and initialize the _capacity of the cache. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">_capacity</td><td>Total capacity of the cache </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 76</span> : <a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a>(<span class="keyword">nullptr</span>), <a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>(<span class="keyword">nullptr</span>), <a class="code hl_variable" href="#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>(<a class="code hl_variable" href="#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>) {}</div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a042bb403f4452ad8c669fbf87ef82821"><div class="ttname"><a href="#a042bb403f4452ad8c669fbf87ef82821">others::Cache::LRUCache::head</a></div><div class="ttdeci">CacheNode&lt; K, V &gt; * head</div><div class="ttdoc">head of the doubly linked list</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:62</div></div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a448121f391a71f4cf88c3cb6c4cf3100"><div class="ttname"><a href="#a448121f391a71f4cf88c3cb6c4cf3100">others::Cache::LRUCache::tail</a></div><div class="ttdeci">CacheNode&lt; K, V &gt; * tail</div><div class="ttdoc">tail of the doubly linked list</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:63</div></div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_af34bb8b8eaa34cc499b4fed30b9d05fc"><div class="ttname"><a href="#af34bb8b8eaa34cc499b4fed30b9d05fc">others::Cache::LRUCache::_capacity</a></div><div class="ttdeci">std::uint32_t _capacity</div><div class="ttdoc">maximum capacity of the cache</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:64</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a6d855ff72ad6fe548eb564b7f87abe06" name="a6d855ff72ad6fe548eb564b7f87abe06"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6d855ff72ad6fe548eb564b7f87abe06">&#9670;&#160;</a></span>~LRUCache()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename K , typename V &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &gt;::~<a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">LRUCache</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>destructs the cache, iterates on the map and deletes every node present in the cache. </p>
<div class="fragment"><div class="line"><span class="lineno"> 205</span> {</div>
<div class="line"><span class="lineno"> 206</span> <span class="keyword">auto</span> it = <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.begin();</div>
<div class="line"><span class="lineno"> 207</span> <span class="keywordflow">while</span> (it != <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.end()) {</div>
<div class="line"><span class="lineno"> 208</span> <span class="keyword">delete</span> it-&gt;second;</div>
<div class="line"><span class="lineno"> 209</span> ++it;</div>
<div class="line"><span class="lineno"> 210</span> }</div>
<div class="line"><span class="lineno"> 211</span> }</div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a8dab0f69410484f772946befd24cc3c5"><div class="ttname"><a href="#a8dab0f69410484f772946befd24cc3c5">others::Cache::LRUCache::node_map</a></div><div class="ttdeci">std::unordered_map&lt; K, CacheNode&lt; K, V &gt; * &gt; node_map</div><div class="ttdoc">maps the key to the node address</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:67</div></div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="af8edfe5a7def5d5b846463041c33136a" name="af8edfe5a7def5d5b846463041c33136a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af8edfe5a7def5d5b846463041c33136a">&#9670;&#160;</a></span>capacity()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename K , typename V &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &gt;::capacity </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>Returns the total capacity of the cache. </p>
<dl class="section return"><dt>Returns</dt><dd>Total capacity of the cache </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 193</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="ab8b6a6aa95db678596bc2a49e864683e" name="ab8b6a6aa95db678596bc2a49e864683e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab8b6a6aa95db678596bc2a49e864683e">&#9670;&#160;</a></span>empty()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename K , typename V &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &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>returns whether the cache is empty or not </p>
<dl class="section return"><dt>Returns</dt><dd>true if the cache is empty, false otherwise. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 199</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.empty(); }</div>
</div><!-- fragment -->
</div>
</div>
<a id="ac1be0357ecc7c34144f3d9a63c6cb3ea" name="ac1be0357ecc7c34144f3d9a63c6cb3ea"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac1be0357ecc7c34144f3d9a63c6cb3ea">&#9670;&#160;</a></span>get()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename K , typename V &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">V <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &gt;::get </td>
<td>(</td>
<td class="paramtype">K</td> <td class="paramname"><span class="paramname"><em>key</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>get the value of the key-value pair if exists </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">key</td><td>key of the key-value pair </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>the value mapped to the given key </dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
<table class="exception">
<tr><td class="paramname">exception</td><td>is thrown if the key is not present in the cache </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 172</span> {</div>
<div class="line"><span class="lineno"> 173</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.count(key)) {</div>
<div class="line"><span class="lineno"> 174</span> <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a>(<span class="stringliteral">&quot;key is not present in the cache&quot;</span>);</div>
<div class="line"><span class="lineno"> 175</span> }</div>
<div class="line"><span class="lineno"> 176</span> </div>
<div class="line"><span class="lineno"> 177</span> <span class="comment">// move node to the beginning of the list</span></div>
<div class="line"><span class="lineno"> 178</span> V value = <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>[key]-&gt;data.second;</div>
<div class="line"><span class="lineno"> 179</span> <a class="code hl_function" href="#ad022d494b40f82417340b113445e79a4">make_recent</a>(<a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>[key]);</div>
<div class="line"><span class="lineno"> 180</span> <span class="keywordflow">return</span> value;</div>
<div class="line"><span class="lineno"> 181</span> }</div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_ad022d494b40f82417340b113445e79a4"><div class="ttname"><a href="#ad022d494b40f82417340b113445e79a4">others::Cache::LRUCache::make_recent</a></div><div class="ttdeci">void make_recent(CacheNode&lt; K, V &gt; *node_ptr)</div><div class="ttdoc">move the existing node in the list to the beginning of the list.</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:99</div></div>
<div class="ttc" id="aruntime_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.svg" width="662" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="ad022d494b40f82417340b113445e79a4" name="ad022d494b40f82417340b113445e79a4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad022d494b40f82417340b113445e79a4">&#9670;&#160;</a></span>make_recent()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename K , typename V &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &gt;::make_recent </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *</td> <td class="paramname"><span class="paramname"><em>node_ptr</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">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>move the existing node in the list to the beginning of the list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">node_ptr</td><td>node to be moved to the beginning. </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 99</span> {</div>
<div class="line"><span class="lineno"> 100</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a> == node_ptr) {</div>
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 102</span> }</div>
<div class="line"><span class="lineno"> 103</span> </div>
<div class="line"><span class="lineno"> 104</span> CacheNode&lt;K, V&gt; *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a> = node_ptr-&gt;prev;</div>
<div class="line"><span class="lineno"> 105</span> CacheNode&lt;K, V&gt; *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = node_ptr-&gt;next;</div>
<div class="line"><span class="lineno"> 106</span> </div>
<div class="line"><span class="lineno"> 107</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>-&gt;next = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>;</div>
<div class="line"><span class="lineno"> 108</span> <span class="keywordflow">if</span> (next) {</div>
<div class="line"><span class="lineno"> 109</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>-&gt;prev = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>;</div>
<div class="line"><span class="lineno"> 110</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 111</span> <a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>;</div>
<div class="line"><span class="lineno"> 112</span> }</div>
<div class="line"><span class="lineno"> 113</span> </div>
<div class="line"><span class="lineno"> 114</span> node_ptr-&gt;prev = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 115</span> node_ptr-&gt;next = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 116</span> <a class="code hl_function" href="#a2e53b5ad1368d87da501f61473eb9ea2">push_front</a>(node_ptr);</div>
<div class="line"><span class="lineno"> 117</span> }</div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a2e53b5ad1368d87da501f61473eb9ea2"><div class="ttname"><a href="#a2e53b5ad1368d87da501f61473eb9ea2">others::Cache::LRUCache::push_front</a></div><div class="ttdeci">void push_front(CacheNode&lt; K, V &gt; *node_ptr)</div><div class="ttdoc">push the node to the front of the linked list.</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:83</div></div>
<div class="ttc" id="anext_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/next.html">std::next</a></div><div class="ttdeci">T next(T... args)</div></div>
<div class="ttc" id="aprev_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/prev.html">std::prev</a></div><div class="ttdeci">T prev(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.svg" width="412" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="ab211a4be58491bf11834cae88a0c44f7" name="ab211a4be58491bf11834cae88a0c44f7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab211a4be58491bf11834cae88a0c44f7">&#9670;&#160;</a></span>pop_back()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename K , typename V &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &gt;::pop_back </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 class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>pop the last node in the linked list. </p>
<div class="fragment"><div class="line"><span class="lineno"> 122</span> {</div>
<div class="line"><span class="lineno"> 123</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a>) {</div>
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 125</span> }</div>
<div class="line"><span class="lineno"> 126</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a> == <a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>) {</div>
<div class="line"><span class="lineno"> 127</span> <span class="keyword">delete</span> <a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a>;</div>
<div class="line"><span class="lineno"> 128</span> <a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 129</span> <a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 130</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 131</span> }</div>
<div class="line"><span class="lineno"> 132</span> </div>
<div class="line"><span class="lineno"> 133</span> CacheNode&lt;K, V&gt; *temp = <a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>;</div>
<div class="line"><span class="lineno"> 134</span> <a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a> = <a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>-&gt;prev;</div>
<div class="line"><span class="lineno"> 135</span> <a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>-&gt;next = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 136</span> <span class="keyword">delete</span> temp;</div>
<div class="line"><span class="lineno"> 137</span> }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a2e53b5ad1368d87da501f61473eb9ea2" name="a2e53b5ad1368d87da501f61473eb9ea2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2e53b5ad1368d87da501f61473eb9ea2">&#9670;&#160;</a></span>push_front()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename K , typename V &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &gt;::push_front </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *</td> <td class="paramname"><span class="paramname"><em>node_ptr</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">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>push the node to the front of the linked list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">node_ptr</td><td>the node to be pushed </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 83</span> {</div>
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a>) {</div>
<div class="line"><span class="lineno"> 85</span> <a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a> = node_ptr;</div>
<div class="line"><span class="lineno"> 86</span> <a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a> = node_ptr;</div>
<div class="line"><span class="lineno"> 87</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 88</span> }</div>
<div class="line"><span class="lineno"> 89</span> </div>
<div class="line"><span class="lineno"> 90</span> node_ptr-&gt;next = <a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a>;</div>
<div class="line"><span class="lineno"> 91</span> <a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a>-&gt;prev = node_ptr;</div>
<div class="line"><span class="lineno"> 92</span> <a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a> = node_ptr;</div>
<div class="line"><span class="lineno"> 93</span> }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a5ee34fcee480f21bb6f68a34f0f69b45" name="a5ee34fcee480f21bb6f68a34f0f69b45"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5ee34fcee480f21bb6f68a34f0f69b45">&#9670;&#160;</a></span>put()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename K , typename V &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &gt;::put </td>
<td>(</td>
<td class="paramtype">K</td> <td class="paramname"><span class="paramname"><em>key</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">V</td> <td class="paramname"><span class="paramname"><em>value</em></span>&#160;)</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>upsert a key-value pair </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">key</td><td>key of the key-value pair </td></tr>
<tr><td class="paramname">value</td><td>value of the key-value pair </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 145</span> {</div>
<div class="line"><span class="lineno"> 146</span> <span class="comment">// update the value if key already exists</span></div>
<div class="line"><span class="lineno"> 147</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.count(key)) {</div>
<div class="line"><span class="lineno"> 148</span> <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>[key]-&gt;data.second = value;</div>
<div class="line"><span class="lineno"> 149</span> <a class="code hl_function" href="#ad022d494b40f82417340b113445e79a4">make_recent</a>(<a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>[key]);</div>
<div class="line"><span class="lineno"> 150</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 151</span> }</div>
<div class="line"><span class="lineno"> 152</span> </div>
<div class="line"><span class="lineno"> 153</span> <span class="comment">// if the cache is full</span></div>
<div class="line"><span class="lineno"> 154</span> <span class="comment">// remove the least recently used item</span></div>
<div class="line"><span class="lineno"> 155</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.size() == <a class="code hl_variable" href="#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>) {</div>
<div class="line"><span class="lineno"> 156</span> <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.erase(<a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>-&gt;data.first);</div>
<div class="line"><span class="lineno"> 157</span> <a class="code hl_function" href="#ab211a4be58491bf11834cae88a0c44f7">pop_back</a>();</div>
<div class="line"><span class="lineno"> 158</span> }</div>
<div class="line"><span class="lineno"> 159</span> </div>
<div class="line"><span class="lineno"> 160</span> CacheNode&lt;K, V&gt; *newNode = <span class="keyword">new</span> CacheNode&lt;K, V&gt;({key, value});</div>
<div class="line"><span class="lineno"> 161</span> </div>
<div class="line"><span class="lineno"> 162</span> <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>[key] = newNode;</div>
<div class="line"><span class="lineno"> 163</span> <a class="code hl_function" href="#a2e53b5ad1368d87da501f61473eb9ea2">push_front</a>(newNode);</div>
<div class="line"><span class="lineno"> 164</span> }</div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_ab211a4be58491bf11834cae88a0c44f7"><div class="ttname"><a href="#ab211a4be58491bf11834cae88a0c44f7">others::Cache::LRUCache::pop_back</a></div><div class="ttdeci">void pop_back()</div><div class="ttdoc">pop the last node in the linked list.</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:122</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.svg" width="662" height="167"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="a1b709333874b4633ee02a3661cd042e1" name="a1b709333874b4633ee02a3661cd042e1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1b709333874b4633ee02a3661cd042e1">&#9670;&#160;</a></span>size()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename K , typename V &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &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>Returns the number of items present in the cache. </p>
<dl class="section return"><dt>Returns</dt><dd>number of items in the cache </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 187</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.size(); }</div>
</div><!-- fragment -->
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>others/<a class="el" href="../../dc/daa/lru__cache2_8cpp.html">lru_cache2.cpp</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="../../d0/d6f/namespaceothers.html">others</a></li><li class="navelem"><a class="el" href="../../db/dde/namespaceothers_1_1_cache.html">Cache</a></li><li class="navelem"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">LRUCache</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>

17
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.js Normal file
View File

@@ -0,0 +1,17 @@
var classothers_1_1_cache_1_1_l_r_u_cache =
[
[ "LRUCache", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f", null ],
[ "~LRUCache", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06", null ],
[ "capacity", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a", null ],
[ "empty", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e", null ],
[ "get", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea", null ],
[ "make_recent", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4", null ],
[ "pop_back", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7", null ],
[ "push_front", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2", null ],
[ "put", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45", null ],
[ "size", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1", null ],
[ "_capacity", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc", null ],
[ "head", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821", null ],
[ "node_map", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5", null ],
[ "tail", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100", null ]
];

10
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.map Normal file
View File

@@ -0,0 +1,10 @@
<map id="others::Cache::LRUCache::put" name="others::Cache::LRUCache::put">
<area shape="rect" id="Node000001" title="upsert a key&#45;value pair" alt="" coords="5,70,208,96"/>
<area shape="rect" id="Node000002" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" title="move the existing node in the list to the beginning of the list." alt="" coords="256,5,432,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="162,67,241,48,242,53,163,72"/>
<area shape="rect" id="Node000003" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" title="push the node to the front of the linked list." alt="" coords="480,35,656,75"/>
<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="208,74,465,59,465,64,208,80"/>
<area shape="rect" id="Node000004" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" title="pop the last node in the linked list." alt="" coords="256,120,432,161"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="163,94,242,113,241,118,162,99"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="432,35,465,39,464,44,432,40"/>
</map>

1
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
e39d6679ed29b64bafd84cc0e32ad7af

113
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.svg Normal file
View File

@@ -0,0 +1,113 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: others::Cache::LRUCache::put Pages: 1 -->
<svg width="496pt" height="125pt"
viewBox="0.00 0.00 496.25 124.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 120.5)">
<title>others::Cache::LRUCache::put</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="upsert a key&#45;value pair">
<polygon fill="#999999" stroke="#666666" points="151.75,-67.88 0,-67.88 0,-48.62 151.75,-48.62 151.75,-67.88"/>
<text text-anchor="middle" x="75.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::put</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
<polygon fill="white" stroke="#666666" points="320,-116.5 187.75,-116.5 187.75,-86 320,-86 320,-116.5"/>
<text text-anchor="start" x="195.75" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="253.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M118.14,-68.33C135.8,-72.65 157,-77.83 177.29,-82.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="176.43,-86.18 186.98,-85.15 178.1,-79.38 176.43,-86.18"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
<polygon fill="white" stroke="#666666" points="488.25,-94.5 356,-94.5 356,-64 488.25,-64 488.25,-94.5"/>
<text text-anchor="start" x="364" y="-81" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="422.12" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge4_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M152,-62.83C209.03,-66.31 287.16,-71.08 344.55,-74.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="344.03,-78.05 354.22,-75.17 344.45,-71.07 344.03,-78.05"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" target="_top" xlink:title="pop the last node in the linked list.">
<polygon fill="white" stroke="#666666" points="320,-30.5 187.75,-30.5 187.75,0 320,0 320,-30.5"/>
<text text-anchor="start" x="195.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="253.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pop_back</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M118.14,-48.17C135.8,-43.85 157,-38.67 177.29,-33.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="178.1,-37.12 186.98,-31.35 176.43,-30.32 178.1,-37.12"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M320.1,-92.62C328.02,-91.57 336.16,-90.49 344.22,-89.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="344.58,-92.91 354.04,-88.13 343.66,-85.97 344.58,-92.91"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 5.1 KiB

87
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph_org.svg Normal file
View File

@@ -0,0 +1,87 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: others::Cache::LRUCache::put Pages: 1 -->
<svg width="496pt" height="125pt"
viewBox="0.00 0.00 496.25 124.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 120.5)">
<title>others::Cache::LRUCache::put</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="upsert a key&#45;value pair">
<polygon fill="#999999" stroke="#666666" points="151.75,-67.88 0,-67.88 0,-48.62 151.75,-48.62 151.75,-67.88"/>
<text text-anchor="middle" x="75.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::put</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
<polygon fill="white" stroke="#666666" points="320,-116.5 187.75,-116.5 187.75,-86 320,-86 320,-116.5"/>
<text text-anchor="start" x="195.75" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="253.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M118.14,-68.33C135.8,-72.65 157,-77.83 177.29,-82.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="176.43,-86.18 186.98,-85.15 178.1,-79.38 176.43,-86.18"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
<polygon fill="white" stroke="#666666" points="488.25,-94.5 356,-94.5 356,-64 488.25,-64 488.25,-94.5"/>
<text text-anchor="start" x="364" y="-81" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="422.12" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge4_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M152,-62.83C209.03,-66.31 287.16,-71.08 344.55,-74.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="344.03,-78.05 354.22,-75.17 344.45,-71.07 344.03,-78.05"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" target="_top" xlink:title="pop the last node in the linked list.">
<polygon fill="white" stroke="#666666" points="320,-30.5 187.75,-30.5 187.75,0 320,0 320,-30.5"/>
<text text-anchor="start" x="195.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="253.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pop_back</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M118.14,-48.17C135.8,-43.85 157,-38.67 177.29,-33.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="178.1,-37.12 186.98,-31.35 176.43,-30.32 178.1,-37.12"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M320.1,-92.62C328.02,-91.57 336.16,-90.49 344.22,-89.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="344.58,-92.91 354.04,-88.13 343.66,-85.97 344.58,-92.91"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.3 KiB

7
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.map Normal file
View File

@@ -0,0 +1,7 @@
<map id="others::Cache::LRUCache::get" name="others::Cache::LRUCache::get">
<area shape="rect" id="Node000001" title="get the value of the key&#45;value pair if exists" alt="" coords="5,13,208,38"/>
<area shape="rect" id="Node000002" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" title="move the existing node in the list to the beginning of the list." alt="" coords="256,5,432,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="208,23,240,23,240,28,208,28"/>
<area shape="rect" id="Node000003" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" title="push the node to the front of the linked list." alt="" coords="480,5,656,46"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="432,23,464,23,464,28,432,28"/>
</map>

1
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
1fb368e2a63e8485f9982b788e14a41a

85
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.svg Normal file
View File

@@ -0,0 +1,85 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: others::Cache::LRUCache::get Pages: 1 -->
<svg width="496pt" height="39pt"
viewBox="0.00 0.00 496.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>others::Cache::LRUCache::get</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="get the value of the key&#45;value pair if exists">
<polygon fill="#999999" stroke="#666666" points="151.75,-24.88 0,-24.88 0,-5.63 151.75,-5.63 151.75,-24.88"/>
<text text-anchor="middle" x="75.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::get</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
<polygon fill="white" stroke="#666666" points="320,-30.5 187.75,-30.5 187.75,0 320,0 320,-30.5"/>
<text text-anchor="start" x="195.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="253.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M152.03,-15.25C159.93,-15.25 167.99,-15.25 175.92,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="175.9,-18.75 185.9,-15.25 175.9,-11.75 175.9,-18.75"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
<polygon fill="white" stroke="#666666" points="488.25,-30.5 356,-30.5 356,0 488.25,0 488.25,-30.5"/>
<text text-anchor="start" x="364" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="422.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M320.1,-15.25C328.02,-15.25 336.16,-15.25 344.22,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="344.02,-18.75 354.02,-15.25 344.02,-11.75 344.02,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.7 KiB

59
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph_org.svg Normal file
View File

@@ -0,0 +1,59 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: others::Cache::LRUCache::get Pages: 1 -->
<svg width="496pt" height="39pt"
viewBox="0.00 0.00 496.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>others::Cache::LRUCache::get</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="get the value of the key&#45;value pair if exists">
<polygon fill="#999999" stroke="#666666" points="151.75,-24.88 0,-24.88 0,-5.63 151.75,-5.63 151.75,-24.88"/>
<text text-anchor="middle" x="75.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::get</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
<polygon fill="white" stroke="#666666" points="320,-30.5 187.75,-30.5 187.75,0 320,0 320,-30.5"/>
<text text-anchor="start" x="195.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="253.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M152.03,-15.25C159.93,-15.25 167.99,-15.25 175.92,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="175.9,-18.75 185.9,-15.25 175.9,-11.75 175.9,-18.75"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
<polygon fill="white" stroke="#666666" points="488.25,-30.5 356,-30.5 356,0 488.25,0 488.25,-30.5"/>
<text text-anchor="start" x="364" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="422.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M320.1,-15.25C328.02,-15.25 336.16,-15.25 344.22,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="344.02,-18.75 354.02,-15.25 344.02,-11.75 344.02,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.0 KiB

5
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="others::Cache::LRUCache::make_recent" name="others::Cache::LRUCache::make_recent">
<area shape="rect" id="Node000001" title="move the existing node in the list to the beginning of the list." alt="" coords="5,5,182,46"/>
<area shape="rect" id="Node000002" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" title="push the node to the front of the linked list." alt="" coords="230,5,406,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="182,23,214,23,214,28,182,28"/>
</map>

1
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
c62f379001ef2b4ca1c6f7e1af924130

67
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.svg Normal file
View File

@@ -0,0 +1,67 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: others::Cache::LRUCache::make_recent Pages: 1 -->
<svg width="309pt" height="39pt"
viewBox="0.00 0.00 308.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>others::Cache::LRUCache::make_recent</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="move the existing node in the list to the beginning of the list.">
<polygon fill="#999999" stroke="#666666" points="132.25,-30.5 0,-30.5 0,0 132.25,0 132.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="66.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
<polygon fill="white" stroke="#666666" points="300.5,-30.5 168.25,-30.5 168.25,0 300.5,0 300.5,-30.5"/>
<text text-anchor="start" x="176.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="234.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M132.35,-15.25C140.27,-15.25 148.41,-15.25 156.47,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.27,-18.75 166.27,-15.25 156.27,-11.75 156.27,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.8 KiB

41
d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph_org.svg Normal file
View File

@@ -0,0 +1,41 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: others::Cache::LRUCache::make_recent Pages: 1 -->
<svg width="309pt" height="39pt"
viewBox="0.00 0.00 308.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>others::Cache::LRUCache::make_recent</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="move the existing node in the list to the beginning of the list.">
<polygon fill="#999999" stroke="#666666" points="132.25,-30.5 0,-30.5 0,0 132.25,0 132.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="66.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
<polygon fill="white" stroke="#666666" points="300.5,-30.5 168.25,-30.5 168.25,0 300.5,0 300.5,-30.5"/>
<text text-anchor="start" x="176.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="234.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M132.35,-15.25C140.27,-15.25 148.41,-15.25 156.47,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.27,-18.75 166.27,-15.25 156.27,-11.75 156.27,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.1 KiB

3
db/dde/namespaceothers_1_1_cache.html
View File

@@ -122,6 +122,9 @@ 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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">LFUCache</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html" title="LFUCache.">LFUCache</a>. <a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.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="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">LRUCache</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" title="LRUCache.">LRUCache</a>. <a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.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="typedef-members" name="typedef-members"></a>
Typedefs</h2></td></tr>

3
db/dde/namespaceothers_1_1_cache.js
View File

@@ -1,5 +1,6 @@
var namespaceothers_1_1_cache =
[
[ "D_Node", "de/d21/classothers_1_1_cache_1_1_d___node.html", "de/d21/classothers_1_1_cache_1_1_d___node" ],
[ "LFUCache", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache" ]
[ "LFUCache", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache" ],
[ "LRUCache", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache" ]
];

288
dc/daa/lru__cache2_8cpp.html Normal file
View File

@@ -0,0 +1,288 @@
<!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>Algorithms_in_C++: others/lru_cache2.cpp File 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", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/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="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</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(1); });
/* @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('dc/daa/lru__cache2_8cpp.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="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">lru_cache2.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Implementation for [LRU Cache] (<a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)">https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)</a>)
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cstdint&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;unordered_map&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for lru_cache2.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d89/lru__cache2_8cpp__incl.svg" width="390" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</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="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &gt;</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../db/d8b/struct_node.html">Node</a> for a doubly linked list with data, prev and next pointers. <a href="../../de/d21/classothers_1_1_cache_1_1_d___node.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="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt; K, V &gt;</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" title="LRUCache.">LRUCache</a>. <a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.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="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d6f/namespaceothers.html">others</a></td></tr>
<tr class="memdesc:d0/d6f/namespaceothers"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <code>vector</code> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dde/namespaceothers_1_1_cache.html">others::Cache</a></td></tr>
<tr class="memdesc:db/dde/namespaceothers_1_1_cache"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../db/dde/namespaceothers_1_1_cache.html" title="Cache algorithm.">Cache</a> algorithm. <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="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">self test implementations <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">main function <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation for [LRU Cache] (<a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)">https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)</a>) </p>
<p>LRU discards the least recently used value. Data structures used - doubly linked list and unordered_map</p>
<p>unordered_map maps the key to the address of the node of the linked list. If the element is accessed, the element is moved to the beginning of the linked list.</p>
<p>When the cache is full, the last element in the linked list is popped.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/deDSeC00720" target="_blank">Karan Sharma</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>main function </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 274</span> {</div>
<div class="line"><span class="lineno"> 275</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run the self test implementation</span></div>
<div class="line"><span class="lineno"> 276</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 277</span>}</div>
<div class="ttc" id="alru__cache2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">self test implementations</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:220</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="560"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
</div>
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </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">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>self test implementations </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 220</span> {</div>
<div class="line"><span class="lineno"> 221</span> <a class="code hl_class" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt;int, int&gt;</a> cache(5);</div>
<div class="line"><span class="lineno"> 222</span> </div>
<div class="line"><span class="lineno"> 223</span> <span class="comment">// test the initial state of the cache</span></div>
<div class="line"><span class="lineno"> 224</span> assert(cache.size() == 0);</div>
<div class="line"><span class="lineno"> 225</span> assert(cache.capacity() == 5);</div>
<div class="line"><span class="lineno"> 226</span> assert(cache.empty());</div>
<div class="line"><span class="lineno"> 227</span> </div>
<div class="line"><span class="lineno"> 228</span> <span class="comment">// test insertion in the cache</span></div>
<div class="line"><span class="lineno"> 229</span> cache.put(1, 10);</div>
<div class="line"><span class="lineno"> 230</span> cache.put(-2, 20);</div>
<div class="line"><span class="lineno"> 231</span> </div>
<div class="line"><span class="lineno"> 232</span> <span class="comment">// test the state of cache after inserting some items</span></div>
<div class="line"><span class="lineno"> 233</span> assert(cache.size() == 2);</div>
<div class="line"><span class="lineno"> 234</span> assert(cache.capacity() == 5);</div>
<div class="line"><span class="lineno"> 235</span> assert(!cache.empty());</div>
<div class="line"><span class="lineno"> 236</span> </div>
<div class="line"><span class="lineno"> 237</span> <span class="comment">// test getting items from the cache</span></div>
<div class="line"><span class="lineno"> 238</span> assert(cache.get(1) == 10);</div>
<div class="line"><span class="lineno"> 239</span> assert(cache.get(-2) == 20);</div>
<div class="line"><span class="lineno"> 240</span> </div>
<div class="line"><span class="lineno"> 241</span> cache.put(-3, -30);</div>
<div class="line"><span class="lineno"> 242</span> cache.put(4, 40);</div>
<div class="line"><span class="lineno"> 243</span> cache.put(5, -50);</div>
<div class="line"><span class="lineno"> 244</span> cache.put(6, 60);</div>
<div class="line"><span class="lineno"> 245</span> </div>
<div class="line"><span class="lineno"> 246</span> <span class="comment">// test the state after inserting more items than the capacity</span></div>
<div class="line"><span class="lineno"> 247</span> assert(cache.size() == 5);</div>
<div class="line"><span class="lineno"> 248</span> assert(cache.capacity() == 5);</div>
<div class="line"><span class="lineno"> 249</span> assert(!cache.empty());</div>
<div class="line"><span class="lineno"> 250</span> </div>
<div class="line"><span class="lineno"> 251</span> <span class="comment">// fetching 1 throws runtime_error</span></div>
<div class="line"><span class="lineno"> 252</span> <span class="comment">// as 1 was evicted being the least recently used</span></div>
<div class="line"><span class="lineno"> 253</span> <span class="comment">// when 6 was added</span></div>
<div class="line"><span class="lineno"> 254</span> <span class="keywordflow">try</span> {</div>
<div class="line"><span class="lineno"> 255</span> cache.get(1);</div>
<div class="line"><span class="lineno"> 256</span> } <span class="keywordflow">catch</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a> &amp;e) {</div>
<div class="line"><span class="lineno"> 257</span> assert(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(e.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/exception/what.html">what</a>()) == <span class="stringliteral">&quot;key is not present in the cache&quot;</span>);</div>
<div class="line"><span class="lineno"> 258</span> }</div>
<div class="line"><span class="lineno"> 259</span> </div>
<div class="line"><span class="lineno"> 260</span> <span class="comment">// test retrieval of all items in the cache</span></div>
<div class="line"><span class="lineno"> 261</span> assert(cache.get(-2) == 20);</div>
<div class="line"><span class="lineno"> 262</span> assert(cache.get(-3) == -30);</div>
<div class="line"><span class="lineno"> 263</span> assert(cache.get(4) == 40);</div>
<div class="line"><span class="lineno"> 264</span> assert(cache.get(5) == -50);</div>
<div class="line"><span class="lineno"> 265</span> assert(cache.get(6) == 60);</div>
<div class="line"><span class="lineno"> 266</span> </div>
<div class="line"><span class="lineno"> 267</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test - passed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 268</span>}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a></div><div class="ttdoc">LRUCache.</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:61</div></div>
<div class="ttc" id="aruntime_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a></div></div>
<div class="ttc" id="awhat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/exception/what.html">std::runtime_error::what</a></div><div class="ttdeci">T what(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="560"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
</div>
</div>
</div>
</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="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../dc/daa/lru__cache2_8cpp.html">lru_cache2.cpp</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>

7
dc/daa/lru__cache2_8cpp.js Normal file
View File

@@ -0,0 +1,7 @@
var lru__cache2_8cpp =
[
[ "others::Cache::D_Node< T >", "de/d21/classothers_1_1_cache_1_1_d___node.html", "de/d21/classothers_1_1_cache_1_1_d___node" ],
[ "others::Cache::LRUCache< K, V >", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache" ],
[ "main", "dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "test", "dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
];

23
dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map Normal file
View File

@@ -0,0 +1,23 @@
<map id="test" name="test">
<area shape="rect" id="Node000001" title="self test implementations" alt="" coords="5,161,49,186"/>
<area shape="rect" id="Node000002" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a" title="Returns the total capacity of the cache." alt="" coords="110,5,286,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="30,159,53,110,71,81,95,57,102,52,105,56,98,61,76,85,57,112,35,161"/>
<area shape="rect" id="Node000003" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e" title="returns whether the cache is empty or not" alt="" coords="110,71,286,111"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="41,158,66,139,95,121,107,115,109,120,98,125,69,144,45,163"/>
<area shape="rect" id="Node000004" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea" title="get the value of the key&#45;value pair if exists" alt="" coords="97,136,299,161"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,168,92,161,93,167,50,173"/>
<area shape="rect" id="Node000007" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45" title="upsert a key&#45;value pair" alt="" coords="97,185,299,210"/>
<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="50,174,88,179,87,185,49,179"/>
<area shape="rect" id="Node000009" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1" title="Returns the number of items present in the cache." alt="" coords="110,235,286,275"/>
<area shape="poly" id="edge10_Node000001_Node000009" title=" " alt="" coords="45,185,69,203,98,221,110,226,107,231,95,225,66,208,42,189"/>
<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="136,300,260,341"/>
<area shape="poly" id="edge11_Node000001_Node000010" title=" " alt="" coords="35,186,58,234,76,261,98,285,124,300,121,305,95,289,71,265,53,237,30,188"/>
<area shape="rect" id="Node000005" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" title="move the existing node in the list to the beginning of the list." alt="" coords="347,124,523,165"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="299,144,331,143,331,149,299,149"/>
<area shape="rect" id="Node000006" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" title="push the node to the front of the linked list." alt="" coords="571,153,748,194"/>
<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="524,153,556,157,555,163,523,158"/>
<area shape="poly" id="edge7_Node000007_Node000005" title=" " alt="" coords="258,182,331,165,333,170,259,187"/>
<area shape="poly" id="edge9_Node000007_Node000006" title=" " alt="" coords="299,190,556,176,556,182,299,195"/>
<area shape="rect" id="Node000008" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" title="pop the last node in the linked list." alt="" coords="347,239,523,279"/>
<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="253,209,300,220,342,232,341,237,298,226,252,214"/>
</map>

1
dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
97c1ae9df20c10d14b9ce242561c8cd9

291
dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg Normal file
View File

@@ -0,0 +1,291 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test Pages: 1 -->
<!--zoomable 260 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<defs>
<circle id="rim" cx="0" cy="0" r="7"/>
<circle id="rim2" cx="0" cy="0" r="3.5"/>
<g id="zoomPlus">
<use xlink:href="#rim" fill="#404040"><set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/></use>
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="zoomMin">
<use xlink:href="#rim" fill="#404040"><set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/></use>
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="arrowUp" transform="translate(30 24)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowRight" transform="rotate(90) translate(36 -43)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowDown" transform="rotate(180) translate(-30 -48)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowLeft" transform="rotate(270) translate(-36 17)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="resetDef">
<use xlink:href="#rim2" fill="#404040"><set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/></use>
</g>
</defs>
<script type="application/ecmascript">
var viewWidth = 565;
var viewHeight = 260;
var sectionId = 'dynsection-2';
</script>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="self test implementations">
<polygon fill="#999999" stroke="#666666" points="32.5,-134.88 0,-134.88 0,-115.62 32.5,-115.62 32.5,-134.88"/>
<text text-anchor="middle" x="16.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a" target="_top" xlink:title="Returns the total capacity of the cache.">
<polygon fill="white" stroke="#666666" points="210.5,-251.5 78.25,-251.5 78.25,-221 210.5,-221 210.5,-251.5"/>
<text text-anchor="start" x="86.25" y="-238" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="144.38" y="-226.75" font-family="Helvetica,sans-Serif" font-size="10.00">::capacity</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M20.58,-135.32C27.01,-153.2 42.78,-190.54 68.5,-211.25 70.18,-212.6 71.94,-213.89 73.76,-215.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="71.57,-217.87 81.97,-219.86 75.07,-211.82 71.57,-217.87"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e" target="_top" xlink:title="returns whether the cache is empty or not">
<polygon fill="white" stroke="#666666" points="210.5,-202.5 78.25,-202.5 78.25,-172 210.5,-172 210.5,-202.5"/>
<text text-anchor="start" x="86.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="144.38" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M28.34,-135.16C38.26,-143.61 53.52,-155.56 68.5,-163.25 71.2,-164.63 73.99,-165.96 76.84,-167.22"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.37,-170.4 85.95,-170.97 78.03,-163.93 75.37,-170.4"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
<polygon fill="white" stroke="#666666" points="220.25,-153.88 68.5,-153.88 68.5,-134.62 220.25,-134.62 220.25,-153.88"/>
<text text-anchor="middle" x="144.38" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::get</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.97,-127.62C41.56,-128.91 52.92,-130.62 65.09,-132.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="64.52,-135.91 74.93,-133.94 65.56,-128.99 64.52,-135.91"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45" target="_top" xlink:title="upsert a key&#45;value pair">
<polygon fill="white" stroke="#666666" points="220.25,-116.88 68.5,-116.88 68.5,-97.62 220.25,-97.62 220.25,-116.88"/>
<text text-anchor="middle" x="144.38" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::put</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.97,-123.01C40.74,-121.9 50.78,-120.46 61.63,-118.92"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.8,-122.43 71.2,-117.55 60.81,-115.5 61.8,-122.43"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1" target="_top" xlink:title="Returns the number of items present in the cache.">
<polygon fill="white" stroke="#666666" points="210.5,-79.5 78.25,-79.5 78.25,-49 210.5,-49 210.5,-79.5"/>
<text text-anchor="start" x="86.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="144.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node9 -->
<g id="edge10_Node000001_Node000009" class="edge">
<title>Node1&#45;&gt;Node9</title>
<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M28.78,-115.29C38.74,-107.1 53.81,-95.67 68.5,-88.25 71.36,-86.81 74.32,-85.43 77.34,-84.11"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="78.43,-87.45 86.38,-80.45 75.8,-80.96 78.43,-87.45"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="190.62,-30.5 98.12,-30.5 98.12,0 190.62,0 190.62,-30.5"/>
<text text-anchor="start" x="106.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::runtime_error</text>
<text text-anchor="middle" x="144.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node10 -->
<g id="edge11_Node000001_Node000010" class="edge">
<title>Node1&#45;&gt;Node10</title>
<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M20.62,-115.29C27.09,-97.62 42.94,-60.72 68.5,-40.25 74.25,-35.65 80.89,-31.87 87.78,-28.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.59,-32.23 96.59,-25.29 86.01,-25.72 88.59,-32.23"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
<polygon fill="white" stroke="#666666" points="388.5,-162.5 256.25,-162.5 256.25,-132 388.5,-132 388.5,-162.5"/>
<text text-anchor="start" x="264.25" y="-149" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="322.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M220.53,-145.53C228.43,-145.67 236.49,-145.8 244.42,-145.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="244.34,-149.44 254.4,-146.11 244.46,-142.44 244.34,-149.44"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
<polygon fill="white" stroke="#666666" points="556.75,-140.5 424.5,-140.5 424.5,-110 556.75,-110 556.75,-140.5"/>
<text text-anchor="start" x="432.5" y="-127" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="490.62" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5_Node000005_Node000006" class="edge">
<title>Node5&#45;&gt;Node6</title>
<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M388.6,-138.62C396.52,-137.57 404.66,-136.49 412.72,-135.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="413.08,-138.91 422.54,-134.13 412.16,-131.97 413.08,-138.91"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge7_Node000007_Node000005" class="edge">
<title>Node7&#45;&gt;Node5</title>
<g id="a_edge7_Node000007_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M189.79,-117.34C206.56,-121.16 226.15,-125.61 245.02,-129.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="244.02,-133.26 254.54,-132.06 245.57,-126.43 244.02,-133.26"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node6 -->
<g id="edge9_Node000007_Node000006" class="edge">
<title>Node7&#45;&gt;Node6</title>
<g id="a_edge9_Node000007_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M220.5,-111.18C277.53,-114.16 355.66,-118.25 413.05,-121.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="412.55,-124.72 422.72,-121.75 412.92,-117.73 412.55,-124.72"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" target="_top" xlink:title="pop the last node in the linked list.">
<polygon fill="white" stroke="#666666" points="388.5,-76.5 256.25,-76.5 256.25,-46 388.5,-46 388.5,-76.5"/>
<text text-anchor="start" x="264.25" y="-63" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="322.38" y="-51.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pop_back</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge8_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M185.42,-97.19C196.69,-94.33 208.96,-91.19 220.25,-88.25 230.56,-85.57 241.45,-82.69 252.12,-79.86"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="252.89,-83.28 261.66,-77.33 251.09,-76.51 252.89,-83.28"/>
</a>
</g>
</g>
</g>
</svg>
<g id="navigator" transform="translate(0 0)" fill="#404254">
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
<use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
<use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
<use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
<use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
</g>
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
<g id="arrow_out" transform="scale(0.3 0.3)">
<a xlink:href="lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg" target="_base">
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
<path id="arrow"
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
style="fill:#404040;"/>
</a>
</g>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 14 KiB

208
dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg Normal file
View File

@@ -0,0 +1,208 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test Pages: 1 -->
<svg width="565pt" height="260pt"
viewBox="0.00 0.00 564.75 259.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 255.5)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="self test implementations">
<polygon fill="#999999" stroke="#666666" points="32.5,-134.88 0,-134.88 0,-115.62 32.5,-115.62 32.5,-134.88"/>
<text text-anchor="middle" x="16.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a" target="_top" xlink:title="Returns the total capacity of the cache.">
<polygon fill="white" stroke="#666666" points="210.5,-251.5 78.25,-251.5 78.25,-221 210.5,-221 210.5,-251.5"/>
<text text-anchor="start" x="86.25" y="-238" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="144.38" y="-226.75" font-family="Helvetica,sans-Serif" font-size="10.00">::capacity</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M20.58,-135.32C27.01,-153.2 42.78,-190.54 68.5,-211.25 70.18,-212.6 71.94,-213.89 73.76,-215.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="71.57,-217.87 81.97,-219.86 75.07,-211.82 71.57,-217.87"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e" target="_top" xlink:title="returns whether the cache is empty or not">
<polygon fill="white" stroke="#666666" points="210.5,-202.5 78.25,-202.5 78.25,-172 210.5,-172 210.5,-202.5"/>
<text text-anchor="start" x="86.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="144.38" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M28.34,-135.16C38.26,-143.61 53.52,-155.56 68.5,-163.25 71.2,-164.63 73.99,-165.96 76.84,-167.22"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.37,-170.4 85.95,-170.97 78.03,-163.93 75.37,-170.4"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
<polygon fill="white" stroke="#666666" points="220.25,-153.88 68.5,-153.88 68.5,-134.62 220.25,-134.62 220.25,-153.88"/>
<text text-anchor="middle" x="144.38" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::get</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.97,-127.62C41.56,-128.91 52.92,-130.62 65.09,-132.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="64.52,-135.91 74.93,-133.94 65.56,-128.99 64.52,-135.91"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45" target="_top" xlink:title="upsert a key&#45;value pair">
<polygon fill="white" stroke="#666666" points="220.25,-116.88 68.5,-116.88 68.5,-97.62 220.25,-97.62 220.25,-116.88"/>
<text text-anchor="middle" x="144.38" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::put</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.97,-123.01C40.74,-121.9 50.78,-120.46 61.63,-118.92"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.8,-122.43 71.2,-117.55 60.81,-115.5 61.8,-122.43"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1" target="_top" xlink:title="Returns the number of items present in the cache.">
<polygon fill="white" stroke="#666666" points="210.5,-79.5 78.25,-79.5 78.25,-49 210.5,-49 210.5,-79.5"/>
<text text-anchor="start" x="86.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="144.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node9 -->
<g id="edge10_Node000001_Node000009" class="edge">
<title>Node1&#45;&gt;Node9</title>
<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M28.78,-115.29C38.74,-107.1 53.81,-95.67 68.5,-88.25 71.36,-86.81 74.32,-85.43 77.34,-84.11"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="78.43,-87.45 86.38,-80.45 75.8,-80.96 78.43,-87.45"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="190.62,-30.5 98.12,-30.5 98.12,0 190.62,0 190.62,-30.5"/>
<text text-anchor="start" x="106.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::runtime_error</text>
<text text-anchor="middle" x="144.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node10 -->
<g id="edge11_Node000001_Node000010" class="edge">
<title>Node1&#45;&gt;Node10</title>
<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M20.62,-115.29C27.09,-97.62 42.94,-60.72 68.5,-40.25 74.25,-35.65 80.89,-31.87 87.78,-28.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.59,-32.23 96.59,-25.29 86.01,-25.72 88.59,-32.23"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
<polygon fill="white" stroke="#666666" points="388.5,-162.5 256.25,-162.5 256.25,-132 388.5,-132 388.5,-162.5"/>
<text text-anchor="start" x="264.25" y="-149" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="322.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M220.53,-145.53C228.43,-145.67 236.49,-145.8 244.42,-145.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="244.34,-149.44 254.4,-146.11 244.46,-142.44 244.34,-149.44"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
<polygon fill="white" stroke="#666666" points="556.75,-140.5 424.5,-140.5 424.5,-110 556.75,-110 556.75,-140.5"/>
<text text-anchor="start" x="432.5" y="-127" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="490.62" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5_Node000005_Node000006" class="edge">
<title>Node5&#45;&gt;Node6</title>
<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M388.6,-138.62C396.52,-137.57 404.66,-136.49 412.72,-135.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="413.08,-138.91 422.54,-134.13 412.16,-131.97 413.08,-138.91"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge7_Node000007_Node000005" class="edge">
<title>Node7&#45;&gt;Node5</title>
<g id="a_edge7_Node000007_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M189.79,-117.34C206.56,-121.16 226.15,-125.61 245.02,-129.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="244.02,-133.26 254.54,-132.06 245.57,-126.43 244.02,-133.26"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node6 -->
<g id="edge9_Node000007_Node000006" class="edge">
<title>Node7&#45;&gt;Node6</title>
<g id="a_edge9_Node000007_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M220.5,-111.18C277.53,-114.16 355.66,-118.25 413.05,-121.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="412.55,-124.72 422.72,-121.75 412.92,-117.73 412.55,-124.72"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" target="_top" xlink:title="pop the last node in the linked list.">
<polygon fill="white" stroke="#666666" points="388.5,-76.5 256.25,-76.5 256.25,-46 388.5,-46 388.5,-76.5"/>
<text text-anchor="start" x="264.25" y="-63" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="322.38" y="-51.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pop_back</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge8_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M185.42,-97.19C196.69,-94.33 208.96,-91.19 220.25,-88.25 230.56,-85.57 241.45,-82.69 252.12,-79.86"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="252.89,-83.28 261.66,-77.33 251.09,-76.51 252.89,-83.28"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 11 KiB

25
dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@@ -0,0 +1,25 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="main function" alt="" coords="5,161,55,186"/>
<area shape="rect" id="Node000002" href="$dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="self test implementations" alt="" coords="103,161,146,186"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,171,87,171,87,176,55,176"/>
<area shape="rect" id="Node000003" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a" title="Returns the total capacity of the cache." alt="" coords="207,5,383,46"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="128,159,150,110,169,81,192,57,199,52,203,56,196,61,173,85,155,112,133,161"/>
<area shape="rect" id="Node000004" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e" title="returns whether the cache is empty or not" alt="" coords="207,71,383,111"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="139,158,163,139,193,121,204,115,206,120,195,125,166,144,142,163"/>
<area shape="rect" id="Node000005" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea" title="get the value of the key&#45;value pair if exists" alt="" coords="194,136,396,161"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="146,168,189,161,190,167,147,173"/>
<area shape="rect" id="Node000008" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45" title="upsert a key&#45;value pair" alt="" coords="194,185,396,210"/>
<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="147,174,185,179,184,185,146,179"/>
<area shape="rect" id="Node000010" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1" title="Returns the number of items present in the cache." alt="" coords="207,235,383,275"/>
<area shape="poly" id="edge11_Node000002_Node000010" title=" " alt="" coords="143,185,167,203,195,221,207,226,205,231,193,225,164,208,139,189"/>
<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="234,300,357,341"/>
<area shape="poly" id="edge12_Node000002_Node000011" title=" " alt="" coords="133,186,155,234,173,261,196,285,221,300,218,305,192,289,169,265,150,237,128,188"/>
<area shape="rect" id="Node000006" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" title="move the existing node in the list to the beginning of the list." alt="" coords="444,124,621,165"/>
<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="397,144,429,143,429,149,397,149"/>
<area shape="rect" id="Node000007" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" title="push the node to the front of the linked list." alt="" coords="669,153,845,194"/>
<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="621,153,653,157,653,163,620,158"/>
<area shape="poly" id="edge8_Node000008_Node000006" title=" " alt="" coords="355,182,429,165,430,170,356,187"/>
<area shape="poly" id="edge10_Node000008_Node000007" title=" " alt="" coords="397,190,653,176,654,182,397,195"/>
<area shape="rect" id="Node000009" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" title="pop the last node in the linked list." alt="" coords="444,239,621,279"/>
<area shape="poly" id="edge9_Node000008_Node000009" title=" " alt="" coords="351,209,397,220,440,232,438,237,396,226,349,214"/>
</map>

1
dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
70630744275453827fd653376a53c592

309
dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@@ -0,0 +1,309 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<!--zoomable 260 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<defs>
<circle id="rim" cx="0" cy="0" r="7"/>
<circle id="rim2" cx="0" cy="0" r="3.5"/>
<g id="zoomPlus">
<use xlink:href="#rim" fill="#404040"><set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/></use>
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="zoomMin">
<use xlink:href="#rim" fill="#404040"><set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/></use>
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="arrowUp" transform="translate(30 24)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowRight" transform="rotate(90) translate(36 -43)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowDown" transform="rotate(180) translate(-30 -48)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowLeft" transform="rotate(270) translate(-36 17)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="resetDef">
<use xlink:href="#rim2" fill="#404040"><set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/></use>
</g>
</defs>
<script type="application/ecmascript">
var viewWidth = 638;
var viewHeight = 260;
var sectionId = 'dynsection-1';
</script>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="main function">
<polygon fill="#999999" stroke="#666666" points="37,-134.88 0,-134.88 0,-115.62 37,-115.62 37,-134.88"/>
<text text-anchor="middle" x="18.5" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="self test implementations">
<polygon fill="white" stroke="#666666" points="105.5,-134.88 73,-134.88 73,-115.62 105.5,-115.62 105.5,-134.88"/>
<text text-anchor="middle" x="89.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.2,-125.25C44.58,-125.25 53.31,-125.25 61.45,-125.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-128.75 71.2,-125.25 61.2,-121.75 61.2,-128.75"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a" target="_top" xlink:title="Returns the total capacity of the cache.">
<polygon fill="white" stroke="#666666" points="283.5,-251.5 151.25,-251.5 151.25,-221 283.5,-221 283.5,-251.5"/>
<text text-anchor="start" x="159.25" y="-238" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="217.38" y="-226.75" font-family="Helvetica,sans-Serif" font-size="10.00">::capacity</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M93.58,-135.32C100.01,-153.2 115.78,-190.54 141.5,-211.25 143.18,-212.6 144.94,-213.89 146.76,-215.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.57,-217.87 154.97,-219.86 148.07,-211.82 144.57,-217.87"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e" target="_top" xlink:title="returns whether the cache is empty or not">
<polygon fill="white" stroke="#666666" points="283.5,-202.5 151.25,-202.5 151.25,-172 283.5,-172 283.5,-202.5"/>
<text text-anchor="start" x="159.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="217.38" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M101.34,-135.16C111.26,-143.61 126.52,-155.56 141.5,-163.25 144.2,-164.63 146.99,-165.96 149.84,-167.22"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.37,-170.4 158.95,-170.97 151.03,-163.93 148.37,-170.4"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
<polygon fill="white" stroke="#666666" points="293.25,-153.88 141.5,-153.88 141.5,-134.62 293.25,-134.62 293.25,-153.88"/>
<text text-anchor="middle" x="217.38" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::get</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.97,-127.62C114.56,-128.91 125.92,-130.62 138.09,-132.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="137.52,-135.91 147.93,-133.94 138.56,-128.99 137.52,-135.91"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45" target="_top" xlink:title="upsert a key&#45;value pair">
<polygon fill="white" stroke="#666666" points="293.25,-116.88 141.5,-116.88 141.5,-97.62 293.25,-97.62 293.25,-116.88"/>
<text text-anchor="middle" x="217.38" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::put</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge7_Node000002_Node000008" class="edge">
<title>Node2&#45;&gt;Node8</title>
<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.97,-123.01C113.74,-121.9 123.78,-120.46 134.63,-118.92"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.8,-122.43 144.2,-117.55 133.81,-115.5 134.8,-122.43"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1" target="_top" xlink:title="Returns the number of items present in the cache.">
<polygon fill="white" stroke="#666666" points="283.5,-79.5 151.25,-79.5 151.25,-49 283.5,-49 283.5,-79.5"/>
<text text-anchor="start" x="159.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="217.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node10 -->
<g id="edge11_Node000002_Node000010" class="edge">
<title>Node2&#45;&gt;Node10</title>
<g id="a_edge11_Node000002_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M101.78,-115.29C111.74,-107.1 126.81,-95.67 141.5,-88.25 144.36,-86.81 147.32,-85.43 150.34,-84.11"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.43,-87.45 159.38,-80.45 148.8,-80.96 151.43,-87.45"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="263.62,-30.5 171.12,-30.5 171.12,0 263.62,0 263.62,-30.5"/>
<text text-anchor="start" x="179.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::runtime_error</text>
<text text-anchor="middle" x="217.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node11 -->
<g id="edge12_Node000002_Node000011" class="edge">
<title>Node2&#45;&gt;Node11</title>
<g id="a_edge12_Node000002_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M93.62,-115.29C100.09,-97.62 115.94,-60.72 141.5,-40.25 147.25,-35.65 153.89,-31.87 160.78,-28.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="161.59,-32.23 169.59,-25.29 159.01,-25.72 161.59,-32.23"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
<polygon fill="white" stroke="#666666" points="461.5,-162.5 329.25,-162.5 329.25,-132 461.5,-132 461.5,-162.5"/>
<text text-anchor="start" x="337.25" y="-149" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="395.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5_Node000005_Node000006" class="edge">
<title>Node5&#45;&gt;Node6</title>
<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M293.53,-145.53C301.43,-145.67 309.49,-145.8 317.42,-145.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="317.34,-149.44 327.4,-146.11 317.46,-142.44 317.34,-149.44"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
<polygon fill="white" stroke="#666666" points="629.75,-140.5 497.5,-140.5 497.5,-110 629.75,-110 629.75,-140.5"/>
<text text-anchor="start" x="505.5" y="-127" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="563.62" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge6_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M461.6,-138.62C469.52,-137.57 477.66,-136.49 485.72,-135.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="486.08,-138.91 495.54,-134.13 485.16,-131.97 486.08,-138.91"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node6 -->
<g id="edge8_Node000008_Node000006" class="edge">
<title>Node8&#45;&gt;Node6</title>
<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M262.79,-117.34C279.56,-121.16 299.15,-125.61 318.02,-129.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="317.02,-133.26 327.54,-132.06 318.57,-126.43 317.02,-133.26"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node7 -->
<g id="edge10_Node000008_Node000007" class="edge">
<title>Node8&#45;&gt;Node7</title>
<g id="a_edge10_Node000008_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M293.5,-111.18C350.53,-114.16 428.66,-118.25 486.05,-121.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="485.55,-124.72 495.72,-121.75 485.92,-117.73 485.55,-124.72"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" target="_top" xlink:title="pop the last node in the linked list.">
<polygon fill="white" stroke="#666666" points="461.5,-76.5 329.25,-76.5 329.25,-46 461.5,-46 461.5,-76.5"/>
<text text-anchor="start" x="337.25" y="-63" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="395.38" y="-51.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pop_back</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge9_Node000008_Node000009" class="edge">
<title>Node8&#45;&gt;Node9</title>
<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M258.42,-97.19C269.69,-94.33 281.96,-91.19 293.25,-88.25 303.56,-85.57 314.45,-82.69 325.12,-79.86"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="325.89,-83.28 334.66,-77.33 324.09,-76.51 325.89,-83.28"/>
</a>
</g>
</g>
</g>
</svg>
<g id="navigator" transform="translate(0 0)" fill="#404254">
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
<use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
<use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
<use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
<use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
</g>
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
<g id="arrow_out" transform="scale(0.3 0.3)">
<a xlink:href="lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg" target="_base">
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
<path id="arrow"
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
style="fill:#404040;"/>
</a>
</g>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 15 KiB

226
dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg Normal file
View File

@@ -0,0 +1,226 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<svg width="638pt" height="260pt"
viewBox="0.00 0.00 637.75 259.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 255.5)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="main function">
<polygon fill="#999999" stroke="#666666" points="37,-134.88 0,-134.88 0,-115.62 37,-115.62 37,-134.88"/>
<text text-anchor="middle" x="18.5" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="self test implementations">
<polygon fill="white" stroke="#666666" points="105.5,-134.88 73,-134.88 73,-115.62 105.5,-115.62 105.5,-134.88"/>
<text text-anchor="middle" x="89.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.2,-125.25C44.58,-125.25 53.31,-125.25 61.45,-125.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-128.75 71.2,-125.25 61.2,-121.75 61.2,-128.75"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a" target="_top" xlink:title="Returns the total capacity of the cache.">
<polygon fill="white" stroke="#666666" points="283.5,-251.5 151.25,-251.5 151.25,-221 283.5,-221 283.5,-251.5"/>
<text text-anchor="start" x="159.25" y="-238" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="217.38" y="-226.75" font-family="Helvetica,sans-Serif" font-size="10.00">::capacity</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M93.58,-135.32C100.01,-153.2 115.78,-190.54 141.5,-211.25 143.18,-212.6 144.94,-213.89 146.76,-215.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.57,-217.87 154.97,-219.86 148.07,-211.82 144.57,-217.87"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e" target="_top" xlink:title="returns whether the cache is empty or not">
<polygon fill="white" stroke="#666666" points="283.5,-202.5 151.25,-202.5 151.25,-172 283.5,-172 283.5,-202.5"/>
<text text-anchor="start" x="159.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="217.38" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M101.34,-135.16C111.26,-143.61 126.52,-155.56 141.5,-163.25 144.2,-164.63 146.99,-165.96 149.84,-167.22"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.37,-170.4 158.95,-170.97 151.03,-163.93 148.37,-170.4"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
<polygon fill="white" stroke="#666666" points="293.25,-153.88 141.5,-153.88 141.5,-134.62 293.25,-134.62 293.25,-153.88"/>
<text text-anchor="middle" x="217.38" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::get</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.97,-127.62C114.56,-128.91 125.92,-130.62 138.09,-132.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="137.52,-135.91 147.93,-133.94 138.56,-128.99 137.52,-135.91"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45" target="_top" xlink:title="upsert a key&#45;value pair">
<polygon fill="white" stroke="#666666" points="293.25,-116.88 141.5,-116.88 141.5,-97.62 293.25,-97.62 293.25,-116.88"/>
<text text-anchor="middle" x="217.38" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::put</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge7_Node000002_Node000008" class="edge">
<title>Node2&#45;&gt;Node8</title>
<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.97,-123.01C113.74,-121.9 123.78,-120.46 134.63,-118.92"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.8,-122.43 144.2,-117.55 133.81,-115.5 134.8,-122.43"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1" target="_top" xlink:title="Returns the number of items present in the cache.">
<polygon fill="white" stroke="#666666" points="283.5,-79.5 151.25,-79.5 151.25,-49 283.5,-49 283.5,-79.5"/>
<text text-anchor="start" x="159.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="217.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node10 -->
<g id="edge11_Node000002_Node000010" class="edge">
<title>Node2&#45;&gt;Node10</title>
<g id="a_edge11_Node000002_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M101.78,-115.29C111.74,-107.1 126.81,-95.67 141.5,-88.25 144.36,-86.81 147.32,-85.43 150.34,-84.11"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.43,-87.45 159.38,-80.45 148.8,-80.96 151.43,-87.45"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="263.62,-30.5 171.12,-30.5 171.12,0 263.62,0 263.62,-30.5"/>
<text text-anchor="start" x="179.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::runtime_error</text>
<text text-anchor="middle" x="217.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node11 -->
<g id="edge12_Node000002_Node000011" class="edge">
<title>Node2&#45;&gt;Node11</title>
<g id="a_edge12_Node000002_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M93.62,-115.29C100.09,-97.62 115.94,-60.72 141.5,-40.25 147.25,-35.65 153.89,-31.87 160.78,-28.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="161.59,-32.23 169.59,-25.29 159.01,-25.72 161.59,-32.23"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
<polygon fill="white" stroke="#666666" points="461.5,-162.5 329.25,-162.5 329.25,-132 461.5,-132 461.5,-162.5"/>
<text text-anchor="start" x="337.25" y="-149" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="395.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5_Node000005_Node000006" class="edge">
<title>Node5&#45;&gt;Node6</title>
<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M293.53,-145.53C301.43,-145.67 309.49,-145.8 317.42,-145.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="317.34,-149.44 327.4,-146.11 317.46,-142.44 317.34,-149.44"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
<polygon fill="white" stroke="#666666" points="629.75,-140.5 497.5,-140.5 497.5,-110 629.75,-110 629.75,-140.5"/>
<text text-anchor="start" x="505.5" y="-127" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="563.62" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge6_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M461.6,-138.62C469.52,-137.57 477.66,-136.49 485.72,-135.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="486.08,-138.91 495.54,-134.13 485.16,-131.97 486.08,-138.91"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node6 -->
<g id="edge8_Node000008_Node000006" class="edge">
<title>Node8&#45;&gt;Node6</title>
<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M262.79,-117.34C279.56,-121.16 299.15,-125.61 318.02,-129.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="317.02,-133.26 327.54,-132.06 318.57,-126.43 317.02,-133.26"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node7 -->
<g id="edge10_Node000008_Node000007" class="edge">
<title>Node8&#45;&gt;Node7</title>
<g id="a_edge10_Node000008_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M293.5,-111.18C350.53,-114.16 428.66,-118.25 486.05,-121.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="485.55,-124.72 495.72,-121.75 485.92,-117.73 485.55,-124.72"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" target="_top" xlink:title="pop the last node in the linked list.">
<polygon fill="white" stroke="#666666" points="461.5,-76.5 329.25,-76.5 329.25,-46 461.5,-46 461.5,-76.5"/>
<text text-anchor="start" x="337.25" y="-63" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
<text text-anchor="middle" x="395.38" y="-51.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pop_back</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge9_Node000008_Node000009" class="edge">
<title>Node8&#45;&gt;Node9</title>
<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M258.42,-97.19C269.69,-94.33 281.96,-91.19 293.25,-88.25 303.56,-85.57 314.45,-82.69 325.12,-79.86"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="325.89,-83.28 334.66,-77.33 324.09,-76.51 325.89,-83.28"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 12 KiB

53
de/d21/classothers_1_1_cache_1_1_d___node.html
View File

@@ -124,6 +124,8 @@ Collaboration diagram for others::Cache::D_Node&lt; T &gt;:</div>
Public Member Functions</h2></td></tr>
<tr class="memitem:adf7731f7bbf68c38e7188d7fd773e83f" id="r_adf7731f7bbf68c38e7188d7fd773e83f"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adf7731f7bbf68c38e7188d7fd773e83f">D_Node</a> (T <a class="el" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>)</td></tr>
<tr class="separator:adf7731f7bbf68c38e7188d7fd773e83f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adf7731f7bbf68c38e7188d7fd773e83f" id="r_adf7731f7bbf68c38e7188d7fd773e83f"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adf7731f7bbf68c38e7188d7fd773e83f">D_Node</a> (T <a class="el" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>)</td></tr>
<tr class="separator:adf7731f7bbf68c38e7188d7fd773e83f"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Public Attributes</h2></td></tr>
@@ -131,14 +133,14 @@ Public Attributes</h2></td></tr>
T&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
<tr class="memdesc:a8902e7ff872fa3c80fe6ce5f5cf5cc75"><td class="mdescLeft">&#160;</td><td class="mdescRight">data of the node <br /></td></tr>
<tr class="separator:a8902e7ff872fa3c80fe6ce5f5cf5cc75"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1c5295011209f1241fa0aac827129414" id="r_a1c5295011209f1241fa0aac827129414"><td class="memItemLeft" align="right" valign="top"><a id="a1c5295011209f1241fa0aac827129414" name="a1c5295011209f1241fa0aac827129414"></a>
<tr class="memitem:a19e954cbb710ea8318bcb6aaef78e2d5" id="r_a19e954cbb710ea8318bcb6aaef78e2d5"><td class="memItemLeft" align="right" valign="top"><a id="a19e954cbb710ea8318bcb6aaef78e2d5" name="a19e954cbb710ea8318bcb6aaef78e2d5"></a>
<a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt; T &gt; *&#160;</td><td class="memItemRight" valign="bottom"><b>prev</b></td></tr>
<tr class="memdesc:a1c5295011209f1241fa0aac827129414"><td class="mdescLeft">&#160;</td><td class="mdescRight">previous node in the doubly linked list <br /></td></tr>
<tr class="separator:a1c5295011209f1241fa0aac827129414"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a99420ff7864ecea51429fe61f9c6cb14" id="r_a99420ff7864ecea51429fe61f9c6cb14"><td class="memItemLeft" align="right" valign="top"><a id="a99420ff7864ecea51429fe61f9c6cb14" name="a99420ff7864ecea51429fe61f9c6cb14"></a>
<tr class="memdesc:a19e954cbb710ea8318bcb6aaef78e2d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">previous node in the doubly linked list <br /></td></tr>
<tr class="separator:a19e954cbb710ea8318bcb6aaef78e2d5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0043eb287c54b3b2fb91ce354878a7bd" id="r_a0043eb287c54b3b2fb91ce354878a7bd"><td class="memItemLeft" align="right" valign="top"><a id="a0043eb287c54b3b2fb91ce354878a7bd" name="a0043eb287c54b3b2fb91ce354878a7bd"></a>
<a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt; T &gt; *&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
<tr class="memdesc:a99420ff7864ecea51429fe61f9c6cb14"><td class="mdescLeft">&#160;</td><td class="mdescRight">next node in the doubly linked list <br /></td></tr>
<tr class="separator:a99420ff7864ecea51429fe61f9c6cb14"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memdesc:a0043eb287c54b3b2fb91ce354878a7bd"><td class="mdescLeft">&#160;</td><td class="mdescRight">next node in the doubly linked list <br /></td></tr>
<tr class="separator:a0043eb287c54b3b2fb91ce354878a7bd"><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 T&gt;<br />
@@ -151,7 +153,7 @@ class others::Cache::D_Node&lt; T &gt;</div><p><a class="el" href="../../db/d8b/
</dl>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="adf7731f7bbf68c38e7188d7fd773e83f" name="adf7731f7bbf68c38e7188d7fd773e83f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adf7731f7bbf68c38e7188d7fd773e83f">&#9670;&#160;</a></span>D_Node()</h2>
<h2 class="memtitle"><span class="permalink"><a href="#adf7731f7bbf68c38e7188d7fd773e83f">&#9670;&#160;</a></span>D_Node() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -174,15 +176,44 @@ template&lt;typename T &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 51</span>: <a class="code hl_variable" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>(<a class="code hl_variable" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>), <a class="code hl_variable" href="#a1c5295011209f1241fa0aac827129414">prev</a>(<span class="keyword">nullptr</span>), <a class="code hl_variable" href="#a99420ff7864ecea51429fe61f9c6cb14">next</a>(<span class="keyword">nullptr</span>) {}</div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a1c5295011209f1241fa0aac827129414"><div class="ttname"><a href="#a1c5295011209f1241fa0aac827129414">others::Cache::D_Node::prev</a></div><div class="ttdeci">D_Node&lt; T &gt; * prev</div><div class="ttdoc">previous node in the doubly linked list</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:48</div></div>
<div class="fragment"><div class="line"><span class="lineno"> 51</span>: <a class="code hl_variable" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>(<a class="code hl_variable" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>), <a class="code hl_variable" href="#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a>(<span class="keyword">nullptr</span>), <a class="code hl_variable" href="#a0043eb287c54b3b2fb91ce354878a7bd">next</a>(<span class="keyword">nullptr</span>) {}</div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a0043eb287c54b3b2fb91ce354878a7bd"><div class="ttname"><a href="#a0043eb287c54b3b2fb91ce354878a7bd">others::Cache::D_Node::next</a></div><div class="ttdeci">D_Node&lt; T &gt; * next</div><div class="ttdoc">next node in the doubly linked list</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:49</div></div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a19e954cbb710ea8318bcb6aaef78e2d5"><div class="ttname"><a href="#a19e954cbb710ea8318bcb6aaef78e2d5">others::Cache::D_Node::prev</a></div><div class="ttdeci">D_Node&lt; T &gt; * prev</div><div class="ttdoc">previous node in the doubly linked list</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:48</div></div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a8902e7ff872fa3c80fe6ce5f5cf5cc75"><div class="ttname"><a href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">others::Cache::D_Node::data</a></div><div class="ttdeci">T data</div><div class="ttdoc">data of the node</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:47</div></div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a99420ff7864ecea51429fe61f9c6cb14"><div class="ttname"><a href="#a99420ff7864ecea51429fe61f9c6cb14">others::Cache::D_Node::next</a></div><div class="ttdeci">D_Node&lt; T &gt; * next</div><div class="ttdoc">next node in the doubly linked list</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:49</div></div>
</div><!-- fragment -->
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<a id="adf7731f7bbf68c38e7188d7fd773e83f" name="adf7731f7bbf68c38e7188d7fd773e83f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adf7731f7bbf68c38e7188d7fd773e83f">&#9670;&#160;</a></span>D_Node() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node</a>&lt; T &gt;::D_Node </td>
<td>(</td>
<td class="paramtype">T</td> <td class="paramname"><span class="paramname"><em>data</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">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 48</span>: <a class="code hl_variable" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>(<a class="code hl_variable" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>), <a class="code hl_variable" href="#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a>(<span class="keyword">nullptr</span>), <a class="code hl_variable" href="#a0043eb287c54b3b2fb91ce354878a7bd">next</a>(<span class="keyword">nullptr</span>) {}</div>
</div><!-- fragment -->
</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li>others/<a class="el" href="../../d9/d65/lfu__cache_8cpp.html">lfu_cache.cpp</a></li>
<li>others/<a class="el" href="../../dc/daa/lru__cache2_8cpp.html">lru_cache2.cpp</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

4
de/d21/classothers_1_1_cache_1_1_d___node.js
View File

@@ -1,6 +1,6 @@
var classothers_1_1_cache_1_1_d___node =
[
[ "data", "de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75", null ],
[ "next", "de/d21/classothers_1_1_cache_1_1_d___node.html#a99420ff7864ecea51429fe61f9c6cb14", null ],
[ "prev", "de/d21/classothers_1_1_cache_1_1_d___node.html#a1c5295011209f1241fa0aac827129414", null ]
[ "next", "de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd", null ],
[ "prev", "de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5", null ]
];

3
dir_9510827d0b234b3cc54b29892f217477.html
View File

@@ -146,6 +146,9 @@ Files</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/db3/lru__cache_8cpp.html">lru_cache.cpp</a></td></tr>
<tr class="memdesc:d3/db3/lru__cache_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">An implementation of <a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)" target="_blank">LRU Cache</a>. Lru is a part of cache algorithms (also frequently called cache replacement algorithms or cache replacement policies). <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/daa/lru__cache2_8cpp.html">lru_cache2.cpp</a></td></tr>
<tr class="memdesc:dc/daa/lru__cache2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation for [LRU Cache] (<a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)">https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)</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"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d35/matrix__exponentiation_8cpp.html">matrix_exponentiation.cpp</a></td></tr>
<tr class="memdesc:d7/d35/matrix__exponentiation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Matrix Exponentiation. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>

1
dir_9510827d0b234b3cc54b29892f217477.js
View File

@@ -12,6 +12,7 @@ var dir_9510827d0b234b3cc54b29892f217477 =
[ "lfu_cache.cpp", "d9/d65/lfu__cache_8cpp.html", "d9/d65/lfu__cache_8cpp" ],
[ "longest_substring_without_repeating_characters.cpp", "d4/db8/longest__substring__without__repeating__characters_8cpp.html", "d4/db8/longest__substring__without__repeating__characters_8cpp" ],
[ "lru_cache.cpp", "d3/db3/lru__cache_8cpp.html", "d3/db3/lru__cache_8cpp" ],
[ "lru_cache2.cpp", "dc/daa/lru__cache2_8cpp.html", "dc/daa/lru__cache2_8cpp" ],
[ "matrix_exponentiation.cpp", "d7/d35/matrix__exponentiation_8cpp.html", "d7/d35/matrix__exponentiation_8cpp" ],
[ "palindrome_of_number.cpp", "da/d9a/palindrome__of__number_8cpp.html", "da/d9a/palindrome__of__number_8cpp" ],
[ "paranthesis_matching.cpp", "dc/dc5/paranthesis__matching_8cpp.html", "dc/dc5/paranthesis__matching_8cpp" ],

25
doxygen_crawl.html
View File

@@ -237,6 +237,7 @@
<a href="d9/d65/lfu__cache_8cpp.html"/>
<a href="d4/db8/longest__substring__without__repeating__characters_8cpp.html"/>
<a href="d3/db3/lru__cache_8cpp.html"/>
<a href="dc/daa/lru__cache2_8cpp.html"/>
<a href="d7/d35/matrix__exponentiation_8cpp.html"/>
<a href="da/d9a/palindrome__of__number_8cpp.html"/>
<a href="dc/dc5/paranthesis__matching_8cpp.html"/>
@@ -611,6 +612,8 @@
<a href="d5/ddb/classothers_1_1_cache_1_1_d___node-members.html"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html"/>
<a href="db/d36/classothers_1_1_cache_1_1_l_f_u_cache-members.html"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html"/>
<a href="d1/d35/classothers_1_1_cache_1_1_l_r_u_cache-members.html"/>
<a href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html"/>
<a href="d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html"/>
<a href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html"/>
@@ -2437,6 +2440,21 @@
<a href="d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4"/>
<a href="d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d"/>
<a href="d8/d2a/namespacea1z26.html"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc"/>
<a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a"/>
<a href="d8/d36/namespacecut__rod.html"/>
<a href="d8/d41/namespacegames_1_1memory__game.html"/>
<a href="d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59"/>
@@ -3428,6 +3446,9 @@
<a href="dc/d9c/namespacebit__manipulation_1_1hamming__distance.html#abfe6fbb2f3460a2623c96f283178a07a"/>
<a href="dc/d9e/namespacestrings_1_1horspool.html#a1a9c3aa55ccc79d0f47d50c580997336"/>
<a href="dc/d9e/namespacestrings_1_1horspool.html#a9884bca75ce39c116697ea2574adb37d"/>
<a href="dc/daa/lru__cache2_8cpp.html"/>
<a href="dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
<a href="dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="dc/dac/namespacesearch_1_1sublist__search.html#a4faee403e2758aaab682ed6622ae218c"/>
<a href="dc/dac/namespacesearch_1_1sublist__search.html#a70ca8d0267008e09cfa50b4e2ddfbe53"/>
<a href="dc/dac/namespacesearch_1_1sublist__search.html#ad1028bc215281d62e344af99da57fab2"/>
@@ -3752,9 +3773,9 @@
<a href="de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="de/d1f/namespacesorting_1_1bubble__sort.html#af3b12930a83915712461d53fe9659686"/>
<a href="de/d21/classothers_1_1_cache_1_1_d___node.html"/>
<a href="de/d21/classothers_1_1_cache_1_1_d___node.html#a1c5295011209f1241fa0aac827129414"/>
<a href="de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd"/>
<a href="de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5"/>
<a href="de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75"/>
<a href="de/d21/classothers_1_1_cache_1_1_d___node.html#a99420ff7864ecea51429fe61f9c6cb14"/>
<a href="de/d23/disjoint__set_8cpp.html"/>
<a href="de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec"/>
<a href="de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985"/>

27
files.html
View File

@@ -347,19 +347,20 @@ N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bis
<tr id="row_17_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d65/lfu__cache_8cpp.html" target="_self">lfu_cache.cpp</a></td><td class="desc">Implementation for [LFU Cache] (<a href="https://en.wikipedia.org/wiki/Least_frequently_used">https://en.wikipedia.org/wiki/Least_frequently_used</a>) </td></tr>
<tr id="row_17_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/db8/longest__substring__without__repeating__characters_8cpp.html" target="_self">longest_substring_without_repeating_characters.cpp</a></td><td class="desc"><a class="el" href="dd/d4f/class_solution.html">Solution</a> for Longest Substring Without Repeating Characters problem </td></tr>
<tr id="row_17_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/db3/lru__cache_8cpp.html" target="_self">lru_cache.cpp</a></td><td class="desc">An implementation of <a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)" target="_blank">LRU Cache</a>. Lru is a part of cache algorithms (also frequently called cache replacement algorithms or cache replacement policies) </td></tr>
<tr id="row_17_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d35/matrix__exponentiation_8cpp.html" target="_self">matrix_exponentiation.cpp</a></td><td class="desc">Matrix Exponentiation </td></tr>
<tr id="row_17_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d9a/palindrome__of__number_8cpp.html" target="_self">palindrome_of_number.cpp</a></td><td class="desc">Check if a number is <a href="https://en.wikipedia.org/wiki/Palindrome" target="_blank">palindrome</a> or not </td></tr>
<tr id="row_17_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/dc5/paranthesis__matching_8cpp.html" target="_self">paranthesis_matching.cpp</a></td><td class="desc">Perform paranthesis matching </td></tr>
<tr id="row_17_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d1a/pascal__triangle_8cpp.html" target="_self">pascal_triangle.cpp</a></td><td class="desc">Pascal's triangle implementation </td></tr>
<tr id="row_17_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d75/postfix__evaluation_8cpp.html" target="_self">postfix_evaluation.cpp</a></td><td class="desc">Evaluation of <a href="https://en.wikipedia.org/wiki/Reverse_Polish_notation" target="_blank">Postfix Expression</a> </td></tr>
<tr id="row_17_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d7b/primality__test_8cpp.html" target="_self">primality_test.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Primality test</a> implementation </td></tr>
<tr id="row_17_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html" target="_self">recursive_tree_traversal.cpp</a></td><td class="desc">Recursive version of Inorder, Preorder, and Postorder [Traversal of the Tree] (<a href="https://en.wikipedia.org/wiki/Tree_traversal">https://en.wikipedia.org/wiki/Tree_traversal</a>) </td></tr>
<tr id="row_17_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d01/smallest__circle_8cpp.html" target="_self">smallest_circle.cpp</a></td><td class="desc">Get centre and radius of the <a href="https://en.wikipedia.org/wiki/Smallest-circle_problem" target="_blank">smallest circle</a> that circumscribes given set of points </td></tr>
<tr id="row_17_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d19/sparse__matrix_8cpp.html" target="_self">sparse_matrix.cpp</a></td><td class="desc"></td></tr>
<tr id="row_17_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d07/spiral__print_8cpp.html" target="_self">spiral_print.cpp</a></td><td class="desc">Print the elements of a matrix traversing it spirally </td></tr>
<tr id="row_17_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/def/stairs__pattern_8cpp.html" target="_self">stairs_pattern.cpp</a></td><td class="desc">This program is use to print the following pattern </td></tr>
<tr id="row_17_23_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d3c/tower__of__hanoi_8cpp.html" target="_self">tower_of_hanoi.cpp</a></td><td class="desc">Solve the <a href="https://en.wikipedia.org/wiki/Tower_of_Hanoi" target="_blank">Tower of Hanoi</a> problem </td></tr>
<tr id="row_17_24_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d61/vector__important__functions_8cpp.html" target="_self">vector_important_functions.cpp</a></td><td class="desc">A C++ program to demonstrate working of <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse()</a> </td></tr>
<tr id="row_17_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/daa/lru__cache2_8cpp.html" target="_self">lru_cache2.cpp</a></td><td class="desc">Implementation for [LRU Cache] (<a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)">https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)</a>) </td></tr>
<tr id="row_17_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d35/matrix__exponentiation_8cpp.html" target="_self">matrix_exponentiation.cpp</a></td><td class="desc">Matrix Exponentiation </td></tr>
<tr id="row_17_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d9a/palindrome__of__number_8cpp.html" target="_self">palindrome_of_number.cpp</a></td><td class="desc">Check if a number is <a href="https://en.wikipedia.org/wiki/Palindrome" target="_blank">palindrome</a> or not </td></tr>
<tr id="row_17_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/dc5/paranthesis__matching_8cpp.html" target="_self">paranthesis_matching.cpp</a></td><td class="desc">Perform paranthesis matching </td></tr>
<tr id="row_17_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d1a/pascal__triangle_8cpp.html" target="_self">pascal_triangle.cpp</a></td><td class="desc">Pascal's triangle implementation </td></tr>
<tr id="row_17_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d75/postfix__evaluation_8cpp.html" target="_self">postfix_evaluation.cpp</a></td><td class="desc">Evaluation of <a href="https://en.wikipedia.org/wiki/Reverse_Polish_notation" target="_blank">Postfix Expression</a> </td></tr>
<tr id="row_17_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d7b/primality__test_8cpp.html" target="_self">primality_test.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Primality test</a> implementation </td></tr>
<tr id="row_17_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html" target="_self">recursive_tree_traversal.cpp</a></td><td class="desc">Recursive version of Inorder, Preorder, and Postorder [Traversal of the Tree] (<a href="https://en.wikipedia.org/wiki/Tree_traversal">https://en.wikipedia.org/wiki/Tree_traversal</a>) </td></tr>
<tr id="row_17_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d01/smallest__circle_8cpp.html" target="_self">smallest_circle.cpp</a></td><td class="desc">Get centre and radius of the <a href="https://en.wikipedia.org/wiki/Smallest-circle_problem" target="_blank">smallest circle</a> that circumscribes given set of points </td></tr>
<tr id="row_17_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d19/sparse__matrix_8cpp.html" target="_self">sparse_matrix.cpp</a></td><td class="desc"></td></tr>
<tr id="row_17_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d07/spiral__print_8cpp.html" target="_self">spiral_print.cpp</a></td><td class="desc">Print the elements of a matrix traversing it spirally </td></tr>
<tr id="row_17_23_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/def/stairs__pattern_8cpp.html" target="_self">stairs_pattern.cpp</a></td><td class="desc">This program is use to print the following pattern </td></tr>
<tr id="row_17_24_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d3c/tower__of__hanoi_8cpp.html" target="_self">tower_of_hanoi.cpp</a></td><td class="desc">Solve the <a href="https://en.wikipedia.org/wiki/Tower_of_Hanoi" target="_blank">Tower of Hanoi</a> problem </td></tr>
<tr id="row_17_25_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d61/vector__important__functions_8cpp.html" target="_self">vector_important_functions.cpp</a></td><td class="desc">A C++ program to demonstrate working of <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse()</a> </td></tr>
<tr id="row_18_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_18_" class="arrow" onclick="dynsection.toggleFolder('18_')">&#9658;</span><span id="img_18_" class="iconfclosed" onclick="dynsection.toggleFolder('18_')">&#160;</span><a class="el" href="dir_59dc24c326e2a72d1164f014b22de83d.html" target="_self">physics</a></td><td class="desc"></td></tr>
<tr id="row_18_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d29/ground__to__ground__projectile__motion_8cpp.html" target="_self">ground_to_ground_projectile_motion.cpp</a></td><td class="desc">Ground to ground <a href="https://en.wikipedia.org/wiki/Projectile_motion" target="_blank">projectile motion</a> equation implementations </td></tr>
<tr id="row_19_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_19_" class="arrow" onclick="dynsection.toggleFolder('19_')">&#9658;</span><span id="img_19_" class="iconfclosed" onclick="dynsection.toggleFolder('19_')">&#160;</span><a class="el" href="dir_82e494173a87936756866de2fa774307.html" target="_self">probability</a></td><td class="desc"></td></tr>

2
functions.html
View File

@@ -109,7 +109,7 @@ $(function(){initNavTree('functions.html',''); initResizable(true); });
<h3><a id="index__5F" name="index__5F"></a>- _ -</h3><ul>
<li>__detailed_single_prediction()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b">machine_learning::neural_network::NeuralNetwork</a></li>
<li>__get_integer_from_string()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4">uint256_t</a></li>
<li>_capacity&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>_capacity&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>_digits&#160;:&#160;<a class="el" href="db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">large_number</a></li>
<li>_erase()&#160;:&#160;<a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887">data_structures::treap::Treap</a></li>
<li>_get_k_th()&#160;:&#160;<a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2">data_structures::treap::Treap</a></li>

2
functions_c.html
View File

@@ -108,7 +108,7 @@ $(function(){initNavTree('functions_c.html',''); initResizable(true); });
<h3><a id="index_c" name="index_c"></a>- c -</h3><ul>
<li>cache&#160;:&#160;<a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8">others::lru_cache::LRUCache</a></li>
<li>capacity&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02">MinHeap</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>capacity&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02">MinHeap</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>chain_query()&#160;:&#160;<a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></li>
<li>change_root()&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>char_to_int()&#160;:&#160;<a class="el" href="d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">data_structures::trie</a></li>

2
functions_e.html
View File

@@ -109,7 +109,7 @@ $(function(){initNavTree('functions_e.html',''); initResizable(true); });
<h3><a id="index_e" name="index_e"></a>- e -</h3><ul>
<li>Edge()&#160;:&#160;<a class="el" href="d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980">Edge</a></li>
<li>EightPuzzle()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>empty()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>empty()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>encrypt_text()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher</a></li>
<li>end&#160;:&#160;<a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">operations_on_datastructures::circular_linked_list::CircularLinkedList</a></li>
<li>enQueue()&#160;:&#160;<a class="el" href="db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">queue&lt; ValueType &gt;</a></li>

2
functions_func_c.html
View File

@@ -107,7 +107,7 @@ $(function(){initNavTree('functions_func_c.html',''); initResizable(true); });
<div class="textblock">Here is a list of all documented functions with links to the class documentation for each member:</div>
<h3><a id="index_c" name="index_c"></a>- c -</h3><ul>
<li>capacity()&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>capacity()&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>chain_query()&#160;:&#160;<a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></li>
<li>change_root()&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>char_to_int()&#160;:&#160;<a class="el" href="d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">data_structures::trie</a></li>

2
functions_func_e.html
View File

@@ -109,7 +109,7 @@ $(function(){initNavTree('functions_func_e.html',''); initResizable(true); });
<h3><a id="index_e" name="index_e"></a>- e -</h3><ul>
<li>Edge()&#160;:&#160;<a class="el" href="d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980">Edge</a></li>
<li>EightPuzzle()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>empty()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>empty()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>encrypt_text()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher</a></li>
<li>enQueue()&#160;:&#160;<a class="el" href="db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">queue&lt; ValueType &gt;</a></li>
<li>enqueue()&#160;:&#160;<a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array</a></li>

2
functions_func_g.html
View File

@@ -114,7 +114,7 @@ $(function(){initNavTree('functions_func_g.html',''); initResizable(true); });
<li>generate_keys()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">ciphers::HillCipher</a></li>
<li>generate_possible_moves()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>geometric_distribution()&#160;:&#160;<a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797">probability::geometric_dist::geometric_distribution</a></li>
<li>get()&#160;:&#160;<a class="el" href="dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">catalan_numbers</a>, <a class="el" href="dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">dsu</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>get()&#160;:&#160;<a class="el" href="dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">catalan_numbers</a>, <a class="el" href="dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">dsu</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>get_all_words()&#160;:&#160;<a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd">data_structures::trie_using_hashmap::Trie</a></li>
<li>get_char_idx()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41">ciphers::HillCipher</a></li>
<li>get_elements_inorder()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">binary_search_tree&lt; T &gt;</a></li>

2
functions_func_l.html
View File

@@ -124,7 +124,7 @@ $(function(){initNavTree('functions_func_l.html',''); initResizable(true); });
<li>lower()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1">uint256_t</a></li>
<li>lowest_common_ancestor()&#160;:&#160;<a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">graph::LowestCommonAncestor</a></li>
<li>LowestCommonAncestor()&#160;:&#160;<a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">graph::LowestCommonAncestor</a></li>
<li>LRUCache()&#160;:&#160;<a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4">others::lru_cache::LRUCache</a></li>
<li>LRUCache()&#160;:&#160;<a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f">others::Cache::LRUCache&lt; K, V &gt;</a>, <a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4">others::lru_cache::LRUCache</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

1
functions_func_m.html
View File

@@ -107,6 +107,7 @@ $(function(){initNavTree('functions_func_m.html',''); initResizable(true); });
<div class="textblock">Here is a list of all documented functions with links to the class documentation for each member:</div>
<h3><a id="index_m" name="index_m"></a>- m -</h3><ul>
<li>make_recent()&#160;:&#160;<a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>makeStrings()&#160;:&#160;<a class="el" href="df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec">backtracking::generate_parentheses</a></li>
<li>mat_mul()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590">ciphers::HillCipher</a></li>
<li>Matrix()&#160;:&#160;<a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a></li>

5
functions_func_p.html
View File

@@ -109,6 +109,7 @@ $(function(){initNavTree('functions_func_p.html',''); initResizable(true); });
<h3><a id="index_p" name="index_p"></a>- p -</h3><ul>
<li>Point()&#160;:&#160;<a class="el" href="d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a">Point</a></li>
<li>pop()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">data_structures::stack_using_queue::Stack</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack&lt; ValueType &gt;</a></li>
<li>pop_back()&#160;:&#160;<a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>populate_parents()&#160;:&#160;<a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree</a></li>
<li>populate_up()&#160;:&#160;<a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor</a></li>
<li>postorder()&#160;:&#160;<a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">others::recursive_tree_traversals::BT</a></li>
@@ -124,8 +125,8 @@ $(function(){initNavTree('functions_func_p.html',''); initResizable(true); });
<li>probability_density()&#160;:&#160;<a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1">probability::geometric_dist::geometric_distribution</a></li>
<li>push()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">data_structures::stack_using_queue::Stack</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack&lt; ValueType &gt;</a></li>
<li>push_back()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496">data_structures::linked_list::list</a></li>
<li>push_front()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7">data_structures::linked_list::list</a></li>
<li>put()&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>push_front()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7">data_structures::linked_list::list</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>put()&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45">others::Cache::LRUCache&lt; K, V &gt;</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

2
functions_func_s.html
View File

@@ -123,7 +123,7 @@ $(function(){initNavTree('functions_func_s.html',''); initResizable(true); });
<li>SG()&#160;:&#160;<a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></li>
<li>show()&#160;:&#160;<a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">data_structures::list_array::list&lt; N &gt;</a>, <a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586">data_structures::Stack&lt; T &gt;</a></li>
<li>single_predict()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork</a></li>
<li>size()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree&lt; T &gt;</a>, <a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a>, <a class="el" href="dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a></li>
<li>size()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree&lt; T &gt;</a>, <a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a>, <a class="el" href="dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1">others::Cache::LRUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a></li>
<li>SkipList()&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4">data_structures::SkipList</a></li>
<li>slice()&#160;:&#160;<a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a></li>
<li>Solution()&#160;:&#160;<a class="el" href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;</a></li>

1
functions_func_~.html
View File

@@ -113,6 +113,7 @@ $(function(){initNavTree('functions_func_~.html',''); initResizable(true); });
<li>~Info()&#160;:&#160;<a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></li>
<li>~Knn()&#160;:&#160;<a class="el" href="da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5">machine_learning::k_nearest_neighbors::Knn</a></li>
<li>~LFUCache()&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>~LRUCache()&#160;:&#160;<a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>~NeuralNetwork()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027">machine_learning::neural_network::NeuralNetwork</a></li>
<li>~uint128_t()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363">uint128_t</a></li>
<li>~uint256_t()&#160;:&#160;<a class="el" href="d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067">uint256_t</a></li>

2
functions_g.html
View File

@@ -114,7 +114,7 @@ $(function(){initNavTree('functions_g.html',''); initResizable(true); });
<li>generate_keys()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">ciphers::HillCipher</a></li>
<li>generate_possible_moves()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>geometric_distribution()&#160;:&#160;<a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797">probability::geometric_dist::geometric_distribution</a></li>
<li>get()&#160;:&#160;<a class="el" href="dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">catalan_numbers</a>, <a class="el" href="dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">dsu</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>get()&#160;:&#160;<a class="el" href="dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">catalan_numbers</a>, <a class="el" href="dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">dsu</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>get_all_words()&#160;:&#160;<a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd">data_structures::trie_using_hashmap::Trie</a></li>
<li>get_char_idx()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41">ciphers::HillCipher</a></li>
<li>get_elements_inorder()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">binary_search_tree&lt; T &gt;</a></li>

2
functions_h.html
View File

@@ -116,7 +116,7 @@ $(function(){initNavTree('functions_h.html',''); initResizable(true); });
<li>hash()&#160;:&#160;<a class="el" href="dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64">hash_chain</a></li>
<li>hash_chain()&#160;:&#160;<a class="el" href="dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595">hash_chain</a></li>
<li>hashFunks&#160;:&#160;<a class="el" href="dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80">data_structures::BloomFilter&lt; T &gt;</a></li>
<li>head&#160;:&#160;<a class="el" href="dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">hash_chain</a></li>
<li>head&#160;:&#160;<a class="el" href="dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">hash_chain</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>header&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">data_structures::SkipList</a></li>
<li>heap_size&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">MinHeap</a></li>
<li>heuristic_value&#160;:&#160;<a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></li>

2
functions_l.html
View File

@@ -128,7 +128,7 @@ $(function(){initNavTree('functions_l.html',''); initResizable(true); });
<li>lower()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1">uint256_t</a></li>
<li>lowest_common_ancestor()&#160;:&#160;<a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">graph::LowestCommonAncestor</a></li>
<li>LowestCommonAncestor()&#160;:&#160;<a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">graph::LowestCommonAncestor</a></li>
<li>LRUCache()&#160;:&#160;<a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4">others::lru_cache::LRUCache</a></li>
<li>LRUCache()&#160;:&#160;<a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f">others::Cache::LRUCache&lt; K, V &gt;</a>, <a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4">others::lru_cache::LRUCache</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

1
functions_m.html
View File

@@ -109,6 +109,7 @@ $(function(){initNavTree('functions_m.html',''); initResizable(true); });
<h3><a id="index_m" name="index_m"></a>- m -</h3><ul>
<li>m&#160;:&#160;<a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">graph::HKGraph</a></li>
<li>main_q&#160;:&#160;<a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">data_structures::stack_using_queue::Stack</a></li>
<li>make_recent()&#160;:&#160;<a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>makeStrings()&#160;:&#160;<a class="el" href="df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec">backtracking::generate_parentheses</a></li>
<li>mat_mul()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590">ciphers::HillCipher</a></li>
<li>Matrix()&#160;:&#160;<a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a></li>

4
functions_n.html
View File

@@ -115,9 +115,9 @@ $(function(){initNavTree('functions_n.html',''); initResizable(true); });
<li>NeuralNetwork()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89">machine_learning::neural_network::NeuralNetwork</a></li>
<li>new_val()&#160;:&#160;<a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">statistics::stats_computer1&lt; T &gt;</a>, <a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">statistics::stats_computer2&lt; T &gt;</a></li>
<li>newKid()&#160;:&#160;<a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">range_queries::perSegTree</a></li>
<li>next&#160;:&#160;<a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">data_structures::linked_list::Node</a>, <a class="el" href="d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f">list</a>, <a class="el" href="d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">ListNode</a>, <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">operations_on_datastructures::circular_linked_list::Node</a>, <a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html#a99420ff7864ecea51429fe61f9c6cb14">others::Cache::D_Node&lt; T &gt;</a>, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">search::sublist_search::Node</a></li>
<li>next&#160;:&#160;<a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">data_structures::linked_list::Node</a>, <a class="el" href="d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f">list</a>, <a class="el" href="d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">ListNode</a>, <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">operations_on_datastructures::circular_linked_list::Node</a>, <a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">others::Cache::D_Node&lt; T &gt;</a>, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">search::sublist_search::Node</a></li>
<li>Node()&#160;:&#160;<a class="el" href="d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78">data_structures::Node</a>, <a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670">data_structures::tree_234::Node</a>, <a class="el" href="dd/d1c/classhash__chain.html#a8b204861e9470377c956d3b5cd313036">hash_chain</a>, <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5">operations_on_datastructures::circular_linked_list::Node</a>, <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3">operations_on_datastructures::reverse_binary_tree::Node</a></li>
<li>node_map&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>node_map&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>NUM_CHARS&#160;:&#160;<a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">data_structures::trie</a></li>
<li>num_digits()&#160;:&#160;<a class="el" href="db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">large_number</a></li>
<li>number_of_vertices()&#160;:&#160;<a class="el" href="dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">graph::Graph&lt; T &gt;</a></li>

7
functions_p.html
View File

@@ -116,6 +116,7 @@ $(function(){initNavTree('functions_p.html',''); initResizable(true); });
<li>parent&#160;:&#160;<a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree</a></li>
<li>Point()&#160;:&#160;<a class="el" href="d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a">Point</a></li>
<li>pop()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">data_structures::stack_using_queue::Stack</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack&lt; ValueType &gt;</a></li>
<li>pop_back()&#160;:&#160;<a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>populate_parents()&#160;:&#160;<a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree</a></li>
<li>populate_up()&#160;:&#160;<a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor</a></li>
<li>postorder()&#160;:&#160;<a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">others::recursive_tree_traversals::BT</a></li>
@@ -124,7 +125,7 @@ $(function(){initNavTree('functions_p.html',''); initResizable(true); });
<li>predict_words()&#160;:&#160;<a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">data_structures::trie_using_hashmap::Trie</a></li>
<li>preorder()&#160;:&#160;<a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">others::recursive_tree_traversals::BT</a></li>
<li>preOrderIterative()&#160;:&#160;<a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae">others::iterative_tree_traversals::BinaryTree</a></li>
<li>prev&#160;:&#160;<a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html#a1c5295011209f1241fa0aac827129414">others::Cache::D_Node&lt; T &gt;</a></li>
<li>prev&#160;:&#160;<a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">others::Cache::D_Node&lt; T &gt;</a></li>
<li>Print()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165">data_structures::tree_234::Tree234</a></li>
<li>print()&#160;:&#160;<a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
<li>PrintNode()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be">data_structures::tree_234::Tree234</a></li>
@@ -135,8 +136,8 @@ $(function(){initNavTree('functions_p.html',''); initResizable(true); });
<li>ptrs&#160;:&#160;<a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">range_queries::perSegTree</a></li>
<li>push()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">data_structures::stack_using_queue::Stack</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack&lt; ValueType &gt;</a></li>
<li>push_back()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496">data_structures::linked_list::list</a></li>
<li>push_front()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7">data_structures::linked_list::list</a></li>
<li>put()&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>push_front()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7">data_structures::linked_list::list</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>put()&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>pvalue&#160;:&#160;<a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936">data_structures::linked_list::link</a></li>
</ul>
</div><!-- contents -->

2
functions_s.html
View File

@@ -129,7 +129,7 @@ $(function(){initNavTree('functions_s.html',''); initResizable(true); });
<li>show()&#160;:&#160;<a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">data_structures::list_array::list&lt; N &gt;</a>, <a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586">data_structures::Stack&lt; T &gt;</a></li>
<li>side&#160;:&#160;<a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">graph::is_graph_bipartite::Graph</a></li>
<li>single_predict()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork</a></li>
<li>size()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree&lt; T &gt;</a>, <a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset</a>, <a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3">data_structures::SegmentTree&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">data_structures::treap::Treap</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a>, <a class="el" href="dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a>, <a class="el" href="d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">stack&lt; ValueType &gt;</a></li>
<li>size()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree&lt; T &gt;</a>, <a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset</a>, <a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3">data_structures::SegmentTree&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">data_structures::treap::Treap</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a>, <a class="el" href="dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu</a>, <a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1">others::Cache::LRUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a>, <a class="el" href="d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">stack&lt; ValueType &gt;</a></li>
<li>size_&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">binary_search_tree&lt; T &gt;</a></li>
<li>SkipList()&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4">data_structures::SkipList</a></li>
<li>slice()&#160;:&#160;<a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a></li>

1
functions_t.html
View File

@@ -116,6 +116,7 @@ $(function(){initNavTree('functions_t.html',''); initResizable(true); });
<li>t_root&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>t_size&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>t_val&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>tail&#160;:&#160;<a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>test()&#160;:&#160;<a class="el" href="db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9">large_number</a></li>
<li>testCase_1()&#160;:&#160;<a class="el" href="d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">TestCases</a></li>
<li>testCase_2()&#160;:&#160;<a class="el" href="d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">TestCases</a></li>

11
functions_vars.html
View File

@@ -107,7 +107,7 @@ $(function(){initNavTree('functions_vars.html',''); initResizable(true); });
<div class="textblock">Here is a list of all documented variables with links to the class documentation for each member:</div>
<h3><a id="index__5F" name="index__5F"></a>- _ -</h3><ul>
<li>_capacity&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>_capacity&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>_digits&#160;:&#160;<a class="el" href="db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">large_number</a></li>
<li>_itMedian&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">probability::windowed_median::WindowedMedian</a></li>
<li>_mod&#160;:&#160;<a class="el" href="dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">hash_chain</a></li>
@@ -179,7 +179,7 @@ $(function(){initNavTree('functions_vars.html',''); initResizable(true); });
<li>h_parent&#160;:&#160;<a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></li>
<li>harr&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">MinHeap</a></li>
<li>hashFunks&#160;:&#160;<a class="el" href="dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80">data_structures::BloomFilter&lt; T &gt;</a></li>
<li>head&#160;:&#160;<a class="el" href="dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">hash_chain</a></li>
<li>head&#160;:&#160;<a class="el" href="dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">hash_chain</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>header&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">data_structures::SkipList</a></li>
<li>heap_size&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">MinHeap</a></li>
<li>heuristic_value&#160;:&#160;<a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></li>
@@ -222,8 +222,8 @@ $(function(){initNavTree('functions_vars.html',''); initResizable(true); });
<h3><a id="index_n" name="index_n"></a>- n -</h3><ul>
<li>n&#160;:&#160;<a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635">data_structures::sparse_table::Sparse_table</a>, <a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">graph::HKGraph</a>, <a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef">graph::is_graph_bipartite::Graph</a>, <a class="el" href="de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6">range_queries::fenwick_tree</a></li>
<li>neighbors&#160;:&#160;<a class="el" href="dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">graph::Graph&lt; T &gt;</a></li>
<li>next&#160;:&#160;<a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">data_structures::linked_list::Node</a>, <a class="el" href="d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f">list</a>, <a class="el" href="d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">ListNode</a>, <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">operations_on_datastructures::circular_linked_list::Node</a>, <a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html#a99420ff7864ecea51429fe61f9c6cb14">others::Cache::D_Node&lt; T &gt;</a>, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">search::sublist_search::Node</a></li>
<li>node_map&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>next&#160;:&#160;<a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">data_structures::linked_list::Node</a>, <a class="el" href="d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f">list</a>, <a class="el" href="d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">ListNode</a>, <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">operations_on_datastructures::circular_linked_list::Node</a>, <a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">others::Cache::D_Node&lt; T &gt;</a>, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">search::sublist_search::Node</a></li>
<li>node_map&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">others::Cache::LFUCache&lt; K, V &gt;</a>, <a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>NUM_CHARS&#160;:&#160;<a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">data_structures::trie</a></li>
</ul>
@@ -236,7 +236,7 @@ $(function(){initNavTree('functions_vars.html',''); initResizable(true); });
<li>pair_u&#160;:&#160;<a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">graph::HKGraph</a></li>
<li>pair_v&#160;:&#160;<a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">graph::HKGraph</a></li>
<li>parent&#160;:&#160;<a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree</a></li>
<li>prev&#160;:&#160;<a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html#a1c5295011209f1241fa0aac827129414">others::Cache::D_Node&lt; T &gt;</a></li>
<li>prev&#160;:&#160;<a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">others::Cache::D_Node&lt; T &gt;</a></li>
<li>priority&#160;:&#160;<a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">data_structures::treap::Treap</a></li>
<li>psucc&#160;:&#160;<a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081">data_structures::linked_list::link</a></li>
<li>ptrs&#160;:&#160;<a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">range_queries::perSegTree</a></li>
@@ -288,6 +288,7 @@ $(function(){initNavTree('functions_vars.html',''); initResizable(true); });
<li>t_root&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>t_size&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>t_val&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>tail&#160;:&#160;<a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>top&#160;:&#160;<a class="el" href="d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">tower</a></li>
<li>treapCnt&#160;:&#160;<a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425">data_structures::treap::Treap</a></li>
</ul>

1
functions_~.html
View File

@@ -113,6 +113,7 @@ $(function(){initNavTree('functions_~.html',''); initResizable(true); });
<li>~Info()&#160;:&#160;<a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></li>
<li>~Knn()&#160;:&#160;<a class="el" href="da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5">machine_learning::k_nearest_neighbors::Knn</a></li>
<li>~LFUCache()&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>~LRUCache()&#160;:&#160;<a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06">others::Cache::LRUCache&lt; K, V &gt;</a></li>
<li>~NeuralNetwork()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027">machine_learning::neural_network::NeuralNetwork</a></li>
<li>~uint128_t()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363">uint128_t</a></li>
<li>~uint256_t()&#160;:&#160;<a class="el" href="d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067">uint256_t</a></li>

2
globals_func_m.html
View File

File diff suppressed because one or more lines are too long

2
globals_func_t.html
View File

File diff suppressed because one or more lines are too long

2
globals_m.html
View File

File diff suppressed because one or more lines are too long

2
globals_t.html
View File

File diff suppressed because one or more lines are too long

137
hierarchy.html
View File

@@ -168,74 +168,75 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_53_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/da4/struct_list_node.html" target="_self">ListNode</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_54_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d21/class_longest___substring.html" target="_self">Longest_Substring</a></td><td class="desc">Class that solves the Longest Substring Without Repeating Characters problem </td></tr>
<tr id="row_55_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</a></td><td class="desc"></td></tr>
<tr id="row_56_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">others::lru_cache::LRUCache</a></td><td class="desc">LRU cache class </td></tr>
<tr id="row_57_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" target="_self">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a></td><td class="desc"><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" title="Matrix class.">Matrix</a> class </td></tr>
<tr id="row_58_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_59_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
<tr id="row_61_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">math::ncr_modulo_p::NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
<tr id="row_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">machine_learning::neural_network::NeuralNetwork</a></td><td class="desc"></td></tr>
<tr id="row_63_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html" target="_self">data_structures::linked_list::Node</a></td><td class="desc"></td></tr>
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</a></td><td class="desc"></td></tr>
<tr id="row_65_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_self">data_structures::tree_234::Node</a></td><td class="desc">2-3-4 tree node class </td></tr>
<tr id="row_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" target="_self">data_structures::trie_using_hashmap::Trie::Node</a></td><td class="desc">Struct representing a trie node </td></tr>
<tr id="row_67_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node&lt; ValueType &gt;</a></td><td class="desc"></td></tr>
<tr id="row_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" target="_self">operations_on_datastructures::circular_linked_list::Node</a></td><td class="desc">A <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> struct that represents a single <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> in a Binary Tree </td></tr>
<tr id="row_69_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
<tr id="row_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">operations_on_datastructures::reverse_binary_tree::Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
<tr id="row_71_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">others::iterative_tree_traversals::Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
<tr id="row_72_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html" target="_self">others::recursive_tree_traversals::Node</a></td><td class="desc">The structure to hold Nodes of the tree </td></tr>
<tr id="row_73_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">range_queries::perSegTree::Node</a></td><td class="desc"></td></tr>
<tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">search::sublist_search::Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_75_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node&lt; value_type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_77_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" target="_self">strings::boyer_moore::pattern</a></td><td class="desc">A structure representing all the data we need to search the preprocessed pattern in text </td></tr>
<tr id="row_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">range_queries::perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_79_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" target="_self">ciphers::elliptic_curve_key_exchange::Point</a></td><td class="desc">Definition of struct <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> </td></tr>
<tr id="row_80_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</a></td><td class="desc"></td></tr>
<tr id="row_81_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
<tr id="row_82_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_83_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_84_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_85_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue&lt; ValueType &gt;</a></td><td class="desc"></td></tr>
<tr id="row_86_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_87_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_88_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_89_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html" target="_self">data_structures::SegmentTree&lt; T &gt;</a></td><td class="desc">Class representation of the segment tree </td></tr>
<tr id="row_90_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_90_" class="arrow" onclick="dynsection.toggleFolder('90_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_90_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_91_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
<tr id="row_92_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_93_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_94_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc8/classdata__structures_1_1_stack.html" target="_self">data_structures::Stack&lt; T &gt;</a></td><td class="desc">Class representation of a stack </td></tr>
<tr id="row_95_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure </td></tr>
<tr id="row_96_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_97_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack&lt; ValueType &gt;</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a> </td></tr>
<tr id="row_98_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_99_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_100_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_101_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
<tr id="row_102_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_103_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_104_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_105_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html" target="_self">data_structures::treap::Treap</a></td><td class="desc">Struct representation of the treap </td></tr>
<tr id="row_106_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_106_" class="arrow" onclick="dynsection.toggleFolder('106_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_106_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_107_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
<tr id="row_108_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_109_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_110_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_111_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_112_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_112_" class="arrow" onclick="dynsection.toggleFolder('112_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
<tr id="row_112_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_112_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_112_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_112_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_112_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_112_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">std::is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_113_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_114_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_115_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">probability::windowed_median::WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
<tr id="row_56_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" target="_self">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="desc"><a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" title="LRUCache.">LRUCache</a> </td></tr>
<tr id="row_57_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">others::lru_cache::LRUCache</a></td><td class="desc">LRU cache class </td></tr>
<tr id="row_58_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" target="_self">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a></td><td class="desc"><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" title="Matrix class.">Matrix</a> class </td></tr>
<tr id="row_59_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_61_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
<tr id="row_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">math::ncr_modulo_p::NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
<tr id="row_63_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">machine_learning::neural_network::NeuralNetwork</a></td><td class="desc"></td></tr>
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html" target="_self">data_structures::linked_list::Node</a></td><td class="desc"></td></tr>
<tr id="row_65_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</a></td><td class="desc"></td></tr>
<tr id="row_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_self">data_structures::tree_234::Node</a></td><td class="desc">2-3-4 tree node class </td></tr>
<tr id="row_67_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" target="_self">data_structures::trie_using_hashmap::Trie::Node</a></td><td class="desc">Struct representing a trie node </td></tr>
<tr id="row_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node&lt; ValueType &gt;</a></td><td class="desc"></td></tr>
<tr id="row_69_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" target="_self">operations_on_datastructures::circular_linked_list::Node</a></td><td class="desc">A <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> struct that represents a single <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> in a Binary Tree </td></tr>
<tr id="row_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
<tr id="row_71_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">operations_on_datastructures::reverse_binary_tree::Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
<tr id="row_72_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">others::iterative_tree_traversals::Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
<tr id="row_73_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html" target="_self">others::recursive_tree_traversals::Node</a></td><td class="desc">The structure to hold Nodes of the tree </td></tr>
<tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">range_queries::perSegTree::Node</a></td><td class="desc"></td></tr>
<tr id="row_75_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">search::sublist_search::Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
<tr id="row_77_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node&lt; value_type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" target="_self">strings::boyer_moore::pattern</a></td><td class="desc">A structure representing all the data we need to search the preprocessed pattern in text </td></tr>
<tr id="row_79_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">range_queries::perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_80_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" target="_self">ciphers::elliptic_curve_key_exchange::Point</a></td><td class="desc">Definition of struct <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> </td></tr>
<tr id="row_81_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</a></td><td class="desc"></td></tr>
<tr id="row_82_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
<tr id="row_83_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_84_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_85_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_86_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue&lt; ValueType &gt;</a></td><td class="desc"></td></tr>
<tr id="row_87_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_88_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_89_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_90_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html" target="_self">data_structures::SegmentTree&lt; T &gt;</a></td><td class="desc">Class representation of the segment tree </td></tr>
<tr id="row_91_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_91_" class="arrow" onclick="dynsection.toggleFolder('91_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_91_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_92_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
<tr id="row_93_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_94_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_95_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc8/classdata__structures_1_1_stack.html" target="_self">data_structures::Stack&lt; T &gt;</a></td><td class="desc">Class representation of a stack </td></tr>
<tr id="row_96_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure </td></tr>
<tr id="row_97_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_98_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack&lt; ValueType &gt;</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a> </td></tr>
<tr id="row_99_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_100_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_101_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_102_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
<tr id="row_103_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_104_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_105_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_106_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html" target="_self">data_structures::treap::Treap</a></td><td class="desc">Struct representation of the treap </td></tr>
<tr id="row_107_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_107_" class="arrow" onclick="dynsection.toggleFolder('107_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_107_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_108_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
<tr id="row_109_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_110_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_111_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_112_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_113_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_113_" class="arrow" onclick="dynsection.toggleFolder('113_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
<tr id="row_113_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_113_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_113_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_113_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_113_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_113_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">std::is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_114_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_115_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_116_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">probability::windowed_median::WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

1
hierarchy.js
View File

@@ -58,6 +58,7 @@ var hierarchy =
[ "ListNode", "d7/da4/struct_list_node.html", null ],
[ "Longest_Substring", "da/d21/class_longest___substring.html", null ],
[ "graph::LowestCommonAncestor", "d9/d23/classgraph_1_1_lowest_common_ancestor.html", null ],
[ "others::Cache::LRUCache< K, V >", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html", null ],
[ "others::lru_cache::LRUCache", "d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html", null ],
[ "divide_and_conquer::strassens_multiplication::Matrix< T, typename >", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html", null ],
[ "MinHeap", "d2/d05/class_min_heap.html", null ],

2
inherit_graph_100.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d4/db4/struct_segment_intersection.html" title=" " alt="" coords="5,5,147,31"/>
<area shape="rect" id="Node000000" href="$da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list." alt="" coords="5,5,158,46"/>
</map>

2
inherit_graph_100.md5
View File

@@ -1 +1 @@
ec8e0ec9ba2659ae4c1c03a14fee656f
d1b903c12342c81b9815dc3248590328

13
inherit_graph_100.svg
View File

@@ -4,16 +4,17 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="114pt" height="27pt"
viewBox="0.00 0.00 114.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<svg width="122pt" height="39pt"
viewBox="0.00 0.00 122.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d4/db4/struct_segment_intersection.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">SegmentIntersection</text>
<g id="a_Node000000"><a xlink:href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_top" xlink:title="A Node structure representing a single link Node in a linked list.">
<polygon fill="white" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
<text text-anchor="middle" x="57.13" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 957 B

After

Width:  |  Height:  |  Size: 1.1 KiB

2
inherit_graph_101.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$dd/d4f/class_solution.html" title=" " alt="" coords="5,5,74,31"/>
<area shape="rect" id="Node000000" href="$d4/db4/struct_segment_intersection.html" title=" " alt="" coords="5,5,147,31"/>
</map>

2
inherit_graph_101.md5
View File

@@ -1 +1 @@
ff0be17deb0c0dfb25090b34c2c7d14f
ec8e0ec9ba2659ae4c1c03a14fee656f

10
inherit_graph_101.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="59pt" height="27pt"
viewBox="0.00 0.00 59.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="114pt" height="27pt"
viewBox="0.00 0.00 114.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="dd/d4f/class_solution.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="51.25,-19.25 0,-19.25 0,0 51.25,0 51.25,-19.25"/>
<text text-anchor="middle" x="25.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
<g id="a_Node000000"><a xlink:href="d4/db4/struct_segment_intersection.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">SegmentIntersection</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 940 B

After

Width:  |  Height:  |  Size: 957 B

2
inherit_graph_102.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d1/dc2/classstack.html" title="for std::invalid_argument" alt="" coords="5,5,143,31"/>
<area shape="rect" id="Node000000" href="$dd/d4f/class_solution.html" title=" " alt="" coords="5,5,74,31"/>
</map>

2
inherit_graph_102.md5
View File

@@ -1 +1 @@
717e385118aaa4f551bc0a7a0954681d
ff0be17deb0c0dfb25090b34c2c7d14f

10
inherit_graph_102.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="111pt" height="27pt"
viewBox="0.00 0.00 111.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="59pt" height="27pt"
viewBox="0.00 0.00 59.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d1/dc2/classstack.html" target="_top" xlink:title="for std::invalid_argument">
<polygon fill="white" stroke="#666666" points="103,-19.25 0,-19.25 0,0 103,0 103,-19.25"/>
<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack&lt; ValueType &gt;</text>
<g id="a_Node000000"><a xlink:href="dd/d4f/class_solution.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="51.25,-19.25 0,-19.25 0,0 51.25,0 51.25,-19.25"/>
<text text-anchor="middle" x="25.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 971 B

After

Width:  |  Height:  |  Size: 940 B

2
inherit_graph_103.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d2/dc4/classstack__linked_list.html" title=" " alt="" coords="5,5,121,31"/>
<area shape="rect" id="Node000000" href="$d1/dc2/classstack.html" title="for std::invalid_argument" alt="" coords="5,5,143,31"/>
</map>

2
inherit_graph_103.md5
View File

@@ -1 +1 @@
f583284f2e396e0f7b5fd8bccf0bb840
717e385118aaa4f551bc0a7a0954681d

10
inherit_graph_103.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="95pt" height="27pt"
viewBox="0.00 0.00 94.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="111pt" height="27pt"
viewBox="0.00 0.00 111.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d2/dc4/classstack__linked_list.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="86.5,-19.25 0,-19.25 0,0 86.5,0 86.5,-19.25"/>
<text text-anchor="middle" x="43.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack_linkedList</text>
<g id="a_Node000000"><a xlink:href="d1/dc2/classstack.html" target="_top" xlink:title="for std::invalid_argument">
<polygon fill="white" stroke="#666666" points="103,-19.25 0,-19.25 0,0 103,0 103,-19.25"/>
<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack&lt; ValueType &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 954 B

After

Width:  |  Height:  |  Size: 971 B

2
inherit_graph_104.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d7/d7c/classstatistics_1_1stats__computer1.html" title=" " alt="" coords="5,5,217,31"/>
<area shape="rect" id="Node000000" href="$d2/dc4/classstack__linked_list.html" title=" " alt="" coords="5,5,121,31"/>
</map>

2
inherit_graph_104.md5
View File

@@ -1 +1 @@
adf4423c975497d5fe67f2bb0728f9b9
f583284f2e396e0f7b5fd8bccf0bb840

10
inherit_graph_104.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="167pt" height="27pt"
viewBox="0.00 0.00 166.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="95pt" height="27pt"
viewBox="0.00 0.00 94.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="158.5,-19.25 0,-19.25 0,0 158.5,0 158.5,-19.25"/>
<text text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1&lt; T &gt;</text>
<g id="a_Node000000"><a xlink:href="d2/dc4/classstack__linked_list.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="86.5,-19.25 0,-19.25 0,0 86.5,0 86.5,-19.25"/>
<text text-anchor="middle" x="43.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack_linkedList</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 993 B

After

Width:  |  Height:  |  Size: 954 B

2
inherit_graph_105.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d8/dab/classstatistics_1_1stats__computer2.html" title=" " alt="" coords="5,5,217,31"/>
<area shape="rect" id="Node000000" href="$d7/d7c/classstatistics_1_1stats__computer1.html" title=" " alt="" coords="5,5,217,31"/>
</map>

2
inherit_graph_105.md5
View File

@@ -1 +1 @@
efb55af1cccef519836d4c2436ccda42
adf4423c975497d5fe67f2bb0728f9b9

4
inherit_graph_105.svg
View File

@@ -11,9 +11,9 @@
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d8/dab/classstatistics_1_1stats__computer2.html" target="_top" xlink:title=" ">
<g id="a_Node000000"><a xlink:href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="158.5,-19.25 0,-19.25 0,0 158.5,0 158.5,-19.25"/>
<text text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2&lt; T &gt;</text>
<text text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1&lt; T &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 993 B

After

Width:  |  Height:  |  Size: 993 B

14
inherit_graph_106.map
View File

@@ -1,15 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="5,161,107,186"/>
<area shape="rect" id="Node000001" href="$d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" title=" " alt="" coords="191,5,312,46"/>
<area shape="poly" id="edge4_Node000000_Node000001" title=" " alt="" coords="71,146,106,101,128,77,153,57,189,39,191,44,156,61,132,81,110,104,76,149"/>
<area shape="rect" id="Node000002" href="$dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" title=" " alt="" coords="191,71,312,111"/>
<area shape="poly" id="edge5_Node000000_Node000002" title=" " alt="" coords="93,151,154,121,190,107,191,112,156,125,95,155"/>
<area shape="rect" id="Node000003" href="$d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" title=" " alt="" coords="160,136,343,161"/>
<area shape="poly" id="edge6_Node000000_Node000003" title=" " alt="" coords="122,163,159,158,159,163,122,168"/>
<area shape="rect" id="Node000004" href="$d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" title=" " alt="" coords="160,185,343,210"/>
<area shape="poly" id="edge7_Node000000_Node000004" title=" " alt="" coords="122,179,159,184,159,189,122,184"/>
<area shape="rect" id="Node000005" href="$d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" title=" " alt="" coords="155,234,348,260"/>
<area shape="poly" id="edge8_Node000000_Node000005" title=" " alt="" coords="95,192,156,221,189,231,188,236,154,225,93,197"/>
<area shape="rect" id="Node000006" href="$df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" title=" " alt="" coords="155,284,348,309"/>
<area shape="poly" id="edge9_Node000000_Node000006" title=" " alt="" coords="78,197,112,235,156,270,180,281,177,285,153,275,108,239,74,201"/>
<area shape="rect" id="Node000000" href="$d8/dab/classstatistics_1_1stats__computer2.html" title=" " alt="" coords="5,5,217,31"/>
</map>

2
inherit_graph_106.md5
View File

@@ -1 +1 @@
53ba32e546959cac79e584e353db1db7
efb55af1cccef519836d4c2436ccda42

122
inherit_graph_106.svg
View File

@@ -4,126 +4,16 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="265pt" height="236pt"
viewBox="0.00 0.00 265.00 235.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 231.88)">
<svg width="167pt" height="27pt"
viewBox="0.00 0.00 166.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="76,-111.25 0,-111.25 0,-92 76,-92 76,-111.25"/>
<text text-anchor="middle" x="38" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
</a>
</g>
</g>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="230,-227.88 139,-227.88 139,-197.38 230,-197.38 230,-227.88"/>
<text text-anchor="start" x="147" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_arithmetic</text>
<text text-anchor="middle" x="184.5" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint128_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node1 -->
<g id="edge4_Node000000_Node000001" class="edge">
<title>Node0&#45;&gt;Node1</title>
<g id="a_edge4_Node000000_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M51.12,-121.24C64.02,-140.62 86.12,-169.85 112,-187.62 120.02,-193.13 129.38,-197.55 138.63,-201.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="54.11,-119.41 45.76,-112.9 48.22,-123.2 54.11,-119.41"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="230,-178.88 139,-178.88 139,-148.38 230,-148.38 230,-178.88"/>
<text text-anchor="start" x="147" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_arithmetic</text>
<text text-anchor="middle" x="184.5" y="-154.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint256_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node2 -->
<g id="edge5_Node000000_Node000002" class="edge">
<title>Node0&#45;&gt;Node2</title>
<g id="a_edge5_Node000000_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M66.39,-117.18C79.88,-124.5 96.54,-133.05 112,-139.62 120.56,-143.26 129.87,-146.73 138.85,-149.84"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.1,-114.13 57.65,-112.36 64.72,-120.25 68.1,-114.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="253.25,-130.25 115.75,-130.25 115.75,-111 253.25,-111 253.25,-130.25"/>
<text text-anchor="middle" x="184.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_integral&lt; uint128_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node3 -->
<g id="edge6_Node000000_Node000003" class="edge">
<title>Node0&#45;&gt;Node3</title>
<g id="a_edge6_Node000000_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M87.56,-108.01C96.47,-109.18 105.92,-110.42 115.28,-111.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.08,-104.55 77.71,-106.72 87.17,-111.49 88.08,-104.55"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="253.25,-93.25 115.75,-93.25 115.75,-74 253.25,-74 253.25,-93.25"/>
<text text-anchor="middle" x="184.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_integral&lt; uint256_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node4 -->
<g id="edge7_Node000000_Node000004" class="edge">
<title>Node0&#45;&gt;Node4</title>
<g id="a_edge7_Node000000_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M87.56,-95.58C96.47,-94.47 105.92,-93.29 115.28,-92.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.2,-92.09 77.71,-96.8 88.07,-99.04 87.2,-92.09"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="257,-56.25 112,-56.25 112,-37 257,-37 257,-56.25"/>
<text text-anchor="middle" x="184.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_unsigned&lt; uint128_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node5 -->
<g id="edge8_Node000000_Node000005" class="edge">
<title>Node0&#45;&gt;Node5</title>
<g id="a_edge8_Node000000_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M66.23,-86C79.68,-78.76 96.35,-70.48 112,-64.62 120.03,-61.62 128.76,-58.96 137.26,-56.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="64.6,-82.9 57.53,-90.79 67.98,-89.03 64.6,-82.9"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="257,-19.25 112,-19.25 112,0 257,0 257,-19.25"/>
<text text-anchor="middle" x="184.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_unsigned&lt; uint256_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node6 -->
<g id="edge9_Node000000_Node000006" class="edge">
<title>Node0&#45;&gt;Node6</title>
<g id="a_edge9_Node000000_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M52.87,-82.53C66.18,-65.6 87.77,-41.48 112,-27.62 117.56,-24.45 123.67,-21.83 129.91,-19.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="50.21,-80.24 46.96,-90.32 55.79,-84.47 50.21,-80.24"/>
<g id="a_Node000000"><a xlink:href="d8/dab/classstatistics_1_1stats__computer2.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="158.5,-19.25 0,-19.25 0,0 158.5,0 158.5,-19.25"/>
<text text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2&lt; T &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.3 KiB

After

Width:  |  Height:  |  Size: 993 B

14
inherit_graph_107.map
View File

@@ -1,3 +1,15 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" title="A structure representing all the data we need to search the preprocessed pattern in text." alt="" coords="5,5,149,46"/>
<area shape="rect" id="Node000000" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="5,161,107,186"/>
<area shape="rect" id="Node000001" href="$d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" title=" " alt="" coords="191,5,312,46"/>
<area shape="poly" id="edge4_Node000000_Node000001" title=" " alt="" coords="71,146,106,101,128,77,153,57,189,39,191,44,156,61,132,81,110,104,76,149"/>
<area shape="rect" id="Node000002" href="$dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" title=" " alt="" coords="191,71,312,111"/>
<area shape="poly" id="edge5_Node000000_Node000002" title=" " alt="" coords="93,151,154,121,190,107,191,112,156,125,95,155"/>
<area shape="rect" id="Node000003" href="$d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" title=" " alt="" coords="160,136,343,161"/>
<area shape="poly" id="edge6_Node000000_Node000003" title=" " alt="" coords="122,163,159,158,159,163,122,168"/>
<area shape="rect" id="Node000004" href="$d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" title=" " alt="" coords="160,185,343,210"/>
<area shape="poly" id="edge7_Node000000_Node000004" title=" " alt="" coords="122,179,159,184,159,189,122,184"/>
<area shape="rect" id="Node000005" href="$d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" title=" " alt="" coords="155,234,348,260"/>
<area shape="poly" id="edge8_Node000000_Node000005" title=" " alt="" coords="95,192,156,221,189,231,188,236,154,225,93,197"/>
<area shape="rect" id="Node000006" href="$df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" title=" " alt="" coords="155,284,348,309"/>
<area shape="poly" id="edge9_Node000000_Node000006" title=" " alt="" coords="78,197,112,235,156,270,180,281,177,285,153,275,108,239,74,201"/>
</map>

2
inherit_graph_107.md5
View File

@@ -1 +1 @@
d6ee5f042479b5982faa79c9932e1b9c
53ba32e546959cac79e584e353db1db7

123
inherit_graph_107.svg
View File

@@ -4,17 +4,126 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="116pt" height="39pt"
viewBox="0.00 0.00 115.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<svg width="265pt" height="236pt"
viewBox="0.00 0.00 265.00 235.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 231.88)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" target="_top" xlink:title="A structure representing all the data we need to search the preprocessed pattern in text.">
<polygon fill="white" stroke="#666666" points="107.5,-30.5 0,-30.5 0,0 107.5,0 107.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
<text text-anchor="middle" x="53.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pattern</text>
<g id="a_Node000000"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="76,-111.25 0,-111.25 0,-92 76,-92 76,-111.25"/>
<text text-anchor="middle" x="38" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
</a>
</g>
</g>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="230,-227.88 139,-227.88 139,-197.38 230,-197.38 230,-227.88"/>
<text text-anchor="start" x="147" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_arithmetic</text>
<text text-anchor="middle" x="184.5" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint128_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node1 -->
<g id="edge4_Node000000_Node000001" class="edge">
<title>Node0&#45;&gt;Node1</title>
<g id="a_edge4_Node000000_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M51.12,-121.24C64.02,-140.62 86.12,-169.85 112,-187.62 120.02,-193.13 129.38,-197.55 138.63,-201.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="54.11,-119.41 45.76,-112.9 48.22,-123.2 54.11,-119.41"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="230,-178.88 139,-178.88 139,-148.38 230,-148.38 230,-178.88"/>
<text text-anchor="start" x="147" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_arithmetic</text>
<text text-anchor="middle" x="184.5" y="-154.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint256_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node2 -->
<g id="edge5_Node000000_Node000002" class="edge">
<title>Node0&#45;&gt;Node2</title>
<g id="a_edge5_Node000000_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M66.39,-117.18C79.88,-124.5 96.54,-133.05 112,-139.62 120.56,-143.26 129.87,-146.73 138.85,-149.84"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.1,-114.13 57.65,-112.36 64.72,-120.25 68.1,-114.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="253.25,-130.25 115.75,-130.25 115.75,-111 253.25,-111 253.25,-130.25"/>
<text text-anchor="middle" x="184.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_integral&lt; uint128_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node3 -->
<g id="edge6_Node000000_Node000003" class="edge">
<title>Node0&#45;&gt;Node3</title>
<g id="a_edge6_Node000000_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M87.56,-108.01C96.47,-109.18 105.92,-110.42 115.28,-111.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.08,-104.55 77.71,-106.72 87.17,-111.49 88.08,-104.55"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="253.25,-93.25 115.75,-93.25 115.75,-74 253.25,-74 253.25,-93.25"/>
<text text-anchor="middle" x="184.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_integral&lt; uint256_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node4 -->
<g id="edge7_Node000000_Node000004" class="edge">
<title>Node0&#45;&gt;Node4</title>
<g id="a_edge7_Node000000_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M87.56,-95.58C96.47,-94.47 105.92,-93.29 115.28,-92.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.2,-92.09 77.71,-96.8 88.07,-99.04 87.2,-92.09"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="257,-56.25 112,-56.25 112,-37 257,-37 257,-56.25"/>
<text text-anchor="middle" x="184.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_unsigned&lt; uint128_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node5 -->
<g id="edge8_Node000000_Node000005" class="edge">
<title>Node0&#45;&gt;Node5</title>
<g id="a_edge8_Node000000_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M66.23,-86C79.68,-78.76 96.35,-70.48 112,-64.62 120.03,-61.62 128.76,-58.96 137.26,-56.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="64.6,-82.9 57.53,-90.79 67.98,-89.03 64.6,-82.9"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="257,-19.25 112,-19.25 112,0 257,0 257,-19.25"/>
<text text-anchor="middle" x="184.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_unsigned&lt; uint256_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node6 -->
<g id="edge9_Node000000_Node000006" class="edge">
<title>Node0&#45;&gt;Node6</title>
<g id="a_edge9_Node000000_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M52.87,-82.53C66.18,-65.6 87.77,-41.48 112,-27.62 117.56,-24.45 123.67,-21.83 129.91,-19.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="50.21,-80.24 46.96,-90.32 55.79,-84.47 50.21,-80.24"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.1 KiB

After

Width:  |  Height:  |  Size: 6.3 KiB

2
inherit_graph_108.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$da/d86/struct_test_case.html" title="represents single example inputs and expected output of the function longest_common_string_length" alt="" coords="5,5,83,31"/>
<area shape="rect" id="Node000000" href="$dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" title="A structure representing all the data we need to search the preprocessed pattern in text." alt="" coords="5,5,149,46"/>
</map>

2
inherit_graph_108.md5
View File

@@ -1 +1 @@
abd7e48c602c9ba41e00a619e3234e23
d6ee5f042479b5982faa79c9932e1b9c

13
inherit_graph_108.svg
View File

@@ -4,16 +4,17 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="66pt" height="27pt"
viewBox="0.00 0.00 66.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<svg width="116pt" height="39pt"
viewBox="0.00 0.00 115.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="da/d86/struct_test_case.html" target="_top" xlink:title="represents single example inputs and expected output of the function longest_common_string_length">
<polygon fill="white" stroke="#666666" points="58,-19.25 0,-19.25 0,0 58,0 58,-19.25"/>
<text text-anchor="middle" x="29" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCase</text>
<g id="a_Node000000"><a xlink:href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" target="_top" xlink:title="A structure representing all the data we need to search the preprocessed pattern in text.">
<polygon fill="white" stroke="#666666" points="107.5,-30.5 0,-30.5 0,0 107.5,0 107.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
<text text-anchor="middle" x="53.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pattern</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.1 KiB

2
inherit_graph_109.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d5/d58/class_test_cases.html" title="class encapsulating the necessary test cases" alt="" coords="5,5,90,31"/>
<area shape="rect" id="Node000000" href="$da/d86/struct_test_case.html" title="represents single example inputs and expected output of the function longest_common_string_length" alt="" coords="5,5,83,31"/>
</map>

Some files were not shown because too many files have changed in this diff Show More