|
|
|
|
@@ -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< K, V > 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"> 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&dn=expat.txt MIT */
|
|
|
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
|
|
|
/* @license-end */
|
|
|
|
|
</script>
|
|
|
|
|
<script type="text/javascript">
|
|
|
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&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&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&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> |
|
|
|
|
|
<a href="#pri-methods">Private Member Functions</a> |
|
|
|
|
|
<a href="#pri-attribs">Private Attributes</a> |
|
|
|
|
|
<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< K, V > 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< K, V >:</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"> </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"> </td><td class="mdescRight">Constructor, Initialize with minFreq and _capacity. <br /></td></tr>
|
|
|
|
|
<tr class="separator:affd7776c246caa2d0f92fd8616f6e5dc"><td class="memSeparator" colspan="2"> </td></tr>
|
|
|
|
|
<tr class="memitem:af6f8e5a66a45436b490dfe015ff8866e" id="r_af6f8e5a66a45436b490dfe015ff8866e"><td class="memItemLeft" align="right" valign="top">void </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"> </td><td class="mdescRight">upsert a key-value pair <br /></td></tr>
|
|
|
|
|
<tr class="separator:af6f8e5a66a45436b490dfe015ff8866e"><td class="memSeparator" colspan="2"> </td></tr>
|
|
|
|
|
<tr class="memitem:a58e37d3713f28d36abbb8cdf6c432781" id="r_a58e37d3713f28d36abbb8cdf6c432781"><td class="memItemLeft" align="right" valign="top">V </td><td class="memItemRight" valign="bottom"><a class="el" href="#a58e37d3713f28d36abbb8cdf6c432781">get</a> (K key)</td></tr>
|
|
|
|
|
<tr class="memdesc:a58e37d3713f28d36abbb8cdf6c432781"><td class="mdescLeft"> </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"> </td></tr>
|
|
|
|
|
<tr class="memitem:adbfb2ef7358423fdf1f49d410f55f195" id="r_adbfb2ef7358423fdf1f49d410f55f195"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#adbfb2ef7358423fdf1f49d410f55f195">size</a> () const</td></tr>
|
|
|
|
|
<tr class="memdesc:adbfb2ef7358423fdf1f49d410f55f195"><td class="mdescLeft"> </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"> </td></tr>
|
|
|
|
|
<tr class="memitem:ac27c9076377cbed2a2acc45a189fed2c" id="r_ac27c9076377cbed2a2acc45a189fed2c"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#ac27c9076377cbed2a2acc45a189fed2c">capacity</a> () const</td></tr>
|
|
|
|
|
<tr class="memdesc:ac27c9076377cbed2a2acc45a189fed2c"><td class="mdescLeft"> </td><td class="mdescRight">Returns the total capacity of the cache. <br /></td></tr>
|
|
|
|
|
<tr class="separator:ac27c9076377cbed2a2acc45a189fed2c"><td class="memSeparator" colspan="2"> </td></tr>
|
|
|
|
|
<tr class="memitem:a68e1be0a3e0a6478aa35f04000e0e9b0" id="r_a68e1be0a3e0a6478aa35f04000e0e9b0"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#a68e1be0a3e0a6478aa35f04000e0e9b0">empty</a> () const</td></tr>
|
|
|
|
|
<tr class="memdesc:a68e1be0a3e0a6478aa35f04000e0e9b0"><td class="mdescLeft"> </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"> </td></tr>
|
|
|
|
|
<tr class="memitem:a8857531ecc8ed2e36868e267148eff36" id="r_a8857531ecc8ed2e36868e267148eff36"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="#a8857531ecc8ed2e36868e267148eff36">~LFUCache</a> ()</td></tr>
|
|
|
|
|
<tr class="memdesc:a8857531ecc8ed2e36868e267148eff36"><td class="mdescLeft"> </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"> </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 </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>< K, V > *<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
|
|
|
|
|
<tr class="memdesc:adad4ab43141fb8ba43facd3a71e07047"><td class="mdescLeft"> </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"> </td></tr>
|
|
|
|
|
<tr class="memitem:a16a25c102554c5653721a5112ef676c9" id="r_a16a25c102554c5653721a5112ef676c9"><td class="memItemLeft" align="right" valign="top">void </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>< <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>< K, V > *, int > &p_node)</td></tr>
|
|
|
|
|
<tr class="memdesc:a16a25c102554c5653721a5112ef676c9"><td class="mdescLeft"> </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"> </td></tr>
|
|
|
|
|
<tr class="memitem:ab3561ab204754295199f9566924f7e69" id="r_ab3561ab204754295199f9566924f7e69"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#ab3561ab204754295199f9566924f7e69">pop</a> ()</td></tr>
|
|
|
|
|
<tr class="memdesc:ab3561ab204754295199f9566924f7e69"><td class="mdescLeft"> </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"> </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>< K, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>< K, V > *, int > > </td><td class="memItemRight" valign="bottom"><b>node_map</b></td></tr>
|
|
|
|
|
<tr class="memdesc:ac7684879e2e5da3d8bc5b1699ee42d35"><td class="mdescLeft"> </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"> </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>< int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>< K, V > *, <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>< K, V > * > > </td><td class="memItemRight" valign="bottom"><b>freq_map</b></td></tr>
|
|
|
|
|
<tr class="memdesc:aba5d59d0f6ab0c0d30a92551ca5a05f2"><td class="mdescLeft"> </td><td class="mdescRight">maps the frequency to doubly linked list <br /></td></tr>
|
|
|
|
|
<tr class="separator:aba5d59d0f6ab0c0d30a92551ca5a05f2"><td class="memSeparator" colspan="2"> </td></tr>
|
|
|
|
|
<tr class="memitem:a6de844d1589a809239cc07752f311285" id="r_a6de844d1589a809239cc07752f311285"><td class="memItemLeft" align="right" valign="top"><a id="a6de844d1589a809239cc07752f311285" name="a6de844d1589a809239cc07752f311285"></a>
|
|
|
|
|
int </td><td class="memItemRight" valign="bottom"><b>minFreq</b></td></tr>
|
|
|
|
|
<tr class="memdesc:a6de844d1589a809239cc07752f311285"><td class="mdescLeft"> </td><td class="mdescRight">minimum frequency in the cache <br /></td></tr>
|
|
|
|
|
<tr class="separator:a6de844d1589a809239cc07752f311285"><td class="memSeparator" colspan="2"> </td></tr>
|
|
|
|
|
<tr class="memitem:a3acc10e6bb67d9d9c4187f625723e6c5" id="r_a3acc10e6bb67d9d9c4187f625723e6c5"><td class="memItemLeft" align="right" valign="top"><a id="a3acc10e6bb67d9d9c4187f625723e6c5" name="a3acc10e6bb67d9d9c4187f625723e6c5"></a>
|
|
|
|
|
int </td><td class="memItemRight" valign="bottom"><b>_capacity</b></td></tr>
|
|
|
|
|
<tr class="memdesc:a3acc10e6bb67d9d9c4187f625723e6c5"><td class="mdescLeft"> </td><td class="mdescRight">maximum capacity of the cache <br /></td></tr>
|
|
|
|
|
<tr class="separator:a3acc10e6bb67d9d9c4187f625723e6c5"><td class="memSeparator" colspan="2"> </td></tr>
|
|
|
|
|
</table>
|
|
|
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
|
|
|
<div class="textblock"><div class="compoundTemplParams">template<typename K, typename V><br />
|
|
|
|
|
class others::Cache::LFUCache< K, V ></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 & Destructor Documentation</h2>
|
|
|
|
|
<a id="affd7776c246caa2d0f92fd8616f6e5dc" name="affd7776c246caa2d0f92fd8616f6e5dc"></a>
|
|
|
|
|
<h2 class="memtitle"><span class="permalink"><a href="#affd7776c246caa2d0f92fd8616f6e5dc">◆ </a></span>LFUCache()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<div class="memtemplate">
|
|
|
|
|
template<typename K , typename V > </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>< K, V >::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">◆ </a></span>~LFUCache()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<div class="memtemplate">
|
|
|
|
|
template<typename K , typename V > </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>< K, V >::~<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->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< K, std::pair< CacheNode< K, V > *, int > > 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">◆ </a></span>capacity()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<div class="memtemplate">
|
|
|
|
|
template<typename K , typename V > </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>< K, V >::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">◆ </a></span>empty()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<div class="memtemplate">
|
|
|
|
|
template<typename K , typename V > </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>< K, V >::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">◆ </a></span>get()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<div class="memtemplate">
|
|
|
|
|
template<typename K , typename V > </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>< K, V >::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">"key is not present in the cache"</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->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< CacheNode< K, V > *, int > &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">◆ </a></span>increase_frequency()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<div class="memtemplate">
|
|
|
|
|
template<typename K , typename V > </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>< K, V >::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>< <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>< K, V > *, int > &</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<K, V> *<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<CacheNode<K, V></a> *, CacheNode<K, V> *> &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> && 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<K, V> *<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>->prev;</div>
|
|
|
|
|
<div class="line"><span class="lineno"> 126</span> CacheNode<K, V> *<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>->next;</div>
|
|
|
|
|
<div class="line"><span class="lineno"> 127</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->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>->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>->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>->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< int, std::pair< CacheNode< K, V > *, CacheNode< K, V > * > > 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< K, V > *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">◆ </a></span>pop()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<div class="memtemplate">
|
|
|
|
|
template<typename K , typename V > </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>< K, V >::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<CacheNode<K, V></a> *, CacheNode<K, V> *> &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<K, V> *temp = p.second;</div>
|
|
|
|
|
<div class="line"><span class="lineno"> 163</span> p.second = temp->prev;</div>
|
|
|
|
|
<div class="line"><span class="lineno"> 164</span> p.second->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">◆ </a></span>push()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<div class="memtemplate">
|
|
|
|
|
template<typename K , typename V > </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>< K, V >::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>< K, V > *</td> <td class="paramname"><span class="paramname"><em>node</em></span> )</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<CacheNode<K, V></a> *, CacheNode<K, V> *> &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->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>->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">◆ </a></span>put()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<div class="memtemplate">
|
|
|
|
|
template<typename K , typename V > </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>< K, V >::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> )</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->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->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<K, V> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> CacheNode<K, V>({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">◆ </a></span>size()</h2>
|
|
|
|
|
|
|
|
|
|
<div class="memitem">
|
|
|
|
|
<div class="memproto">
|
|
|
|
|
<div class="memtemplate">
|
|
|
|
|
template<typename K , typename V > </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>< K, V >::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>
|