From df7c5d2bf9acdc3d3085563de06990607147c13c Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Mon, 18 Oct 2021 14:50:02 +0000
Subject: [PATCH] Documentation for 72e88b30cd6534016f1556d5cb82acfa5e68f2e6
---
annotated.html | 237 +++++----
annotated_dup.js | 9 +-
classes.html | 8 +-
d5/d3c/namespacedata__structures.js | 3 +
d5/d88/md__d_i_r_e_c_t_o_r_y.html | 1 +
...ures_1_1stack__using__queue_1_1_stack.html | 295 +++++++++++
...ctures_1_1stack__using__queue_1_1_stack.js | 10 +
...stack__using__queue_1_1_stack-members.html | 115 ++++
dd/db1/namespacedata__strcutres.html | 114 ++++
df/d1c/namespacestack__using__queue.html | 111 ++++
functions_a.html | 1 +
functions_c.html | 1 +
functions_func_p.html | 4 +-
functions_func_s.html | 2 +-
functions_func_t.html | 2 +-
functions_m.html | 1 +
functions_p.html | 4 +-
functions_s.html | 2 +-
functions_t.html | 2 +-
functions_vars.html | 3 +
hierarchy.html | 64 +--
hierarchy.js | 7 +-
inherit_graph_18.map | 2 +-
inherit_graph_18.md5 | 2 +-
inherit_graph_18.svg | 14 +-
inherit_graph_19.map | 2 +-
inherit_graph_19.md5 | 2 +-
inherit_graph_19.svg | 4 +-
inherit_graph_20.map | 2 +-
inherit_graph_20.md5 | 2 +-
inherit_graph_20.svg | 15 +-
inherit_graph_21.map | 2 +-
inherit_graph_21.md5 | 2 +-
inherit_graph_21.svg | 15 +-
inherit_graph_22.map | 2 +-
inherit_graph_22.md5 | 2 +-
inherit_graph_22.svg | 12 +-
inherit_graph_23.map | 2 +-
inherit_graph_23.md5 | 2 +-
inherit_graph_23.svg | 15 +-
inherit_graph_24.map | 2 +-
inherit_graph_24.md5 | 2 +-
inherit_graph_24.svg | 12 +-
inherit_graph_25.map | 2 +-
inherit_graph_25.md5 | 2 +-
inherit_graph_25.svg | 12 +-
inherit_graph_26.map | 2 +-
inherit_graph_26.md5 | 2 +-
inherit_graph_26.svg | 12 +-
inherit_graph_27.map | 2 +-
inherit_graph_27.md5 | 2 +-
inherit_graph_27.svg | 12 +-
inherit_graph_28.map | 2 +-
inherit_graph_28.md5 | 2 +-
inherit_graph_28.svg | 12 +-
inherit_graph_29.map | 2 +-
inherit_graph_29.md5 | 2 +-
inherit_graph_29.svg | 12 +-
inherit_graph_30.map | 2 +-
inherit_graph_30.md5 | 2 +-
inherit_graph_30.svg | 12 +-
inherit_graph_31.map | 2 +-
inherit_graph_31.md5 | 2 +-
inherit_graph_31.svg | 12 +-
inherit_graph_32.map | 3 +-
inherit_graph_32.md5 | 2 +-
inherit_graph_32.svg | 27 +-
inherit_graph_33.map | 3 +-
inherit_graph_33.md5 | 2 +-
inherit_graph_33.svg | 27 +-
inherit_graph_34.map | 2 +-
inherit_graph_34.md5 | 2 +-
inherit_graph_34.svg | 15 +-
inherit_graph_35.map | 2 +-
inherit_graph_35.md5 | 2 +-
inherit_graph_35.svg | 15 +-
inherit_graph_36.map | 2 +-
inherit_graph_36.md5 | 2 +-
inherit_graph_36.svg | 12 +-
inherit_graph_37.map | 2 +-
inherit_graph_37.md5 | 2 +-
inherit_graph_37.svg | 12 +-
inherit_graph_38.map | 2 +-
inherit_graph_38.md5 | 2 +-
inherit_graph_38.svg | 12 +-
inherit_graph_39.map | 2 +-
inherit_graph_39.md5 | 2 +-
inherit_graph_39.svg | 12 +-
inherit_graph_40.map | 2 +-
inherit_graph_40.md5 | 2 +-
inherit_graph_40.svg | 12 +-
inherit_graph_41.map | 2 +-
inherit_graph_41.md5 | 2 +-
inherit_graph_41.svg | 12 +-
inherit_graph_42.map | 2 +-
inherit_graph_42.md5 | 2 +-
inherit_graph_42.svg | 12 +-
inherit_graph_43.map | 2 +-
inherit_graph_43.md5 | 2 +-
inherit_graph_43.svg | 16 +-
inherit_graph_44.map | 2 +-
inherit_graph_44.md5 | 2 +-
inherit_graph_44.svg | 12 +-
inherit_graph_45.map | 2 +-
inherit_graph_45.md5 | 2 +-
inherit_graph_45.svg | 12 +-
inherit_graph_46.map | 2 +-
inherit_graph_46.md5 | 2 +-
inherit_graph_46.svg | 17 +-
inherit_graph_47.map | 2 +-
inherit_graph_47.md5 | 2 +-
inherit_graph_47.svg | 14 +-
inherit_graph_48.map | 2 +-
inherit_graph_48.md5 | 2 +-
inherit_graph_48.svg | 12 +-
inherit_graph_49.map | 2 +-
inherit_graph_49.md5 | 2 +-
inherit_graph_49.svg | 14 +-
inherit_graph_50.map | 2 +-
inherit_graph_50.md5 | 2 +-
inherit_graph_50.svg | 15 +-
inherit_graph_51.map | 2 +-
inherit_graph_51.md5 | 2 +-
inherit_graph_51.svg | 12 +-
inherit_graph_52.map | 2 +-
inherit_graph_52.md5 | 2 +-
inherit_graph_52.svg | 12 +-
inherit_graph_53.map | 2 +-
inherit_graph_53.md5 | 2 +-
inherit_graph_53.svg | 12 +-
inherit_graph_54.map | 2 +-
inherit_graph_54.md5 | 2 +-
inherit_graph_54.svg | 12 +-
inherit_graph_55.map | 2 +-
inherit_graph_55.md5 | 2 +-
inherit_graph_55.svg | 15 +-
inherit_graph_56.map | 2 +-
inherit_graph_56.md5 | 2 +-
inherit_graph_56.svg | 12 +-
inherit_graph_57.map | 2 +-
inherit_graph_57.md5 | 2 +-
inherit_graph_57.svg | 14 +-
inherit_graph_58.map | 2 +-
inherit_graph_58.md5 | 2 +-
inherit_graph_58.svg | 12 +-
inherit_graph_59.map | 2 +-
inherit_graph_59.md5 | 2 +-
inherit_graph_59.svg | 14 +-
inherit_graph_60.map | 2 +-
inherit_graph_60.md5 | 2 +-
inherit_graph_60.svg | 14 +-
inherit_graph_61.map | 2 +-
inherit_graph_61.md5 | 2 +-
inherit_graph_61.svg | 15 +-
inherit_graph_62.map | 2 +-
inherit_graph_62.md5 | 2 +-
inherit_graph_62.svg | 15 +-
inherit_graph_63.map | 2 +-
inherit_graph_63.md5 | 2 +-
inherit_graph_63.svg | 14 +-
inherit_graph_64.map | 2 +-
inherit_graph_64.md5 | 2 +-
inherit_graph_64.svg | 14 +-
inherit_graph_65.map | 2 +-
inherit_graph_65.md5 | 2 +-
inherit_graph_65.svg | 15 +-
inherit_graph_66.map | 2 +-
inherit_graph_66.md5 | 2 +-
inherit_graph_66.svg | 12 +-
inherit_graph_67.map | 2 +-
inherit_graph_67.md5 | 2 +-
inherit_graph_67.svg | 12 +-
inherit_graph_68.map | 4 +-
inherit_graph_68.md5 | 2 +-
inherit_graph_68.svg | 50 +-
inherit_graph_69.map | 4 +-
inherit_graph_69.md5 | 2 +-
inherit_graph_69.svg | 50 +-
inherit_graph_70.map | 2 +-
inherit_graph_70.md5 | 2 +-
inherit_graph_70.svg | 15 +-
inherit_graph_71.map | 2 +-
inherit_graph_71.md5 | 2 +-
inherit_graph_71.svg | 15 +-
inherit_graph_72.map | 2 +-
inherit_graph_72.md5 | 2 +-
inherit_graph_72.svg | 15 +-
inherit_graph_73.map | 2 +-
inherit_graph_73.md5 | 2 +-
inherit_graph_73.svg | 15 +-
inherit_graph_74.map | 2 +-
inherit_graph_74.md5 | 2 +-
inherit_graph_74.svg | 12 +-
inherit_graph_75.map | 2 +-
inherit_graph_75.md5 | 2 +-
inherit_graph_75.svg | 12 +-
inherit_graph_76.map | 2 +-
inherit_graph_76.md5 | 2 +-
inherit_graph_76.svg | 12 +-
inherit_graph_77.map | 2 +-
inherit_graph_77.md5 | 2 +-
inherit_graph_77.svg | 12 +-
inherit_graph_78.map | 2 +-
inherit_graph_78.md5 | 2 +-
inherit_graph_78.svg | 4 +-
inherit_graph_79.map | 8 +-
inherit_graph_79.md5 | 2 +-
inherit_graph_79.svg | 106 +---
inherit_graph_80.map | 8 +-
inherit_graph_80.md5 | 2 +-
inherit_graph_80.svg | 106 +++-
inherit_graph_81.map | 2 +-
inherit_graph_81.md5 | 2 +-
inherit_graph_81.svg | 12 +-
inherit_graph_82.map | 2 +-
inherit_graph_82.md5 | 2 +-
inherit_graph_82.svg | 12 +-
inherit_graph_83.map | 2 +-
inherit_graph_83.md5 | 2 +-
inherit_graph_83.svg | 12 +-
inherit_graph_84.map | 2 +-
inherit_graph_84.md5 | 2 +-
inherit_graph_84.svg | 12 +-
inherit_graph_85.map | 2 +-
inherit_graph_85.md5 | 2 +-
inherit_graph_85.svg | 4 +-
inherit_graph_86.map | 3 +
inherit_graph_86.md5 | 1 +
inherit_graph_86.svg | 22 +
inherits.html | 132 ++---
namespaces.html | 385 +++++++-------
namespaces_dup.js | 2 +
navtreedata.js | 6 +-
navtreeindex0.js | 496 ++++++++---------
navtreeindex1.js | 500 +++++++++---------
navtreeindex10.js | 98 ++--
navtreeindex11.js | 220 ++++----
navtreeindex12.js | 160 +++---
navtreeindex13.js | 132 ++---
navtreeindex14.js | 67 ++-
navtreeindex2.js | 218 ++++----
navtreeindex3.js | 118 ++---
navtreeindex4.js | 212 ++++----
navtreeindex5.js | 168 +++---
navtreeindex6.js | 146 ++---
navtreeindex7.js | 116 ++--
navtreeindex8.js | 190 +++----
navtreeindex9.js | 136 ++---
search/all_11.js | 8 +-
search/all_12.js | 4 +-
search/all_13.js | 4 +-
search/all_14.js | 269 +++++-----
search/all_15.js | 30 +-
search/all_2.js | 15 +-
search/all_4.js | 27 +-
search/all_5.js | 263 ++++-----
search/all_d.js | 61 +--
search/all_e.js | 140 ++---
search/all_f.js | 86 +--
search/classes_10.js | 7 +-
search/classes_12.js | 2 +-
search/classes_2.js | 4 +-
search/classes_d.js | 4 +-
search/functions_10.js | 18 +-
search/functions_12.js | 87 ++-
search/functions_13.js | 8 +-
search/functions_14.js | 16 +-
search/functions_3.js | 4 +-
search/functions_4.js | 4 +-
search/functions_d.js | 103 ++--
search/namespaces_11.js | 19 +-
search/namespaces_3.js | 15 +-
search/variables_1.js | 3 +-
search/variables_3.js | 3 +-
search/variables_c.js | 17 +-
275 files changed, 3958 insertions(+), 3230 deletions(-)
create mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html
create mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.js
create mode 100644 dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html
create mode 100644 dd/db1/namespacedata__strcutres.html
create mode 100644 df/d1c/namespacestack__using__queue.html
create mode 100644 inherit_graph_86.map
create mode 100644 inherit_graph_86.md5
create mode 100644 inherit_graph_86.svg
diff --git a/annotated.html b/annotated.html
index 2b033b664..b3b275d41 100644
--- a/annotated.html
+++ b/annotated.html
@@ -110,123 +110,126 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
C Queue_Array Queue_Array class containing the main data and also index of head and tail of the array
► N sparse_table
C Sparse_table
- ► N tree_234
- C Node 2-3-4 tree node class
- C Tree234 2-3-4 tree class
- ► N trie_using_hashmap
- ► C Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix
- C Node Struct representing a trie node
- C Node
- C SkipList
- C trie Trie implementation for small-case English alphabets a-z
- ▼ N double_hashing An implementation of hash table using double hashing algorithm
- C Entry
- ▼ N geometry Geometry algorithms
- ► N jarvis
- C Convexhull
- C Point
- ▼ N graph Graph Algorithms
- ► N is_graph_bipartite
- C Graph Class for representing graph as an adjacency list
- C Graph
- C HKGraph Represents Bipartite graph for Hopcroft Karp implementation
- C LowestCommonAncestor
- C RootedTree
- ▼ N linear_probing An implementation of hash table using linear probing algorithm
- C Entry
- ▼ N machine_learning A* search algorithm
- ► N aystar_search
- ► C AyStarSearch A class defining A* search algorithm . for some initial state and final state
- C comparison_operator Custom comparator for open_list
- C Info Struct that handles all the information related to the current state
- C EightPuzzle A class defining EightPuzzle/15-Puzzle game
- ► N neural_network
- ► N layers
- C DenseLayer
- C NeuralNetwork
- C adaline
- ▼ N math For IO operations
- ► N ncr_modulo_p
- C NCRModuloP Class which contains all methods required for calculating nCr mod p
- ▼ N operations_on_datastructures For std::vector
- ► N inorder_traversal_of_bst
- C Node A Node structure representing a single node in BST
- ► N trie_operations
- C Tnode Class defining the structure of trie node and containing the methods to perform operations on them
- ▼ N others For vector
- ► N iterative_tree_traversals
- C BinaryTree Defines the functions associated with the binary tree
- C Node Defines the structure of a node of the tree
- ► N lru_cache
- C LRUCache LRU cache class
- ► N postfix_expression
- C Stack Creates an array to be used as stack for storing values
- ▼ N probability Probability algorithms
- ► N geometric_dist
- C geometric_distribution A class to model the geometric distribution
- ► N windowed_median
- C WindowedMedian A class to calculate the median of a leading sliding window at the back of a stream of integer values
- ▼ N quadratic_probing An implementation of hash table using quadratic probing algorithm
- C Entry
- ▼ N range_queries Algorithms and Data Structures that support range queries and updates
- ► N heavy_light_decomposition
- C HLD The Heavy-Light Decomposition class
- C SG Segment Tree , to store heavy chains
- C Tree A Basic Tree , which supports binary lifting
- ► C perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min
- C Node
- ▼ N search For std::vector
- ► N sublist_search
- C Node A Node structure representing a single link Node in a linked list
- ▼ N statistics Statistical algorithms
- C stats_computer1
- C stats_computer2
- ▼ N std STL namespace
- C is_arithmetic< uint128_t >
- C is_arithmetic< uint256_t >
- C is_integral< uint128_t >
- C is_integral< uint256_t >
- C is_unsigned< uint128_t >
- C is_unsigned< uint256_t >
- ▼ C binary_search_tree The Binary Search Tree class
- C bst_node A struct to represent a node in the Binary Search Tree
- C Btree
- C cll
- C Compare Comparator class for priority queue
- C compare
- C Complex Class Complex to represent complex numbers as a field
- C CycleCheck
- C double_linked_list
- C EasterYearMonthDay For IO operations
- C Edge
- C FCFS Class which implements the FCFS scheduling algorithm
- C FenwickTree
- C Graph
- C hash_chain Chain class with a given modulus
- C Item
- C large_number
- C linkedlist
- C list
- C MinHeap
- C MinHeapNode
- C mst
- C node
- C Node
- C Point
- C query
- C queue
- C Queue
- C RBtree
- C SegmentIntersection
- C Solution
- C stack
- C stack_linkedList
- C TestCases Class encapsulating the necessary test cases
- C tower
- ▼ C Trie
- C TrieNode
- C uint128_t Class for 128-bit unsigned integer
- C uint256_t Class for 256-bit unsigned integer
+ ► N stack_using_queue
+ C Stack Stack Class implementation for basic methods of Stack Data Structure.
+
+ ► N tree_234
+ C Node 2-3-4 tree node class
+ C Tree234 2-3-4 tree class
+ ► N trie_using_hashmap
+ ► C Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix
+ C Node Struct representing a trie node
+ C Node
+ C SkipList
+ C trie Trie implementation for small-case English alphabets a-z
+ ▼ N double_hashing An implementation of hash table using double hashing algorithm
+ C Entry
+ ▼ N geometry Geometry algorithms
+ ► N jarvis
+ C Convexhull
+ C Point
+ ▼ N graph Graph Algorithms
+ ► N is_graph_bipartite
+ C Graph Class for representing graph as an adjacency list
+ C Graph
+ C HKGraph Represents Bipartite graph for Hopcroft Karp implementation
+ C LowestCommonAncestor
+ C RootedTree
+ ▼ N linear_probing An implementation of hash table using linear probing algorithm
+ C Entry
+ ▼ N machine_learning A* search algorithm
+ ► N aystar_search
+ ► C AyStarSearch A class defining A* search algorithm . for some initial state and final state
+ C comparison_operator Custom comparator for open_list
+ C Info Struct that handles all the information related to the current state
+ C EightPuzzle A class defining EightPuzzle/15-Puzzle game
+ ► N neural_network
+ ► N layers
+ C DenseLayer
+ C NeuralNetwork
+ C adaline
+ ▼ N math For IO operations
+ ► N ncr_modulo_p
+ C NCRModuloP Class which contains all methods required for calculating nCr mod p
+ ▼ N operations_on_datastructures For std::vector
+ ► N inorder_traversal_of_bst
+ C Node A Node structure representing a single node in BST
+ ► N trie_operations
+ C Tnode Class defining the structure of trie node and containing the methods to perform operations on them
+ ▼ N others For vector
+ ► N iterative_tree_traversals
+ C BinaryTree Defines the functions associated with the binary tree
+ C Node Defines the structure of a node of the tree
+ ► N lru_cache
+ C LRUCache LRU cache class
+ ► N postfix_expression
+ C Stack Creates an array to be used as stack for storing values
+ ▼ N probability Probability algorithms
+ ► N geometric_dist
+ C geometric_distribution A class to model the geometric distribution
+ ► N windowed_median
+ C WindowedMedian A class to calculate the median of a leading sliding window at the back of a stream of integer values
+ ▼ N quadratic_probing An implementation of hash table using quadratic probing algorithm
+ C Entry
+ ▼ N range_queries Algorithms and Data Structures that support range queries and updates
+ ► N heavy_light_decomposition
+ C HLD The Heavy-Light Decomposition class
+ C SG Segment Tree , to store heavy chains
+ C Tree A Basic Tree , which supports binary lifting
+ ► C perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min
+ C Node
+ ▼ N search For std::vector
+ ► N sublist_search
+ C Node A Node structure representing a single link Node in a linked list
+ ▼ N statistics Statistical algorithms
+ C stats_computer1
+ C stats_computer2
+ ▼ N std STL namespace
+ C is_arithmetic< uint128_t >
+ C is_arithmetic< uint256_t >
+ C is_integral< uint128_t >
+ C is_integral< uint256_t >
+ C is_unsigned< uint128_t >
+ C is_unsigned< uint256_t >
+ ▼ C binary_search_tree The Binary Search Tree class
+ C bst_node A struct to represent a node in the Binary Search Tree
+ C Btree
+ C cll
+ C compare
+ C Compare Comparator class for priority queue
+ C Complex Class Complex to represent complex numbers as a field
+ C CycleCheck
+ C double_linked_list
+ C EasterYearMonthDay For IO operations
+ C Edge
+ C FCFS Class which implements the FCFS scheduling algorithm
+ C FenwickTree
+ C Graph
+ C hash_chain Chain class with a given modulus
+ C Item
+ C large_number
+ C linkedlist
+ C list
+ C MinHeap
+ C MinHeapNode
+ C mst
+ C Node
+ C node
+ C Point
+ C query
+ C Queue
+ C queue
+ C RBtree
+ C SegmentIntersection
+ C Solution
+ C stack
+ C stack_linkedList
+ C TestCases Class encapsulating the necessary test cases
+ C tower
+ ▼ C Trie
+ C TrieNode
+ C uint128_t Class for 128-bit unsigned integer
+ C uint256_t Class for 256-bit unsigned integer
diff --git a/annotated_dup.js b/annotated_dup.js
index aa14ef4bc..639773412 100644
--- a/annotated_dup.js
+++ b/annotated_dup.js
@@ -21,6 +21,9 @@ var annotated_dup =
[ "sparse_table", null, [
[ "Sparse_table", "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html", "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table" ]
] ],
+ [ "stack_using_queue", null, [
+ [ "Stack", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack" ]
+ ] ],
[ "tree_234", null, [
[ "Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", "dd/d40/classdata__structures_1_1tree__234_1_1_node" ],
[ "Tree234", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234" ]
@@ -130,8 +133,8 @@ var annotated_dup =
[ "binary_search_tree", "d9/dde/classbinary__search__tree.html", "d9/dde/classbinary__search__tree" ],
[ "Btree", "d9/d90/struct_btree.html", null ],
[ "cll", "d5/d15/classcll.html", null ],
- [ "Compare", "de/d4a/class_compare.html", "de/d4a/class_compare" ],
[ "compare", "d1/db3/structcompare.html", null ],
+ [ "Compare", "de/d4a/class_compare.html", "de/d4a/class_compare" ],
[ "Complex", "da/d5a/class_complex.html", "da/d5a/class_complex" ],
[ "CycleCheck", "d3/dbb/class_cycle_check.html", "d3/dbb/class_cycle_check" ],
[ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ],
@@ -148,12 +151,12 @@ var annotated_dup =
[ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ],
[ "MinHeapNode", "d5/d29/struct_min_heap_node.html", null ],
[ "mst", "d1/d77/structmst.html", null ],
- [ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
[ "Node", "db/d8b/struct_node.html", null ],
+ [ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
[ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ],
[ "query", "dd/d1b/structquery.html", null ],
- [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
[ "Queue", "dc/db5/struct_queue.html", null ],
+ [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
[ "RBtree", "d8/d72/class_r_btree.html", null ],
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ],
[ "Solution", "dd/d4f/class_solution.html", null ],
diff --git a/classes.html b/classes.html
index 81a75823e..1d5708938 100644
--- a/classes.html
+++ b/classes.html
@@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
binary_search_tree BinaryTree (others::iterative_tree_traversals)binary_search_tree::bst_node Btree
C
-cll Compare compare AyStarSearch::comparison_operator (machine_learning::aystar_search)Complex Convexhull (geometry::jarvis)CycleCheck
+cll compare Compare AyStarSearch::comparison_operator (machine_learning::aystar_search)Complex Convexhull (geometry::jarvis)CycleCheck
D
DenseLayer (machine_learning::neural_network::layers)double_linked_list
@@ -130,19 +130,19 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
MinHeap MinHeapNode mst
N
-NCRModuloP (math::ncr_modulo_p)NeuralNetwork (machine_learning::neural_network)Node (data_structures::linked_list)Node (data_structures )Node (data_structures::tree_234)Trie::Node (data_structures::trie_using_hashmap)node Node Node (operations_on_datastructures::inorder_traversal_of_bst)Node (others::iterative_tree_traversals)perSegTree::Node (range_queries )Node (search::sublist_search)
+NCRModuloP (math::ncr_modulo_p)NeuralNetwork (machine_learning::neural_network)Node (data_structures::linked_list)Node (data_structures )Node (data_structures::tree_234)Trie::Node (data_structures::trie_using_hashmap)Node node Node (operations_on_datastructures::inorder_traversal_of_bst)Node (others::iterative_tree_traversals)perSegTree::Node (range_queries )Node (search::sublist_search)
P
perSegTree (range_queries )Point (ciphers::elliptic_curve_key_exchange )Point (geometry::jarvis)Point
Q
-query queue Queue Queue_Array (data_structures::queue_using_array)
+query Queue queue Queue_Array (data_structures::queue_using_array)
R
RBtree RootedTree (graph )
S
-SegmentIntersection SG (range_queries::heavy_light_decomposition)SkipList (data_structures )Solution Sparse_table (data_structures::sparse_table)Stack (others::postfix_expression)stack stack_linkedList stats_computer1 (statistics )stats_computer2 (statistics )
+SegmentIntersection SG (range_queries::heavy_light_decomposition)SkipList (data_structures )Solution Sparse_table (data_structures::sparse_table)Stack (data_structures::stack_using_queue)Stack (others::postfix_expression)stack stack_linkedList stats_computer1 (statistics )stats_computer2 (statistics )
T
TestCases Tnode (operations_on_datastructures::trie_operations)tower Tree (range_queries::heavy_light_decomposition)Tree234 (data_structures::tree_234)trie (data_structures )Trie (data_structures::trie_using_hashmap)Trie Trie::TrieNode
diff --git a/d5/d3c/namespacedata__structures.js b/d5/d3c/namespacedata__structures.js
index 8c996addf..d331bd855 100644
--- a/d5/d3c/namespacedata__structures.js
+++ b/d5/d3c/namespacedata__structures.js
@@ -17,6 +17,9 @@ var namespacedata__structures =
[ "M", "d6/d42/data__structures_2sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e", null ],
[ "N", "d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d", null ]
] ],
+ [ "stack_using_queue", null, [
+ [ "Stack", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack" ]
+ ] ],
[ "tree_234", null, [
[ "Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", "dd/d40/classdata__structures_1_1tree__234_1_1_node" ],
[ "Tree234", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234" ]
diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
index 928d90381..4b0f38045 100644
--- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -165,6 +165,7 @@ Data Structures
Stack
Stack Using Array
Stack Using Linked List
+Stack Using Queue
Test Queue
Test Stack
Test Stack Students
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html
new file mode 100644
index 000000000..8efd047db
--- /dev/null
+++ b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html
@@ -0,0 +1,295 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: data_structures::stack_using_queue::Stack Struct Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Stack Class implementation for basic methods of Stack Data Structure.
+
+ More...
+
+
+int top ()
+
+void push (int val)
+ Inserts an element to the top of the stack. More...
+
+void pop ()
+ Removes the topmost element from the stack. More...
+
+int size ()
+ Utility function to return the current size of the stack. More...
+
+
+
+
+std::queue < int64_t > main_q
+ stores the current state of the stack
+
+
+std::queue < int64_t > auxiliary_q
+ used to carry out intermediate operations to implement stack
+
+
+uint32_t current_size = 0
+ stores the current size of the stack
+
+
+
+
Stack Class implementation for basic methods of Stack Data Structure.
+
+
+
+
◆ pop()
+
+
+
+
+
+
+
+
+ void data_structures::stack_using_queue::Stack::pop
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Removes the topmost element from the stack.
+
Returns void
+
+
+
+
+
+
+
+
std::queue< int64_t > main_q
stores the current state of the stack
Definition: stack_using_queue.cpp:29
+
uint32_t current_size
stores the current size of the stack
Definition: stack_using_queue.cpp:31
+
+
+
+
+
◆ push()
+
+
+
+
+
+
+
+
+ void data_structures::stack_using_queue::Stack::push
+ (
+ int
+ val )
+
+
+
+
+
+inline
+
+
+
+
+
Inserts an element to the top of the stack.
+
Parameters
+
+ val the element that will be inserted into the stack
+
+
+
+
Returns void
+
+
+
+
+
+
+
+
+
+
+
std::queue< int64_t > auxiliary_q
used to carry out intermediate operations to implement stack
Definition: stack_using_queue.cpp:30
+
+
+
+
+
+
◆ size()
+
+
+
+
+
+
+
+
+ int data_structures::stack_using_queue::Stack::size
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
+
Utility function to return the current size of the stack.
+
Returns current size of stack
+
+
+
+
+
◆ top()
+
+
+
+
+
+
+
+
+ int data_structures::stack_using_queue::Stack::top
+ (
+ )
+
+
+
+
+
+inline
+
+
+
+
Returns the top most element of the stack
Returns top element of the queue
+
+
+
+
The documentation for this struct was generated from the following file:
+data_structures/stack_using_queue.cpp
+
+
+
+
+
+
+
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.js b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.js
new file mode 100644
index 000000000..1a9f0178d
--- /dev/null
+++ b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.js
@@ -0,0 +1,10 @@
+var structdata__structures_1_1stack__using__queue_1_1_stack =
+[
+ [ "pop", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb", null ],
+ [ "push", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2", null ],
+ [ "size", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39", null ],
+ [ "top", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7", null ],
+ [ "auxiliary_q", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323", null ],
+ [ "current_size", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b", null ],
+ [ "main_q", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6", null ]
+];
\ No newline at end of file
diff --git a/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html b/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html
new file mode 100644
index 000000000..2336df454
--- /dev/null
+++ b/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html
@@ -0,0 +1,115 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for data_structures::stack_using_queue::Stack , including all inherited members.
+
+
+
+
+
+
diff --git a/dd/db1/namespacedata__strcutres.html b/dd/db1/namespacedata__strcutres.html
new file mode 100644
index 000000000..b0ce72b24
--- /dev/null
+++ b/dd/db1/namespacedata__strcutres.html
@@ -0,0 +1,114 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: data_strcutres Namespace Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Stack Data Structure Using the Queue Data Structure.
+More...
+
+
Stack Data Structure Using the Queue Data Structure.
+
Using 2 Queues inside the Stack class, we can easily implement Stack data structure with heavy computation in push function.
+
References used: StudyTonight
Author tushar2407 for IO operations for queue data structure for assert
+
Data structures algorithms
+
+
+
+
+
+
diff --git a/df/d1c/namespacestack__using__queue.html b/df/d1c/namespacestack__using__queue.html
new file mode 100644
index 000000000..76790263c
--- /dev/null
+++ b/df/d1c/namespacestack__using__queue.html
@@ -0,0 +1,111 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: stack_using_queue Namespace Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Functions for the Stack Using Queue implementation.
+More...
+
+
Functions for the Stack Using Queue implementation.
+
+
+
+
+
+
diff --git a/functions_a.html b/functions_a.html
index 56bd8eb2f..87a21dfba 100644
--- a/functions_a.html
+++ b/functions_a.html
@@ -109,6 +109,7 @@ $(document).ready(function(){initNavTree('functions_a.html',''); initResizable()
adjacency_list : graph::Graph< T >
arg() : Complex
arr : data_structures::queue_using_array::Queue_Array , data_structures::trie
+auxiliary_q : data_structures::stack_using_queue::Stack
AyStarSearch() : machine_learning::aystar_search::AyStarSearch< Puzzle >
diff --git a/functions_c.html b/functions_c.html
index 8c816d1f0..f9d3d639c 100644
--- a/functions_c.html
+++ b/functions_c.html
@@ -111,6 +111,7 @@ $(document).ready(function(){initNavTree('functions_c.html',''); initResizable()
count : data_structures::tree_234::Node
createNewNode() : others::iterative_tree_traversals::BinaryTree
cumulative_distribution() : probability::geometric_dist::geometric_distribution
+current_size : data_structures::stack_using_queue::Stack
diff --git a/functions_func_p.html b/functions_func_p.html
index 23611cdc6..91147c375 100644
--- a/functions_func_p.html
+++ b/functions_func_p.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('functions_func_p.html',''); initResiza
- p -
diff --git a/functions_func_s.html b/functions_func_s.html
index 45a5ca001..1c343f846 100644
--- a/functions_func_s.html
+++ b/functions_func_s.html
@@ -109,7 +109,7 @@ $(document).ready(function(){initNavTree('functions_func_s.html',''); initResiza
SG() : range_queries::heavy_light_decomposition::SG< X >
show() : data_structures::list_array::list
single_predict() : machine_learning::neural_network::NeuralNetwork
-size() : binary_search_tree< T > , range_queries::perSegTree
+size() : binary_search_tree< T > , data_structures::stack_using_queue::Stack , range_queries::perSegTree
SkipList() : data_structures::SkipList
Solution() : machine_learning::aystar_search::AyStarSearch< Puzzle >
sort() : data_structures::list_array::list
diff --git a/functions_func_t.html b/functions_func_t.html
index 9b690eb2a..017af96c1 100644
--- a/functions_func_t.html
+++ b/functions_func_t.html
@@ -97,7 +97,7 @@ $(document).ready(function(){initNavTree('functions_func_t.html',''); initResiza
testCase_1() : TestCases
testCase_2() : TestCases
testCase_3() : TestCases
-top() : data_structures::linked_list::list , stack< Type >
+top() : data_structures::linked_list::list , data_structures::stack_using_queue::Stack , stack< Type >
traverse() : data_structures::linked_list::list
Traverse() : data_structures::tree_234::Tree234
traverse_inorder() : binary_search_tree< T >
diff --git a/functions_m.html b/functions_m.html
index cfeb72bc1..22f3bc5f7 100644
--- a/functions_m.html
+++ b/functions_m.html
@@ -94,6 +94,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
- m -
m : graph::HKGraph
+main_q : data_structures::stack_using_queue::Stack
mat_mul() : ciphers::HillCipher
mean() : statistics::stats_computer1< T > , statistics::stats_computer2< T >
Merge() : data_structures::tree_234::Tree234
diff --git a/functions_p.html b/functions_p.html
index 183e64c23..e8ba7d8f0 100644
--- a/functions_p.html
+++ b/functions_p.html
@@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('functions_p.html',''); initResizable()
pair_v : graph::HKGraph
parent : graph::RootedTree
Point() : Point
-pop() : stack< Type >
+pop() : data_structures::stack_using_queue::Stack , stack< Type >
populate_parents() : graph::RootedTree
populate_up() : graph::LowestCommonAncestor
postOrderIterative() : others::iterative_tree_traversals::BinaryTree
@@ -114,7 +114,7 @@ $(document).ready(function(){initNavTree('functions_p.html',''); initResizable()
probability_density() : probability::geometric_dist::geometric_distribution
psucc : data_structures::linked_list::link
ptrs : range_queries::perSegTree
-push() : stack< Type >
+push() : data_structures::stack_using_queue::Stack , stack< Type >
push_back() : data_structures::linked_list::list
push_front() : data_structures::linked_list::list
pvalue : data_structures::linked_list::link
diff --git a/functions_s.html b/functions_s.html
index 32e7c85b4..3ad1d1c35 100644
--- a/functions_s.html
+++ b/functions_s.html
@@ -113,7 +113,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
show() : data_structures::list_array::list
side : graph::is_graph_bipartite::Graph
single_predict() : machine_learning::neural_network::NeuralNetwork
-size() : binary_search_tree< T > , range_queries::perSegTree , stack< Type >
+size() : binary_search_tree< T > , data_structures::stack_using_queue::Stack , range_queries::perSegTree , stack< Type >
size_ : binary_search_tree< T >
SkipList() : data_structures::SkipList
Solution() : machine_learning::aystar_search::AyStarSearch< Puzzle >
diff --git a/functions_t.html b/functions_t.html
index e5fe6dff4..0807d295a 100644
--- a/functions_t.html
+++ b/functions_t.html
@@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('functions_t.html',''); initResizable()
testCase_1() : TestCases
testCase_2() : TestCases
testCase_3() : TestCases
-top() : data_structures::linked_list::list , stack< Type > , tower
+top() : data_structures::linked_list::list , data_structures::stack_using_queue::Stack , stack< Type > , tower
traverse() : data_structures::linked_list::list
Traverse() : data_structures::tree_234::Tree234
traverse_inorder() : binary_search_tree< T >
diff --git a/functions_vars.html b/functions_vars.html
index a4f79f869..56e4f30f1 100644
--- a/functions_vars.html
+++ b/functions_vars.html
@@ -108,6 +108,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
adj : graph::HKGraph , graph::is_graph_bipartite::Graph
adjacency_list : graph::Graph< T >
arr : data_structures::queue_using_array::Queue_Array , data_structures::trie
+auxiliary_q : data_structures::stack_using_queue::Stack
@@ -116,6 +117,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
capacity : MinHeap
children : data_structures::tree_234::Node , data_structures::trie_using_hashmap::Trie::Node
count : data_structures::tree_234::Node
+current_size : data_structures::stack_using_queue::Stack
@@ -174,6 +176,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- m -
diff --git a/hierarchy.html b/hierarchy.html
index 5fb1efb13..d43be3942 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -104,8 +104,8 @@ This inheritance list is sorted roughly, but not completely, alphabetically: C binary_search_tree< T >::bst_node A struct to represent a node in the Binary Search Tree
C Btree
C cll
- C Compare< S, T, E > Comparator class for priority queue
- C compare
+ C compare
+ C Compare< S, T, E > Comparator class for priority queue
C machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator Custom comparator for open_list
C Complex Class Complex to represent complex numbers as a field
C geometry::jarvis::Convexhull
@@ -147,8 +147,8 @@ This inheritance list is sorted roughly, but not completely, alphabetically: C data_structures::Node
C data_structures::tree_234::Node 2-3-4 tree node class
C data_structures::trie_using_hashmap::Trie::Node Struct representing a trie node
- C node< Kind >
- C Node
+ C Node
+ C node< Kind >
C operations_on_datastructures::inorder_traversal_of_bst::Node A Node structure representing a single node in BST
C others::iterative_tree_traversals::Node Defines the structure of a node of the tree
C range_queries::perSegTree::Node
@@ -158,8 +158,8 @@ This inheritance list is sorted roughly, but not completely, alphabetically: C geometry::jarvis::Point
C Point
C query
- C queue< Kind >
- C Queue
+ C Queue
+ C queue< Kind >
C data_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array
C RBtree
C SegmentIntersection
@@ -168,31 +168,33 @@ This inheritance list is sorted roughly, but not completely, alphabetically: C data_structures::SkipList
C Solution
C data_structures::sparse_table::Sparse_table
- C others::postfix_expression::Stack Creates an array to be used as stack for storing values
- C stack< Type >
- C stack_linkedList
- C statistics::stats_computer1< T >
- C statistics::stats_computer2< T >
- C TestCases Class encapsulating the necessary test cases
- C operations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them
- C tower
- ▼ C range_queries::heavy_light_decomposition::Tree< X > A Basic Tree , which supports binary lifting
- C range_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class
- C data_structures::tree_234::Tree234 2-3-4 tree class
- C data_structures::trie Trie implementation for small-case English alphabets a-z
- C data_structures::trie_using_hashmap::Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix
- C Trie
- C Trie::TrieNode
- ▼ C std::true_type [external]
- C std::is_arithmetic< uint128_t >
- C std::is_arithmetic< uint256_t >
- C std::is_integral< uint128_t >
- C std::is_integral< uint256_t >
- C std::is_unsigned< uint128_t >
- C std::is_unsigned< uint256_t >
- C uint128_t Class for 128-bit unsigned integer
- C uint256_t Class for 256-bit unsigned integer
- C probability::windowed_median::WindowedMedian A class to calculate the median of a leading sliding window at the back of a stream of integer values
+ C data_structures::stack_using_queue::Stack Stack Class implementation for basic methods of Stack Data Structure.
+
+ C others::postfix_expression::Stack Creates an array to be used as stack for storing values
+ C stack< Type >
+ C stack_linkedList
+ C statistics::stats_computer1< T >
+ C statistics::stats_computer2< T >
+ C TestCases Class encapsulating the necessary test cases
+ C operations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them
+ C tower
+ ▼ C range_queries::heavy_light_decomposition::Tree< X > A Basic Tree , which supports binary lifting
+ C range_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class
+ C data_structures::tree_234::Tree234 2-3-4 tree class
+ C data_structures::trie Trie implementation for small-case English alphabets a-z
+ C data_structures::trie_using_hashmap::Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix
+ C Trie
+ C Trie::TrieNode
+ ▼ C std::true_type [external]
+ C std::is_arithmetic< uint128_t >
+ C std::is_arithmetic< uint256_t >
+ C std::is_integral< uint128_t >
+ C std::is_integral< uint256_t >
+ C std::is_unsigned< uint128_t >
+ C std::is_unsigned< uint256_t >
+ C uint128_t Class for 128-bit unsigned integer
+ C uint256_t Class for 256-bit unsigned integer
+ C probability::windowed_median::WindowedMedian A class to calculate the median of a leading sliding window at the back of a stream of integer values
diff --git a/hierarchy.js b/hierarchy.js
index e517ea74d..b8e8dad6c 100644
--- a/hierarchy.js
+++ b/hierarchy.js
@@ -7,8 +7,8 @@ var hierarchy =
[ "binary_search_tree< T >::bst_node", "dd/db6/structbinary__search__tree_1_1bst__node.html", null ],
[ "Btree", "d9/d90/struct_btree.html", null ],
[ "cll", "d5/d15/classcll.html", null ],
- [ "Compare< S, T, E >", "de/d4a/class_compare.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
+ [ "Compare< S, T, E >", "de/d4a/class_compare.html", null ],
[ "machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator", "d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html", null ],
[ "Complex", "da/d5a/class_complex.html", null ],
[ "geometry::jarvis::Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", null ],
@@ -51,8 +51,8 @@ var hierarchy =
[ "data_structures::Node", "d9/d49/structdata__structures_1_1_node.html", null ],
[ "data_structures::tree_234::Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", null ],
[ "data_structures::trie_using_hashmap::Trie::Node", "d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html", null ],
- [ "node< Kind >", "d5/da1/structnode.html", null ],
[ "Node", "db/d8b/struct_node.html", null ],
+ [ "node< Kind >", "d5/da1/structnode.html", null ],
[ "operations_on_datastructures::inorder_traversal_of_bst::Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", null ],
[ "others::iterative_tree_traversals::Node", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html", null ],
[ "range_queries::perSegTree::Node", "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html", null ],
@@ -62,8 +62,8 @@ var hierarchy =
[ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
[ "Point", "d8/dc8/struct_point.html", null ],
[ "query", "dd/d1b/structquery.html", null ],
- [ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "Queue", "dc/db5/struct_queue.html", null ],
+ [ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "data_structures::queue_using_array::Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", null ],
[ "RBtree", "d8/d72/class_r_btree.html", null ],
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", null ],
@@ -73,6 +73,7 @@ var hierarchy =
[ "data_structures::SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", null ],
[ "Solution", "dd/d4f/class_solution.html", null ],
[ "data_structures::sparse_table::Sparse_table", "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html", null ],
+ [ "data_structures::stack_using_queue::Stack", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html", null ],
[ "others::postfix_expression::Stack", "d5/d8a/classothers_1_1postfix__expression_1_1_stack.html", null ],
[ "stack< Type >", "d1/dc2/classstack.html", null ],
[ "stack_linkedList", "d2/dc4/classstack__linked_list.html", null ],
diff --git a/inherit_graph_18.map b/inherit_graph_18.map
index 3cdc9b843..e80c5854e 100644
--- a/inherit_graph_18.map
+++ b/inherit_graph_18.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_18.md5 b/inherit_graph_18.md5
index 43bbb1c9e..eacb8d121 100644
--- a/inherit_graph_18.md5
+++ b/inherit_graph_18.md5
@@ -1 +1 @@
-78eaa96ae8525e3154dcedb7aca703a6
\ No newline at end of file
+90d91b4748d877c1c14035d2d7fde70c
\ No newline at end of file
diff --git a/inherit_graph_18.svg b/inherit_graph_18.svg
index c75a18a32..306f17340 100644
--- a/inherit_graph_18.svg
+++ b/inherit_graph_18.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-data_structures::tree
-_234::Node
+
+
+data_structures::stack
+_using_queue::Stack
diff --git a/inherit_graph_19.map b/inherit_graph_19.map
index bfd130709..3cdc9b843 100644
--- a/inherit_graph_19.map
+++ b/inherit_graph_19.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_19.md5 b/inherit_graph_19.md5
index 099f7dbae..43bbb1c9e 100644
--- a/inherit_graph_19.md5
+++ b/inherit_graph_19.md5
@@ -1 +1 @@
-196f8a75bb216ce01e5eaabea30101e3
\ No newline at end of file
+78eaa96ae8525e3154dcedb7aca703a6
\ No newline at end of file
diff --git a/inherit_graph_19.svg b/inherit_graph_19.svg
index a10bf6b3a..c75a18a32 100644
--- a/inherit_graph_19.svg
+++ b/inherit_graph_19.svg
@@ -12,10 +12,10 @@
Node0
-
+
data_structures::tree
-_234::Tree234
+_234::Node
diff --git a/inherit_graph_20.map b/inherit_graph_20.map
index cb5de113e..bfd130709 100644
--- a/inherit_graph_20.map
+++ b/inherit_graph_20.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_20.md5 b/inherit_graph_20.md5
index fadd17e74..099f7dbae 100644
--- a/inherit_graph_20.md5
+++ b/inherit_graph_20.md5
@@ -1 +1 @@
-328ab509bf116ce8b376591ac881beaf
\ No newline at end of file
+196f8a75bb216ce01e5eaabea30101e3
\ No newline at end of file
diff --git a/inherit_graph_20.svg b/inherit_graph_20.svg
index afde78b5c..a10bf6b3a 100644
--- a/inherit_graph_20.svg
+++ b/inherit_graph_20.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-data_structures::trie
+
+
+data_structures::tree
+_234::Tree234
diff --git a/inherit_graph_21.map b/inherit_graph_21.map
index a1b31c62e..cb5de113e 100644
--- a/inherit_graph_21.map
+++ b/inherit_graph_21.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_21.md5 b/inherit_graph_21.md5
index a063449a7..fadd17e74 100644
--- a/inherit_graph_21.md5
+++ b/inherit_graph_21.md5
@@ -1 +1 @@
-b872ddd75e4fe14b1aa825fd21021446
\ No newline at end of file
+328ab509bf116ce8b376591ac881beaf
\ No newline at end of file
diff --git a/inherit_graph_21.svg b/inherit_graph_21.svg
index ce8ce6aca..afde78b5c 100644
--- a/inherit_graph_21.svg
+++ b/inherit_graph_21.svg
@@ -4,18 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-data_structures::trie
-_using_hashmap::Trie
+
+
+data_structures::trie
diff --git a/inherit_graph_22.map b/inherit_graph_22.map
index cec5237af..a1b31c62e 100644
--- a/inherit_graph_22.map
+++ b/inherit_graph_22.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_22.md5 b/inherit_graph_22.md5
index 964c54418..a063449a7 100644
--- a/inherit_graph_22.md5
+++ b/inherit_graph_22.md5
@@ -1 +1 @@
-bde2ec8ab8bc24701751e67a54ae2487
\ No newline at end of file
+b872ddd75e4fe14b1aa825fd21021446
\ No newline at end of file
diff --git a/inherit_graph_22.svg b/inherit_graph_22.svg
index e9527f566..ce8ce6aca 100644
--- a/inherit_graph_22.svg
+++ b/inherit_graph_22.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
+
+
data_structures::trie
-_using_hashmap::Trie::Node
+_using_hashmap::Trie
diff --git a/inherit_graph_23.map b/inherit_graph_23.map
index bd7db20ab..cec5237af 100644
--- a/inherit_graph_23.map
+++ b/inherit_graph_23.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_23.md5 b/inherit_graph_23.md5
index 5a35758c9..964c54418 100644
--- a/inherit_graph_23.md5
+++ b/inherit_graph_23.md5
@@ -1 +1 @@
-5bc10ee734d6914f823e79216ece320c
\ No newline at end of file
+bde2ec8ab8bc24701751e67a54ae2487
\ No newline at end of file
diff --git a/inherit_graph_23.svg b/inherit_graph_23.svg
index 7bf326905..e9527f566 100644
--- a/inherit_graph_23.svg
+++ b/inherit_graph_23.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-double_hashing::Entry
+
+
+data_structures::trie
+_using_hashmap::Trie::Node
diff --git a/inherit_graph_24.map b/inherit_graph_24.map
index c41846365..bd7db20ab 100644
--- a/inherit_graph_24.map
+++ b/inherit_graph_24.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_24.md5 b/inherit_graph_24.md5
index 626407169..5a35758c9 100644
--- a/inherit_graph_24.md5
+++ b/inherit_graph_24.md5
@@ -1 +1 @@
-3698eafa20825f92264fab47ce72bb67
\ No newline at end of file
+5bc10ee734d6914f823e79216ece320c
\ No newline at end of file
diff --git a/inherit_graph_24.svg b/inherit_graph_24.svg
index 7a29ac2a3..7bf326905 100644
--- a/inherit_graph_24.svg
+++ b/inherit_graph_24.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-double_linked_list
+
+
+double_hashing::Entry
diff --git a/inherit_graph_25.map b/inherit_graph_25.map
index 5d7e130a3..c41846365 100644
--- a/inherit_graph_25.map
+++ b/inherit_graph_25.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_25.md5 b/inherit_graph_25.md5
index fa7e99144..626407169 100644
--- a/inherit_graph_25.md5
+++ b/inherit_graph_25.md5
@@ -1 +1 @@
-4e8dab415e37a1596c92a7784e26264f
\ No newline at end of file
+3698eafa20825f92264fab47ce72bb67
\ No newline at end of file
diff --git a/inherit_graph_25.svg b/inherit_graph_25.svg
index 4fc7f3a09..7a29ac2a3 100644
--- a/inherit_graph_25.svg
+++ b/inherit_graph_25.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-EasterYearMonthDay
+
+
+double_linked_list
diff --git a/inherit_graph_26.map b/inherit_graph_26.map
index 61cc5821c..5d7e130a3 100644
--- a/inherit_graph_26.map
+++ b/inherit_graph_26.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_26.md5 b/inherit_graph_26.md5
index 6051e7640..fa7e99144 100644
--- a/inherit_graph_26.md5
+++ b/inherit_graph_26.md5
@@ -1 +1 @@
-e148e1f3f544084b7aa1e7be1efaa9bb
\ No newline at end of file
+4e8dab415e37a1596c92a7784e26264f
\ No newline at end of file
diff --git a/inherit_graph_26.svg b/inherit_graph_26.svg
index c7df21575..4fc7f3a09 100644
--- a/inherit_graph_26.svg
+++ b/inherit_graph_26.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-Edge
+
+
+EasterYearMonthDay
diff --git a/inherit_graph_27.map b/inherit_graph_27.map
index de37284b5..61cc5821c 100644
--- a/inherit_graph_27.map
+++ b/inherit_graph_27.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_27.md5 b/inherit_graph_27.md5
index dcbe1da47..6051e7640 100644
--- a/inherit_graph_27.md5
+++ b/inherit_graph_27.md5
@@ -1 +1 @@
-7ae10de1c3f65eab6645773f1d202807
\ No newline at end of file
+e148e1f3f544084b7aa1e7be1efaa9bb
\ No newline at end of file
diff --git a/inherit_graph_27.svg b/inherit_graph_27.svg
index 37a9c7d3b..c7df21575 100644
--- a/inherit_graph_27.svg
+++ b/inherit_graph_27.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-FCFS< S, T, E >
+
+
+Edge
diff --git a/inherit_graph_28.map b/inherit_graph_28.map
index 4c7796a5a..de37284b5 100644
--- a/inherit_graph_28.map
+++ b/inherit_graph_28.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_28.md5 b/inherit_graph_28.md5
index 1eea1527b..dcbe1da47 100644
--- a/inherit_graph_28.md5
+++ b/inherit_graph_28.md5
@@ -1 +1 @@
-26396299a5a5a0cf88af656fc914cf13
\ No newline at end of file
+7ae10de1c3f65eab6645773f1d202807
\ No newline at end of file
diff --git a/inherit_graph_28.svg b/inherit_graph_28.svg
index a238377f4..37a9c7d3b 100644
--- a/inherit_graph_28.svg
+++ b/inherit_graph_28.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-FenwickTree
+
+
+FCFS< S, T, E >
diff --git a/inherit_graph_29.map b/inherit_graph_29.map
index 989c7ba46..4c7796a5a 100644
--- a/inherit_graph_29.map
+++ b/inherit_graph_29.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_29.md5 b/inherit_graph_29.md5
index f38193729..1eea1527b 100644
--- a/inherit_graph_29.md5
+++ b/inherit_graph_29.md5
@@ -1 +1 @@
-6940f502400c229af84789c6c00f1735
\ No newline at end of file
+26396299a5a5a0cf88af656fc914cf13
\ No newline at end of file
diff --git a/inherit_graph_29.svg b/inherit_graph_29.svg
index c3667787b..a238377f4 100644
--- a/inherit_graph_29.svg
+++ b/inherit_graph_29.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-geometry::jarvis::Convexhull
+
+
+FenwickTree
diff --git a/inherit_graph_30.map b/inherit_graph_30.map
index eb48e6d79..989c7ba46 100644
--- a/inherit_graph_30.map
+++ b/inherit_graph_30.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_30.md5 b/inherit_graph_30.md5
index ad34f54f2..f38193729 100644
--- a/inherit_graph_30.md5
+++ b/inherit_graph_30.md5
@@ -1 +1 @@
-595208590648226e9aacf172b391904d
\ No newline at end of file
+6940f502400c229af84789c6c00f1735
\ No newline at end of file
diff --git a/inherit_graph_30.svg b/inherit_graph_30.svg
index a75879c2e..c3667787b 100644
--- a/inherit_graph_30.svg
+++ b/inherit_graph_30.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-geometry::jarvis::Point
+
+
+geometry::jarvis::Convexhull
diff --git a/inherit_graph_31.map b/inherit_graph_31.map
index 1337c468f..eb48e6d79 100644
--- a/inherit_graph_31.map
+++ b/inherit_graph_31.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_31.md5 b/inherit_graph_31.md5
index 68f990736..ad34f54f2 100644
--- a/inherit_graph_31.md5
+++ b/inherit_graph_31.md5
@@ -1 +1 @@
-4eeb1b22e1ab39b25c3d6d16904bf56f
\ No newline at end of file
+595208590648226e9aacf172b391904d
\ No newline at end of file
diff --git a/inherit_graph_31.svg b/inherit_graph_31.svg
index 6072d5004..a75879c2e 100644
--- a/inherit_graph_31.svg
+++ b/inherit_graph_31.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-Graph
+
+
+geometry::jarvis::Point
diff --git a/inherit_graph_32.map b/inherit_graph_32.map
index d512ae126..1337c468f 100644
--- a/inherit_graph_32.map
+++ b/inherit_graph_32.map
@@ -1,4 +1,3 @@
-
-
+
diff --git a/inherit_graph_32.md5 b/inherit_graph_32.md5
index 6bc781138..68f990736 100644
--- a/inherit_graph_32.md5
+++ b/inherit_graph_32.md5
@@ -1 +1 @@
-6eafaf6d042df9847e0e9a0f31d08595
\ No newline at end of file
+4eeb1b22e1ab39b25c3d6d16904bf56f
\ No newline at end of file
diff --git a/inherit_graph_32.svg b/inherit_graph_32.svg
index 8f6d1c1fa..6072d5004 100644
--- a/inherit_graph_32.svg
+++ b/inherit_graph_32.svg
@@ -4,34 +4,19 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-graph::Graph< T >
+
+
+Graph
-
-
-Node1
-
-
-graph::RootedTree
-
-
-
-
-
-Node0->Node1
-
-
-
diff --git a/inherit_graph_33.map b/inherit_graph_33.map
index d793a17d7..d512ae126 100644
--- a/inherit_graph_33.map
+++ b/inherit_graph_33.map
@@ -1,3 +1,4 @@
-
+
+
diff --git a/inherit_graph_33.md5 b/inherit_graph_33.md5
index dbf8777b4..6bc781138 100644
--- a/inherit_graph_33.md5
+++ b/inherit_graph_33.md5
@@ -1 +1 @@
-30974a2267f7342480d9da8515eba7fd
\ No newline at end of file
+6eafaf6d042df9847e0e9a0f31d08595
\ No newline at end of file
diff --git a/inherit_graph_33.svg b/inherit_graph_33.svg
index 5a6a7a793..8f6d1c1fa 100644
--- a/inherit_graph_33.svg
+++ b/inherit_graph_33.svg
@@ -4,19 +4,34 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-graph::HKGraph
+
+
+graph::Graph< T >
+
+
+Node1
+
+
+graph::RootedTree
+
+
+
+
+
+Node0->Node1
+
+
+
diff --git a/inherit_graph_34.map b/inherit_graph_34.map
index d2e6c760f..d793a17d7 100644
--- a/inherit_graph_34.map
+++ b/inherit_graph_34.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_34.md5 b/inherit_graph_34.md5
index 1fec1a598..dbf8777b4 100644
--- a/inherit_graph_34.md5
+++ b/inherit_graph_34.md5
@@ -1 +1 @@
-caa13fcf076ba3470984229bfbfdc7c1
\ No newline at end of file
+30974a2267f7342480d9da8515eba7fd
\ No newline at end of file
diff --git a/inherit_graph_34.svg b/inherit_graph_34.svg
index c6f88324d..5a6a7a793 100644
--- a/inherit_graph_34.svg
+++ b/inherit_graph_34.svg
@@ -4,18 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-graph::is_graph_bipartite
-::Graph
+
+
+graph::HKGraph
diff --git a/inherit_graph_35.map b/inherit_graph_35.map
index 7f0066f20..d2e6c760f 100644
--- a/inherit_graph_35.map
+++ b/inherit_graph_35.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_35.md5 b/inherit_graph_35.md5
index 76c57e351..1fec1a598 100644
--- a/inherit_graph_35.md5
+++ b/inherit_graph_35.md5
@@ -1 +1 @@
-bafb3280f8e20dc1a7424343016b176d
\ No newline at end of file
+caa13fcf076ba3470984229bfbfdc7c1
\ No newline at end of file
diff --git a/inherit_graph_35.svg b/inherit_graph_35.svg
index 3376363c9..c6f88324d 100644
--- a/inherit_graph_35.svg
+++ b/inherit_graph_35.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-graph::LowestCommonAncestor
+
+
+graph::is_graph_bipartite
+::Graph
diff --git a/inherit_graph_36.map b/inherit_graph_36.map
index ab17bc7b2..7f0066f20 100644
--- a/inherit_graph_36.map
+++ b/inherit_graph_36.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_36.md5 b/inherit_graph_36.md5
index 3451adfa8..76c57e351 100644
--- a/inherit_graph_36.md5
+++ b/inherit_graph_36.md5
@@ -1 +1 @@
-6a0f93ba427d9329d424820da1078327
\ No newline at end of file
+bafb3280f8e20dc1a7424343016b176d
\ No newline at end of file
diff --git a/inherit_graph_36.svg b/inherit_graph_36.svg
index c1239c7a6..3376363c9 100644
--- a/inherit_graph_36.svg
+++ b/inherit_graph_36.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-hash_chain
+
+
+graph::LowestCommonAncestor
diff --git a/inherit_graph_37.map b/inherit_graph_37.map
index 77624975c..ab17bc7b2 100644
--- a/inherit_graph_37.map
+++ b/inherit_graph_37.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_37.md5 b/inherit_graph_37.md5
index 02fa045cd..3451adfa8 100644
--- a/inherit_graph_37.md5
+++ b/inherit_graph_37.md5
@@ -1 +1 @@
-458fe77fc737dff37fe3ca54afe8d9fd
\ No newline at end of file
+6a0f93ba427d9329d424820da1078327
\ No newline at end of file
diff --git a/inherit_graph_37.svg b/inherit_graph_37.svg
index c8ed77115..c1239c7a6 100644
--- a/inherit_graph_37.svg
+++ b/inherit_graph_37.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-Item
+
+
+hash_chain
diff --git a/inherit_graph_38.map b/inherit_graph_38.map
index 1fbda92d4..77624975c 100644
--- a/inherit_graph_38.map
+++ b/inherit_graph_38.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_38.md5 b/inherit_graph_38.md5
index bd355ec1a..02fa045cd 100644
--- a/inherit_graph_38.md5
+++ b/inherit_graph_38.md5
@@ -1 +1 @@
-020117a75ed9e535ed2f6e9057f8e61f
\ No newline at end of file
+458fe77fc737dff37fe3ca54afe8d9fd
\ No newline at end of file
diff --git a/inherit_graph_38.svg b/inherit_graph_38.svg
index 0157785d7..c8ed77115 100644
--- a/inherit_graph_38.svg
+++ b/inherit_graph_38.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-large_number
+
+
+Item
diff --git a/inherit_graph_39.map b/inherit_graph_39.map
index 5b0921ffa..1fbda92d4 100644
--- a/inherit_graph_39.map
+++ b/inherit_graph_39.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_39.md5 b/inherit_graph_39.md5
index 4e731b183..bd355ec1a 100644
--- a/inherit_graph_39.md5
+++ b/inherit_graph_39.md5
@@ -1 +1 @@
-798897e4b583c00fbe8c88f7e5f1551d
\ No newline at end of file
+020117a75ed9e535ed2f6e9057f8e61f
\ No newline at end of file
diff --git a/inherit_graph_39.svg b/inherit_graph_39.svg
index 675d88834..0157785d7 100644
--- a/inherit_graph_39.svg
+++ b/inherit_graph_39.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-linear_probing::Entry
+
+
+large_number
diff --git a/inherit_graph_40.map b/inherit_graph_40.map
index 85340202f..5b0921ffa 100644
--- a/inherit_graph_40.map
+++ b/inherit_graph_40.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_40.md5 b/inherit_graph_40.md5
index 3ee7c60ce..4e731b183 100644
--- a/inherit_graph_40.md5
+++ b/inherit_graph_40.md5
@@ -1 +1 @@
-5fc9ec91cf1ed515d3e948f26519c17a
\ No newline at end of file
+798897e4b583c00fbe8c88f7e5f1551d
\ No newline at end of file
diff --git a/inherit_graph_40.svg b/inherit_graph_40.svg
index f70a61935..675d88834 100644
--- a/inherit_graph_40.svg
+++ b/inherit_graph_40.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-linkedlist
+
+
+linear_probing::Entry
diff --git a/inherit_graph_41.map b/inherit_graph_41.map
index e1fe964c2..85340202f 100644
--- a/inherit_graph_41.map
+++ b/inherit_graph_41.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_41.md5 b/inherit_graph_41.md5
index 358458965..3ee7c60ce 100644
--- a/inherit_graph_41.md5
+++ b/inherit_graph_41.md5
@@ -1 +1 @@
-e6fa82a0e450cb795421ea95e90b2fe6
\ No newline at end of file
+5fc9ec91cf1ed515d3e948f26519c17a
\ No newline at end of file
diff --git a/inherit_graph_41.svg b/inherit_graph_41.svg
index 90f083cbd..f70a61935 100644
--- a/inherit_graph_41.svg
+++ b/inherit_graph_41.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-list
+
+
+linkedlist
diff --git a/inherit_graph_42.map b/inherit_graph_42.map
index f6c8ec2c3..e1fe964c2 100644
--- a/inherit_graph_42.map
+++ b/inherit_graph_42.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_42.md5 b/inherit_graph_42.md5
index af5140e79..358458965 100644
--- a/inherit_graph_42.md5
+++ b/inherit_graph_42.md5
@@ -1 +1 @@
-a4563c6e45ac1fa78e07acb60fc5fa50
\ No newline at end of file
+e6fa82a0e450cb795421ea95e90b2fe6
\ No newline at end of file
diff --git a/inherit_graph_42.svg b/inherit_graph_42.svg
index 69ec23d1e..90f083cbd 100644
--- a/inherit_graph_42.svg
+++ b/inherit_graph_42.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-machine_learning::adaline
+
+
+list
diff --git a/inherit_graph_43.map b/inherit_graph_43.map
index b2388a27d..f6c8ec2c3 100644
--- a/inherit_graph_43.map
+++ b/inherit_graph_43.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_43.md5 b/inherit_graph_43.md5
index 20b3a4204..af5140e79 100644
--- a/inherit_graph_43.md5
+++ b/inherit_graph_43.md5
@@ -1 +1 @@
-fb9d222e488be11b364a263ed1973e8e
\ No newline at end of file
+a4563c6e45ac1fa78e07acb60fc5fa50
\ No newline at end of file
diff --git a/inherit_graph_43.svg b/inherit_graph_43.svg
index 0518e2498..69ec23d1e 100644
--- a/inherit_graph_43.svg
+++ b/inherit_graph_43.svg
@@ -4,19 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-machine_learning::aystar
-_search::AyStarSearch<
- Puzzle >
+
+
+machine_learning::adaline
diff --git a/inherit_graph_44.map b/inherit_graph_44.map
index 5afad900a..b2388a27d 100644
--- a/inherit_graph_44.map
+++ b/inherit_graph_44.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_44.md5 b/inherit_graph_44.md5
index c6d6146b5..20b3a4204 100644
--- a/inherit_graph_44.md5
+++ b/inherit_graph_44.md5
@@ -1 +1 @@
-135e20d1f0881b6cf5d2d1d160acbe92
\ No newline at end of file
+fb9d222e488be11b364a263ed1973e8e
\ No newline at end of file
diff --git a/inherit_graph_44.svg b/inherit_graph_44.svg
index a52fd7175..0518e2498 100644
--- a/inherit_graph_44.svg
+++ b/inherit_graph_44.svg
@@ -4,19 +4,19 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
+
+
machine_learning::aystar
_search::AyStarSearch<
- Puzzle >::comparison_operator
+ Puzzle >
diff --git a/inherit_graph_45.map b/inherit_graph_45.map
index 762083a2b..5afad900a 100644
--- a/inherit_graph_45.map
+++ b/inherit_graph_45.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_45.md5 b/inherit_graph_45.md5
index a1ab13b6c..c6d6146b5 100644
--- a/inherit_graph_45.md5
+++ b/inherit_graph_45.md5
@@ -1 +1 @@
-2ad730e054eae2222b70f2072322e2b4
\ No newline at end of file
+135e20d1f0881b6cf5d2d1d160acbe92
\ No newline at end of file
diff --git a/inherit_graph_45.svg b/inherit_graph_45.svg
index 59020c256..a52fd7175 100644
--- a/inherit_graph_45.svg
+++ b/inherit_graph_45.svg
@@ -4,19 +4,19 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
+
+
machine_learning::aystar
_search::AyStarSearch<
- Puzzle >::Info
+ Puzzle >::comparison_operator
diff --git a/inherit_graph_46.map b/inherit_graph_46.map
index 10dc4d32f..762083a2b 100644
--- a/inherit_graph_46.map
+++ b/inherit_graph_46.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_46.md5 b/inherit_graph_46.md5
index 79242a4f4..a1ab13b6c 100644
--- a/inherit_graph_46.md5
+++ b/inherit_graph_46.md5
@@ -1 +1 @@
-0ebaea2272ec2603600f729ca3888d1e
\ No newline at end of file
+2ad730e054eae2222b70f2072322e2b4
\ No newline at end of file
diff --git a/inherit_graph_46.svg b/inherit_graph_46.svg
index 9f578685a..59020c256 100644
--- a/inherit_graph_46.svg
+++ b/inherit_graph_46.svg
@@ -4,18 +4,19 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-machine_learning::aystar
-_search::EightPuzzle< N >
+
+
+machine_learning::aystar
+_search::AyStarSearch<
+ Puzzle >::Info
diff --git a/inherit_graph_47.map b/inherit_graph_47.map
index 592db238c..10dc4d32f 100644
--- a/inherit_graph_47.map
+++ b/inherit_graph_47.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_47.md5 b/inherit_graph_47.md5
index a5afecf36..79242a4f4 100644
--- a/inherit_graph_47.md5
+++ b/inherit_graph_47.md5
@@ -1 +1 @@
-5210a7087f1427d45a2c06df1d00a382
\ No newline at end of file
+0ebaea2272ec2603600f729ca3888d1e
\ No newline at end of file
diff --git a/inherit_graph_47.svg b/inherit_graph_47.svg
index 2cf6a9741..9f578685a 100644
--- a/inherit_graph_47.svg
+++ b/inherit_graph_47.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-machine_learning::neural
-_network::layers::DenseLayer
+
+
+machine_learning::aystar
+_search::EightPuzzle< N >
diff --git a/inherit_graph_48.map b/inherit_graph_48.map
index 66918e885..592db238c 100644
--- a/inherit_graph_48.map
+++ b/inherit_graph_48.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_48.md5 b/inherit_graph_48.md5
index 31bb1b4bc..a5afecf36 100644
--- a/inherit_graph_48.md5
+++ b/inherit_graph_48.md5
@@ -1 +1 @@
-f32e15a754740551f1e1ede4db060a54
\ No newline at end of file
+5210a7087f1427d45a2c06df1d00a382
\ No newline at end of file
diff --git a/inherit_graph_48.svg b/inherit_graph_48.svg
index f548a526b..2cf6a9741 100644
--- a/inherit_graph_48.svg
+++ b/inherit_graph_48.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
+
+
machine_learning::neural
-_network::NeuralNetwork
+_network::layers::DenseLayer
diff --git a/inherit_graph_49.map b/inherit_graph_49.map
index a3a47310b..66918e885 100644
--- a/inherit_graph_49.map
+++ b/inherit_graph_49.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_49.md5 b/inherit_graph_49.md5
index 7398f2b14..31bb1b4bc 100644
--- a/inherit_graph_49.md5
+++ b/inherit_graph_49.md5
@@ -1 +1 @@
-114b671cdf513aab630a251c680de828
\ No newline at end of file
+f32e15a754740551f1e1ede4db060a54
\ No newline at end of file
diff --git a/inherit_graph_49.svg b/inherit_graph_49.svg
index 6e021513d..f548a526b 100644
--- a/inherit_graph_49.svg
+++ b/inherit_graph_49.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-math::ncr_modulo_p
-::NCRModuloP
+
+
+machine_learning::neural
+_network::NeuralNetwork
diff --git a/inherit_graph_50.map b/inherit_graph_50.map
index 3ed5890e5..a3a47310b 100644
--- a/inherit_graph_50.map
+++ b/inherit_graph_50.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_50.md5 b/inherit_graph_50.md5
index c4b79964c..7398f2b14 100644
--- a/inherit_graph_50.md5
+++ b/inherit_graph_50.md5
@@ -1 +1 @@
-20a3344e5b7c2798c614a5832bb050be
\ No newline at end of file
+114b671cdf513aab630a251c680de828
\ No newline at end of file
diff --git a/inherit_graph_50.svg b/inherit_graph_50.svg
index 6e04fda10..6e021513d 100644
--- a/inherit_graph_50.svg
+++ b/inherit_graph_50.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-MinHeap
+
+
+math::ncr_modulo_p
+::NCRModuloP
diff --git a/inherit_graph_51.map b/inherit_graph_51.map
index f113fa7b5..3ed5890e5 100644
--- a/inherit_graph_51.map
+++ b/inherit_graph_51.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_51.md5 b/inherit_graph_51.md5
index 9a262ddf4..c4b79964c 100644
--- a/inherit_graph_51.md5
+++ b/inherit_graph_51.md5
@@ -1 +1 @@
-b7390394bbaa0abd74424ba9a880f9e2
\ No newline at end of file
+20a3344e5b7c2798c614a5832bb050be
\ No newline at end of file
diff --git a/inherit_graph_51.svg b/inherit_graph_51.svg
index 12b33960d..6e04fda10 100644
--- a/inherit_graph_51.svg
+++ b/inherit_graph_51.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-MinHeapNode
+
+
+MinHeap
diff --git a/inherit_graph_52.map b/inherit_graph_52.map
index c98fca666..f113fa7b5 100644
--- a/inherit_graph_52.map
+++ b/inherit_graph_52.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_52.md5 b/inherit_graph_52.md5
index 1fd123972..9a262ddf4 100644
--- a/inherit_graph_52.md5
+++ b/inherit_graph_52.md5
@@ -1 +1 @@
-dac11be16a53d20641c8a15ac8df90c8
\ No newline at end of file
+b7390394bbaa0abd74424ba9a880f9e2
\ No newline at end of file
diff --git a/inherit_graph_52.svg b/inherit_graph_52.svg
index 543600dbf..12b33960d 100644
--- a/inherit_graph_52.svg
+++ b/inherit_graph_52.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-mst
+
+
+MinHeapNode
diff --git a/inherit_graph_53.map b/inherit_graph_53.map
index 17a7815cb..c98fca666 100644
--- a/inherit_graph_53.map
+++ b/inherit_graph_53.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_53.md5 b/inherit_graph_53.md5
index 11e01bbc5..1fd123972 100644
--- a/inherit_graph_53.md5
+++ b/inherit_graph_53.md5
@@ -1 +1 @@
-345302fd1e3a1df4f5d11eaae31127fd
\ No newline at end of file
+dac11be16a53d20641c8a15ac8df90c8
\ No newline at end of file
diff --git a/inherit_graph_53.svg b/inherit_graph_53.svg
index 6006403a8..543600dbf 100644
--- a/inherit_graph_53.svg
+++ b/inherit_graph_53.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-Node
+
+
+mst
diff --git a/inherit_graph_54.map b/inherit_graph_54.map
index ee60f76ea..17a7815cb 100644
--- a/inherit_graph_54.map
+++ b/inherit_graph_54.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_54.md5 b/inherit_graph_54.md5
index 231132b13..11e01bbc5 100644
--- a/inherit_graph_54.md5
+++ b/inherit_graph_54.md5
@@ -1 +1 @@
-ed0ff6113ee370c2e2e0573042492713
\ No newline at end of file
+345302fd1e3a1df4f5d11eaae31127fd
\ No newline at end of file
diff --git a/inherit_graph_54.svg b/inherit_graph_54.svg
index 2112f4c57..6006403a8 100644
--- a/inherit_graph_54.svg
+++ b/inherit_graph_54.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-node< Kind >
+
+
+Node
diff --git a/inherit_graph_55.map b/inherit_graph_55.map
index 0aa6b0c01..ee60f76ea 100644
--- a/inherit_graph_55.map
+++ b/inherit_graph_55.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_55.md5 b/inherit_graph_55.md5
index 0b418f775..231132b13 100644
--- a/inherit_graph_55.md5
+++ b/inherit_graph_55.md5
@@ -1 +1 @@
-ef4c4cf0170a3477b170da46253277f6
\ No newline at end of file
+ed0ff6113ee370c2e2e0573042492713
\ No newline at end of file
diff --git a/inherit_graph_55.svg b/inherit_graph_55.svg
index b264581d3..2112f4c57 100644
--- a/inherit_graph_55.svg
+++ b/inherit_graph_55.svg
@@ -4,18 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-operations_on_datastructures
-::inorder_traversal_of_bst::Node
+
+
+node< Kind >
diff --git a/inherit_graph_56.map b/inherit_graph_56.map
index 282d67b45..0aa6b0c01 100644
--- a/inherit_graph_56.map
+++ b/inherit_graph_56.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_56.md5 b/inherit_graph_56.md5
index 4211adfbd..0b418f775 100644
--- a/inherit_graph_56.md5
+++ b/inherit_graph_56.md5
@@ -1 +1 @@
-2b8d2217680c3c1998c34e51fcbe2669
\ No newline at end of file
+ef4c4cf0170a3477b170da46253277f6
\ No newline at end of file
diff --git a/inherit_graph_56.svg b/inherit_graph_56.svg
index 97166225f..b264581d3 100644
--- a/inherit_graph_56.svg
+++ b/inherit_graph_56.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
+
+
operations_on_datastructures
-::trie_operations::Tnode
+::inorder_traversal_of_bst::Node
diff --git a/inherit_graph_57.map b/inherit_graph_57.map
index a6d93d4e0..282d67b45 100644
--- a/inherit_graph_57.map
+++ b/inherit_graph_57.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_57.md5 b/inherit_graph_57.md5
index 65e09727b..4211adfbd 100644
--- a/inherit_graph_57.md5
+++ b/inherit_graph_57.md5
@@ -1 +1 @@
-bc14811d9b50fabe9356f7908162deb7
\ No newline at end of file
+2b8d2217680c3c1998c34e51fcbe2669
\ No newline at end of file
diff --git a/inherit_graph_57.svg b/inherit_graph_57.svg
index 828f13e3a..97166225f 100644
--- a/inherit_graph_57.svg
+++ b/inherit_graph_57.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-others::iterative_tree
-_traversals::BinaryTree
+
+
+operations_on_datastructures
+::trie_operations::Tnode
diff --git a/inherit_graph_58.map b/inherit_graph_58.map
index 1461380ca..a6d93d4e0 100644
--- a/inherit_graph_58.map
+++ b/inherit_graph_58.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_58.md5 b/inherit_graph_58.md5
index 4ccce49f2..65e09727b 100644
--- a/inherit_graph_58.md5
+++ b/inherit_graph_58.md5
@@ -1 +1 @@
-393c9d2178c8eee68e815b34cb049ca7
\ No newline at end of file
+bc14811d9b50fabe9356f7908162deb7
\ No newline at end of file
diff --git a/inherit_graph_58.svg b/inherit_graph_58.svg
index 9247200f9..828f13e3a 100644
--- a/inherit_graph_58.svg
+++ b/inherit_graph_58.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
+
+
others::iterative_tree
-_traversals::Node
+_traversals::BinaryTree
diff --git a/inherit_graph_59.map b/inherit_graph_59.map
index fd6002d7d..1461380ca 100644
--- a/inherit_graph_59.map
+++ b/inherit_graph_59.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_59.md5 b/inherit_graph_59.md5
index fc26cb4ab..4ccce49f2 100644
--- a/inherit_graph_59.md5
+++ b/inherit_graph_59.md5
@@ -1 +1 @@
-a931991e3559a3afb38bb5e6d8b25c2a
\ No newline at end of file
+393c9d2178c8eee68e815b34cb049ca7
\ No newline at end of file
diff --git a/inherit_graph_59.svg b/inherit_graph_59.svg
index 7fc2d8491..9247200f9 100644
--- a/inherit_graph_59.svg
+++ b/inherit_graph_59.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-others::lru_cache::
-LRUCache
+
+
+others::iterative_tree
+_traversals::Node
diff --git a/inherit_graph_60.map b/inherit_graph_60.map
index 3932cb7fd..fd6002d7d 100644
--- a/inherit_graph_60.map
+++ b/inherit_graph_60.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_60.md5 b/inherit_graph_60.md5
index 74e3354ec..fc26cb4ab 100644
--- a/inherit_graph_60.md5
+++ b/inherit_graph_60.md5
@@ -1 +1 @@
-c6f13c81f1e70f3519d7fbd61697121e
\ No newline at end of file
+a931991e3559a3afb38bb5e6d8b25c2a
\ No newline at end of file
diff --git a/inherit_graph_60.svg b/inherit_graph_60.svg
index c79d11eea..7fc2d8491 100644
--- a/inherit_graph_60.svg
+++ b/inherit_graph_60.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-others::postfix_expression
-::Stack
+
+
+others::lru_cache::
+LRUCache
diff --git a/inherit_graph_61.map b/inherit_graph_61.map
index fb1f63608..3932cb7fd 100644
--- a/inherit_graph_61.map
+++ b/inherit_graph_61.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_61.md5 b/inherit_graph_61.md5
index 950a3429b..74e3354ec 100644
--- a/inherit_graph_61.md5
+++ b/inherit_graph_61.md5
@@ -1 +1 @@
-38884a151d472065dcd8a6fcae7b35c8
\ No newline at end of file
+c6f13c81f1e70f3519d7fbd61697121e
\ No newline at end of file
diff --git a/inherit_graph_61.svg b/inherit_graph_61.svg
index 86490e7a6..c79d11eea 100644
--- a/inherit_graph_61.svg
+++ b/inherit_graph_61.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-Point
+
+
+others::postfix_expression
+::Stack
diff --git a/inherit_graph_62.map b/inherit_graph_62.map
index 02af9db35..fb1f63608 100644
--- a/inherit_graph_62.map
+++ b/inherit_graph_62.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_62.md5 b/inherit_graph_62.md5
index cd4bfc251..950a3429b 100644
--- a/inherit_graph_62.md5
+++ b/inherit_graph_62.md5
@@ -1 +1 @@
-8413e6c3441d413e3273a9c52b7731bb
\ No newline at end of file
+38884a151d472065dcd8a6fcae7b35c8
\ No newline at end of file
diff --git a/inherit_graph_62.svg b/inherit_graph_62.svg
index 8b453bb2a..86490e7a6 100644
--- a/inherit_graph_62.svg
+++ b/inherit_graph_62.svg
@@ -4,18 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-probability::geometric
-_dist::geometric_distribution
+
+
+Point
diff --git a/inherit_graph_63.map b/inherit_graph_63.map
index d619a6cb6..02af9db35 100644
--- a/inherit_graph_63.map
+++ b/inherit_graph_63.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_63.md5 b/inherit_graph_63.md5
index 8ef88c5ce..cd4bfc251 100644
--- a/inherit_graph_63.md5
+++ b/inherit_graph_63.md5
@@ -1 +1 @@
-a2250425f0bc6684c642ddc1033966c1
\ No newline at end of file
+8413e6c3441d413e3273a9c52b7731bb
\ No newline at end of file
diff --git a/inherit_graph_63.svg b/inherit_graph_63.svg
index fa027ff2a..8b453bb2a 100644
--- a/inherit_graph_63.svg
+++ b/inherit_graph_63.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-probability::windowed
-_median::WindowedMedian
+
+
+probability::geometric
+_dist::geometric_distribution
diff --git a/inherit_graph_64.map b/inherit_graph_64.map
index 2d3f4e497..d619a6cb6 100644
--- a/inherit_graph_64.map
+++ b/inherit_graph_64.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_64.md5 b/inherit_graph_64.md5
index 01c6e454e..8ef88c5ce 100644
--- a/inherit_graph_64.md5
+++ b/inherit_graph_64.md5
@@ -1 +1 @@
-6cac1c113b0aa0693cc268a362aeb46e
\ No newline at end of file
+a2250425f0bc6684c642ddc1033966c1
\ No newline at end of file
diff --git a/inherit_graph_64.svg b/inherit_graph_64.svg
index 4befaccbe..fa027ff2a 100644
--- a/inherit_graph_64.svg
+++ b/inherit_graph_64.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-quadratic_probing::
-Entry
+
+
+probability::windowed
+_median::WindowedMedian
diff --git a/inherit_graph_65.map b/inherit_graph_65.map
index 82b0e97ae..2d3f4e497 100644
--- a/inherit_graph_65.map
+++ b/inherit_graph_65.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_65.md5 b/inherit_graph_65.md5
index 5ebe333de..01c6e454e 100644
--- a/inherit_graph_65.md5
+++ b/inherit_graph_65.md5
@@ -1 +1 @@
-bec59f87893a1ff0344686ba3ed67359
\ No newline at end of file
+6cac1c113b0aa0693cc268a362aeb46e
\ No newline at end of file
diff --git a/inherit_graph_65.svg b/inherit_graph_65.svg
index c40bdbf04..4befaccbe 100644
--- a/inherit_graph_65.svg
+++ b/inherit_graph_65.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-query
+
+
+quadratic_probing::
+Entry
diff --git a/inherit_graph_66.map b/inherit_graph_66.map
index 5e133cbdb..82b0e97ae 100644
--- a/inherit_graph_66.map
+++ b/inherit_graph_66.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_66.md5 b/inherit_graph_66.md5
index 5a179cc7b..5ebe333de 100644
--- a/inherit_graph_66.md5
+++ b/inherit_graph_66.md5
@@ -1 +1 @@
-75b8c6171df3d450e7b6057dcc7a759b
\ No newline at end of file
+bec59f87893a1ff0344686ba3ed67359
\ No newline at end of file
diff --git a/inherit_graph_66.svg b/inherit_graph_66.svg
index a112fd83d..c40bdbf04 100644
--- a/inherit_graph_66.svg
+++ b/inherit_graph_66.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-Queue
+
+
+query
diff --git a/inherit_graph_67.map b/inherit_graph_67.map
index 78fbc05fa..5e133cbdb 100644
--- a/inherit_graph_67.map
+++ b/inherit_graph_67.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_67.md5 b/inherit_graph_67.md5
index cdce21f81..5a179cc7b 100644
--- a/inherit_graph_67.md5
+++ b/inherit_graph_67.md5
@@ -1 +1 @@
-dda763a0bdfe4bfcb05a0b97b5c11e0a
\ No newline at end of file
+75b8c6171df3d450e7b6057dcc7a759b
\ No newline at end of file
diff --git a/inherit_graph_67.svg b/inherit_graph_67.svg
index 158469b0e..a112fd83d 100644
--- a/inherit_graph_67.svg
+++ b/inherit_graph_67.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-queue< Kind >
+
+
+Queue
diff --git a/inherit_graph_68.map b/inherit_graph_68.map
index 0fcb8badf..78fbc05fa 100644
--- a/inherit_graph_68.map
+++ b/inherit_graph_68.map
@@ -1,5 +1,3 @@
-
-
-
+
diff --git a/inherit_graph_68.md5 b/inherit_graph_68.md5
index 54a9bedcf..cdce21f81 100644
--- a/inherit_graph_68.md5
+++ b/inherit_graph_68.md5
@@ -1 +1 @@
-711b4674fe51cbd8e970c342bccaf9c1
\ No newline at end of file
+dda763a0bdfe4bfcb05a0b97b5c11e0a
\ No newline at end of file
diff --git a/inherit_graph_68.svg b/inherit_graph_68.svg
index ab8b72b82..158469b0e 100644
--- a/inherit_graph_68.svg
+++ b/inherit_graph_68.svg
@@ -4,55 +4,19 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-range_queries::heavy
-_light_decomposition
-::SG< X >
+
+
+queue< Kind >
-
-
-Node1
-
-
-range_queries::heavy
-_light_decomposition
-::HLD< X >
-
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node80
-
-
-range_queries::heavy
-_light_decomposition
-::Tree< X >
-
-
-
-
-
-Node80->Node1
-
-
-
diff --git a/inherit_graph_69.map b/inherit_graph_69.map
index 1e4928b91..0fcb8badf 100644
--- a/inherit_graph_69.map
+++ b/inherit_graph_69.map
@@ -1,3 +1,5 @@
-
+
+
+
diff --git a/inherit_graph_69.md5 b/inherit_graph_69.md5
index dbb271b1b..71cfdcdcd 100644
--- a/inherit_graph_69.md5
+++ b/inherit_graph_69.md5
@@ -1 +1 @@
-b727b49d33eaac846613f24543c7515b
\ No newline at end of file
+b2d57398a6b3655c8f69dff72bfd6667
\ No newline at end of file
diff --git a/inherit_graph_69.svg b/inherit_graph_69.svg
index a0fcc5182..0f14468dd 100644
--- a/inherit_graph_69.svg
+++ b/inherit_graph_69.svg
@@ -4,19 +4,55 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-range_queries::perSegTree
+
+
+range_queries::heavy
+_light_decomposition
+::SG< X >
+
+
+Node1
+
+
+range_queries::heavy
+_light_decomposition
+::HLD< X >
+
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node81
+
+
+range_queries::heavy
+_light_decomposition
+::Tree< X >
+
+
+
+
+
+Node81->Node1
+
+
+
diff --git a/inherit_graph_70.map b/inherit_graph_70.map
index 6e8a16387..1e4928b91 100644
--- a/inherit_graph_70.map
+++ b/inherit_graph_70.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_70.md5 b/inherit_graph_70.md5
index 8b64f4692..dbb271b1b 100644
--- a/inherit_graph_70.md5
+++ b/inherit_graph_70.md5
@@ -1 +1 @@
-bdb91a66072aac6e54cadd23f1d913b8
\ No newline at end of file
+b727b49d33eaac846613f24543c7515b
\ No newline at end of file
diff --git a/inherit_graph_70.svg b/inherit_graph_70.svg
index 2a362ba54..a0fcc5182 100644
--- a/inherit_graph_70.svg
+++ b/inherit_graph_70.svg
@@ -4,18 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-range_queries::perSegTree
-::Node
+
+
+range_queries::perSegTree
diff --git a/inherit_graph_71.map b/inherit_graph_71.map
index ce0b973a3..6e8a16387 100644
--- a/inherit_graph_71.map
+++ b/inherit_graph_71.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_71.md5 b/inherit_graph_71.md5
index 8133608df..8b64f4692 100644
--- a/inherit_graph_71.md5
+++ b/inherit_graph_71.md5
@@ -1 +1 @@
-cef884937e61d3db890f68522f268f88
\ No newline at end of file
+bdb91a66072aac6e54cadd23f1d913b8
\ No newline at end of file
diff --git a/inherit_graph_71.svg b/inherit_graph_71.svg
index 69e33b9aa..2a362ba54 100644
--- a/inherit_graph_71.svg
+++ b/inherit_graph_71.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-RBtree
+
+
+range_queries::perSegTree
+::Node
diff --git a/inherit_graph_72.map b/inherit_graph_72.map
index 8bee91f28..ce0b973a3 100644
--- a/inherit_graph_72.map
+++ b/inherit_graph_72.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_72.md5 b/inherit_graph_72.md5
index a90d887c6..8133608df 100644
--- a/inherit_graph_72.md5
+++ b/inherit_graph_72.md5
@@ -1 +1 @@
-20bec266e6a4e80cf8cf4d236a64bdb3
\ No newline at end of file
+cef884937e61d3db890f68522f268f88
\ No newline at end of file
diff --git a/inherit_graph_72.svg b/inherit_graph_72.svg
index e4b38ea42..69e33b9aa 100644
--- a/inherit_graph_72.svg
+++ b/inherit_graph_72.svg
@@ -4,18 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-search::sublist_search
-::Node
+
+
+RBtree
diff --git a/inherit_graph_73.map b/inherit_graph_73.map
index 3c9faaaf4..8bee91f28 100644
--- a/inherit_graph_73.map
+++ b/inherit_graph_73.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_73.md5 b/inherit_graph_73.md5
index efd8fff05..a90d887c6 100644
--- a/inherit_graph_73.md5
+++ b/inherit_graph_73.md5
@@ -1 +1 @@
-15c0758977894124ce8483f7108e3e73
\ No newline at end of file
+20bec266e6a4e80cf8cf4d236a64bdb3
\ No newline at end of file
diff --git a/inherit_graph_73.svg b/inherit_graph_73.svg
index 10828d6c0..e4b38ea42 100644
--- a/inherit_graph_73.svg
+++ b/inherit_graph_73.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-SegmentIntersection
+
+
+search::sublist_search
+::Node
diff --git a/inherit_graph_74.map b/inherit_graph_74.map
index 4a457a2ca..3c9faaaf4 100644
--- a/inherit_graph_74.map
+++ b/inherit_graph_74.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_74.md5 b/inherit_graph_74.md5
index 479953b06..efd8fff05 100644
--- a/inherit_graph_74.md5
+++ b/inherit_graph_74.md5
@@ -1 +1 @@
-d29718af26117f8d229cea6c31073750
\ No newline at end of file
+15c0758977894124ce8483f7108e3e73
\ No newline at end of file
diff --git a/inherit_graph_74.svg b/inherit_graph_74.svg
index 71fb44de7..10828d6c0 100644
--- a/inherit_graph_74.svg
+++ b/inherit_graph_74.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-Solution
+
+
+SegmentIntersection
diff --git a/inherit_graph_75.map b/inherit_graph_75.map
index f43bf3c68..4a457a2ca 100644
--- a/inherit_graph_75.map
+++ b/inherit_graph_75.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_75.md5 b/inherit_graph_75.md5
index e2b989bc1..479953b06 100644
--- a/inherit_graph_75.md5
+++ b/inherit_graph_75.md5
@@ -1 +1 @@
-172cf06ef071a5ae65c47d2b08429ea1
\ No newline at end of file
+d29718af26117f8d229cea6c31073750
\ No newline at end of file
diff --git a/inherit_graph_75.svg b/inherit_graph_75.svg
index cb465df3d..71fb44de7 100644
--- a/inherit_graph_75.svg
+++ b/inherit_graph_75.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-stack< Type >
+
+
+Solution
diff --git a/inherit_graph_76.map b/inherit_graph_76.map
index 4c1163185..f43bf3c68 100644
--- a/inherit_graph_76.map
+++ b/inherit_graph_76.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_76.md5 b/inherit_graph_76.md5
index aefbe3f94..e2b989bc1 100644
--- a/inherit_graph_76.md5
+++ b/inherit_graph_76.md5
@@ -1 +1 @@
-a99fca445652dfb292d35f8fd85290cf
\ No newline at end of file
+172cf06ef071a5ae65c47d2b08429ea1
\ No newline at end of file
diff --git a/inherit_graph_76.svg b/inherit_graph_76.svg
index 39ff38ea5..cb465df3d 100644
--- a/inherit_graph_76.svg
+++ b/inherit_graph_76.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-stack_linkedList
+
+
+stack< Type >
diff --git a/inherit_graph_77.map b/inherit_graph_77.map
index 338f3637f..4c1163185 100644
--- a/inherit_graph_77.map
+++ b/inherit_graph_77.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_77.md5 b/inherit_graph_77.md5
index bc7de0c4a..aefbe3f94 100644
--- a/inherit_graph_77.md5
+++ b/inherit_graph_77.md5
@@ -1 +1 @@
-56037270393cd432505f71b72a285a33
\ No newline at end of file
+a99fca445652dfb292d35f8fd85290cf
\ No newline at end of file
diff --git a/inherit_graph_77.svg b/inherit_graph_77.svg
index d5a09d27b..39ff38ea5 100644
--- a/inherit_graph_77.svg
+++ b/inherit_graph_77.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
+
Node0
-
-
-statistics::stats_computer1< T >
+
+
+stack_linkedList
diff --git a/inherit_graph_78.map b/inherit_graph_78.map
index c99c4cfcf..338f3637f 100644
--- a/inherit_graph_78.map
+++ b/inherit_graph_78.map
@@ -1,3 +1,3 @@
-
+
diff --git a/inherit_graph_78.md5 b/inherit_graph_78.md5
index 7537416a0..bc7de0c4a 100644
--- a/inherit_graph_78.md5
+++ b/inherit_graph_78.md5
@@ -1 +1 @@
-44f61a6c355366e4e56ece076004f6f3
\ No newline at end of file
+56037270393cd432505f71b72a285a33
\ No newline at end of file
diff --git a/inherit_graph_78.svg b/inherit_graph_78.svg
index f4ddcc809..d5a09d27b 100644
--- a/inherit_graph_78.svg
+++ b/inherit_graph_78.svg
@@ -12,9 +12,9 @@
Node0
-
+
-statistics::stats_computer2< T >
+statistics::stats_computer1< T >
diff --git a/inherit_graph_79.map b/inherit_graph_79.map
index 1ebba7be9..c99c4cfcf 100644
--- a/inherit_graph_79.map
+++ b/inherit_graph_79.map
@@ -1,9 +1,3 @@
-
-
-
-
-
-
-
+
diff --git a/inherit_graph_79.md5 b/inherit_graph_79.md5
index da54af982..7537416a0 100644
--- a/inherit_graph_79.md5
+++ b/inherit_graph_79.md5
@@ -1 +1 @@
-62e235f7149651d1af2a7100f5c1917d
\ No newline at end of file
+44f61a6c355366e4e56ece076004f6f3
\ No newline at end of file
diff --git a/inherit_graph_79.svg b/inherit_graph_79.svg
index 2a3be2f07..f4ddcc809 100644
--- a/inherit_graph_79.svg
+++ b/inherit_graph_79.svg
@@ -4,111 +4,19 @@
-
-
+
+
Graphical Class Hierarchy
-
+
Node0
-
-
-std::true_type
+
+