diff --git a/annotated.html b/annotated.html index b4e97cfe2..64cd0e6c3 100644 --- a/annotated.html +++ b/annotated.html @@ -283,41 +283,42 @@ $(function(){initNavTree('annotated.html','',''); });  Clist  CListNodeFor IO operations  CLongest_SubstringClass that solves the Longest Substring Without Repeating Characters problem - CMinHeap - CMinHeapNode - Cmst - CNode - Cnode - CPoint - Cpriority_queueSTL class - Cquery - CQueue - Cqueue - CRBtree - CSegmentIntersection - CSJFClass which implements the SJF scheduling algorithm - CSolution - CstackFor std::invalid_argument - Cstack_linkedList - Cstats_computer1 - Cstats_computer2 - CTestCaseSingle example inputs and expected output of the function longest_common_string_length - CTestCasesClass encapsulating the necessary test cases - Ctower - CTrie - CTrieNode - Cuint128_tClass for 128-bit unsigned integer - Cuint256_tClass for 256-bit unsigned integer - Cunordered_setSTL class - Cconst_iteratorSTL iterator class - Cconst_reverse_iteratorSTL iterator class - CiteratorSTL iterator class - Creverse_iteratorSTL iterator class - CvectorSTL class - Cconst_iteratorSTL iterator class - Cconst_reverse_iteratorSTL iterator class - CiteratorSTL iterator class - Creverse_iteratorSTL iterator class + CMemorisedFactorial + CMinHeap + CMinHeapNode + Cmst + CNode + Cnode + CPoint + Cpriority_queueSTL class + Cquery + CQueue + Cqueue + CRBtree + CSegmentIntersection + CSJFClass which implements the SJF scheduling algorithm + CSolution + CstackFor std::invalid_argument + Cstack_linkedList + Cstats_computer1 + Cstats_computer2 + CTestCaseSingle example inputs and expected output of the function longest_common_string_length + CTestCasesClass encapsulating the necessary test cases + Ctower + CTrie + CTrieNode + Cuint128_tClass for 128-bit unsigned integer + Cuint256_tClass for 256-bit unsigned integer + Cunordered_setSTL class + Cconst_iteratorSTL iterator class + Cconst_reverse_iteratorSTL iterator class + CiteratorSTL iterator class + Creverse_iteratorSTL iterator class + CvectorSTL class + Cconst_iteratorSTL iterator class + Cconst_reverse_iteratorSTL iterator class + CiteratorSTL iterator class + Creverse_iteratorSTL iterator class diff --git a/annotated_dup.js b/annotated_dup.js index 518cbc9f4..9bd97a4a4 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -217,6 +217,7 @@ var annotated_dup = [ "list", "d8/d10/structlist.html", "d8/d10/structlist" ], [ "ListNode", "d7/da4/struct_list_node.html", "d7/da4/struct_list_node" ], [ "Longest_Substring", "da/d21/class_longest___substring.html", "da/d21/class_longest___substring" ], + [ "MemorisedFactorial", "da/d15/class_memorised_factorial.html", "da/d15/class_memorised_factorial" ], [ "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 ], diff --git a/classes.html b/classes.html index 1ee9dcf93..36eb3e5c1 100644 --- a/classes.html +++ b/classes.html @@ -153,7 +153,7 @@ $(function(){initNavTree('classes.html','',''); });
large_number
LFUCache (others::Cache)
link (data_structures::linked_list)
linkedlist
list (data_structures::linked_list)
list (data_structures::list_array)
list
ListNode
Longest_Substring
LowestCommonAncestor (graph)
LRUCache (others::Cache)
LRUCache (others::lru_cache)
M
-
Matrix (divide_and_conquer::strassens_multiplication)
MinHeap
MinHeapNode
mst
+
Matrix (divide_and_conquer::strassens_multiplication)
MemorisedFactorial
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 (operations_on_datastructures::circular_linked_list)
Node (operations_on_datastructures::inorder_traversal_of_bst)
Node (operations_on_datastructures::reverse_binary_tree)
Node (others::iterative_tree_traversals)
Node (others::recursive_tree_traversals)
perSegTree::Node (range_queries)
Node (search::sublist_search)
Node (tests)
node
diff --git a/d2/d96/factorial__memoization_8cpp.html b/d2/d96/factorial__memoization_8cpp.html index cc3f3fa9a..80557be2a 100644 --- a/d2/d96/factorial__memoization_8cpp.html +++ b/d2/d96/factorial__memoization_8cpp.html @@ -119,44 +119,35 @@ $(function(){initNavTree('d2/d96/factorial__memoization_8cpp.html','../../','');

Factorial calculation using recursion and memoization More...

-
#include <iostream>
-#include <cassert>
-#include <array>
+
#include <cassert>
#include <cstdint>
+#include <vector>
Include dependency graph for factorial_memoization.cpp:
-
+

Go to the source code of this file.

- - - + +

-Namespaces

namespace  math
 for assert

+Classes

class  MemorisedFactorial
- - - - + + - -

Functions

uint64_t math::fact_recursion (uint64_t n)
 Computes the factorial of a non-negative integer using recursion and memoization.
void test_fact_recursion ()
 Self-test implementations for the fact_recursion function.
void test_MemorisedFactorial_in_order ()
void test_MemorisedFactorial_no_order ()
int main ()
 Main function to run test cases and interact with the user.
- - - +

-Variables

std::array< uint64_t, 1000 > memo {0}
 Array to store computed factorials for memoization.
 Main function to run tests.

Detailed Description

Factorial calculation using recursion and memoization

This program computes the factorial of a non-negative integer using recursion with memoization (top-down dynamic programming). It stores intermediate results to avoid redundant calculations for improved efficiency.

Memoization is a form of caching where the result to an expensive function call is stored and returned. Example: Input: n = 5 Output: 120

Explanation: 5! = 5 × 4 × 3 × 2 × 1 = 120

-

The program uses a recursive function fact_recursion which caches computed results in a memo array to avoid recalculating factorials for the same numbers.

-

Time Complexity: O(n) Space Complexity: O(n)

Author
Vedant Mukhedkar
+

The program uses a recursive function which caches computed results in a memo array to avoid recalculating factorials for the same numbers.

+

Time Complexity: O(n) Space Complexity: O(n)

Definition in file factorial_memoization.cpp.

Function Documentation

@@ -175,27 +166,26 @@ Variables
-

Main function to run test cases and interact with the user.

+

Main function to run tests.

Returns
0 on program success
-

Definition at line 69 of file factorial_memoization.cpp.

-
69 {
-
70 // Run test cases
-
71 test_fact_recursion();
-
72 return 0;
-
73}
-
test_fact_recursion
void test_fact_recursion()
Self-test implementations for the fact_recursion function.
Definition factorial_memoization.cpp:56
+

Definition at line 61 of file factorial_memoization.cpp.

+
61 {
+
62 test_MemorisedFactorial_in_order();
+
63 test_MemorisedFactorial_no_order();
+
64 return 0;
+
65}
- -

◆ test_fact_recursion()

+ +

◆ test_MemorisedFactorial_in_order()

- + @@ -203,39 +193,39 @@ Variables
void test_fact_recursion void test_MemorisedFactorial_in_order ( )
-

Self-test implementations for the fact_recursion function.

-
Returns
void
- -

Definition at line 56 of file factorial_memoization.cpp.

-
56 {
-
57 // Test cases for factorial computation
-
58 assert(math::fact_recursion(0) == 1);
-
59 assert(math::fact_recursion(1) == 1);
-
60 assert(math::fact_recursion(5) == 120);
-
61 assert(math::fact_recursion(10) == 3628800);
-
62 std::cout << "All test cases passed!\n";
-
63}
-
math::fact_recursion
uint64_t fact_recursion(uint64_t n)
Computes the factorial of a non-negative integer using recursion and memoization.
Definition factorial_memoization.cpp:44
+

Definition at line 44 of file factorial_memoization.cpp.

+
44 {
+
45 auto factorial = MemorisedFactorial();
+
46 assert(factorial(0) == 1);
+
47 assert(factorial(1) == 1);
+
48 assert(factorial(5) == 120);
+
49 assert(factorial(10) == 3628800);
+
50}
+ +
math::factorial
uint64_t factorial(uint8_t n)
function to find factorial of given number
Definition factorial.cpp:29
-

Variable Documentation

- -

◆ memo

+ +

◆ test_MemorisedFactorial_no_order()

- + + + +
std::array<uint64_t, 1000> memo {0}void test_MemorisedFactorial_no_order ()
-

Array to store computed factorials for memoization.

- -

Definition at line 31 of file factorial_memoization.cpp.

-
31{0};
+

Definition at line 52 of file factorial_memoization.cpp.

+
52 {
+
53 auto factorial = MemorisedFactorial();
+
54 assert(factorial(10) == 3628800);
+
55}
diff --git a/d2/d96/factorial__memoization_8cpp.js b/d2/d96/factorial__memoization_8cpp.js index a1f95b83c..e5a6b4004 100644 --- a/d2/d96/factorial__memoization_8cpp.js +++ b/d2/d96/factorial__memoization_8cpp.js @@ -1,7 +1,5 @@ var factorial__memoization_8cpp = [ - [ "math::fact_recursion", "dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b", null ], - [ "main", "d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], - [ "test_fact_recursion", "d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba", null ], - [ "memo", "d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217", null ] + [ "MemorisedFactorial", "da/d15/class_memorised_factorial.html", "da/d15/class_memorised_factorial" ], + [ "main", "d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] ]; \ No newline at end of file diff --git a/d2/d96/factorial__memoization_8cpp_source.html b/d2/d96/factorial__memoization_8cpp_source.html index 5baa57336..1775e7dd4 100644 --- a/d2/d96/factorial__memoization_8cpp_source.html +++ b/d2/d96/factorial__memoization_8cpp_source.html @@ -117,49 +117,51 @@ $(function(){initNavTree('d2/d96/factorial__memoization_8cpp_source.html','../..
Go to the documentation of this file.
1
-
24
-
25#include <iostream> // for std::cout
-
26#include <cassert> // For test cases
-
27#include <array> // For std::array
-
28#include <cstdint> // For uint64_t
-
29
-
31std::array<uint64_t, 1000> memo{0};
-
32
-
37namespace math {
-
38
-
-
44uint64_t fact_recursion(uint64_t n) {
-
45 if (n == 0) return 1; // Base case: 0! = 1
-
46 if (memo[n] != 0) return memo[n]; // Return already computed value
-
47 memo[n] = n * fact_recursion(n - 1); // Store and return the computed value
-
48 return memo[n];
-
49}
+
22
+
23#include <cassert> // For test cases
+
24#include <cstdint> // For uint64_t
+
25#include <vector> // For std::vector
+
26
+
+
27class MemorisedFactorial {
+
28 std::vector<std::uint64_t> known_values = {1};
+
29
+
30 public:
+
+
36 std::uint64_t operator()(std::uint64_t n) {
+
37 if (n >= this->known_values.size()) {
+
38 this->known_values.push_back(n * this->operator()(n - 1));
+
39 }
+
40 return this->known_values.at(n);
+
41 }
-
50
-
51} // namespace math
-
-
56void test_fact_recursion() {
-
57 // Test cases for factorial computation
-
58 assert(math::fact_recursion(0) == 1);
-
59 assert(math::fact_recursion(1) == 1);
-
60 assert(math::fact_recursion(5) == 120);
-
61 assert(math::fact_recursion(10) == 3628800);
-
62 std::cout << "All test cases passed!\n";
-
63}
+
42};
-
64
-
-
69int main() {
-
70 // Run test cases
-
71 test_fact_recursion();
-
72 return 0;
-
73}
+
43
+
44void test_MemorisedFactorial_in_order() {
+
45 auto factorial = MemorisedFactorial();
+
46 assert(factorial(0) == 1);
+
47 assert(factorial(1) == 1);
+
48 assert(factorial(5) == 120);
+
49 assert(factorial(10) == 3628800);
+
50}
+
51
+
52void test_MemorisedFactorial_no_order() {
+
53 auto factorial = MemorisedFactorial();
+
54 assert(factorial(10) == 3628800);
+
55}
+
56
+
+
61int main() {
+
62 test_MemorisedFactorial_in_order();
+
63 test_MemorisedFactorial_no_order();
+
64 return 0;
+
65}
-
memo
std::array< uint64_t, 1000 > memo
Array to store computed factorials for memoization.
Definition factorial_memoization.cpp:31
-
test_fact_recursion
void test_fact_recursion()
Self-test implementations for the fact_recursion function.
Definition factorial_memoization.cpp:56
-
main
int main()
Main function to run test cases and interact with the user.
Definition factorial_memoization.cpp:69
-
math
for assert
-
math::fact_recursion
uint64_t fact_recursion(uint64_t n)
Computes the factorial of a non-negative integer using recursion and memoization.
Definition factorial_memoization.cpp:44
+ +
MemorisedFactorial::operator()
std::uint64_t operator()(std::uint64_t n)
Definition factorial_memoization.cpp:36
+
main
int main()
Main function to run tests.
Definition factorial_memoization.cpp:61
+
math::factorial
uint64_t factorial(uint8_t n)
function to find factorial of given number
Definition factorial.cpp:29
diff --git a/d7/d73/abbreviation_8cpp.html b/d7/d73/abbreviation_8cpp.html index 137da0213..9a7e81ace 100644 --- a/d7/d73/abbreviation_8cpp.html +++ b/d7/d73/abbreviation_8cpp.html @@ -141,7 +141,7 @@ Namespaces - + @@ -200,33 +200,32 @@ Algorithm

Definition at line 119 of file abbreviation.cpp.

119 {
-
120 std::vector<std::vector<bool>> memo(
+
120 std::vector<std::vector<bool>> memo(
121 str.size() + 1, std::vector<bool>(result.size() + 1, false));
122
123 for (uint32_t i = 0; i <= str.size(); ++i) {
-
124 memo[i][0] = true;
+
124 memo[i][0] = true;
125 }
126 for (uint32_t i = 1; i <= result.size(); ++i) {
-
127 memo[0][i] = false;
+
127 memo[0][i] = false;
128 }
129 for (uint32_t i = 1; i <= str.size(); ++i) {
130 for (uint32_t j = 1; j <= result.size(); ++j) {
131 if (str[i - 1] == result[j - 1]) {
-
132 memo[i][j] = memo[i - 1][j - 1];
+
132 memo[i][j] = memo[i - 1][j - 1];
133 } else if (str[i - 1] - 32 == result[j - 1]) {
-
134 memo[i][j] = (memo[i - 1][j - 1] || memo[i - 1][j]);
+
134 memo[i][j] = (memo[i - 1][j - 1] || memo[i - 1][j]);
135 } else {
136 if (str[i - 1] >= 'A' && str[i - 1] <= 'Z') {
-
137 memo[i][j] = false;
+
137 memo[i][j] = false;
138 } else {
-
139 memo[i][j] = memo[i - 1][j];
+
139 memo[i][j] = memo[i - 1][j];
140 }
141 }
142 }
143 }
-
144 return memo.back().back();
+
144 return memo.back().back();
145}
-
memo
std::array< uint64_t, 1000 > memo
Array to store computed factorials for memoization.
Definition factorial_memoization.cpp:31
@@ -292,7 +291,7 @@ j)

Definition at line 59 of file abbreviation.cpp.

62 {
-
63 bool ans = memo->at(str_idx).at(result_idx);
+
63 bool ans = memo->at(str_idx).at(result_idx);
64 if (str_idx == str.size() && result_idx == result.size()) {
65 return true;
66 } else if (str_idx == str.size() && result_idx != result.size()) {
@@ -300,12 +299,12 @@ j)
68 return false;
69 } else if (!visited->at(str_idx).at(result_idx)) {
81 if (str[str_idx] == result[result_idx]) {
-
82 ans = abbreviation_recursion(memo, visited, str, result,
+
82 ans = abbreviation_recursion(memo, visited, str, result,
83 str_idx + 1, result_idx + 1);
84 } else if (str[str_idx] - 32 == result[result_idx]) {
-
85 ans = abbreviation_recursion(memo, visited, str, result,
+
85 ans = abbreviation_recursion(memo, visited, str, result,
86 str_idx + 1, result_idx + 1) ||
-
87 abbreviation_recursion(memo, visited, str, result,
+
87 abbreviation_recursion(memo, visited, str, result,
88 str_idx + 1, result_idx);
89 } else {
90 // if `str[i]` is uppercase, then cannot be converted, return
@@ -315,14 +314,14 @@ j)
94 if (str[str_idx] >= 'A' && str[str_idx] <= 'Z') {
95 ans = false;
96 } else {
-
97 ans = abbreviation_recursion(memo, visited, str, result,
+
97 ans = abbreviation_recursion(memo, visited, str, result,
98 str_idx + 1, result_idx);
99 }
100 }
101 }
102 (*memo)[str_idx][result_idx] = ans;
103 (*visited)[str_idx][result_idx] = true;
-
104 return (*memo)[str_idx][result_idx];
+
104 return (*memo)[str_idx][result_idx];
105}
dynamic_programming::abbreviation::abbreviation_recursion
bool abbreviation_recursion(std::vector< std::vector< bool > > *memo, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)
Recursive Dynamic Programming function.
Definition abbreviation.cpp:59
@@ -384,36 +383,36 @@ j)

Definition at line 153 of file abbreviation.cpp.

153 {
154 std::string s = "daBcd", t = "ABC";
-
155 std::vector<std::vector<bool>> memo(s.size() + 1,
+
155 std::vector<std::vector<bool>> memo(s.size() + 1,
156 std::vector<bool>(t.size() + 1, false)),
157 visited(s.size() + 1, std::vector<bool>(t.size() + 1, false));
158
159 assert(dynamic_programming::abbreviation::abbreviation_recursion(
-
160 &memo, &visited, s, t) == true);
+
160 &memo, &visited, s, t) == true);
161 assert(dynamic_programming::abbreviation::abbreviation(s, t) == true);
162 s = "XXVVnDEFYgYeMXzWINQYHAQKKOZEYgSRCzLZAmUYGUGILjMDET";
163 t = "XXVVDEFYYMXWINQYHAQKKOZEYSRCLZAUYGUGILMDETQVWU";
-
164 memo = std::vector<std::vector<bool>>(
+
164 memo = std::vector<std::vector<bool>>(
165 s.size() + 1, std::vector<bool>(t.size() + 1, false));
166
167 visited = std::vector<std::vector<bool>>(
168 s.size() + 1, std::vector<bool>(t.size() + 1, false));
169
170 assert(dynamic_programming::abbreviation::abbreviation_recursion(
-
171 &memo, &visited, s, t) == false);
+
171 &memo, &visited, s, t) == false);
172 assert(dynamic_programming::abbreviation::abbreviation(s, t) == false);
173
174 s = "DRFNLZZVHLPZWIupjwdmqafmgkg";
175 t = "DRFNLZZVHLPZWI";
176
-
177 memo = std::vector<std::vector<bool>>(
+
177 memo = std::vector<std::vector<bool>>(
178 s.size() + 1, std::vector<bool>(t.size() + 1, false));
179
180 visited = std::vector<std::vector<bool>>(
181 s.size() + 1, std::vector<bool>(t.size() + 1, false));
182
183 assert(dynamic_programming::abbreviation::abbreviation_recursion(
-
184 &memo, &visited, s, t) == true);
+
184 &memo, &visited, s, t) == true);
185 assert(dynamic_programming::abbreviation::abbreviation(s, t) == true);
186}
dynamic_programming::abbreviation::abbreviation
bool abbreviation(const std::string &str, const std::string &result)
Iterative Dynamic Programming function.
Definition abbreviation.cpp:119
diff --git a/d7/d73/abbreviation_8cpp_source.html b/d7/d73/abbreviation_8cpp_source.html index 61afb1eec..95d656087 100644 --- a/d7/d73/abbreviation_8cpp_source.html +++ b/d7/d73/abbreviation_8cpp_source.html @@ -126,11 +126,11 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
35namespace dynamic_programming {
42namespace abbreviation {
-
59bool abbreviation_recursion(std::vector<std::vector<bool>> *memo,
+
59bool abbreviation_recursion(std::vector<std::vector<bool>> *memo,
60 std::vector<std::vector<bool>> *visited,
61 const std::string &str, const std::string &result,
62 uint32_t str_idx = 0, uint32_t result_idx = 0) {
-
63 bool ans = memo->at(str_idx).at(result_idx);
+
63 bool ans = memo->at(str_idx).at(result_idx);
64 if (str_idx == str.size() && result_idx == result.size()) {
65 return true;
66 } else if (str_idx == str.size() && result_idx != result.size()) {
@@ -138,12 +138,12 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
68 return false;
69 } else if (!visited->at(str_idx).at(result_idx)) {
81 if (str[str_idx] == result[result_idx]) {
-
82 ans = abbreviation_recursion(memo, visited, str, result,
+
82 ans = abbreviation_recursion(memo, visited, str, result,
83 str_idx + 1, result_idx + 1);
84 } else if (str[str_idx] - 32 == result[result_idx]) {
-
85 ans = abbreviation_recursion(memo, visited, str, result,
+
85 ans = abbreviation_recursion(memo, visited, str, result,
86 str_idx + 1, result_idx + 1) ||
-
87 abbreviation_recursion(memo, visited, str, result,
+
87 abbreviation_recursion(memo, visited, str, result,
88 str_idx + 1, result_idx);
89 } else {
90 // if `str[i]` is uppercase, then cannot be converted, return
@@ -153,44 +153,44 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
94 if (str[str_idx] >= 'A' && str[str_idx] <= 'Z') {
95 ans = false;
96 } else {
-
97 ans = abbreviation_recursion(memo, visited, str, result,
+
97 ans = abbreviation_recursion(memo, visited, str, result,
98 str_idx + 1, result_idx);
99 }
100 }
101 }
102 (*memo)[str_idx][result_idx] = ans;
103 (*visited)[str_idx][result_idx] = true;
-
104 return (*memo)[str_idx][result_idx];
+
104 return (*memo)[str_idx][result_idx];
105}
106
119bool abbreviation(const std::string &str, const std::string &result) {
-
120 std::vector<std::vector<bool>> memo(
+
120 std::vector<std::vector<bool>> memo(
121 str.size() + 1, std::vector<bool>(result.size() + 1, false));
122
123 for (uint32_t i = 0; i <= str.size(); ++i) {
-
124 memo[i][0] = true;
+
124 memo[i][0] = true;
125 }
126 for (uint32_t i = 1; i <= result.size(); ++i) {
-
127 memo[0][i] = false;
+
127 memo[0][i] = false;
128 }
129 for (uint32_t i = 1; i <= str.size(); ++i) {
130 for (uint32_t j = 1; j <= result.size(); ++j) {
131 if (str[i - 1] == result[j - 1]) {
-
132 memo[i][j] = memo[i - 1][j - 1];
+
132 memo[i][j] = memo[i - 1][j - 1];
133 } else if (str[i - 1] - 32 == result[j - 1]) {
-
134 memo[i][j] = (memo[i - 1][j - 1] || memo[i - 1][j]);
+
134 memo[i][j] = (memo[i - 1][j - 1] || memo[i - 1][j]);
135 } else {
136 if (str[i - 1] >= 'A' && str[i - 1] <= 'Z') {
-
137 memo[i][j] = false;
+
137 memo[i][j] = false;
138 } else {
-
139 memo[i][j] = memo[i - 1][j];
+
139 memo[i][j] = memo[i - 1][j];
140 }
141 }
142 }
143 }
-
144 return memo.back().back();
+
144 return memo.back().back();
145}
146} // namespace abbreviation
@@ -199,36 +199,36 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
153static void test() {
154 std::string s = "daBcd", t = "ABC";
-
155 std::vector<std::vector<bool>> memo(s.size() + 1,
+
155 std::vector<std::vector<bool>> memo(s.size() + 1,
156 std::vector<bool>(t.size() + 1, false)),
157 visited(s.size() + 1, std::vector<bool>(t.size() + 1, false));
158
159 assert(dynamic_programming::abbreviation::abbreviation_recursion(
-
160 &memo, &visited, s, t) == true);
+
160 &memo, &visited, s, t) == true);
161 assert(dynamic_programming::abbreviation::abbreviation(s, t) == true);
162 s = "XXVVnDEFYgYeMXzWINQYHAQKKOZEYgSRCzLZAmUYGUGILjMDET";
163 t = "XXVVDEFYYMXWINQYHAQKKOZEYSRCLZAUYGUGILMDETQVWU";
-
164 memo = std::vector<std::vector<bool>>(
+
164 memo = std::vector<std::vector<bool>>(
165 s.size() + 1, std::vector<bool>(t.size() + 1, false));
166
167 visited = std::vector<std::vector<bool>>(
168 s.size() + 1, std::vector<bool>(t.size() + 1, false));
169
170 assert(dynamic_programming::abbreviation::abbreviation_recursion(
-
171 &memo, &visited, s, t) == false);
+
171 &memo, &visited, s, t) == false);
172 assert(dynamic_programming::abbreviation::abbreviation(s, t) == false);
173
174 s = "DRFNLZZVHLPZWIupjwdmqafmgkg";
175 t = "DRFNLZZVHLPZWI";
176
-
177 memo = std::vector<std::vector<bool>>(
+
177 memo = std::vector<std::vector<bool>>(
178 s.size() + 1, std::vector<bool>(t.size() + 1, false));
179
180 visited = std::vector<std::vector<bool>>(
181 s.size() + 1, std::vector<bool>(t.size() + 1, false));
182
183 assert(dynamic_programming::abbreviation::abbreviation_recursion(
-
184 &memo, &visited, s, t) == true);
+
184 &memo, &visited, s, t) == true);
185 assert(dynamic_programming::abbreviation::abbreviation(s, t) == true);
186}
@@ -243,7 +243,6 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
dynamic_programming::abbreviation::abbreviation_recursion
bool abbreviation_recursion(std::vector< std::vector< bool > > *memo, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)
Recursive Dynamic Programming function.
Definition abbreviation.cpp:59
main
int main()
Main function.
Definition abbreviation.cpp:192
dynamic_programming::abbreviation::abbreviation
bool abbreviation(const std::string &str, const std::string &result)
Iterative Dynamic Programming function.
Definition abbreviation.cpp:119
-
memo
std::array< uint64_t, 1000 > memo
Array to store computed factorials for memoization.
Definition factorial_memoization.cpp:31
abbreviation
Functions for Abbreviation implementation.
dynamic_programming
Dynamic Programming algorithms.
diff --git a/d9/d09/class_memorised_factorial__coll__graph.map b/d9/d09/class_memorised_factorial__coll__graph.map new file mode 100644 index 000000000..a7506b5d7 --- /dev/null +++ b/d9/d09/class_memorised_factorial__coll__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d9/d09/class_memorised_factorial__coll__graph.md5 b/d9/d09/class_memorised_factorial__coll__graph.md5 new file mode 100644 index 000000000..da16ca88a --- /dev/null +++ b/d9/d09/class_memorised_factorial__coll__graph.md5 @@ -0,0 +1 @@ +04e4003c99cc628a342bca09e4f3f23d \ No newline at end of file diff --git a/d9/d09/class_memorised_factorial__coll__graph.svg b/d9/d09/class_memorised_factorial__coll__graph.svg new file mode 100644 index 000000000..c1981201d --- /dev/null +++ b/d9/d09/class_memorised_factorial__coll__graph.svg @@ -0,0 +1,66 @@ + + + + + + + + + + + + +MemorisedFactorial + + +Node1 + + +MemorisedFactorial + + + + + +Node2 + + +std::vector< std::uint64_t > + + + + + +Node2->Node1 + + + + + +known_values + + + + + + + + diff --git a/d9/d09/class_memorised_factorial__coll__graph_org.svg b/d9/d09/class_memorised_factorial__coll__graph_org.svg new file mode 100644 index 000000000..ff750a041 --- /dev/null +++ b/d9/d09/class_memorised_factorial__coll__graph_org.svg @@ -0,0 +1,40 @@ + + + + + + +MemorisedFactorial + + +Node1 + + +MemorisedFactorial + + + + + +Node2 + + +std::vector< std::uint64_t > + + + + + +Node2->Node1 + + + + + +known_values + + + diff --git a/da/d15/class_memorised_factorial.html b/da/d15/class_memorised_factorial.html new file mode 100644 index 000000000..b5cbf7bf8 --- /dev/null +++ b/da/d15/class_memorised_factorial.html @@ -0,0 +1,219 @@ + + + + + + + + +TheAlgorithms/C++: MemorisedFactorial Class Reference + + + + + + + + + + + + + + + + + + + + +
+
+

Functions

bool dynamic_programming::abbreviation::abbreviation_recursion (std::vector< std::vector< bool > > *memo, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)
bool dynamic_programming::abbreviation::abbreviation_recursion (std::vector< std::vector< bool > > *memo, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)
 Recursive Dynamic Programming function.
bool dynamic_programming::abbreviation::abbreviation (const std::string &str, const std::string &result)
 Iterative Dynamic Programming function.
+ + + + + + +
+
TheAlgorithms/C++ 1.0.0 +
+
All the algorithms implemented in C++
+
+
+ + + + + + + + +
+
+ +
+
+
+ +
+
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+
MemorisedFactorial Class Reference
+
+
+
+Collaboration diagram for MemorisedFactorial:
+
+
+
[legend]
+ + + +

+Public Member Functions

std::uint64_t operator() (std::uint64_t n)
+ + +

+Private Attributes

std::vector< std::uint64_t > known_values = {1}
+

Detailed Description

+
+

Definition at line 27 of file factorial_memoization.cpp.

+

Member Function Documentation

+ +

◆ operator()()

+ +
+
+ + + + + +
+ + + + + + + +
std::uint64_t MemorisedFactorial::operator() (std::uint64_t n)
+ 		+inline
+
+
Note
This function was intentionally written as recursive and it does not handle overflows.
+
Returns
factorial of n
+ +

Definition at line 36 of file factorial_memoization.cpp.

+
36 {
+
37 if (n >= this->known_values.size()) {
+
38 this->known_values.push_back(n * this->operator()(n - 1));
+
39 }
+
40 return this->known_values.at(n);
+
41 }
+
+
+
+

Member Data Documentation

+ +

◆ known_values

+ +
+
+ + + + + +
+ + + + +
std::vector<std::uint64_t> MemorisedFactorial::known_values = {1}
+ 		+private
+
+ +

Definition at line 28 of file factorial_memoization.cpp.

+
28{1};
+
+
+
+
The documentation for this class was generated from the following file: +
+
+
+
+
+
+
+
+
+
+ + + + diff --git a/da/d15/class_memorised_factorial.js b/da/d15/class_memorised_factorial.js new file mode 100644 index 000000000..2d7c4e1dc --- /dev/null +++ b/da/d15/class_memorised_factorial.js @@ -0,0 +1,4 @@ +var class_memorised_factorial = +[ + [ "operator()", "da/d15/class_memorised_factorial.html#a35506357960575f150b44ae32fcbad29", null ] +]; \ No newline at end of file diff --git a/db/d30/factorial__memoization_8cpp__incl.map b/db/d30/factorial__memoization_8cpp__incl.map index cd5e16a47..1695cea76 100644 --- a/db/d30/factorial__memoization_8cpp__incl.map +++ b/db/d30/factorial__memoization_8cpp__incl.map @@ -1,11 +1,9 @@ - - - - - - - - - + + + + + + + diff --git a/db/d30/factorial__memoization_8cpp__incl.md5 b/db/d30/factorial__memoization_8cpp__incl.md5 index b566ca4d8..77c3ee101 100644 --- a/db/d30/factorial__memoization_8cpp__incl.md5 +++ b/db/d30/factorial__memoization_8cpp__incl.md5 @@ -1 +1 @@ -69fc891120320fb84e290bfcf9cb1ff5 \ No newline at end of file +e201fef4865ec066f51c491e79e7a62e \ No newline at end of file diff --git a/db/d30/factorial__memoization_8cpp__incl.svg b/db/d30/factorial__memoization_8cpp__incl.svg index 84202a3b6..1e22cda54 100644 --- a/db/d30/factorial__memoization_8cpp__incl.svg +++ b/db/d30/factorial__memoization_8cpp__incl.svg @@ -4,8 +4,8 @@ - + @@ -23,8 +23,8 @@ Node1 - -math/factorial_memoization.cpp + +math/factorial_memoization.cpp @@ -32,8 +32,8 @@ Node2 - -iostream + +cassert @@ -41,8 +41,8 @@ Node1->Node2 - - + + @@ -50,8 +50,8 @@ Node3 - -cassert + +cstdint @@ -59,8 +59,8 @@ Node1->Node3 - - + + @@ -68,8 +68,8 @@ Node4 - -array + +vector @@ -77,26 +77,8 @@ Node1->Node4 - - - - - - - -Node5 - - -cstdint - - - - - -Node1->Node5 - - - + + diff --git a/db/d30/factorial__memoization_8cpp__incl_org.svg b/db/d30/factorial__memoization_8cpp__incl_org.svg index 0b15a8144..da7ca1b6d 100644 --- a/db/d30/factorial__memoization_8cpp__incl_org.svg +++ b/db/d30/factorial__memoization_8cpp__incl_org.svg @@ -4,16 +4,16 @@ - + math/factorial_memoization.cpp Node1 - -math/factorial_memoization.cpp + +math/factorial_memoization.cpp @@ -21,8 +21,8 @@ Node2 - -iostream + +cassert @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node3 - -cassert + +cstdint @@ -48,8 +48,8 @@ Node1->Node3 - - + + @@ -57,8 +57,8 @@ Node4 - -array + +vector @@ -66,26 +66,8 @@ Node1->Node4 - - - - - - - -Node5 - - -cstdint - - - - - -Node1->Node5 - - - + + diff --git a/db/d3b/class_memorised_factorial-members.html b/db/d3b/class_memorised_factorial-members.html new file mode 100644 index 000000000..b9739585f --- /dev/null +++ b/db/d3b/class_memorised_factorial-members.html @@ -0,0 +1,134 @@ + + + + + + + + +TheAlgorithms/C++: Member List + + + + + + + + + + + + + + + + + + + + +
+
+ + + + + + + +
+
TheAlgorithms/C++ 1.0.0 +
+
All the algorithms implemented in C++
+
+
+ + + + + + + + +
+
+ +
+
+
+ +
+
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+
MemorisedFactorial Member List
+
+
+ +

This is the complete list of members for MemorisedFactorial, including all inherited members.

+ + + +
known_values (defined in MemorisedFactorial)MemorisedFactorialprivate
operator()(std::uint64_t n)MemorisedFactorialinline
+
+
+ + + + diff --git a/dd/d47/namespacemath.html b/dd/d47/namespacemath.html index 4c23c781e..4251ef948 100644 --- a/dd/d47/namespacemath.html +++ b/dd/d47/namespacemath.html @@ -174,8 +174,6 @@ Functions  Function to calculate Euler's Totient.
uint64_t factorial (uint8_t n)  function to find factorial of given number
-uint64_t fact_recursion (uint64_t n) - Computes the factorial of a non-negative integer using recursion and memoization.
double integral_approx (double lb, double ub, const std::function< double(double)> &func, double delta=.0001)  Computes integral approximation.
void test_eval (double approx, double expected, double threshold) @@ -247,8 +245,8 @@ Functions

std::cout

for IO implementations

Evaluate recurrence relation using matrix exponentiation.

-

for mathematical functions

Math algorithms.

+

for mathematical functions

Mathematical algorithms.

for IO operations

for M_PI definition and pow()

@@ -821,42 +819,6 @@ template<typename T> - -

◆ fact_recursion()

- -
-
- - - - - - - -
uint64_t math::fact_recursion (uint64_t n)
-
- -

Computes the factorial of a non-negative integer using recursion and memoization.

-
Parameters
- - -
nThe integer whose factorial is to be computed
-
-
-
Returns
The factorial of n
- -

Definition at line 44 of file factorial_memoization.cpp.

-
44 {
-
45 if (n == 0) return 1; // Base case: 0! = 1
-
46 if (memo[n] != 0) return memo[n]; // Return already computed value
-
47 memo[n] = n * fact_recursion(n - 1); // Store and return the computed value
-
48 return memo[n];
-
49}
-
memo
std::array< uint64_t, 1000 > memo
Array to store computed factorials for memoization.
Definition factorial_memoization.cpp:31
-
math::fact_recursion
uint64_t fact_recursion(uint64_t n)
Computes the factorial of a non-negative integer using recursion and memoization.
Definition factorial_memoization.cpp:44
-
-
-

◆ factorial()

diff --git a/dd/d47/namespacemath.js b/dd/d47/namespacemath.js index d81337f4b..617f04a36 100644 --- a/dd/d47/namespacemath.js +++ b/dd/d47/namespacemath.js @@ -14,7 +14,6 @@ var namespacemath = [ "cylinder_surface_area", "dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864", null ], [ "cylinder_surface_perimeter", "dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73", null ], [ "cylinder_volume", "dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca", null ], - [ "fact_recursion", "dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b", null ], [ "factorial", "dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a", null ], [ "hemi_sphere_surface_area", "dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb", null ], [ "integral_approx", "dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11", null ], diff --git a/doxygen_crawl.html b/doxygen_crawl.html index 7eac40139..784caa13c 100644 --- a/doxygen_crawl.html +++ b/doxygen_crawl.html @@ -486,8 +486,6 @@ - - @@ -2100,6 +2098,8 @@ + + @@ -2345,6 +2345,7 @@ + @@ -2842,7 +2843,6 @@ - diff --git a/functions_func_o.html b/functions_func_o.html index b05db2449..156c28070 100644 --- a/functions_func_o.html +++ b/functions_func_o.html @@ -128,7 +128,7 @@ $(function(){initNavTree('functions_func_o.html','',''); });
  • operator&() : uint128_t, uint256_t
  • operator&&() : uint128_t, uint256_t
  • operator&=() : uint128_t, uint256_t
    • -
  • operator()() : Compare< S, T, E >, uint128_t, uint256_t
    • +
  • operator()() : Compare< S, T, E >, MemorisedFactorial, uint128_t, uint256_t
  • operator*() : Complex, divide_and_conquer::strassens_multiplication::Matrix< T, typename >, uint128_t, uint256_t
  • operator*=() : divide_and_conquer::strassens_multiplication::Matrix< T, typename >, large_number, uint128_t, uint256_t
  • operator+() : Complex, divide_and_conquer::strassens_multiplication::Matrix< T, typename >, uint128_t, uint256_t
    • diff --git a/functions_o.html b/functions_o.html index dc01d4109..2f94aa2b1 100644 --- a/functions_o.html +++ b/functions_o.html @@ -128,7 +128,7 @@ $(function(){initNavTree('functions_o.html','',''); });
  • operator&() : uint128_t, uint256_t
  • operator&&() : uint128_t, uint256_t
  • operator&=() : uint128_t, uint256_t
    • -
  • operator()() : Compare< S, T, E >, uint128_t, uint256_t
    • +
  • operator()() : Compare< S, T, E >, MemorisedFactorial, uint128_t, uint256_t
  • operator*() : Complex, divide_and_conquer::strassens_multiplication::Matrix< T, typename >, uint128_t, uint256_t
  • operator*=() : divide_and_conquer::strassens_multiplication::Matrix< T, typename >, large_number, uint128_t, uint256_t
  • operator+() : Complex, divide_and_conquer::strassens_multiplication::Matrix< T, typename >, large_number, uint128_t, uint256_t
    • diff --git a/globals_func_t.html b/globals_func_t.html index 059a31509..90f9192c8 100644 --- a/globals_func_t.html +++ b/globals_func_t.html @@ -139,7 +139,6 @@ $(function(){initNavTree('globals_func_t.html','',''); });
  • test_contains() : binary_search_tree2.cpp
  • test_double() : quick_sort_3.cpp
  • test_f() : shell_sort2.cpp
    • -
  • test_fact_recursion() : factorial_memoization.cpp
  • test_find_max() : binary_search_tree2.cpp
  • test_find_min() : binary_search_tree2.cpp
  • test_function() : realtime_stats.cpp
    • diff --git a/globals_m.html b/globals_m.html index 9a1c79679..00e78e671 100644 --- a/globals_m.html +++ b/globals_m.html @@ -125,7 +125,6 @@ $(function(){initNavTree('globals_m.html','',''); });
  • MAX_ITERATIONS : bisection_method.cpp, newton_raphson_method.cpp
  • max_size : queue_using_array.cpp
  • max_subarray_sum() : kadanes3.cpp
    • -
  • memo : factorial_memoization.cpp
  • merge() : merge_sort.cpp
  • mergeSort() : merge_sort.cpp
  • method1() : decimal_to_binary.cpp
    • diff --git a/globals_t.html b/globals_t.html index 6f5a5069d..438ee1c4e 100644 --- a/globals_t.html +++ b/globals_t.html @@ -139,7 +139,6 @@ $(function(){initNavTree('globals_t.html','',''); });
  • test_contains() : binary_search_tree2.cpp
  • test_double() : quick_sort_3.cpp
  • test_f() : shell_sort2.cpp
    • -
  • test_fact_recursion() : factorial_memoization.cpp
  • test_find_max() : binary_search_tree2.cpp
  • test_find_min() : binary_search_tree2.cpp
  • test_function() : realtime_stats.cpp
    • diff --git a/globals_vars.html b/globals_vars.html index 07aab7e8f..40dddd94d 100644 --- a/globals_vars.html +++ b/globals_vars.html @@ -130,7 +130,6 @@ $(function(){initNavTree('globals_vars.html','',''); });
  • MAX_ITER : adaline_learning.cpp
  • MAX_ITERATIONS : newton_raphson_method.cpp
  • max_size : queue_using_array.cpp
    • -
  • memo : factorial_memoization.cpp
  • prime : primes_up_to_billion.cpp
  • prime_numbers : prime_factorization.cpp
  • stack : paranthesis_matching.cpp
    • diff --git a/hierarchy.html b/hierarchy.html index 931eb6ff8..a717e4289 100644 --- a/hierarchy.html +++ b/hierarchy.html @@ -191,80 +191,81 @@ This inheritance list is sorted roughly, but not completely, alphabetically: Cothers::Cache::LRUCache< K, V >LRUCache  Cothers::lru_cache::LRUCacheLRU cache class  Cdivide_and_conquer::strassens_multiplication::Matrix< T, typename >Matrix class - CMinHeap - CMinHeapNode - Cmst - Cmath::ncr_modulo_p::NCRModuloPClass which contains all methods required for calculating nCr mod p - Cmachine_learning::neural_network::NeuralNetwork - Cdata_structures::linked_list::Node - Cdata_structures::Node - Cdata_structures::tree_234::Node2-3-4 tree node class - Cdata_structures::trie_using_hashmap::Trie::NodeStruct representing a trie node - CNode< ValueType > - Coperations_on_datastructures::circular_linked_list::NodeA Node struct that represents a single Node in a Binary Tree - Coperations_on_datastructures::inorder_traversal_of_bst::NodeA Node structure representing a single node in BST - Coperations_on_datastructures::reverse_binary_tree::NodeA Node struct that represents a single node in a Binary Tree - Cothers::iterative_tree_traversals::NodeDefines the structure of a node of the tree - Cothers::recursive_tree_traversals::NodeThe structure to hold Nodes of the tree - Crange_queries::perSegTree::Node - Csearch::sublist_search::NodeA Node structure representing a single link Node in a linked list - Ctests::NodeA Node struct that represents a single Node in a Binary Tree - Cnode - Cstrings::boyer_moore::patternA structure representing all the data we need to search the preprocessed pattern in text - Crange_queries::perSegTreeRange query here is range sum, but the code can be modified to make different queries like range max or min - Cciphers::elliptic_curve_key_exchange::PointDefinition of struct Point - Cgeometry::grahamscan::Point - Cgeometry::jarvis::Point - CPoint - Cpriority_queue< T >STL class - Cquery - CQueue - Cqueue< ValueType > - Cdata_structures::queue_using_array::Queue_ArrayQueue_Array class containing the main data and also index of head and tail of the array - CRBtree - Cunordered_set< K >::reverse_iteratorSTL iterator class - Cvector< T >::reverse_iteratorSTL iterator class - CSegmentIntersection - Cdata_structures::SegmentTree< T >Class representation of the segment tree - Crange_queries::heavy_light_decomposition::SG< X >Segment Tree, to store heavy chains - Crange_queries::heavy_light_decomposition::HLD< X >The Heavy-Light Decomposition class - CSJF< S, T, E >Class which implements the SJF scheduling algorithm - Cdata_structures::SkipList - CSolution - Cdata_structures::sparse_table::Sparse_table - Cdata_structures::Stack< T >Class representation of a stack - Cdata_structures::stack_using_queue::StackStack Class implementation for basic methods of Stack Data Structure - Cothers::postfix_expression::StackCreates an array to be used as stack for storing values - Cstack< ValueType >For std::invalid_argument - Cstack_linkedList - Cstatistics::stats_computer1< T > - Cstats_computer1< T > - Cstatistics::stats_computer2< T > - Cstats_computer2< T > - CTestCaseSingle example inputs and expected output of the function longest_common_string_length - CTestCasesClass encapsulating the necessary test cases - Coperations_on_datastructures::trie_operations::TnodeClass defining the structure of trie node and containing the methods to perform operations on them - Ctower - Cdata_structures::treap::TreapStruct representation of the treap - Crange_queries::heavy_light_decomposition::Tree< X >A Basic Tree, which supports binary lifting - Crange_queries::heavy_light_decomposition::HLD< X >The Heavy-Light Decomposition class - Cdata_structures::tree_234::Tree2342-3-4 tree class - Cdata_structures::trie_using_hashmap::TrieTrie 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 - CTrie - Cdata_structures::trieTrie implementation for small-case English alphabets a-z - CTrie::TrieNode - Cstd::true_type - Cstd::is_arithmetic< uint128_t > - Cstd::is_arithmetic< uint256_t > - Cstd::is_integral< uint128_t > - Cstd::is_integral< uint256_t > - Cstd::is_unsigned< uint128_t > - Cstd::is_unsigned< uint256_t > - Cuint128_tClass for 128-bit unsigned integer - Cuint256_tClass for 256-bit unsigned integer - Cunordered_set< K >STL class - Cvector< T >STL class - Cprobability::windowed_median::WindowedMedianA class to calculate the median of a leading sliding window at the back of a stream of integer values + CMemorisedFactorial + CMinHeap + CMinHeapNode + Cmst + Cmath::ncr_modulo_p::NCRModuloPClass which contains all methods required for calculating nCr mod p + Cmachine_learning::neural_network::NeuralNetwork + Cdata_structures::linked_list::Node + Cdata_structures::Node + Cdata_structures::tree_234::Node2-3-4 tree node class + Cdata_structures::trie_using_hashmap::Trie::NodeStruct representing a trie node + CNode< ValueType > + Coperations_on_datastructures::circular_linked_list::NodeA Node struct that represents a single Node in a Binary Tree + Coperations_on_datastructures::inorder_traversal_of_bst::NodeA Node structure representing a single node in BST + Coperations_on_datastructures::reverse_binary_tree::NodeA Node struct that represents a single node in a Binary Tree + Cothers::iterative_tree_traversals::NodeDefines the structure of a node of the tree + Cothers::recursive_tree_traversals::NodeThe structure to hold Nodes of the tree + Crange_queries::perSegTree::Node + Csearch::sublist_search::NodeA Node structure representing a single link Node in a linked list + Ctests::NodeA Node struct that represents a single Node in a Binary Tree + Cnode + Cstrings::boyer_moore::patternA structure representing all the data we need to search the preprocessed pattern in text + Crange_queries::perSegTreeRange query here is range sum, but the code can be modified to make different queries like range max or min + Cciphers::elliptic_curve_key_exchange::PointDefinition of struct Point + Cgeometry::grahamscan::Point + Cgeometry::jarvis::Point + CPoint + Cpriority_queue< T >STL class + Cquery + CQueue + Cqueue< ValueType > + Cdata_structures::queue_using_array::Queue_ArrayQueue_Array class containing the main data and also index of head and tail of the array + CRBtree + Cunordered_set< K >::reverse_iteratorSTL iterator class + Cvector< T >::reverse_iteratorSTL iterator class + CSegmentIntersection + Cdata_structures::SegmentTree< T >Class representation of the segment tree + Crange_queries::heavy_light_decomposition::SG< X >Segment Tree, to store heavy chains + Crange_queries::heavy_light_decomposition::HLD< X >The Heavy-Light Decomposition class + CSJF< S, T, E >Class which implements the SJF scheduling algorithm + Cdata_structures::SkipList + CSolution + Cdata_structures::sparse_table::Sparse_table + Cdata_structures::Stack< T >Class representation of a stack + Cdata_structures::stack_using_queue::StackStack Class implementation for basic methods of Stack Data Structure + Cothers::postfix_expression::StackCreates an array to be used as stack for storing values + Cstack< ValueType >For std::invalid_argument + Cstack_linkedList + Cstatistics::stats_computer1< T > + Cstats_computer1< T > + Cstatistics::stats_computer2< T > + Cstats_computer2< T > + CTestCaseSingle example inputs and expected output of the function longest_common_string_length + CTestCasesClass encapsulating the necessary test cases + Coperations_on_datastructures::trie_operations::TnodeClass defining the structure of trie node and containing the methods to perform operations on them + Ctower + Cdata_structures::treap::TreapStruct representation of the treap + Crange_queries::heavy_light_decomposition::Tree< X >A Basic Tree, which supports binary lifting + Crange_queries::heavy_light_decomposition::HLD< X >The Heavy-Light Decomposition class + Cdata_structures::tree_234::Tree2342-3-4 tree class + Cdata_structures::trie_using_hashmap::TrieTrie 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 + CTrie + Cdata_structures::trieTrie implementation for small-case English alphabets a-z + CTrie::TrieNode + Cstd::true_type + Cstd::is_arithmetic< uint128_t > + Cstd::is_arithmetic< uint256_t > + Cstd::is_integral< uint128_t > + Cstd::is_integral< uint256_t > + Cstd::is_unsigned< uint128_t > + Cstd::is_unsigned< uint256_t > + Cuint128_tClass for 128-bit unsigned integer + Cuint256_tClass for 256-bit unsigned integer + Cunordered_set< K >STL class + Cvector< T >STL class + Cprobability::windowed_median::WindowedMedianA 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 262bd484b..26ffd7e0f 100644 --- a/hierarchy.js +++ b/hierarchy.js @@ -72,6 +72,7 @@ var hierarchy = [ "others::Cache::LRUCache< K, V >", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html", null ], [ "others::lru_cache::LRUCache", "d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html", null ], [ "divide_and_conquer::strassens_multiplication::Matrix< T, typename >", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html", null ], + [ "MemorisedFactorial", "da/d15/class_memorised_factorial.html", null ], [ "MinHeap", "d2/d05/class_min_heap.html", null ], [ "MinHeapNode", "d5/d29/struct_min_heap_node.html", null ], [ "mst", "d1/d77/structmst.html", null ], diff --git a/inherit_graph_100.map b/inherit_graph_100.map index a42c585cb..93e437855 100644 --- a/inherit_graph_100.map +++ b/inherit_graph_100.map @@ -1,7 +1,3 @@ - - - - - + diff --git a/inherit_graph_100.md5 b/inherit_graph_100.md5 index 10453adc0..58e6b0536 100644 --- a/inherit_graph_100.md5 +++ b/inherit_graph_100.md5 @@ -1 +1 @@ -63959187ee3e2e3f45b53a6139717dfe \ No newline at end of file +6b91f80b28512355cc99440d1f709211 \ No newline at end of file diff --git a/inherit_graph_100.svg b/inherit_graph_100.svg index 06881e359..911794d99 100644 --- a/inherit_graph_100.svg +++ b/inherit_graph_100.svg @@ -4,58 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -range_queries::heavy -_light_decomposition -::SG< X > - - - - - -Node1 - - -range_queries::heavy -_light_decomposition -::HLD< X > - - - - - -Node0->Node1 - - - - - - - - -Node2 - - -range_queries::heavy -_light_decomposition -::Tree< X > - - - - - -Node2->Node1 - - - + + +range_queries::fenwick_tree diff --git a/inherit_graph_101.map b/inherit_graph_101.map index ce7850cda..a42c585cb 100644 --- a/inherit_graph_101.map +++ b/inherit_graph_101.map @@ -1,3 +1,7 @@ - + + + + + diff --git a/inherit_graph_101.md5 b/inherit_graph_101.md5 index 24cadb1f3..10453adc0 100644 --- a/inherit_graph_101.md5 +++ b/inherit_graph_101.md5 @@ -1 +1 @@ -ee57f6a4fc54bb7c3a6afb895a05fbfe \ No newline at end of file +63959187ee3e2e3f45b53a6139717dfe \ No newline at end of file diff --git a/inherit_graph_101.svg b/inherit_graph_101.svg index 2df0b6a9c..06881e359 100644 --- a/inherit_graph_101.svg +++ b/inherit_graph_101.svg @@ -4,16 +4,58 @@ - - + + Graphical Class Hierarchy Node0 - - -range_queries::perSegTree + + +range_queries::heavy +_light_decomposition +::SG< X > + + + + + +Node1 + + +range_queries::heavy +_light_decomposition +::HLD< X > + + + + + +Node0->Node1 + + + + + + + + +Node2 + + +range_queries::heavy +_light_decomposition +::Tree< X > + + + + + +Node2->Node1 + + + diff --git a/inherit_graph_102.map b/inherit_graph_102.map index e1272af9d..ce7850cda 100644 --- a/inherit_graph_102.map +++ b/inherit_graph_102.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_102.md5 b/inherit_graph_102.md5 index d8ebba9bf..24cadb1f3 100644 --- a/inherit_graph_102.md5 +++ b/inherit_graph_102.md5 @@ -1 +1 @@ -16fb1aa33fafc14e9745334295003576 \ No newline at end of file +ee57f6a4fc54bb7c3a6afb895a05fbfe \ No newline at end of file diff --git a/inherit_graph_102.svg b/inherit_graph_102.svg index 2ab0d21d3..2df0b6a9c 100644 --- a/inherit_graph_102.svg +++ b/inherit_graph_102.svg @@ -4,17 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -range_queries::perSegTree -::Node + + +range_queries::perSegTree diff --git a/inherit_graph_103.map b/inherit_graph_103.map index 793ef5c28..e1272af9d 100644 --- a/inherit_graph_103.map +++ b/inherit_graph_103.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_103.md5 b/inherit_graph_103.md5 index ae285fb9b..d8ebba9bf 100644 --- a/inherit_graph_103.md5 +++ b/inherit_graph_103.md5 @@ -1 +1 @@ -4118d46187a1c497ec1244462bb4e7d1 \ No newline at end of file +16fb1aa33fafc14e9745334295003576 \ No newline at end of file diff --git a/inherit_graph_103.svg b/inherit_graph_103.svg index 56bd10939..2ab0d21d3 100644 --- a/inherit_graph_103.svg +++ b/inherit_graph_103.svg @@ -4,16 +4,17 @@ - - + + Graphical Class Hierarchy Node0 - - -RBtree + + +range_queries::perSegTree +::Node diff --git a/inherit_graph_104.map b/inherit_graph_104.map index 1c951b834..793ef5c28 100644 --- a/inherit_graph_104.map +++ b/inherit_graph_104.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_104.md5 b/inherit_graph_104.md5 index 9bd5c9ecc..ae285fb9b 100644 --- a/inherit_graph_104.md5 +++ b/inherit_graph_104.md5 @@ -1 +1 @@ -d1b903c12342c81b9815dc3248590328 \ No newline at end of file +4118d46187a1c497ec1244462bb4e7d1 \ No newline at end of file diff --git a/inherit_graph_104.svg b/inherit_graph_104.svg index 9ca2ab51c..56bd10939 100644 --- a/inherit_graph_104.svg +++ b/inherit_graph_104.svg @@ -4,17 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -search::sublist_search -::Node + + +RBtree diff --git a/inherit_graph_105.map b/inherit_graph_105.map index ac2ac7773..1c951b834 100644 --- a/inherit_graph_105.map +++ b/inherit_graph_105.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_105.md5 b/inherit_graph_105.md5 index 5964d67e1..9bd5c9ecc 100644 --- a/inherit_graph_105.md5 +++ b/inherit_graph_105.md5 @@ -1 +1 @@ -ec8e0ec9ba2659ae4c1c03a14fee656f \ No newline at end of file +d1b903c12342c81b9815dc3248590328 \ No newline at end of file diff --git a/inherit_graph_105.svg b/inherit_graph_105.svg index 726030edf..9ca2ab51c 100644 --- a/inherit_graph_105.svg +++ b/inherit_graph_105.svg @@ -4,16 +4,17 @@ - - + + Graphical Class Hierarchy Node0 - - -SegmentIntersection + + +search::sublist_search +::Node diff --git a/inherit_graph_106.map b/inherit_graph_106.map index b6a8f603d..ac2ac7773 100644 --- a/inherit_graph_106.map +++ b/inherit_graph_106.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_106.md5 b/inherit_graph_106.md5 index 5a1e8f8a3..5964d67e1 100644 --- a/inherit_graph_106.md5 +++ b/inherit_graph_106.md5 @@ -1 +1 @@ -ae80b7e5eab51d77087f805b22c5c3f0 \ No newline at end of file +ec8e0ec9ba2659ae4c1c03a14fee656f \ No newline at end of file diff --git a/inherit_graph_106.svg b/inherit_graph_106.svg index 7f45fd304..726030edf 100644 --- a/inherit_graph_106.svg +++ b/inherit_graph_106.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -SJF< S, T, E > + + +SegmentIntersection diff --git a/inherit_graph_107.map b/inherit_graph_107.map index 9185a6598..b6a8f603d 100644 --- a/inherit_graph_107.map +++ b/inherit_graph_107.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_107.md5 b/inherit_graph_107.md5 index 9e4062aa2..5a1e8f8a3 100644 --- a/inherit_graph_107.md5 +++ b/inherit_graph_107.md5 @@ -1 +1 @@ -ff0be17deb0c0dfb25090b34c2c7d14f \ No newline at end of file +ae80b7e5eab51d77087f805b22c5c3f0 \ No newline at end of file diff --git a/inherit_graph_107.svg b/inherit_graph_107.svg index 3f5836239..7f45fd304 100644 --- a/inherit_graph_107.svg +++ b/inherit_graph_107.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -Solution + + +SJF< S, T, E > diff --git a/inherit_graph_108.map b/inherit_graph_108.map index 523bb50ea..9185a6598 100644 --- a/inherit_graph_108.map +++ b/inherit_graph_108.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_108.md5 b/inherit_graph_108.md5 index c34364d09..9e4062aa2 100644 --- a/inherit_graph_108.md5 +++ b/inherit_graph_108.md5 @@ -1 +1 @@ -717e385118aaa4f551bc0a7a0954681d \ No newline at end of file +ff0be17deb0c0dfb25090b34c2c7d14f \ No newline at end of file diff --git a/inherit_graph_108.svg b/inherit_graph_108.svg index 219358f4b..3f5836239 100644 --- a/inherit_graph_108.svg +++ b/inherit_graph_108.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -stack< ValueType > + + +Solution diff --git a/inherit_graph_109.map b/inherit_graph_109.map index 97c953eb5..523bb50ea 100644 --- a/inherit_graph_109.map +++ b/inherit_graph_109.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_109.md5 b/inherit_graph_109.md5 index 8a3a7c542..c34364d09 100644 --- a/inherit_graph_109.md5 +++ b/inherit_graph_109.md5 @@ -1 +1 @@ -f583284f2e396e0f7b5fd8bccf0bb840 \ No newline at end of file +717e385118aaa4f551bc0a7a0954681d \ No newline at end of file diff --git a/inherit_graph_109.svg b/inherit_graph_109.svg index 7eefb0075..219358f4b 100644 --- a/inherit_graph_109.svg +++ b/inherit_graph_109.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -stack_linkedList + + +stack< ValueType > diff --git a/inherit_graph_110.map b/inherit_graph_110.map index 14e480f66..97c953eb5 100644 --- a/inherit_graph_110.map +++ b/inherit_graph_110.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_110.md5 b/inherit_graph_110.md5 index c8cefab72..8a3a7c542 100644 --- a/inherit_graph_110.md5 +++ b/inherit_graph_110.md5 @@ -1 +1 @@ -adf4423c975497d5fe67f2bb0728f9b9 \ No newline at end of file +f583284f2e396e0f7b5fd8bccf0bb840 \ No newline at end of file diff --git a/inherit_graph_110.svg b/inherit_graph_110.svg index 7fd2d5e6d..7eefb0075 100644 --- a/inherit_graph_110.svg +++ b/inherit_graph_110.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -statistics::stats_computer1< T > + + +stack_linkedList diff --git a/inherit_graph_111.map b/inherit_graph_111.map index d30db2352..14e480f66 100644 --- a/inherit_graph_111.map +++ b/inherit_graph_111.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_111.md5 b/inherit_graph_111.md5 index 6a131a0c2..c8cefab72 100644 --- a/inherit_graph_111.md5 +++ b/inherit_graph_111.md5 @@ -1 +1 @@ -efb55af1cccef519836d4c2436ccda42 \ No newline at end of file +adf4423c975497d5fe67f2bb0728f9b9 \ No newline at end of file diff --git a/inherit_graph_111.svg b/inherit_graph_111.svg index 86d1a4678..7fd2d5e6d 100644 --- a/inherit_graph_111.svg +++ b/inherit_graph_111.svg @@ -11,9 +11,9 @@ Node0 - + -statistics::stats_computer2< T > +statistics::stats_computer1< T > diff --git a/inherit_graph_112.map b/inherit_graph_112.map index a825df6c1..d30db2352 100644 --- a/inherit_graph_112.map +++ b/inherit_graph_112.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_112.md5 b/inherit_graph_112.md5 index fe97a8644..6a131a0c2 100644 --- a/inherit_graph_112.md5 +++ b/inherit_graph_112.md5 @@ -1 +1 @@ -40a0f5e43a594b9f92e605b8a59193fa \ No newline at end of file +efb55af1cccef519836d4c2436ccda42 \ No newline at end of file diff --git a/inherit_graph_112.svg b/inherit_graph_112.svg index 544bff06c..86d1a4678 100644 --- a/inherit_graph_112.svg +++ b/inherit_graph_112.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -stats_computer1< T > + + +statistics::stats_computer2< T > diff --git a/inherit_graph_113.map b/inherit_graph_113.map index 640874a2a..a825df6c1 100644 --- a/inherit_graph_113.map +++ b/inherit_graph_113.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_113.md5 b/inherit_graph_113.md5 index 694de1034..fe97a8644 100644 --- a/inherit_graph_113.md5 +++ b/inherit_graph_113.md5 @@ -1 +1 @@ -d4437759efff898ce34be0dab5e94c3f \ No newline at end of file +40a0f5e43a594b9f92e605b8a59193fa \ No newline at end of file diff --git a/inherit_graph_113.svg b/inherit_graph_113.svg index 5826a474f..544bff06c 100644 --- a/inherit_graph_113.svg +++ b/inherit_graph_113.svg @@ -11,9 +11,9 @@ Node0 - + -stats_computer2< T > +stats_computer1< T > diff --git a/inherit_graph_114.map b/inherit_graph_114.map index 6e6f4540f..640874a2a 100644 --- a/inherit_graph_114.map +++ b/inherit_graph_114.map @@ -1,15 +1,3 @@ - - - - - - - - - - - - - + diff --git a/inherit_graph_114.md5 b/inherit_graph_114.md5 index 23de87cac..694de1034 100644 --- a/inherit_graph_114.md5 +++ b/inherit_graph_114.md5 @@ -1 +1 @@ -40148db2c502b9385ae4dd5781440f30 \ No newline at end of file +d4437759efff898ce34be0dab5e94c3f \ No newline at end of file diff --git a/inherit_graph_114.svg b/inherit_graph_114.svg index 14f72efde..5826a474f 100644 --- a/inherit_graph_114.svg +++ b/inherit_graph_114.svg @@ -4,126 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -std::true_type - - - - - -Node1 - - -std::is_arithmetic -< uint128_t > - - - - - -Node0->Node1 - - - - - - - - -Node2 - - -std::is_arithmetic -< uint256_t > - - - - - -Node0->Node2 - - - - - - - - -Node3 - - -std::is_integral< uint128_t > - - - - - -Node0->Node3 - - - - - - - - -Node4 - - -std::is_integral< uint256_t > - - - - - -Node0->Node4 - - - - - - - - -Node5 - - -std::is_unsigned< uint128_t > - - - - - -Node0->Node5 - - - - - - - - -Node6 - - -std::is_unsigned< uint256_t > - - - - - -Node0->Node6 - - - + + +stats_computer2< T > diff --git a/inherit_graph_115.map b/inherit_graph_115.map index 453f8f72c..6e6f4540f 100644 --- a/inherit_graph_115.map +++ b/inherit_graph_115.map @@ -1,3 +1,15 @@ - + + + + + + + + + + + + + diff --git a/inherit_graph_115.md5 b/inherit_graph_115.md5 index d2b23f2ce..23de87cac 100644 --- a/inherit_graph_115.md5 +++ b/inherit_graph_115.md5 @@ -1 +1 @@ -d6ee5f042479b5982faa79c9932e1b9c \ No newline at end of file +40148db2c502b9385ae4dd5781440f30 \ No newline at end of file diff --git a/inherit_graph_115.svg b/inherit_graph_115.svg index cf10a240c..14f72efde 100644 --- a/inherit_graph_115.svg +++ b/inherit_graph_115.svg @@ -4,17 +4,126 @@ - - + + Graphical Class Hierarchy Node0 - - -strings::boyer_moore -::pattern + + +std::true_type + + + + + +Node1 + + +std::is_arithmetic +< uint128_t > + + + + + +Node0->Node1 + + + + + + + + +Node2 + + +std::is_arithmetic +< uint256_t > + + + + + +Node0->Node2 + + + + + + + + +Node3 + + +std::is_integral< uint128_t > + + + + + +Node0->Node3 + + + + + + + + +Node4 + + +std::is_integral< uint256_t > + + + + + +Node0->Node4 + + + + + + + + +Node5 + + +std::is_unsigned< uint128_t > + + + + + +Node0->Node5 + + + + + + + + +Node6 + + +std::is_unsigned< uint256_t > + + + + + +Node0->Node6 + + + diff --git a/inherit_graph_116.map b/inherit_graph_116.map index cd9e94752..453f8f72c 100644 --- a/inherit_graph_116.map +++ b/inherit_graph_116.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_116.md5 b/inherit_graph_116.md5 index 2cfb4dbc5..d2b23f2ce 100644 --- a/inherit_graph_116.md5 +++ b/inherit_graph_116.md5 @@ -1 +1 @@ -abd7e48c602c9ba41e00a619e3234e23 \ No newline at end of file +d6ee5f042479b5982faa79c9932e1b9c \ No newline at end of file diff --git a/inherit_graph_116.svg b/inherit_graph_116.svg index edf42cba1..cf10a240c 100644 --- a/inherit_graph_116.svg +++ b/inherit_graph_116.svg @@ -4,16 +4,17 @@ - - + + Graphical Class Hierarchy Node0 - - -TestCase + + +strings::boyer_moore +::pattern diff --git a/inherit_graph_117.map b/inherit_graph_117.map index e74b1f7a1..cd9e94752 100644 --- a/inherit_graph_117.map +++ b/inherit_graph_117.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_117.md5 b/inherit_graph_117.md5 index 078c92174..2cfb4dbc5 100644 --- a/inherit_graph_117.md5 +++ b/inherit_graph_117.md5 @@ -1 +1 @@ -a9d8d2a80cdf35dfac76eecdbb209456 \ No newline at end of file +abd7e48c602c9ba41e00a619e3234e23 \ No newline at end of file diff --git a/inherit_graph_117.svg b/inherit_graph_117.svg index a3f434141..edf42cba1 100644 --- a/inherit_graph_117.svg +++ b/inherit_graph_117.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -TestCases + + +TestCase diff --git a/inherit_graph_118.map b/inherit_graph_118.map index 841a8f125..e74b1f7a1 100644 --- a/inherit_graph_118.map +++ b/inherit_graph_118.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_118.md5 b/inherit_graph_118.md5 index 63fa19da8..078c92174 100644 --- a/inherit_graph_118.md5 +++ b/inherit_graph_118.md5 @@ -1 +1 @@ -1582871a9977d1f8d834882bd9106e10 \ No newline at end of file +a9d8d2a80cdf35dfac76eecdbb209456 \ No newline at end of file diff --git a/inherit_graph_118.svg b/inherit_graph_118.svg index 403e4cea9..a3f434141 100644 --- a/inherit_graph_118.svg +++ b/inherit_graph_118.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -tests::CircularLinkedList + + +TestCases diff --git a/inherit_graph_119.map b/inherit_graph_119.map index c53212423..841a8f125 100644 --- a/inherit_graph_119.map +++ b/inherit_graph_119.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_119.md5 b/inherit_graph_119.md5 index 40517ff58..63fa19da8 100644 --- a/inherit_graph_119.md5 +++ b/inherit_graph_119.md5 @@ -1 +1 @@ -f45d6d50ceb0ddd3bcef9faae75ffa44 \ No newline at end of file +1582871a9977d1f8d834882bd9106e10 \ No newline at end of file diff --git a/inherit_graph_119.svg b/inherit_graph_119.svg index 1c6e2c5f6..403e4cea9 100644 --- a/inherit_graph_119.svg +++ b/inherit_graph_119.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -tests::Node + + +tests::CircularLinkedList diff --git a/inherit_graph_120.map b/inherit_graph_120.map index a7d2146ab..c53212423 100644 --- a/inherit_graph_120.map +++ b/inherit_graph_120.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_120.md5 b/inherit_graph_120.md5 index 74da2954d..40517ff58 100644 --- a/inherit_graph_120.md5 +++ b/inherit_graph_120.md5 @@ -1 +1 @@ -76f1c23145670e75e2e13d0451b74420 \ No newline at end of file +f45d6d50ceb0ddd3bcef9faae75ffa44 \ No newline at end of file diff --git a/inherit_graph_120.svg b/inherit_graph_120.svg index 8ce306b69..1c6e2c5f6 100644 --- a/inherit_graph_120.svg +++ b/inherit_graph_120.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -tower + + +tests::Node diff --git a/inherit_graph_121.map b/inherit_graph_121.map index 49a477185..a7d2146ab 100644 --- a/inherit_graph_121.map +++ b/inherit_graph_121.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_121.md5 b/inherit_graph_121.md5 index 94955023c..74da2954d 100644 --- a/inherit_graph_121.md5 +++ b/inherit_graph_121.md5 @@ -1 +1 @@ -845eae9f7c70e50cf22fb926bd9e034b \ No newline at end of file +76f1c23145670e75e2e13d0451b74420 \ No newline at end of file diff --git a/inherit_graph_121.svg b/inherit_graph_121.svg index 67161427b..8ce306b69 100644 --- a/inherit_graph_121.svg +++ b/inherit_graph_121.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -Trie + + +tower diff --git a/inherit_graph_122.map b/inherit_graph_122.map index 9694ad8d8..49a477185 100644 --- a/inherit_graph_122.map +++ b/inherit_graph_122.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_122.md5 b/inherit_graph_122.md5 index 0362b08cb..94955023c 100644 --- a/inherit_graph_122.md5 +++ b/inherit_graph_122.md5 @@ -1 +1 @@ -a8666508fe9ca12fb7281895f580da44 \ No newline at end of file +845eae9f7c70e50cf22fb926bd9e034b \ No newline at end of file diff --git a/inherit_graph_122.svg b/inherit_graph_122.svg index 4464f0c28..67161427b 100644 --- a/inherit_graph_122.svg +++ b/inherit_graph_122.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -Trie::TrieNode + + +Trie diff --git a/inherit_graph_123.map b/inherit_graph_123.map index 09e168ce1..9694ad8d8 100644 --- a/inherit_graph_123.map +++ b/inherit_graph_123.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_123.md5 b/inherit_graph_123.md5 index f04050dca..0362b08cb 100644 --- a/inherit_graph_123.md5 +++ b/inherit_graph_123.md5 @@ -1 +1 @@ -eed75a69314afbb385b920f554ca3c5d \ No newline at end of file +a8666508fe9ca12fb7281895f580da44 \ No newline at end of file diff --git a/inherit_graph_123.svg b/inherit_graph_123.svg index e67c0ae88..4464f0c28 100644 --- a/inherit_graph_123.svg +++ b/inherit_graph_123.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -uint128_t + + +Trie::TrieNode diff --git a/inherit_graph_124.map b/inherit_graph_124.map index 3f8684b8d..09e168ce1 100644 --- a/inherit_graph_124.map +++ b/inherit_graph_124.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_124.md5 b/inherit_graph_124.md5 index 8c62d9521..f04050dca 100644 --- a/inherit_graph_124.md5 +++ b/inherit_graph_124.md5 @@ -1 +1 @@ -805bd0d28e53f8af03d7b4e5906cc299 \ No newline at end of file +eed75a69314afbb385b920f554ca3c5d \ No newline at end of file diff --git a/inherit_graph_124.svg b/inherit_graph_124.svg index 7f7ca2da6..e67c0ae88 100644 --- a/inherit_graph_124.svg +++ b/inherit_graph_124.svg @@ -11,9 +11,9 @@ Node0 - + -uint256_t +uint128_t diff --git a/inherit_graph_125.map b/inherit_graph_125.map index 10b9ad051..3f8684b8d 100644 --- a/inherit_graph_125.map +++ b/inherit_graph_125.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_125.md5 b/inherit_graph_125.md5 index 54fdc777a..8c62d9521 100644 --- a/inherit_graph_125.md5 +++ b/inherit_graph_125.md5 @@ -1 +1 @@ -5fe4884033b64eb41fe44c44e59aee59 \ No newline at end of file +805bd0d28e53f8af03d7b4e5906cc299 \ No newline at end of file diff --git a/inherit_graph_125.svg b/inherit_graph_125.svg index 04218ba70..7f7ca2da6 100644 --- a/inherit_graph_125.svg +++ b/inherit_graph_125.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -unordered_set< K > + + +uint256_t diff --git a/inherit_graph_126.map b/inherit_graph_126.map index 249bdf5b5..10b9ad051 100644 --- a/inherit_graph_126.map +++ b/inherit_graph_126.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_126.md5 b/inherit_graph_126.md5 index 30062d7f6..54fdc777a 100644 --- a/inherit_graph_126.md5 +++ b/inherit_graph_126.md5 @@ -1 +1 @@ -bc85700fd7a036122fb3c15121d43845 \ No newline at end of file +5fe4884033b64eb41fe44c44e59aee59 \ No newline at end of file diff --git a/inherit_graph_126.svg b/inherit_graph_126.svg index 178e1347b..04218ba70 100644 --- a/inherit_graph_126.svg +++ b/inherit_graph_126.svg @@ -4,17 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -unordered_set< K > -::const_iterator + + +unordered_set< K > diff --git a/inherit_graph_127.map b/inherit_graph_127.map index 180153bbc..249bdf5b5 100644 --- a/inherit_graph_127.map +++ b/inherit_graph_127.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_127.md5 b/inherit_graph_127.md5 index 3d40106eb..30062d7f6 100644 --- a/inherit_graph_127.md5 +++ b/inherit_graph_127.md5 @@ -1 +1 @@ -fcf28c9d89cca0709eac3878d94430f4 \ No newline at end of file +bc85700fd7a036122fb3c15121d43845 \ No newline at end of file diff --git a/inherit_graph_127.svg b/inherit_graph_127.svg index 9bdfe1d47..178e1347b 100644 --- a/inherit_graph_127.svg +++ b/inherit_graph_127.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - + + unordered_set< K > -::const_reverse_iterator +::const_iterator diff --git a/inherit_graph_128.map b/inherit_graph_128.map index 40f71bbf4..180153bbc 100644 --- a/inherit_graph_128.map +++ b/inherit_graph_128.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_128.md5 b/inherit_graph_128.md5 index 7176e9459..3d40106eb 100644 --- a/inherit_graph_128.md5 +++ b/inherit_graph_128.md5 @@ -1 +1 @@ -d726de060ffc7b8e70f3bd633c5e676f \ No newline at end of file +fcf28c9d89cca0709eac3878d94430f4 \ No newline at end of file diff --git a/inherit_graph_128.svg b/inherit_graph_128.svg index 96b935bba..9bdfe1d47 100644 --- a/inherit_graph_128.svg +++ b/inherit_graph_128.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - + + unordered_set< K > -::iterator +::const_reverse_iterator diff --git a/inherit_graph_129.map b/inherit_graph_129.map index 8a46a1ac5..40f71bbf4 100644 --- a/inherit_graph_129.map +++ b/inherit_graph_129.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_129.md5 b/inherit_graph_129.md5 index e7c7fb621..7176e9459 100644 --- a/inherit_graph_129.md5 +++ b/inherit_graph_129.md5 @@ -1 +1 @@ -29bd013de83f56ba5a403fae138c97e7 \ No newline at end of file +d726de060ffc7b8e70f3bd633c5e676f \ No newline at end of file diff --git a/inherit_graph_129.svg b/inherit_graph_129.svg index ce21d750e..96b935bba 100644 --- a/inherit_graph_129.svg +++ b/inherit_graph_129.svg @@ -11,10 +11,10 @@ Node0 - + unordered_set< K > -::reverse_iterator +::iterator diff --git a/inherit_graph_130.map b/inherit_graph_130.map index 55e14b180..8a46a1ac5 100644 --- a/inherit_graph_130.map +++ b/inherit_graph_130.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_130.md5 b/inherit_graph_130.md5 index e39a10289..e7c7fb621 100644 --- a/inherit_graph_130.md5 +++ b/inherit_graph_130.md5 @@ -1 +1 @@ -9ea647f257244648e1a88e8a1e6b5d1a \ No newline at end of file +29bd013de83f56ba5a403fae138c97e7 \ No newline at end of file diff --git a/inherit_graph_130.svg b/inherit_graph_130.svg index 319640302..ce21d750e 100644 --- a/inherit_graph_130.svg +++ b/inherit_graph_130.svg @@ -4,16 +4,17 @@ - - + + Graphical Class Hierarchy Node0 - - -vector< T > + + +unordered_set< K > +::reverse_iterator diff --git a/inherit_graph_131.map b/inherit_graph_131.map index 2ee84d09b..55e14b180 100644 --- a/inherit_graph_131.map +++ b/inherit_graph_131.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_131.md5 b/inherit_graph_131.md5 index f4691547e..e39a10289 100644 --- a/inherit_graph_131.md5 +++ b/inherit_graph_131.md5 @@ -1 +1 @@ -37245481f3061bb863879ae1b2d666fd \ No newline at end of file +9ea647f257244648e1a88e8a1e6b5d1a \ No newline at end of file diff --git a/inherit_graph_131.svg b/inherit_graph_131.svg index 7e0621c24..319640302 100644 --- a/inherit_graph_131.svg +++ b/inherit_graph_131.svg @@ -4,17 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -vector< T >::const -_iterator + + +vector< T > diff --git a/inherit_graph_132.map b/inherit_graph_132.map index 034484c0e..2ee84d09b 100644 --- a/inherit_graph_132.map +++ b/inherit_graph_132.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_132.md5 b/inherit_graph_132.md5 index ab64738e8..f4691547e 100644 --- a/inherit_graph_132.md5 +++ b/inherit_graph_132.md5 @@ -1 +1 @@ -0b5d4fb4ca57707b9dc4b19d184f069a \ No newline at end of file +37245481f3061bb863879ae1b2d666fd \ No newline at end of file diff --git a/inherit_graph_132.svg b/inherit_graph_132.svg index 920ebabf0..7e0621c24 100644 --- a/inherit_graph_132.svg +++ b/inherit_graph_132.svg @@ -11,10 +11,10 @@ Node0 - + vector< T >::const -_reverse_iterator +_iterator diff --git a/inherit_graph_133.map b/inherit_graph_133.map index 42b167a8c..034484c0e 100644 --- a/inherit_graph_133.map +++ b/inherit_graph_133.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_133.md5 b/inherit_graph_133.md5 index 17e5199f4..ab64738e8 100644 --- a/inherit_graph_133.md5 +++ b/inherit_graph_133.md5 @@ -1 +1 @@ -daf29995081b133c5824f0e49272ff99 \ No newline at end of file +0b5d4fb4ca57707b9dc4b19d184f069a \ No newline at end of file diff --git a/inherit_graph_133.svg b/inherit_graph_133.svg index d8fc93bf6..920ebabf0 100644 --- a/inherit_graph_133.svg +++ b/inherit_graph_133.svg @@ -4,16 +4,17 @@ - - + + Graphical Class Hierarchy Node0 - - -vector< T >::iterator + + +vector< T >::const +_reverse_iterator diff --git a/inherit_graph_134.map b/inherit_graph_134.map index 09cd2ecd8..42b167a8c 100644 --- a/inherit_graph_134.map +++ b/inherit_graph_134.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_134.md5 b/inherit_graph_134.md5 index 19af07e0c..17e5199f4 100644 --- a/inherit_graph_134.md5 +++ b/inherit_graph_134.md5 @@ -1 +1 @@ -327ae94d174893e7ba33fccc595787c2 \ No newline at end of file +daf29995081b133c5824f0e49272ff99 \ No newline at end of file diff --git a/inherit_graph_134.svg b/inherit_graph_134.svg index 79e0bacf2..d8fc93bf6 100644 --- a/inherit_graph_134.svg +++ b/inherit_graph_134.svg @@ -4,17 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -vector< T >::reverse -_iterator + + +vector< T >::iterator diff --git a/inherit_graph_135.map b/inherit_graph_135.map new file mode 100644 index 000000000..09cd2ecd8 --- /dev/null +++ b/inherit_graph_135.map @@ -0,0 +1,3 @@ + + + diff --git a/inherit_graph_135.md5 b/inherit_graph_135.md5 new file mode 100644 index 000000000..19af07e0c --- /dev/null +++ b/inherit_graph_135.md5 @@ -0,0 +1 @@ +327ae94d174893e7ba33fccc595787c2 \ No newline at end of file diff --git a/inherit_graph_135.svg b/inherit_graph_135.svg new file mode 100644 index 000000000..79e0bacf2 --- /dev/null +++ b/inherit_graph_135.svg @@ -0,0 +1,22 @@ + + + + + + +Graphical Class Hierarchy + + +Node0 + + +vector< T >::reverse +_iterator + + + + + diff --git a/inherit_graph_71.map b/inherit_graph_71.map index 58b4d39c7..ef9238ea9 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 489e9bbb3..1bff629f8 100644 --- a/inherit_graph_71.md5 +++ b/inherit_graph_71.md5 @@ -1 +1 @@ -e46778d68f07b3d0f85c1a830a98dc2f \ No newline at end of file +a6390f5e24f00aeba08fd9568ed9da58 \ No newline at end of file diff --git a/inherit_graph_71.svg b/inherit_graph_71.svg index b71b8c599..33bcb265e 100644 --- a/inherit_graph_71.svg +++ b/inherit_graph_71.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -MinHeap + + +MemorisedFactorial diff --git a/inherit_graph_72.map b/inherit_graph_72.map index 24148518d..58b4d39c7 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 01a90fbec..489e9bbb3 100644 --- a/inherit_graph_72.md5 +++ b/inherit_graph_72.md5 @@ -1 +1 @@ -cf8942ba7ef89dd77e0e92d576486218 \ No newline at end of file +e46778d68f07b3d0f85c1a830a98dc2f \ No newline at end of file diff --git a/inherit_graph_72.svg b/inherit_graph_72.svg index 5ab3585a5..b71b8c599 100644 --- a/inherit_graph_72.svg +++ b/inherit_graph_72.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -MinHeapNode + + +MinHeap diff --git a/inherit_graph_73.map b/inherit_graph_73.map index 4e113b2f6..24148518d 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 febc905f0..01a90fbec 100644 --- a/inherit_graph_73.md5 +++ b/inherit_graph_73.md5 @@ -1 +1 @@ -af810061f564e6fde90b0872fbea4b5a \ No newline at end of file +cf8942ba7ef89dd77e0e92d576486218 \ No newline at end of file diff --git a/inherit_graph_73.svg b/inherit_graph_73.svg index ff05209c0..5ab3585a5 100644 --- a/inherit_graph_73.svg +++ b/inherit_graph_73.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -mst + + +MinHeapNode diff --git a/inherit_graph_74.map b/inherit_graph_74.map index f59793f8d..4e113b2f6 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 440617f0a..febc905f0 100644 --- a/inherit_graph_74.md5 +++ b/inherit_graph_74.md5 @@ -1 +1 @@ -0f4a65424288e970abb85f1f24c4b68d \ No newline at end of file +af810061f564e6fde90b0872fbea4b5a \ No newline at end of file diff --git a/inherit_graph_74.svg b/inherit_graph_74.svg index f6be94b20..ff05209c0 100644 --- a/inherit_graph_74.svg +++ b/inherit_graph_74.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -node + + +mst diff --git a/inherit_graph_75.map b/inherit_graph_75.map index 48ed6242d..f59793f8d 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 c1ac1eff6..440617f0a 100644 --- a/inherit_graph_75.md5 +++ b/inherit_graph_75.md5 @@ -1 +1 @@ -b2fca7f12e3a51e27d18b20b6219a04b \ No newline at end of file +0f4a65424288e970abb85f1f24c4b68d \ No newline at end of file diff --git a/inherit_graph_75.svg b/inherit_graph_75.svg index 1e9de176c..f6be94b20 100644 --- a/inherit_graph_75.svg +++ b/inherit_graph_75.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -Node< ValueType > + + +node diff --git a/inherit_graph_76.map b/inherit_graph_76.map index 79dd2ded3..48ed6242d 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 748751e2b..c1ac1eff6 100644 --- a/inherit_graph_76.md5 +++ b/inherit_graph_76.md5 @@ -1 +1 @@ -519b1f1f6d9604681fda7db93369d107 \ No newline at end of file +b2fca7f12e3a51e27d18b20b6219a04b \ No newline at end of file diff --git a/inherit_graph_76.svg b/inherit_graph_76.svg index d0b8971ed..1e9de176c 100644 --- a/inherit_graph_76.svg +++ b/inherit_graph_76.svg @@ -4,18 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -operations_on_datastructures -::circular_linked_list::Circular -LinkedList + + +Node< ValueType > diff --git a/inherit_graph_77.map b/inherit_graph_77.map index d72b9b3a4..79dd2ded3 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 e84ffc32c..748751e2b 100644 --- a/inherit_graph_77.md5 +++ b/inherit_graph_77.md5 @@ -1 +1 @@ -89867a2820e6afc3445e0931972f19f8 \ No newline at end of file +519b1f1f6d9604681fda7db93369d107 \ No newline at end of file diff --git a/inherit_graph_77.svg b/inherit_graph_77.svg index 6dcb5ecc3..d0b8971ed 100644 --- a/inherit_graph_77.svg +++ b/inherit_graph_77.svg @@ -4,17 +4,18 @@ - - + + Graphical Class Hierarchy Node0 - - -operations_on_datastructures -::circular_linked_list::Node + + +operations_on_datastructures +::circular_linked_list::Circular +LinkedList diff --git a/inherit_graph_78.map b/inherit_graph_78.map index ae139ffff..d72b9b3a4 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 e5ef142d1..e84ffc32c 100644 --- a/inherit_graph_78.md5 +++ b/inherit_graph_78.md5 @@ -1 +1 @@ -de5e2e2f4dd5ebd06ad08fa01be3112a \ No newline at end of file +89867a2820e6afc3445e0931972f19f8 \ No newline at end of file diff --git a/inherit_graph_78.svg b/inherit_graph_78.svg index 425ccf07e..6dcb5ecc3 100644 --- a/inherit_graph_78.svg +++ b/inherit_graph_78.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - + + operations_on_datastructures -::inorder_traversal_of_bst::Node +::circular_linked_list::Node diff --git a/inherit_graph_79.map b/inherit_graph_79.map index 5e7a97b7b..ae139ffff 100644 --- a/inherit_graph_79.map +++ b/inherit_graph_79.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_79.md5 b/inherit_graph_79.md5 index 924907713..e5ef142d1 100644 --- a/inherit_graph_79.md5 +++ b/inherit_graph_79.md5 @@ -1 +1 @@ -711a97321669830ce7337fbf526fa364 \ No newline at end of file +de5e2e2f4dd5ebd06ad08fa01be3112a \ No newline at end of file diff --git a/inherit_graph_79.svg b/inherit_graph_79.svg index 73d145db8..425ccf07e 100644 --- a/inherit_graph_79.svg +++ b/inherit_graph_79.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - + + operations_on_datastructures -::reverse_binary_tree::BinaryTree +::inorder_traversal_of_bst::Node diff --git a/inherit_graph_80.map b/inherit_graph_80.map index 64da79504..5e7a97b7b 100644 --- a/inherit_graph_80.map +++ b/inherit_graph_80.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_80.md5 b/inherit_graph_80.md5 index 4c8159bc4..924907713 100644 --- a/inherit_graph_80.md5 +++ b/inherit_graph_80.md5 @@ -1 +1 @@ -7ee46acf738ef592e7c5872c51a2b412 \ No newline at end of file +711a97321669830ce7337fbf526fa364 \ No newline at end of file diff --git a/inherit_graph_80.svg b/inherit_graph_80.svg index 88aed5b55..73d145db8 100644 --- a/inherit_graph_80.svg +++ b/inherit_graph_80.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - + + operations_on_datastructures -::reverse_binary_tree::Node +::reverse_binary_tree::BinaryTree diff --git a/inherit_graph_81.map b/inherit_graph_81.map index 085c6c30a..64da79504 100644 --- a/inherit_graph_81.map +++ b/inherit_graph_81.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_81.md5 b/inherit_graph_81.md5 index cdaa3c84f..4c8159bc4 100644 --- a/inherit_graph_81.md5 +++ b/inherit_graph_81.md5 @@ -1 +1 @@ -95f13092f90a17991418f843e09549cc \ No newline at end of file +7ee46acf738ef592e7c5872c51a2b412 \ No newline at end of file diff --git a/inherit_graph_81.svg b/inherit_graph_81.svg index 87cddc065..88aed5b55 100644 --- a/inherit_graph_81.svg +++ b/inherit_graph_81.svg @@ -11,10 +11,10 @@ Node0 - + operations_on_datastructures -::trie_operations::Tnode +::reverse_binary_tree::Node diff --git a/inherit_graph_82.map b/inherit_graph_82.map index b53eb9527..085c6c30a 100644 --- a/inherit_graph_82.map +++ b/inherit_graph_82.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_82.md5 b/inherit_graph_82.md5 index 68a782f80..cdaa3c84f 100644 --- a/inherit_graph_82.md5 +++ b/inherit_graph_82.md5 @@ -1 +1 @@ -eb6f17d4ef034f6bf576f9f000786c26 \ No newline at end of file +95f13092f90a17991418f843e09549cc \ No newline at end of file diff --git a/inherit_graph_82.svg b/inherit_graph_82.svg index 84d3adf85..87cddc065 100644 --- a/inherit_graph_82.svg +++ b/inherit_graph_82.svg @@ -4,16 +4,17 @@ - - + + Graphical Class Hierarchy Node0 - - -others::Cache::D_Node< T > + + +operations_on_datastructures +::trie_operations::Tnode diff --git a/inherit_graph_83.map b/inherit_graph_83.map index dd5c61748..b53eb9527 100644 --- a/inherit_graph_83.map +++ b/inherit_graph_83.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_83.md5 b/inherit_graph_83.md5 index 0bbe1a9f0..68a782f80 100644 --- a/inherit_graph_83.md5 +++ b/inherit_graph_83.md5 @@ -1 +1 @@ -02033460485a6b9d233fc95c003d9067 \ No newline at end of file +eb6f17d4ef034f6bf576f9f000786c26 \ No newline at end of file diff --git a/inherit_graph_83.svg b/inherit_graph_83.svg index f437735e0..84d3adf85 100644 --- a/inherit_graph_83.svg +++ b/inherit_graph_83.svg @@ -4,17 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -others::Cache::LFUCache -< K, V > + + +others::Cache::D_Node< T > diff --git a/inherit_graph_84.map b/inherit_graph_84.map index 80775260b..dd5c61748 100644 --- a/inherit_graph_84.map +++ b/inherit_graph_84.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_84.md5 b/inherit_graph_84.md5 index 350549659..0bbe1a9f0 100644 --- a/inherit_graph_84.md5 +++ b/inherit_graph_84.md5 @@ -1 +1 @@ -d7d5d44ee0e0c927d8fd870dfd9751d1 \ No newline at end of file +02033460485a6b9d233fc95c003d9067 \ No newline at end of file diff --git a/inherit_graph_84.svg b/inherit_graph_84.svg index 164c407bf..f437735e0 100644 --- a/inherit_graph_84.svg +++ b/inherit_graph_84.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - -others::Cache::LRUCache -< K, V > + + +others::Cache::LFUCache +< K, V > diff --git a/inherit_graph_85.map b/inherit_graph_85.map index 6903d4904..80775260b 100644 --- a/inherit_graph_85.map +++ b/inherit_graph_85.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_85.md5 b/inherit_graph_85.md5 index e4d240c66..350549659 100644 --- a/inherit_graph_85.md5 +++ b/inherit_graph_85.md5 @@ -1 +1 @@ -86a9f12a6fa0147840e866fbeb575055 \ No newline at end of file +d7d5d44ee0e0c927d8fd870dfd9751d1 \ No newline at end of file diff --git a/inherit_graph_85.svg b/inherit_graph_85.svg index 35fdc500b..164c407bf 100644 --- a/inherit_graph_85.svg +++ b/inherit_graph_85.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - -others::iterative_tree -_traversals::BinaryTree + + +others::Cache::LRUCache +< K, V > diff --git a/inherit_graph_86.map b/inherit_graph_86.map index abe656b9e..6903d4904 100644 --- a/inherit_graph_86.map +++ b/inherit_graph_86.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_86.md5 b/inherit_graph_86.md5 index 034ef82f1..e4d240c66 100644 --- a/inherit_graph_86.md5 +++ b/inherit_graph_86.md5 @@ -1 +1 @@ -c4e403fe3e48d0c7ab58a940c6c5c0b2 \ No newline at end of file +86a9f12a6fa0147840e866fbeb575055 \ No newline at end of file diff --git a/inherit_graph_86.svg b/inherit_graph_86.svg index f6a4fb398..35fdc500b 100644 --- a/inherit_graph_86.svg +++ b/inherit_graph_86.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - + + others::iterative_tree -_traversals::Node +_traversals::BinaryTree diff --git a/inherit_graph_87.map b/inherit_graph_87.map index 770b976ba..abe656b9e 100644 --- a/inherit_graph_87.map +++ b/inherit_graph_87.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_87.md5 b/inherit_graph_87.md5 index 8ea66fcc3..034ef82f1 100644 --- a/inherit_graph_87.md5 +++ b/inherit_graph_87.md5 @@ -1 +1 @@ -c57f59e02cf53191d7fc08844b9be12f \ No newline at end of file +c4e403fe3e48d0c7ab58a940c6c5c0b2 \ No newline at end of file diff --git a/inherit_graph_87.svg b/inherit_graph_87.svg index 19bf75d66..f6a4fb398 100644 --- a/inherit_graph_87.svg +++ b/inherit_graph_87.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - -others::lru_cache:: -LRUCache + + +others::iterative_tree +_traversals::Node diff --git a/inherit_graph_88.map b/inherit_graph_88.map index e12f5d9a1..770b976ba 100644 --- a/inherit_graph_88.map +++ b/inherit_graph_88.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_88.md5 b/inherit_graph_88.md5 index b16955cf8..8ea66fcc3 100644 --- a/inherit_graph_88.md5 +++ b/inherit_graph_88.md5 @@ -1 +1 @@ -3cf038b6307ab2b4487f41674605276b \ No newline at end of file +c57f59e02cf53191d7fc08844b9be12f \ No newline at end of file diff --git a/inherit_graph_88.svg b/inherit_graph_88.svg index eef2d9e57..19bf75d66 100644 --- a/inherit_graph_88.svg +++ b/inherit_graph_88.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - -others::postfix_expression -::Stack + + +others::lru_cache:: +LRUCache diff --git a/inherit_graph_89.map b/inherit_graph_89.map index 601422558..e12f5d9a1 100644 --- a/inherit_graph_89.map +++ b/inherit_graph_89.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_89.md5 b/inherit_graph_89.md5 index b8ccc104a..b16955cf8 100644 --- a/inherit_graph_89.md5 +++ b/inherit_graph_89.md5 @@ -1 +1 @@ -dae232725c13eb6a5d6f730fcdb228d8 \ No newline at end of file +3cf038b6307ab2b4487f41674605276b \ No newline at end of file diff --git a/inherit_graph_89.svg b/inherit_graph_89.svg index 095199d83..eef2d9e57 100644 --- a/inherit_graph_89.svg +++ b/inherit_graph_89.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - -others::recursive_tree -_traversals::BT + + +others::postfix_expression +::Stack diff --git a/inherit_graph_90.map b/inherit_graph_90.map index a36aa2faf..601422558 100644 --- a/inherit_graph_90.map +++ b/inherit_graph_90.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_90.md5 b/inherit_graph_90.md5 index f3256979f..b8ccc104a 100644 --- a/inherit_graph_90.md5 +++ b/inherit_graph_90.md5 @@ -1 +1 @@ -f6de32f06c598964a8bab66bcc4b62a8 \ No newline at end of file +dae232725c13eb6a5d6f730fcdb228d8 \ No newline at end of file diff --git a/inherit_graph_90.svg b/inherit_graph_90.svg index f543605e1..095199d83 100644 --- a/inherit_graph_90.svg +++ b/inherit_graph_90.svg @@ -11,10 +11,10 @@ Node0 - + others::recursive_tree -_traversals::Node +_traversals::BT diff --git a/inherit_graph_91.map b/inherit_graph_91.map index 90fed857f..a36aa2faf 100644 --- a/inherit_graph_91.map +++ b/inherit_graph_91.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_91.md5 b/inherit_graph_91.md5 index 82f9f0c95..f3256979f 100644 --- a/inherit_graph_91.md5 +++ b/inherit_graph_91.md5 @@ -1 +1 @@ -820705e674915c505f0cb90620ddf48e \ No newline at end of file +f6de32f06c598964a8bab66bcc4b62a8 \ No newline at end of file diff --git a/inherit_graph_91.svg b/inherit_graph_91.svg index 9321148e8..f543605e1 100644 --- a/inherit_graph_91.svg +++ b/inherit_graph_91.svg @@ -4,16 +4,17 @@ - - + + Graphical Class Hierarchy Node0 - - -Point + + +others::recursive_tree +_traversals::Node diff --git a/inherit_graph_92.map b/inherit_graph_92.map index 52813d9c0..90fed857f 100644 --- a/inherit_graph_92.map +++ b/inherit_graph_92.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_92.md5 b/inherit_graph_92.md5 index 501ed5e08..82f9f0c95 100644 --- a/inherit_graph_92.md5 +++ b/inherit_graph_92.md5 @@ -1 +1 @@ -9a6ef12d4577791fafbd05269e3732b9 \ No newline at end of file +820705e674915c505f0cb90620ddf48e \ No newline at end of file diff --git a/inherit_graph_92.svg b/inherit_graph_92.svg index bc8b3d0a7..9321148e8 100644 --- a/inherit_graph_92.svg +++ b/inherit_graph_92.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -priority_queue< T > + + +Point diff --git a/inherit_graph_93.map b/inherit_graph_93.map index a02859709..52813d9c0 100644 --- a/inherit_graph_93.map +++ b/inherit_graph_93.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_93.md5 b/inherit_graph_93.md5 index 11a68b827..501ed5e08 100644 --- a/inherit_graph_93.md5 +++ b/inherit_graph_93.md5 @@ -1 +1 @@ -5b7ba5d5b7d5d9feaed21d586b738263 \ No newline at end of file +9a6ef12d4577791fafbd05269e3732b9 \ No newline at end of file diff --git a/inherit_graph_93.svg b/inherit_graph_93.svg index cbd879d8c..bc8b3d0a7 100644 --- a/inherit_graph_93.svg +++ b/inherit_graph_93.svg @@ -4,17 +4,16 @@ - - + + Graphical Class Hierarchy Node0 - - -probability::geometric -_dist::geometric_distribution + + +priority_queue< T > diff --git a/inherit_graph_94.map b/inherit_graph_94.map index 1416d6fd2..a02859709 100644 --- a/inherit_graph_94.map +++ b/inherit_graph_94.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_94.md5 b/inherit_graph_94.md5 index 31bf89136..11a68b827 100644 --- a/inherit_graph_94.md5 +++ b/inherit_graph_94.md5 @@ -1 +1 @@ -0f9b5f8b412026fbb732ea3c163679e3 \ No newline at end of file +5b7ba5d5b7d5d9feaed21d586b738263 \ No newline at end of file diff --git a/inherit_graph_94.svg b/inherit_graph_94.svg index eb0834c32..cbd879d8c 100644 --- a/inherit_graph_94.svg +++ b/inherit_graph_94.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - -probability::windowed -_median::WindowedMedian + + +probability::geometric +_dist::geometric_distribution diff --git a/inherit_graph_95.map b/inherit_graph_95.map index e1a84fcc6..1416d6fd2 100644 --- a/inherit_graph_95.map +++ b/inherit_graph_95.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_95.md5 b/inherit_graph_95.md5 index 0976e6802..31bf89136 100644 --- a/inherit_graph_95.md5 +++ b/inherit_graph_95.md5 @@ -1 +1 @@ -878fe0c22ffb95857248a61b2e026f2e \ No newline at end of file +0f9b5f8b412026fbb732ea3c163679e3 \ No newline at end of file diff --git a/inherit_graph_95.svg b/inherit_graph_95.svg index 31f7433e2..eb0834c32 100644 --- a/inherit_graph_95.svg +++ b/inherit_graph_95.svg @@ -4,17 +4,17 @@ - + Graphical Class Hierarchy Node0 - - -quadratic_probing:: -Entry + + +probability::windowed +_median::WindowedMedian diff --git a/inherit_graph_96.map b/inherit_graph_96.map index 9d02b2d13..e1a84fcc6 100644 --- a/inherit_graph_96.map +++ b/inherit_graph_96.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_96.md5 b/inherit_graph_96.md5 index f89b9cfcb..0976e6802 100644 --- a/inherit_graph_96.md5 +++ b/inherit_graph_96.md5 @@ -1 +1 @@ -a775ba487438402fd82d2b8c70b24bda \ No newline at end of file +878fe0c22ffb95857248a61b2e026f2e \ No newline at end of file diff --git a/inherit_graph_96.svg b/inherit_graph_96.svg index ded7a1796..31f7433e2 100644 --- a/inherit_graph_96.svg +++ b/inherit_graph_96.svg @@ -4,16 +4,17 @@ - - + + Graphical Class Hierarchy Node0 - - -query + + +quadratic_probing:: +Entry diff --git a/inherit_graph_97.map b/inherit_graph_97.map index dbd845251..9d02b2d13 100644 --- a/inherit_graph_97.map +++ b/inherit_graph_97.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_97.md5 b/inherit_graph_97.md5 index bb4b76e34..f89b9cfcb 100644 --- a/inherit_graph_97.md5 +++ b/inherit_graph_97.md5 @@ -1 +1 @@ -85445e15a50611e408283d3d7819a158 \ No newline at end of file +a775ba487438402fd82d2b8c70b24bda \ No newline at end of file diff --git a/inherit_graph_97.svg b/inherit_graph_97.svg index 7feb4f081..ded7a1796 100644 --- a/inherit_graph_97.svg +++ b/inherit_graph_97.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -Queue + + +query diff --git a/inherit_graph_98.map b/inherit_graph_98.map index 4eca45747..dbd845251 100644 --- a/inherit_graph_98.map +++ b/inherit_graph_98.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_98.md5 b/inherit_graph_98.md5 index 51a0a6d3f..bb4b76e34 100644 --- a/inherit_graph_98.md5 +++ b/inherit_graph_98.md5 @@ -1 +1 @@ -165dbc62887581bc28e7ac384d7fce79 \ No newline at end of file +85445e15a50611e408283d3d7819a158 \ No newline at end of file diff --git a/inherit_graph_98.svg b/inherit_graph_98.svg index 077df79ea..7feb4f081 100644 --- a/inherit_graph_98.svg +++ b/inherit_graph_98.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -queue< ValueType > + + +Queue diff --git a/inherit_graph_99.map b/inherit_graph_99.map index 93e437855..4eca45747 100644 --- a/inherit_graph_99.map +++ b/inherit_graph_99.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_99.md5 b/inherit_graph_99.md5 index 58e6b0536..51a0a6d3f 100644 --- a/inherit_graph_99.md5 +++ b/inherit_graph_99.md5 @@ -1 +1 @@ -6b91f80b28512355cc99440d1f709211 \ No newline at end of file +165dbc62887581bc28e7ac384d7fce79 \ No newline at end of file diff --git a/inherit_graph_99.svg b/inherit_graph_99.svg index 911794d99..077df79ea 100644 --- a/inherit_graph_99.svg +++ b/inherit_graph_99.svg @@ -4,16 +4,16 @@ - + Graphical Class Hierarchy Node0 - - -range_queries::fenwick_tree + + +queue< ValueType > diff --git a/inherits.html b/inherits.html index a7745d597..3f1569e5f 100644 --- a/inherits.html +++ b/inherits.html @@ -190,70 +190,71 @@ $(function(){initNavTree('hierarchy.html','',''); });

    This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.

    - - - - - - - - - - + + + + + + + + + + - - - - - - - - + + + + + + + + - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + - + - - - - - - - - - - + + + + + + + + + + - - - - + + + + - - + + - - + + + diff --git a/namespacemembers_f.html b/namespacemembers_f.html index 7675e95af..a054e3d44 100644 --- a/namespacemembers_f.html +++ b/namespacemembers_f.html @@ -116,7 +116,6 @@ $(function(){initNavTree('namespacemembers_f.html','',''); });
    Here is a list of all documented namespace members with links to the namespaces they belong to:

    - f -