mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-24 05:42:59 +08:00
Documentation for c6af943508
This commit is contained in:
realstealthninja
@@ -148,7 +148,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
|
||||
<tr id="row_3_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </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">Matrix</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_4_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_4_" class="arrow" onclick="dynsection.toggleFolder('4_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d65/namespacedouble__hashing.html" target="_self">double_hashing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double hashing</a> algorithm </td></tr>
|
||||
<tr id="row_4_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_5_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_5_" class="arrow" onclick="dynsection.toggleFolder('5_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d5f/namespacegeometry.html" target="_self">geometry</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_5_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_5_" class="arrow" onclick="dynsection.toggleFolder('5_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d5f/namespacegeometry.html" target="_self">geometry</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a> </td></tr>
|
||||
<tr id="row_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_5_0_" class="arrow" onclick="dynsection.toggleFolder('5_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>grahamscan</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_5_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </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">Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_5_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_5_1_" class="arrow" onclick="dynsection.toggleFolder('5_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>jarvis</b></td><td class="desc"></td></tr>
|
||||
@@ -168,7 +168,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
|
||||
<tr id="row_7_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </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">Graph</a></td><td class="desc">Wrapper class for storing a graph </td></tr>
|
||||
<tr id="row_7_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/df6/classgreedy__algorithms_1_1_binary_addition.html" target="_self">BinaryAddition</a></td><td class="desc">A class to perform binary addition of two binary strings </td></tr>
|
||||
<tr id="row_7_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d49/classgreedy__algorithms_1_1_digit_separation.html" target="_self">DigitSeparation</a></td><td class="desc">A class that provides methods to separate the digits of a large positive number </td></tr>
|
||||
<tr id="row_8_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_8_" class="arrow" onclick="dynsection.toggleFolder('8_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d0c/namespacehashing.html" target="_self">hashing</a></td><td class="desc">Hashing algorithms </td></tr>
|
||||
<tr id="row_8_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_8_" class="arrow" onclick="dynsection.toggleFolder('8_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d0c/namespacehashing.html" target="_self">hashing</a></td><td class="desc">Used for assert </td></tr>
|
||||
<tr id="row_8_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_8_0_" class="arrow" onclick="dynsection.toggleFolder('8_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>sha256</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_8_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </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">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_9_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_9_" class="arrow" onclick="dynsection.toggleFolder('9_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d89/namespacelinear__probing.html" target="_self">linear_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Linear_probing" target="_blank">linear probing</a> algorithm </td></tr>
|
||||
@@ -186,7 +186,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
|
||||
<tr id="row_10_2_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </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">DenseLayer</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_10_2_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </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">NeuralNetwork</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_10_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html" target="_self">adaline</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_11_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_11_" class="arrow" onclick="dynsection.toggleFolder('11_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d47/namespacemath.html" target="_self">math</a></td><td class="desc">For IO operations </td></tr>
|
||||
<tr id="row_11_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_11_" class="arrow" onclick="dynsection.toggleFolder('11_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d47/namespacemath.html" target="_self">math</a></td><td class="desc">For assert </td></tr>
|
||||
<tr id="row_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_11_0_" class="arrow" onclick="dynsection.toggleFolder('11_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>ncr_modulo_p</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_11_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </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">NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
|
||||
<tr id="row_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_12_" class="arrow" onclick="dynsection.toggleFolder('12_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/d6d/namespaceoperations__on__datastructures.html" target="_self">operations_on_datastructures</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
@@ -230,7 +230,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
|
||||
<tr id="row_16_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d0d/classrange__queries_1_1fenwick__tree.html" target="_self">fenwick_tree</a></td><td class="desc">The class that initializes the Fenwick Tree </td></tr>
|
||||
<tr id="row_16_2_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_16_2_" class="arrow" onclick="dynsection.toggleFolder('16_2_')">►</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">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_16_2_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </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">Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_17_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_17_" class="arrow" onclick="dynsection.toggleFolder('17_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_17_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_17_" class="arrow" onclick="dynsection.toggleFolder('17_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</a></td><td class="desc">For std::assert </td></tr>
|
||||
<tr id="row_17_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_17_0_" class="arrow" onclick="dynsection.toggleFolder('17_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>sublist_search</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_17_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </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">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_18_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_18_" class="arrow" onclick="dynsection.toggleFolder('18_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
|
||||
@@ -257,7 +257,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
|
||||
<tr id="row_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_29_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_31_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_31_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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 assert </td></tr>
|
||||
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_33_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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</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_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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>
|
||||
|
||||
Reference in New Issue
Block a user