backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-10-31 12:54:53 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 821d20c33a

Browse Source
This commit is contained in:
realstealthninja
2024-10-07 13:34:57 +00:00
parent e37aaa437e
commit 969f0dcb73
244 changed files with 6091 additions and 1978 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
annotated.html
View File

@@ -197,16 +197,19 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
<tr id="row_12_3_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_12_3_" class="arrow" onclick="dynsection.toggleFolder('12_3_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>trie_operations</b></td><td class="desc"></td></tr>
<tr id="row_12_3_0_" class="odd" 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="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">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_13_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_13_" class="arrow" onclick="dynsection.toggleFolder('13_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d6f/namespaceothers.html" target="_self">others</a></td><td class="desc">For <code>vector</code> </td></tr>
<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><b>iterative_tree_traversals</b></td><td class="desc"></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="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_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="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>
<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>lru_cache</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="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">LRUCache</a></td><td class="desc">LRU cache class </td></tr>
<tr id="row_13_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_13_2_" class="arrow" onclick="dynsection.toggleFolder('13_2_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>postfix_expression</b></td><td class="desc"></td></tr>
<tr id="row_13_2_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="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_13_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_13_3_" class="arrow" onclick="dynsection.toggleFolder('13_3_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>recursive_tree_traversals</b></td><td class="desc"></td></tr>
<tr id="row_13_3_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="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" target="_self">BT</a></td><td class="desc"><a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ...">BT</a> used to make the entire structure of the binary tree and the functions associated with the binary tree </td></tr>
<tr id="row_13_3_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="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html" target="_self">Node</a></td><td class="desc">The structure to hold Nodes of the tree </td></tr>
<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_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>
<tr id="row_13_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_13_2_" class="arrow" onclick="dynsection.toggleFolder('13_2_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>lru_cache</b></td><td class="desc"></td></tr>
<tr id="row_13_2_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="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">LRUCache</a></td><td class="desc">LRU cache class </td></tr>
<tr id="row_13_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_13_3_" class="arrow" onclick="dynsection.toggleFolder('13_3_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>postfix_expression</b></td><td class="desc"></td></tr>
<tr id="row_13_3_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="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_13_4_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_13_4_" class="arrow" onclick="dynsection.toggleFolder('13_4_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>recursive_tree_traversals</b></td><td class="desc"></td></tr>
<tr id="row_13_4_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="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" target="_self">BT</a></td><td class="desc"><a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ...">BT</a> used to make the entire structure of the binary tree and the functions associated with the binary tree </td></tr>
<tr id="row_13_4_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="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html" target="_self">Node</a></td><td class="desc">The structure to hold Nodes of the tree </td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="dynsection.toggleFolder('14_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/ded/namespaceprobability.html" target="_self">probability</a></td><td class="desc">Probability algorithms </td></tr>
<tr id="row_14_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_14_0_" class="arrow" onclick="dynsection.toggleFolder('14_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>geometric_dist</b></td><td class="desc"></td></tr>
<tr id="row_14_0_0_" class="odd" 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="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html" target="_self">geometric_distribution</a></td><td class="desc">A class to model the geometric distribution </td></tr>

4
annotated_dup.js
View File

@@ -122,6 +122,10 @@ 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" ]
] ],
[ "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" ],
[ "Node", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node" ]

4
classes.html
View File

@@ -120,7 +120,7 @@ $(function(){initNavTree('classes.html',''); initResizable(true); });
<dd><a class="el" href="dc/d1f/classcatalan__numbers.html">catalan_numbers</a></dd><dd><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/d15/classcll.html">cll</a></dd><dd><a class="el" href="de/d4a/class_compare.html">Compare</a></dd><dd><a class="el" href="d1/db3/structcompare.html">compare</a></dd><dd><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">AyStarSearch::comparison_operator</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="da/d5a/class_complex.html">Complex</a></dd><dd><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)</dd><dd><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a></dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_D" name="letter_D">D</a></dt>
<dd><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> (machine_learning::neural_network::layers)</dd><dd><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a></dd><dd><a class="el" href="dd/d1f/classdsu.html">dsu</a></dd></dl>
<dd><a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a> (<a class="el" href="db/dde/namespaceothers_1_1_cache.html">others::Cache</a>)</dd><dd><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> (machine_learning::neural_network::layers)</dd><dd><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a></dd><dd><a class="el" href="dd/d1f/classdsu.html">dsu</a></dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_E" name="letter_E">E</a></dt>
<dd><a class="el" href="d1/df6/class_easter_year_month_day.html">EasterYearMonthDay</a></dd><dd><a class="el" href="d7/d77/class_edge.html">Edge</a></dd><dd><a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> (<a class="el" href="d0/d65/namespacedouble__hashing.html">double_hashing</a>)</dd><dd><a class="el" href="db/d19/structlinear__probing_1_1_entry.html">Entry</a> (<a class="el" href="d8/d89/namespacelinear__probing.html">linear_probing</a>)</dd><dd><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> (<a class="el" href="d4/dd2/namespacequadratic__probing.html">quadratic_probing</a>)</dd></dl>
@@ -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="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="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="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>
<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>

9
d0/d6f/namespaceothers.html
View File

@@ -105,6 +105,7 @@ $(function(){initNavTree('d0/d6f/namespaceothers.html','../../'); initResizable(
<div class="header">
<div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">others Namespace Reference</div></div>
</div><!--header-->
@@ -113,6 +114,12 @@ $(function(){initNavTree('d0/d6f/namespaceothers.html','../../'); initResizable(
<p>for <code>vector</code>
<a href="#details">More...</a></p>
<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="../../db/dde/namespaceothers_1_1_cache.html">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:aa17dc6d061dff34f6b9a610bc5e26703" id="r_aa17dc6d061dff34f6b9a610bc5e26703"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa17dc6d061dff34f6b9a610bc5e26703">are_almost_equal</a> (double a, double b, double absolute_tolerance=0.0001)</td></tr>
@@ -125,8 +132,8 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>for <code>vector</code> </p>
<p>for vector</p>
<p>Other algorithms.</p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a></p>
<p>Other algorithms.</p>
<p>for IO operations</p>
<p>for <code>reverse</code> for <code>assert</code> for I/O operations for <code>stack</code></p>
<p>Other algorithms</p>

1
d0/d6f/namespaceothers.js
View File

@@ -1,5 +1,6 @@
var namespaceothers =
[
[ "Cache", "db/dde/namespaceothers_1_1_cache.html", "db/dde/namespaceothers_1_1_cache" ],
[ "are_almost_equal", "d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703", null ],
[ "kelvin_to_celsius", "d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec", null ]
];

17
d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.map Normal file
View File

@@ -0,0 +1,17 @@
<map id="others::Cache::LFUCache&lt; K, V &gt;" name="others::Cache::LFUCache&lt; K, V &gt;">
<area shape="rect" id="Node000001" title="LFUCache." alt="" coords="949,77,1123,118"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map.html" title=" " alt="" coords="668,17,829,87"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="845,64,949,81,948,86,844,70"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="5,22,44,47"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="59,21,67,20,97,20,326,18,427,19,556,25,668,37,667,43,555,31,427,24,326,23,97,25,68,25,60,27"/>
<area shape="rect" id="Node000005" href="$de/d21/classothers_1_1_cache_1_1_d___node.html" title=" " alt="" coords="121,48,280,88"/>
<area shape="poly" id="edge5_Node000005_Node000003" title=" " alt="" coords="59,38,121,50,120,55,58,43"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair.html" title=" " alt="" coords="402,40,555,96"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="571,60,667,54,668,59,571,65"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="296,65,402,65,402,71,296,71"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair.html" title=" " alt="" coords="402,119,555,190"/>
<area shape="poly" id="edge8_Node000007_Node000005" title=" " alt="" coords="276,91,305,101,402,130,401,135,303,106,274,96"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map.html" title=" " alt="" coords="660,112,837,197"/>
<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="851,131,948,112,949,117,853,137"/>
<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="571,152,660,152,660,157,571,157"/>
</map>

1
d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.md5 Normal file
View File

@@ -0,0 +1 @@
6ac5b9d32a99a7471b8fdd6c74403344

253
d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg Normal file
View File

@@ -0,0 +1,253 @@
<?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.1 (20240910.0053)
-->
<!-- Title: others::Cache::LFUCache&lt; K, V &gt; Pages: 1 -->
<!--zoomable 152 -->
<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 = 846;
var viewHeight = 152;
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::LFUCache&lt; K, V &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="LFUCache.">
<polygon fill="#999999" stroke="#666666" points="838.3,-90.38 707.55,-90.38 707.55,-59.88 838.3,-59.88 838.3,-90.38"/>
<text text-anchor="start" x="715.55" y="-76.88" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="772.92" y="-65.62" 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 target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="617.92,-135.62 496.92,-135.62 496.92,-82.62 617.92,-82.62 617.92,-135.62"/>
<text text-anchor="start" x="504.92" y="-122.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
<text text-anchor="start" x="504.92" y="-110.88" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, std::pair&lt; others</text>
<text text-anchor="start" x="504.92" y="-99.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Cache::D_Node&lt; K, V</text>
<text text-anchor="middle" x="557.42" y="-88.38" font-family="Helvetica,sans-Serif" font-size="10.00"> &gt; *, int &gt; &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="M629.5,-97.81C654.63,-93.8 682.75,-89.33 707.32,-85.41"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="629,-94.34 619.68,-99.37 630.1,-101.25 629,-94.34"/>
</a>
</g>
<text text-anchor="middle" x="665.55" y="-96.92" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> node_map</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,-131.75 0,-131.75 0,-112.5 28.8,-112.5 28.8,-131.75"/>
<text text-anchor="middle" x="14.4" y="-118.25" 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="M40.4,-129.96C42.55,-130.43 44.7,-130.83 46.8,-131.12 56.37,-132.47 58.88,-131.18 68.55,-131.12 221.45,-130.24 260,-137.52 412.55,-127.12 440.3,-125.23 470.9,-121.62 496.72,-118.13"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="41.31,-126.58 30.75,-127.4 39.52,-133.35 41.31,-126.58"/>
</a>
</g>
<text text-anchor="middle" x="251.8" y="-134.53" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><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,-112.38 86.55,-112.38 86.55,-81.88 206.05,-81.88 206.05,-112.38"/>
<text text-anchor="start" x="94.55" y="-98.88" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::D_Node</text>
<text text-anchor="middle" x="146.3" y="-87.62" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
</a>
</g>
</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="M39.77,-117.44C52.98,-114.89 69.92,-111.63 86.34,-108.47"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="39.46,-113.93 30.3,-119.26 40.78,-120.8 39.46,-113.93"/>
</a>
</g>
<text text-anchor="middle" x="57.67" y="-117.17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</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/utility/pair.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="412.55,-118 297.55,-118 297.55,-76.25 412.55,-76.25 412.55,-118"/>
<text text-anchor="start" x="305.55" y="-104.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; others::</text>
<text text-anchor="start" x="305.55" y="-93.25" font-family="Helvetica,sans-Serif" font-size="10.00">Cache::D_Node&lt; K, V</text>
<text text-anchor="middle" x="355.05" y="-82" font-family="Helvetica,sans-Serif" font-size="10.00"> &gt; *, int &gt;</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node2 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node4&#45;&gt;Node2</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M424.23,-101.21C447.72,-102.61 473.83,-104.18 496.6,-105.54"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="424.64,-97.73 414.44,-100.62 424.22,-104.71 424.64,-97.73"/>
</a>
</g>
<text text-anchor="middle" x="451.92" y="-105.59" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node5&#45;&gt;Node4</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.83,-97.12C243.74,-97.12 272.73,-97.12 297.29,-97.12"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="218.06,-93.63 208.06,-97.13 218.06,-100.63 218.06,-93.63"/>
</a>
</g>
<text text-anchor="middle" x="251.8" y="-98.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> first_type</text>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="412.55,-58.62 297.55,-58.62 297.55,-5.62 412.55,-5.62 412.55,-58.62"/>
<text text-anchor="start" x="305.55" y="-45.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; others::</text>
<text text-anchor="start" x="305.55" y="-33.88" font-family="Helvetica,sans-Serif" font-size="10.00">Cache::D_Node&lt; K, V</text>
<text text-anchor="start" x="305.55" y="-22.62" font-family="Helvetica,sans-Serif" font-size="10.00"> &gt; *, others::Cache::</text>
<text text-anchor="middle" x="355.05" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">D_Node&lt; K, V &gt; * &gt;</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node7 -->
<g id="edge8_Node000007_Node000005" class="edge">
<title>Node5&#45;&gt;Node7</title>
<g id="a_edge8_Node000007_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M202.09,-77.88C209.46,-75.38 216.92,-72.91 224.05,-70.62 247.92,-62.97 274.43,-55.02 297.25,-48.35"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="201.19,-74.48 192.86,-81.02 203.45,-81.11 201.19,-74.48"/>
</a>
</g>
<text text-anchor="middle" x="251.8" y="-83.62" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> first_type</text>
<text text-anchor="middle" x="251.8" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">second_type</text>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="623.55,-64.25 491.3,-64.25 491.3,0 623.55,0 623.55,-64.25"/>
<text text-anchor="start" x="499.3" y="-50.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
<text text-anchor="start" x="499.3" y="-39.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int, std::pair&lt; others</text>
<text text-anchor="start" x="499.3" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">::Cache::D_Node&lt; K, V &gt;</text>
<text text-anchor="start" x="499.3" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00"> *, others::Cache::D_Node</text>
<text text-anchor="middle" x="557.42" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt; * &gt; &gt;</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node1 -->
<g id="edge6_Node000001_Node000006" class="edge">
<title>Node6&#45;&gt;Node1</title>
<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M635,-47.55C658.67,-52.31 684.49,-57.52 707.27,-62.1"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="635.91,-44.16 625.42,-45.62 634.53,-51.02 635.91,-44.16"/>
</a>
</g>
<text text-anchor="middle" x="665.55" y="-59.23" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> freq_map</text>
</g>
<!-- Node7&#45;&gt;Node6 -->
<g id="edge7_Node000006_Node000007" class="edge">
<title>Node7&#45;&gt;Node6</title>
<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M424.3,-32.12C445.84,-32.12 469.57,-32.12 490.91,-32.12"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="424.45,-28.63 414.45,-32.13 424.45,-35.63 424.45,-28.63"/>
</a>
</g>
<text text-anchor="middle" x="451.92" y="-33.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</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_f_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: 14 KiB

170
d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg Normal file
View File

@@ -0,0 +1,170 @@
<?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.1 (20240910.0053)
-->
<!-- Title: others::Cache::LFUCache&lt; K, V &gt; Pages: 1 -->
<svg width="846pt" height="152pt"
viewBox="0.00 0.00 846.30 152.03" 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 148.03)">
<title>others::Cache::LFUCache&lt; K, V &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="LFUCache.">
<polygon fill="#999999" stroke="#666666" points="838.3,-90.38 707.55,-90.38 707.55,-59.88 838.3,-59.88 838.3,-90.38"/>
<text text-anchor="start" x="715.55" y="-76.88" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="772.92" y="-65.62" 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 target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="617.92,-135.62 496.92,-135.62 496.92,-82.62 617.92,-82.62 617.92,-135.62"/>
<text text-anchor="start" x="504.92" y="-122.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
<text text-anchor="start" x="504.92" y="-110.88" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, std::pair&lt; others</text>
<text text-anchor="start" x="504.92" y="-99.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Cache::D_Node&lt; K, V</text>
<text text-anchor="middle" x="557.42" y="-88.38" font-family="Helvetica,sans-Serif" font-size="10.00"> &gt; *, int &gt; &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="M629.5,-97.81C654.63,-93.8 682.75,-89.33 707.32,-85.41"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="629,-94.34 619.68,-99.37 630.1,-101.25 629,-94.34"/>
</a>
</g>
<text text-anchor="middle" x="665.55" y="-96.92" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> node_map</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,-131.75 0,-131.75 0,-112.5 28.8,-112.5 28.8,-131.75"/>
<text text-anchor="middle" x="14.4" y="-118.25" 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="M40.4,-129.96C42.55,-130.43 44.7,-130.83 46.8,-131.12 56.37,-132.47 58.88,-131.18 68.55,-131.12 221.45,-130.24 260,-137.52 412.55,-127.12 440.3,-125.23 470.9,-121.62 496.72,-118.13"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="41.31,-126.58 30.75,-127.4 39.52,-133.35 41.31,-126.58"/>
</a>
</g>
<text text-anchor="middle" x="251.8" y="-134.53" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><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,-112.38 86.55,-112.38 86.55,-81.88 206.05,-81.88 206.05,-112.38"/>
<text text-anchor="start" x="94.55" y="-98.88" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::D_Node</text>
<text text-anchor="middle" x="146.3" y="-87.62" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
</a>
</g>
</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="M39.77,-117.44C52.98,-114.89 69.92,-111.63 86.34,-108.47"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="39.46,-113.93 30.3,-119.26 40.78,-120.8 39.46,-113.93"/>
</a>
</g>
<text text-anchor="middle" x="57.67" y="-117.17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</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/utility/pair.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="412.55,-118 297.55,-118 297.55,-76.25 412.55,-76.25 412.55,-118"/>
<text text-anchor="start" x="305.55" y="-104.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; others::</text>
<text text-anchor="start" x="305.55" y="-93.25" font-family="Helvetica,sans-Serif" font-size="10.00">Cache::D_Node&lt; K, V</text>
<text text-anchor="middle" x="355.05" y="-82" font-family="Helvetica,sans-Serif" font-size="10.00"> &gt; *, int &gt;</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node2 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node4&#45;&gt;Node2</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M424.23,-101.21C447.72,-102.61 473.83,-104.18 496.6,-105.54"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="424.64,-97.73 414.44,-100.62 424.22,-104.71 424.64,-97.73"/>
</a>
</g>
<text text-anchor="middle" x="451.92" y="-105.59" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node5&#45;&gt;Node4</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.83,-97.12C243.74,-97.12 272.73,-97.12 297.29,-97.12"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="218.06,-93.63 208.06,-97.13 218.06,-100.63 218.06,-93.63"/>
</a>
</g>
<text text-anchor="middle" x="251.8" y="-98.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> first_type</text>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="412.55,-58.62 297.55,-58.62 297.55,-5.62 412.55,-5.62 412.55,-58.62"/>
<text text-anchor="start" x="305.55" y="-45.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; others::</text>
<text text-anchor="start" x="305.55" y="-33.88" font-family="Helvetica,sans-Serif" font-size="10.00">Cache::D_Node&lt; K, V</text>
<text text-anchor="start" x="305.55" y="-22.62" font-family="Helvetica,sans-Serif" font-size="10.00"> &gt; *, others::Cache::</text>
<text text-anchor="middle" x="355.05" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">D_Node&lt; K, V &gt; * &gt;</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node7 -->
<g id="edge8_Node000007_Node000005" class="edge">
<title>Node5&#45;&gt;Node7</title>
<g id="a_edge8_Node000007_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M202.09,-77.88C209.46,-75.38 216.92,-72.91 224.05,-70.62 247.92,-62.97 274.43,-55.02 297.25,-48.35"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="201.19,-74.48 192.86,-81.02 203.45,-81.11 201.19,-74.48"/>
</a>
</g>
<text text-anchor="middle" x="251.8" y="-83.62" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> first_type</text>
<text text-anchor="middle" x="251.8" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">second_type</text>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="623.55,-64.25 491.3,-64.25 491.3,0 623.55,0 623.55,-64.25"/>
<text text-anchor="start" x="499.3" y="-50.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
<text text-anchor="start" x="499.3" y="-39.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int, std::pair&lt; others</text>
<text text-anchor="start" x="499.3" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">::Cache::D_Node&lt; K, V &gt;</text>
<text text-anchor="start" x="499.3" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00"> *, others::Cache::D_Node</text>
<text text-anchor="middle" x="557.42" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt; * &gt; &gt;</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node1 -->
<g id="edge6_Node000001_Node000006" class="edge">
<title>Node6&#45;&gt;Node1</title>
<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M635,-47.55C658.67,-52.31 684.49,-57.52 707.27,-62.1"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="635.91,-44.16 625.42,-45.62 634.53,-51.02 635.91,-44.16"/>
</a>
</g>
<text text-anchor="middle" x="665.55" y="-59.23" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> freq_map</text>
</g>
<!-- Node7&#45;&gt;Node6 -->
<g id="edge7_Node000006_Node000007" class="edge">
<title>Node7&#45;&gt;Node6</title>
<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M424.3,-32.12C445.84,-32.12 469.57,-32.12 490.91,-32.12"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="424.45,-28.63 414.45,-32.13 424.45,-35.63 424.45,-28.63"/>
</a>
</g>
<text text-anchor="middle" x="451.92" y="-33.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 9.8 KiB

126
d5/ddb/classothers_1_1_cache_1_1_d___node-members.html Normal file
View File

@@ -0,0 +1,126 @@
<!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('de/d21/classothers_1_1_cache_1_1_d___node.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::D_Node&lt; T &gt; Member List</div></div>
</div><!--header-->
<div class="contents">
<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>
</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>

2
d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html
View File

@@ -146,7 +146,7 @@ uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>pageFrame</b></td
<tr class="separator:a1aafd0444b410e0fcb66287e9954c893"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3ee3560a6b90e6f50f6e063d690ba8e8" id="r_a3ee3560a6b90e6f50f6e063d690ba8e8"><td class="memItemLeft" align="right" valign="top"><a id="a3ee3560a6b90e6f50f6e063d690ba8e8" name="a3ee3560a6b90e6f50f6e063d690ba8e8"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>cache</b></td></tr>
<tr class="memdesc:a3ee3560a6b90e6f50f6e063d690ba8e8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Cache linked list (using the STL) <br /></td></tr>
<tr class="memdesc:a3ee3560a6b90e6f50f6e063d690ba8e8"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../db/dde/namespaceothers_1_1_cache.html" title="Cache algorithm.">Cache</a> linked list (using the STL) <br /></td></tr>
<tr class="separator:a3ee3560a6b90e6f50f6e063d690ba8e8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa4d6db56109af196ffc7e5f72bc9907c" id="r_aa4d6db56109af196ffc7e5f72bc9907c"><td class="memItemLeft" align="right" valign="top"><a id="aa4d6db56109af196ffc7e5f72bc9907c" name="aa4d6db56109af196ffc7e5f72bc9907c"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; uint64_t, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; uint64_t &gt;::iterator &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>pageMap</b></td></tr>

9
d6/dca/lfu__cache_8cpp__incl.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="others/lfu_cache.cpp" name="others/lfu_cache.cpp">
<area shape="rect" id="Node000001" title="Implementation for [LFU Cache] (https://en.wikipedia.org/wiki/Least_frequently_used)" alt="" coords="58,5,201,31"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,79,70,105"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="116,34,66,72,63,67,112,29"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="94,79,165,105"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="132,31,132,63,127,63,127,31"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="189,79,299,105"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="150,29,213,68,210,73,148,34"/>
</map>

1
d6/dca/lfu__cache_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
08f5951acd7232c48a62c9afc57379b1

101
d6/dca/lfu__cache_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,101 @@
<?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.1 (20240910.0053)
-->
<!-- Title: others/lfu_cache.cpp Pages: 1 -->
<svg width="229pt" height="83pt"
viewBox="0.00 0.00 228.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/lfu_cache.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Implementation for [LFU Cache] (https://en.wikipedia.org/wiki/Least_frequently_used)">
<polygon fill="#999999" stroke="#666666" points="146.5,-74.5 39.75,-74.5 39.75,-55.25 146.5,-55.25 146.5,-74.5"/>
<text text-anchor="middle" x="93.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">others/lfu_cache.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="M81.42,-54.84C71.35,-47.07 56.58,-35.67 44.56,-26.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="46.91,-23.79 36.86,-20.45 42.63,-29.33 46.91,-23.79"/>
</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="119.88,-19.25 66.38,-19.25 66.38,0 119.88,0 119.88,-19.25"/>
<text text-anchor="middle" x="93.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</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="M93.12,-55.08C93.12,-48.57 93.12,-39.42 93.12,-31.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.63,-31.12 93.13,-21.12 89.63,-31.12 96.63,-31.12"/>
</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="220.5,-19.25 137.75,-19.25 137.75,0 220.5,0 220.5,-19.25"/>
<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">unordered_map</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="M107.71,-54.84C120.56,-46.89 139.54,-35.14 154.7,-25.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.52,-28.74 163.18,-20.5 152.83,-22.79 156.52,-28.74"/>
</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.9 KiB

75
d6/dca/lfu__cache_8cpp__incl_org.svg Normal file
View File

@@ -0,0 +1,75 @@
<?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.1 (20240910.0053)
-->
<!-- Title: others/lfu_cache.cpp Pages: 1 -->
<svg width="229pt" height="83pt"
viewBox="0.00 0.00 228.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/lfu_cache.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Implementation for [LFU Cache] (https://en.wikipedia.org/wiki/Least_frequently_used)">
<polygon fill="#999999" stroke="#666666" points="146.5,-74.5 39.75,-74.5 39.75,-55.25 146.5,-55.25 146.5,-74.5"/>
<text text-anchor="middle" x="93.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">others/lfu_cache.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="M81.42,-54.84C71.35,-47.07 56.58,-35.67 44.56,-26.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="46.91,-23.79 36.86,-20.45 42.63,-29.33 46.91,-23.79"/>
</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="119.88,-19.25 66.38,-19.25 66.38,0 119.88,0 119.88,-19.25"/>
<text text-anchor="middle" x="93.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</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="M93.12,-55.08C93.12,-48.57 93.12,-39.42 93.12,-31.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.63,-31.12 93.13,-21.12 89.63,-31.12 96.63,-31.12"/>
</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="220.5,-19.25 137.75,-19.25 137.75,0 220.5,0 220.5,-19.25"/>
<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">unordered_map</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="M107.71,-54.84C120.56,-46.89 139.54,-35.14 154.7,-25.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.52,-28.74 163.18,-20.5 152.83,-22.79 156.52,-28.74"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.1 KiB

290
d9/d65/lfu__cache_8cpp.html Normal file
View File

@@ -0,0 +1,290 @@
<!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/lfu_cache.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('d9/d65/lfu__cache_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="#typedef-members">Typedefs</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">lfu_cache.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Implementation for [LFU Cache] (<a href="https://en.wikipedia.org/wiki/Least_frequently_used">https://en.wikipedia.org/wiki/Least_frequently_used</a>)
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&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 lfu_cache.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dca/lfu__cache_8cpp__incl.svg" width="306" 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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&lt; K, V &gt;</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>
</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="typedef-members" name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr class="memitem:a5c0dfbf62803f020205076c3da18d058" id="r_a5c0dfbf62803f020205076c3da18d058"><td class="memTemplParams" colspan="2"><a id="a5c0dfbf62803f020205076c3da18d058" name="a5c0dfbf62803f020205076c3da18d058"></a>
template&lt;typename K , typename V &gt; </td></tr>
<tr class="memitem:a5c0dfbf62803f020205076c3da18d058"><td class="memTemplItemLeft" align="right" valign="top">using&#160;</td><td class="memTemplItemRight" valign="bottom"><b>others::Cache::CacheNode</b> = <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt;K, V&gt;&gt;</td></tr>
<tr class="separator:a5c0dfbf62803f020205076c3da18d058"><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 implementation <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 [LFU Cache] (<a href="https://en.wikipedia.org/wiki/Least_frequently_used">https://en.wikipedia.org/wiki/Least_frequently_used</a>) </p>
<p>LFU discards the least frequently used value. if there are multiple items with the same minimum frequency then, the least recently used among them is discarded. Data structures used - doubly linked list and unordered_map(hash
map).</p>
<p>Hashmap maps the key to the address of the node of the linked list and its current usage frequency. If the element is accessed the element is removed from the linked list of the current frequency and added to the linked list of incremented frequency.</p>
<p>When the cache is full, the last element in the minimum frequency 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"> 301</span> {</div>
<div class="line"><span class="lineno"> 302</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"> 303</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 304</span>}</div>
<div class="ttc" id="alfu__cache_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:250</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="../../d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="511"><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 implementation </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 250</span> {</div>
<div class="line"><span class="lineno"> 251</span> <a class="code hl_class" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&lt;int, int&gt;</a> cache(5);</div>
<div class="line"><span class="lineno"> 252</span> </div>
<div class="line"><span class="lineno"> 253</span> <span class="comment">// test the initial state of the cache</span></div>
<div class="line"><span class="lineno"> 254</span> assert(cache.size() == 0);</div>
<div class="line"><span class="lineno"> 255</span> assert(cache.capacity() == 5);</div>
<div class="line"><span class="lineno"> 256</span> assert(cache.empty());</div>
<div class="line"><span class="lineno"> 257</span> </div>
<div class="line"><span class="lineno"> 258</span> <span class="comment">// test insertion in the cache</span></div>
<div class="line"><span class="lineno"> 259</span> cache.put(1, 10);</div>
<div class="line"><span class="lineno"> 260</span> cache.put(-2, 20);</div>
<div class="line"><span class="lineno"> 261</span> </div>
<div class="line"><span class="lineno"> 262</span> <span class="comment">// test the state of cache after inserting some items</span></div>
<div class="line"><span class="lineno"> 263</span> assert(cache.size() == 2);</div>
<div class="line"><span class="lineno"> 264</span> assert(cache.capacity() == 5);</div>
<div class="line"><span class="lineno"> 265</span> assert(!cache.empty());</div>
<div class="line"><span class="lineno"> 266</span> </div>
<div class="line"><span class="lineno"> 267</span> <span class="comment">// test getting items from the cache</span></div>
<div class="line"><span class="lineno"> 268</span> assert(cache.get(1) == 10);</div>
<div class="line"><span class="lineno"> 269</span> assert(cache.get(-2) == 20);</div>
<div class="line"><span class="lineno"> 270</span> </div>
<div class="line"><span class="lineno"> 271</span> cache.put(-3, -30);</div>
<div class="line"><span class="lineno"> 272</span> cache.put(4, 40);</div>
<div class="line"><span class="lineno"> 273</span> cache.put(5, -50);</div>
<div class="line"><span class="lineno"> 274</span> cache.put(6, 60);</div>
<div class="line"><span class="lineno"> 275</span> </div>
<div class="line"><span class="lineno"> 276</span> <span class="comment">// test the state after inserting more items than the capacity</span></div>
<div class="line"><span class="lineno"> 277</span> assert(cache.size() == 5);</div>
<div class="line"><span class="lineno"> 278</span> assert(cache.capacity() == 5);</div>
<div class="line"><span class="lineno"> 279</span> assert(!cache.empty());</div>
<div class="line"><span class="lineno"> 280</span> </div>
<div class="line"><span class="lineno"> 281</span> <span class="comment">// test retrieval of all items in the cache</span></div>
<div class="line"><span class="lineno"> 282</span> assert(cache.get(1) == 10);</div>
<div class="line"><span class="lineno"> 283</span> assert(cache.get(-2) == 20);</div>
<div class="line"><span class="lineno"> 284</span> </div>
<div class="line"><span class="lineno"> 285</span> <span class="comment">// fetching -3 throws runtime_error</span></div>
<div class="line"><span class="lineno"> 286</span> <span class="comment">// as -3 was evicted being the least frequently used</span></div>
<div class="line"><span class="lineno"> 287</span> <span class="comment">// when 6 was added</span></div>
<div class="line"><span class="lineno"> 288</span> <span class="comment">// assert(cache.get(-3) == -30);</span></div>
<div class="line"><span class="lineno"> 289</span> </div>
<div class="line"><span class="lineno"> 290</span> assert(cache.get(4) == 40);</div>
<div class="line"><span class="lineno"> 291</span> assert(cache.get(5) == -50);</div>
<div class="line"><span class="lineno"> 292</span> assert(cache.get(6) == 60);</div>
<div class="line"><span class="lineno"> 293</span> </div>
<div class="line"><span class="lineno"> 294</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"> 295</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="aclassothers_1_1_cache_1_1_l_f_u_cache_html"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a></div><div class="ttdoc">LFUCache.</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:64</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="../../d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="511"><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="../../d9/d65/lfu__cache_8cpp.html">lfu_cache.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
d9/d65/lfu__cache_8cpp.js Normal file
View File

@@ -0,0 +1,7 @@
var lfu__cache_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::LFUCache< K, V >", "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" ],
[ "main", "d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "test", "d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
];

21
d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map Normal file
View File

@@ -0,0 +1,21 @@
<map id="test" name="test">
<area shape="rect" id="Node000001" title="self test implementation" alt="" coords="5,136,49,161"/>
<area shape="rect" id="Node000002" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c" title="Returns the total capacity of the cache." alt="" coords="110,5,284,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="33,134,57,96,74,75,95,57,103,51,106,56,98,61,78,79,61,99,37,137"/>
<area shape="rect" id="Node000003" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0" title="returns true if the cache is empty, false otherwise." alt="" coords="110,71,284,111"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,138,96,120,114,114,116,119,98,126,50,143"/>
<area shape="rect" id="Node000004" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781" title="get the value of the key&#45;value pair if exists" alt="" coords="97,136,297,161"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,146,81,146,81,151,49,151"/>
<area shape="rect" id="Node000007" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e" title="upsert a key&#45;value pair" alt="" coords="97,185,297,210"/>
<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="50,154,97,171,121,178,120,183,96,176,48,159"/>
<area shape="rect" id="Node000009" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195" title="Returns the number of items present in the cache." alt="" coords="110,235,284,275"/>
<area shape="poly" id="edge10_Node000001_Node000009" title=" " alt="" coords="39,160,63,190,98,221,106,225,103,230,95,225,60,194,35,163"/>
<area shape="rect" id="Node000005" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" title="increase the frequency of node and push it in the respective list." alt="" coords="360,124,534,165"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="298,144,344,143,344,149,298,149"/>
<area shape="rect" id="Node000006" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" title="push the node at first position in the linked list of given frequency" alt="" coords="596,153,771,194"/>
<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="534,152,581,158,581,164,534,158"/>
<area shape="poly" id="edge7_Node000007_Node000005" title=" " alt="" coords="260,182,344,163,345,169,261,187"/>
<area shape="poly" id="edge9_Node000007_Node000006" title=" " alt="" coords="297,190,580,176,581,181,297,195"/>
<area shape="rect" id="Node000008" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" title="pop the last node in the least frequently used linked list" alt="" coords="345,240,548,265"/>
<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="259,208,370,233,369,238,258,214"/>
</map>

1
d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
0591dc07f3e2271183514438a924765e

271
d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg Normal file
View File

@@ -0,0 +1,271 @@
<?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.1 (20240910.0053)
-->
<!-- Title: test Pages: 1 -->
<!--zoomable 211 -->
<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 = 582;
var viewHeight = 211;
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 implementation">
<polygon fill="#999999" stroke="#666666" points="32.5,-104.88 0,-104.88 0,-85.62 32.5,-85.62 32.5,-104.88"/>
<text text-anchor="middle" x="16.25" y="-91.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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c" target="_top" xlink:title="Returns the total capacity of the cache.">
<polygon fill="white" stroke="#666666" points="209,-202.5 78.25,-202.5 78.25,-172 209,-172 209,-202.5"/>
<text text-anchor="start" x="86.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="143.62" y="-177.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="M22.19,-104.92C30.07,-119.41 46.83,-146.73 68.5,-162.25 70.44,-163.64 72.46,-164.96 74.55,-166.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.87,-169.28 83.35,-170.84 76.14,-163.08 72.87,-169.28"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0" target="_top" xlink:title="returns true if the cache is empty, false otherwise.">
<polygon fill="white" stroke="#666666" points="209,-153.5 78.25,-153.5 78.25,-123 209,-123 209,-153.5"/>
<text text-anchor="start" x="86.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="143.62" y="-128.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="M32.89,-101.24C43.01,-105.07 56.49,-110.08 68.5,-114.25 72.96,-115.8 77.57,-117.37 82.23,-118.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.06,-122.23 91.65,-122.05 83.26,-115.58 81.06,-122.23"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
<polygon fill="white" stroke="#666666" points="218.75,-104.88 68.5,-104.88 68.5,-85.62 218.75,-85.62 218.75,-104.88"/>
<text text-anchor="middle" x="143.62" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::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.88,-95.25C39.5,-95.25 47.78,-95.25 56.81,-95.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.61,-98.75 66.61,-95.25 56.61,-91.75 56.61,-98.75"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e" target="_top" xlink:title="upsert a key&#45;value pair">
<polygon fill="white" stroke="#666666" points="218.75,-67.88 68.5,-67.88 68.5,-48.62 218.75,-48.62 218.75,-67.88"/>
<text text-anchor="middle" x="143.62" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::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.79,-88.95C42.87,-85 56.34,-79.97 68.5,-76.25 74.28,-74.48 80.35,-72.78 86.43,-71.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.04,-74.62 95.85,-68.74 85.3,-67.84 87.04,-74.62"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195" target="_top" xlink:title="Returns the number of items present in the cache.">
<polygon fill="white" stroke="#666666" points="209,-30.5 78.25,-30.5 78.25,0 209,0 209,-30.5"/>
<text text-anchor="start" x="86.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="143.62" y="-5.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="M23.72,-85.51C32.47,-73.07 49.21,-51.65 68.5,-39.25 70.33,-38.07 72.23,-36.94 74.18,-35.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.45,-39.14 82.87,-31.58 72.36,-32.86 75.45,-39.14"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
<polygon fill="white" stroke="#666666" points="396.38,-113.5 265.62,-113.5 265.62,-83 396.38,-83 396.38,-113.5"/>
<text text-anchor="start" x="273.62" y="-100" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="331" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</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="M219.22,-96.46C230.69,-96.64 242.55,-96.83 254.04,-97.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="253.83,-100.52 263.88,-97.18 253.94,-93.52 253.83,-100.52"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
<polygon fill="white" stroke="#666666" points="574,-91.5 443.25,-91.5 443.25,-61 574,-61 574,-91.5"/>
<text text-anchor="start" x="451.25" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="508.62" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</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="M396.4,-90.18C407.9,-88.74 419.98,-87.23 431.76,-85.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="431.95,-89.26 441.44,-84.54 431.08,-82.31 431.95,-89.26"/>
</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="M191.4,-68.34C210.49,-72.46 233.06,-77.33 254.38,-81.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="253.39,-85.3 263.9,-83.99 254.87,-78.46 253.39,-85.3"/>
</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="M218.96,-61.94C280.96,-65.01 368.95,-69.37 431.45,-72.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="431.14,-75.96 441.3,-72.96 431.49,-68.97 431.14,-75.96"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" target="_top" xlink:title="pop the last node in the least frequently used linked list">
<polygon fill="white" stroke="#666666" points="407.25,-26.88 254.75,-26.88 254.75,-7.62 407.25,-7.62 407.25,-26.88"/>
<text text-anchor="middle" x="331" y="-13.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::pop</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="M189.97,-48.22C215.11,-42.66 246.59,-35.7 273.34,-29.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="273.99,-33.22 283,-27.65 272.48,-26.39 273.99,-33.22"/>
</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="lfu__cache_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: 13 KiB

188
d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg Normal file
View File

@@ -0,0 +1,188 @@
<?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.1 (20240910.0053)
-->
<!-- Title: test Pages: 1 -->
<svg width="582pt" height="211pt"
viewBox="0.00 0.00 582.00 210.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 206.5)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="self test implementation">
<polygon fill="#999999" stroke="#666666" points="32.5,-104.88 0,-104.88 0,-85.62 32.5,-85.62 32.5,-104.88"/>
<text text-anchor="middle" x="16.25" y="-91.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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c" target="_top" xlink:title="Returns the total capacity of the cache.">
<polygon fill="white" stroke="#666666" points="209,-202.5 78.25,-202.5 78.25,-172 209,-172 209,-202.5"/>
<text text-anchor="start" x="86.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="143.62" y="-177.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="M22.19,-104.92C30.07,-119.41 46.83,-146.73 68.5,-162.25 70.44,-163.64 72.46,-164.96 74.55,-166.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.87,-169.28 83.35,-170.84 76.14,-163.08 72.87,-169.28"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0" target="_top" xlink:title="returns true if the cache is empty, false otherwise.">
<polygon fill="white" stroke="#666666" points="209,-153.5 78.25,-153.5 78.25,-123 209,-123 209,-153.5"/>
<text text-anchor="start" x="86.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="143.62" y="-128.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="M32.89,-101.24C43.01,-105.07 56.49,-110.08 68.5,-114.25 72.96,-115.8 77.57,-117.37 82.23,-118.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.06,-122.23 91.65,-122.05 83.26,-115.58 81.06,-122.23"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
<polygon fill="white" stroke="#666666" points="218.75,-104.88 68.5,-104.88 68.5,-85.62 218.75,-85.62 218.75,-104.88"/>
<text text-anchor="middle" x="143.62" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::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.88,-95.25C39.5,-95.25 47.78,-95.25 56.81,-95.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.61,-98.75 66.61,-95.25 56.61,-91.75 56.61,-98.75"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e" target="_top" xlink:title="upsert a key&#45;value pair">
<polygon fill="white" stroke="#666666" points="218.75,-67.88 68.5,-67.88 68.5,-48.62 218.75,-48.62 218.75,-67.88"/>
<text text-anchor="middle" x="143.62" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::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.79,-88.95C42.87,-85 56.34,-79.97 68.5,-76.25 74.28,-74.48 80.35,-72.78 86.43,-71.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.04,-74.62 95.85,-68.74 85.3,-67.84 87.04,-74.62"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195" target="_top" xlink:title="Returns the number of items present in the cache.">
<polygon fill="white" stroke="#666666" points="209,-30.5 78.25,-30.5 78.25,0 209,0 209,-30.5"/>
<text text-anchor="start" x="86.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="143.62" y="-5.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="M23.72,-85.51C32.47,-73.07 49.21,-51.65 68.5,-39.25 70.33,-38.07 72.23,-36.94 74.18,-35.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.45,-39.14 82.87,-31.58 72.36,-32.86 75.45,-39.14"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
<polygon fill="white" stroke="#666666" points="396.38,-113.5 265.62,-113.5 265.62,-83 396.38,-83 396.38,-113.5"/>
<text text-anchor="start" x="273.62" y="-100" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="331" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</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="M219.22,-96.46C230.69,-96.64 242.55,-96.83 254.04,-97.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="253.83,-100.52 263.88,-97.18 253.94,-93.52 253.83,-100.52"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
<polygon fill="white" stroke="#666666" points="574,-91.5 443.25,-91.5 443.25,-61 574,-61 574,-91.5"/>
<text text-anchor="start" x="451.25" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="508.62" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</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="M396.4,-90.18C407.9,-88.74 419.98,-87.23 431.76,-85.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="431.95,-89.26 441.44,-84.54 431.08,-82.31 431.95,-89.26"/>
</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="M191.4,-68.34C210.49,-72.46 233.06,-77.33 254.38,-81.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="253.39,-85.3 263.9,-83.99 254.87,-78.46 253.39,-85.3"/>
</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="M218.96,-61.94C280.96,-65.01 368.95,-69.37 431.45,-72.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="431.14,-75.96 441.3,-72.96 431.49,-68.97 431.14,-75.96"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" target="_top" xlink:title="pop the last node in the least frequently used linked list">
<polygon fill="white" stroke="#666666" points="407.25,-26.88 254.75,-26.88 254.75,-7.62 407.25,-7.62 407.25,-26.88"/>
<text text-anchor="middle" x="331" y="-13.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::pop</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="M189.97,-48.22C215.11,-42.66 246.59,-35.7 273.34,-29.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="273.99,-33.22 283,-27.65 272.48,-26.39 273.99,-33.22"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 9.6 KiB

23
d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@@ -0,0 +1,23 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="main function" alt="" coords="5,136,55,161"/>
<area shape="rect" id="Node000002" href="$d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="self test implementation" alt="" coords="103,136,146,161"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,146,87,146,87,151,55,151"/>
<area shape="rect" id="Node000003" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c" title="Returns the total capacity of the cache." alt="" coords="207,5,381,46"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="130,134,154,96,172,75,192,57,201,51,204,56,196,61,176,79,158,99,135,137"/>
<area shape="rect" id="Node000004" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0" title="returns true if the cache is empty, false otherwise." alt="" coords="207,71,381,111"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,138,193,120,211,114,213,119,195,126,147,143"/>
<area shape="rect" id="Node000005" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781" title="get the value of the key&#45;value pair if exists" alt="" coords="194,136,394,161"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,146,178,146,178,151,147,151"/>
<area shape="rect" id="Node000008" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e" title="upsert a key&#45;value pair" alt="" coords="194,185,394,210"/>
<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="147,154,195,171,219,178,217,183,193,176,145,159"/>
<area shape="rect" id="Node000010" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195" title="Returns the number of items present in the cache." alt="" coords="207,235,381,275"/>
<area shape="poly" id="edge11_Node000002_Node000010" title=" " alt="" coords="136,160,161,190,196,221,203,225,200,230,192,225,157,194,132,163"/>
<area shape="rect" id="Node000006" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" title="increase the frequency of node and push it in the respective list." alt="" coords="457,124,631,165"/>
<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="395,144,441,143,441,149,395,149"/>
<area shape="rect" id="Node000007" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" title="push the node at first position in the linked list of given frequency" alt="" coords="694,153,868,194"/>
<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="632,152,679,158,678,164,631,158"/>
<area shape="poly" id="edge8_Node000008_Node000006" title=" " alt="" coords="357,182,441,163,442,169,358,187"/>
<area shape="poly" id="edge10_Node000008_Node000007" title=" " alt="" coords="394,190,678,176,678,181,395,195"/>
<area shape="rect" id="Node000009" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" title="pop the last node in the least frequently used linked list" alt="" coords="442,240,646,265"/>
<area shape="poly" id="edge9_Node000008_Node000009" title=" " alt="" coords="357,208,468,233,467,238,355,214"/>
</map>

1
d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
d353b232a9a0af8fc1835fc904dbe96e

289
d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@@ -0,0 +1,289 @@
<?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.1 (20240910.0053)
-->
<!-- Title: main Pages: 1 -->
<!--zoomable 211 -->
<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 = 655;
var viewHeight = 211;
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,-104.88 0,-104.88 0,-85.62 37,-85.62 37,-104.88"/>
<text text-anchor="middle" x="18.5" y="-91.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="../../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="self test implementation">
<polygon fill="white" stroke="#666666" points="105.5,-104.88 73,-104.88 73,-85.62 105.5,-85.62 105.5,-104.88"/>
<text text-anchor="middle" x="89.25" y="-91.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,-95.25C44.58,-95.25 53.31,-95.25 61.45,-95.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-98.75 71.2,-95.25 61.2,-91.75 61.2,-98.75"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c" target="_top" xlink:title="Returns the total capacity of the cache.">
<polygon fill="white" stroke="#666666" points="282,-202.5 151.25,-202.5 151.25,-172 282,-172 282,-202.5"/>
<text text-anchor="start" x="159.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="216.62" y="-177.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="M95.19,-104.92C103.07,-119.41 119.83,-146.73 141.5,-162.25 143.44,-163.64 145.46,-164.96 147.55,-166.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.87,-169.28 156.35,-170.84 149.14,-163.08 145.87,-169.28"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0" target="_top" xlink:title="returns true if the cache is empty, false otherwise.">
<polygon fill="white" stroke="#666666" points="282,-153.5 151.25,-153.5 151.25,-123 282,-123 282,-153.5"/>
<text text-anchor="start" x="159.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="216.62" y="-128.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="M105.89,-101.24C116.01,-105.07 129.49,-110.08 141.5,-114.25 145.96,-115.8 150.57,-117.37 155.23,-118.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.06,-122.23 164.65,-122.05 156.26,-115.58 154.06,-122.23"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
<polygon fill="white" stroke="#666666" points="291.75,-104.88 141.5,-104.88 141.5,-85.62 291.75,-85.62 291.75,-104.88"/>
<text text-anchor="middle" x="216.62" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::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.88,-95.25C112.5,-95.25 120.78,-95.25 129.81,-95.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="129.61,-98.75 139.61,-95.25 129.61,-91.75 129.61,-98.75"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e" target="_top" xlink:title="upsert a key&#45;value pair">
<polygon fill="white" stroke="#666666" points="291.75,-67.88 141.5,-67.88 141.5,-48.62 291.75,-48.62 291.75,-67.88"/>
<text text-anchor="middle" x="216.62" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::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.79,-88.95C115.87,-85 129.34,-79.97 141.5,-76.25 147.28,-74.48 153.35,-72.78 159.43,-71.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.04,-74.62 168.85,-68.74 158.3,-67.84 160.04,-74.62"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195" target="_top" xlink:title="Returns the number of items present in the cache.">
<polygon fill="white" stroke="#666666" points="282,-30.5 151.25,-30.5 151.25,0 282,0 282,-30.5"/>
<text text-anchor="start" x="159.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="216.62" y="-5.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="M96.72,-85.51C105.47,-73.07 122.21,-51.65 141.5,-39.25 143.33,-38.07 145.23,-36.94 147.18,-35.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.45,-39.14 155.87,-31.58 145.36,-32.86 148.45,-39.14"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
<polygon fill="white" stroke="#666666" points="469.38,-113.5 338.62,-113.5 338.62,-83 469.38,-83 469.38,-113.5"/>
<text text-anchor="start" x="346.62" y="-100" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="404" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</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="M292.22,-96.46C303.69,-96.64 315.55,-96.83 327.04,-97.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="326.83,-100.52 336.88,-97.18 326.94,-93.52 326.83,-100.52"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
<polygon fill="white" stroke="#666666" points="647,-91.5 516.25,-91.5 516.25,-61 647,-61 647,-91.5"/>
<text text-anchor="start" x="524.25" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="581.62" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</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="M469.4,-90.18C480.9,-88.74 492.98,-87.23 504.76,-85.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="504.95,-89.26 514.44,-84.54 504.08,-82.31 504.95,-89.26"/>
</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="M264.4,-68.34C283.49,-72.46 306.06,-77.33 327.38,-81.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="326.39,-85.3 336.9,-83.99 327.87,-78.46 326.39,-85.3"/>
</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="M291.96,-61.94C353.96,-65.01 441.95,-69.37 504.45,-72.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="504.14,-75.96 514.3,-72.96 504.49,-68.97 504.14,-75.96"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" target="_top" xlink:title="pop the last node in the least frequently used linked list">
<polygon fill="white" stroke="#666666" points="480.25,-26.88 327.75,-26.88 327.75,-7.62 480.25,-7.62 480.25,-26.88"/>
<text text-anchor="middle" x="404" y="-13.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::pop</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="M262.97,-48.22C288.11,-42.66 319.59,-35.7 346.34,-29.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="346.99,-33.22 356,-27.65 345.48,-26.39 346.99,-33.22"/>
</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="lfu__cache_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: 14 KiB

206
d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg Normal file
View File

@@ -0,0 +1,206 @@
<?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.1 (20240910.0053)
-->
<!-- Title: main Pages: 1 -->
<svg width="655pt" height="211pt"
viewBox="0.00 0.00 655.00 210.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 206.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,-104.88 0,-104.88 0,-85.62 37,-85.62 37,-104.88"/>
<text text-anchor="middle" x="18.5" y="-91.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="../../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="self test implementation">
<polygon fill="white" stroke="#666666" points="105.5,-104.88 73,-104.88 73,-85.62 105.5,-85.62 105.5,-104.88"/>
<text text-anchor="middle" x="89.25" y="-91.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,-95.25C44.58,-95.25 53.31,-95.25 61.45,-95.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-98.75 71.2,-95.25 61.2,-91.75 61.2,-98.75"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c" target="_top" xlink:title="Returns the total capacity of the cache.">
<polygon fill="white" stroke="#666666" points="282,-202.5 151.25,-202.5 151.25,-172 282,-172 282,-202.5"/>
<text text-anchor="start" x="159.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="216.62" y="-177.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="M95.19,-104.92C103.07,-119.41 119.83,-146.73 141.5,-162.25 143.44,-163.64 145.46,-164.96 147.55,-166.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.87,-169.28 156.35,-170.84 149.14,-163.08 145.87,-169.28"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0" target="_top" xlink:title="returns true if the cache is empty, false otherwise.">
<polygon fill="white" stroke="#666666" points="282,-153.5 151.25,-153.5 151.25,-123 282,-123 282,-153.5"/>
<text text-anchor="start" x="159.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="216.62" y="-128.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="M105.89,-101.24C116.01,-105.07 129.49,-110.08 141.5,-114.25 145.96,-115.8 150.57,-117.37 155.23,-118.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.06,-122.23 164.65,-122.05 156.26,-115.58 154.06,-122.23"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
<polygon fill="white" stroke="#666666" points="291.75,-104.88 141.5,-104.88 141.5,-85.62 291.75,-85.62 291.75,-104.88"/>
<text text-anchor="middle" x="216.62" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::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.88,-95.25C112.5,-95.25 120.78,-95.25 129.81,-95.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="129.61,-98.75 139.61,-95.25 129.61,-91.75 129.61,-98.75"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e" target="_top" xlink:title="upsert a key&#45;value pair">
<polygon fill="white" stroke="#666666" points="291.75,-67.88 141.5,-67.88 141.5,-48.62 291.75,-48.62 291.75,-67.88"/>
<text text-anchor="middle" x="216.62" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::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.79,-88.95C115.87,-85 129.34,-79.97 141.5,-76.25 147.28,-74.48 153.35,-72.78 159.43,-71.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.04,-74.62 168.85,-68.74 158.3,-67.84 160.04,-74.62"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195" target="_top" xlink:title="Returns the number of items present in the cache.">
<polygon fill="white" stroke="#666666" points="282,-30.5 151.25,-30.5 151.25,0 282,0 282,-30.5"/>
<text text-anchor="start" x="159.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="216.62" y="-5.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="M96.72,-85.51C105.47,-73.07 122.21,-51.65 141.5,-39.25 143.33,-38.07 145.23,-36.94 147.18,-35.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.45,-39.14 155.87,-31.58 145.36,-32.86 148.45,-39.14"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
<polygon fill="white" stroke="#666666" points="469.38,-113.5 338.62,-113.5 338.62,-83 469.38,-83 469.38,-113.5"/>
<text text-anchor="start" x="346.62" y="-100" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="404" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</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="M292.22,-96.46C303.69,-96.64 315.55,-96.83 327.04,-97.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="326.83,-100.52 336.88,-97.18 326.94,-93.52 326.83,-100.52"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
<polygon fill="white" stroke="#666666" points="647,-91.5 516.25,-91.5 516.25,-61 647,-61 647,-91.5"/>
<text text-anchor="start" x="524.25" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="581.62" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</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="M469.4,-90.18C480.9,-88.74 492.98,-87.23 504.76,-85.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="504.95,-89.26 514.44,-84.54 504.08,-82.31 504.95,-89.26"/>
</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="M264.4,-68.34C283.49,-72.46 306.06,-77.33 327.38,-81.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="326.39,-85.3 336.9,-83.99 327.87,-78.46 326.39,-85.3"/>
</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="M291.96,-61.94C353.96,-65.01 441.95,-69.37 504.45,-72.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="504.14,-75.96 514.3,-72.96 504.49,-68.97 504.14,-75.96"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" target="_top" xlink:title="pop the last node in the least frequently used linked list">
<polygon fill="white" stroke="#666666" points="480.25,-26.88 327.75,-26.88 327.75,-7.62 480.25,-7.62 480.25,-26.88"/>
<text text-anchor="middle" x="404" y="-13.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::pop</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="M262.97,-48.22C288.11,-42.66 319.59,-35.7 346.34,-29.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="346.99,-33.22 356,-27.65 345.48,-26.39 346.99,-33.22"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 10 KiB

136
db/d36/classothers_1_1_cache_1_1_l_f_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('df/d8f/classothers_1_1_cache_1_1_l_f_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::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&lt; K, V &gt;</a>, including all inherited members.</p>
<table class="directory">
<tr class="even"><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a></td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c">capacity</a>() const</td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0">empty</a>() const</td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a></td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">get</a>(K key)</td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9">increase_frequency</a>(std::pair&lt; CacheNode&lt; K, V &gt; *, int &gt; &amp;p_node)</td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc">LFUCache</a>(int _capacity)</td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&lt; K, V &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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">minFreq</a></td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a></td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69">pop</a>()</td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047">push</a>(int freq, CacheNode&lt; K, V &gt; *node)</td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">put</a>(K key, V value)</td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195">size</a>() const</td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36">~LFUCache</a>()</td><td class="entry"><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&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>

145
db/dde/namespaceothers_1_1_cache.html Normal file
View File

@@ -0,0 +1,145 @@
<!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 Namespace 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('db/dde/namespaceothers_1_1_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="#nested-classes">Classes</a> &#124;
<a href="#typedef-members">Typedefs</a> </div>
<div class="headertitle"><div class="title">others::Cache Namespace Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a class="el" href="../../db/dde/namespaceothers_1_1_cache.html" title="Cache algorithm.">Cache</a> algorithm.
<a href="#details">More...</a></p>
<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">D_Node</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="../../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>
</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>
<tr class="memitem:a5c0dfbf62803f020205076c3da18d058" id="r_a5c0dfbf62803f020205076c3da18d058"><td class="memTemplParams" colspan="2"><a id="a5c0dfbf62803f020205076c3da18d058" name="a5c0dfbf62803f020205076c3da18d058"></a>
template&lt;typename K , typename V &gt; </td></tr>
<tr class="memitem:a5c0dfbf62803f020205076c3da18d058"><td class="memTemplItemLeft" align="right" valign="top">using&#160;</td><td class="memTemplItemRight" valign="bottom"><b>CacheNode</b> = <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt;K, V&gt;&gt;</td></tr>
<tr class="separator:a5c0dfbf62803f020205076c3da18d058"><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><a class="el" href="../../db/dde/namespaceothers_1_1_cache.html" title="Cache algorithm.">Cache</a> algorithm. </p>
</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="../../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="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>

5
db/dde/namespaceothers_1_1_cache.js Normal file
View File

@@ -0,0 +1,5 @@
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" ]
];

197
de/d21/classothers_1_1_cache_1_1_d___node.html Normal file
View File

@@ -0,0 +1,197 @@
<!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::D_Node&lt; T &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('de/d21/classothers_1_1_cache_1_1_d___node.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="#pub-attribs">Public Attributes</a> &#124;
<a href="../../d5/ddb/classothers_1_1_cache_1_1_d___node-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">others::Cache::D_Node&lt; T &gt; Class Template Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a class="el" href="../../db/d8b/struct_node.html">Node</a> for a doubly linked list with data, prev and next pointers.
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for others::Cache::D_Node&lt; T &gt;:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.svg" width="203" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></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: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>
<tr class="memitem:a8902e7ff872fa3c80fe6ce5f5cf5cc75" id="r_a8902e7ff872fa3c80fe6ce5f5cf5cc75"><td class="memItemLeft" align="right" valign="top"><a id="a8902e7ff872fa3c80fe6ce5f5cf5cc75" name="a8902e7ff872fa3c80fe6ce5f5cf5cc75"></a>
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>
<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>
<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>
</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 />
class others::Cache::D_Node&lt; T &gt;</div><p><a class="el" href="../../db/d8b/struct_node.html">Node</a> for a doubly linked list with data, prev and next pointers. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">T</td><td>type of the data of the node </td></tr>
</table>
</dd>
</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>
<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"> 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="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>
<li>others/<a class="el" href="../../d9/d65/lfu__cache_8cpp.html">lfu_cache.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="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</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>

6
de/d21/classothers_1_1_cache_1_1_d___node.js Normal file
View File

@@ -0,0 +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 ]
];

5
de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="others::Cache::D_Node&lt; T &gt;" name="others::Cache::D_Node&lt; T &gt;">
<area shape="rect" id="Node000001" title="Node for a doubly linked list with data, prev and next pointers." alt="" coords="5,94,197,120"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="82,5,120,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="104,47,104,94,98,94,98,47"/>
</map>

1
de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.md5 Normal file
View File

@@ -0,0 +1 @@
63edbfb406bc0ef38cc4583da9998fb4

66
de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph.svg Normal file
View File

@@ -0,0 +1,66 @@
<?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.1 (20240910.0053)
-->
<!-- Title: others::Cache::D_Node&lt; T &gt; Pages: 1 -->
<svg width="152pt" height="94pt"
viewBox="0.00 0.00 151.50 93.75" 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 89.75)">
<title>others::Cache::D_Node&lt; T &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Node for a doubly linked list with data, prev and next pointers.">
<polygon fill="#999999" stroke="#666666" points="143.5,-19.25 0,-19.25 0,0 143.5,0 143.5,-19.25"/>
<text text-anchor="middle" x="71.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::D_Node&lt; T &gt;</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="86.15,-85.75 57.35,-85.75 57.35,-66.5 86.15,-66.5 86.15,-85.75"/>
<text text-anchor="middle" x="71.75" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">T</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="M71.75,-54.65C71.75,-42.82 71.75,-28.54 71.75,-19.52"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="68.25,-54.64 71.75,-64.64 75.25,-54.64 68.25,-54.64"/>
</a>
</g>
<text text-anchor="middle" x="82.62" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
</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.6 KiB

40
de/d6f/classothers_1_1_cache_1_1_d___node__coll__graph_org.svg Normal file
View File

@@ -0,0 +1,40 @@
<?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.1 (20240910.0053)
-->
<!-- Title: others::Cache::D_Node&lt; T &gt; Pages: 1 -->
<svg width="152pt" height="94pt"
viewBox="0.00 0.00 151.50 93.75" 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 89.75)">
<title>others::Cache::D_Node&lt; T &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Node for a doubly linked list with data, prev and next pointers.">
<polygon fill="#999999" stroke="#666666" points="143.5,-19.25 0,-19.25 0,0 143.5,0 143.5,-19.25"/>
<text text-anchor="middle" x="71.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::D_Node&lt; T &gt;</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="86.15,-85.75 57.35,-85.75 57.35,-66.5 86.15,-66.5 86.15,-85.75"/>
<text text-anchor="middle" x="71.75" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">T</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="M71.75,-54.65C71.75,-42.82 71.75,-28.54 71.75,-19.52"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="68.25,-54.64 71.75,-64.64 75.25,-54.64 68.25,-54.64"/>
</a>
</g>
<text text-anchor="middle" x="82.62" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.8 KiB

684
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html Normal file
View File

@@ -0,0 +1,684 @@
<!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::LFUCache&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('df/d8f/classothers_1_1_cache_1_1_l_f_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="../../db/d36/classothers_1_1_cache_1_1_l_f_u_cache-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">others::Cache::LFUCache&lt; K, V &gt; Class Template Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html" title="LFUCache.">LFUCache</a>.
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for others::Cache::LFUCache&lt; K, V &gt;:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg" width="100%" height="452"><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:affd7776c246caa2d0f92fd8616f6e5dc" id="r_affd7776c246caa2d0f92fd8616f6e5dc"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#affd7776c246caa2d0f92fd8616f6e5dc">LFUCache</a> (int <a class="el" href="#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>)</td></tr>
<tr class="memdesc:affd7776c246caa2d0f92fd8616f6e5dc"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructor, Initialize with minFreq and _capacity. <br /></td></tr>
<tr class="separator:affd7776c246caa2d0f92fd8616f6e5dc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af6f8e5a66a45436b490dfe015ff8866e" id="r_af6f8e5a66a45436b490dfe015ff8866e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af6f8e5a66a45436b490dfe015ff8866e">put</a> (K key, V value)</td></tr>
<tr class="memdesc:af6f8e5a66a45436b490dfe015ff8866e"><td class="mdescLeft">&#160;</td><td class="mdescRight">upsert a key-value pair <br /></td></tr>
<tr class="separator:af6f8e5a66a45436b490dfe015ff8866e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a58e37d3713f28d36abbb8cdf6c432781" id="r_a58e37d3713f28d36abbb8cdf6c432781"><td class="memItemLeft" align="right" valign="top">V&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a58e37d3713f28d36abbb8cdf6c432781">get</a> (K key)</td></tr>
<tr class="memdesc:a58e37d3713f28d36abbb8cdf6c432781"><td class="mdescLeft">&#160;</td><td class="mdescRight">get the value of the key-value pair if exists <br /></td></tr>
<tr class="separator:a58e37d3713f28d36abbb8cdf6c432781"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adbfb2ef7358423fdf1f49d410f55f195" id="r_adbfb2ef7358423fdf1f49d410f55f195"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adbfb2ef7358423fdf1f49d410f55f195">size</a> () const</td></tr>
<tr class="memdesc:adbfb2ef7358423fdf1f49d410f55f195"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the number of items present in the cache. <br /></td></tr>
<tr class="separator:adbfb2ef7358423fdf1f49d410f55f195"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac27c9076377cbed2a2acc45a189fed2c" id="r_ac27c9076377cbed2a2acc45a189fed2c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac27c9076377cbed2a2acc45a189fed2c">capacity</a> () const</td></tr>
<tr class="memdesc:ac27c9076377cbed2a2acc45a189fed2c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the total capacity of the cache. <br /></td></tr>
<tr class="separator:ac27c9076377cbed2a2acc45a189fed2c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a68e1be0a3e0a6478aa35f04000e0e9b0" id="r_a68e1be0a3e0a6478aa35f04000e0e9b0"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a68e1be0a3e0a6478aa35f04000e0e9b0">empty</a> () const</td></tr>
<tr class="memdesc:a68e1be0a3e0a6478aa35f04000e0e9b0"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns true if the cache is empty, false otherwise. <br /></td></tr>
<tr class="separator:a68e1be0a3e0a6478aa35f04000e0e9b0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8857531ecc8ed2e36868e267148eff36" id="r_a8857531ecc8ed2e36868e267148eff36"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8857531ecc8ed2e36868e267148eff36">~LFUCache</a> ()</td></tr>
<tr class="memdesc:a8857531ecc8ed2e36868e267148eff36"><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:a8857531ecc8ed2e36868e267148eff36"><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:adad4ab43141fb8ba43facd3a71e07047" id="r_adad4ab43141fb8ba43facd3a71e07047"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adad4ab43141fb8ba43facd3a71e07047">push</a> (int freq, <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
<tr class="memdesc:adad4ab43141fb8ba43facd3a71e07047"><td class="mdescLeft">&#160;</td><td class="mdescRight">push the node at first position in the linked list of given frequency <br /></td></tr>
<tr class="separator:adad4ab43141fb8ba43facd3a71e07047"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a16a25c102554c5653721a5112ef676c9" id="r_a16a25c102554c5653721a5112ef676c9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a16a25c102554c5653721a5112ef676c9">increase_frequency</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *, int &gt; &amp;p_node)</td></tr>
<tr class="memdesc:a16a25c102554c5653721a5112ef676c9"><td class="mdescLeft">&#160;</td><td class="mdescRight">increase the frequency of node and push it in the respective list. <br /></td></tr>
<tr class="separator:a16a25c102554c5653721a5112ef676c9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab3561ab204754295199f9566924f7e69" id="r_ab3561ab204754295199f9566924f7e69"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab3561ab204754295199f9566924f7e69">pop</a> ()</td></tr>
<tr class="memdesc:ab3561ab204754295199f9566924f7e69"><td class="mdescLeft">&#160;</td><td class="mdescRight">pop the last node in the least frequently used linked list <br /></td></tr>
<tr class="separator:ab3561ab204754295199f9566924f7e69"><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:ac7684879e2e5da3d8bc5b1699ee42d35" id="r_ac7684879e2e5da3d8bc5b1699ee42d35"><td class="memItemLeft" align="right" valign="top"><a id="ac7684879e2e5da3d8bc5b1699ee42d35" name="ac7684879e2e5da3d8bc5b1699ee42d35"></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="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *, int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>node_map</b></td></tr>
<tr class="memdesc:ac7684879e2e5da3d8bc5b1699ee42d35"><td class="mdescLeft">&#160;</td><td class="mdescRight">maps the key to the node address and frequency <br /></td></tr>
<tr class="separator:ac7684879e2e5da3d8bc5b1699ee42d35"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aba5d59d0f6ab0c0d30a92551ca5a05f2" id="r_aba5d59d0f6ab0c0d30a92551ca5a05f2"><td class="memItemLeft" align="right" valign="top"><a id="aba5d59d0f6ab0c0d30a92551ca5a05f2" name="aba5d59d0f6ab0c0d30a92551ca5a05f2"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *, <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; * &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>freq_map</b></td></tr>
<tr class="memdesc:aba5d59d0f6ab0c0d30a92551ca5a05f2"><td class="mdescLeft">&#160;</td><td class="mdescRight">maps the frequency to doubly linked list <br /></td></tr>
<tr class="separator:aba5d59d0f6ab0c0d30a92551ca5a05f2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6de844d1589a809239cc07752f311285" id="r_a6de844d1589a809239cc07752f311285"><td class="memItemLeft" align="right" valign="top"><a id="a6de844d1589a809239cc07752f311285" name="a6de844d1589a809239cc07752f311285"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>minFreq</b></td></tr>
<tr class="memdesc:a6de844d1589a809239cc07752f311285"><td class="mdescLeft">&#160;</td><td class="mdescRight">minimum frequency in the cache <br /></td></tr>
<tr class="separator:a6de844d1589a809239cc07752f311285"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3acc10e6bb67d9d9c4187f625723e6c5" id="r_a3acc10e6bb67d9d9c4187f625723e6c5"><td class="memItemLeft" align="right" valign="top"><a id="a3acc10e6bb67d9d9c4187f625723e6c5" name="a3acc10e6bb67d9d9c4187f625723e6c5"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>_capacity</b></td></tr>
<tr class="memdesc:a3acc10e6bb67d9d9c4187f625723e6c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum capacity of the cache <br /></td></tr>
<tr class="separator:a3acc10e6bb67d9d9c4187f625723e6c5"><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::LFUCache&lt; K, V &gt;</div><p><a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html" title="LFUCache.">LFUCache</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 LFU </td></tr>
<tr><td class="paramname">V</td><td>type of value in the LFU </td></tr>
</table>
</dd>
</dl>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="affd7776c246caa2d0f92fd8616f6e5dc" name="affd7776c246caa2d0f92fd8616f6e5dc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#affd7776c246caa2d0f92fd8616f6e5dc">&#9670;&#160;</a></span>LFUCache()</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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a>&lt; K, V &gt;::LFUCache </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 with minFreq and _capacity. </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"> 78</span>: <a class="code hl_variable" href="#a6de844d1589a809239cc07752f311285">minFreq</a>(0), <a class="code hl_variable" href="#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>(<a class="code hl_variable" href="#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>) {}</div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a3acc10e6bb67d9d9c4187f625723e6c5"><div class="ttname"><a href="#a3acc10e6bb67d9d9c4187f625723e6c5">others::Cache::LFUCache::_capacity</a></div><div class="ttdeci">int _capacity</div><div class="ttdoc">maximum capacity of the cache</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:71</div></div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a6de844d1589a809239cc07752f311285"><div class="ttname"><a href="#a6de844d1589a809239cc07752f311285">others::Cache::LFUCache::minFreq</a></div><div class="ttdeci">int minFreq</div><div class="ttdoc">minimum frequency in the cache</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:70</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a8857531ecc8ed2e36868e267148eff36" name="a8857531ecc8ed2e36868e267148eff36"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8857531ecc8ed2e36868e267148eff36">&#9670;&#160;</a></span>~LFUCache()</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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a>&lt; K, V &gt;::~<a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">LFUCache</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"> 235</span> {</div>
<div class="line"><span class="lineno"> 236</span> <span class="keyword">auto</span> it = <a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.begin();</div>
<div class="line"><span class="lineno"> 237</span> <span class="keywordflow">while</span> (it != <a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.end()) {</div>
<div class="line"><span class="lineno"> 238</span> <span class="keyword">delete</span> it-&gt;second.first;</div>
<div class="line"><span class="lineno"> 239</span> ++it;</div>
<div class="line"><span class="lineno"> 240</span> }</div>
<div class="line"><span class="lineno"> 241</span> }</div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_ac7684879e2e5da3d8bc5b1699ee42d35"><div class="ttname"><a href="#ac7684879e2e5da3d8bc5b1699ee42d35">others::Cache::LFUCache::node_map</a></div><div class="ttdeci">std::unordered_map&lt; K, std::pair&lt; CacheNode&lt; K, V &gt; *, int &gt; &gt; node_map</div><div class="ttdoc">maps the key to the node address and frequency</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:66</div></div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="ac27c9076377cbed2a2acc45a189fed2c" name="ac27c9076377cbed2a2acc45a189fed2c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac27c9076377cbed2a2acc45a189fed2c">&#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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</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"> 223</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a68e1be0a3e0a6478aa35f04000e0e9b0" name="a68e1be0a3e0a6478aa35f04000e0e9b0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a68e1be0a3e0a6478aa35f04000e0e9b0">&#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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</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 true if the cache is empty, false otherwise. </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"> 229</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.empty(); }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a58e37d3713f28d36abbb8cdf6c432781" name="a58e37d3713f28d36abbb8cdf6c432781"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a58e37d3713f28d36abbb8cdf6c432781">&#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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</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"> 202</span> {</div>
<div class="line"><span class="lineno"> 203</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.count(key)) {</div>
<div class="line"><span class="lineno"> 204</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"> 205</span> }</div>
<div class="line"><span class="lineno"> 206</span> </div>
<div class="line"><span class="lineno"> 207</span> <span class="comment">// increase the frequency and return the value</span></div>
<div class="line"><span class="lineno"> 208</span> V value = <a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>[key].first-&gt;data.second;</div>
<div class="line"><span class="lineno"> 209</span> <a class="code hl_function" href="#a16a25c102554c5653721a5112ef676c9">increase_frequency</a>(<a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>[key]);</div>
<div class="line"><span class="lineno"> 210</span> <span class="keywordflow">return</span> value;</div>
<div class="line"><span class="lineno"> 211</span> }</div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a16a25c102554c5653721a5112ef676c9"><div class="ttname"><a href="#a16a25c102554c5653721a5112ef676c9">others::Cache::LFUCache::increase_frequency</a></div><div class="ttdeci">void increase_frequency(std::pair&lt; CacheNode&lt; K, V &gt; *, int &gt; &amp;p_node)</div><div class="ttdoc">increase the frequency of node and push it in the respective list.</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:109</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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.svg" width="656" 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="a16a25c102554c5653721a5112ef676c9" name="a16a25c102554c5653721a5112ef676c9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a16a25c102554c5653721a5112ef676c9">&#9670;&#160;</a></span>increase_frequency()</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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a>&lt; K, V &gt;::increase_frequency </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *, int &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>p_node</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>increase the frequency of node and push it in the respective list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">p_node</td><td>the node to be updated </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 109</span> {</div>
<div class="line"><span class="lineno"> 110</span> CacheNode&lt;K, V&gt; *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = p_node.first;</div>
<div class="line"><span class="lineno"> 111</span> <span class="keywordtype">int</span> freq = p_node.second;</div>
<div class="line"><span class="lineno"> 112</span> </div>
<div class="line"><span class="lineno"> 113</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;CacheNode&lt;K, V&gt;</a> *, CacheNode&lt;K, V&gt; *&gt; &amp;p = <a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[freq];</div>
<div class="line"><span class="lineno"> 114</span> </div>
<div class="line"><span class="lineno"> 115</span> <span class="comment">// if the given node is the only node in the list,</span></div>
<div class="line"><span class="lineno"> 116</span> <span class="comment">// then erase the frequency from map</span></div>
<div class="line"><span class="lineno"> 117</span> <span class="comment">// and increase minFreq by 1.</span></div>
<div class="line"><span class="lineno"> 118</span> <span class="keywordflow">if</span> (p.first == <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> &amp;&amp; p.second == <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
<div class="line"><span class="lineno"> 119</span> <a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>.erase(freq);</div>
<div class="line"><span class="lineno"> 120</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a6de844d1589a809239cc07752f311285">minFreq</a> == freq) {</div>
<div class="line"><span class="lineno"> 121</span> <a class="code hl_variable" href="#a6de844d1589a809239cc07752f311285">minFreq</a> = freq + 1;</div>
<div class="line"><span class="lineno"> 122</span> }</div>
<div class="line"><span class="lineno"> 123</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 124</span> <span class="comment">// remove the given node from current freq linked list</span></div>
<div class="line"><span class="lineno"> 125</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> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;prev;</div>
<div class="line"><span class="lineno"> 126</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> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next;</div>
<div class="line"><span class="lineno"> 127</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;prev = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 128</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 129</span> </div>
<div class="line"><span class="lineno"> 130</span> <span class="keywordflow">if</span> (prev) {</div>
<div class="line"><span class="lineno"> 131</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"> 132</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 133</span> p.first = <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"> 134</span> }</div>
<div class="line"><span class="lineno"> 135</span> </div>
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">if</span> (next) {</div>
<div class="line"><span class="lineno"> 137</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"> 138</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 139</span> p.second = <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"> 140</span> }</div>
<div class="line"><span class="lineno"> 141</span> }</div>
<div class="line"><span class="lineno"> 142</span> <a class="code hl_function" href="#adad4ab43141fb8ba43facd3a71e07047">push</a>(freq + 1, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
<div class="line"><span class="lineno"> 143</span> ++p_node.second;</div>
<div class="line"><span class="lineno"> 144</span> }</div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_aba5d59d0f6ab0c0d30a92551ca5a05f2"><div class="ttname"><a href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">others::Cache::LFUCache::freq_map</a></div><div class="ttdeci">std::unordered_map&lt; int, std::pair&lt; CacheNode&lt; K, V &gt; *, CacheNode&lt; K, V &gt; * &gt; &gt; freq_map</div><div class="ttdoc">maps the frequency to doubly linked list</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:68</div></div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_adad4ab43141fb8ba43facd3a71e07047"><div class="ttname"><a href="#adad4ab43141fb8ba43facd3a71e07047">others::Cache::LFUCache::push</a></div><div class="ttdeci">void push(int freq, CacheNode&lt; K, V &gt; *node)</div><div class="ttdoc">push the node at first position in the linked list of given frequency</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:88</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="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></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 class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.svg" width="408" 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="ab3561ab204754295199f9566924f7e69" name="ab3561ab204754295199f9566924f7e69"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab3561ab204754295199f9566924f7e69">&#9670;&#160;</a></span>pop()</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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a>&lt; K, V &gt;::pop </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 least frequently used linked list </p>
<div class="fragment"><div class="line"><span class="lineno"> 149</span> {</div>
<div class="line"><span class="lineno"> 150</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;CacheNode&lt;K, V&gt;</a> *, CacheNode&lt;K, V&gt; *&gt; &amp;p = <a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[<a class="code hl_variable" href="#a6de844d1589a809239cc07752f311285">minFreq</a>];</div>
<div class="line"><span class="lineno"> 151</span> </div>
<div class="line"><span class="lineno"> 152</span> <span class="comment">// if there is only one node</span></div>
<div class="line"><span class="lineno"> 153</span> <span class="comment">// remove the node and erase</span></div>
<div class="line"><span class="lineno"> 154</span> <span class="comment">// the frequency from freq_map</span></div>
<div class="line"><span class="lineno"> 155</span> <span class="keywordflow">if</span> (p.first == p.second) {</div>
<div class="line"><span class="lineno"> 156</span> <span class="keyword">delete</span> p.first;</div>
<div class="line"><span class="lineno"> 157</span> <a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>.erase(<a class="code hl_variable" href="#a6de844d1589a809239cc07752f311285">minFreq</a>);</div>
<div class="line"><span class="lineno"> 158</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 159</span> }</div>
<div class="line"><span class="lineno"> 160</span> </div>
<div class="line"><span class="lineno"> 161</span> <span class="comment">// remove the last node in the linked list</span></div>
<div class="line"><span class="lineno"> 162</span> CacheNode&lt;K, V&gt; *temp = p.second;</div>
<div class="line"><span class="lineno"> 163</span> p.second = temp-&gt;prev;</div>
<div class="line"><span class="lineno"> 164</span> p.second-&gt;next = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 165</span> <span class="keyword">delete</span> temp;</div>
<div class="line"><span class="lineno"> 166</span> }</div>
</div><!-- fragment -->
</div>
</div>
<a id="adad4ab43141fb8ba43facd3a71e07047" name="adad4ab43141fb8ba43facd3a71e07047"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adad4ab43141fb8ba43facd3a71e07047">&#9670;&#160;</a></span>push()</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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a>&lt; K, V &gt;::push </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>freq</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></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</em></span>&#160;)</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 at first position in the linked list of given frequency </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">freq</td><td>the frequency mapping to the linked list where node should be pushed. </td></tr>
<tr><td class="paramname">node</td><td>node to be pushed to the linked list. </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 88</span> {</div>
<div class="line"><span class="lineno"> 89</span> <span class="comment">// if freq is not present, then make a new list with node as the head as</span></div>
<div class="line"><span class="lineno"> 90</span> <span class="comment">// well as tail.</span></div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>.count(freq)) {</div>
<div class="line"><span class="lineno"> 92</span> <a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[freq] = {<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>};</div>
<div class="line"><span class="lineno"> 93</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 94</span> }</div>
<div class="line"><span class="lineno"> 95</span> </div>
<div class="line"><span class="lineno"> 96</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;CacheNode&lt;K, V&gt;</a> *, CacheNode&lt;K, V&gt; *&gt; &amp;p = <a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[freq];</div>
<div class="line"><span class="lineno"> 97</span> </div>
<div class="line"><span class="lineno"> 98</span> <span class="comment">// insert the node at the beginning of the linked list and update the</span></div>
<div class="line"><span class="lineno"> 99</span> <span class="comment">// head.</span></div>
<div class="line"><span class="lineno"> 100</span> p.first-&gt;prev = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 101</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = p.first;</div>
<div class="line"><span class="lineno"> 102</span> p.first = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 103</span> }</div>
<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="af6f8e5a66a45436b490dfe015ff8866e" name="af6f8e5a66a45436b490dfe015ff8866e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af6f8e5a66a45436b490dfe015ff8866e">&#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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</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"> 174</span> {</div>
<div class="line"><span class="lineno"> 175</span> <span class="comment">// update the value if key already exists</span></div>
<div class="line"><span class="lineno"> 176</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.count(key)) {</div>
<div class="line"><span class="lineno"> 177</span> <a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>[key].first-&gt;data.second = value;</div>
<div class="line"><span class="lineno"> 178</span> <a class="code hl_function" href="#a16a25c102554c5653721a5112ef676c9">increase_frequency</a>(<a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>[key]);</div>
<div class="line"><span class="lineno"> 179</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 180</span> }</div>
<div class="line"><span class="lineno"> 181</span> </div>
<div class="line"><span class="lineno"> 182</span> <span class="comment">// if the cache is full</span></div>
<div class="line"><span class="lineno"> 183</span> <span class="comment">// remove the least frequently used item</span></div>
<div class="line"><span class="lineno"> 184</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.size() == <a class="code hl_variable" href="#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>) {</div>
<div class="line"><span class="lineno"> 185</span> <a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.erase(<a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[<a class="code hl_variable" href="#a6de844d1589a809239cc07752f311285">minFreq</a>].second-&gt;data.first);</div>
<div class="line"><span class="lineno"> 186</span> <a class="code hl_function" href="#ab3561ab204754295199f9566924f7e69">pop</a>();</div>
<div class="line"><span class="lineno"> 187</span> }</div>
<div class="line"><span class="lineno"> 188</span> </div>
<div class="line"><span class="lineno"> 189</span> <span class="comment">// insert the new node and set minFreq to 1</span></div>
<div class="line"><span class="lineno"> 190</span> CacheNode&lt;K, V&gt; *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> CacheNode&lt;K, V&gt;({key, value});</div>
<div class="line"><span class="lineno"> 191</span> <a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>[key] = {<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>, 1};</div>
<div class="line"><span class="lineno"> 192</span> <a class="code hl_variable" href="#a6de844d1589a809239cc07752f311285">minFreq</a> = 1;</div>
<div class="line"><span class="lineno"> 193</span> <a class="code hl_function" href="#adad4ab43141fb8ba43facd3a71e07047">push</a>(1, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
<div class="line"><span class="lineno"> 194</span> }</div>
<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_ab3561ab204754295199f9566924f7e69"><div class="ttname"><a href="#ab3561ab204754295199f9566924f7e69">others::Cache::LFUCache::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdoc">pop the last node in the least frequently used linked list</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:149</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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.svg" width="100%" height="414"><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="adbfb2ef7358423fdf1f49d410f55f195" name="adbfb2ef7358423fdf1f49d410f55f195"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adbfb2ef7358423fdf1f49d410f55f195">&#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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</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"> 217</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">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="../../d9/d65/lfu__cache_8cpp.html">lfu_cache.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="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">LFUCache</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
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.js Normal file
View File

@@ -0,0 +1,17 @@
var classothers_1_1_cache_1_1_l_f_u_cache =
[
[ "LFUCache", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc", null ],
[ "~LFUCache", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36", null ],
[ "capacity", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c", null ],
[ "empty", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0", null ],
[ "get", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781", null ],
[ "increase_frequency", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9", null ],
[ "pop", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69", null ],
[ "push", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047", null ],
[ "put", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e", null ],
[ "size", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195", null ],
[ "_capacity", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5", null ],
[ "freq_map", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2", null ],
[ "minFreq", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285", null ],
[ "node_map", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35", null ]
];

5
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="others::Cache::LFUCache::increase_frequency" name="others::Cache::LFUCache::increase_frequency">
<area shape="rect" id="Node000001" title="increase the frequency of node and push it in the respective list." alt="" coords="5,5,180,46"/>
<area shape="rect" id="Node000002" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" title="push the node at first position in the linked list of given frequency" alt="" coords="228,5,402,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="180,23,212,23,212,28,180,28"/>
</map>

1
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
136e5b2fde508fd9779a8e62e4f72912

67
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_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.1 (20240910.0053)
-->
<!-- Title: others::Cache::LFUCache::increase_frequency Pages: 1 -->
<svg width="306pt" height="39pt"
viewBox="0.00 0.00 305.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::LFUCache::increase_frequency</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="increase the frequency of node and push it in the respective list.">
<polygon fill="#999999" stroke="#666666" points="130.75,-30.5 0,-30.5 0,0 130.75,0 130.75,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="65.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
<polygon fill="white" stroke="#666666" points="297.5,-30.5 166.75,-30.5 166.75,0 297.5,0 297.5,-30.5"/>
<text text-anchor="start" x="174.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="232.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</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="M131.02,-15.25C138.92,-15.25 147.05,-15.25 155.1,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.89,-18.75 164.89,-15.25 154.89,-11.75 154.89,-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.9 KiB

41
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_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.1 (20240910.0053)
-->
<!-- Title: others::Cache::LFUCache::increase_frequency Pages: 1 -->
<svg width="306pt" height="39pt"
viewBox="0.00 0.00 305.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::LFUCache::increase_frequency</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="increase the frequency of node and push it in the respective list.">
<polygon fill="#999999" stroke="#666666" points="130.75,-30.5 0,-30.5 0,0 130.75,0 130.75,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="65.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
<polygon fill="white" stroke="#666666" points="297.5,-30.5 166.75,-30.5 166.75,0 297.5,0 297.5,-30.5"/>
<text text-anchor="start" x="174.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="232.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</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="M131.02,-15.25C138.92,-15.25 147.05,-15.25 155.1,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.89,-18.75 164.89,-15.25 154.89,-11.75 154.89,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.1 KiB

7
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.map Normal file
View File

@@ -0,0 +1,7 @@
<map id="others::Cache::LFUCache::get" name="others::Cache::LFUCache::get">
<area shape="rect" id="Node000001" title="get the value of the key&#45;value pair if exists" alt="" coords="5,13,206,38"/>
<area shape="rect" id="Node000002" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" title="increase the frequency of node and push it in the respective list." alt="" coords="254,5,428,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="206,23,238,23,238,28,206,28"/>
<area shape="rect" id="Node000003" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" title="push the node at first position in the linked list of given frequency" alt="" coords="476,5,650,46"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="428,23,460,23,460,28,428,28"/>
</map>

1
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
a478dd2129b44698d51017d165ed8e6b

85
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_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.1 (20240910.0053)
-->
<!-- Title: others::Cache::LFUCache::get Pages: 1 -->
<svg width="492pt" height="39pt"
viewBox="0.00 0.00 491.75 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::LFUCache::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="150.25,-24.88 0,-24.88 0,-5.63 150.25,-5.63 150.25,-24.88"/>
<text text-anchor="middle" x="75.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::get</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
<polygon fill="white" stroke="#666666" points="317,-30.5 186.25,-30.5 186.25,0 317,0 317,-30.5"/>
<text text-anchor="start" x="194.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="251.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</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="M150.63,-15.25C158.54,-15.25 166.59,-15.25 174.51,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="174.48,-18.75 184.48,-15.25 174.48,-11.75 174.48,-18.75"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
<polygon fill="white" stroke="#666666" points="483.75,-30.5 353,-30.5 353,0 483.75,0 483.75,-30.5"/>
<text text-anchor="start" x="361" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="418.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</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="M317.27,-15.25C325.17,-15.25 333.3,-15.25 341.35,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="341.14,-18.75 351.14,-15.25 341.14,-11.75 341.14,-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.8 KiB

59
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_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.1 (20240910.0053)
-->
<!-- Title: others::Cache::LFUCache::get Pages: 1 -->
<svg width="492pt" height="39pt"
viewBox="0.00 0.00 491.75 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::LFUCache::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="150.25,-24.88 0,-24.88 0,-5.63 150.25,-5.63 150.25,-24.88"/>
<text text-anchor="middle" x="75.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::get</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
<polygon fill="white" stroke="#666666" points="317,-30.5 186.25,-30.5 186.25,0 317,0 317,-30.5"/>
<text text-anchor="start" x="194.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="251.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</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="M150.63,-15.25C158.54,-15.25 166.59,-15.25 174.51,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="174.48,-18.75 184.48,-15.25 174.48,-11.75 174.48,-18.75"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
<polygon fill="white" stroke="#666666" points="483.75,-30.5 353,-30.5 353,0 483.75,0 483.75,-30.5"/>
<text text-anchor="start" x="361" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="418.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</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="M317.27,-15.25C325.17,-15.25 333.3,-15.25 341.35,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="341.14,-18.75 351.14,-15.25 341.14,-11.75 341.14,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.0 KiB

10
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.map Normal file
View File

@@ -0,0 +1,10 @@
<map id="others::Cache::LFUCache::put" name="others::Cache::LFUCache::put">
<area shape="rect" id="Node000001" title="upsert a key&#45;value pair" alt="" coords="5,70,206,96"/>
<area shape="rect" id="Node000002" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" title="increase the frequency of node and push it in the respective list." alt="" coords="268,5,442,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="164,67,253,46,254,52,165,72"/>
<area shape="rect" id="Node000003" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" title="push the node at first position in the linked list of given frequency" alt="" coords="505,35,679,75"/>
<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="206,75,489,58,489,64,206,80"/>
<area shape="rect" id="Node000004" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" title="pop the last node in the least frequently used linked list" alt="" coords="254,121,457,146"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="173,94,274,115,273,120,172,99"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="443,34,490,40,489,45,442,39"/>
</map>

1
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
2f5e8422a3e70831f5f71798302110cc

169
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.svg Normal file
View File

@@ -0,0 +1,169 @@
<?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.1 (20240910.0053)
-->
<!-- Title: others::Cache::LFUCache::put Pages: 1 -->
<!--zoomable 114 -->
<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 = 514;
var viewHeight = 114;
var sectionId = 'dynsection-3';
</script>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>others::Cache::LFUCache::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="150.25,-57.25 0,-57.25 0,-38 150.25,-38 150.25,-57.25"/>
<text text-anchor="middle" x="75.12" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::put</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
<polygon fill="white" stroke="#666666" points="327.88,-105.88 197.12,-105.88 197.12,-75.38 327.88,-75.38 327.88,-105.88"/>
<text text-anchor="start" x="205.12" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="262.5" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</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="M119.59,-57.71C139.36,-62.29 163.34,-67.86 185.92,-73.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="184.86,-76.44 195.39,-75.29 186.44,-69.62 184.86,-76.44"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
<polygon fill="white" stroke="#666666" points="505.5,-83.88 374.75,-83.88 374.75,-53.38 505.5,-53.38 505.5,-83.88"/>
<text text-anchor="start" x="382.75" y="-70.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="440.12" y="-59.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</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="M150.46,-51.93C212.46,-55.51 300.45,-60.6 362.95,-64.22"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="362.62,-67.7 372.8,-64.79 363.02,-60.72 362.62,-67.7"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" target="_top" xlink:title="pop the last node in the least frequently used linked list">
<polygon fill="white" stroke="#666666" points="338.75,-19.25 186.25,-19.25 186.25,0 338.75,0 338.75,-19.25"/>
<text text-anchor="middle" x="262.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::pop</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="M125.32,-37.54C148.66,-32.76 176.77,-26.99 201.37,-21.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.83,-25.43 210.92,-19.99 200.42,-18.57 201.83,-25.43"/>
</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="M327.9,-82.56C339.4,-81.12 351.48,-79.6 363.26,-78.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="363.45,-81.63 372.94,-76.92 362.58,-74.69 363.45,-81.63"/>
</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="classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_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: 8.2 KiB

86
df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph_org.svg Normal file
View File

@@ -0,0 +1,86 @@
<?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.1 (20240910.0053)
-->
<!-- Title: others::Cache::LFUCache::put Pages: 1 -->
<svg width="514pt" height="114pt"
viewBox="0.00 0.00 513.50 113.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 109.88)">
<title>others::Cache::LFUCache::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="150.25,-57.25 0,-57.25 0,-38 150.25,-38 150.25,-57.25"/>
<text text-anchor="middle" x="75.12" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::put</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
<polygon fill="white" stroke="#666666" points="327.88,-105.88 197.12,-105.88 197.12,-75.38 327.88,-75.38 327.88,-105.88"/>
<text text-anchor="start" x="205.12" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="262.5" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</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="M119.59,-57.71C139.36,-62.29 163.34,-67.86 185.92,-73.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="184.86,-76.44 195.39,-75.29 186.44,-69.62 184.86,-76.44"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
<polygon fill="white" stroke="#666666" points="505.5,-83.88 374.75,-83.88 374.75,-53.38 505.5,-53.38 505.5,-83.88"/>
<text text-anchor="start" x="382.75" y="-70.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
<text text-anchor="middle" x="440.12" y="-59.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</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="M150.46,-51.93C212.46,-55.51 300.45,-60.6 362.95,-64.22"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="362.62,-67.7 372.8,-64.79 363.02,-60.72 362.62,-67.7"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" target="_top" xlink:title="pop the last node in the least frequently used linked list">
<polygon fill="white" stroke="#666666" points="338.75,-19.25 186.25,-19.25 186.25,0 338.75,0 338.75,-19.25"/>
<text text-anchor="middle" x="262.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::pop</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="M125.32,-37.54C148.66,-32.76 176.77,-26.99 201.37,-21.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.83,-25.43 210.92,-19.99 200.42,-18.57 201.83,-25.43"/>
</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="M327.9,-82.56C339.4,-81.12 351.48,-79.6 363.26,-78.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="363.45,-81.63 372.94,-76.92 362.58,-74.69 363.45,-81.63"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.3 KiB

3
dir_9510827d0b234b3cc54b29892f217477.html
View File

@@ -137,6 +137,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="db/d6b/kelvin__to__celsius_8cpp.html">kelvin_to_celsius.cpp</a></td></tr>
<tr class="memdesc:db/d6b/kelvin__to__celsius_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Conversion from <a href="https://byjus.com/chemistry/kelvin-to-celsius/" target="_blank">Kelvin to Celsius</a> degrees. <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="d9/d65/lfu__cache_8cpp.html">lfu_cache.cpp</a></td></tr>
<tr class="memdesc:d9/d65/lfu__cache_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation for [LFU Cache] (<a href="https://en.wikipedia.org/wiki/Least_frequently_used">https://en.wikipedia.org/wiki/Least_frequently_used</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="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>

1
dir_9510827d0b234b3cc54b29892f217477.js
View File

@@ -9,6 +9,7 @@ var dir_9510827d0b234b3cc54b29892f217477 =
[ "iterative_tree_traversals.cpp", "d8/d90/iterative__tree__traversals_8cpp.html", "d8/d90/iterative__tree__traversals_8cpp" ],
[ "kadanes3.cpp", "de/dcd/kadanes3_8cpp.html", "de/dcd/kadanes3_8cpp" ],
[ "kelvin_to_celsius.cpp", "db/d6b/kelvin__to__celsius_8cpp.html", "db/d6b/kelvin__to__celsius_8cpp" ],
[ "lfu_cache.cpp", "d9/d65/lfu__cache_8cpp.html", "d9/d65/lfu__cache_8cpp" ],
[ "lru_cache.cpp", "d3/db3/lru__cache_8cpp.html", "d3/db3/lru__cache_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" ],

29
doxygen_crawl.html
View File

@@ -233,6 +233,7 @@
<a href="d8/d90/iterative__tree__traversals_8cpp.html"/>
<a href="de/dcd/kadanes3_8cpp.html"/>
<a href="db/d6b/kelvin__to__celsius_8cpp.html"/>
<a href="d9/d65/lfu__cache_8cpp.html"/>
<a href="d3/db3/lru__cache_8cpp.html"/>
<a href="d7/d35/matrix__exponentiation_8cpp.html"/>
<a href="da/d9a/palindrome__of__number_8cpp.html"/>
@@ -592,6 +593,11 @@
<a href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html"/>
<a href="d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html"/>
<a href="d0/d6f/namespaceothers.html"/>
<a href="db/dde/namespaceothers_1_1_cache.html"/>
<a href="de/d21/classothers_1_1_cache_1_1_d___node.html"/>
<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="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"/>
@@ -2748,6 +2754,9 @@
<a href="d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d"/>
<a href="d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="d9/d60/namespacerat__maze.html"/>
<a href="d9/d65/lfu__cache_8cpp.html"/>
<a href="d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
<a href="d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="d9/d66/group__machine__learning.html"/>
<a href="d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1"/>
<a href="d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e"/>
@@ -3264,6 +3273,7 @@
<a href="db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe"/>
<a href="db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b"/>
<a href="db/ddc/namespaceaystar__search.html"/>
<a href="db/dde/namespaceothers_1_1_cache.html"/>
<a href="db/ded/namespacemath_1_1gcd__of__n__numbers.html#a1161713c662a14c2d5e33504f4324532"/>
<a href="db/ded/namespacemath_1_1gcd__of__n__numbers.html#a509a35e11ed1e17a9e00dd56320a4181"/>
<a href="db/ded/namespacemath_1_1gcd__of__n__numbers.html#a71b9357c7a722f8208499d9ba573297a"/>
@@ -3688,6 +3698,10 @@
<a href="de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f"/>
<a href="de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d"/>
<a href="de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<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#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"/>
@@ -3922,6 +3936,21 @@
<a href="df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="df/d88/namespacedp.html"/>
<a href="df/d8e/namespacetrie__operations.html"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e"/>
<a href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc"/>
<a href="df/d94/subarray__sum_8cpp.html"/>
<a href="df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
<a href="df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>

29
files.html
View File

@@ -343,20 +343,21 @@ N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bis
<tr id="row_17_6_" 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="d8/d90/iterative__tree__traversals_8cpp.html" target="_self">iterative_tree_traversals.cpp</a></td><td class="desc">Iterative version of Preorder, Postorder, and preorder [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_7_" 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="de/dcd/kadanes3_8cpp.html" target="_self">kadanes3.cpp</a></td><td class="desc">Efficient implementation for maximum contiguous subarray sum by <a href="https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/" target="_blank">Kadane's algorithm</a> </td></tr>
<tr id="row_17_8_" 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/d6b/kelvin__to__celsius_8cpp.html" target="_self">kelvin_to_celsius.cpp</a></td><td class="desc">Conversion from <a href="https://byjus.com/chemistry/kelvin-to-celsius/" target="_blank">Kelvin to Celsius</a> degrees </td></tr>
<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="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_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="d7/d35/matrix__exponentiation_8cpp.html" target="_self">matrix_exponentiation.cpp</a></td><td class="desc">Matrix Exponentiation </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="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_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/dc5/paranthesis__matching_8cpp.html" target="_self">paranthesis_matching.cpp</a></td><td class="desc">Perform paranthesis matching </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="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_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="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_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="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_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/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_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="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_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="d3/d19/sparse__matrix_8cpp.html" target="_self">sparse_matrix.cpp</a></td><td class="desc"></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="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_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="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_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/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_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="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_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="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_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="d7/d35/matrix__exponentiation_8cpp.html" target="_self">matrix_exponentiation.cpp</a></td><td class="desc">Matrix Exponentiation </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="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_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="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_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/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_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="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_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="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_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="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_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="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_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="d3/d19/sparse__matrix_8cpp.html" target="_self">sparse_matrix.cpp</a></td><td class="desc"></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="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_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="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_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/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_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="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>

1
functions.html
View File

@@ -109,6 +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>_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></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>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_d.html
View File

@@ -107,7 +107,7 @@ $(function(){initNavTree('functions_d.html',''); initResizable(true); });
<div class="textblock">Here is a list of all documented class members with links to the class documentation for each member:</div>
<h3><a id="index_d" name="index_d"></a>- d -</h3><ul>
<li>data&#160;:&#160;<a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">data_structures::Bitset</a>, <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1">operations_on_datastructures::circular_linked_list::Node</a>, <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node</a>, <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">operations_on_datastructures::reverse_binary_tree::Node</a>, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">others::iterative_tree_traversals::Node</a>, <a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade">others::recursive_tree_traversals::Node</a>, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">search::sublist_search::Node</a></li>
<li>data&#160;:&#160;<a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">data_structures::Bitset</a>, <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1">operations_on_datastructures::circular_linked_list::Node</a>, <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node</a>, <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">operations_on_datastructures::reverse_binary_tree::Node</a>, <a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">others::Cache::D_Node&lt; T &gt;</a>, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">others::iterative_tree_traversals::Node</a>, <a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade">others::recursive_tree_traversals::Node</a>, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">search::sublist_search::Node</a></li>
<li>day&#160;:&#160;<a class="el" href="d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51">EasterYearMonthDay</a></li>
<li>decreaseKey()&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5">MinHeap</a></li>
<li>decrypt_text()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b">ciphers::HillCipher</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></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>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>

1
functions_f.html
View File

@@ -118,6 +118,7 @@ $(function(){initNavTree('functions_f.html',''); initResizable(true); });
<li>fit()&#160;:&#160;<a class="el" href="d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">machine_learning::adaline</a>, <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0">machine_learning::neural_network::NeuralNetwork</a></li>
<li>fit_from_csv()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">machine_learning::neural_network::NeuralNetwork</a></li>
<li>forward&#160;:&#160;<a class="el" href="d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e">data_structures::Node</a></li>
<li>freq_map&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>front&#160;:&#160;<a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array</a>, <a class="el" href="db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">queue&lt; ValueType &gt;</a></li>
<li>full()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1">data_structures::Stack&lt; T &gt;</a></li>
</ul>

1
functions_func_c.html
View File

@@ -107,6 +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>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></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>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></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_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>

1
functions_func_i.html
View File

@@ -109,6 +109,7 @@ $(function(){initNavTree('functions_func_i.html',''); initResizable(true); });
<h3><a id="index_i" name="index_i"></a>- i -</h3><ul>
<li>imag()&#160;:&#160;<a class="el" href="da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">Complex</a></li>
<li>in_range()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>increase_frequency()&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>Info()&#160;:&#160;<a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></li>
<li>init()&#160;:&#160;<a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a>, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>inOrderIterative()&#160;:&#160;<a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree</a></li>

1
functions_func_l.html
View File

@@ -112,6 +112,7 @@ $(function(){initNavTree('functions_func_l.html',''); initResizable(true); });
<li>lca()&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>left()&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca">MinHeap</a></li>
<li>LeftRotate()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e">data_structures::tree_234::Tree234</a></li>
<li>LFUCache()&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>lift()&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>LinearSearch()&#160;:&#160;<a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">data_structures::list_array::list&lt; N &gt;</a></li>
<li>link()&#160;:&#160;<a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb">data_structures::linked_list::link</a></li>

5
functions_func_p.html
View File

@@ -108,7 +108,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="d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack&lt; ValueType &gt;</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>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>
@@ -122,9 +122,10 @@ $(function(){initNavTree('functions_func_p.html',''); initResizable(true); });
<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>
<li>printResult()&#160;:&#160;<a class="el" href="dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793">FCFS&lt; S, T, E &gt;</a></li>
<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="d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack&lt; ValueType &gt;</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>
</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="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/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

@@ -112,6 +112,7 @@ $(function(){initNavTree('functions_func_~.html',''); initResizable(true); });
<li>~EightPuzzle()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<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>~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></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_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>

1
functions_i.html
View File

@@ -110,6 +110,7 @@ $(function(){initNavTree('functions_i.html',''); initResizable(true); });
<li>ID&#160;:&#160;<a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3">data_structures::SegmentTree&lt; T &gt;</a></li>
<li>imag()&#160;:&#160;<a class="el" href="da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">Complex</a></li>
<li>in_range()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>increase_frequency()&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>Info&#160;:&#160;<a class="el" href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#acd897e6e519849edb9fb0d1e1bfa881a">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;</a>, <a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></li>
<li>init()&#160;:&#160;<a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a>, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>inOrderIterative()&#160;:&#160;<a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree</a></li>

1
functions_l.html
View File

@@ -115,6 +115,7 @@ $(function(){initNavTree('functions_l.html',''); initResizable(true); });
<li>left&#160;:&#160;<a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788">binary_search_tree&lt; T &gt;::bst_node</a>, <a class="el" href="d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca">MinHeap</a>, <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a">operations_on_datastructures::inorder_traversal_of_bst::Node</a>, <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">operations_on_datastructures::reverse_binary_tree::Node</a>, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">others::iterative_tree_traversals::Node</a>, <a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">others::recursive_tree_traversals::Node</a></li>
<li>LeftRotate()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e">data_structures::tree_234::Tree234</a></li>
<li>level&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">data_structures::SkipList</a>, <a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree</a></li>
<li>LFUCache()&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>lift()&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>LinearSearch()&#160;:&#160;<a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">data_structures::list_array::list&lt; N &gt;</a></li>
<li>link()&#160;:&#160;<a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb">data_structures::linked_list::link</a></li>

1
functions_m.html
View File

@@ -119,6 +119,7 @@ $(function(){initNavTree('functions_m.html',''); initResizable(true); });
<li>MergeNodeNotFull()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95">data_structures::tree_234::Tree234</a></li>
<li>mid()&#160;:&#160;<a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141">data_structures::SegmentTree&lt; T &gt;</a></li>
<li>minElement&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">dsu</a></li>
<li>minFreq&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>MinHeap()&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820">MinHeap</a></li>
<li>MinHeapify()&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad">MinHeap</a></li>
<li>month&#160;:&#160;<a class="el" href="d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde">EasterYearMonthDay</a></li>

3
functions_n.html
View File

@@ -115,8 +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="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#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()&#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>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>

6
functions_p.html
View File

@@ -115,7 +115,7 @@ $(function(){initNavTree('functions_p.html',''); initResizable(true); });
<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>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="d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack&lt; ValueType &gt;</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>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,6 +124,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>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>
@@ -132,9 +133,10 @@ $(function(){initNavTree('functions_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>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>
<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="d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack&lt; ValueType &gt;</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>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="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/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>

9
functions_vars.html
View File

@@ -107,6 +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>_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>
@@ -145,7 +146,7 @@ $(function(){initNavTree('functions_vars.html',''); initResizable(true); });
<h3><a id="index_d" name="index_d"></a>- d -</h3><ul>
<li>data&#160;:&#160;<a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">data_structures::Bitset</a>, <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1">operations_on_datastructures::circular_linked_list::Node</a>, <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node</a>, <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">operations_on_datastructures::reverse_binary_tree::Node</a>, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">others::iterative_tree_traversals::Node</a>, <a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade">others::recursive_tree_traversals::Node</a>, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">search::sublist_search::Node</a></li>
<li>data&#160;:&#160;<a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">data_structures::Bitset</a>, <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1">operations_on_datastructures::circular_linked_list::Node</a>, <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node</a>, <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">operations_on_datastructures::reverse_binary_tree::Node</a>, <a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">others::Cache::D_Node&lt; T &gt;</a>, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">others::iterative_tree_traversals::Node</a>, <a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade">others::recursive_tree_traversals::Node</a>, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">search::sublist_search::Node</a></li>
<li>day&#160;:&#160;<a class="el" href="d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51">EasterYearMonthDay</a></li>
<li>depth&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">dsu</a>, <a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></li>
<li>dist&#160;:&#160;<a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">graph::HKGraph</a></li>
@@ -162,6 +163,7 @@ $(function(){initNavTree('functions_vars.html',''); initResizable(true); });
<li>fac&#160;:&#160;<a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec">math::ncr_modulo_p::NCRModuloP</a></li>
<li>first&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">data_structures::linked_list::list</a></li>
<li>forward&#160;:&#160;<a class="el" href="d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e">data_structures::Node</a></li>
<li>freq_map&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>front&#160;:&#160;<a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array</a></li>
</ul>
@@ -211,6 +213,7 @@ $(function(){initNavTree('functions_vars.html',''); initResizable(true); });
<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>maxElement&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">dsu</a></li>
<li>minElement&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">dsu</a></li>
<li>minFreq&#160;:&#160;<a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">others::Cache::LFUCache&lt; K, V &gt;</a></li>
<li>month&#160;:&#160;<a class="el" href="d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde">EasterYearMonthDay</a></li>
<li>moves&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
</ul>
@@ -219,7 +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="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#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>NUM_CHARS&#160;:&#160;<a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">data_structures::trie</a></li>
</ul>
@@ -232,6 +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>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>

1
functions_~.html
View File

@@ -112,6 +112,7 @@ $(function(){initNavTree('functions_~.html',''); initResizable(true); });
<li>~EightPuzzle()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<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>~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

205
hierarchy.html
View File

@@ -130,107 +130,110 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_16_" 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/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
<tr id="row_17_" 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/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_self">geometry::jarvis::Convexhull</a></td><td class="desc"></td></tr>
<tr id="row_18_" 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/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
<tr id="row_19_" 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/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_self">machine_learning::neural_network::layers::DenseLayer</a></td><td class="desc"></td></tr>
<tr id="row_20_" 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/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
<tr id="row_21_" 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/d1f/classdsu.html" target="_self">dsu</a></td><td class="desc">Disjoint sets union data structure, class based representation </td></tr>
<tr id="row_22_" 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/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_23_" 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/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
<tr id="row_24_" 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/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" target="_self">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/15_puzzle" target="_blank">EightPuzzle/15-Puzzle game</a> </td></tr>
<tr id="row_25_" 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/dde/structdouble__hashing_1_1_entry.html" target="_self">double_hashing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_26_" 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/d19/structlinear__probing_1_1_entry.html" target="_self">linear_probing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_27_" 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/dd1/structquadratic__probing_1_1_entry.html" target="_self">quadratic_probing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_28_" 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/dca/class_f_c_f_s.html" target="_self">FCFS&lt; S, T, E &gt;</a></td><td class="desc">Class which implements the <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm </td></tr>
<tr id="row_29_" 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/d0d/classrange__queries_1_1fenwick__tree.html" target="_self">range_queries::fenwick_tree</a></td><td class="desc">The class that initializes the Fenwick Tree </td></tr>
<tr id="row_30_" 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/de5/classbacktracking_1_1generate__parentheses.html" target="_self">backtracking::generate_parentheses</a></td><td class="desc">Generate_parentheses class </td></tr>
<tr id="row_31_" 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/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html" target="_self">probability::geometric_dist::geometric_distribution</a></td><td class="desc">A class to model the geometric distribution </td></tr>
<tr id="row_32_" 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/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_33_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_33_" class="arrow" onclick="dynsection.toggleFolder('33_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d61/classgraph_1_1_graph.html" target="_self">graph::Graph&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_33_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="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">graph::RootedTree</a></td><td class="desc"></td></tr>
<tr id="row_34_" 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/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" target="_self">graph::is_graph_bipartite::Graph</a></td><td class="desc">Class for representing graph as an adjacency list </td></tr>
<tr id="row_35_" 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/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html" target="_self">greedy_algorithms::dijkstra::Graph</a></td><td class="desc">Wrapper class for storing a graph </td></tr>
<tr id="row_36_" 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/d84/classhashing_1_1sha256_1_1_hash.html" target="_self">hashing::sha256::Hash</a></td><td class="desc">Contains hash array and functions to update it and convert it to a hexadecimal string </td></tr>
<tr id="row_37_" 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/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_38_" 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/d26/classciphers_1_1_hill_cipher.html" target="_self">ciphers::HillCipher</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher" target="_blank">Hill Cipher</a> algorithm </td></tr>
<tr id="row_39_" 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/d69/classgraph_1_1_h_k_graph.html" target="_self">graph::HKGraph</a></td><td class="desc">Represents Bipartite graph for Hopcroft Karp implementation </td></tr>
<tr id="row_40_" 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/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" target="_self">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></td><td class="desc">Struct that handles all the information related to the current state </td></tr>
<tr id="row_41_" 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/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_42_" 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/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html" target="_self">machine_learning::k_nearest_neighbors::Knn</a></td><td class="desc">K-Nearest Neighbors (<a class="el" href="da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html" title="K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.">Knn</a>) class using Euclidean distance as distance metric </td></tr>
<tr id="row_43_" 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/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_44_" 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/d9d/classdata__structures_1_1linked__list_1_1link.html" target="_self">data_structures::linked_list::link</a></td><td class="desc"></td></tr>
<tr id="row_45_" 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/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<tr id="row_46_" 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/def/classdata__structures_1_1linked__list_1_1list.html" target="_self">data_structures::linked_list::list</a></td><td class="desc"></td></tr>
<tr id="row_47_" 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/dab/structdata__structures_1_1list__array_1_1list.html" target="_self">data_structures::list_array::list&lt; N &gt;</a></td><td class="desc">Structure of List with supporting methods </td></tr>
<tr id="row_48_" 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/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_49_" 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_50_" 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/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</a></td><td class="desc"></td></tr>
<tr id="row_51_" 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_52_" 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_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="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></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="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></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="d1/d77/structmst.html" target="_self">mst</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/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_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="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_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="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_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="d9/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</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="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_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="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_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="db/d8b/struct_node.html" target="_self">Node&lt; ValueType &gt;</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="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_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="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_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="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_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="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_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="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_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="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_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/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_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/da1/structnode.html" target="_self">node</a></td><td class="desc"></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="db/d8b/struct_node.html" target="_self">Node&lt; value_type &gt;</a></td><td class="desc"></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="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_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="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_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="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_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="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</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="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</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="d8/dc8/struct_point.html" target="_self">Point</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/d1b/structquery.html" target="_self">query</a></td><td class="desc"></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="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></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="db/da9/classqueue.html" target="_self">queue&lt; ValueType &gt;</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="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_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/d72/class_r_btree.html" target="_self">RBtree</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="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</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/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_85_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_85_" class="arrow" onclick="dynsection.toggleFolder('85_')">&#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_85_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_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="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</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="dd/d4f/class_solution.html" target="_self">Solution</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="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_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="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_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="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_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="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_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="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_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="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</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="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_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="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_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="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_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/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </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="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_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/d2c/structtower.html" target="_self">tower</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="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_101_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_101_" class="arrow" onclick="dynsection.toggleFolder('101_')">&#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_101_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_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="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_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="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_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="dd/d2f/class_trie.html" target="_self">Trie</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="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_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="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></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="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_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/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_107_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_107_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_107_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_107_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_107_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_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="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_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="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_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="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_19_" 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/d21/classothers_1_1_cache_1_1_d___node.html" target="_self">others::Cache::D_Node&lt; T &gt;</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_20_" 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/d21/classothers_1_1_cache_1_1_d___node.html" target="_self">others::Cache::D_Node&lt; K, V &gt;</a></td><td class="desc"></td></tr>
<tr id="row_21_" 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/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_self">machine_learning::neural_network::layers::DenseLayer</a></td><td class="desc"></td></tr>
<tr id="row_22_" 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/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
<tr id="row_23_" 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/d1f/classdsu.html" target="_self">dsu</a></td><td class="desc">Disjoint sets union data structure, class based representation </td></tr>
<tr id="row_24_" 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/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_25_" 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/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
<tr id="row_26_" 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/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" target="_self">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/15_puzzle" target="_blank">EightPuzzle/15-Puzzle game</a> </td></tr>
<tr id="row_27_" 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/dde/structdouble__hashing_1_1_entry.html" target="_self">double_hashing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_28_" 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/d19/structlinear__probing_1_1_entry.html" target="_self">linear_probing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_29_" 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/dd1/structquadratic__probing_1_1_entry.html" target="_self">quadratic_probing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_30_" 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/dca/class_f_c_f_s.html" target="_self">FCFS&lt; S, T, E &gt;</a></td><td class="desc">Class which implements the <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm </td></tr>
<tr id="row_31_" 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/d0d/classrange__queries_1_1fenwick__tree.html" target="_self">range_queries::fenwick_tree</a></td><td class="desc">The class that initializes the Fenwick Tree </td></tr>
<tr id="row_32_" 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/de5/classbacktracking_1_1generate__parentheses.html" target="_self">backtracking::generate_parentheses</a></td><td class="desc">Generate_parentheses class </td></tr>
<tr id="row_33_" 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/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html" target="_self">probability::geometric_dist::geometric_distribution</a></td><td class="desc">A class to model the geometric distribution </td></tr>
<tr id="row_34_" 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/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_35_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_35_" class="arrow" onclick="dynsection.toggleFolder('35_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d61/classgraph_1_1_graph.html" target="_self">graph::Graph&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_35_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="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">graph::RootedTree</a></td><td class="desc"></td></tr>
<tr id="row_36_" 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/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" target="_self">graph::is_graph_bipartite::Graph</a></td><td class="desc">Class for representing graph as an adjacency list </td></tr>
<tr id="row_37_" 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/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html" target="_self">greedy_algorithms::dijkstra::Graph</a></td><td class="desc">Wrapper class for storing a graph </td></tr>
<tr id="row_38_" 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/d84/classhashing_1_1sha256_1_1_hash.html" target="_self">hashing::sha256::Hash</a></td><td class="desc">Contains hash array and functions to update it and convert it to a hexadecimal string </td></tr>
<tr id="row_39_" 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/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_40_" 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/d26/classciphers_1_1_hill_cipher.html" target="_self">ciphers::HillCipher</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher" target="_blank">Hill Cipher</a> algorithm </td></tr>
<tr id="row_41_" 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/d69/classgraph_1_1_h_k_graph.html" target="_self">graph::HKGraph</a></td><td class="desc">Represents Bipartite graph for Hopcroft Karp implementation </td></tr>
<tr id="row_42_" 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/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" target="_self">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></td><td class="desc">Struct that handles all the information related to the current state </td></tr>
<tr id="row_43_" 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/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_44_" 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/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html" target="_self">machine_learning::k_nearest_neighbors::Knn</a></td><td class="desc">K-Nearest Neighbors (<a class="el" href="da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html" title="K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.">Knn</a>) class using Euclidean distance as distance metric </td></tr>
<tr id="row_45_" 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/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_46_" 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/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html" target="_self">others::Cache::LFUCache&lt; K, V &gt;</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_47_" 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/d9d/classdata__structures_1_1linked__list_1_1link.html" target="_self">data_structures::linked_list::link</a></td><td class="desc"></td></tr>
<tr id="row_48_" 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/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<tr id="row_49_" 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/def/classdata__structures_1_1linked__list_1_1list.html" target="_self">data_structures::linked_list::list</a></td><td class="desc"></td></tr>
<tr id="row_50_" 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/dab/structdata__structures_1_1list__array_1_1list.html" target="_self">data_structures::list_array::list&lt; N &gt;</a></td><td class="desc">Structure of List with supporting methods </td></tr>
<tr id="row_51_" 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/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_52_" 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/da4/struct_list_node.html" target="_self">ListNode</a></td><td class="desc">For IO operations </td></tr>
<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="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</a></td><td class="desc"></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="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_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="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_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="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></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="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></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="d1/d77/structmst.html" target="_self">mst</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="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_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="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_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="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_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="d9/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</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="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_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="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_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="db/d8b/struct_node.html" target="_self">Node&lt; ValueType &gt;</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="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_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/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_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="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_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="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_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="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_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="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_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="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_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/da1/structnode.html" target="_self">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="db/d8b/struct_node.html" target="_self">Node&lt; value_type &gt;</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="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_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="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_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="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_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="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</a></td><td class="desc"></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="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></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="d8/dc8/struct_point.html" target="_self">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="dd/d1b/structquery.html" target="_self">query</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="dc/db5/struct_queue.html" target="_self">Queue</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="db/da9/classqueue.html" target="_self">queue&lt; ValueType &gt;</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="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_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="d8/d72/class_r_btree.html" target="_self">RBtree</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="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</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="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_88_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_88_" class="arrow" onclick="dynsection.toggleFolder('88_')">&#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_88_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_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/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</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/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></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="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_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="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_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="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_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="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_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="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_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="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></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="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_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="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_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="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_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="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_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="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_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="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></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/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_104_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_104_" class="arrow" onclick="dynsection.toggleFolder('104_')">&#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_104_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_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="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_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="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_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="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></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="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_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="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_110_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_110_" class="arrow" onclick="dynsection.toggleFolder('110_')">&#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_110_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_110_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_110_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_110_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_110_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_110_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_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="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_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="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_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="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 -->

3
hierarchy.js
View File

@@ -19,6 +19,8 @@ var hierarchy =
[ "Complex", "da/d5a/class_complex.html", null ],
[ "geometry::jarvis::Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", null ],
[ "CycleCheck", "d3/dbb/class_cycle_check.html", null ],
[ "others::Cache::D_Node< T >", "de/d21/classothers_1_1_cache_1_1_d___node.html", null ],
[ "others::Cache::D_Node< K, V >", "de/d21/classothers_1_1_cache_1_1_d___node.html", null ],
[ "machine_learning::neural_network::layers::DenseLayer", "dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html", null ],
[ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ],
[ "dsu", "dd/d1f/classdsu.html", null ],
@@ -46,6 +48,7 @@ var hierarchy =
[ "Item", "db/d66/struct_item.html", null ],
[ "machine_learning::k_nearest_neighbors::Knn", "da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html", null ],
[ "large_number", "db/d82/classlarge__number.html", null ],
[ "others::Cache::LFUCache< K, V >", "df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html", null ],
[ "data_structures::linked_list::link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", null ],
[ "linkedlist", "d0/dff/structlinkedlist.html", null ],
[ "data_structures::linked_list::list", "d1/def/classdata__structures_1_1linked__list_1_1list.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="$d8/dab/classstatistics_1_1stats__computer2.html" title=" " alt="" coords="5,5,217,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_100.md5
View File

@@ -1 +1 @@
efb55af1cccef519836d4c2436ccda42
717e385118aaa4f551bc0a7a0954681d

10
inherit_graph_100.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- 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="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="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>
<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: 993 B

After

Width:  |  Height:  |  Size: 971 B

14
inherit_graph_101.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="$d2/dc4/classstack__linked_list.html" title=" " alt="" coords="5,5,121,31"/>
</map>

2
inherit_graph_101.md5
View File

@@ -1 +1 @@
53ba32e546959cac79e584e353db1db7
f583284f2e396e0f7b5fd8bccf0bb840

122
inherit_graph_101.svg
View File

@@ -4,126 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- 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="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 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="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: 6.3 KiB

After

Width:  |  Height:  |  Size: 954 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="$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="$d7/d7c/classstatistics_1_1stats__computer1.html" title=" " alt="" coords="5,5,217,31"/>
</map>

2
inherit_graph_102.md5
View File

@@ -1 +1 @@
d6ee5f042479b5982faa79c9932e1b9c
adf4423c975497d5fe67f2bb0728f9b9

13
inherit_graph_102.svg
View File

@@ -4,17 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- 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="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 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 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>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.1 KiB

After

Width:  |  Height:  |  Size: 993 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="$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="$d8/dab/classstatistics_1_1stats__computer2.html" title=" " alt="" coords="5,5,217,31"/>
</map>

2
inherit_graph_103.md5
View File

@@ -1 +1 @@
abd7e48c602c9ba41e00a619e3234e23
efb55af1cccef519836d4c2436ccda42

10
inherit_graph_103.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- 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">
<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 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="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: 1.0 KiB

After

Width:  |  Height:  |  Size: 993 B

14
inherit_graph_104.map
View File

@@ -1,3 +1,15 @@
<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="/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_104.md5
View File

@@ -1 +1 @@
a9d8d2a80cdf35dfac76eecdbb209456
53ba32e546959cac79e584e353db1db7

122
inherit_graph_104.svg
View File

@@ -4,16 +4,126 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="71pt" height="27pt"
viewBox="0.00 0.00 71.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)">
<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="d5/d58/class_test_cases.html" target="_top" xlink:title="class encapsulating the necessary test cases">
<polygon fill="white" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
<text text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases</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: 986 B

After

Width:  |  Height:  |  Size: 6.3 KiB

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="$d2/d2c/structtower.html" title=" " alt="" coords="5,5,59,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_105.md5
View File

@@ -1 +1 @@
76f1c23145670e75e2e13d0451b74420
d6ee5f042479b5982faa79c9932e1b9c

13
inherit_graph_105.svg
View File

@@ -4,16 +4,17 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="48pt" height="27pt"
viewBox="0.00 0.00 48.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="d2/d2c/structtower.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="40,-19.25 0,-19.25 0,0 40,0 40,-19.25"/>
<text text-anchor="middle" x="20" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tower</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: 922 B

After

Width:  |  Height:  |  Size: 1.1 KiB

2
inherit_graph_106.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$dd/d2f/class_trie.html" title=" " alt="" coords="5,5,49,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>

2
inherit_graph_106.md5
View File

@@ -1 +1 @@
845eae9f7c70e50cf22fb926bd9e034b
abd7e48c602c9ba41e00a619e3234e23

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