mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-25 22:32:24 +08:00
208 lines
24 KiB
HTML
208 lines
24 KiB
HTML
<!-- HTML header for doxygen 1.12.0-->
|
|
<!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.14.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>TheAlgorithms/C++: data_structures Directory Reference</title>
|
|
<link rel="icon" href="favicon.svg" type="image/x-icon" />
|
|
<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="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
|
<script type="text/javascript">
|
|
DoxygenAwesomeDarkModeToggle.init()
|
|
</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="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/javascript">
|
|
window.MathJax = {
|
|
options: {
|
|
ignoreHtmlClass: 'tex2jax_ignore',
|
|
processHtmlClass: 'tex2jax_process'
|
|
},
|
|
loader: {
|
|
load: ['[tex]/ams']
|
|
},
|
|
tex: {
|
|
macros: {},
|
|
packages: ['base','configmacros','ams']
|
|
}
|
|
};
|
|
</script>
|
|
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr id="projectrow">
|
|
<td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
|
|
<td id="projectalign">
|
|
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">All the algorithms implemented in C++</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.14.0 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "search/",'.html');
|
|
</script>
|
|
<script type="text/javascript">
|
|
$(function() { codefold.init(); });
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
</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">
|
|
$(function(){initNavTree('dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html','',''); });
|
|
</script>
|
|
<div id="container">
|
|
<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">data_structures Directory Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-subdirs" class="groupheader"><a id="subdirs" name="subdirs"></a>
|
|
Directories</h2></td></tr>
|
|
<tr class="memitem:cll" id="r_cll"><td class="memItemLeft" align="right" valign="top"><span class="iconfolder"><div class="folder-icon"></div></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="dir_f1797d0c2a0a12033e7d74efffeb14e1.html">cll</a></td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-files" class="groupheader"><a id="files" name="files"></a>
|
|
Files</h2></td></tr>
|
|
<tr class="memitem:avltree_2Ecpp" id="r_avltree_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d8/dee/avltree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dee/avltree_8cpp.html">avltree.cpp</a></td></tr>
|
|
<tr class="memdesc:d8/dee/avltree_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">A simple tree implementation using nodes. <br /></td></tr>
|
|
<tr class="memitem:binary_5Fsearch_5Ftree_2Ecpp" id="r_binary_5Fsearch_5Ftree_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/d26/binary__search__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d26/binary__search__tree_8cpp.html">binary_search_tree.cpp</a></td></tr>
|
|
<tr class="memdesc:d3/d26/binary__search__tree_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">A simple tree implementation using structured nodes. <br /></td></tr>
|
|
<tr class="memitem:binary_5Fsearch_5Ftree2_2Ecpp" id="r_binary_5Fsearch_5Ftree2_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="df/d42/binary__search__tree2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="df/d42/binary__search__tree2_8cpp.html">binary_search_tree2.cpp</a></td></tr>
|
|
<tr class="memdesc:df/d42/binary__search__tree2_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">A generic <a href="https://en.wikipedia.org/wiki/Binary_search_tree" target="_blank">binary search tree</a> implementation. Here you can find more information about the algorithm: <a href="https://www.scaler.com/topics/data-structures/binary-search-tree/" target="_blank">Scaler - Binary Search tree</a>. <br /></td></tr>
|
|
<tr class="memitem:binaryheap_2Ecpp" id="r_binaryheap_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="de/dc3/binaryheap_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/dc3/binaryheap_8cpp.html">binaryheap.cpp</a></td></tr>
|
|
<tr class="memdesc:de/dc3/binaryheap_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">A C++ program to demonstrate common Binary Heap Operations. <br /></td></tr>
|
|
<tr class="memitem:bloom_5Ffilter_2Ecpp" id="r_bloom_5Ffilter_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/dab/bloom__filter_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d9/dab/bloom__filter_8cpp.html">bloom_filter.cpp</a></td></tr>
|
|
<tr class="memdesc:d9/dab/bloom__filter_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Bloom_filter" target="_blank">Bloom Filter</a> generic implementation in C++ <br /></td></tr>
|
|
<tr class="memitem:circular_5Fqueue_5Fusing_5Flinked_5Flist_2Ecpp" id="r_circular_5Fqueue_5Fusing_5Flinked_5Flist_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/dfd/circular__queue__using__linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>circular_queue_using_linked_list.cpp</b></td></tr>
|
|
<tr class="memitem:disjoint_5Fset_2Ecpp" id="r_disjoint_5Fset_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="de/d23/disjoint__set_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/d23/disjoint__set_8cpp.html">disjoint_set.cpp</a></td></tr>
|
|
<tr class="memdesc:de/d23/disjoint__set_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Disjoint Sets Data Structure (Disjoint Sets)</a> <br /></td></tr>
|
|
<tr class="memitem:doubly_5Flinked_5Flist_2Ecpp" id="r_doubly_5Flinked_5Flist_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d7/d85/doubly__linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>doubly_linked_list.cpp</b></td></tr>
|
|
<tr class="memitem:dsu_5Fpath_5Fcompression_2Ecpp" id="r_dsu_5Fpath_5Fcompression_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/dae/dsu__path__compression_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dae/dsu__path__compression_8cpp.html">dsu_path_compression.cpp</a></td></tr>
|
|
<tr class="memdesc:d3/dae/dsu__path__compression_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> <br /></td></tr>
|
|
<tr class="memitem:dsu_5Funion_5Frank_2Ecpp" id="r_dsu_5Funion_5Frank_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="df/d28/dsu__union__rank_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="df/d28/dsu__union__rank_8cpp.html">dsu_union_rank.cpp</a></td></tr>
|
|
<tr class="memdesc:df/d28/dsu__union__rank_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> <br /></td></tr>
|
|
<tr class="memitem:linked_5Flist_2Ecpp" id="r_linked_5Flist_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="da/dc3/linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="da/dc3/linked__list_8cpp.html">linked_list.cpp</a></td></tr>
|
|
<tr class="memdesc:da/dc3/linked__list_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of singly linked list algorithm. <br /></td></tr>
|
|
<tr class="memitem:linkedlist_5Fimplentation_5Fusingarray_2Ecpp" id="r_linkedlist_5Fimplentation_5Fusingarray_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/dce/linkedlist__implentation__usingarray_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html">linkedlist_implentation_usingarray.cpp</a></td></tr>
|
|
<tr class="memdesc:d3/dce/linkedlist__implentation__usingarray_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Linked list implementation using Arrays. <br /></td></tr>
|
|
<tr class="memitem:list_5Farray_2Ecpp" id="r_list_5Farray_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d7/d00/list__array_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d00/list__array_8cpp.html">list_array.cpp</a></td></tr>
|
|
<tr class="memdesc:d7/d00/list__array_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Dynamic_array" target="_blank">Dynamic Array</a> <br /></td></tr>
|
|
<tr class="memitem:morrisinorder_2Ecpp" id="r_morrisinorder_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d5/dc5/morrisinorder_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>morrisinorder.cpp</b></td></tr>
|
|
<tr class="memitem:node_2Ehpp" id="r_node_2Ehpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/d09/node_8hpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d09/node_8hpp.html">node.hpp</a></td></tr>
|
|
<tr class="memdesc:d3/d09/node_8hpp"><td class="mdescLeft"> </td><td class="mdescRight">Provides <a class="el" href="db/d8b/struct_node.html">Node</a> class and related utilities. <br /></td></tr>
|
|
<tr class="memitem:queue_2Ehpp" id="r_queue_2Ehpp"><td class="memItemLeft" align="right" valign="top"><a href="d7/ded/queue_8hpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>queue.hpp</b></td></tr>
|
|
<tr class="memitem:queue_5Fusing_5Farray_2Ecpp" id="r_queue_5Fusing_5Farray_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d8/df0/queue__using__array_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d8/df0/queue__using__array_8cpp.html">queue_using_array.cpp</a></td></tr>
|
|
<tr class="memdesc:d8/df0/queue__using__array_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of Linear [<a class="el" href="dc/db5/struct_queue.html">Queue</a> using array] (<a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">https://www.geeksforgeeks.org/array-implementation-of-queue-simple/</a>). <br /></td></tr>
|
|
<tr class="memitem:queue_5Fusing_5Farray2_2Ecpp" id="r_queue_5Fusing_5Farray2_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="df/da7/queue__using__array2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>queue_using_array2.cpp</b></td></tr>
|
|
<tr class="memitem:queue_5Fusing_5Flinked_5Flist_2Ecpp" id="r_queue_5Fusing_5Flinked_5Flist_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d8/db7/queue__using__linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>queue_using_linked_list.cpp</b></td></tr>
|
|
<tr class="memitem:queue_5Fusing_5Flinkedlist_2Ecpp" id="r_queue_5Fusing_5Flinkedlist_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="de/d5b/queue__using__linkedlist_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>queue_using_linkedlist.cpp</b></td></tr>
|
|
<tr class="memitem:queue_5Fusing_5Ftwo_5Fstacks_2Ecpp" id="r_queue_5Fusing_5Ftwo_5Fstacks_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="df/dd0/queue__using__two__stacks_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html">queue_using_two_stacks.cpp</a></td></tr>
|
|
<tr class="memitem:rb_5Ftree_2Ecpp" id="r_rb_5Ftree_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/dad/rb__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>rb_tree.cpp</b></td></tr>
|
|
<tr class="memitem:reverse_5Fa_5Flinked_5Flist_2Ecpp" id="r_reverse_5Fa_5Flinked_5Flist_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d6/d05/reverse__a__linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d05/reverse__a__linked__list_8cpp.html">reverse_a_linked_list.cpp</a></td></tr>
|
|
<tr class="memdesc:d6/d05/reverse__a__linked__list_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of <a href="https://simple.wikipedia.org/wiki/Linked_list" target="_blank">Reversing a single linked list</a> <br /></td></tr>
|
|
<tr class="memitem:segment_5Ftree_2Ecpp" id="r_segment_5Ftree_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="de/dd1/segment__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/dd1/segment__tree_8cpp.html">segment_tree.cpp</a></td></tr>
|
|
<tr class="memdesc:de/dd1/segment__tree_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">A data structure to quickly do operations on ranges: the <a href="https://en.wikipedia.org/wiki/Segment_tree" target="_blank">Segment Tree</a> algorithm implementation. <br /></td></tr>
|
|
<tr class="memitem:skip_5Flist_2Ecpp" id="r_skip_5Flist_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d0/d5a/skip__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d5a/skip__list_8cpp.html">skip_list.cpp</a></td></tr>
|
|
<tr class="memdesc:d0/d5a/skip__list_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Data structure for fast searching and insertion in \(O(\log n)\) time. <br /></td></tr>
|
|
<tr class="memitem:sparse_5Ftable_2Ecpp" id="r_sparse_5Ftable_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d8/dab/sparse__table_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dab/sparse__table_8cpp.html">sparse_table.cpp</a></td></tr>
|
|
<tr class="memdesc:d8/dab/sparse__table_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of <a href="https://brilliant.org/wiki/sparse-table/" target="_blank">Sparse Table</a> for <span class="tt">min()</span> function. <br /></td></tr>
|
|
<tr class="memitem:stack_2Ehpp" id="r_stack_2Ehpp"><td class="memItemLeft" align="right" valign="top"><a href="df/d47/stack_8hpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="df/d47/stack_8hpp.html">stack.hpp</a></td></tr>
|
|
<tr class="memdesc:df/d47/stack_8hpp"><td class="mdescLeft"> </td><td class="mdescRight">This class specifies the basic operation on a stack as a linked list. <br /></td></tr>
|
|
<tr class="memitem:stack_5Fusing_5Farray_2Ecpp" id="r_stack_5Fusing_5Farray_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d8/d96/stack__using__array_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>stack_using_array.cpp</b></td></tr>
|
|
<tr class="memitem:stack_5Fusing_5Flinked_5Flist_2Ecpp" id="r_stack_5Fusing_5Flinked_5Flist_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/dea/stack__using__linked__list_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>stack_using_linked_list.cpp</b></td></tr>
|
|
<tr class="memitem:stack_5Fusing_5Fqueue_2Ecpp" id="r_stack_5Fusing_5Fqueue_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d7/d43/stack__using__queue_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>stack_using_queue.cpp</b></td></tr>
|
|
<tr class="memitem:test_5Fqueue_2Ecpp" id="r_test_5Fqueue_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d8/dce/test__queue_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>test_queue.cpp</b></td></tr>
|
|
<tr class="memitem:test_5Fstack_2Ecpp" id="r_test_5Fstack_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/dbf/test__stack_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>test_stack.cpp</b></td></tr>
|
|
<tr class="memitem:test_5Fstack_5Fstudents_2Ecpp" id="r_test_5Fstack_5Fstudents_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="db/dbd/test__stack__students_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>test_stack_students.cpp</b></td></tr>
|
|
<tr class="memitem:treap_2Ecpp" id="r_treap_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d0/dd2/treap_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d0/dd2/treap_8cpp.html">treap.cpp</a></td></tr>
|
|
<tr class="memdesc:d0/dd2/treap_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">A balanced binary search tree (BST) on the basis of binary search tree and heap: the <a href="https://en.wikipedia.org/wiki/Treap" target="_blank">Treap</a> algorithm implementation. <br /></td></tr>
|
|
<tr class="memitem:tree_2Ecpp" id="r_tree_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d1/d12/tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><b>tree.cpp</b></td></tr>
|
|
<tr class="memitem:tree_5F234_2Ecpp" id="r_tree_5F234_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="db/dbc/tree__234_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="db/dbc/tree__234_8cpp.html">tree_234.cpp</a></td></tr>
|
|
<tr class="memdesc:db/dbc/tree__234_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">A demo 2-3-4 tree implementation. <br /></td></tr>
|
|
<tr class="memitem:trie_5Fmodern_2Ecpp" id="r_trie_5Fmodern_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="dc/d93/trie__modern_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d93/trie__modern_8cpp.html">trie_modern.cpp</a></td></tr>
|
|
<tr class="memdesc:dc/d93/trie__modern_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">A basic implementation of trie class to store only lower-case strings. <br /></td></tr>
|
|
<tr class="memitem:trie_5Ftree_2Ecpp" id="r_trie_5Ftree_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d7/d83/trie__tree_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d83/trie__tree_8cpp.html">trie_tree.cpp</a></td></tr>
|
|
<tr class="memdesc:d7/d83/trie__tree_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure for English alphabets in small characters. <br /></td></tr>
|
|
<tr class="memitem:trie_5Fusing_5Fhashmap_2Ecpp" id="r_trie_5Fusing_5Fhashmap_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d5/d8a/trie__using__hashmap_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d8a/trie__using__hashmap_8cpp.html">trie_using_hashmap.cpp</a></td></tr>
|
|
<tr class="memdesc:d5/d8a/trie__using__hashmap_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using HashMap for different characters and method for predicting words based on prefix. <br /></td></tr>
|
|
</table>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div id="page-nav" class="page-nav-panel">
|
|
<div id="page-nav-resize-handle"></div>
|
|
<div id="page-nav-tree">
|
|
<div id="page-nav-contents">
|
|
</div><!-- page-nav-contents -->
|
|
</div><!-- page-nav-tree -->
|
|
</div><!-- page-nav -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a href="dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</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.14.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|