Skip to content

Commit 66e8266

Browse files
Documentation for 80777da
1 parent ae0e85c commit 66e8266

File tree

115 files changed

+2858
-884
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

115 files changed

+2858
-884
lines changed

annotated.html

Lines changed: 11 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -296,16 +296,17 @@
296296
<tr id="row_50_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
297297
<tr id="row_51_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
298298
<tr id="row_52_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
299-
<tr id="row_53_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
300-
<tr id="row_54_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc">For std::invalid_argument </td></tr>
301-
<tr id="row_55_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
302-
<tr id="row_56_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
303-
<tr id="row_57_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
304-
<tr id="row_58_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
305-
<tr id="row_59_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_59_" class="arrow" onclick="dynsection.toggleFolder('59_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
306-
<tr id="row_59_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
307-
<tr id="row_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
308-
<tr id="row_61_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
299+
<tr id="row_53_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d9f/class_s_j_f.html" target="_self">SJF</a></td><td class="desc">Class which implements the <a class="el" href="d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm.">SJF</a> scheduling algorithm </td></tr>
300+
<tr id="row_54_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
301+
<tr id="row_55_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc">For std::invalid_argument </td></tr>
302+
<tr id="row_56_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
303+
<tr id="row_57_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
304+
<tr id="row_58_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
305+
<tr id="row_59_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
306+
<tr id="row_60_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_60_" class="arrow" onclick="dynsection.toggleFolder('60_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
307+
<tr id="row_60_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
308+
<tr id="row_61_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
309+
<tr id="row_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
309310
</table>
310311
</div><!-- directory -->
311312
</div><!-- contents -->

annotated_dup.js

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -221,6 +221,7 @@ var annotated_dup =
221221
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
222222
[ "RBtree", "d8/d72/class_r_btree.html", null ],
223223
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ],
224+
[ "SJF", "d7/d9f/class_s_j_f.html", "d7/d9f/class_s_j_f" ],
224225
[ "Solution", "dd/d4f/class_solution.html", null ],
225226
[ "stack", "d1/dc2/classstack.html", "d1/dc2/classstack" ],
226227
[ "stack_linkedList", "d2/dc4/classstack__linked_list.html", null ],

classes.html

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -176,7 +176,7 @@
176176
<dd><a class="el" href="d8/d72/class_r_btree.html">RBtree</a></dd><dd><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)</dd></dl>
177177
<dl class="classindex even">
178178
<dt class="alphachar"><a id="letter_S" name="letter_S">S</a></dt>
179-
<dd><a class="el" href="d4/db4/struct_segment_intersection.html">SegmentIntersection</a></dd><dd><a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html">SegmentTree</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG</a> (range_queries::heavy_light_decomposition)</dd><dd><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html">SkipList</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d4f/class_solution.html">Solution</a></dd><dd><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">Sparse_table</a> (data_structures::sparse_table)</dd><dd><a class="el" href="d2/dc8/classdata__structures_1_1_stack.html">Stack</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html">Stack</a> (data_structures::stack_using_queue)</dd><dd><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> (others::postfix_expression)</dd><dd><a class="el" href="d1/dc2/classstack.html">stack</a></dd><dd><a class="el" href="d2/dc4/classstack__linked_list.html">stack_linkedList</a></dd><dd><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)</dd><dd><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)</dd></dl>
179+
<dd><a class="el" href="d4/db4/struct_segment_intersection.html">SegmentIntersection</a></dd><dd><a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html">SegmentTree</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG</a> (range_queries::heavy_light_decomposition)</dd><dd><a class="el" href="d7/d9f/class_s_j_f.html">SJF</a></dd><dd><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html">SkipList</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d4f/class_solution.html">Solution</a></dd><dd><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">Sparse_table</a> (data_structures::sparse_table)</dd><dd><a class="el" href="d2/dc8/classdata__structures_1_1_stack.html">Stack</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html">Stack</a> (data_structures::stack_using_queue)</dd><dd><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> (others::postfix_expression)</dd><dd><a class="el" href="d1/dc2/classstack.html">stack</a></dd><dd><a class="el" href="d2/dc4/classstack__linked_list.html">stack_linkedList</a></dd><dd><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)</dd><dd><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)</dd></dl>
180180
<dl class="classindex odd">
181181
<dt class="alphachar"><a id="letter_T" name="letter_T">T</a></dt>
182182
<dd><a class="el" href="da/d86/struct_test_case.html">TestCase</a></dd><dd><a class="el" href="d5/d58/class_test_cases.html">TestCases</a></dd><dd><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> (operations_on_datastructures::trie_operations)</dd><dd><a class="el" href="d2/d2c/structtower.html">tower</a></dd><dd><a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html">Treap</a> (<a class="el" href="dd/d2e/namespacedata__structures_1_1treap.html">data_structures::treap</a>)</dd><dd><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree</a> (range_queries::heavy_light_decomposition)</dd><dd><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a> (data_structures::tree_234)</dd><dd><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">Trie</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="dd/d2f/class_trie.html">Trie</a></dd><dd><a class="el" href="d0/d3e/classdata__structures_1_1trie.html">trie</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="de/d48/struct_trie_1_1_trie_node.html">Trie::TrieNode</a></dd></dl>
Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
<map id="cpu_scheduling_algorithms/non_preemptive_sjf_scheduling.cpp" name="cpu_scheduling_algorithms/non_preemptive_sjf_scheduling.cpp">
2+
<area shape="rect" id="Node000001" title="Implementation of SJF CPU scheduling algorithm." alt="" coords="246,5,479,46"/>
3+
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,80,120"/>
4+
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="283,49,95,95,94,90,282,44"/>
5+
<area shape="rect" id="Node000003" title=" " alt="" coords="104,94,168,120"/>
6+
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="307,49,184,92,182,87,305,44"/>
7+
<area shape="rect" id="Node000004" title=" " alt="" coords="192,94,258,120"/>
8+
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="330,49,260,88,258,84,327,44"/>
9+
<area shape="rect" id="Node000005" title=" " alt="" coords="283,94,354,120"/>
10+
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="354,48,335,82,330,79,349,45"/>
11+
<area shape="rect" id="Node000006" title=" " alt="" coords="378,94,435,120"/>
12+
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="376,45,395,79,390,82,371,48"/>
13+
<area shape="rect" id="Node000007" title=" " alt="" coords="458,94,523,120"/>
14+
<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="396,44,460,83,457,88,393,49"/>
15+
<area shape="rect" id="Node000008" title=" " alt="" coords="547,94,650,120"/>
16+
<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="422,44,548,86,547,91,421,49"/>
17+
<area shape="rect" id="Node000009" title=" " alt="" coords="674,94,731,120"/>
18+
<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="458,44,659,91,658,96,456,49"/>
19+
</map>
Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
ba4f96624d26113bb997e93dedb40676

0 commit comments

Comments
 (0)