diff --git a/d0/d58/classgraph_1_1_rooted_tree.html b/d0/d58/classgraph_1_1_rooted_tree.html index 9961c9a67..38c2b47cc 100644 --- a/d0/d58/classgraph_1_1_rooted_tree.html +++ b/d0/d58/classgraph_1_1_rooted_tree.html @@ -206,7 +206,7 @@ Protected Member Functions
95 : Graph(undirected_edges.size() + 1, undirected_edges), root(root_) {
96 populate_parents();
97 }
-
Graph
Definition bellman_ford.cpp:13
+
Graph
Definition bellman_ford.cpp:14
graph::RootedTree::root
int root
Index of the root vertex.
Definition lowest_common_ancestor.cpp:108
graph::RootedTree::populate_parents
void populate_parents()
Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...
Definition lowest_common_ancestor.cpp:117
std::vector::size
T size(T... args)
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html index 163a70590..06c73c6dd 100644 --- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html +++ b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html @@ -208,11 +208,11 @@ static constexpr uint8_t E
-
47 {
-
48 english.resize(ENGLISH_ALPHABET_SIZE, nullptr);
-
49 endOfWord = false;
-
50 frequency = 0;
-
51 }
+
50 {
+
51 english.resize(ENGLISH_ALPHABET_SIZE, nullptr);
+
52 endOfWord = false;
+
53 frequency = 0;
+
54 }
@@ -238,11 +238,11 @@ static constexpr uint8_t E
-
53 {
-
54 english = node.english;
-
55 endOfWord = node.endOfWord;
-
56 frequency = node.frequency;
-
57 }
+
56 {
+
57 english = node.english;
+
58 endOfWord = node.endOfWord;
+
59 frequency = node.frequency;
+
60 }
node
Definition binary_search_tree.cpp:11
@@ -269,14 +269,14 @@ static constexpr uint8_t E
-
90 {
-
91 int i = 0;
-
92 for (i = 0; i < ENGLISH_ALPHABET_SIZE; i++) {
-
93 if (english[i]) {
-
94 delete english[i];
-
95 }
-
96 }
-
97 }
+
93 {
+
94 int i = 0;
+
95 for (i = 0; i < ENGLISH_ALPHABET_SIZE; i++) {
+
96 if (english[i]) {
+
97 delete english[i];
+
98 }
+
99 }
+
100 }
@@ -303,69 +303,69 @@ static constexpr uint8_t E -
150 {
-
151 Tnode *cur_pos = this,
-
152 *delete_from = this; // Current pointer pointing to root
-
153 int letter_index = 0, delete_from_index = 0, i = 0, n = entry.size();
-
154
-
155 for (i = 0; i < n; i++) {
-
156 // To ignore case
-
157 letter_index = tolower(entry[i]) - 97;
-
158
-
159 // Display error message when given entry is not present in the tree
-
160 if (cur_pos->english[letter_index] == nullptr) {
-
161 std::cout << "Entry not Found" << std::endl;
-
162 return;
-
163 }
-
164 // If the current node is end of word for the current prefix or if it
-
165 // has 2 or more branches It cannot be deleted while deleting the
-
166 // required entry.
-
167 if (numberOfChildren(cur_pos) > 1 || cur_pos->endOfWord) {
-
168 delete_from = cur_pos; // denotes the beginning of the shortest
-
169 // suffix that is allowed to be deleted
-
170 delete_from_index = i - 1; // Beginning index of the suffix
-
171 // corresponding to the 'entry'
-
172 }
-
173
-
174 // Traversing through the entry
-
175 cur_pos = cur_pos->english[letter_index];
-
176 }
-
177
-
178 // cur_pos now points to the last char of entry. Display message if that
-
179 // entry does not exist
-
180 if (!cur_pos->endOfWord) {
-
181 std::cout << "Entry not Found" << std::endl;
-
182 return;
-
183 }
-
184
-
185 // If cur_pos is not a leaf node, unmark end of word and assign 0 to it's
-
186 // frequency for deletion
-
187 if (numberOfChildren(cur_pos)) {
-
188 cur_pos->endOfWord = false;
-
189 cur_pos->frequency = 0;
-
190 return;
-
191 }
-
192
-
193 // The first character of the suffix to be deleted
-
194 letter_index = tolower(entry[delete_from_index + 1]) - 97;
-
195 // Point cur_pos to the next node
-
196 cur_pos = delete_from->english[letter_index];
-
197 // Sever the connection from the main trie
-
198 delete_from->english[letter_index] = nullptr;
-
199
-
200 // If number of characters in the suffix are more than 1, recursively delete
-
201 // each character starting from cur_pos using the helper function
-
202 if (n > delete_from_index + 2) {
-
203 DeleteFrom(cur_pos, entry, delete_from_index + 2);
-
204 }
-
205 // If the suffix is only 1 char in length
-
206 else {
-
207 delete cur_pos;
-
208 }
-
209}
+
153 {
+
154 Tnode *cur_pos = this,
+
155 *delete_from = this; // Current pointer pointing to root
+
156 int letter_index = 0, delete_from_index = 0, i = 0, n = entry.size();
+
157
+
158 for (i = 0; i < n; i++) {
+
159 // To ignore case
+
160 letter_index = tolower(entry[i]) - 97;
+
161
+
162 // Display error message when given entry is not present in the tree
+
163 if (cur_pos->english[letter_index] == nullptr) {
+
164 std::cout << "Entry not Found" << std::endl;
+
165 return;
+
166 }
+
167 // If the current node is end of word for the current prefix or if it
+
168 // has 2 or more branches It cannot be deleted while deleting the
+
169 // required entry.
+
170 if (numberOfChildren(cur_pos) > 1 || cur_pos->endOfWord) {
+
171 delete_from = cur_pos; // denotes the beginning of the shortest
+
172 // suffix that is allowed to be deleted
+
173 delete_from_index = i - 1; // Beginning index of the suffix
+
174 // corresponding to the 'entry'
+
175 }
+
176
+
177 // Traversing through the entry
+
178 cur_pos = cur_pos->english[letter_index];
+
179 }
+
180
+
181 // cur_pos now points to the last char of entry. Display message if that
+
182 // entry does not exist
+
183 if (!cur_pos->endOfWord) {
+
184 std::cout << "Entry not Found" << std::endl;
+
185 return;
+
186 }
+
187
+
188 // If cur_pos is not a leaf node, unmark end of word and assign 0 to it's
+
189 // frequency for deletion
+
190 if (numberOfChildren(cur_pos)) {
+
191 cur_pos->endOfWord = false;
+
192 cur_pos->frequency = 0;
+
193 return;
+
194 }
+
195
+
196 // The first character of the suffix to be deleted
+
197 letter_index = tolower(entry[delete_from_index + 1]) - 97;
+
198 // Point cur_pos to the next node
+
199 cur_pos = delete_from->english[letter_index];
+
200 // Sever the connection from the main trie
+
201 delete_from->english[letter_index] = nullptr;
+
202
+
203 // If number of characters in the suffix are more than 1, recursively delete
+
204 // each character starting from cur_pos using the helper function
+
205 if (n > delete_from_index + 2) {
+
206 DeleteFrom(cur_pos, entry, delete_from_index + 2);
+
207 }
+
208 // If the suffix is only 1 char in length
+
209 else {
+
210 delete cur_pos;
+
211 }
+
212}
-
operations_on_datastructures::trie_operations::Tnode::DeleteFrom
void DeleteFrom(Tnode *delete_from, std::string delete_string, int remove_index)
Function recursively deletes the substring character by character iterating through the string to be ...
Definition trie_multiple_search.cpp:134
-
operations_on_datastructures::trie_operations::Tnode::numberOfChildren
uint8_t numberOfChildren(Tnode *node)
Function to count the number of children a node in the trie has.
Definition trie_multiple_search.cpp:69
+
operations_on_datastructures::trie_operations::Tnode::DeleteFrom
void DeleteFrom(Tnode *delete_from, std::string delete_string, int remove_index)
Function recursively deletes the substring character by character iterating through the string to be ...
Definition trie_multiple_search.cpp:137
+
operations_on_datastructures::trie_operations::Tnode::numberOfChildren
uint8_t numberOfChildren(Tnode *node)
Function to count the number of children a node in the trie has.
Definition trie_multiple_search.cpp:72
std::endl
T endl(T... args)
std::string::size
T size(T... args)
std::tolower
T tolower(T... args)
@@ -410,16 +410,16 @@ Here is the call graph for this function:
-
135 {
-
136 if (delete_string.size() == remove_index) {
-
137 int letter_index = tolower(delete_string[remove_index]) - 97;
-
138
-
139 DeleteFrom(delete_from->english[letter_index], delete_string,
-
140 remove_index + 1);
+
138 {
+
139 if (delete_string.size() == remove_index) {
+
140 int letter_index = tolower(delete_string[remove_index]) - 97;
141
-
142 delete delete_from;
-
143 }
-
144}
+
142 DeleteFrom(delete_from->english[letter_index], delete_string,
+
143 remove_index + 1);
+
144
+
145 delete delete_from;
+
146 }
+
147}
Here is the call graph for this function:
@@ -450,25 +450,25 @@ Here is the call graph for this function:
-
104 {
-
105 Tnode *cur_pos = this;
-
106 int letter_index = 0;
-
107
-
108 for (auto &i : entry) {
-
109 // To ignore case
-
110 letter_index = tolower(i) - 97;
-
111
-
112 // Allocate a node for each character of entry if not present in the
-
113 // trie
-
114 if (cur_pos->english[letter_index] == nullptr) {
-
115 cur_pos->english[letter_index] = new Tnode();
-
116 }
-
117
-
118 cur_pos = cur_pos->english[letter_index];
-
119 }
-
120 // cur_pos points to the last char, mark it as end of word
-
121 cur_pos->endOfWord = true;
-
122}
+
107 {
+
108 Tnode *cur_pos = this;
+
109 int letter_index = 0;
+
110
+
111 for (auto &i : entry) {
+
112 // To ignore case
+
113 letter_index = tolower(i) - 97;
+
114
+
115 // Allocate a node for each character of entry if not present in the
+
116 // trie
+
117 if (cur_pos->english[letter_index] == nullptr) {
+
118 cur_pos->english[letter_index] = new Tnode();
+
119 }
+
120
+
121 cur_pos = cur_pos->english[letter_index];
+
122 }
+
123 // cur_pos points to the last char, mark it as end of word
+
124 cur_pos->endOfWord = true;
+
125}
@@ -503,10 +503,10 @@ Here is the call graph for this function:
Returns
count of the number of children of the given node (max 26)
-
69 {
-
70 return ENGLISH_ALPHABET_SIZE -
-
71 std::count(node->english.begin(), node->english.end(), nullptr);
-
72 }
+
72 {
+
73 return ENGLISH_ALPHABET_SIZE -
+
74 std::count(node->english.begin(), node->english.end(), nullptr);
+
75 }
std::count
T count(T... args)
Here is the call graph for this function:
@@ -538,59 +538,59 @@ Here is the call graph for this function:
-
365 {
-
366 Tnode *cur_pos = nullptr, *prev_pos = nullptr;
-
367 cur_pos = prev_pos = this; // maintaining 2 pointers, initialized to root
-
368 int letter_index = 0;
-
369 std::string prefix =
-
370 ""; // variable storing the updated value of longest common prefix
-
371 std::priority_queue<std::pair<int, std::string> >
-
372 suggestions; // max heap to store (frequency, word) in descending order
-
373 // of freq
-
374
-
375 std::priority_queue<std::pair<int, std::string> > *Suggestions =
-
376 &suggestions;
+
368 {
+
369 Tnode *cur_pos = nullptr, *prev_pos = nullptr;
+
370 cur_pos = prev_pos = this; // maintaining 2 pointers, initialized to root
+
371 int letter_index = 0;
+
372 std::string prefix =
+
373 ""; // variable storing the updated value of longest common prefix
+
374 std::priority_queue<std::pair<int, std::string> >
+
375 suggestions; // max heap to store (frequency, word) in descending order
+
376 // of freq
377
-
378 for (auto &i : key) {
-
379 letter_index = tolower(i) - 97;
-
380 prev_pos = cur_pos; // Previous pointer updated to point to the last
-
381 // char of the longest common prefix
-
382
-
383 // When the node for the character does not exist, longest prefix has
-
384 // been determined and SuggestFreqAutocomplete is called
-
385 if (cur_pos->english[letter_index] == nullptr) {
-
386 SuggestFreqAutocomplete(prev_pos, prefix, Suggestions);
-
387 // To display the top 3 results
-
388 SelectionTop_3(Suggestions);
-
389 std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - "
-
390 << std::endl;
-
391 return;
-
392 }
-
393 // Updating the longest common prefix
-
394 prefix += char(tolower(i));
-
395 cur_pos = cur_pos->english[letter_index];
-
396 }
-
397 // If the key is a valid entry of trie, display it @ top of the suggestions
-
398 if (cur_pos->endOfWord) {
-
399 (cur_pos->frequency)++;
-
400 std::cout << key << std::endl;
-
401 }
-
402
-
403 (void)prev_pos; // Idiom to ignore previous pointer
-
404
-
405 // Call for Suggestions when the search key is present as an entry/a prefix
-
406 // in the trie
-
407 SuggestFreqAutocomplete(cur_pos, prefix, Suggestions);
-
408 // Display the top 3 results
-
409 SelectionTop_3(Suggestions);
-
410
-
411 std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - "
-
412 << std::endl;
-
413 return;
-
414}
+
378 std::priority_queue<std::pair<int, std::string> > *Suggestions =
+
379 &suggestions;
+
380
+
381 for (auto &i : key) {
+
382 letter_index = tolower(i) - 97;
+
383 prev_pos = cur_pos; // Previous pointer updated to point to the last
+
384 // char of the longest common prefix
+
385
+
386 // When the node for the character does not exist, longest prefix has
+
387 // been determined and SuggestFreqAutocomplete is called
+
388 if (cur_pos->english[letter_index] == nullptr) {
+
389 SuggestFreqAutocomplete(prev_pos, prefix, Suggestions);
+
390 // To display the top 3 results
+
391 SelectionTop_3(Suggestions);
+
392 std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - "
+
393 << std::endl;
+
394 return;
+
395 }
+
396 // Updating the longest common prefix
+
397 prefix += char(tolower(i));
+
398 cur_pos = cur_pos->english[letter_index];
+
399 }
+
400 // If the key is a valid entry of trie, display it @ top of the suggestions
+
401 if (cur_pos->endOfWord) {
+
402 (cur_pos->frequency)++;
+
403 std::cout << key << std::endl;
+
404 }
+
405
+
406 (void)prev_pos; // Idiom to ignore previous pointer
+
407
+
408 // Call for Suggestions when the search key is present as an entry/a prefix
+
409 // in the trie
+
410 SuggestFreqAutocomplete(cur_pos, prefix, Suggestions);
+
411 // Display the top 3 results
+
412 SelectionTop_3(Suggestions);
+
413
+
414 std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - "
+
415 << std::endl;
+
416 return;
+
417}
-
operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete
void SuggestFreqAutocomplete(Tnode *new_root, const std::string &prefix, std::priority_queue< std::pair< int, std::string > > *suggestions)
Recursive function to suggest most frequently searched entries of trie which have a given common pref...
Definition trie_multiple_search.cpp:337
-
operations_on_datastructures::trie_operations::Tnode::SelectionTop_3
void SelectionTop_3(std::priority_queue< std::pair< int, std::string > > *suggestions)
Function to display the 3 suggestions with highest frequency of search hits.
Definition trie_multiple_search.cpp:317
+
operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete
void SuggestFreqAutocomplete(Tnode *new_root, const std::string &prefix, std::priority_queue< std::pair< int, std::string > > *suggestions)
Recursive function to suggest most frequently searched entries of trie which have a given common pref...
Definition trie_multiple_search.cpp:340
+
operations_on_datastructures::trie_operations::Tnode::SelectionTop_3
void SelectionTop_3(std::priority_queue< std::pair< int, std::string > > *suggestions)
Function to display the 3 suggestions with highest frequency of search hits.
Definition trie_multiple_search.cpp:320
Here is the call graph for this function:
@@ -625,27 +625,27 @@ Here is the call graph for this function:
Returns
true if the key is found
false if the key is not found
-
217 {
-
218 Tnode *cur_pos = this;
-
219 int letter_index = 0;
-
220
-
221 for (auto &i : key) {
-
222 letter_index = tolower(i) - 97;
-
223 // If any character in the order of the key is absent, word not found!
-
224 if (cur_pos->english[letter_index] == nullptr) {
-
225 return false;
-
226 }
-
227 cur_pos = cur_pos->english[letter_index];
-
228 }
-
229 // Word is only present in the trie if the key is a valid complete entry and
-
230 // not just a prefix.
-
231 if (cur_pos->endOfWord) {
-
232 (cur_pos->frequency)++;
-
233 return true;
-
234 } else {
-
235 return false;
-
236 }
-
237}
+
220 {
+
221 Tnode *cur_pos = this;
+
222 int letter_index = 0;
+
223
+
224 for (auto &i : key) {
+
225 letter_index = tolower(i) - 97;
+
226 // If any character in the order of the key is absent, word not found!
+
227 if (cur_pos->english[letter_index] == nullptr) {
+
228 return false;
+
229 }
+
230 cur_pos = cur_pos->english[letter_index];
+
231 }
+
232 // Word is only present in the trie if the key is a valid complete entry and
+
233 // not just a prefix.
+
234 if (cur_pos->endOfWord) {
+
235 (cur_pos->frequency)++;
+
236 return true;
+
237 } else {
+
238 return false;
+
239 }
+
240}
@@ -671,46 +671,46 @@ false if the key is not found -
271 {
-
272 Tnode *cur_pos = nullptr, *prev_pos = nullptr;
-
273 cur_pos = prev_pos = this; // maintaining 2 pointers, initialized to root
-
274 int letter_index = 0;
-
275 std::string prefix =
-
276 ""; // variable storing the updated value of longest common prefix
-
277
-
278 for (auto &i : key) {
-
279 letter_index = tolower(i) - 97;
-
280 prev_pos = cur_pos; // Previous pointer updated to point to the last
-
281 // char of the longest common prefix
-
282
-
283 // When the node for the character does not exist, longest prefix has
-
284 // been determined and SuggestAutocomplete is called
-
285 if (cur_pos->english[letter_index] == nullptr) {
-
286 SuggestAutocomplete(prev_pos, prefix);
-
287 std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - "
-
288 << std::endl;
-
289 return;
-
290 }
-
291 // Updating the longest common prefix
-
292 prefix += char(tolower(i));
-
293 cur_pos = cur_pos->english[letter_index];
-
294 }
-
295 // If the key is a valid entry of trie, display it @ top of the suggestions
-
296 if (cur_pos->endOfWord) {
-
297 std::cout << key << std::endl;
-
298 (cur_pos->frequency)++;
-
299 }
-
300
-
301 (void)prev_pos; // Idiom to ignore previous pointer
-
302
-
303 // Call for suggestions when the search key is present as an entry/a prefix
-
304 // in the trie
-
305 SuggestAutocomplete(cur_pos, prefix);
-
306 std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - "
-
307 << std::endl;
-
308 return;
-
309}
-
operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete
void SuggestAutocomplete(Tnode *new_root, const std::string &prefix)
Recursive function to suggest all the entries of trie which have a given common prefix.
Definition trie_multiple_search.cpp:246
+
274 {
+
275 Tnode *cur_pos = nullptr, *prev_pos = nullptr;
+
276 cur_pos = prev_pos = this; // maintaining 2 pointers, initialized to root
+
277 int letter_index = 0;
+
278 std::string prefix =
+
279 ""; // variable storing the updated value of longest common prefix
+
280
+
281 for (auto &i : key) {
+
282 letter_index = tolower(i) - 97;
+
283 prev_pos = cur_pos; // Previous pointer updated to point to the last
+
284 // char of the longest common prefix
+
285
+
286 // When the node for the character does not exist, longest prefix has
+
287 // been determined and SuggestAutocomplete is called
+
288 if (cur_pos->english[letter_index] == nullptr) {
+
289 SuggestAutocomplete(prev_pos, prefix);
+
290 std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - "
+
291 << std::endl;
+
292 return;
+
293 }
+
294 // Updating the longest common prefix
+
295 prefix += char(tolower(i));
+
296 cur_pos = cur_pos->english[letter_index];
+
297 }
+
298 // If the key is a valid entry of trie, display it @ top of the suggestions
+
299 if (cur_pos->endOfWord) {
+
300 std::cout << key << std::endl;
+
301 (cur_pos->frequency)++;
+
302 }
+
303
+
304 (void)prev_pos; // Idiom to ignore previous pointer
+
305
+
306 // Call for suggestions when the search key is present as an entry/a prefix
+
307 // in the trie
+
308 SuggestAutocomplete(cur_pos, prefix);
+
309 std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - "
+
310 << std::endl;
+
311 return;
+
312}
+
operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete
void SuggestAutocomplete(Tnode *new_root, const std::string &prefix)
Recursive function to suggest all the entries of trie which have a given common prefix.
Definition trie_multiple_search.cpp:249
Here is the call graph for this function:
@@ -741,15 +741,15 @@ Here is the call graph for this function:
-
318 {
-
319 // Display Either top 3 or total number of suggestions, whichever is smaller
-
320 int n = suggestions->size(), Top = 0;
-
321 Top = n < 3 ? n : 3;
-
322 while (Top--) {
-
323 std::cout << suggestions->top().second << std::endl;
-
324 suggestions->pop();
-
325 }
-
326}
+
321 {
+
322 // Display Either top 3 or total number of suggestions, whichever is smaller
+
323 int n = suggestions->size(), Top = 0;
+
324 Top = n < 3 ? n : 3;
+
325 while (Top--) {
+
326 std::cout << suggestions->top().second << std::endl;
+
327 suggestions->pop();
+
328 }
+
329}
std::priority_queue::pop
T pop(T... args)
std::priority_queue::top
T top(T... args)
@@ -787,22 +787,22 @@ Here is the call graph for this function:
-
246 {
-
247 // Iterate through all 26 nodes as we have to print all strings with the
-
248 // given prefix
-
249 int i = 0;
-
250 for (i = 0; i < ENGLISH_ALPHABET_SIZE; i++) {
-
251 if (new_root->english[i] != nullptr) {
-
252 // Print the sugestion only if it's a valid complete entry and not
-
253 // just a prefix
-
254 if (new_root->english[i]->endOfWord) {
-
255 std::cout << prefix + char(i + 97) << std::endl;
-
256 }
-
257
-
258 SuggestAutocomplete(new_root->english[i], prefix + char(i + 97));
-
259 }
-
260 }
-
261}
+
249 {
+
250 // Iterate through all 26 nodes as we have to print all strings with the
+
251 // given prefix
+
252 int i = 0;
+
253 for (i = 0; i < ENGLISH_ALPHABET_SIZE; i++) {
+
254 if (new_root->english[i] != nullptr) {
+
255 // Print the sugestion only if it's a valid complete entry and not
+
256 // just a prefix
+
257 if (new_root->english[i]->endOfWord) {
+
258 std::cout << prefix + char(i + 97) << std::endl;
+
259 }
+
260
+
261 SuggestAutocomplete(new_root->english[i], prefix + char(i + 97));
+
262 }
+
263 }
+
264}
Here is the call graph for this function:
@@ -844,22 +844,22 @@ Here is the call graph for this function:
-
339 {
-
340 int i = 0;
-
341 for (i = 0; i < ENGLISH_ALPHABET_SIZE; i++) {
-
342 if (new_root->english[i] != nullptr) {
-
343 // Add to sugestions only if it's a valid complete entry and not
-
344 // just a prefix
-
345 if (new_root->english[i]->endOfWord) {
-
346 suggestions->push(std::make_pair(
-
347 new_root->english[i]->frequency, prefix + char(i + 97)));
-
348 }
-
349
-
350 SuggestFreqAutocomplete(new_root->english[i], prefix + char(i + 97),
-
351 suggestions);
-
352 }
-
353 }
-
354}
+
342 {
+
343 int i = 0;
+
344 for (i = 0; i < ENGLISH_ALPHABET_SIZE; i++) {
+
345 if (new_root->english[i] != nullptr) {
+
346 // Add to sugestions only if it's a valid complete entry and not
+
347 // just a prefix
+
348 if (new_root->english[i]->endOfWord) {
+
349 suggestions->push(std::make_pair(
+
350 new_root->english[i]->frequency, prefix + char(i + 97)));
+
351 }
+
352
+
353 SuggestFreqAutocomplete(new_root->english[i], prefix + char(i + 97),
+
354 suggestions);
+
355 }
+
356 }
+
357}
std::make_pair
T make_pair(T... args)
std::priority_queue::push
T push(T... args)
diff --git a/d0/dfe/backtracking_2subset__sum_8cpp.js b/d0/dfe/backtracking_2subset__sum_8cpp.js deleted file mode 100644 index 4a8fc4db5..000000000 --- a/d0/dfe/backtracking_2subset__sum_8cpp.js +++ /dev/null @@ -1,6 +0,0 @@ -var backtracking_2subset__sum_8cpp = -[ - [ "main", "d0/dfe/backtracking_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], - [ "number_of_subsets", "d0/dfe/backtracking_2subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99", null ], - [ "test", "d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] -]; \ No newline at end of file diff --git a/d0/dfe/backtracking_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/dfe/backtracking_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map deleted file mode 100644 index 9a4aeb914..000000000 --- a/d0/dfe/backtracking_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ /dev/null @@ -1,7 +0,0 @@ - - - - - - - diff --git a/d0/dfe/backtracking_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/dfe/backtracking_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 deleted file mode 100644 index 389f9907e..000000000 --- a/d0/dfe/backtracking_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -01c94973a9e67ee0738ed591bd43bb2e \ No newline at end of file diff --git a/d1/d40/longest__increasing__subsequence_8cpp__incl.map b/d1/d40/longest__increasing__subsequence_8cpp__incl.map index fb685c2c0..827608125 100644 --- a/d1/d40/longest__increasing__subsequence_8cpp__incl.map +++ b/d1/d40/longest__increasing__subsequence_8cpp__incl.map @@ -1,11 +1,13 @@ - + - + - - - - - + + + + + + + diff --git a/d1/d40/longest__increasing__subsequence_8cpp__incl.md5 b/d1/d40/longest__increasing__subsequence_8cpp__incl.md5 index 34d33ac54..1c87b0654 100644 --- a/d1/d40/longest__increasing__subsequence_8cpp__incl.md5 +++ b/d1/d40/longest__increasing__subsequence_8cpp__incl.md5 @@ -1 +1 @@ -22ce28b1900f34151ccc6b52483055e5 \ No newline at end of file +d830c34964806014bd0b0afdc32cf0d4 \ No newline at end of file diff --git a/d1/d40/longest__increasing__subsequence_8cpp__incl.svg b/d1/d40/longest__increasing__subsequence_8cpp__incl.svg index b755acdf3..2638e1da8 100644 --- a/d1/d40/longest__increasing__subsequence_8cpp__incl.svg +++ b/d1/d40/longest__increasing__subsequence_8cpp__incl.svg @@ -4,8 +4,8 @@ - + @@ -23,10 +23,10 @@ Node1 - -dynamic_programming -/longest_increasing -_subsequence.cpp + +dynamic_programming +/longest_increasing +_subsequence.cpp @@ -43,8 +43,8 @@ Node1->Node2 - - + + @@ -61,8 +61,8 @@ Node1->Node3 - - + + @@ -70,8 +70,8 @@ Node4 - -iostream + +cstdint @@ -79,8 +79,8 @@ Node1->Node4 - - + + @@ -88,8 +88,8 @@ Node5 - -vector + +iostream @@ -97,8 +97,26 @@ Node1->Node5 - - + + + + + + + +Node6 + + +vector + + + + + +Node1->Node6 + + + diff --git a/d1/d40/longest__increasing__subsequence_8cpp__incl_org.svg b/d1/d40/longest__increasing__subsequence_8cpp__incl_org.svg index 4acdc3596..5e513f2cd 100644 --- a/d1/d40/longest__increasing__subsequence_8cpp__incl_org.svg +++ b/d1/d40/longest__increasing__subsequence_8cpp__incl_org.svg @@ -4,18 +4,18 @@ - + dynamic_programming/longest_increasing_subsequence.cpp Node1 - -dynamic_programming -/longest_increasing -_subsequence.cpp + +dynamic_programming +/longest_increasing +_subsequence.cpp @@ -32,8 +32,8 @@ Node1->Node2 - - + + @@ -50,8 +50,8 @@ Node1->Node3 - - + + @@ -59,8 +59,8 @@ Node4 - -iostream + +cstdint @@ -68,8 +68,8 @@ Node1->Node4 - - + + @@ -77,8 +77,8 @@ Node5 - -vector + +iostream @@ -86,8 +86,26 @@ Node1->Node5 - - + + + + + + + +Node6 + + +vector + + + + + +Node1->Node6 + + + diff --git a/d1/d85/unbounded__0__1__knapsack_8cpp__incl.map b/d1/d85/unbounded__0__1__knapsack_8cpp__incl.map index 8359d5eb6..d61f2a226 100644 --- a/d1/d85/unbounded__0__1__knapsack_8cpp__incl.map +++ b/d1/d85/unbounded__0__1__knapsack_8cpp__incl.map @@ -1,11 +1,11 @@ - - - - - - - - - + + + + + + + + + diff --git a/d1/d85/unbounded__0__1__knapsack_8cpp__incl.md5 b/d1/d85/unbounded__0__1__knapsack_8cpp__incl.md5 index 4915d9881..150fc7bcb 100644 --- a/d1/d85/unbounded__0__1__knapsack_8cpp__incl.md5 +++ b/d1/d85/unbounded__0__1__knapsack_8cpp__incl.md5 @@ -1 +1 @@ -58458697f53a27e81fff0097907f30e3 \ No newline at end of file +4b0254f68e88baad8c3ce510d394b7d2 \ No newline at end of file diff --git a/d1/d85/unbounded__0__1__knapsack_8cpp__incl.svg b/d1/d85/unbounded__0__1__knapsack_8cpp__incl.svg index 7583cc733..c8f7afb07 100644 --- a/d1/d85/unbounded__0__1__knapsack_8cpp__incl.svg +++ b/d1/d85/unbounded__0__1__knapsack_8cpp__incl.svg @@ -5,7 +5,7 @@ --> + viewBox="0.00 0.00 251.62 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> @@ -23,9 +23,9 @@ Node1 - -dynamic_programming -/unbounded_0_1_knapsack.cpp + +dynamic_programming +/unbounded_0_1_knapsack.cpp @@ -33,8 +33,8 @@ Node2 - -iostream + +cassert @@ -42,8 +42,8 @@ Node1->Node2 - - + + @@ -51,8 +51,8 @@ Node3 - -vector + +cstdint @@ -60,8 +60,8 @@ Node1->Node3 - - + + @@ -69,8 +69,8 @@ Node4 - -cassert + +iostream @@ -78,8 +78,8 @@ Node1->Node4 - - + + @@ -87,8 +87,8 @@ Node5 - -cstdint + +vector @@ -96,8 +96,8 @@ Node1->Node5 - - + + diff --git a/d1/d85/unbounded__0__1__knapsack_8cpp__incl_org.svg b/d1/d85/unbounded__0__1__knapsack_8cpp__incl_org.svg index b75f86274..4fe868bf3 100644 --- a/d1/d85/unbounded__0__1__knapsack_8cpp__incl_org.svg +++ b/d1/d85/unbounded__0__1__knapsack_8cpp__incl_org.svg @@ -5,16 +5,16 @@ --> + viewBox="0.00 0.00 251.62 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> dynamic_programming/unbounded_0_1_knapsack.cpp Node1 - -dynamic_programming -/unbounded_0_1_knapsack.cpp + +dynamic_programming +/unbounded_0_1_knapsack.cpp @@ -22,8 +22,8 @@ Node2 - -iostream + +cassert @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -40,8 +40,8 @@ Node3 - -vector + +cstdint @@ -49,8 +49,8 @@ Node1->Node3 - - + + @@ -58,8 +58,8 @@ Node4 - -cassert + +iostream @@ -67,8 +67,8 @@ Node1->Node4 - - + + @@ -76,8 +76,8 @@ Node5 - -cstdint + +vector @@ -85,8 +85,8 @@ Node1->Node5 - - + + diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp.html b/d1/da7/armstrong__number__templated_8cpp.html similarity index 90% rename from d1/db7/dynamic__programming_2armstrong__number_8cpp.html rename to d1/da7/armstrong__number__templated_8cpp.html index 208913406..ba4e290d9 100644 --- a/d1/db7/dynamic__programming_2armstrong__number_8cpp.html +++ b/d1/da7/armstrong__number__templated_8cpp.html @@ -5,7 +5,7 @@ -Algorithms_in_C++: dynamic_programming/armstrong_number.cpp File Reference +Algorithms_in_C++: dynamic_programming/armstrong_number_templated.cpp File Reference @@ -78,7 +78,7 @@ $(function() {
@@ -107,7 +107,7 @@ $(function(){initNavTree('d1/db7/dynamic__programming_2armstrong__number_8cpp.ht
Namespaces | Functions
-
armstrong_number.cpp File Reference
+
armstrong_number_templated.cpp File Reference
@@ -117,9 +117,9 @@ $(function(){initNavTree('d1/db7/dynamic__programming_2armstrong__number_8cpp.ht #include <cmath>
#include <iostream>
-Include dependency graph for armstrong_number.cpp:
+Include dependency graph for armstrong_number_templated.cpp:
-
+
91 tests(); // run self-test implementations
92 return 0;
93}
-
tests
static void tests()
Self-test implementations.
Definition armstrong_number.cpp:71
+
tests
static void tests()
Self-test implementations.
Definition armstrong_number_templated.cpp:71
Here is the call graph for this function:
-
+
@@ -220,11 +220,11 @@ Here is the call graph for this function:
83 std::cout << "All tests have successfully passed!\n";
84}
-
dynamic_programming::is_armstrong
bool is_armstrong(const T &number)
Checks if the given number is armstrong or not.
Definition armstrong_number.cpp:39
+
dynamic_programming::is_armstrong
bool is_armstrong(const T &number)
Checks if the given number is armstrong or not.
Definition armstrong_number_templated.cpp:39
Here is the call graph for this function:
-
+
@@ -234,7 +234,7 @@ Here is the call graph for this function: diff --git a/d1/da7/armstrong__number__templated_8cpp.js b/d1/da7/armstrong__number__templated_8cpp.js new file mode 100644 index 000000000..04bd5415b --- /dev/null +++ b/d1/da7/armstrong__number__templated_8cpp.js @@ -0,0 +1,6 @@ +var armstrong__number__templated_8cpp = +[ + [ "is_armstrong", "d1/da7/armstrong__number__templated_8cpp.html#af046365a8d77a1267acc082f86135a26", null ], + [ "main", "d1/da7/armstrong__number__templated_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "tests", "d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ] +]; \ No newline at end of file diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map similarity index 100% rename from d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map rename to d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 similarity index 100% rename from d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 rename to d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg similarity index 100% rename from d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg rename to d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg similarity index 100% rename from d1/db7/dynamic__programming_2armstrong__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg rename to d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map similarity index 80% rename from d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map rename to d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 64bef9f51..f9fbb23aa 100644 --- a/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,6 +1,6 @@ - + diff --git a/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..32c8878b9 --- /dev/null +++ b/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +ec3c99204a91eb6d2db419fdce5fbf07 \ No newline at end of file diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg similarity index 95% rename from d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg rename to d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index de631d36c..13657b65b 100644 --- a/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -31,7 +31,7 @@ Node2 - + tests diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg similarity index 94% rename from d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg rename to d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index eef624584..d45985b33 100644 --- a/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -20,7 +20,7 @@ Node2 - + tests diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp.js b/d1/db7/dynamic__programming_2armstrong__number_8cpp.js deleted file mode 100644 index 25a6100b2..000000000 --- a/d1/db7/dynamic__programming_2armstrong__number_8cpp.js +++ /dev/null @@ -1,6 +0,0 @@ -var dynamic__programming_2armstrong__number_8cpp = -[ - [ "is_armstrong", "d1/db7/dynamic__programming_2armstrong__number_8cpp.html#af046365a8d77a1267acc082f86135a26", null ], - [ "main", "d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], - [ "tests", "d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ] -]; \ No newline at end of file diff --git a/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 deleted file mode 100644 index 821f3bf3a..000000000 --- a/d1/db7/dynamic__programming_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -6472f459d0a32076394714e5a2f4b152 \ No newline at end of file diff --git a/d1/dc2/class_graph__coll__graph.map b/d1/dc2/class_graph__coll__graph.map index 6c83e1be9..768d1187e 100644 --- a/d1/dc2/class_graph__coll__graph.map +++ b/d1/dc2/class_graph__coll__graph.map @@ -1,19 +1,21 @@ - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + diff --git a/d1/dc2/class_graph__coll__graph.md5 b/d1/dc2/class_graph__coll__graph.md5 index 07a93c41a..c3e5b9763 100644 --- a/d1/dc2/class_graph__coll__graph.md5 +++ b/d1/dc2/class_graph__coll__graph.md5 @@ -1 +1 @@ -473d9285f6b814132d52a27d5da1ab97 \ No newline at end of file +ff1e3808bc1707202b3c553605f4077d \ No newline at end of file diff --git a/d1/dc2/class_graph__coll__graph.svg b/d1/dc2/class_graph__coll__graph.svg index 07e7f3ce5..18feeca81 100644 --- a/d1/dc2/class_graph__coll__graph.svg +++ b/d1/dc2/class_graph__coll__graph.svg @@ -4,8 +4,8 @@ - + @@ -17,7 +17,7 @@ ]]> - + Graph @@ -31,9 +31,9 @@ Node2 - - -Edge + + +std::vector< Edge > @@ -41,8 +41,8 @@ Node2->Node1 - - + + edges @@ -50,7 +50,26 @@ Node3 - + + +Edge + + + + + +Node3->Node2 + + + + + + elements + + + +Node4 + std::map< unsigned int, std::vector< unsigned @@ -58,63 +77,43 @@ - - -Node3->Node1 - + + +Node4->Node1 + m_adjList - - -Node4 - + + +Node5 + std::vector< unsigned int > - - -Node4->Node3 - + + +Node5->Node4 + elements - - -Node5 - - -std::vector< std::vector -< int > > - - - - - -Node5->Node1 - - - - - - capacity -residual_capacity - Node6 - -std::vector< int > + +std::vector< std::vector +< int > > @@ -122,19 +121,19 @@ Node6->Node1 - - + + - parent + capacity +residual_capacity Node7 - -std::vector< std::tuple -< int, int, int > > + +std::vector< int > @@ -142,45 +141,65 @@ Node7->Node1 + + + + + parent + + + +Node8 + + +std::vector< std::tuple +< int, int, int > > + + + + + +Node8->Node1 + edge_participated - - -Node8 - + + +Node9 + std::tuple< int, int, int > - - -Node8->Node7 - + + +Node9->Node8 + elements - - -Node9 - + + +Node10 + std::bitset< MAXN > - - -Node9->Node1 - + + +Node10->Node1 + diff --git a/d1/dc2/class_graph__coll__graph_org.svg b/d1/dc2/class_graph__coll__graph_org.svg index 9b72fb2fd..df5514575 100644 --- a/d1/dc2/class_graph__coll__graph_org.svg +++ b/d1/dc2/class_graph__coll__graph_org.svg @@ -4,9 +4,9 @@ - - + + Graph @@ -20,9 +20,9 @@ Node2 - - -Edge + + +std::vector< Edge > @@ -30,8 +30,8 @@ Node2->Node1 - - + + edges @@ -39,7 +39,26 @@ Node3 - + + +Edge + + + + + +Node3->Node2 + + + + + + elements + + + +Node4 + std::map< unsigned int, std::vector< unsigned @@ -47,63 +66,43 @@ - - -Node3->Node1 - + + +Node4->Node1 + m_adjList - - -Node4 - + + +Node5 + std::vector< unsigned int > - - -Node4->Node3 - + + +Node5->Node4 + elements - - -Node5 - - -std::vector< std::vector -< int > > - - - - - -Node5->Node1 - - - - - - capacity -residual_capacity - Node6 - -std::vector< int > + +std::vector< std::vector +< int > > @@ -111,19 +110,19 @@ Node6->Node1 - - + + - parent + capacity +residual_capacity Node7 - -std::vector< std::tuple -< int, int, int > > + +std::vector< int > @@ -131,45 +130,65 @@ Node7->Node1 + + + + + parent + + + +Node8 + + +std::vector< std::tuple +< int, int, int > > + + + + + +Node8->Node1 + edge_participated - - -Node8 - + + +Node9 + std::tuple< int, int, int > - - -Node8->Node7 - + + +Node9->Node8 + elements - - -Node9 - + + +Node10 + std::bitset< MAXN > - - -Node9->Node1 - + + +Node10->Node1 + diff --git a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html b/d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html index 7e0bdc3e3..67f155a87 100644 --- a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html +++ b/d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html @@ -194,7 +194,7 @@ Functions
151 print(mdist, V);
152}
graph
Graph Algorithms.
-
greedy_algorithms::dijkstra::minimum_distance
int minimum_distance(std::vector< int > mdist, std::vector< bool > vset, int V)
Utility function that finds the vertex with the minimum distance in mdist.
Definition dijkstra.cpp:82
+
greedy_algorithms::dijkstra::minimum_distance
int minimum_distance(std::vector< int > mdist, std::vector< bool > vset, int V)
Utility function that finds the vertex with the minimum distance in mdist.
Definition dijkstra_greedy.cpp:82
Here is the call graph for this function:
diff --git a/d2/d45/segtree_8cpp.html b/d2/d45/segtree_8cpp.html index 46837c61a..6f56c273e 100644 --- a/d2/d45/segtree_8cpp.html +++ b/d2/d45/segtree_8cpp.html @@ -114,12 +114,13 @@ $(function(){initNavTree('d2/d45/segtree_8cpp.html','../../'); initResizable(tru More...

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

@@ -171,11 +171,11 @@ Functions

for std::vector

-

for assert for log2 for IO operations

+

for assert for log2 for std::uint64_t for IO operations

Constructs the initial segment tree

Parameters

@@ -190,7 +191,7 @@ Functions

@@ -203,18 +204,18 @@ Functions
Returns
void
-
38 {
-
39 if (low == high) {
-
40 (*segtree)[pos] = arr[low];
-
41 return;
-
42 }
-
43
-
44 uint64_t mid = (low + high) / 2;
-
45 ConsTree(arr, segtree, low, mid, 2 * pos + 1);
-
46 ConsTree(arr, segtree, mid + 1, high, 2 * pos + 2);
-
47 (*segtree)[pos] = (*segtree)[2 * pos + 1] + (*segtree)[2 * pos + 2];
-
48}
-
ConsTree
void ConsTree(const std::vector< int64_t > &arr, std::vector< int64_t > *segtree, uint64_t low, uint64_t high, uint64_t pos)
for std::vector
Definition segtree.cpp:37
+
39 {
+
40 if (low == high) {
+
41 (*segtree)[pos] = arr[low];
+
42 return;
+
43 }
+
44
+
45 uint64_t mid = (low + high) / 2;
+
46 ConsTree(arr, segtree, low, mid, 2 * pos + 1);
+
47 ConsTree(arr, segtree, mid + 1, high, 2 * pos + 2);
+
48 (*segtree)[pos] = (*segtree)[2 * pos + 1] + (*segtree)[2 * pos + 2];
+
49}
+
ConsTree
void ConsTree(const std::vector< int64_t > &arr, std::vector< int64_t > *segtree, uint64_t low, uint64_t high, uint64_t pos)
for std::vector
Definition segtree.cpp:38
Here is the call graph for this function:
@@ -240,66 +241,66 @@ Here is the call graph for this function:

Main function.

Returns
0 on exit
-
167 {
-
168 test(); // run self-test implementations
-
169
-
170 std::cout << "Enter number of elements: ";
-
171
-
172 uint64_t n = 0;
-
173 std::cin >> n;
-
174
-
175 auto max = static_cast<uint64_t>(2 * pow(2, ceil(log2(n))) - 1);
-
176 std::vector<int64_t> arr(n), lazy(max), segtree(max);
-
177
-
178 int choice = 0;
-
179 std::cout << "\nDo you wish to enter each number?:\n"
-
180 "1: Yes\n"
-
181 "0: No (default initialize them to 0)\n";
-
182
-
183 std::cin >> choice;
-
184 if (choice == 1) {
-
185 std::cout << "Enter " << n << " numbers:\n";
-
186 for (int i = 1; i <= n; i++) {
-
187 std::cout << i << ": ";
-
188 std::cin >> arr[i];
-
189 }
-
190 }
-
191
-
192 ConsTree(arr, &segtree, 0, n - 1, 0);
-
193
-
194 do {
-
195 std::cout << "\nMake your choice:\n"
-
196 "1: Range update (input)\n"
-
197 "2: Range query (output)\n"
-
198 "0: Exit\n";
-
199 std::cin >> choice;
-
200
-
201 if (choice == 1) {
-
202 std::cout << "Enter 1-indexed lower bound, upper bound & value:\n";
-
203
-
204 uint64_t p = 1, q = 1, v = 0;
-
205 std::cin >> p >> q >> v;
-
206 update(&segtree, &lazy, p - 1, q - 1, v, 0, n - 1, 0);
-
207 } else if (choice == 2) {
-
208 std::cout << "Enter 1-indexed lower bound & upper bound:\n";
-
209
-
210 uint64_t p = 1, q = 1;
-
211 std::cin >> p >> q;
-
212 std::cout << query(&segtree, &lazy, p - 1, q - 1, 0, n - 1, 0);
-
213 std::cout << "\n";
-
214 }
-
215 } while (choice > 0);
-
216
-
217 return 0;
-
218}
+
168 {
+
169 test(); // run self-test implementations
+
170
+
171 std::cout << "Enter number of elements: ";
+
172
+
173 uint64_t n = 0;
+
174 std::cin >> n;
+
175
+
176 auto max = static_cast<uint64_t>(2 * pow(2, ceil(log2(n))) - 1);
+
177 std::vector<int64_t> arr(n), lazy(max), segtree(max);
+
178
+
179 int choice = 0;
+
180 std::cout << "\nDo you wish to enter each number?:\n"
+
181 "1: Yes\n"
+
182 "0: No (default initialize them to 0)\n";
+
183
+
184 std::cin >> choice;
+
185 if (choice == 1) {
+
186 std::cout << "Enter " << n << " numbers:\n";
+
187 for (int i = 1; i <= n; i++) {
+
188 std::cout << i << ": ";
+
189 std::cin >> arr[i];
+
190 }
+
191 }
+
192
+
193 ConsTree(arr, &segtree, 0, n - 1, 0);
+
194
+
195 do {
+
196 std::cout << "\nMake your choice:\n"
+
197 "1: Range update (input)\n"
+
198 "2: Range query (output)\n"
+
199 "0: Exit\n";
+
200 std::cin >> choice;
+
201
+
202 if (choice == 1) {
+
203 std::cout << "Enter 1-indexed lower bound, upper bound & value:\n";
+
204
+
205 uint64_t p = 1, q = 1, v = 0;
+
206 std::cin >> p >> q >> v;
+
207 update(&segtree, &lazy, p - 1, q - 1, v, 0, n - 1, 0);
+
208 } else if (choice == 2) {
+
209 std::cout << "Enter 1-indexed lower bound & upper bound:\n";
+
210
+
211 uint64_t p = 1, q = 1;
+
212 std::cin >> p >> q;
+
213 std::cout << query(&segtree, &lazy, p - 1, q - 1, 0, n - 1, 0);
+
214 std::cout << "\n";
+
215 }
+
216 } while (choice > 0);
+
217
+
218 return 0;
+
219}
std::ceil
T ceil(T... args)
std::max
T max(T... args)
std::pow
T pow(T... args)
-
query
int64_t query(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)
Returns the sum of all elements in a range.
Definition segtree.cpp:62
-
test
static void test()
Self-test implementation.
Definition segtree.cpp:146
-
update
void update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)
Updates a range of the segment tree.
Definition segtree.cpp:102
+
query
int64_t query(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)
Returns the sum of all elements in a range.
Definition segtree.cpp:63
+
test
static void test()
Self-test implementation.
Definition segtree.cpp:147
+
update
void update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)
Updates a range of the segment tree.
Definition segtree.cpp:103
Here is the call graph for this function:
@@ -367,30 +368,30 @@ Here is the call graph for this function:
Returns
result of the range query for this function call
-
64 {
-
65 if (low > high || qlow > high || low > qhigh) {
-
66 return 0;
-
67 }
-
68
-
69 if ((*lazy)[pos] != 0) {
-
70 (*segtree)[pos] += (*lazy)[pos] * (high - low + 1);
-
71
-
72 if (low != high) {
-
73 (*lazy)[2 * pos + 1] += (*lazy)[pos];
-
74 (*lazy)[2 * pos + 2] += (*lazy)[pos];
-
75 }
-
76 (*lazy)[pos] = 0;
-
77 }
-
78
-
79 if (qlow <= low && qhigh >= high) {
-
80 return (*segtree)[pos];
-
81 }
-
82
-
83 uint64_t mid = (low + high) / 2;
-
84
-
85 return query(segtree, lazy, qlow, qhigh, low, mid, 2 * pos + 1) +
-
86 query(segtree, lazy, qlow, qhigh, mid + 1, high, 2 * pos + 2);
-
87}
+
65 {
+
66 if (low > high || qlow > high || low > qhigh) {
+
67 return 0;
+
68 }
+
69
+
70 if ((*lazy)[pos] != 0) {
+
71 (*segtree)[pos] += (*lazy)[pos] * (high - low + 1);
+
72
+
73 if (low != high) {
+
74 (*lazy)[2 * pos + 1] += (*lazy)[pos];
+
75 (*lazy)[2 * pos + 2] += (*lazy)[pos];
+
76 }
+
77 (*lazy)[pos] = 0;
+
78 }
+
79
+
80 if (qlow <= low && qhigh >= high) {
+
81 return (*segtree)[pos];
+
82 }
+
83
+
84 uint64_t mid = (low + high) / 2;
+
85
+
86 return query(segtree, lazy, qlow, qhigh, low, mid, 2 * pos + 1) +
+
87 query(segtree, lazy, qlow, qhigh, mid + 1, high, 2 * pos + 2);
+
88}
Here is the call graph for this function:
@@ -424,21 +425,21 @@ Here is the call graph for this function:

Self-test implementation.

Returns
void
-
146 {
-
147 auto max = static_cast<int64_t>(2 * pow(2, ceil(log2(7))) - 1);
-
148 assert(max == 15);
-
149
-
150 std::vector<int64_t> arr{1, 2, 3, 4, 5, 6, 7}, lazy(max), segtree(max);
-
151 ConsTree(arr, &segtree, 0, 7 - 1, 0);
-
152
-
153 assert(query(&segtree, &lazy, 1, 5, 0, 7 - 1, 0) == 2 + 3 + 4 + 5 + 6);
-
154
-
155 update(&segtree, &lazy, 2, 4, 1, 0, 7 - 1, 0);
-
156 assert(query(&segtree, &lazy, 1, 5, 0, 7 - 1, 0) == 2 + 4 + 5 + 6 + 6);
-
157
-
158 update(&segtree, &lazy, 0, 6, -2, 0, 7 - 1, 0);
-
159 assert(query(&segtree, &lazy, 0, 4, 0, 7 - 1, 0) == -1 + 0 + 2 + 3 + 4);
-
160}
+
147 {
+
148 auto max = static_cast<int64_t>(2 * pow(2, ceil(log2(7))) - 1);
+
149 assert(max == 15);
+
150
+
151 std::vector<int64_t> arr{1, 2, 3, 4, 5, 6, 7}, lazy(max), segtree(max);
+
152 ConsTree(arr, &segtree, 0, 7 - 1, 0);
+
153
+
154 assert(query(&segtree, &lazy, 1, 5, 0, 7 - 1, 0) == 2 + 3 + 4 + 5 + 6);
+
155
+
156 update(&segtree, &lazy, 2, 4, 1, 0, 7 - 1, 0);
+
157 assert(query(&segtree, &lazy, 1, 5, 0, 7 - 1, 0) == 2 + 4 + 5 + 6 + 6);
+
158
+
159 update(&segtree, &lazy, 0, 6, -2, 0, 7 - 1, 0);
+
160 assert(query(&segtree, &lazy, 0, 4, 0, 7 - 1, 0) == -1 + 0 + 2 + 3 + 4);
+
161}
Here is the call graph for this function:
@@ -511,42 +512,42 @@ Here is the call graph for this function:
Returns
void
-
104 {
-
105 if (low > high) {
-
106 return;
-
107 }
-
108
-
109 if ((*lazy)[pos] != 0) {
-
110 (*segtree)[pos] += (*lazy)[pos] * (high - low + 1);
-
111
-
112 if (low != high) {
-
113 (*lazy)[2 * pos + 1] += (*lazy)[pos];
-
114 (*lazy)[2 * pos + 2] += (*lazy)[pos];
-
115 }
-
116 (*lazy)[pos] = 0;
-
117 }
-
118
-
119 if (start > high || end < low) {
-
120 return;
-
121 }
-
122
-
123 if (start <= low && end >= high) {
-
124 (*segtree)[pos] += delta * (high - low + 1);
-
125
-
126 if (low != high) {
-
127 (*lazy)[2 * pos + 1] += delta;
-
128 (*lazy)[2 * pos + 2] += delta;
-
129 }
-
130
-
131 return;
-
132 }
-
133
-
134 uint64_t mid = (low + high) / 2;
-
135
-
136 update(segtree, lazy, start, end, delta, low, mid, 2 * pos + 1);
-
137 update(segtree, lazy, start, end, delta, mid + 1, high, 2 * pos + 2);
-
138 (*segtree)[pos] = (*segtree)[2 * pos + 1] + (*segtree)[2 * pos + 2];
-
139}
+
105 {
+
106 if (low > high) {
+
107 return;
+
108 }
+
109
+
110 if ((*lazy)[pos] != 0) {
+
111 (*segtree)[pos] += (*lazy)[pos] * (high - low + 1);
+
112
+
113 if (low != high) {
+
114 (*lazy)[2 * pos + 1] += (*lazy)[pos];
+
115 (*lazy)[2 * pos + 2] += (*lazy)[pos];
+
116 }
+
117 (*lazy)[pos] = 0;
+
118 }
+
119
+
120 if (start > high || end < low) {
+
121 return;
+
122 }
+
123
+
124 if (start <= low && end >= high) {
+
125 (*segtree)[pos] += delta * (high - low + 1);
+
126
+
127 if (low != high) {
+
128 (*lazy)[2 * pos + 1] += delta;
+
129 (*lazy)[2 * pos + 2] += delta;
+
130 }
+
131
+
132 return;
+
133 }
+
134
+
135 uint64_t mid = (low + high) / 2;
+
136
+
137 update(segtree, lazy, start, end, delta, low, mid, 2 * pos + 1);
+
138 update(segtree, lazy, start, end, delta, mid + 1, high, 2 * pos + 2);
+
139 (*segtree)[pos] = (*segtree)[2 * pos + 1] + (*segtree)[2 * pos + 2];
+
140}
Here is the call graph for this function:
diff --git a/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.map b/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.map deleted file mode 100644 index c2ae689ca..000000000 --- a/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.map +++ /dev/null @@ -1,11 +0,0 @@ - - - - - - - - - - - diff --git a/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.md5 b/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.md5 deleted file mode 100644 index 4d9433c21..000000000 --- a/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.md5 +++ /dev/null @@ -1 +0,0 @@ -02dec7afa6ff871d850c576454a9fbec \ No newline at end of file diff --git a/d0/dfe/backtracking_2subset__sum_8cpp.html b/d2/d5a/subset__sum_8cpp.html similarity index 94% rename from d0/dfe/backtracking_2subset__sum_8cpp.html rename to d2/d5a/subset__sum_8cpp.html index 282d8e86a..16dcf5775 100644 --- a/d0/dfe/backtracking_2subset__sum_8cpp.html +++ b/d2/d5a/subset__sum_8cpp.html @@ -78,7 +78,7 @@ $(function() {
@@ -120,7 +120,7 @@ $(function(){initNavTree('d0/dfe/backtracking_2subset__sum_8cpp.html','../../');
Include dependency graph for subset_sum.cpp:
-
+
105 test(); // run self-test implementations
106 return 0;
107}
-
test
static void test()
Test implementations.
Definition subset_sum.cpp:58
+
test
static void test()
Test implementations.
Definition subset_sum.cpp:58
Here is the call graph for this function:
-
+
@@ -228,7 +228,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
@@ -305,7 +305,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
@@ -315,7 +315,7 @@ Here is the call graph for this function: diff --git a/d2/d5a/subset__sum_8cpp.js b/d2/d5a/subset__sum_8cpp.js new file mode 100644 index 000000000..910f4f071 --- /dev/null +++ b/d2/d5a/subset__sum_8cpp.js @@ -0,0 +1,6 @@ +var subset__sum_8cpp = +[ + [ "main", "d2/d5a/subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "number_of_subsets", "d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99", null ], + [ "test", "d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] +]; \ No newline at end of file diff --git a/d0/dfe/backtracking_2subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.map b/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.map similarity index 100% rename from d0/dfe/backtracking_2subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.map rename to d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.map diff --git a/d0/dfe/backtracking_2subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.md5 b/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.md5 similarity index 100% rename from d0/dfe/backtracking_2subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.md5 rename to d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.md5 diff --git a/d0/dfe/backtracking_2subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.svg b/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.svg similarity index 100% rename from d0/dfe/backtracking_2subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.svg rename to d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.svg diff --git a/d0/dfe/backtracking_2subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph_org.svg b/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph_org.svg similarity index 100% rename from d0/dfe/backtracking_2subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph_org.svg rename to d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph_org.svg diff --git a/d0/dfe/backtracking_2subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map similarity index 100% rename from d0/dfe/backtracking_2subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map rename to d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map diff --git a/d0/dfe/backtracking_2subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 similarity index 100% rename from d0/dfe/backtracking_2subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 rename to d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 diff --git a/d0/dfe/backtracking_2subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg similarity index 100% rename from d0/dfe/backtracking_2subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg rename to d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg diff --git a/d0/dfe/backtracking_2subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg similarity index 100% rename from d0/dfe/backtracking_2subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg rename to d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map similarity index 74% rename from d6/d80/dynamic__programming_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map rename to d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 9a4aeb914..ec67d1ecf 100644 --- a/d6/d80/dynamic__programming_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,6 +1,6 @@ - + diff --git a/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..90956ad7d --- /dev/null +++ b/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +574f4d71b42b28252ea9230e978fabd8 \ No newline at end of file diff --git a/d0/dfe/backtracking_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg similarity index 94% rename from d0/dfe/backtracking_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg rename to d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 5c8b057f7..bfbef9751 100644 --- a/d0/dfe/backtracking_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -31,7 +31,7 @@ Node2 - + test diff --git a/d0/dfe/backtracking_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg similarity index 93% rename from d0/dfe/backtracking_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg rename to d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 1d7d59347..e0a300d0e 100644 --- a/d0/dfe/backtracking_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -20,7 +20,7 @@ Node2 - + test diff --git a/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html b/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html index 614a0c382..0c245deba 100644 --- a/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html +++ b/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html @@ -256,7 +256,7 @@ int 
The documentation for this class was generated from the following file: diff --git a/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.map b/d2/dc5/armstrong__number__templated_8cpp__incl.map similarity index 77% rename from d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.map rename to d2/dc5/armstrong__number__templated_8cpp__incl.map index 2d8b45aad..d1dfd608a 100644 --- a/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.map +++ b/d2/dc5/armstrong__number__templated_8cpp__incl.map @@ -1,5 +1,5 @@ - - + + diff --git a/d2/dc5/armstrong__number__templated_8cpp__incl.md5 b/d2/dc5/armstrong__number__templated_8cpp__incl.md5 new file mode 100644 index 000000000..bb9deb8be --- /dev/null +++ b/d2/dc5/armstrong__number__templated_8cpp__incl.md5 @@ -0,0 +1 @@ +f9f350893c63652ce6bbc333e7e71e77 \ No newline at end of file diff --git a/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.svg b/d2/dc5/armstrong__number__templated_8cpp__incl.svg similarity index 90% rename from d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.svg rename to d2/dc5/armstrong__number__templated_8cpp__incl.svg index 89ff20a46..2a7df358a 100644 --- a/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.svg +++ b/d2/dc5/armstrong__number__templated_8cpp__incl.svg @@ -3,7 +3,7 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - + @@ -18,14 +18,14 @@ -dynamic_programming/armstrong_number.cpp +dynamic_programming/armstrong_number_templated.cpp Node1 - -dynamic_programming -/armstrong_number.cpp + +dynamic_programming +/armstrong_number_templated.cpp diff --git a/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl_org.svg b/d2/dc5/armstrong__number__templated_8cpp__incl_org.svg similarity index 88% rename from d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl_org.svg rename to d2/dc5/armstrong__number__templated_8cpp__incl_org.svg index 15607d245..5e87f0692 100644 --- a/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl_org.svg +++ b/d2/dc5/armstrong__number__templated_8cpp__incl_org.svg @@ -3,18 +3,18 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - + -dynamic_programming/armstrong_number.cpp +dynamic_programming/armstrong_number_templated.cpp Node1 - -dynamic_programming -/armstrong_number.cpp + +dynamic_programming +/armstrong_number_templated.cpp diff --git a/d3/d84/word__break_8cpp.html b/d3/d84/word__break_8cpp.html index 3b55fdddf..07f9925bb 100644 --- a/d3/d84/word__break_8cpp.html +++ b/d3/d84/word__break_8cpp.html @@ -231,7 +231,7 @@ pen apple". Note that you are allowed to reuse a dictionary word.

105 // if the prefix till current position is present in the dictionary
106 // and the remaining substring can also be segmented legally, then
107 // set solution at position pos in the memo, and return true
-
108 if (exists(wordTillNow, strSet) and check(s, strSet, i + 1, dp)) {
+
108 if (exists(wordTillNow, strSet) && check(s, strSet, i + 1, dp)) {
109 dp->at(pos) = 1;
110 return true;
111 }
diff --git a/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.md5 b/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.md5 deleted file mode 100644 index 3e754acd8..000000000 --- a/d3/ddf/dynamic__programming_2armstrong__number_8cpp__incl.md5 +++ /dev/null @@ -1 +0,0 @@ -7e6e1ecd83694b3be4c8278f14c4be23 \ No newline at end of file diff --git a/d4/d18/composite__simpson__rule_8cpp.html b/d4/d18/composite__simpson__rule_8cpp.html index b4ebfb8d6..fda394a58 100644 --- a/d4/d18/composite__simpson__rule_8cpp.html +++ b/d4/d18/composite__simpson__rule_8cpp.html @@ -206,7 +206,7 @@ Functions
72
73 // Create the data table
74 double temp = NAN;
-
75 for (std::int32_t i = 0; i <= N; i++) {
+
75 for (std::int32_t i = 0; i <= N; i++) {
76 temp = func(xi);
77 data_table.insert(
78 std::pair<std::int32_t, double>(i, temp)); // add i and f(xi)
@@ -216,7 +216,7 @@ Functions
82 // Evaluate the integral.
83 // Remember: f(x0) + 4*f(x1) + 2*f(x2) + ... + 2*f(xN-2) + 4*f(xN-1) + f(xN)
84 double evaluate_integral = 0;
-
85 for (std::int32_t i = 0; i <= N; i++) {
+
85 for (std::int32_t i = 0; i <= N; i++) {
86 if (i == 0 || i == N) {
87 evaluate_integral += data_table.at(i);
88 } else if (i % 2 == 1) {
@@ -238,13 +238,13 @@ Functions
104 return evaluate_integral;
105}
std::map::at
T at(T... args)
-
data_structures::sparse_table::N
constexpr uint32_t N
A struct to represent sparse table for min() as their invariant function, for the given array A....
Definition sparse_table.cpp:48
h
int h(int key)
Definition hash_search.cpp:45
std::map::insert
T insert(T... args)
std::isnan
T isnan(T... args)
+
data_structures::sparse_table::N
constexpr uint32_t N
A struct to represent sparse table for min() as their invariant function, for the given array A....
Definition sparse_table.cpp:48
@@ -391,7 +391,7 @@ Here is the call graph for this function:

Starting and ending point of the integration in the real axis

Step, calculated by a, b and N

170 {
-
171 std::int32_t N = 16; /// Number of intervals to divide the integration
+
171 std::int32_t N = 16; /// Number of intervals to divide the integration
172 /// interval. MUST BE EVEN
173 double a = 1, b = 3; /// Starting and ending point of the integration in
174 /// the real axis
@@ -404,7 +404,7 @@ Here is the call graph for this function:
181 // Get user input (by the command line parameters or the console after
182 // displaying messages)
183 if (argc == 4) {
-
184 N = std::atoi(argv[1]);
+
184 N = std::atoi(argv[1]);
185 a = std::atof(argv[2]);
186 b = std::atof(argv[3]);
187 // Check if a<b else abort
@@ -413,10 +413,10 @@ Here is the call graph for this function:
190 if (N < 16 || a != 1 || b != 3) {
191 used_argv_parameters = true;
192 }
-
193 std::cout << "You selected N=" << N << ", a=" << a << ", b=" << b
+
193 std::cout << "You selected N=" << N << ", a=" << a << ", b=" << b
194 << std::endl;
195 } else {
-
196 std::cout << "Default N=" << N << ", a=" << a << ", b=" << b
+
196 std::cout << "Default N=" << N << ", a=" << a << ", b=" << b
197 << std::endl;
198 }
199
diff --git a/d4/d31/range__queries_2sparse__table_8cpp__incl.map b/d4/d31/range__queries_2sparse__table_8cpp__incl.map deleted file mode 100644 index ee89fc210..000000000 --- a/d4/d31/range__queries_2sparse__table_8cpp__incl.map +++ /dev/null @@ -1,11 +0,0 @@ - - - - - - - - - - - diff --git a/d4/d31/range__queries_2sparse__table_8cpp__incl.md5 b/d4/d31/range__queries_2sparse__table_8cpp__incl.md5 deleted file mode 100644 index ec424536b..000000000 --- a/d4/d31/range__queries_2sparse__table_8cpp__incl.md5 +++ /dev/null @@ -1 +0,0 @@ -b9a90ade7cac95ede7df6277c6c92ab1 \ No newline at end of file diff --git a/d4/d31/range__queries_2sparse__table_8cpp__incl.svg b/d4/d31/range__queries_2sparse__table_8cpp__incl.svg deleted file mode 100644 index ccf84dc76..000000000 --- a/d4/d31/range__queries_2sparse__table_8cpp__incl.svg +++ /dev/null @@ -1,120 +0,0 @@ - - - - - - - - - - - - -range_queries/sparse_table.cpp - - -Node1 - - -range_queries/sparse -_table.cpp - - - - - -Node2 - - -algorithm - - - - - -Node1->Node2 - - - - - - - - -Node3 - - -cassert - - - - - -Node1->Node3 - - - - - - - - -Node4 - - -iostream - - - - - -Node1->Node4 - - - - - - - - -Node5 - - -vector - - - - - -Node1->Node5 - - - - - - - - - - - - - diff --git a/d4/d31/range__queries_2sparse__table_8cpp__incl_org.svg b/d4/d31/range__queries_2sparse__table_8cpp__incl_org.svg deleted file mode 100644 index 56c53a4b8..000000000 --- a/d4/d31/range__queries_2sparse__table_8cpp__incl_org.svg +++ /dev/null @@ -1,94 +0,0 @@ - - - - - - -range_queries/sparse_table.cpp - - -Node1 - - -range_queries/sparse -_table.cpp - - - - - -Node2 - - -algorithm - - - - - -Node1->Node2 - - - - - - - - -Node3 - - -cassert - - - - - -Node1->Node3 - - - - - - - - -Node4 - - -iostream - - - - - -Node1->Node4 - - - - - - - - -Node5 - - -vector - - - - - -Node1->Node5 - - - - - - - - diff --git a/d4/d90/classdata__structures_1_1_skip_list.html b/d4/d90/classdata__structures_1_1_skip_list.html index 084bd8722..53f2c15ab 100644 --- a/d4/d90/classdata__structures_1_1_skip_list.html +++ b/d4/d90/classdata__structures_1_1_skip_list.html @@ -250,7 +250,7 @@ Here is the call graph for this function:
std::endl
T endl(T... args)
std::array::fill
T fill(T... args)
-
update
void update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)
Updates a range of the segment tree.
Definition segtree.cpp:102
+
update
void update(std::vector< int64_t > *segtree, std::vector< int64_t > *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)
Updates a range of the segment tree.
Definition segtree.cpp:103
Here is the call graph for this function:
diff --git a/d4/d96/range__queries_2sparse__table_8cpp.html b/d4/d96/range__queries_2sparse__table_8cpp.html deleted file mode 100644 index 72d076538..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp.html +++ /dev/null @@ -1,352 +0,0 @@ - - - - - - - -Algorithms_in_C++: range_queries/sparse_table.cpp File Reference - - - - - - - - - - - - - - - - - -
-
-

@@ -169,11 +169,11 @@ Functions

vertexNum = 0
- - - - - -
-
Algorithms_in_C++ 1.0.0 -
-
Set of algorithms implemented in C++.
-
-
- - - - - - - - -
-
- -
-
-
- -
- -
-
- - -
-
-
-
-
-
Loading...
-
Searching...
-
No Matches
-
-
-
-
- -
-
-Namespaces | -Functions
-
sparse_table.cpp File Reference
-
-
- -

Implementation of Sparse Table data structure. -More...

-
#include <algorithm>
-#include <cassert>
-#include <iostream>
-#include <vector>
-
-Include dependency graph for sparse_table.cpp:
-
-
-
-
- - - - - - - -

-Namespaces

namespace  range_queries
 for std::vector
 
namespace  sparse_table
 Functions for Implementation of Sparse Table
 
- - - - - - - - - - - - -

-Functions

template<typename T >
std::vector< T > range_queries::sparse_table::computeLogs (const std::vector< T > &A)
 
template<typename T >
std::vector< std::vector< T > > range_queries::sparse_table::buildTable (const std::vector< T > &A, const std::vector< T > &logs)
 
template<typename T >
int range_queries::sparse_table::getMinimum (int beg, int end, const std::vector< T > &logs, const std::vector< std::vector< T > > &table)
 
int main ()
 
-

Detailed Description

-

Implementation of Sparse Table data structure.

-

Sparse Table is a data structure, that allows answering range queries. It can answer most range queries in O(logn), but its true power is answering range minimum queries or equivalent range maximum queries). For those queries it can compute the answer in O(1) time.

-
    -
  • Running Time Complexity
    -
    • -
  • Build : O(NlogN)
    -
    • -
  • Range Query : O(1)
    -
    • -
-

Function Documentation

- -

◆ buildTable()

- -
-
-
-template<typename T >
- - - - - - - - - - - -
std::vector< std::vector< T > > range_queries::sparse_table::buildTable (const std::vector< T > & A,
const std::vector< T > & logs )
-
-

This functions builds the primary data structure sparse table

Parameters
- - - - -
nvalue of the size of the input array
Aarray of the input integers
logsarray of the log table
-
-
-
Returns
created sparse table data structure
-
57 {
-
58 int n = A.size();
-
59 std::vector<std::vector<T> > table(20, std::vector<T>(n + 5, 0));
-
60 int curLen = 0;
-
61 for (int i = 0; i <= logs[n]; i++) {
-
62 curLen = 1 << i;
-
63 for (int j = 0; j + curLen < n; j++) {
-
64 if (curLen == 1) {
-
65 table[i][j] = A[j];
-
66 } else {
-
67 table[i][j] =
-
68 std::min(table[i - 1][j], table[i - 1][j + curLen / 2]);
-
69 }
-
70 }
-
71 }
-
72 return table;
-
73}
-
std::min
T min(T... args)
-
std::vector::size
T size(T... args)
- -
-Here is the call graph for this function:
-
-
-
- -
-
- -

◆ computeLogs()

- -
-
-
-template<typename T >
- - - - - - - -
std::vector< T > range_queries::sparse_table::computeLogs (const std::vector< T > & A)
-
-

This function precomputes intial log table for further use.

Parameters
- - -
nvalue of the size of the input array
-
-
-
Returns
corresponding vector of the log table
-
38 {
-
39 int n = A.size();
-
40 std::vector<T> logs(n);
-
41 logs[1] = 0;
-
42 for (int i = 2; i < n; i++) {
-
43 logs[i] = logs[i / 2] + 1;
-
44 }
-
45 return logs;
-
46}
-
-Here is the call graph for this function:
-
-
-
- -
-
- -

◆ getMinimum()

- -
-
-
-template<typename T >
- - - - - - - - - - - - - - - - - - - - - -
int range_queries::sparse_table::getMinimum (int beg,
int end,
const std::vector< T > & logs,
const std::vector< std::vector< T > > & table )
-
-

This function is the query function to get the range minimum value

Parameters
- - - - - -
begbeginning index of the query range
endending index of the query range
logsarray of the log table
tablesparse table data structure for the input array
-
-
-
Returns
minimum value for the [beg, end] range for the input array
-
85 {
-
86 int p = logs[end - beg + 1];
-
87 int pLen = 1 << p;
-
88 return std::min(table[p][beg], table[p][end - pLen + 1]);
-
89}
-
std::end
T end(T... args)
-
-Here is the call graph for this function:
-
-
-
- -
-
- -

◆ main()

- -
-
- - - - - - - -
int main (void )
-
-

Main function

-
96 {
-
97 std::vector<int> A{1, 2, 0, 3, 9};
-
98 std::vector<int> logs = range_queries::sparse_table::computeLogs(A);
-
99 std::vector<std::vector<int> > table =
-
100 range_queries::sparse_table::buildTable(A, logs);
-
101 assert(range_queries::sparse_table::getMinimum(0, 0, logs, table) == 1);
-
102 assert(range_queries::sparse_table::getMinimum(0, 4, logs, table) == 0);
-
103 assert(range_queries::sparse_table::getMinimum(2, 4, logs, table) == 0);
-
104 return 0;
-
105}
-
range_queries::sparse_table::computeLogs
std::vector< T > computeLogs(const std::vector< T > &A)
Definition sparse_table.cpp:38
-
range_queries::sparse_table::buildTable
std::vector< std::vector< T > > buildTable(const std::vector< T > &A, const std::vector< T > &logs)
Definition sparse_table.cpp:56
-
-
-
-
-
- - - - diff --git a/d4/d96/range__queries_2sparse__table_8cpp.js b/d4/d96/range__queries_2sparse__table_8cpp.js deleted file mode 100644 index de5924584..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp.js +++ /dev/null @@ -1,7 +0,0 @@ -var range__queries_2sparse__table_8cpp = -[ - [ "buildTable", "d4/d96/range__queries_2sparse__table_8cpp.html#a803a2451e87021d14ae06f148383e6bc", null ], - [ "computeLogs", "d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300", null ], - [ "getMinimum", "d4/d96/range__queries_2sparse__table_8cpp.html#a932816c3de9e5ad122b180de60978e8f", null ], - [ "main", "d4/d96/range__queries_2sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] -]; \ No newline at end of file diff --git a/d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph.map b/d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph.map deleted file mode 100644 index f1e19e477..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph.map +++ /dev/null @@ -1,6 +0,0 @@ - - - - - - diff --git a/d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph.md5 b/d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph.md5 deleted file mode 100644 index ab904826f..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -9dd109d2dbbdfbf9fca953d193387d01 \ No newline at end of file diff --git a/d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph.svg b/d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph.svg deleted file mode 100644 index 3e4926e4a..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph.svg +++ /dev/null @@ -1,75 +0,0 @@ - - - - - - - - - - - - -range_queries::sparse_table::computeLogs - - -Node1 - - -range_queries::sparse -_table::computeLogs - - - - - -Node1->Node1 - - - - - - - - -Node2 - - -std::vector::size - - - - - -Node1->Node2 - - - - - - - - - - - - - diff --git a/d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph_org.svg b/d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph_org.svg deleted file mode 100644 index bad0a3c69..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph_org.svg +++ /dev/null @@ -1,49 +0,0 @@ - - - - - - -range_queries::sparse_table::computeLogs - - -Node1 - - -range_queries::sparse -_table::computeLogs - - - - - -Node1->Node1 - - - - - - - - -Node2 - - -std::vector::size - - - - - -Node1->Node2 - - - - - - - - diff --git a/d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph.map b/d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph.map deleted file mode 100644 index cd829963c..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph.map +++ /dev/null @@ -1,8 +0,0 @@ - - - - - - - - diff --git a/d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph.md5 b/d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph.md5 deleted file mode 100644 index e371614bd..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -98658f295d1efd86f8f71770745dd0ae \ No newline at end of file diff --git a/d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph.svg b/d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph.svg deleted file mode 100644 index 4a6782793..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph.svg +++ /dev/null @@ -1,93 +0,0 @@ - - - - - - - - - - - - -range_queries::sparse_table::buildTable - - -Node1 - - -range_queries::sparse -_table::buildTable - - - - - -Node1->Node1 - - - - - - - - -Node2 - - -std::min - - - - - -Node1->Node2 - - - - - - - - -Node3 - - -std::vector::size - - - - - -Node1->Node3 - - - - - - - - - - - - - diff --git a/d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph_org.svg b/d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph_org.svg deleted file mode 100644 index f97bad19e..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph_org.svg +++ /dev/null @@ -1,67 +0,0 @@ - - - - - - -range_queries::sparse_table::buildTable - - -Node1 - - -range_queries::sparse -_table::buildTable - - - - - -Node1->Node1 - - - - - - - - -Node2 - - -std::min - - - - - -Node1->Node2 - - - - - - - - -Node3 - - -std::vector::size - - - - - -Node1->Node3 - - - - - - - - diff --git a/d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph.map b/d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph.map deleted file mode 100644 index 0c22b7936..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph.map +++ /dev/null @@ -1,6 +0,0 @@ - - - - - - diff --git a/d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph.md5 b/d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph.md5 deleted file mode 100644 index cd450b70f..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -8d764f1bef624da5e58af0c896f208d5 \ No newline at end of file diff --git a/d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph.svg b/d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph.svg deleted file mode 100644 index 508e9fe43..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph.svg +++ /dev/null @@ -1,75 +0,0 @@ - - - - - - - - - - - - -range_queries::sparse_table::getMinimum - - -Node1 - - -range_queries::sparse -_table::getMinimum - - - - - -Node1->Node1 - - - - - - - - -Node2 - - -std::min - - - - - -Node1->Node2 - - - - - - - - - - - - - diff --git a/d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph_org.svg b/d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph_org.svg deleted file mode 100644 index cfff369e4..000000000 --- a/d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph_org.svg +++ /dev/null @@ -1,49 +0,0 @@ - - - - - - -range_queries::sparse_table::getMinimum - - -Node1 - - -range_queries::sparse -_table::getMinimum - - - - - -Node1->Node1 - - - - - - - - -Node2 - - -std::min - - - - - -Node1->Node2 - - - - - - - - diff --git a/db/dca/kadane2_8cpp.html b/d4/da0/kadane_8cpp.html similarity index 91% rename from db/dca/kadane2_8cpp.html rename to d4/da0/kadane_8cpp.html index 5bfd4e938..3b5feb12d 100644 --- a/db/dca/kadane2_8cpp.html +++ b/d4/da0/kadane_8cpp.html @@ -5,7 +5,7 @@ -Algorithms_in_C++: dynamic_programming/kadane2.cpp File Reference +Algorithms_in_C++: dynamic_programming/kadane.cpp File Reference @@ -78,7 +78,7 @@ $(function() {
@@ -107,7 +107,7 @@ $(function(){initNavTree('db/dca/kadane2_8cpp.html','../../'); initResizable(tru
Namespaces | Functions
-
kadane2.cpp File Reference
+
kadane.cpp File Reference
@@ -117,9 +117,9 @@ $(function(){initNavTree('db/dca/kadane2_8cpp.html','../../'); initResizable(tru #include <climits>
#include <iostream>
-Include dependency graph for kadane2.cpp:
+Include dependency graph for kadane.cpp:
-
+

@@ -167,7 +167,7 @@ Algorithm

Main function.

Returns
0 on exit
60 {
-
61 const int N = 5;
+
61 const int N = 5;
62 std::array<int, N> n{}; // declaring array
63 // taking values of elements from user
64 for (int i = 0; i < n.size(); i++) {
@@ -184,7 +184,7 @@ Algorithm -
data_structures::sparse_table::N
constexpr uint32_t N
A struct to represent sparse table for min() as their invariant function, for the given array A....
Definition sparse_table.cpp:48
+
data_structures::sparse_table::N
constexpr uint32_t N
A struct to represent sparse table for min() as their invariant function, for the given array A....
Definition sparse_table.cpp:48
@@ -234,7 +234,7 @@ template<size_t N>
Here is the call graph for this function:
-
+
@@ -244,7 +244,7 @@ Here is the call graph for this function: diff --git a/d4/da0/kadane_8cpp.js b/d4/da0/kadane_8cpp.js new file mode 100644 index 000000000..bc0736467 --- /dev/null +++ b/d4/da0/kadane_8cpp.js @@ -0,0 +1,5 @@ +var kadane_8cpp = +[ + [ "main", "d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "maxSubArray", "d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4", null ] +]; \ No newline at end of file diff --git a/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.map b/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.map similarity index 100% rename from db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.map rename to d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.map diff --git a/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.md5 b/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.md5 similarity index 100% rename from db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.md5 rename to d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.md5 diff --git a/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg b/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg similarity index 100% rename from db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg rename to d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg diff --git a/db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph_org.svg b/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph_org.svg similarity index 100% rename from db/dca/kadane2_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph_org.svg rename to d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph_org.svg diff --git a/d4/dd7/house__robber_8cpp__incl.map b/d4/dd7/house__robber_8cpp__incl.map index 15853063f..5725a006a 100644 --- a/d4/dd7/house__robber_8cpp__incl.map +++ b/d4/dd7/house__robber_8cpp__incl.map @@ -1,11 +1,13 @@ - + - + - - - - - + + + + + + + diff --git a/d4/dd7/house__robber_8cpp__incl.md5 b/d4/dd7/house__robber_8cpp__incl.md5 index 32b067823..9509470ea 100644 --- a/d4/dd7/house__robber_8cpp__incl.md5 +++ b/d4/dd7/house__robber_8cpp__incl.md5 @@ -1 +1 @@ -58370627a53ec42f06fe817c7591cb43 \ No newline at end of file +179733e96c0e668d3df1b8df8ea8ec06 \ No newline at end of file diff --git a/d4/dd7/house__robber_8cpp__incl.svg b/d4/dd7/house__robber_8cpp__incl.svg index eaf66feb7..2062301ba 100644 --- a/d4/dd7/house__robber_8cpp__incl.svg +++ b/d4/dd7/house__robber_8cpp__incl.svg @@ -4,8 +4,8 @@ - + @@ -23,9 +23,9 @@ Node1 - -dynamic_programming -/house_robber.cpp + +dynamic_programming +/house_robber.cpp @@ -42,8 +42,8 @@ Node1->Node2 - - + + @@ -60,8 +60,8 @@ Node1->Node3 - - + + @@ -69,8 +69,8 @@ Node4 - -iostream + +cstdint @@ -78,8 +78,8 @@ Node1->Node4 - - + + @@ -87,8 +87,8 @@ Node5 - -vector + +iostream @@ -96,8 +96,26 @@ Node1->Node5 - - + + + + + + + +Node6 + + +vector + + + + + +Node1->Node6 + + + diff --git a/d4/dd7/house__robber_8cpp__incl_org.svg b/d4/dd7/house__robber_8cpp__incl_org.svg index 2c163e513..557815b8d 100644 --- a/d4/dd7/house__robber_8cpp__incl_org.svg +++ b/d4/dd7/house__robber_8cpp__incl_org.svg @@ -4,17 +4,17 @@ - + dynamic_programming/house_robber.cpp Node1 - -dynamic_programming -/house_robber.cpp + +dynamic_programming +/house_robber.cpp @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -49,8 +49,8 @@ Node1->Node3 - - + + @@ -58,8 +58,8 @@ Node4 - -iostream + +cstdint @@ -67,8 +67,8 @@ Node1->Node4 - - + + @@ -76,8 +76,8 @@ Node5 - -vector + +iostream @@ -85,8 +85,26 @@ Node1->Node5 - - + + + + + + + +Node6 + + +vector + + + + + +Node1->Node6 + + + diff --git a/d4/def/kohonen__som__topology_8cpp.html b/d4/def/kohonen__som__topology_8cpp.html index f54577003..d115c042b 100644 --- a/d4/def/kohonen__som__topology_8cpp.html +++ b/d4/def/kohonen__som__topology_8cpp.html @@ -303,7 +303,7 @@ Here is the call graph for this function:
  • w12.csv: trained SOM map
    • 369 {
    -
    370 int j = 0, N = 300;
    +
    370 int j = 0, N = 300;
    371 int features = 2;
    372 int num_out = 30;
    373 std::vector<std::valarray<double>> X(N);
    @@ -335,11 +335,11 @@ Here is the call graph for this function:
    399 save_u_matrix("w12.csv", W); // save the resultant weights
    400}
    numerical_methods::simpson_method::k
    double k(double x)
    Another test function.
    Definition composite_simpson_rule.cpp:117
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    save_2d_data
    int save_2d_data(const char *fname, const std::vector< std::valarray< double > > &X)
    Definition kohonen_som_topology.cpp:65
    _random
    double _random(double a, double b)
    Definition kohonen_som_topology.cpp:53
    test_2d_classes
    void test_2d_classes(std::vector< std::valarray< double > > *data)
    Definition kohonen_som_topology.cpp:330
    std::max
    T max(T... args)
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    @@ -370,7 +370,7 @@ Here is the call graph for this function:
  • w22.csv: trained SOM map
    • 451 {
    -
    452 int j = 0, N = 300;
    +
    452 int j = 0, N = 300;
    453 int features = 3;
    454 int num_out = 30;
    455 std::vector<std::valarray<double>> X(N);
    @@ -430,7 +430,7 @@ Here is the call graph for this function:
  • w32.csv: trained SOM map
    • 537 {
    -
    538 int j = 0, N = 500;
    +
    538 int j = 0, N = 500;
    539 int features = 3;
    540 int num_out = 30;
    541 std::vector<std::valarray<double>> X(N);
    @@ -497,7 +497,7 @@ Here is the call graph for this function:
    330 {
    -
    331 const int N = data->size();
    +
    331 const int N = data->size();
    332 const double R = 0.3; // radius of cluster
    333 int i = 0;
    334 const int num_classes = 4;
    @@ -512,7 +512,7 @@ Here is the call graph for this function:
    343#ifdef _OPENMP
    344#pragma omp for
    345#endif
    -
    346 for (i = 0; i < N; i++) {
    +
    346 for (i = 0; i < N; i++) {
    347 // select a random class for the point
    348 int cls = std::rand() % num_classes;
    349
    @@ -564,7 +564,7 @@ Here is the call graph for this function:
    411 {
    -
    412 const size_t N = data->size();
    +
    412 const size_t N = data->size();
    413 const double R = 0.3; // radius of cluster
    414 int i = 0;
    415 const int num_classes = 4;
    @@ -579,7 +579,7 @@ Here is the call graph for this function:
    424#ifdef _OPENMP
    425#pragma omp for
    426#endif
    -
    427 for (i = 0; i < N; i++) {
    +
    427 for (i = 0; i < N; i++) {
    428 // select a random class for the point
    429 int cls = std::rand() % num_classes;
    430
    @@ -629,7 +629,7 @@ Here is the call graph for this function:
    493 {
    -
    494 const size_t N = data->size();
    +
    494 const size_t N = data->size();
    495 const double R = 0.2; // radius of cluster
    496 int i = 0;
    497 const int num_classes = 8;
    @@ -648,7 +648,7 @@ Here is the call graph for this function:
    510#ifdef _OPENMP
    511#pragma omp for
    512#endif
    -
    513 for (i = 0; i < N; i++) {
    +
    513 for (i = 0; i < N; i++) {
    514 // select a random class for the point
    515 int cls = std::rand() % num_classes;
    516
    diff --git a/d4/df4/trie__multiple__search_8cpp__incl.map b/d4/df4/trie__multiple__search_8cpp__incl.map index e5d89a0ac..492a22072 100644 --- a/d4/df4/trie__multiple__search_8cpp__incl.map +++ b/d4/df4/trie__multiple__search_8cpp__incl.map @@ -1,15 +1,17 @@ - + - + - + - + - - - - - + + + + + + + diff --git a/d4/df4/trie__multiple__search_8cpp__incl.md5 b/d4/df4/trie__multiple__search_8cpp__incl.md5 index 582a5b41c..66e36696e 100644 --- a/d4/df4/trie__multiple__search_8cpp__incl.md5 +++ b/d4/df4/trie__multiple__search_8cpp__incl.md5 @@ -1 +1 @@ -7faf370a84d664eb2e7390db0276959b \ No newline at end of file +bd655c6b8b4d8e7bd95e834de8c7ad00 \ No newline at end of file diff --git a/d4/df4/trie__multiple__search_8cpp__incl.svg b/d4/df4/trie__multiple__search_8cpp__incl.svg index 9dfe73341..484bbafdb 100644 --- a/d4/df4/trie__multiple__search_8cpp__incl.svg +++ b/d4/df4/trie__multiple__search_8cpp__incl.svg @@ -4,8 +4,8 @@ - + @@ -23,9 +23,9 @@ Node1 - -operations_on_datastructures -/trie_multiple_search.cpp + +operations_on_datastructures +/trie_multiple_search.cpp @@ -42,8 +42,8 @@ Node1->Node2 - - + + @@ -60,8 +60,8 @@ Node1->Node3 - - + + @@ -78,8 +78,8 @@ Node1->Node4 - - + + @@ -88,7 +88,7 @@ Node5 -cstring +cstdint @@ -96,8 +96,8 @@ Node1->Node5 - - + + @@ -105,8 +105,8 @@ Node6 - -iostream + +cstring @@ -114,8 +114,8 @@ Node1->Node6 - - + + @@ -123,8 +123,8 @@ Node7 - -queue + +iostream @@ -132,8 +132,26 @@ Node1->Node7 - - + + + + + + + +Node8 + + +queue + + + + + +Node1->Node8 + + + diff --git a/d4/df4/trie__multiple__search_8cpp__incl_org.svg b/d4/df4/trie__multiple__search_8cpp__incl_org.svg index faddf833c..c995cebc5 100644 --- a/d4/df4/trie__multiple__search_8cpp__incl_org.svg +++ b/d4/df4/trie__multiple__search_8cpp__incl_org.svg @@ -4,17 +4,17 @@ - + operations_on_datastructures/trie_multiple_search.cpp Node1 - -operations_on_datastructures -/trie_multiple_search.cpp + +operations_on_datastructures +/trie_multiple_search.cpp @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -49,8 +49,8 @@ Node1->Node3 - - + + @@ -67,8 +67,8 @@ Node1->Node4 - - + + @@ -77,7 +77,7 @@ Node5 -cstring +cstdint @@ -85,8 +85,8 @@ Node1->Node5 - - + + @@ -94,8 +94,8 @@ Node6 - -iostream + +cstring @@ -103,8 +103,8 @@ Node1->Node6 - - + + @@ -112,8 +112,8 @@ Node7 - -queue + +iostream @@ -121,8 +121,26 @@ Node1->Node7 - - + + + + + + + +Node8 + + +queue + + + + + +Node1->Node8 + + + diff --git a/d5/db0/adaline__learning_8cpp.html b/d5/db0/adaline__learning_8cpp.html index d41e0c847..12c6ea2aa 100644 --- a/d5/db0/adaline__learning_8cpp.html +++ b/d5/db0/adaline__learning_8cpp.html @@ -249,9 +249,9 @@ Here is the call graph for this function:
    224 {
    225 adaline ada(2, eta); // 2 features
    226
    -
    227 const int N = 10; // number of sample points
    +
    227 const int N = 10; // number of sample points
    228
    -
    229 std::array<std::vector<double>, N> X = {
    +
    229 std::array<std::vector<double>, N> X = {
    230 std::vector<double>({0, 1}), std::vector<double>({1, -2}),
    231 std::vector<double>({2, 3}), std::vector<double>({3, -1}),
    232 std::vector<double>({4, 1}), std::vector<double>({6, -5}),
    @@ -263,7 +263,7 @@ Here is the call graph for this function:
    238 std::cout << "------- Test 1 -------" << std::endl;
    239 std::cout << "Model before fit: " << ada << std::endl;
    240
    -
    241 ada.fit<N>(X, y);
    +
    241 ada.fit<N>(X, y);
    242 std::cout << "Model after fit: " << ada << std::endl;
    243
    244 int predict = ada.predict({5, -3});
    @@ -278,7 +278,7 @@ Here is the call graph for this function:
    253}
    machine_learning::adaline
    Definition adaline_learning.cpp:46
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    Here is the call graph for this function:
    @@ -311,16 +311,16 @@ Here is the call graph for this function:
    262 {
    263 adaline ada(2, eta); // 2 features
    264
    -
    265 const int N = 50; // number of sample points
    +
    265 const int N = 50; // number of sample points
    266
    -
    267 std::array<std::vector<double>, N> X;
    +
    267 std::array<std::vector<double>, N> X;
    268 std::array<int, N> Y{}; // corresponding y-values
    269
    270 // generate sample points in the interval
    271 // [-range2/100 , (range2-1)/100]
    272 int range = 500; // sample points full-range
    273 int range2 = range >> 1; // sample points half-range
    -
    274 for (int i = 0; i < N; i++) {
    +
    274 for (int i = 0; i < N; i++) {
    275 double x0 = (static_cast<double>(std::rand() % range) - range2) / 100.f;
    276 double x1 = (static_cast<double>(std::rand() % range) - range2) / 100.f;
    277 X[i] = std::vector<double>({x0, x1});
    @@ -380,16 +380,16 @@ Here is the call graph for this function:
    313 {
    314 adaline ada(6, eta); // 2 features
    315
    -
    316 const int N = 100; // number of sample points
    +
    316 const int N = 100; // number of sample points
    317
    -
    318 std::array<std::vector<double>, N> X;
    +
    318 std::array<std::vector<double>, N> X;
    319 std::array<int, N> Y{}; // corresponding y-values
    320
    321 // generate sample points in the interval
    322 // [-range2/100 , (range2-1)/100]
    323 int range = 200; // sample points full-range
    324 int range2 = range >> 1; // sample points half-range
    -
    325 for (int i = 0; i < N; i++) {
    +
    325 for (int i = 0; i < N; i++) {
    326 double x0 = (static_cast<double>(std::rand() % range) - range2) / 100.f;
    327 double x1 = (static_cast<double>(std::rand() % range) - range2) / 100.f;
    328 double x2 = (static_cast<double>(std::rand() % range) - range2) / 100.f;
    diff --git a/d5/db5/set__kth__bit_8cpp.html b/d5/db5/set__kth__bit_8cpp.html index fc0988f04..444ac2a89 100644 --- a/d5/db5/set__kth__bit_8cpp.html +++ b/d5/db5/set__kth__bit_8cpp.html @@ -213,11 +213,11 @@ Here is the call graph for this function:
    48 1 << k; // "pos" variable is used to store 1 at kth postion and
    49 // rest bits are 0. in binary representation of number 'n'
    50
    -
    51 return N | pos; // by taking or with the pos and the N we set the bit of N
    +
    51 return N | pos; // by taking or with the pos and the N we set the bit of N
    52 // at kth position.
    53}
    numerical_methods::simpson_method::k
    double k(double x)
    Another test function.
    Definition composite_simpson_rule.cpp:117
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    diff --git a/d6/d10/cut__rod_8cpp.html b/d6/d10/cut__rod_8cpp.html index 99b61e0a2..f24a72273 100644 --- a/d6/d10/cut__rod_8cpp.html +++ b/d6/d10/cut__rod_8cpp.html @@ -116,11 +116,12 @@ $(function(){initNavTree('d6/d10/cut__rod_8cpp.html','../../'); initResizable(tr
    #include <array>
    #include <cassert>
    #include <climits>
    +#include <cstdint>
    #include <iostream>
    Include dependency graph for cut_rod.cpp:
    -
    +

    @@ -172,12 +173,12 @@ Algorithm

    Main function.

    Returns
    0 on exit
    -
    110 {
    -
    111 // Testing
    -
    112 test();
    -
    113 return 0;
    -
    114}
    -
    test
    static void test()
    Function to test above algorithm.
    Definition cut_rod.cpp:71
    +
    111 {
    +
    112 // Testing
    +
    113 test();
    +
    114 return 0;
    +
    115}
    +
    test
    static void test()
    Function to test above algorithm.
    Definition cut_rod.cpp:72
    Here is the call graph for this function:
    @@ -228,26 +229,26 @@ template<size_t T>
    -
    44 {
    -
    45 int *profit =
    -
    46 new int[n + 1]; // profit[i] will hold maximum profit for i inch rod
    -
    47
    -
    48 profit[0] = 0; // if length of rod is zero, then no profit
    -
    49
    -
    50 // outer loop will select size of rod, starting from 1 inch to n inch rod.
    -
    51 // inner loop will evaluate the maximum profit we can get for i inch rod by
    -
    52 // making every possible cut on it and will store it in profit[i].
    -
    53 for (size_t i = 1; i <= n; i++) {
    -
    54 int q = INT_MIN;
    -
    55 for (size_t j = 1; j <= i; j++) {
    -
    56 q = std::max(q, price[j - 1] + profit[i - j]);
    -
    57 }
    -
    58 profit[i] = q;
    -
    59 }
    -
    60 const int16_t ans = profit[n];
    -
    61 delete[] profit;
    -
    62 return ans; // returning maximum profit
    -
    63}
    +
    45 {
    +
    46 int *profit =
    +
    47 new int[n + 1]; // profit[i] will hold maximum profit for i inch rod
    +
    48
    +
    49 profit[0] = 0; // if length of rod is zero, then no profit
    +
    50
    +
    51 // outer loop will select size of rod, starting from 1 inch to n inch rod.
    +
    52 // inner loop will evaluate the maximum profit we can get for i inch rod by
    +
    53 // making every possible cut on it and will store it in profit[i].
    +
    54 for (size_t i = 1; i <= n; i++) {
    +
    55 int q = INT_MIN;
    +
    56 for (size_t j = 1; j <= i; j++) {
    +
    57 q = std::max(q, price[j - 1] + profit[i - j]);
    +
    58 }
    +
    59 profit[i] = q;
    +
    60 }
    +
    61 const int16_t ans = profit[n];
    +
    62 delete[] profit;
    +
    63 return ans; // returning maximum profit
    +
    64}
    std::max
    T max(T... args)
    Here is the call graph for this function:
    @@ -282,43 +283,43 @@ Here is the call graph for this function:

    Function to test above algorithm.

    Returns
    void
    -
    71 {
    -
    72 // Test 1
    -
    73 const int16_t n1 = 8; // size of rod
    -
    74 std::array<int32_t, n1> price1 = {1,2,4,6,8,45,21,9}; // price array
    -
    75 const int64_t max_profit1 =
    -
    76 dynamic_programming::cut_rod::maxProfitByCuttingRod(price1, n1);
    -
    77 const int64_t expected_max_profit1 = 47;
    -
    78 assert(max_profit1 == expected_max_profit1);
    -
    79 std::cout << "Maximum profit with " << n1 << " inch road is " << max_profit1
    -
    80 << std::endl;
    -
    81
    -
    82 // Test 2
    -
    83 const int16_t n2 = 30; // size of rod
    -
    84 std::array<int32_t, n2> price2 = {
    -
    85 1, 5, 8, 9, 10, 17, 17, 20, 24, 30, // price array
    -
    86 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
    -
    87 41, 42, 43, 44, 45, 46, 47, 48, 49, 50};
    -
    88
    -
    89 const int64_t max_profit2=
    -
    90 dynamic_programming::cut_rod::maxProfitByCuttingRod(price2, n2);
    -
    91 const int32_t expected_max_profit2 = 90;
    -
    92 assert(max_profit2 == expected_max_profit2);
    -
    93 std::cout << "Maximum profit with " << n2 << " inch road is " << max_profit2
    -
    94 << std::endl;
    -
    95 // Test 3
    -
    96 const int16_t n3 = 5; // size of rod
    -
    97 std::array<int32_t, n3> price3 = {2,9,17,23,45}; // price array
    -
    98 const int64_t max_profit3 =
    -
    99 dynamic_programming::cut_rod::maxProfitByCuttingRod(price3, n3);
    -
    100 const int64_t expected_max_profit3 = 45;
    -
    101 assert(max_profit3 == expected_max_profit3);
    -
    102 std::cout << "Maximum profit with " << n3 << " inch road is " << max_profit3
    -
    103 << std::endl;
    -
    104}
    +
    72 {
    +
    73 // Test 1
    +
    74 const int16_t n1 = 8; // size of rod
    +
    75 std::array<int32_t, n1> price1 = {1, 2, 4, 6, 8, 45, 21, 9}; // price array
    +
    76 const int64_t max_profit1 =
    +
    77 dynamic_programming::cut_rod::maxProfitByCuttingRod(price1, n1);
    +
    78 const int64_t expected_max_profit1 = 47;
    +
    79 assert(max_profit1 == expected_max_profit1);
    +
    80 std::cout << "Maximum profit with " << n1 << " inch road is " << max_profit1
    +
    81 << std::endl;
    +
    82
    +
    83 // Test 2
    +
    84 const int16_t n2 = 30; // size of rod
    +
    85 std::array<int32_t, n2> price2 = {
    +
    86 1, 5, 8, 9, 10, 17, 17, 20, 24, 30, // price array
    +
    87 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
    +
    88 41, 42, 43, 44, 45, 46, 47, 48, 49, 50};
    +
    89
    +
    90 const int64_t max_profit2 =
    +
    91 dynamic_programming::cut_rod::maxProfitByCuttingRod(price2, n2);
    +
    92 const int32_t expected_max_profit2 = 90;
    +
    93 assert(max_profit2 == expected_max_profit2);
    +
    94 std::cout << "Maximum profit with " << n2 << " inch road is " << max_profit2
    +
    95 << std::endl;
    +
    96 // Test 3
    +
    97 const int16_t n3 = 5; // size of rod
    +
    98 std::array<int32_t, n3> price3 = {2, 9, 17, 23, 45}; // price array
    +
    99 const int64_t max_profit3 =
    +
    100 dynamic_programming::cut_rod::maxProfitByCuttingRod(price3, n3);
    +
    101 const int64_t expected_max_profit3 = 45;
    +
    102 assert(max_profit3 == expected_max_profit3);
    +
    103 std::cout << "Maximum profit with " << n3 << " inch road is " << max_profit3
    +
    104 << std::endl;
    +
    105}
    -
    dynamic_programming::cut_rod::maxProfitByCuttingRod
    int maxProfitByCuttingRod(const std::array< int, T > &price, const uint64_t &n)
    Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.
    Definition cut_rod.cpp:44
    +
    dynamic_programming::cut_rod::maxProfitByCuttingRod
    int maxProfitByCuttingRod(const std::array< int, T > &price, const uint64_t &n)
    Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.
    Definition cut_rod.cpp:45
    std::endl
    T endl(T... args)
    Here is the call graph for this function:
    diff --git a/d6/d26/classciphers_1_1_hill_cipher.html b/d6/d26/classciphers_1_1_hill_cipher.html index 0dfa2f05f..0ab010bd9 100644 --- a/d6/d26/classciphers_1_1_hill_cipher.html +++ b/d6/d26/classciphers_1_1_hill_cipher.html @@ -749,11 +749,11 @@ template<typename T >

    Get matrix inverse using Row-transformations. Given matrix must be a square and non-singular.

    Returns
    inverse matrix
    251 {
    252 // Assuming A is square matrix
    -
    253 size_t N = A.size();
    +
    253 size_t N = A.size();
    254
    255 matrix<double> inverse(N, std::valarray<double>(N));
    -
    256 for (size_t row = 0; row < N; row++) {
    -
    257 for (size_t col = 0; col < N; col++) {
    +
    256 for (size_t row = 0; row < N; row++) {
    +
    257 for (size_t col = 0; col < N; col++) {
    258 // create identity matrix
    259 inverse[row][col] = (row == col) ? 1.f : 0.f;
    260 }
    @@ -766,22 +766,22 @@ template<typename T >
    267
    268 // preallocate a temporary matrix identical to A
    269 matrix<double> temp(N, std::valarray<double>(N));
    -
    270 for (size_t row = 0; row < N; row++) {
    -
    271 for (size_t col = 0; col < N; col++)
    +
    270 for (size_t row = 0; row < N; row++) {
    +
    271 for (size_t col = 0; col < N; col++)
    272 temp[row][col] = static_cast<double>(A[row][col]);
    273 }
    274
    275 // start transformations
    -
    276 for (size_t row = 0; row < N; row++) {
    -
    277 for (size_t row2 = row; row2 < N && temp[row][row] == 0; row2++) {
    +
    276 for (size_t row = 0; row < N; row++) {
    +
    277 for (size_t row2 = row; row2 < N && temp[row][row] == 0; row2++) {
    278 // this to ensure diagonal elements are not 0
    279 temp[row] = temp[row] + temp[row2];
    280 inverse[row] = inverse[row] + inverse[row2];
    281 }
    282
    -
    283 for (size_t col2 = row; col2 < N && temp[row][row] == 0; col2++) {
    +
    283 for (size_t col2 = row; col2 < N && temp[row][row] == 0; col2++) {
    284 // this to further ensure diagonal elements are not 0
    -
    285 for (size_t row2 = 0; row2 < N; row2++) {
    +
    285 for (size_t row2 = 0; row2 < N; row2++) {
    286 temp[row2][row] = temp[row2][row] + temp[row2][col2];
    287 inverse[row2][row] =
    288 inverse[row2][row] + inverse[row2][col2];
    @@ -799,7 +799,7 @@ template<typename T >
    300 temp[row] = temp[row] / divisor;
    301 inverse[row] = inverse[row] / divisor;
    302 // Row transformations
    -
    303 for (size_t row2 = 0; row2 < N; row2++) {
    +
    303 for (size_t row2 = 0; row2 < N; row2++) {
    304 if (row2 == row)
    305 continue;
    306 double factor = temp[row2][row];
    @@ -810,8 +810,8 @@ template<typename T >
    311
    312 return inverse;
    313 }
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    std::endl
    T endl(T... args)
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    Here is the call graph for this function:
    @@ -967,15 +967,15 @@ template<typename T1 , typename T2 >
    Returns
    determinant of generated random matrix
    Warning
    There will need to be a balance between the matrix size and the range of random numbers. If the matrix is large, the range of random numbers must be small to have a well defined keys. Or if the matrix is smaller, the random numbers range can be larger. For an 8x8 matrix, range should be no more than \([0,10]\)
    119 {
    -
    120 for (size_t i = 0; i < M->size(); i++) {
    -
    121 for (size_t j = 0; j < M[0][0].size(); j++) {
    -
    122 M[0][i][j] = rand_range<T1, T2>(a, b);
    +
    120 for (size_t i = 0; i < M->size(); i++) {
    +
    121 for (size_t j = 0; j < M[0][0].size(); j++) {
    +
    122 M[0][i][j] = rand_range<T1, T2>(a, b);
    123 }
    124 }
    125
    126 return determinant_lu(*M);
    127 }
    -
    data_structures::sparse_table::M
    constexpr uint8_t M
    ceil(log2(N)).
    Definition sparse_table.cpp:49
    +
    data_structures::sparse_table::M
    constexpr uint8_t M
    ceil(log2(N)).
    Definition sparse_table.cpp:49
    Here is the call graph for this function:
    diff --git a/d6/d26/house__robber_8cpp.html b/d6/d26/house__robber_8cpp.html index c26795fcb..b617cb1a7 100644 --- a/d6/d26/house__robber_8cpp.html +++ b/d6/d26/house__robber_8cpp.html @@ -115,12 +115,13 @@ $(function(){initNavTree('d6/d26/house__robber_8cpp.html','../../'); initResizab More...

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

    diff --git a/d6/d30/classmachine__learning_1_1adaline.html b/d6/d30/classmachine__learning_1_1adaline.html index 0fd79e276..0669207cd 100644 --- a/d6/d30/classmachine__learning_1_1adaline.html +++ b/d6/d30/classmachine__learning_1_1adaline.html @@ -426,11 +426,11 @@ template<size_t N>
    152 avg_pred_error = 0.f;
    153
    154 // perform fit for each sample
    -
    155 for (int i = 0; i < N; i++) {
    +
    155 for (int i = 0; i < N; i++) {
    156 double err = fit(X[i], Y[i]);
    157 avg_pred_error += std::abs(err);
    158 }
    -
    159 avg_pred_error /= N;
    +
    159 avg_pred_error /= N;
    160
    161 // Print updates every 200th iteration
    162 // if (iter % 100 == 0)
    @@ -447,8 +447,8 @@ template<size_t N>
    173 }
    174 }
    machine_learning::adaline::fit
    double fit(const std::vector< double > &x, const int &y)
    Definition adaline_learning.cpp:119
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    MAX_ITER
    constexpr int MAX_ITER
    Definition adaline_learning.cpp:40
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    Here is the call graph for this function:
    diff --git a/d6/d42/data__structures_2sparse__table_8cpp.js b/d6/d42/data__structures_2sparse__table_8cpp.js deleted file mode 100644 index 6c53585f6..000000000 --- a/d6/d42/data__structures_2sparse__table_8cpp.js +++ /dev/null @@ -1,8 +0,0 @@ -var data__structures_2sparse__table_8cpp = -[ - [ "data_structures::sparse_table::Sparse_table", "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html", "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table" ], - [ "main", "d6/d42/data__structures_2sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], - [ "test", "d6/d42/data__structures_2sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ], - [ "M", "d6/d42/data__structures_2sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e", null ], - [ "N", "d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d", null ] -]; \ No newline at end of file diff --git a/d6/d42/data__structures_2sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d6/d42/data__structures_2sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 deleted file mode 100644 index 87db03cb0..000000000 --- a/d6/d42/data__structures_2sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -a17bd8492d565aaf305db600ec5f9464 \ No newline at end of file diff --git a/d6/d75/catalan__numbers_8cpp__incl.map b/d6/d75/catalan__numbers_8cpp__incl.map index 6779b977b..48d3336c4 100644 --- a/d6/d75/catalan__numbers_8cpp__incl.map +++ b/d6/d75/catalan__numbers_8cpp__incl.map @@ -1,13 +1,15 @@ - + - + - + - - - - - + + + + + + + diff --git a/d6/d75/catalan__numbers_8cpp__incl.md5 b/d6/d75/catalan__numbers_8cpp__incl.md5 index 76e6ce1b1..3470a10d8 100644 --- a/d6/d75/catalan__numbers_8cpp__incl.md5 +++ b/d6/d75/catalan__numbers_8cpp__incl.md5 @@ -1 +1 @@ -22dc578df950d01f98750a5fa846aa7c \ No newline at end of file +7359691ff377a52b33b24cf28c02dfab \ No newline at end of file diff --git a/d6/d75/catalan__numbers_8cpp__incl.svg b/d6/d75/catalan__numbers_8cpp__incl.svg index 5b6d86095..f15d2e014 100644 --- a/d6/d75/catalan__numbers_8cpp__incl.svg +++ b/d6/d75/catalan__numbers_8cpp__incl.svg @@ -4,8 +4,8 @@ - + @@ -23,9 +23,9 @@ Node1 - -dynamic_programming -/catalan_numbers.cpp + +dynamic_programming +/catalan_numbers.cpp @@ -42,8 +42,8 @@ Node1->Node2 - - + + @@ -60,8 +60,8 @@ Node1->Node3 - - + + @@ -78,8 +78,8 @@ Node1->Node4 - - + + @@ -87,8 +87,8 @@ Node5 - -numeric + +functional @@ -96,8 +96,8 @@ Node1->Node5 - - + + @@ -105,8 +105,8 @@ Node6 - -vector + +numeric @@ -114,8 +114,26 @@ Node1->Node6 - - + + + + + + + +Node7 + + +vector + + + + + +Node1->Node7 + + + diff --git a/d6/d75/catalan__numbers_8cpp__incl_org.svg b/d6/d75/catalan__numbers_8cpp__incl_org.svg index fd8e6bbdb..3f6e438c1 100644 --- a/d6/d75/catalan__numbers_8cpp__incl_org.svg +++ b/d6/d75/catalan__numbers_8cpp__incl_org.svg @@ -4,17 +4,17 @@ - + dynamic_programming/catalan_numbers.cpp Node1 - -dynamic_programming -/catalan_numbers.cpp + +dynamic_programming +/catalan_numbers.cpp @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -49,8 +49,8 @@ Node1->Node3 - - + + @@ -67,8 +67,8 @@ Node1->Node4 - - + + @@ -76,8 +76,8 @@ Node5 - -numeric + +functional @@ -85,8 +85,8 @@ Node1->Node5 - - + + @@ -94,8 +94,8 @@ Node6 - -vector + +numeric @@ -103,8 +103,26 @@ Node1->Node6 - - + + + + + + + +Node7 + + +vector + + + + + +Node1->Node7 + + + diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp.js b/d6/d80/dynamic__programming_2subset__sum_8cpp.js deleted file mode 100644 index d913d7a7e..000000000 --- a/d6/d80/dynamic__programming_2subset__sum_8cpp.js +++ /dev/null @@ -1,7 +0,0 @@ -var dynamic__programming_2subset__sum_8cpp = -[ - [ "main", "d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], - [ "subset_sum_problem", "d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50", null ], - [ "subset_sum_recursion", "d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607", null ], - [ "test", "d6/d80/dynamic__programming_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] -]; \ No newline at end of file diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.md5 b/d6/d80/dynamic__programming_2subset__sum_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.md5 deleted file mode 100644 index da8b3d26b..000000000 --- a/d6/d80/dynamic__programming_2subset__sum_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -070e9da9f48977b37a41f9f6d658adc6 \ No newline at end of file diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d80/dynamic__programming_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 deleted file mode 100644 index 389f9907e..000000000 --- a/d6/d80/dynamic__programming_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -01c94973a9e67ee0738ed591bd43bb2e \ No newline at end of file diff --git a/d6/d9d/large__factorial_8cpp.html b/d6/d9d/large__factorial_8cpp.html index fbfddf665..1bd3f4218 100644 --- a/d6/d9d/large__factorial_8cpp.html +++ b/d6/d9d/large__factorial_8cpp.html @@ -235,8 +235,8 @@ Here is the call graph for this function:
    30 return false;
    31 }
    32
    -
    33 const size_t N = result.num_digits();
    -
    34 for (i = 0; i < N; i++) {
    +
    33 const size_t N = result.num_digits();
    +
    34 for (i = 0; i < N; i++) {
    35 if (known_reslt[i] != result.digit_char(i)) {
    36 std::cerr << i << "^th digit mismatch! " << known_reslt[i]
    37 << " != " << result.digit_char(i) << std::endl;
    @@ -247,7 +247,7 @@ Here is the call graph for this function:
    42 std::cout << "Passed!" << std::endl;
    43 return true;
    44}
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    std::strlen
    T strlen(T... args)
    Here is the call graph for this function:
    @@ -294,8 +294,8 @@ Here is the call graph for this function:
    70 return false;
    71 }
    72
    -
    73 const size_t N = result.num_digits();
    -
    74 for (i = 0; i < N; i++) {
    +
    73 const size_t N = result.num_digits();
    +
    74 for (i = 0; i < N; i++) {
    75 if (known_reslt[i] != result.digit_char(i)) {
    76 std::cerr << i << "^th digit mismatch! " << known_reslt[i]
    77 << " != " << result.digit_char(i) << std::endl;
    diff --git a/d7/d1e/graph_2dijkstra_8cpp.js b/d7/d1e/graph_2dijkstra_8cpp.js deleted file mode 100644 index 5beb70f6d..000000000 --- a/d7/d1e/graph_2dijkstra_8cpp.js +++ /dev/null @@ -1,7 +0,0 @@ -var graph_2dijkstra_8cpp = -[ - [ "addEdge", "d7/d1e/graph_2dijkstra_8cpp.html#a0e30e0dca68cb6e4f671440819b35b6a", null ], - [ "dijkstra", "d7/d1e/graph_2dijkstra_8cpp.html#adc68cbc8ba09eb1142265935c0d45b84", null ], - [ "main", "d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], - [ "tests", "d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9", null ] -]; \ No newline at end of file diff --git a/d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 deleted file mode 100644 index 85fdfd99b..000000000 --- a/d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -6e34c783557a2008eb99d9a45eab826e \ No newline at end of file diff --git a/d8/d58/kadane2_8cpp__incl.map b/d7/d53/kadane_8cpp__incl.map similarity index 89% rename from d8/d58/kadane2_8cpp__incl.map rename to d7/d53/kadane_8cpp__incl.map index 57aba09de..7a9b49538 100644 --- a/d8/d58/kadane2_8cpp__incl.map +++ b/d7/d53/kadane_8cpp__incl.map @@ -1,4 +1,4 @@ - + diff --git a/d7/d53/kadane_8cpp__incl.md5 b/d7/d53/kadane_8cpp__incl.md5 new file mode 100644 index 000000000..fc1a2c3fe --- /dev/null +++ b/d7/d53/kadane_8cpp__incl.md5 @@ -0,0 +1 @@ +c991bbe55c37bc23cef9110420868f70 \ No newline at end of file diff --git a/d8/d58/kadane2_8cpp__incl.svg b/d7/d53/kadane_8cpp__incl.svg similarity index 96% rename from d8/d58/kadane2_8cpp__incl.svg rename to d7/d53/kadane_8cpp__incl.svg index 877492e41..1c83dfb40 100644 --- a/d8/d58/kadane2_8cpp__incl.svg +++ b/d7/d53/kadane_8cpp__incl.svg @@ -3,7 +3,7 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - + @@ -18,14 +18,14 @@ -dynamic_programming/kadane2.cpp +dynamic_programming/kadane.cpp Node1 dynamic_programming -/kadane2.cpp +/kadane.cpp diff --git a/d8/d58/kadane2_8cpp__incl_org.svg b/d7/d53/kadane_8cpp__incl_org.svg similarity index 95% rename from d8/d58/kadane2_8cpp__incl_org.svg rename to d7/d53/kadane_8cpp__incl_org.svg index 709d5b5eb..902ecc20e 100644 --- a/d8/d58/kadane2_8cpp__incl_org.svg +++ b/d7/d53/kadane_8cpp__incl_org.svg @@ -3,18 +3,18 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - + -dynamic_programming/kadane2.cpp +dynamic_programming/kadane.cpp Node1 dynamic_programming -/kadane2.cpp +/kadane.cpp diff --git a/d7/d57/longest__increasing__subsequence_8cpp.html b/d7/d57/longest__increasing__subsequence_8cpp.html index daf190677..aabae49bd 100644 --- a/d7/d57/longest__increasing__subsequence_8cpp.html +++ b/d7/d57/longest__increasing__subsequence_8cpp.html @@ -115,12 +115,13 @@ $(function(){initNavTree('d7/d57/longest__increasing__subsequence_8cpp.html','.. More...

    #include <cassert>
    #include <climits>
    +#include <cstdint>
    #include <iostream>
    #include <vector>
    Include dependency graph for longest_increasing_subsequence.cpp:
    -
    +
    Returns
    0 on exit
    -
    80 {
    -
    81 uint32_t n = 0;
    -
    82
    -
    83 std::cout << "Enter size of array: ";
    -
    84 std::cin >> n;
    -
    85
    -
    86 std::vector<uint64_t> a(n);
    -
    87
    -
    88 std::cout << "Enter array elements: ";
    -
    89 for (int i = 0; i < n; ++i) {
    -
    90 std::cin >> a[i];
    -
    91 }
    -
    92
    -
    93 std::cout << "\nThe result is: " << dynamic_programming::LIS(a, n)
    -
    94 << std::endl;
    -
    95 test(); // run self-test implementations
    -
    96
    -
    97 return 0;
    -
    98}
    +
    81 {
    +
    82 uint32_t n = 0;
    +
    83
    +
    84 std::cout << "Enter size of array: ";
    +
    85 std::cin >> n;
    +
    86
    +
    87 std::vector<uint64_t> a(n);
    +
    88
    +
    89 std::cout << "Enter array elements: ";
    +
    90 for (int i = 0; i < n; ++i) {
    +
    91 std::cin >> a[i];
    +
    92 }
    +
    93
    +
    94 std::cout << "\nThe result is: " << dynamic_programming::LIS(a, n)
    +
    95 << std::endl;
    +
    96 test(); // run self-test implementations
    +
    97
    +
    98 return 0;
    +
    99}
    std::endl
    T endl(T... args)
    -
    test
    static void test()
    Self-test implementations.
    Definition longest_increasing_subsequence.cpp:63
    -
    dynamic_programming::LIS
    uint64_t LIS(const std::vector< uint64_t > &a, const uint32_t &n)
    Calculate the longest increasing subsequence for the specified numbers.
    Definition longest_increasing_subsequence.cpp:39
    +
    test
    static void test()
    Self-test implementations.
    Definition longest_increasing_subsequence.cpp:64
    +
    dynamic_programming::LIS
    uint64_t LIS(const std::vector< uint64_t > &a, const uint32_t &n)
    Calculate the longest increasing subsequence for the specified numbers.
    Definition longest_increasing_subsequence.cpp:40
    Here is the call graph for this function:
    @@ -235,16 +236,16 @@ Here is the call graph for this function:

    Self-test implementations.

    Returns
    void

    < The longest increasing subsequence is {2,3,4,5,8}

    -
    63 {
    -
    64 std::vector<uint64_t> a = {15, 21, 2, 3, 4, 5, 8, 4, 1, 1};
    -
    65 uint32_t n = a.size();
    -
    66
    -
    67 uint32_t result = dynamic_programming::LIS(a, n);
    -
    68 assert(result ==
    -
    69 5); ///< The longest increasing subsequence is `{2,3,4,5,8}`
    -
    70
    -
    71 std::cout << "Self-test implementations passed!" << std::endl;
    -
    72}
    +
    64 {
    +
    65 std::vector<uint64_t> a = {15, 21, 2, 3, 4, 5, 8, 4, 1, 1};
    +
    66 uint32_t n = a.size();
    +
    67
    +
    68 uint32_t result = dynamic_programming::LIS(a, n);
    +
    69 assert(result ==
    +
    70 5); ///< The longest increasing subsequence is `{2,3,4,5,8}`
    +
    71
    +
    72 std::cout << "Self-test implementations passed!" << std::endl;
    +
    73}
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition fibonacci_sum.cpp:77
    Here is the call graph for this function:
    diff --git a/d7/d73/abbreviation_8cpp.html b/d7/d73/abbreviation_8cpp.html index fe413c1aa..fbb34979c 100644 --- a/d7/d73/abbreviation_8cpp.html +++ b/d7/d73/abbreviation_8cpp.html @@ -114,13 +114,14 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp.html','../../'); initResizabl

    Implementation of Abbrievation More...

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

    @@ -176,30 +177,30 @@ Functions

    @@ -192,33 +193,33 @@ Algorithm

    Returns
    false if string str cannot be converted to result
    true if string str can be converted to result
    -
    118 {
    -
    119 std::vector<std::vector<bool>> memo(
    -
    120 str.size() + 1, std::vector<bool>(result.size() + 1, false));
    -
    121
    -
    122 for (uint32_t i = 0; i <= str.size(); ++i) {
    -
    123 memo[i][0] = true;
    -
    124 }
    -
    125 for (uint32_t i = 1; i <= result.size(); ++i) {
    -
    126 memo[0][i] = false;
    -
    127 }
    -
    128 for (uint32_t i = 1; i <= str.size(); ++i) {
    -
    129 for (uint32_t j = 1; j <= result.size(); ++j) {
    -
    130 if (str[i - 1] == result[j - 1]) {
    -
    131 memo[i][j] = memo[i - 1][j - 1];
    -
    132 } else if (str[i - 1] - 32 == result[j - 1]) {
    -
    133 memo[i][j] = (memo[i - 1][j - 1] || memo[i - 1][j]);
    -
    134 } else {
    -
    135 if (str[i - 1] >= 'A' && str[i - 1] <= 'Z') {
    -
    136 memo[i][j] = false;
    -
    137 } else {
    -
    138 memo[i][j] = memo[i - 1][j];
    -
    139 }
    -
    140 }
    -
    141 }
    -
    142 }
    -
    143 return memo.back().back();
    -
    144}
    +
    119 {
    +
    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;
    +
    125 }
    +
    126 for (uint32_t i = 1; i <= result.size(); ++i) {
    +
    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];
    +
    133 } else if (str[i - 1] - 32 == result[j - 1]) {
    +
    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;
    +
    138 } else {
    +
    139 memo[i][j] = memo[i - 1][j];
    +
    140 }
    +
    141 }
    +
    142 }
    +
    143 }
    +
    144 return memo.back().back();
    +
    145}
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition fibonacci_sum.cpp:77
    std::string::size
    T size(T... args)
    @@ -288,51 +289,51 @@ Here is the call graph for this function:
  • convert it to capitalized letter and move both to next pointer (i + 1, j + 1)
  • Discard the character (str[i]) and move to next char (i + 1, j)
    • -
    61 {
    -
    62 bool ans = memo->at(str_idx).at(result_idx);
    -
    63 if (str_idx == str.size() && result_idx == result.size()) {
    -
    64 return true;
    -
    65 } else if (str_idx == str.size() && result_idx != result.size()) {
    -
    66 // result `t` is not converted, return false
    -
    67 return false;
    -
    68 } else if (!visited->at(str_idx).at(result_idx)) {
    -
    69 /**
    -
    70 * `(str[i] == result[j])`: if str char at position i is equal to
    -
    71 * `result` char at position j, then s character is a capitalized one,
    -
    72 * move on to next character `str[i] - 32 == result[j]`:
    -
    73 * if `str[i]` character is lowercase of `result[j]` then explore two
    -
    74 * possibilites:
    -
    75 * 1. convert it to capitalized letter and move both to next pointer
    -
    76 * `(i + 1, j + 1)`
    -
    77 * 2. Discard the character `(str[i])` and move to next char `(i + 1,
    -
    78 * j)`
    -
    79 */
    -
    80 if (str[str_idx] == result[result_idx]) {
    -
    81 ans = abbreviation_recursion(memo, visited, str, result,
    -
    82 str_idx + 1, result_idx + 1);
    -
    83 } else if (str[str_idx] - 32 == result[result_idx]) {
    -
    84 ans = abbreviation_recursion(memo, visited, str, result,
    -
    85 str_idx + 1, result_idx + 1) ||
    -
    86 abbreviation_recursion(memo, visited, str, result,
    -
    87 str_idx + 1, result_idx);
    -
    88 } else {
    -
    89 // if `str[i]` is uppercase, then cannot be converted, return
    -
    90 // `false`
    -
    91 // else `str[i]` is lowercase, only option is to discard this
    -
    92 // character
    -
    93 if (str[str_idx] >= 'A' && str[str_idx] <= 'Z') {
    -
    94 ans = false;
    -
    95 } else {
    -
    96 ans = abbreviation_recursion(memo, visited, str, result,
    -
    97 str_idx + 1, result_idx);
    -
    98 }
    -
    99 }
    -
    100 }
    -
    101 (*memo)[str_idx][result_idx] = ans;
    -
    102 (*visited)[str_idx][result_idx] = true;
    -
    103 return (*memo)[str_idx][result_idx];
    -
    104}
    -
    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:58
    +
    62 {
    +
    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()) {
    +
    67 // result `t` is not converted, return false
    +
    68 return false;
    +
    69 } else if (!visited->at(str_idx).at(result_idx)) {
    +
    70 /**
    +
    71 * `(str[i] == result[j])`: if str char at position i is equal to
    +
    72 * `result` char at position j, then s character is a capitalized one,
    +
    73 * move on to next character `str[i] - 32 == result[j]`:
    +
    74 * if `str[i]` character is lowercase of `result[j]` then explore two
    +
    75 * possibilites:
    +
    76 * 1. convert it to capitalized letter and move both to next pointer
    +
    77 * `(i + 1, j + 1)`
    +
    78 * 2. Discard the character `(str[i])` and move to next char `(i + 1,
    +
    79 * j)`
    +
    80 */
    +
    81 if (str[str_idx] == result[result_idx]) {
    +
    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,
    +
    86 str_idx + 1, result_idx + 1) ||
    +
    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
    +
    91 // `false`
    +
    92 // else `str[i]` is lowercase, only option is to discard this
    +
    93 // character
    +
    94 if (str[str_idx] >= 'A' && str[str_idx] <= 'Z') {
    +
    95 ans = false;
    +
    96 } else {
    +
    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];
    +
    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
    std::vector::at
    T at(T... args)
    Here is the call graph for this function:
    @@ -359,11 +360,11 @@ Here is the call graph for this function:

    Main function.

    Returns
    0 on exit
    -
    191 {
    -
    192 test(); // run self-test implementations
    -
    193 return 0;
    -
    194}
    -
    test
    static void test()
    Self test-implementations.
    Definition abbreviation.cpp:152
    +
    192 {
    +
    193 test(); // run self-test implementations
    +
    194 return 0;
    +
    195}
    +
    test
    static void test()
    Self test-implementations.
    Definition abbreviation.cpp:153
    Here is the call graph for this function:
    @@ -397,40 +398,40 @@ Here is the call graph for this function:

    Self test-implementations.

    Returns
    void
    -
    152 {
    -
    153 std::string s = "daBcd", t = "ABC";
    -
    154 std::vector<std::vector<bool>> memo(s.size() + 1,
    -
    155 std::vector<bool>(t.size() + 1, false)),
    -
    156 visited(s.size() + 1, std::vector<bool>(t.size() + 1, false));
    -
    157
    -
    158 assert(dynamic_programming::abbreviation::abbreviation_recursion(
    -
    159 &memo, &visited, s, t) == true);
    -
    160 assert(dynamic_programming::abbreviation::abbreviation(s, t) == true);
    -
    161 s = "XXVVnDEFYgYeMXzWINQYHAQKKOZEYgSRCzLZAmUYGUGILjMDET";
    -
    162 t = "XXVVDEFYYMXWINQYHAQKKOZEYSRCLZAUYGUGILMDETQVWU";
    -
    163 memo = std::vector<std::vector<bool>>(
    -
    164 s.size() + 1, std::vector<bool>(t.size() + 1, false));
    -
    165
    -
    166 visited = std::vector<std::vector<bool>>(
    -
    167 s.size() + 1, std::vector<bool>(t.size() + 1, false));
    -
    168
    -
    169 assert(dynamic_programming::abbreviation::abbreviation_recursion(
    -
    170 &memo, &visited, s, t) == false);
    -
    171 assert(dynamic_programming::abbreviation::abbreviation(s, t) == false);
    -
    172
    -
    173 s = "DRFNLZZVHLPZWIupjwdmqafmgkg";
    -
    174 t = "DRFNLZZVHLPZWI";
    -
    175
    -
    176 memo = std::vector<std::vector<bool>>(
    -
    177 s.size() + 1, std::vector<bool>(t.size() + 1, false));
    -
    178
    -
    179 visited = std::vector<std::vector<bool>>(
    -
    180 s.size() + 1, std::vector<bool>(t.size() + 1, false));
    -
    181
    -
    182 assert(dynamic_programming::abbreviation::abbreviation_recursion(
    -
    183 &memo, &visited, s, t) == true);
    -
    184 assert(dynamic_programming::abbreviation::abbreviation(s, t) == true);
    -
    185}
    +
    153 {
    +
    154 std::string s = "daBcd", t = "ABC";
    +
    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);
    +
    161 assert(dynamic_programming::abbreviation::abbreviation(s, t) == true);
    +
    162 s = "XXVVnDEFYgYeMXzWINQYHAQKKOZEYgSRCzLZAmUYGUGILjMDET";
    +
    163 t = "XXVVDEFYYMXWINQYHAQKKOZEYSRCLZAUYGUGILMDETQVWU";
    +
    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);
    +
    172 assert(dynamic_programming::abbreviation::abbreviation(s, t) == false);
    +
    173
    +
    174 s = "DRFNLZZVHLPZWIupjwdmqafmgkg";
    +
    175 t = "DRFNLZZVHLPZWI";
    +
    176
    +
    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);
    +
    185 assert(dynamic_programming::abbreviation::abbreviation(s, t) == true);
    +
    186}
    Here is the call graph for this function:
    diff --git a/d7/da4/cut__rod_8cpp__incl.map b/d7/da4/cut__rod_8cpp__incl.map index 7316caa74..96985102a 100644 --- a/d7/da4/cut__rod_8cpp__incl.map +++ b/d7/da4/cut__rod_8cpp__incl.map @@ -1,11 +1,13 @@ - + - + - + - - - + + + + + diff --git a/d7/da4/cut__rod_8cpp__incl.md5 b/d7/da4/cut__rod_8cpp__incl.md5 index b6a025675..c7a11dfba 100644 --- a/d7/da4/cut__rod_8cpp__incl.md5 +++ b/d7/da4/cut__rod_8cpp__incl.md5 @@ -1 +1 @@ -1138f689e74b6333ceb41d92cbbb02c6 \ No newline at end of file +5e80252aa16c394e8186119591f8616d \ No newline at end of file diff --git a/d7/da4/cut__rod_8cpp__incl.svg b/d7/da4/cut__rod_8cpp__incl.svg index cd47899b9..c77e1b920 100644 --- a/d7/da4/cut__rod_8cpp__incl.svg +++ b/d7/da4/cut__rod_8cpp__incl.svg @@ -4,8 +4,8 @@ - + @@ -23,9 +23,9 @@ Node1 - -dynamic_programming -/cut_rod.cpp + +dynamic_programming +/cut_rod.cpp @@ -42,8 +42,8 @@ Node1->Node2 - - + + @@ -60,8 +60,8 @@ Node1->Node3 - - + + @@ -78,8 +78,8 @@ Node1->Node4 - - + + @@ -87,8 +87,8 @@ Node5 - -iostream + +cstdint @@ -96,8 +96,26 @@ Node1->Node5 - - + + + + + + + +Node6 + + +iostream + + + + + +Node1->Node6 + + + diff --git a/d7/da4/cut__rod_8cpp__incl_org.svg b/d7/da4/cut__rod_8cpp__incl_org.svg index f275b5955..a81078a72 100644 --- a/d7/da4/cut__rod_8cpp__incl_org.svg +++ b/d7/da4/cut__rod_8cpp__incl_org.svg @@ -4,17 +4,17 @@ - + dynamic_programming/cut_rod.cpp Node1 - -dynamic_programming -/cut_rod.cpp + +dynamic_programming +/cut_rod.cpp @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -49,8 +49,8 @@ Node1->Node3 - - + + @@ -67,8 +67,8 @@ Node1->Node4 - - + + @@ -76,8 +76,8 @@ Node5 - -iostream + +cstdint @@ -85,8 +85,26 @@ Node1->Node5 - - + + + + + + + +Node6 + + +iostream + + + + + +Node1->Node6 + + + diff --git a/d7/def/trie__multiple__search_8cpp.html b/d7/def/trie__multiple__search_8cpp.html index d96100486..81e7d6718 100644 --- a/d7/def/trie__multiple__search_8cpp.html +++ b/d7/def/trie__multiple__search_8cpp.html @@ -117,13 +117,14 @@ $(function(){initNavTree('d7/def/trie__multiple__search_8cpp.html','../../'); in
    #include <algorithm>
    #include <cassert>
    #include <cctype>
    +#include <cstdint>
    #include <cstring>
    #include <iostream>
    #include <queue>
    Include dependency graph for trie_multiple_search.cpp:
    -
    +
    Returns
    0 on exit
    -
    463 {
    -
    464 test(); // run self-test implementations
    -
    465 return 0;
    -
    466}
    -
    test
    static void test()
    Function to test a simple search before and after deleting an entry. And to test out the multiple var...
    Definition trie_multiple_search.cpp:422
    +
    466 {
    +
    467 test(); // run self-test implementations
    +
    468 return 0;
    +
    469}
    +
    test
    static void test()
    Function to test a simple search before and after deleting an entry. And to test out the multiple var...
    Definition trie_multiple_search.cpp:425
    Here is the call graph for this function:
    @@ -219,42 +220,42 @@ Here is the call graph for this function:

    Function to test a simple search before and after deleting an entry. And to test out the multiple variants of search.

    -
    422 {
    -
    423 auto root = new operations_on_datastructures::trie_operations::Tnode();
    -
    424 std::vector<std::string> inputs = {
    -
    425 "abcde", "sss", "ssss", "ssst", "sssu", "sssv",
    -
    426 "sst", "ssts", "sstt", "sstu", "tutu", "tutuv",
    -
    427 "tutuu", "tutuvs", "tutus", "tvst", "tvsu", "vvvv"};
    -
    428
    -
    429 for (auto &i : inputs) {
    -
    430 root->Insert(i);
    -
    431 }
    -
    432 // Search an existing entry
    -
    433 assert(root->SearchPresence("vvvv"));
    -
    434 std::cout << root->SearchPresence("vvvv") << std::endl;
    -
    435 // Delete it
    -
    436 root->Delete("vvvv");
    -
    437 // Search for the entry again
    -
    438 assert(!root->SearchPresence("vvvv"));
    -
    439 std::cout << root->SearchPresence("vvvv") << std::endl;
    -
    440
    -
    441 std::cout << root->SearchPresence("tutu") << std::endl;
    -
    442 root->SearchSuggestions("tutu");
    -
    443 std::cout << root->SearchPresence("tutu") << std::endl;
    -
    444
    -
    445 root->SearchSuggestions("tutuv");
    -
    446 std::cout << root->SearchPresence("tutuv") << std::endl;
    +
    425 {
    +
    426 auto root = new operations_on_datastructures::trie_operations::Tnode();
    +
    427 std::vector<std::string> inputs = {
    +
    428 "abcde", "sss", "ssss", "ssst", "sssu", "sssv",
    +
    429 "sst", "ssts", "sstt", "sstu", "tutu", "tutuv",
    +
    430 "tutuu", "tutuvs", "tutus", "tvst", "tvsu", "vvvv"};
    +
    431
    +
    432 for (auto &i : inputs) {
    +
    433 root->Insert(i);
    +
    434 }
    +
    435 // Search an existing entry
    +
    436 assert(root->SearchPresence("vvvv"));
    +
    437 std::cout << root->SearchPresence("vvvv") << std::endl;
    +
    438 // Delete it
    +
    439 root->Delete("vvvv");
    +
    440 // Search for the entry again
    +
    441 assert(!root->SearchPresence("vvvv"));
    +
    442 std::cout << root->SearchPresence("vvvv") << std::endl;
    +
    443
    +
    444 std::cout << root->SearchPresence("tutu") << std::endl;
    +
    445 root->SearchSuggestions("tutu");
    +
    446 std::cout << root->SearchPresence("tutu") << std::endl;
    447
    -
    448 root->SearchSuggestions("tutuvs");
    -
    449
    -
    450 root->SearchFreqSuggestions(
    -
    451 "tu"); // The top 3 frequent entries with prefix tu are tutu, tutuv &
    -
    452 // tutuvs respectively
    -
    453 root->SearchSuggestions(
    -
    454 ""); // Empty search to list all the entries in the trie
    -
    455}
    +
    448 root->SearchSuggestions("tutuv");
    +
    449 std::cout << root->SearchPresence("tutuv") << std::endl;
    +
    450
    +
    451 root->SearchSuggestions("tutuvs");
    +
    452
    +
    453 root->SearchFreqSuggestions(
    +
    454 "tu"); // The top 3 frequent entries with prefix tu are tutu, tutuv &
    +
    455 // tutuvs respectively
    +
    456 root->SearchSuggestions(
    +
    457 ""); // Empty search to list all the entries in the trie
    +
    458}
    -
    operations_on_datastructures::trie_operations::Tnode
    Class defining the structure of trie node and containing the methods to perform operations on them.
    Definition trie_multiple_search.cpp:34
    +
    operations_on_datastructures::trie_operations::Tnode
    Class defining the structure of trie node and containing the methods to perform operations on them.
    Definition trie_multiple_search.cpp:37
    std::endl
    T endl(T... args)
    diff --git a/d8/d58/kadane2_8cpp__incl.md5 b/d8/d58/kadane2_8cpp__incl.md5 deleted file mode 100644 index 77f06ffcd..000000000 --- a/d8/d58/kadane2_8cpp__incl.md5 +++ /dev/null @@ -1 +0,0 @@ -cf5765a4a64f6bc9c723667fe5ea80d3 \ No newline at end of file diff --git a/d7/d1e/graph_2dijkstra_8cpp.html b/d8/d68/dijkstra_8cpp.html similarity index 96% rename from d7/d1e/graph_2dijkstra_8cpp.html rename to d8/d68/dijkstra_8cpp.html index 8670750a0..f8eae6880 100644 --- a/d7/d1e/graph_2dijkstra_8cpp.html +++ b/d8/d68/dijkstra_8cpp.html @@ -78,7 +78,7 @@ $(function() {
    @@ -124,7 +124,7 @@ $(function(){initNavTree('d7/d1e/graph_2dijkstra_8cpp.html','../../'); initResiz
    Include dependency graph for dijkstra.cpp:
    -
    +

    @@ -182,11 +183,11 @@ Functions

    11 {
    12 // variable to indicate sign of input integer
    13 bool negative = false;
    -
    14 register int c;
    +
    14 int c;
    15 *number = 0;
    16
    17 // extract current character from buffer
    diff --git a/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html b/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html index 0dcdc6168..875b0eaf8 100644 --- a/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html +++ b/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html @@ -129,13 +129,13 @@ Public Attributes size_t 
    - + - + - +

    @@ -205,8 +205,8 @@ constexpr int64_t 

    		INF
    180}
    +
    tests
    void tests()
    Definition dijkstra.cpp:113
    std::endl
    T endl(T... args)
    -
    tests
    void tests()
    Definition dijkstra.cpp:113
    graph::addEdge
    void addEdge(std::vector< std::vector< int > > *adj, int u, int v)
    Function that add edge between two nodes or vertices of graph.
    Definition connected_components.cpp:46
    graph::dijkstra
    int dijkstra(std::vector< std::vector< std::pair< int, int > > > *adj, int s, int t)
    Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...
    Definition dijkstra.cpp:66
    @@ -214,7 +214,7 @@ constexpr int64_t     		INF
    Here is the call graph for this function:
    -
    +
    @@ -274,7 +274,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -284,7 +284,7 @@ Here is the call graph for this function: diff --git a/d8/d68/dijkstra_8cpp.js b/d8/d68/dijkstra_8cpp.js new file mode 100644 index 000000000..a8ecc479b --- /dev/null +++ b/d8/d68/dijkstra_8cpp.js @@ -0,0 +1,7 @@ +var dijkstra_8cpp = +[ + [ "addEdge", "d8/d68/dijkstra_8cpp.html#a0e30e0dca68cb6e4f671440819b35b6a", null ], + [ "dijkstra", "d8/d68/dijkstra_8cpp.html#adc68cbc8ba09eb1142265935c0d45b84", null ], + [ "main", "d8/d68/dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "tests", "d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9", null ] +]; \ No newline at end of file diff --git a/d7/d1e/graph_2dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map similarity index 100% rename from d7/d1e/graph_2dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map rename to d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map diff --git a/d7/d1e/graph_2dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 similarity index 100% rename from d7/d1e/graph_2dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 rename to d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 diff --git a/d7/d1e/graph_2dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg similarity index 100% rename from d7/d1e/graph_2dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg rename to d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg diff --git a/d7/d1e/graph_2dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg similarity index 100% rename from d7/d1e/graph_2dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg rename to d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg diff --git a/d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map similarity index 96% rename from d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map rename to d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index a926a4498..330136905 100644 --- a/d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -6,7 +6,7 @@ - + diff --git a/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..51e3ca322 --- /dev/null +++ b/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +c5330016e17cc7e92c44fc51975fad8f \ No newline at end of file diff --git a/d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg similarity index 98% rename from d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg rename to d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 1a324411b..624b05576 100644 --- a/d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -85,7 +85,7 @@ Node11 - + tests diff --git a/d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg similarity index 98% rename from d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg rename to d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 4d3c1c721..04da8bdff 100644 --- a/d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -74,7 +74,7 @@ Node11 - + tests diff --git a/d6/d42/data__structures_2sparse__table_8cpp.html b/d8/dab/sparse__table_8cpp.html similarity index 92% rename from d6/d42/data__structures_2sparse__table_8cpp.html rename to d8/dab/sparse__table_8cpp.html index cf47d19bf..05aaed288 100644 --- a/d6/d42/data__structures_2sparse__table_8cpp.html +++ b/d8/dab/sparse__table_8cpp.html @@ -78,7 +78,7 @@ $(function() {
    @@ -122,7 +122,7 @@ $(function(){initNavTree('d6/d42/data__structures_2sparse__table_8cpp.html','../
    Include dependency graph for sparse_table.cpp:
    -
    +

    @@ -160,11 +160,21 @@ constexpr uint8_t 

    		data_str

    Detailed Description

    Implementation of Sparse Table for min() function.

    +

    Implementation of Sparse Table data structure.

    Author
    Mann Patel

    Sparse Table is a data structure, that allows answering range queries. It can answer most range queries in O(logn), but its true power is answering range minimum queries (or equivalent range maximum queries). For those queries it can compute the answer in O(1) time. The only drawback of this data structure is, that it can only be used on immutable arrays. This means, that the array cannot be changed between two queries.

    If any element in the array changes, the complete data structure has to be recomputed.

    Todo
    make stress tests.
    -
    Warning
    This sparse table is made for min(a1,a2,...an) duplicate invariant function. This implementation can be changed to other functions like gcd(), lcm(), and max() by changing a few lines of code.
    +
    Warning
    This sparse table is made for min(a1,a2,...an) duplicate invariant function. This implementation can be changed to other functions like gcd(), lcm(), and max() by changing a few lines of code.
    +

    Sparse Table is a data structure, that allows answering range queries. It can answer most range queries in O(logn), but its true power is answering range minimum queries or equivalent range maximum queries). For those queries it can compute the answer in O(1) time.

    +
      +
    • Running Time Complexity
      +
      • +
    • Build : O(NlogN)
      +
      • +
    • Range Query : O(1)
      +
      • +

    Function Documentation

    ◆ main()

    @@ -198,11 +208,11 @@ constexpr uint8_t     		data_str
    163 test(); // run self-test implementations
    164 return 0;
    165}
    -
    test
    static void test()
    Self-test implementations.
    Definition sparse_table.cpp:129
    +
    test
    static void test()
    Self-test implementations.
    Definition sparse_table.cpp:129
    Here is the call graph for this function:
    -
    +
    @@ -277,7 +287,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -313,7 +323,7 @@ Here is the call graph for this function: diff --git a/d8/dab/sparse__table_8cpp.js b/d8/dab/sparse__table_8cpp.js new file mode 100644 index 000000000..6cb7a22ce --- /dev/null +++ b/d8/dab/sparse__table_8cpp.js @@ -0,0 +1,8 @@ +var sparse__table_8cpp = +[ + [ "data_structures::sparse_table::Sparse_table", "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html", "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table" ], + [ "main", "d8/dab/sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "test", "d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ], + [ "M", "d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e", null ], + [ "N", "d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d", null ] +]; \ No newline at end of file diff --git a/d6/d42/data__structures_2sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map similarity index 88% rename from d6/d42/data__structures_2sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map rename to d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map index f33d55652..0b8da185b 100644 --- a/d6/d42/data__structures_2sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map +++ b/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map @@ -1,6 +1,6 @@ - + diff --git a/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 new file mode 100644 index 000000000..826e7a1ef --- /dev/null +++ b/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 @@ -0,0 +1 @@ +37093734509d96a8fecd4cff3a423f8e \ No newline at end of file diff --git a/d6/d42/data__structures_2sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg similarity index 96% rename from d6/d42/data__structures_2sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg rename to d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg index d0de03223..537681c90 100644 --- a/d6/d42/data__structures_2sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg +++ b/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg @@ -31,7 +31,7 @@ Node2 - + test diff --git a/d6/d42/data__structures_2sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg similarity index 96% rename from d6/d42/data__structures_2sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg rename to d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg index e9f7640a0..ac19feb00 100644 --- a/d6/d42/data__structures_2sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg +++ b/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg @@ -20,7 +20,7 @@ Node2 - + test diff --git a/d6/d42/data__structures_2sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map similarity index 100% rename from d6/d42/data__structures_2sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map rename to d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map diff --git a/d6/d42/data__structures_2sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 similarity index 100% rename from d6/d42/data__structures_2sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 rename to d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 diff --git a/d6/d42/data__structures_2sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg similarity index 100% rename from d6/d42/data__structures_2sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg rename to d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg diff --git a/d6/d42/data__structures_2sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg similarity index 100% rename from d6/d42/data__structures_2sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg rename to d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp.html b/d8/ddf/sieve__of__eratosthenes_8cpp.html index 11a11c503..ec6cf1f2d 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp.html +++ b/d8/ddf/sieve__of__eratosthenes_8cpp.html @@ -212,7 +212,7 @@ Here is the call graph for this function:
    65 {
    -
    66 for (uint32_t i = 2; i <= N; i++) {
    +
    66 for (uint32_t i = 2; i <= N; i++) {
    67 if (is_prime[i]) {
    68 std::cout << i << ' ';
    69 }
    @@ -220,8 +220,8 @@ Here is the call graph for this function:
    71 std::cout << std::endl;
    72}
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    std::endl
    T endl(T... args)
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    Here is the call graph for this function:
    @@ -258,9 +258,9 @@ Here is the call graph for this function:
    46 std::vector<bool> is_prime(N + 1, true); // Initialize all as prime numbers
    47 is_prime[0] = is_prime[1] = false; // 0 and 1 are not prime numbers
    48
    -
    49 for (uint32_t i = 2; i * i <= N; i++) {
    +
    49 for (uint32_t i = 2; i * i <= N; i++) {
    50 if (is_prime[i]) {
    -
    51 for (uint32_t j = i * i; j <= N; j += i) {
    +
    51 for (uint32_t j = i * i; j <= N; j += i) {
    52 is_prime[j] = false;
    53 }
    54 }
    diff --git a/d9/d49/kohonen__som__trace_8cpp.html b/d9/d49/kohonen__som__trace_8cpp.html index 687c6b277..17db97c23 100644 --- a/d9/d49/kohonen__som__trace_8cpp.html +++ b/d9/d49/kohonen__som__trace_8cpp.html @@ -298,7 +298,7 @@ Here is the call graph for this function:

    Sample execution output

    233 {
    -
    234 int j = 0, N = 500;
    +
    234 int j = 0, N = 500;
    235 int features = 2;
    236 int num_out = 50;
    237 std::vector<std::valarray<double>> X(N);
    @@ -327,11 +327,11 @@ Here is the call graph for this function:
    260 kohonen_som_tracer(X, &W, 0.1); // train the SOM
    261 save_nd_data("w12.csv", W); // save the resultant weights
    262}
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    save_nd_data
    int save_nd_data(const char *fname, const std::vector< std::valarray< double > > &X)
    Definition kohonen_som_trace.cpp:58
    _random
    double _random(double a, double b)
    Definition kohonen_som_topology.cpp:53
    test_circle
    void test_circle(std::vector< std::valarray< double > > *data)
    Definition kohonen_som_trace.cpp:196
    std::max
    T max(T... args)
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    @@ -368,7 +368,7 @@ Here is the call graph for this function:

    Sample execution output

    315 {
    -
    316 int j = 0, N = 500;
    +
    316 int j = 0, N = 500;
    317 int features = 2;
    318 int num_out = 20;
    319 std::vector<std::valarray<double>> X(N);
    @@ -432,7 +432,7 @@ Here is the call graph for this function:

    Sample execution output

    414 {
    -
    415 int j = 0, N = 200;
    +
    415 int j = 0, N = 200;
    416 int features = 3;
    417 int num_out = 20;
    418 std::vector<std::valarray<double>> X(N);
    @@ -501,7 +501,7 @@ Here is the call graph for this function:
    359 {
    -
    360 const int N = data->size();
    +
    360 const int N = data->size();
    361 const double R = 0.1; // radius of cluster
    362 int i = 0;
    363 const int num_classes = 8;
    @@ -520,7 +520,7 @@ Here is the call graph for this function:
    376#ifdef _OPENMP
    377#pragma omp for
    378#endif
    -
    379 for (i = 0; i < N; i++) {
    +
    379 for (i = 0; i < N; i++) {
    380 int cls =
    381 std::rand() % num_classes; // select a random class for the point
    382
    @@ -575,7 +575,7 @@ y &=& r\sin\theta
    196 {
    -
    197 const int N = data->size();
    +
    197 const int N = data->size();
    198 const double R = 0.75, dr = 0.3;
    199 double a_t = 0., b_t = 2.f * M_PI; // theta random between 0 and 2*pi
    200 double a_r = R - dr, b_r = R + dr; // radius random between R-dr and R+dr
    @@ -584,7 +584,7 @@ y &=& r\sin\theta
    203#ifdef _OPENMP
    204#pragma omp for
    205#endif
    -
    206 for (i = 0; i < N; i++) {
    +
    206 for (i = 0; i < N; i++) {
    207 double r = _random(a_r, b_r); // random radius
    208 double theta = _random(a_t, b_t); // random theta
    209 data[0][i][0] = r * cos(theta); // convert from polar to cartesian
    @@ -632,14 +632,14 @@ y &=& \delta y + \frac{\sin(2\theta)}{2}
    277 {
    -
    278 const int N = data->size();
    +
    278 const int N = data->size();
    279 const double dr = 0.2;
    280 int i = 0;
    281
    282#ifdef _OPENMP
    283#pragma omp for
    284#endif
    -
    285 for (i = 0; i < N; i++) {
    +
    285 for (i = 0; i < N; i++) {
    286 double dx = _random(-dr, dr); // random change in x
    287 double dy = _random(-dr, dr); // random change in y
    288 double theta = _random(0, M_PI); // random theta
    diff --git a/d3/db7/graph_2dijkstra_8cpp__incl.map b/d9/d5f/dijkstra_8cpp__incl.map similarity index 100% rename from d3/db7/graph_2dijkstra_8cpp__incl.map rename to d9/d5f/dijkstra_8cpp__incl.map diff --git a/d3/db7/graph_2dijkstra_8cpp__incl.md5 b/d9/d5f/dijkstra_8cpp__incl.md5 similarity index 100% rename from d3/db7/graph_2dijkstra_8cpp__incl.md5 rename to d9/d5f/dijkstra_8cpp__incl.md5 diff --git a/d3/db7/graph_2dijkstra_8cpp__incl.svg b/d9/d5f/dijkstra_8cpp__incl.svg similarity index 100% rename from d3/db7/graph_2dijkstra_8cpp__incl.svg rename to d9/d5f/dijkstra_8cpp__incl.svg diff --git a/d3/db7/graph_2dijkstra_8cpp__incl_org.svg b/d9/d5f/dijkstra_8cpp__incl_org.svg similarity index 100% rename from d3/db7/graph_2dijkstra_8cpp__incl_org.svg rename to d9/d5f/dijkstra_8cpp__incl_org.svg diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp.html b/d9/dec/unbounded__0__1__knapsack_8cpp.html index 70309a6b4..9eb9230a2 100644 --- a/d9/dec/unbounded__0__1__knapsack_8cpp.html +++ b/d9/dec/unbounded__0__1__knapsack_8cpp.html @@ -113,10 +113,10 @@ $(function(){initNavTree('d9/dec/unbounded__0__1__knapsack_8cpp.html','../../');

    Implementation of the Unbounded 0/1 Knapsack Problem. More...

    -
    #include <iostream>
    -#include <vector>
    -#include <cassert>
    +
    #include <cassert>
    #include <cstdint>
    +#include <iostream>
    +#include <vector>
    Include dependency graph for unbounded_0_1_knapsack.cpp:
    @@ -216,26 +216,31 @@ Algorithm
    Returns
    The maximum value that can be obtained for the given index and capacity.
    -
    60 {
    -
    61 if (i == 0) {
    -
    62 if (wt[0] <= W) {
    -
    63 return (W / wt[0]) * val[0]; // Take as many of the first item as possible
    -
    64 } else {
    -
    65 return 0; // Can't take the first item
    -
    66 }
    -
    67 }
    -
    68 if (dp[i][W] != -1) return dp[i][W]; // Return result if available
    -
    69
    -
    70 int nottake = KnapSackFilling(i - 1, W, val, wt, dp); // Value without taking item i
    -
    71 int take = 0;
    -
    72 if (W >= wt[i]) {
    -
    73 take = val[i] + KnapSackFilling(i, W - wt[i], val, wt, dp); // Value taking item i
    -
    74 }
    -
    75 return dp[i][W] = std::max(take, nottake); // Store and return the maximum value
    -
    76}
    +
    61 {
    +
    62 if (i == 0) {
    +
    63 if (wt[0] <= W) {
    +
    64 return (W / wt[0]) *
    +
    65 val[0]; // Take as many of the first item as possible
    +
    66 } else {
    +
    67 return 0; // Can't take the first item
    +
    68 }
    +
    69 }
    +
    70 if (dp[i][W] != -1)
    +
    71 return dp[i][W]; // Return result if available
    +
    72
    +
    73 int nottake =
    +
    74 KnapSackFilling(i - 1, W, val, wt, dp); // Value without taking item i
    +
    75 int take = 0;
    +
    76 if (W >= wt[i]) {
    +
    77 take = val[i] + KnapSackFilling(i, W - wt[i], val, wt,
    +
    78 dp); // Value taking item i
    +
    79 }
    +
    80 return dp[i][W] =
    +
    81 std::max(take, nottake); // Store and return the maximum value
    +
    82}
    std::max
    T max(T... args)
    dp
    for std::vector
    Definition partition_problem.cpp:39
    -
    dynamic_programming::unbounded_knapsack::KnapSackFilling
    std::uint16_t KnapSackFilling(std::uint16_t i, std::uint16_t W, const std::vector< std::uint16_t > &val, const std::vector< std::uint16_t > &wt, std::vector< std::vector< int > > &dp)
    Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.
    Definition unbounded_0_1_knapsack.cpp:57
    +
    dynamic_programming::unbounded_knapsack::KnapSackFilling
    std::uint16_t KnapSackFilling(std::uint16_t i, std::uint16_t W, const std::vector< std::uint16_t > &val, const std::vector< std::uint16_t > &wt, std::vector< std::vector< int > > &dp)
    Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.
    Definition unbounded_0_1_knapsack.cpp:58
    Here is the call graph for this function:
    @@ -261,11 +266,11 @@ Here is the call graph for this function:

    main function

    Returns
    0 on successful exit
    -
    147 {
    -
    148 tests(); // Run self test implementation
    -
    149 return 0;
    -
    150}
    -
    tests
    static void tests()
    self test implementation
    Definition unbounded_0_1_knapsack.cpp:103
    +
    170 {
    +
    171 tests(); // Run self test implementation
    +
    172 return 0;
    +
    173}
    +
    tests
    static void tests()
    self test implementation
    Definition unbounded_0_1_knapsack.cpp:111
    Here is the call graph for this function:
    @@ -299,49 +304,64 @@ Here is the call graph for this function:

    self test implementation

    Returns
    void
    -
    103 {
    -
    104 // Test Case 1
    -
    105 std::uint16_t N1 = 4; // Number of items
    -
    106 std::vector<std::uint16_t> wt1 = {1, 3, 4, 5}; // Weights of the items
    -
    107 std::vector<std::uint16_t> val1 = {6, 1, 7, 7}; // Values of the items
    -
    108 std::uint16_t W1 = 8; // Maximum capacity of the knapsack
    -
    109 // Test the function and assert the expected output
    -
    110 assert(unboundedKnapsack(N1, W1, val1, wt1) == 48);
    -
    111 std::cout << "Maximum Knapsack value " << unboundedKnapsack(N1, W1, val1, wt1) << std::endl;
    -
    112
    -
    113 // Test Case 2
    -
    114 std::uint16_t N2 = 3; // Number of items
    -
    115 std::vector<std::uint16_t> wt2 = {10, 20, 30}; // Weights of the items
    -
    116 std::vector<std::uint16_t> val2 = {60, 100, 120}; // Values of the items
    -
    117 std::uint16_t W2 = 5; // Maximum capacity of the knapsack
    -
    118 // Test the function and assert the expected output
    -
    119 assert(unboundedKnapsack(N2, W2, val2, wt2) == 0);
    -
    120 std::cout << "Maximum Knapsack value " << unboundedKnapsack(N2, W2, val2, wt2) << std::endl;
    -
    121
    -
    122 // Test Case 3
    -
    123 std::uint16_t N3 = 3; // Number of items
    -
    124 std::vector<std::uint16_t> wt3 = {2, 4, 6}; // Weights of the items
    -
    125 std::vector<std::uint16_t> val3 = {5, 11, 13};// Values of the items
    -
    126 std::uint16_t W3 = 27;// Maximum capacity of the knapsack
    -
    127 // Test the function and assert the expected output
    -
    128 assert(unboundedKnapsack(N3, W3, val3, wt3) == 27);
    -
    129 std::cout << "Maximum Knapsack value " << unboundedKnapsack(N3, W3, val3, wt3) << std::endl;
    -
    130
    -
    131 // Test Case 4
    -
    132 std::uint16_t N4 = 0; // Number of items
    -
    133 std::vector<std::uint16_t> wt4 = {}; // Weights of the items
    -
    134 std::vector<std::uint16_t> val4 = {}; // Values of the items
    -
    135 std::uint16_t W4 = 10; // Maximum capacity of the knapsack
    -
    136 assert(unboundedKnapsack(N4, W4, val4, wt4) == 0);
    -
    137 std::cout << "Maximum Knapsack value for empty arrays: " << unboundedKnapsack(N4, W4, val4, wt4) << std::endl;
    -
    138
    -
    139 std::cout << "All test cases passed!" << std::endl;
    -
    140
    -
    141}
    +
    111 {
    +
    112 // Test Case 1
    +
    113 std::uint16_t N1 = 4; // Number of items
    +
    114 std::vector<std::uint16_t> wt1 = {1, 3, 4, 5}; // Weights of the items
    +
    115 std::vector<std::uint16_t> val1 = {6, 1, 7, 7}; // Values of the items
    +
    116 std::uint16_t W1 = 8; // Maximum capacity of the knapsack
    +
    117 // Test the function and assert the expected output
    +
    118 assert(dynamic_programming::unbounded_knapsack::unboundedKnapsack(
    +
    119 N1, W1, val1, wt1) == 48);
    +
    120 std::cout << "Maximum Knapsack value "
    +
    121 << dynamic_programming::unbounded_knapsack::unboundedKnapsack(
    +
    122 N1, W1, val1, wt1)
    +
    123 << std::endl;
    +
    124
    +
    125 // Test Case 2
    +
    126 std::uint16_t N2 = 3; // Number of items
    +
    127 std::vector<std::uint16_t> wt2 = {10, 20, 30}; // Weights of the items
    +
    128 std::vector<std::uint16_t> val2 = {60, 100, 120}; // Values of the items
    +
    129 std::uint16_t W2 = 5; // Maximum capacity of the knapsack
    +
    130 // Test the function and assert the expected output
    +
    131 assert(dynamic_programming::unbounded_knapsack::unboundedKnapsack(
    +
    132 N2, W2, val2, wt2) == 0);
    +
    133 std::cout << "Maximum Knapsack value "
    +
    134 << dynamic_programming::unbounded_knapsack::unboundedKnapsack(
    +
    135 N2, W2, val2, wt2)
    +
    136 << std::endl;
    +
    137
    +
    138 // Test Case 3
    +
    139 std::uint16_t N3 = 3; // Number of items
    +
    140 std::vector<std::uint16_t> wt3 = {2, 4, 6}; // Weights of the items
    +
    141 std::vector<std::uint16_t> val3 = {5, 11, 13}; // Values of the items
    +
    142 std::uint16_t W3 = 27; // Maximum capacity of the knapsack
    +
    143 // Test the function and assert the expected output
    +
    144 assert(dynamic_programming::unbounded_knapsack::unboundedKnapsack(
    +
    145 N3, W3, val3, wt3) == 27);
    +
    146 std::cout << "Maximum Knapsack value "
    +
    147 << dynamic_programming::unbounded_knapsack::unboundedKnapsack(
    +
    148 N3, W3, val3, wt3)
    +
    149 << std::endl;
    +
    150
    +
    151 // Test Case 4
    +
    152 std::uint16_t N4 = 0; // Number of items
    +
    153 std::vector<std::uint16_t> wt4 = {}; // Weights of the items
    +
    154 std::vector<std::uint16_t> val4 = {}; // Values of the items
    +
    155 std::uint16_t W4 = 10; // Maximum capacity of the knapsack
    +
    156 assert(dynamic_programming::unbounded_knapsack::unboundedKnapsack(
    +
    157 N4, W4, val4, wt4) == 0);
    +
    158 std::cout << "Maximum Knapsack value for empty arrays: "
    +
    159 << dynamic_programming::unbounded_knapsack::unboundedKnapsack(
    +
    160 N4, W4, val4, wt4)
    +
    161 << std::endl;
    +
    162
    +
    163 std::cout << "All test cases passed!" << std::endl;
    +
    164}
    std::endl
    T endl(T... args)
    -
    dynamic_programming::unbounded_knapsack::unboundedKnapsack
    std::uint16_t unboundedKnapsack(std::uint16_t N, std::uint16_t W, const std::vector< std::uint16_t > &val, const std::vector< std::uint16_t > &wt)
    Wrapper function to initiate the unbounded knapsack calculation.
    Definition unbounded_0_1_knapsack.cpp:87
    +
    dynamic_programming::unbounded_knapsack::unboundedKnapsack
    std::uint16_t unboundedKnapsack(std::uint16_t N, std::uint16_t W, const std::vector< std::uint16_t > &val, const std::vector< std::uint16_t > &wt)
    Wrapper function to initiate the unbounded knapsack calculation.
    Definition unbounded_0_1_knapsack.cpp:93
    Here is the call graph for this function:
    @@ -391,11 +411,13 @@ Here is the call graph for this function:
    Returns
    The maximum value that can be obtained for the given capacity.
    -
    89 {
    -
    90 if(N==0)return 0; // Expect 0 since no items
    -
    91 std::vector<std::vector<int>> dp(N, std::vector<int>(W + 1, -1)); // Initialize memoization table
    -
    92 return KnapSackFilling(N - 1, W, val, wt, dp); // Start the calculation
    -
    93}
    +
    95 {
    +
    96 if (N == 0)
    +
    97 return 0; // Expect 0 since no items
    +
    98 std::vector<std::vector<int>> dp(
    +
    99 N, std::vector<int>(W + 1, -1)); // Initialize memoization table
    +
    100 return KnapSackFilling(N - 1, W, val, wt, dp); // Start the calculation
    +
    101}
    Here is the call graph for this function:
    diff --git a/d9/df0/fast__integer__input_8cpp.html b/d9/df0/fast__integer__input_8cpp.html index 7b1583db7..f9b828528 100644 --- a/d9/df0/fast__integer__input_8cpp.html +++ b/d9/df0/fast__integer__input_8cpp.html @@ -147,7 +147,7 @@ Functions
    n = 0
     size of input array.
     
    std::array< int64_t, N > A = {}
    std::array< int64_t, N > A = {}
     input array to perform RMQ.
     
    std::array< std::array< int64_t, N >, M > ST {}
    std::array< std::array< int64_t, N >, M > ST {}
     the sparse table storing min() values for given interval.
     
    std::array< int64_t, N > LOG = {}
    std::array< int64_t, N > LOG = {}
     where floor(log2(i)) are precomputed.
     
    @@ -207,7 +207,7 @@ size_t 
    		n = 0
    - +
    std::array<int64_t, N> data_structures::sparse_table::Sparse_table::A = {}std::array<int64_t, N> data_structures::sparse_table::Sparse_table::A = {}
    @@ -225,7 +225,7 @@ size_t 

    		n = 0
    - +
    std::array<int64_t, N> data_structures::sparse_table::Sparse_table::LOG = {}std::array<int64_t, N> data_structures::sparse_table::Sparse_table::LOG = {}
    @@ -242,7 +242,7 @@ size_t 
    		n = 0
    - +
    std::array<std::array<int64_t, N>, M> data_structures::sparse_table::Sparse_table::ST {}std::array<std::array<int64_t, N>, M> data_structures::sparse_table::Sparse_table::ST {}
    @@ -253,7 +253,7 @@ size_t n = 0
    The documentation for this struct was generated from the following file: diff --git a/da/d52/minimum__edit__distance_8cpp.html b/da/d52/minimum__edit__distance_8cpp.html index 57c24332a..ab93f648d 100644 --- a/da/d52/minimum__edit__distance_8cpp.html +++ b/da/d52/minimum__edit__distance_8cpp.html @@ -114,12 +114,13 @@ $(function(){initNavTree('da/d52/minimum__edit__distance_8cpp.html','../../'); i

    Implementation of Minimum Edit Distance using Dynamic Programing. More...

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

    Operations on Data Structures

    For assert For IO operations For std::queue

    Operations on Data Structures

    -

    for std::count for assert for tolower for string operations for IO Operations

    +

    for std::count for assert for tolower for std::uint32_t for string operations for IO Operations

    Operations on data structures

    Function Documentation

    diff --git a/da/d76/abbreviation_8cpp__incl.map b/da/d76/abbreviation_8cpp__incl.map index 84d695786..a064713c1 100644 --- a/da/d76/abbreviation_8cpp__incl.map +++ b/da/d76/abbreviation_8cpp__incl.map @@ -1,11 +1,13 @@ - + - - - - - - - + + + + + + + + + diff --git a/da/d76/abbreviation_8cpp__incl.md5 b/da/d76/abbreviation_8cpp__incl.md5 index dda82c39c..58d64926d 100644 --- a/da/d76/abbreviation_8cpp__incl.md5 +++ b/da/d76/abbreviation_8cpp__incl.md5 @@ -1 +1 @@ -bfc9221434b7aadf2410099c3ae46c3a \ No newline at end of file +3a94bee802ec80875a2245cb5b5f4a4a \ No newline at end of file diff --git a/da/d76/abbreviation_8cpp__incl.svg b/da/d76/abbreviation_8cpp__incl.svg index 07e127c63..c1da4a855 100644 --- a/da/d76/abbreviation_8cpp__incl.svg +++ b/da/d76/abbreviation_8cpp__incl.svg @@ -4,8 +4,8 @@ - + @@ -23,9 +23,9 @@ Node1 - -dynamic_programming -/abbreviation.cpp + +dynamic_programming +/abbreviation.cpp @@ -42,8 +42,8 @@ Node1->Node2 - - + + @@ -51,8 +51,8 @@ Node3 - -iostream + +cstdint @@ -60,8 +60,8 @@ Node1->Node3 - - + + @@ -69,8 +69,8 @@ Node4 - -string + +iostream @@ -78,8 +78,8 @@ Node1->Node4 - - + + @@ -87,8 +87,8 @@ Node5 - -vector + +string @@ -96,8 +96,26 @@ Node1->Node5 - - + + + + + + + +Node6 + + +vector + + + + + +Node1->Node6 + + + diff --git a/da/d76/abbreviation_8cpp__incl_org.svg b/da/d76/abbreviation_8cpp__incl_org.svg index f8659a4c0..0962aca70 100644 --- a/da/d76/abbreviation_8cpp__incl_org.svg +++ b/da/d76/abbreviation_8cpp__incl_org.svg @@ -4,17 +4,17 @@ - + dynamic_programming/abbreviation.cpp Node1 - -dynamic_programming -/abbreviation.cpp + +dynamic_programming +/abbreviation.cpp @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -40,8 +40,8 @@ Node3 - -iostream + +cstdint @@ -49,8 +49,8 @@ Node1->Node3 - - + + @@ -58,8 +58,8 @@ Node4 - -string + +iostream @@ -67,8 +67,8 @@ Node1->Node4 - - + + @@ -76,8 +76,8 @@ Node5 - -vector + +string @@ -85,8 +85,26 @@ Node1->Node5 - - + + + + + + + +Node6 + + +vector + + + + + +Node1->Node6 + + + diff --git a/da/d9a/class_graph.html b/da/d9a/class_graph.html index 47badc1e3..928d7d046 100644 --- a/da/d9a/class_graph.html +++ b/da/d9a/class_graph.html @@ -116,7 +116,7 @@ $(function(){initNavTree('da/d9a/class_graph.html','../../'); initResizable(true
    Collaboration diagram for Graph:
    -
    +
    [legend]

    @@ -208,43 +209,48 @@ Algorithm

    If last characters are same, ignore last char and recur for remaining string

    If the last character is different, consider all possibilities and find the minimum

    returning the minimum cost of operations needed to convert str1 to str2

    -
    88 {
    -
    89 /// Create a table to store results of subproblems
    -
    90 std::vector<std::vector<uint64_t>>dp(m+1, std::vector<uint64_t>(n+1)); /// creasting 2D vector dp to store the results of subproblems
    -
    91
    -
    92 /// Fill d[][] in bottom up manner
    -
    93 for (uint64_t i = 0; i <= m; i++) {
    -
    94 for (uint64_t j = 0; j <= n; j++) {
    -
    95 /// If first string is empty, only option is to
    -
    96 /// insert all characters of second string
    -
    97 if (i == 0) {
    -
    98 dp[i][j] = j; /// Minimum operations = j
    -
    99 }
    +
    93 {
    +
    94 /// Create a table to store results of subproblems
    +
    95 std::vector<std::vector<uint64_t>> dp(
    +
    96 m + 1,
    +
    97 std::vector<uint64_t>(
    +
    98 n +
    +
    99 1)); /// creasting 2D vector dp to store the results of subproblems
    100
    -
    101 /// If second string is empty, only option is to
    -
    102 /// remove all characters of second string
    -
    103 else if (j == 0) {
    -
    104 dp[i][j] = i; /// Minimum operations = i
    -
    105 }
    -
    106
    -
    107 /// If last characters are same, ignore last char
    -
    108 /// and recur for remaining string
    -
    109 else if (str1[i - 1] == str2[j - 1]) {
    -
    110 dp[i][j] = dp[i - 1][j - 1];
    -
    111 }
    -
    112
    -
    113 /// If the last character is different, consider all
    -
    114 /// possibilities and find the minimum
    -
    115 else {
    -
    116 dp[i][j] = 1 + min(dp[i][j - 1], // Insert
    -
    117 dp[i - 1][j], // Remove
    -
    118 dp[i - 1][j - 1]); // Replace
    -
    119 }
    -
    120 }
    -
    121 }
    -
    122
    -
    123 return dp[m][n]; /// returning the minimum cost of operations needed to convert str1 to str2
    -
    124}
    +
    101 /// Fill d[][] in bottom up manner
    +
    102 for (uint64_t i = 0; i <= m; i++) {
    +
    103 for (uint64_t j = 0; j <= n; j++) {
    +
    104 /// If first string is empty, only option is to
    +
    105 /// insert all characters of second string
    +
    106 if (i == 0) {
    +
    107 dp[i][j] = j; /// Minimum operations = j
    +
    108 }
    +
    109
    +
    110 /// If second string is empty, only option is to
    +
    111 /// remove all characters of second string
    +
    112 else if (j == 0) {
    +
    113 dp[i][j] = i; /// Minimum operations = i
    +
    114 }
    +
    115
    +
    116 /// If last characters are same, ignore last char
    +
    117 /// and recur for remaining string
    +
    118 else if (str1[i - 1] == str2[j - 1]) {
    +
    119 dp[i][j] = dp[i - 1][j - 1];
    +
    120 }
    +
    121
    +
    122 /// If the last character is different, consider all
    +
    123 /// possibilities and find the minimum
    +
    124 else {
    +
    125 dp[i][j] = 1 + min(dp[i][j - 1], // Insert
    +
    126 dp[i - 1][j], // Remove
    +
    127 dp[i - 1][j - 1]); // Replace
    +
    128 }
    +
    129 }
    +
    130 }
    +
    131
    +
    132 return dp[m][n]; /// returning the minimum cost of operations needed to
    +
    133 /// convert str1 to str2
    +
    134}
    std::min
    T min(T... args)
    dp
    for std::vector
    Definition partition_problem.cpp:39
    @@ -279,11 +285,11 @@ Algorithm
    Returns
    0 on exit
    -
    160 {
    -
    161 test(); // run self-test implementations
    -
    162 return 0;
    -
    163}
    -
    test
    static void test()
    Self-test implementations.
    Definition minimum_edit_distance.cpp:132
    +
    173 {
    +
    174 test(); // run self-test implementations
    +
    175 return 0;
    +
    176}
    +
    test
    static void test()
    Self-test implementations.
    Definition minimum_edit_distance.cpp:142
    Here is the call graph for this function:
    @@ -333,17 +339,16 @@ z if z is the minimum value

    returns x, if x is the minimum value

    returns y, if y is the minimum value

    returns z if z is the minimum value

    -
    63 {
    -
    64 if (x <= y && x <= z) {
    -
    65 return x; /// returns x, if x is the minimum value
    -
    66 }
    -
    67 if (y <= x && y <= z) {
    -
    68 return y; /// returns y, if y is the minimum value
    -
    69 }
    -
    70 else {
    -
    71 return z; /// returns z if z is the minimum value
    -
    72 }
    -
    73}
    +
    68 {
    +
    69 if (x <= y && x <= z) {
    +
    70 return x; /// returns x, if x is the minimum value
    +
    71 }
    +
    72 if (y <= x && y <= z) {
    +
    73 return y; /// returns y, if y is the minimum value
    +
    74 } else {
    +
    75 return z; /// returns z if z is the minimum value
    +
    76 }
    +
    77}
    @@ -372,31 +377,34 @@ z if z is the minimum value

    Self-test implementations.

    Returns
    void
    -
    132 {
    -
    133 // 1st test
    -
    134 std::string str1 = "INTENTION"; // Sample input of 1st string
    -
    135 std::string str2 = "EXECUTION"; // Sample input of 2nd string
    -
    136 uint64_t expected_output1 = 5; // Expected minimum cost
    -
    137 uint64_t output1 = dynamic_programming::minimum_edit_distance::editDistDP(
    -
    138 str1, str2, str1.length(), str2.length()); // calling the editDistDP function and storing the result on output1
    -
    139 assert(output1 == expected_output1); // comparing the output with the expected output
    -
    140 std::cout << "Minimum Number of Operations Required: " << output1
    -
    141 << std::endl;
    -
    142
    -
    143 // 2nd test
    -
    144 std::string str3 = "SATURDAY";
    -
    145 std::string str4 = "SUNDAY";
    -
    146 uint64_t expected_output2 = 3;
    -
    147 uint64_t output2 = dynamic_programming::minimum_edit_distance::editDistDP(
    -
    148 str3, str4, str3.length(), str4.length());
    -
    149 assert(output2 == expected_output2);
    -
    150 std::cout << "Minimum Number of Operations Required: " << output2
    -
    151 << std::endl;
    -
    152}
    +
    142 {
    +
    143 // 1st test
    +
    144 std::string str1 = "INTENTION"; // Sample input of 1st string
    +
    145 std::string str2 = "EXECUTION"; // Sample input of 2nd string
    +
    146 uint64_t expected_output1 = 5; // Expected minimum cost
    +
    147 uint64_t output1 = dynamic_programming::minimum_edit_distance::editDistDP(
    +
    148 str1, str2, str1.length(),
    +
    149 str2.length()); // calling the editDistDP function and storing the
    +
    150 // result on output1
    +
    151 assert(output1 ==
    +
    152 expected_output1); // comparing the output with the expected output
    +
    153 std::cout << "Minimum Number of Operations Required: " << output1
    +
    154 << std::endl;
    +
    155
    +
    156 // 2nd test
    +
    157 std::string str3 = "SATURDAY";
    +
    158 std::string str4 = "SUNDAY";
    +
    159 uint64_t expected_output2 = 3;
    +
    160 uint64_t output2 = dynamic_programming::minimum_edit_distance::editDistDP(
    +
    161 str3, str4, str3.length(), str4.length());
    +
    162 assert(output2 == expected_output2);
    +
    163 std::cout << "Minimum Number of Operations Required: " << output2
    +
    164 << std::endl;
    +
    165}
    std::endl
    T endl(T... args)
    -
    dynamic_programming::minimum_edit_distance::editDistDP
    uint64_t editDistDP(std::string str1, std::string str2, uint64_t m, uint64_t n)
    Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute t...
    Definition minimum_edit_distance.cpp:88
    +
    dynamic_programming::minimum_edit_distance::editDistDP
    uint64_t editDistDP(std::string str1, std::string str2, uint64_t m, uint64_t n)
    Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute t...
    Definition minimum_edit_distance.cpp:92
    std::string::length
    T length(T... args)
    Here is the call graph for this function:
    diff --git a/da/d6d/namespaceoperations__on__datastructures.html b/da/d6d/namespaceoperations__on__datastructures.html index 398104599..9d978466c 100644 --- a/da/d6d/namespaceoperations__on__datastructures.html +++ b/da/d6d/namespaceoperations__on__datastructures.html @@ -143,7 +143,7 @@ Functions
    - - + + @@ -253,13 +253,12 @@ int <

    @@ -172,9 +172,9 @@ int 

    		vertexNum
    int edgeNum
     
    -Edge * edges
     
    +std::vector< Edge > edges
     
    int ** edges
     
    max_flow = 0
    -
    19 {
    -
    20 this->vertexNum = V;
    -
    21 this->edgeNum = E;
    -
    22 this->edges = (Edge *)malloc(E * sizeof(Edge));
    -
    23 }
    -
    Edge
    Definition bellman_ford.cpp:7
    -
    std::malloc
    T malloc(T... args)
    +
    20 {
    +
    21 this->vertexNum = V;
    +
    22 this->edgeNum = E;
    +
    23 this->edges.reserve(E);
    +
    24 }
    +
    std::vector::reserve
    T reserve(T... args)
    @@ -285,15 +284,15 @@ int max_flow = 0<
    -
    16 {
    -
    17 this->vertexNum = V;
    -
    18 this->edges = new int *[V];
    -
    19 for (int i = 0; i < V; i++) {
    -
    20 this->edges[i] = new int[V];
    -
    21 for (int j = 0; j < V; j++) this->edges[i][j] = INT_MAX;
    -
    22 this->edges[i][i] = 0;
    -
    23 }
    -
    24 }
    +
    17 {
    +
    18 this->vertexNum = V;
    +
    19 this->edges = new int *[V];
    +
    20 for (int i = 0; i < V; i++) {
    +
    21 this->edges[i] = new int[V];
    +
    22 for (int j = 0; j < V; j++) this->edges[i][j] = INT_MAX;
    +
    23 this->edges[i][i] = 0;
    +
    24 }
    +
    25 }
    @@ -319,10 +318,12 @@ int max_flow = 0<
    -
    26 {
    -
    27 for (int i = 0; i < vertexNum; i++) delete[] edges[i];
    -
    28 delete[] edges;
    -
    29 }
    +
    27 {
    +
    28 for (int i = 0; i < vertexNum; i++) {
    +
    29 delete[] edges[i];
    +
    30 }
    +
    31 delete[] edges;
    +
    32 }
    @@ -547,16 +548,17 @@ int max_flow = 0<
    -
    26 {
    -
    27 static int edgeInd = 0;
    -
    28 if (edgeInd < this->edgeNum) {
    -
    29 Edge newEdge;
    -
    30 newEdge.src = src;
    -
    31 newEdge.dst = dst;
    -
    32 newEdge.weight = weight;
    -
    33 this->edges[edgeInd++] = newEdge;
    -
    34 }
    -
    35 }
    +
    27 {
    +
    28 static int edgeInd = 0;
    +
    29 if (edgeInd < this->edgeNum) {
    +
    30 Edge newEdge;
    +
    31 newEdge.src = src;
    +
    32 newEdge.dst = dst;
    +
    33 newEdge.weight = weight;
    +
    34 this->edges[edgeInd++] = newEdge;
    +
    35 }
    +
    36 }
    +
    Edge
    Definition bellman_ford.cpp:8
    @@ -591,9 +593,9 @@ int max_flow = 0<
    -
    32 {
    -
    33 this->edges[src][dst] = weight;
    -
    34 }
    +
    35 {
    +
    36 this->edges[src][dst] = weight;
    +
    37 }
    diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp.html b/da/de8/dijkstra__greedy_8cpp.html similarity index 93% rename from df/dcb/greedy__algorithms_2dijkstra_8cpp.html rename to da/de8/dijkstra__greedy_8cpp.html index 33803af6e..ec8a46731 100644 --- a/df/dcb/greedy__algorithms_2dijkstra_8cpp.html +++ b/da/de8/dijkstra__greedy_8cpp.html @@ -5,7 +5,7 @@ -Algorithms_in_C++: greedy_algorithms/dijkstra.cpp File Reference +Algorithms_in_C++: greedy_algorithms/dijkstra_greedy.cpp File Reference @@ -78,7 +78,7 @@ $(function() {
    @@ -108,7 +108,7 @@ $(function(){initNavTree('df/dcb/greedy__algorithms_2dijkstra_8cpp.html','../../ Classes | Namespaces | Functions
    -
    dijkstra.cpp File Reference
    +
    dijkstra_greedy.cpp File Reference
    @@ -119,9 +119,9 @@ $(function(){initNavTree('df/dcb/greedy__algorithms_2dijkstra_8cpp.html','../../ #include <iostream>
    #include <vector>
    -Include dependency graph for dijkstra.cpp:
    +Include dependency graph for dijkstra_greedy.cpp:
    -
    +

    Main function.

    Returns
    0 on exit
    199 {
    -
    200 tests(); // run self-test implementations
    +
    200 tests(); // run self-test implementations
    201 return 0;
    202}
    -
    tests
    void tests()
    Definition dijkstra.cpp:113
    +
    tests
    static void tests()
    Self-test implementations.
    Definition dijkstra_greedy.cpp:160
    Here is the call graph for this function:
    -
    +
    @@ -255,7 +255,7 @@ Here is the call graph for this function:
    192 std::cout << "All tests have successfully passed!\n";
    193}
    -
    greedy_algorithms::dijkstra::Graph
    Wrapper class for storing a graph.
    Definition dijkstra.cpp:35
    +
    greedy_algorithms::dijkstra::Graph
    Wrapper class for storing a graph.
    Definition dijkstra_greedy.cpp:35
    graph
    Graph Algorithms.
    @@ -265,7 +265,7 @@ Here is the call graph for this function: diff --git a/da/de8/dijkstra__greedy_8cpp.js b/da/de8/dijkstra__greedy_8cpp.js new file mode 100644 index 000000000..f713328bd --- /dev/null +++ b/da/de8/dijkstra__greedy_8cpp.js @@ -0,0 +1,9 @@ +var dijkstra__greedy_8cpp = +[ + [ "greedy_algorithms::dijkstra::Graph", "d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html", "d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph" ], + [ "dijkstra", "da/de8/dijkstra__greedy_8cpp.html#af915876d0ca33cc71a6a6191a8cd3ccd", null ], + [ "main", "da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "minimum_distance", "da/de8/dijkstra__greedy_8cpp.html#af6cb29ca6dc5771439f6ea7262058a71", null ], + [ "print", "da/de8/dijkstra__greedy_8cpp.html#a7341d7c76a6145e991cdd231f689fca8", null ], + [ "tests", "da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ] +]; \ No newline at end of file diff --git a/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..2ab19cd06 --- /dev/null +++ b/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..a4288c571 --- /dev/null +++ b/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +ed234f3308411cd94ef89d2c5e550bb7 \ No newline at end of file diff --git a/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..fe8a2402e --- /dev/null +++ b/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,65 @@ + + + + + + + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +tests + + + + + +Node1->Node2 + + + + + + + + + + + + + diff --git a/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg new file mode 100644 index 000000000..45d98052a --- /dev/null +++ b/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -0,0 +1,39 @@ + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +tests + + + + + +Node1->Node2 + + + + + + + + diff --git a/db/d0d/prime__factorization_8cpp.html b/db/d0d/prime__factorization_8cpp.html index f5d206a57..1e1c98482 100644 --- a/db/d0d/prime__factorization_8cpp.html +++ b/db/d0d/prime__factorization_8cpp.html @@ -254,21 +254,21 @@ Here is the call graph for this function:
    24 // initializes the array isprime
    25 memset(isprime, true, sizeof isprime);
    26
    -
    27 for (int i = 2; i <= N; i++) {
    +
    27 for (int i = 2; i <= N; i++) {
    28 if (isprime[i]) {
    -
    29 for (int j = 2 * i; j <= N; j += i) isprime[j] = false;
    +
    29 for (int j = 2 * i; j <= N; j += i) isprime[j] = false;
    30 }
    31 }
    32
    -
    33 for (int i = 2; i <= N; i++) {
    +
    33 for (int i = 2; i <= N; i++) {
    34 if (isprime[i])
    35 prime_numbers.push_back(i);
    36 }
    37}
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    std::memset
    T memset(T... args)
    isprime
    bool isprime[1000006]
    Definition prime_factorization.cpp:13
    std::vector::push_back
    T push_back(T... args)
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    Here is the call graph for this function:
    diff --git a/db/d82/classlarge__number.html b/db/d82/classlarge__number.html index 804e07685..b36fcc303 100644 --- a/db/d82/classlarge__number.html +++ b/db/d82/classlarge__number.html @@ -989,15 +989,15 @@ template<class T >

    operator overload to compare two numbers

    155 {
    -
    156 size_t N = a.num_digits();
    +
    156 size_t N = a.num_digits();
    157 if (N != b.num_digits())
    158 return false;
    -
    159 for (size_t i = 0; i < N; i++)
    +
    159 for (size_t i = 0; i < N; i++)
    160 if (a[i] != b[i])
    161 return false;
    162 return true;
    163 }
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    diff --git a/db/d83/backtracking_2subset__sum_8cpp__incl.map b/db/da8/subset__sum_8cpp__incl.map similarity index 100% rename from db/d83/backtracking_2subset__sum_8cpp__incl.map rename to db/da8/subset__sum_8cpp__incl.map diff --git a/db/d83/backtracking_2subset__sum_8cpp__incl.md5 b/db/da8/subset__sum_8cpp__incl.md5 similarity index 100% rename from db/d83/backtracking_2subset__sum_8cpp__incl.md5 rename to db/da8/subset__sum_8cpp__incl.md5 diff --git a/db/d83/backtracking_2subset__sum_8cpp__incl.svg b/db/da8/subset__sum_8cpp__incl.svg similarity index 100% rename from db/d83/backtracking_2subset__sum_8cpp__incl.svg rename to db/da8/subset__sum_8cpp__incl.svg diff --git a/db/d83/backtracking_2subset__sum_8cpp__incl_org.svg b/db/da8/subset__sum_8cpp__incl_org.svg similarity index 100% rename from db/d83/backtracking_2subset__sum_8cpp__incl_org.svg rename to db/da8/subset__sum_8cpp__incl_org.svg diff --git a/db/dc8/dijkstra__greedy_8cpp__incl.map b/db/dc8/dijkstra__greedy_8cpp__incl.map new file mode 100644 index 000000000..d8941b481 --- /dev/null +++ b/db/dc8/dijkstra__greedy_8cpp__incl.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/db/dc8/dijkstra__greedy_8cpp__incl.md5 b/db/dc8/dijkstra__greedy_8cpp__incl.md5 new file mode 100644 index 000000000..6ae8fd1fc --- /dev/null +++ b/db/dc8/dijkstra__greedy_8cpp__incl.md5 @@ -0,0 +1 @@ +12cf6411239a35fd4228a5c4086408c4 \ No newline at end of file diff --git a/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.svg b/db/dc8/dijkstra__greedy_8cpp__incl.svg similarity index 72% rename from d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.svg rename to db/dc8/dijkstra__greedy_8cpp__incl.svg index 875bc001b..2fc07b0ad 100644 --- a/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.svg +++ b/db/dc8/dijkstra__greedy_8cpp__incl.svg @@ -3,9 +3,9 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - + + @@ -17,14 +17,15 @@ ]]> - -greedy_algorithms/dijkstra.cpp + +greedy_algorithms/dijkstra_greedy.cpp Node1 - -greedy_algorithms/dijkstra.cpp + +greedy_algorithms/dijkstra +_greedy.cpp @@ -41,8 +42,8 @@ Node1->Node2 - - + + @@ -59,8 +60,8 @@ Node1->Node3 - - + + @@ -77,8 +78,8 @@ Node1->Node4 - - + + @@ -95,8 +96,8 @@ Node1->Node5 - - + + diff --git a/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl_org.svg b/db/dc8/dijkstra__greedy_8cpp__incl_org.svg similarity index 66% rename from d2/d48/greedy__algorithms_2dijkstra_8cpp__incl_org.svg rename to db/dc8/dijkstra__greedy_8cpp__incl_org.svg index 088e7ea59..9af06fa6e 100644 --- a/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl_org.svg +++ b/db/dc8/dijkstra__greedy_8cpp__incl_org.svg @@ -3,17 +3,18 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - - -greedy_algorithms/dijkstra.cpp + + + +greedy_algorithms/dijkstra_greedy.cpp Node1 - -greedy_algorithms/dijkstra.cpp + +greedy_algorithms/dijkstra +_greedy.cpp @@ -30,8 +31,8 @@ Node1->Node2 - - + + @@ -48,8 +49,8 @@ Node1->Node3 - - + + @@ -66,8 +67,8 @@ Node1->Node4 - - + + @@ -84,8 +85,8 @@ Node1->Node5 - - + + diff --git a/db/dca/kadane2_8cpp.js b/db/dca/kadane2_8cpp.js deleted file mode 100644 index c04872895..000000000 --- a/db/dca/kadane2_8cpp.js +++ /dev/null @@ -1,5 +0,0 @@ -var kadane2_8cpp = -[ - [ "main", "db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], - [ "maxSubArray", "db/dca/kadane2_8cpp.html#af3029007a422a914a85c0b0122f1c7b4", null ] -]; \ No newline at end of file diff --git a/dc/d1f/classcatalan__numbers.html b/dc/d1f/classcatalan__numbers.html index d8e012a39..65521e00d 100644 --- a/dc/d1f/classcatalan__numbers.html +++ b/dc/d1f/classcatalan__numbers.html @@ -148,7 +148,7 @@ Private Attributes

    @@ -183,14 +183,14 @@ Functions

    Detailed Description

    computes and caches Catalan numbers

    -

    for assert for std::uint64_t for std::size_t for std::transform_reduce for std::vector

    +

    for assert for std::uint64_t for std::size_t for std::plus & std::multiplies for std::transform_reduce for std::vector

    Member Function Documentation

    ◆ add()

    @@ -172,7 +172,7 @@ Private Attributes
    -
    31{ known.push_back(this->compute_next()); }
    +
    32{ known.push_back(this->compute_next()); }
    @@ -198,11 +198,11 @@ Private Attributes
    -
    25 {
    -
    26 return std::transform_reduce(known.begin(), known.end(), known.rbegin(),
    -
    27 static_cast<value_type>(), std::plus<>(),
    -
    28 std::multiplies<>());
    -
    29 }
    +
    26 {
    +
    27 return std::transform_reduce(known.begin(), known.end(), known.rbegin(),
    +
    28 static_cast<value_type>(0), std::plus<>(),
    +
    29 std::multiplies<>());
    +
    30 }
    @@ -233,12 +233,12 @@ Private Attributes

    computes the n-th Catalan number and updates the cache.

    Returns
    the n-th Catalan number
    -
    38 {
    -
    39 while (known.size() <= n) {
    -
    40 this->add();
    -
    41 }
    -
    42 return known[n];
    -
    43 }
    +
    39 {
    +
    40 while (known.size() <= n) {
    +
    41 this->add();
    +
    42 }
    +
    43 return known[n];
    +
    44 }
    @@ -262,7 +262,7 @@ Private Attributes
    -
    23{1, 1};
    +
    24{1, 1};
    diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp.html b/dc/d38/ordinary__least__squares__regressor_8cpp.html index c7044cdc6..2f6739bed 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp.html +++ b/dc/d38/ordinary__least__squares__regressor_8cpp.html @@ -259,13 +259,13 @@ template<typename T >

    Get matrix inverse using Row-trasnformations. Given matrix must be a square and non-singular.

    Returns
    inverse matrix
    227 {
    228 // Assuming A is square matrix
    -
    229 size_t N = A.size();
    +
    229 size_t N = A.size();
    230
    231 std::vector<std::vector<float>> inverse(N);
    -
    232 for (size_t row = 0; row < N; row++) {
    +
    232 for (size_t row = 0; row < N; row++) {
    233 // preallocatae a resultant identity matrix
    234 inverse[row] = std::vector<float>(N);
    -
    235 for (size_t col = 0; col < N; col++) {
    +
    235 for (size_t col = 0; col < N; col++) {
    236 inverse[row][col] = (row == col) ? 1.f : 0.f;
    237 }
    238 }
    @@ -277,25 +277,25 @@ template<typename T >
    244
    245 // preallocatae a temporary matrix identical to A
    246 std::vector<std::vector<float>> temp(N);
    -
    247 for (size_t row = 0; row < N; row++) {
    +
    247 for (size_t row = 0; row < N; row++) {
    248 std::vector<float> v(N);
    -
    249 for (size_t col = 0; col < N; col++) {
    +
    249 for (size_t col = 0; col < N; col++) {
    250 v[col] = static_cast<float>(A[row][col]);
    251 }
    252 temp[row] = v;
    253 }
    254
    255 // start transformations
    -
    256 for (size_t row = 0; row < N; row++) {
    -
    257 for (size_t row2 = row; row2 < N && temp[row][row] == 0; row2++) {
    +
    256 for (size_t row = 0; row < N; row++) {
    +
    257 for (size_t row2 = row; row2 < N && temp[row][row] == 0; row2++) {
    258 // this to ensure diagonal elements are not 0
    259 temp[row] = temp[row] + temp[row2];
    260 inverse[row] = inverse[row] + inverse[row2];
    261 }
    262
    -
    263 for (size_t col2 = row; col2 < N && temp[row][row] == 0; col2++) {
    +
    263 for (size_t col2 = row; col2 < N && temp[row][row] == 0; col2++) {
    264 // this to further ensure diagonal elements are not 0
    -
    265 for (size_t row2 = 0; row2 < N; row2++) {
    +
    265 for (size_t row2 = 0; row2 < N; row2++) {
    266 temp[row2][row] = temp[row2][row] + temp[row2][col2];
    267 inverse[row2][row] = inverse[row2][row] + inverse[row2][col2];
    268 }
    @@ -312,7 +312,7 @@ template<typename T >
    279 temp[row] = temp[row] / divisor;
    280 inverse[row] = inverse[row] / divisor;
    281 // Row transformations
    -
    282 for (size_t row2 = 0; row2 < N; row2++) {
    +
    282 for (size_t row2 = 0; row2 < N; row2++) {
    283 if (row2 == row) {
    284 continue;
    285 }
    @@ -325,9 +325,9 @@ template<typename T >
    292 return inverse;
    293}
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    std::endl
    T endl(T... args)
    is_square
    bool is_square(std::vector< std::vector< T > > const &A)
    Definition ordinary_least_squares_regressor.cpp:59
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    Here is the call graph for this function:
    @@ -395,8 +395,8 @@ template<typename T >

    function to check if given matrix is a square matrix

    Returns
    1 if true, 0 if false
    59 {
    60 // Assuming A is square matrix
    -
    61 size_t N = A.size();
    -
    62 for (size_t i = 0; i < N; i++) {
    +
    61 size_t N = A.size();
    +
    62 for (size_t i = 0; i < N; i++) {
    63 if (A[i].size() != N) {
    64 return false;
    65 }
    @@ -424,14 +424,14 @@ template<typename T >
    423 {
    424 ols_test();
    425
    -
    426 size_t N = 0, F = 0;
    +
    426 size_t N = 0, F = 0;
    427
    428 std::cout << "Enter number of features: ";
    429 // number of features = columns
    430 std::cin >> F;
    431 std::cout << "Enter number of samples: ";
    432 // number of samples = rows
    -
    433 std::cin >> N;
    +
    433 std::cin >> N;
    434
    435 std::vector<std::vector<float>> data(N);
    436 std::vector<float> Y(N);
    @@ -440,7 +440,7 @@ template<typename T >
    439 << "Enter training data. Per sample, provide features and one output."
    440 << std::endl;
    441
    -
    442 for (size_t rows = 0; rows < N; rows++) {
    +
    442 for (size_t rows = 0; rows < N; rows++) {
    443 std::vector<float> v(F);
    444 std::cout << "Sample# " << rows + 1 << ": ";
    445 for (size_t cols = 0; cols < F; cols++) {
    @@ -503,7 +503,7 @@ Here is the call graph for this function:

    Self test checks

    369 {
    -
    370 int F = 3, N = 5;
    +
    370 int F = 3, N = 5;
    371
    372 /* test function = x^2 -5 */
    373 std::cout << "Test 1 (quadratic function)....";
    @@ -770,7 +770,7 @@ template<typename T >

    addition of two vectors of identical lengths

    Returns
    resultant vector
    204 {
    205 // Number of rows in A
    -
    206 size_t N = A.size();
    +
    206 size_t N = A.size();
    207
    208 std::vector<T> result(N);
    209
    @@ -779,7 +779,7 @@ template<typename T >
    212 return A;
    213 }
    214
    -
    215 for (size_t row = 0; row < N; row++) result[row] = A[row] + B[row];
    +
    215 for (size_t row = 0; row < N; row++) result[row] = A[row] + B[row];
    216
    217 return result;
    218}
    @@ -814,7 +814,7 @@ template<typename T >

    subtraction of two vectors of identical lengths

    Returns
    resultant vector
    183 {
    184 // Number of rows in A
    -
    185 size_t N = A.size();
    +
    185 size_t N = A.size();
    186
    187 std::vector<T> result(N);
    188
    @@ -823,7 +823,7 @@ template<typename T >
    191 return A;
    192 }
    193
    -
    194 for (size_t row = 0; row < N; row++) result[row] = A[row] - B[row];
    +
    194 for (size_t row = 0; row < N; row++) result[row] = A[row] - B[row];
    195
    196 return result;
    197}
    diff --git a/dc/d53/dynamic__programming_2subset__sum_8cpp__incl.md5 b/dc/d53/dynamic__programming_2subset__sum_8cpp__incl.md5 deleted file mode 100644 index 40d9d49d6..000000000 --- a/dc/d53/dynamic__programming_2subset__sum_8cpp__incl.md5 +++ /dev/null @@ -1 +0,0 @@ -f37d041f4629cbec5ee664a01f66ee5d \ No newline at end of file diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp.html b/dc/d67/subset__sum__dynamic_8cpp.html similarity index 89% rename from d6/d80/dynamic__programming_2subset__sum_8cpp.html rename to dc/d67/subset__sum__dynamic_8cpp.html index 0fe46048a..f84fd6890 100644 --- a/d6/d80/dynamic__programming_2subset__sum_8cpp.html +++ b/dc/d67/subset__sum__dynamic_8cpp.html @@ -5,7 +5,7 @@ -Algorithms_in_C++: dynamic_programming/subset_sum.cpp File Reference +Algorithms_in_C++: dynamic_programming/subset_sum_dynamic.cpp File Reference @@ -78,7 +78,7 @@ $(function() {
    @@ -107,7 +107,7 @@ $(function(){initNavTree('d6/d80/dynamic__programming_2subset__sum_8cpp.html','.
    Namespaces | Functions
    -
    subset_sum.cpp File Reference
    +
    subset_sum_dynamic.cpp File Reference
    @@ -118,9 +118,9 @@ $(function(){initNavTree('d6/d80/dynamic__programming_2subset__sum_8cpp.html','. #include <unordered_map>
    #include <vector>
    -Include dependency graph for subset_sum.cpp:
    +Include dependency graph for subset_sum_dynamic.cpp:
    -
    +

    Main function.

    Returns
    0 on exit
    120 {
    -
    121 test(); // execute the test
    +
    121 test(); // execute the test
    122 return 0;
    123}
    -
    test
    static void test()
    Test implementations.
    Definition subset_sum.cpp:58
    +
    test
    static void test()
    Test Function.
    Definition subset_sum_dynamic.cpp:82
    Here is the call graph for this function:
    -
    +
    @@ -210,14 +210,14 @@ Here is the call graph for this function:
    72 std::vector<std::unordered_map<int, bool>> dp(n);
    73 return subset_sum_recursion(arr, targetSum, &dp);
    74}
    -
    dynamic_programming::subset_sum::subset_sum_recursion
    bool subset_sum_recursion(const std::vector< int > &arr, int targetSum, std::vector< std::unordered_map< int, bool > > *dp, int index=0)
    Definition subset_sum.cpp:43
    dp
    for std::vector
    Definition partition_problem.cpp:39
    std::vector::size
    T size(T... args)
    +
    dynamic_programming::subset_sum::subset_sum_recursion
    bool subset_sum_recursion(const std::vector< int > &arr, int targetSum, std::vector< std::unordered_map< int, bool > > *dp, int index=0)
    Definition subset_sum_dynamic.cpp:43
    Here is the call graph for this function:
    -
    +
    @@ -280,7 +280,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -344,7 +344,7 @@ Here is the call graph for this function:
    113 std::cout << "All tests passed successfully!\n";
    114}
    -
    dynamic_programming::subset_sum::subset_sum_problem
    bool subset_sum_problem(const std::vector< int > &arr, const int targetSum)
    Definition subset_sum.cpp:70
    +
    dynamic_programming::subset_sum::subset_sum_problem
    bool subset_sum_problem(const std::vector< int > &arr, const int targetSum)
    Definition subset_sum_dynamic.cpp:70
    @@ -353,7 +353,7 @@ Here is the call graph for this function: diff --git a/dc/d67/subset__sum__dynamic_8cpp.js b/dc/d67/subset__sum__dynamic_8cpp.js new file mode 100644 index 000000000..e80925e81 --- /dev/null +++ b/dc/d67/subset__sum__dynamic_8cpp.js @@ -0,0 +1,7 @@ +var subset__sum__dynamic_8cpp = +[ + [ "main", "dc/d67/subset__sum__dynamic_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "subset_sum_problem", "dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50", null ], + [ "subset_sum_recursion", "dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607", null ], + [ "test", "dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] +]; \ No newline at end of file diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.map b/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.map similarity index 100% rename from d6/d80/dynamic__programming_2subset__sum_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.map rename to dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.map diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.md5 b/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.md5 similarity index 100% rename from d6/d80/dynamic__programming_2subset__sum_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.md5 rename to dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.md5 diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.svg b/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.svg similarity index 100% rename from d6/d80/dynamic__programming_2subset__sum_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.svg rename to dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.svg diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph_org.svg b/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph_org.svg similarity index 100% rename from d6/d80/dynamic__programming_2subset__sum_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph_org.svg rename to dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph_org.svg diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.map b/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.map similarity index 86% rename from d6/d80/dynamic__programming_2subset__sum_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.map rename to dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.map index dba46e138..60ac19097 100644 --- a/d6/d80/dynamic__programming_2subset__sum_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.map +++ b/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.map @@ -3,7 +3,7 @@ - + diff --git a/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.md5 b/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.md5 new file mode 100644 index 000000000..52c04bf00 --- /dev/null +++ b/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.md5 @@ -0,0 +1 @@ +a799c8350acde7e0a640460bc007eeb6 \ No newline at end of file diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg b/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg similarity index 96% rename from d6/d80/dynamic__programming_2subset__sum_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg rename to dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg index 477004702..936c98fe2 100644 --- a/d6/d80/dynamic__programming_2subset__sum_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg +++ b/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg @@ -60,7 +60,7 @@ Node3 - + dynamic_programming ::subset_sum::subset diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph_org.svg b/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph_org.svg similarity index 96% rename from d6/d80/dynamic__programming_2subset__sum_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph_org.svg rename to dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph_org.svg index 4e4fb6131..f6f0417e6 100644 --- a/d6/d80/dynamic__programming_2subset__sum_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph_org.svg +++ b/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph_org.svg @@ -49,7 +49,7 @@ Node3 - + dynamic_programming ::subset_sum::subset diff --git a/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..d11a560f0 --- /dev/null +++ b/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..88eb0782b --- /dev/null +++ b/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +b99b125d4f3d2e424b8c91b3bc18eff5 \ No newline at end of file diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg similarity index 67% rename from d6/d80/dynamic__programming_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg rename to dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 5c8b057f7..1ea8536db 100644 --- a/d6/d80/dynamic__programming_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,8 +4,8 @@ - + @@ -31,7 +31,7 @@ Node2 - + test @@ -46,24 +46,6 @@ - - -Node3 - - -std::endl - - - - - -Node2->Node3 - - - - - - diff --git a/d6/d80/dynamic__programming_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg similarity index 56% rename from d6/d80/dynamic__programming_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg rename to dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 1d7d59347..10e106712 100644 --- a/d6/d80/dynamic__programming_2subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -4,8 +4,8 @@ - + main @@ -20,7 +20,7 @@ Node2 - + test @@ -35,23 +35,5 @@ - - -Node3 - - -std::endl - - - - - -Node2->Node3 - - - - - - diff --git a/dc/dfe/ternary__search_8cpp.html b/dc/dfe/ternary__search_8cpp.html index 2a14be556..1a9df6c06 100644 --- a/dc/dfe/ternary__search_8cpp.html +++ b/dc/dfe/ternary__search_8cpp.html @@ -294,13 +294,13 @@ Functions

    Main function

    134 {
    -
    135 int N = 21;
    +
    135 int N = 21;
    136 int A[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 10};
    137 get_input();
    138 ternary_search(N, A, _target);
    139 return 0;
    140}
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    _target
    #define _target
    Definition ternary_search.cpp:27
    get_input
    void get_input()
    Definition ternary_search.cpp:36
    ternary_search
    void ternary_search(int N, int A[], int target)
    Definition ternary_search.cpp:127
    diff --git a/dd/d0d/insertion__sort_8cpp.html b/dd/d0d/insertion__sort_8cpp.html index bfd44aa38..2178c72eb 100644 --- a/dd/d0d/insertion__sort_8cpp.html +++ b/dd/d0d/insertion__sort_8cpp.html @@ -223,11 +223,11 @@ template<typename T >
    101 {
    102 while (N--) {
    103 double r = (std::rand() % 10000 - 5000) / 100.f;
    -
    104 arr[N] = static_cast<T>(r);
    +
    104 arr[N] = static_cast<T>(r);
    105 }
    106}
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    std::rand
    T rand(T... args)
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    Here is the call graph for this function:
    diff --git a/dd/d24/namespacedynamic__programming.html b/dd/d24/namespacedynamic__programming.html index 23be339fc..addbc6dcb 100644 --- a/dd/d24/namespacedynamic__programming.html +++ b/dd/d24/namespacedynamic__programming.html @@ -141,17 +141,18 @@ Functions

    Dynamic Programming algorithm.

    for IO operations

    Dynamic Programming Algorithms.

    -

    for assert for IO operations for std::string library for std::vector STL library

    +

    for assert for std::uint32_t for IO operations for std::string library for std::vector STL library

    for assert for std::pow

    Dynamic Programming algorithms

    -

    for assert for std::max for io operations

    +

    for assert for std::max for std::uint32_t for io operations

    Dynamic Programming algorithms

    -

    for assert for std::max for IO operations

    +

    for assert for std::max for std::uint64_t for IO operations

    Dynamic Programming algorithms

    for assert for std::string for std::vector

    for assert for IO operations

    Dynamic Programming algorithms

    -

    for assert for IO operations for std::vector

    +

    for assert for std::uint64_t for IO operations

    +

    Dynamic Programming algorithms

    for std::assert for IO operations for unordered map

    Dynamic Programming algorithms

    For std::min and std::max For assert For std::size_t

    @@ -246,24 +247,24 @@ Here is the call graph for this function:
    Returns
    the length of the longest increasing subsequence in the a array of size n
    -
    39 {
    -
    40 std::vector<int> lis(n);
    -
    41 for (int i = 0; i < n; ++i) {
    -
    42 lis[i] = 1;
    -
    43 }
    -
    44 for (int i = 0; i < n; ++i) {
    -
    45 for (int j = 0; j < i; ++j) {
    -
    46 if (a[i] > a[j] && lis[i] < lis[j] + 1) {
    -
    47 lis[i] = lis[j] + 1;
    -
    48 }
    -
    49 }
    -
    50 }
    -
    51 int res = 0;
    -
    52 for (int i = 0; i < n; ++i) {
    -
    53 res = std::max(res, lis[i]);
    -
    54 }
    -
    55 return res;
    -
    56}
    +
    40 {
    +
    41 std::vector<int> lis(n);
    +
    42 for (int i = 0; i < n; ++i) {
    +
    43 lis[i] = 1;
    +
    44 }
    +
    45 for (int i = 0; i < n; ++i) {
    +
    46 for (int j = 0; j < i; ++j) {
    +
    47 if (a[i] > a[j] && lis[i] < lis[j] + 1) {
    +
    48 lis[i] = lis[j] + 1;
    +
    49 }
    +
    50 }
    +
    51 }
    +
    52 int res = 0;
    +
    53 for (int i = 0; i < n; ++i) {
    +
    54 res = std::max(res, lis[i]);
    +
    55 }
    +
    56 return res;
    +
    57}
    std::max
    T max(T... args)
    diff --git a/dd/d89/insertion__sort__recursive_8cpp.html b/dd/d89/insertion__sort__recursive_8cpp.html index e377ceef7..62d86e1a4 100644 --- a/dd/d89/insertion__sort__recursive_8cpp.html +++ b/dd/d89/insertion__sort__recursive_8cpp.html @@ -215,11 +215,11 @@ template<typename T >
    94 {
    95 while (N--) {
    96 double r = (std::rand() % 10000 - 5000) / 100.f;
    -
    97 arr[N] = static_cast<T>(r);
    +
    97 arr[N] = static_cast<T>(r);
    98 }
    99}
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    std::rand
    T rand(T... args)
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    Here is the call graph for this function:
    diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html index d0904369a..0455a6599 100644 --- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html +++ b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html @@ -229,13 +229,13 @@ template<size_t N = 3>

    Default constructor for EightPuzzle.

    121 {
    -
    122 for (size_t i = 0; i < N; ++i) {
    -
    123 for (size_t j = 0; j < N; ++j) {
    -
    124 board[i][j] = ((i * 3 + j + 1) % (N * N));
    +
    122 for (size_t i = 0; i < N; ++i) {
    +
    123 for (size_t j = 0; j < N; ++j) {
    +
    124 board[i][j] = ((i * 3 + j + 1) % (N * N));
    125 }
    126 }
    127 }
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    @@ -377,8 +377,8 @@ template<size_t N = 3>

    A helper array to evaluate the next state from current state;.

    Finds an empty space in puzzle (in this case; a zero)

    Returns
    a pair indicating integer distances from top and right respectively, else returns -1, -1
    75 {
    -
    76 for (size_t i = 0; i < N; ++i) {
    -
    77 for (size_t j = 0; j < N; ++j) {
    +
    76 for (size_t i = 0; i < N; ++i) {
    +
    77 for (size_t j = 0; j < N; ++j) {
    78 if (!board[i][j]) {
    79 return {i, j};
    80 }
    @@ -425,7 +425,7 @@ template<size_t N = 3>
    181 if (in_range(zero_pos.first + move.first) &&
    182 in_range(zero_pos.second + move.second)) {
    183 // swap with the possible moves
    -
    184 std::array<std::array<uint32_t, N>, N> new_config = board;
    +
    184 std::array<std::array<uint32_t, N>, N> new_config = board;
    185 std::swap(new_config[zero_pos.first][zero_pos.second],
    186 new_config[zero_pos.first + move.first]
    187 [zero_pos.second + move.second]);
    @@ -533,7 +533,7 @@ template<size_t N = 3>

    returns the size of the EightPuzzle (number of row / column)

    Returns
    N, the size of the puzzle.
    -
    117{ return N; }
    +
    117{ return N; }
    @@ -600,7 +600,7 @@ template<size_t N = 3>
    Returns
    true if index is within the board, else false
    -
    90{ return value < N; }
    +
    90{ return value < N; }
    @@ -632,8 +632,8 @@ template<size_t N = 3>

    check whether one board is lexicographically smaller

    Returns
    true if this->state is lexicographically smaller than check.state, else false
    218 {
    -
    219 for (size_t i = 0; i < N; ++i) {
    -
    220 for (size_t j = 0; j < N; ++j) {
    +
    219 for (size_t i = 0; i < N; ++i) {
    +
    220 for (size_t j = 0; j < N; ++j) {
    221 if (board[i][j] != check.board[i][j]) {
    222 return board[i][j] < check.board[i][j];
    223 }
    @@ -673,8 +673,8 @@ template<size_t N = 3>

    check whether one board is lexicographically smaller or equal

    Returns
    true if this->state is lexicographically smaller than check.state or same, else false
    233 {
    -
    234 for (size_t i = 0; i < N; ++i) {
    -
    235 for (size_t j = 0; j < N; ++j) {
    +
    234 for (size_t i = 0; i < N; ++i) {
    +
    235 for (size_t j = 0; j < N; ++j) {
    236 if (board[i][j] != check.board[i][j]) {
    237 return board[i][j] < check.board[i][j];
    238 }
    @@ -799,8 +799,8 @@ template<size_t N = 3>
    201 if (check.get_size() != N) {
    202 return false;
    203 }
    -
    204 for (size_t i = 0; i < N; ++i) {
    -
    205 for (size_t j = 0; j < N; ++j) {
    +
    204 for (size_t i = 0; i < N; ++i) {
    +
    205 for (size_t j = 0; j < N; ++j) {
    206 if (board[i][j] != check.board[i][j]) {
    207 return false;
    208 }
    @@ -851,8 +851,8 @@ template<size_t N = 3>
    Returns
    ostream operator op
    251 {
    -
    252 for (size_t i = 0; i < N; ++i) {
    -
    253 for (size_t j = 0; j < N; ++j) {
    +
    252 for (size_t i = 0; i < N; ++i) {
    +
    253 for (size_t j = 0; j < N; ++j) {
    254 op << SomeState.board[i][j] << " ";
    255 }
    256 op << "\n";
    diff --git a/dd/da0/todo.html b/dd/da0/todo.html index 1c92ca777..76fafb8a8 100644 --- a/dd/da0/todo.html +++ b/dd/da0/todo.html @@ -130,7 +130,7 @@ $(function(){initNavTree('dd/da0/todo.html','../../'); initResizable(true); });
    @stepfencurryxiao add documetnation
    File paranthesis_matching.cpp
    implement as a C++ class
    -
    File sparse_table.cpp
    +
    File sparse_table.cpp
    make stress tests.
    Member test1 ()
    better ways to self-check a matrix output?
    diff --git a/df/d88/data__structures_2sparse__table_8cpp__incl.map b/de/d24/sparse__table_8cpp__incl.map similarity index 100% rename from df/d88/data__structures_2sparse__table_8cpp__incl.map rename to de/d24/sparse__table_8cpp__incl.map diff --git a/df/d88/data__structures_2sparse__table_8cpp__incl.md5 b/de/d24/sparse__table_8cpp__incl.md5 similarity index 100% rename from df/d88/data__structures_2sparse__table_8cpp__incl.md5 rename to de/d24/sparse__table_8cpp__incl.md5 diff --git a/df/d88/data__structures_2sparse__table_8cpp__incl.svg b/de/d24/sparse__table_8cpp__incl.svg similarity index 100% rename from df/d88/data__structures_2sparse__table_8cpp__incl.svg rename to de/d24/sparse__table_8cpp__incl.svg diff --git a/df/d88/data__structures_2sparse__table_8cpp__incl_org.svg b/de/d24/sparse__table_8cpp__incl_org.svg similarity index 100% rename from df/d88/data__structures_2sparse__table_8cpp__incl_org.svg rename to de/d24/sparse__table_8cpp__incl_org.svg diff --git a/de/d3d/minimum__edit__distance_8cpp__incl.map b/de/d3d/minimum__edit__distance_8cpp__incl.map index aad56c6e6..d2303ab10 100644 --- a/de/d3d/minimum__edit__distance_8cpp__incl.map +++ b/de/d3d/minimum__edit__distance_8cpp__incl.map @@ -1,9 +1,11 @@ - + - - - - - + + + + + + + diff --git a/de/d3d/minimum__edit__distance_8cpp__incl.md5 b/de/d3d/minimum__edit__distance_8cpp__incl.md5 index e4b622b74..09a7cc201 100644 --- a/de/d3d/minimum__edit__distance_8cpp__incl.md5 +++ b/de/d3d/minimum__edit__distance_8cpp__incl.md5 @@ -1 +1 @@ -fa89c36f92843a23187a28ce8f0db76b \ No newline at end of file +77a699c251aa4a0834f9e336b1cbf2f0 \ No newline at end of file diff --git a/de/d3d/minimum__edit__distance_8cpp__incl.svg b/de/d3d/minimum__edit__distance_8cpp__incl.svg index fc8fbd688..9d0b790d1 100644 --- a/de/d3d/minimum__edit__distance_8cpp__incl.svg +++ b/de/d3d/minimum__edit__distance_8cpp__incl.svg @@ -4,8 +4,8 @@ - + @@ -23,9 +23,9 @@ Node1 - -dynamic_programming -/minimum_edit_distance.cpp + +dynamic_programming +/minimum_edit_distance.cpp @@ -42,8 +42,8 @@ Node1->Node2 - - + + @@ -51,8 +51,8 @@ Node3 - -iostream + +cstdint @@ -60,8 +60,8 @@ Node1->Node3 - - + + @@ -69,8 +69,8 @@ Node4 - -vector + +iostream @@ -78,8 +78,26 @@ Node1->Node4 - - + + + + + + + +Node5 + + +vector + + + + + +Node1->Node5 + + + diff --git a/de/d3d/minimum__edit__distance_8cpp__incl_org.svg b/de/d3d/minimum__edit__distance_8cpp__incl_org.svg index ae5e5cdce..054c0304a 100644 --- a/de/d3d/minimum__edit__distance_8cpp__incl_org.svg +++ b/de/d3d/minimum__edit__distance_8cpp__incl_org.svg @@ -4,17 +4,17 @@ - + dynamic_programming/minimum_edit_distance.cpp Node1 - -dynamic_programming -/minimum_edit_distance.cpp + +dynamic_programming +/minimum_edit_distance.cpp @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -40,8 +40,8 @@ Node3 - -iostream + +cstdint @@ -49,8 +49,8 @@ Node1->Node3 - - + + @@ -58,8 +58,8 @@ Node4 - -vector + +iostream @@ -67,8 +67,26 @@ Node1->Node4 - - + + + + + + + +Node5 + + +vector + + + + + +Node1->Node5 + + + diff --git a/de/d75/qr__eigen__values_8cpp.html b/de/d75/qr__eigen__values_8cpp.html index ac4aad91d..2088e57ec 100644 --- a/de/d75/qr__eigen__values_8cpp.html +++ b/de/d75/qr__eigen__values_8cpp.html @@ -195,23 +195,23 @@ Functions
    28 {
    29 int i, j, tmp, lim2 = LIMS >> 1;
    -
    30 int N = A->size();
    +
    30 int N = A->size();
    31
    32#ifdef _OPENMP
    33#pragma omp for
    34#endif
    -
    35 for (i = 0; i < N; i++) {
    +
    35 for (i = 0; i < N; i++) {
    36 A[0][i][i] = (std::rand() % LIMS) - lim2;
    -
    37 for (j = i + 1; j < N; j++) {
    +
    37 for (j = i + 1; j < N; j++) {
    38 tmp = (std::rand() % LIMS) - lim2;
    39 A[0][i][j] = tmp; // summetrically distribute random values
    40 A[0][j][i] = tmp;
    41 }
    42 }
    43}
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    LIMS
    #define LIMS
    Definition qr_eigen_values.cpp:20
    std::rand
    T rand(T... args)
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    Here is the call graph for this function:
    diff --git a/de/db6/segtree_8cpp__incl.map b/de/db6/segtree_8cpp__incl.map index 191851d12..099b81c28 100644 --- a/de/db6/segtree_8cpp__incl.map +++ b/de/db6/segtree_8cpp__incl.map @@ -1,11 +1,13 @@ - + - + - - - - - + + + + + + + diff --git a/de/db6/segtree_8cpp__incl.md5 b/de/db6/segtree_8cpp__incl.md5 index d61e43153..a495a87a4 100644 --- a/de/db6/segtree_8cpp__incl.md5 +++ b/de/db6/segtree_8cpp__incl.md5 @@ -1 +1 @@ -1f9ca8c688f0c49869a2bee8b6156a18 \ No newline at end of file +d93bdb3862e8f243b6dd1bde73a79dda \ No newline at end of file diff --git a/de/db6/segtree_8cpp__incl.svg b/de/db6/segtree_8cpp__incl.svg index eed4deb64..70556280d 100644 --- a/de/db6/segtree_8cpp__incl.svg +++ b/de/db6/segtree_8cpp__incl.svg @@ -4,8 +4,8 @@ - + @@ -23,8 +23,8 @@ Node1 - -range_queries/segtree.cpp + +range_queries/segtree.cpp @@ -41,8 +41,8 @@ Node1->Node2 - - + + @@ -59,8 +59,8 @@ Node1->Node3 - - + + @@ -68,8 +68,8 @@ Node4 - -iostream + +cstdint @@ -77,8 +77,8 @@ Node1->Node4 - - + + @@ -86,8 +86,8 @@ Node5 - -vector + +iostream @@ -95,8 +95,26 @@ Node1->Node5 - - + + + + + + + +Node6 + + +vector + + + + + +Node1->Node6 + + + diff --git a/de/db6/segtree_8cpp__incl_org.svg b/de/db6/segtree_8cpp__incl_org.svg index 6207b0229..add7654b3 100644 --- a/de/db6/segtree_8cpp__incl_org.svg +++ b/de/db6/segtree_8cpp__incl_org.svg @@ -4,16 +4,16 @@ - + range_queries/segtree.cpp Node1 - -range_queries/segtree.cpp + +range_queries/segtree.cpp @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -48,8 +48,8 @@ Node1->Node3 - - + + @@ -57,8 +57,8 @@ Node4 - -iostream + +cstdint @@ -66,8 +66,8 @@ Node1->Node4 - - + + @@ -75,8 +75,8 @@ Node5 - -vector + +iostream @@ -84,8 +84,26 @@ Node1->Node5 - - + + + + + + + +Node6 + + +vector + + + + + +Node1->Node6 + + + diff --git a/de/dd9/catalan__numbers_8cpp.html b/de/dd9/catalan__numbers_8cpp.html index 46bffcf86..ad123ea79 100644 --- a/de/dd9/catalan__numbers_8cpp.html +++ b/de/dd9/catalan__numbers_8cpp.html @@ -116,12 +116,13 @@ $(function(){initNavTree('de/dd9/catalan__numbers_8cpp.html','../../'); initResi
    #include <cassert>
    #include <cstdint>
    #include <cstdlib>
    +#include <functional>
    #include <numeric>
    #include <vector>
    Include dependency graph for catalan_numbers.cpp:
    -
    +

    @@ -167,14 +167,14 @@ Functions

    @@ -156,10 +157,10 @@ Functions

    -
    78 {
    -
    79 test_catalan_numbers_up_to_20();
    -
    80 test_catalan_numbers_25();
    -
    81}
    +
    79 {
    +
    80 test_catalan_numbers_up_to_20();
    +
    81 test_catalan_numbers_25();
    +
    82}
    @@ -177,13 +178,13 @@ Functions
    -
    72 {
    -
    73 // data verified with https://oeis.org/A000108/
    -
    74 catalan_numbers cn;
    -
    75 assert(cn.get(25) == 4861946401452ULL);
    -
    76}
    -
    catalan_numbers
    computes and caches Catalan numbers
    Definition catalan_numbers.cpp:21
    -
    catalan_numbers::get
    value_type get(std::size_t n)
    computes the n-th Catalan number and updates the cache.
    Definition catalan_numbers.cpp:38
    +
    73 {
    +
    74 // data verified with https://oeis.org/A000108/
    +
    75 catalan_numbers cn;
    +
    76 assert(cn.get(25) == 4861946401452ULL);
    +
    77}
    +
    catalan_numbers
    computes and caches Catalan numbers
    Definition catalan_numbers.cpp:22
    +
    catalan_numbers::get
    value_type get(std::size_t n)
    computes the n-th Catalan number and updates the cache.
    Definition catalan_numbers.cpp:39
    @@ -201,31 +202,31 @@ Functions
    -
    46 {
    -
    47 // data verified with https://oeis.org/A000108/
    -
    48 catalan_numbers cn;
    -
    49 assert(cn.get(0) == 1ULL);
    -
    50 assert(cn.get(1) == 1ULL);
    -
    51 assert(cn.get(2) == 2ULL);
    -
    52 assert(cn.get(3) == 5ULL);
    -
    53 assert(cn.get(4) == 14ULL);
    -
    54 assert(cn.get(5) == 42ULL);
    -
    55 assert(cn.get(6) == 132ULL);
    -
    56 assert(cn.get(7) == 429ULL);
    -
    57 assert(cn.get(8) == 1430ULL);
    -
    58 assert(cn.get(9) == 4862ULL);
    -
    59 assert(cn.get(10) == 16796ULL);
    -
    60 assert(cn.get(11) == 58786ULL);
    -
    61 assert(cn.get(12) == 208012ULL);
    -
    62 assert(cn.get(13) == 742900ULL);
    -
    63 assert(cn.get(14) == 2674440ULL);
    -
    64 assert(cn.get(15) == 9694845ULL);
    -
    65 assert(cn.get(16) == 35357670ULL);
    -
    66 assert(cn.get(17) == 129644790ULL);
    -
    67 assert(cn.get(18) == 477638700ULL);
    -
    68 assert(cn.get(19) == 1767263190ULL);
    -
    69 assert(cn.get(20) == 6564120420ULL);
    -
    70}
    +
    47 {
    +
    48 // data verified with https://oeis.org/A000108/
    +
    49 catalan_numbers cn;
    +
    50 assert(cn.get(0) == 1ULL);
    +
    51 assert(cn.get(1) == 1ULL);
    +
    52 assert(cn.get(2) == 2ULL);
    +
    53 assert(cn.get(3) == 5ULL);
    +
    54 assert(cn.get(4) == 14ULL);
    +
    55 assert(cn.get(5) == 42ULL);
    +
    56 assert(cn.get(6) == 132ULL);
    +
    57 assert(cn.get(7) == 429ULL);
    +
    58 assert(cn.get(8) == 1430ULL);
    +
    59 assert(cn.get(9) == 4862ULL);
    +
    60 assert(cn.get(10) == 16796ULL);
    +
    61 assert(cn.get(11) == 58786ULL);
    +
    62 assert(cn.get(12) == 208012ULL);
    +
    63 assert(cn.get(13) == 742900ULL);
    +
    64 assert(cn.get(14) == 2674440ULL);
    +
    65 assert(cn.get(15) == 9694845ULL);
    +
    66 assert(cn.get(16) == 35357670ULL);
    +
    67 assert(cn.get(17) == 129644790ULL);
    +
    68 assert(cn.get(18) == 477638700ULL);
    +
    69 assert(cn.get(19) == 1767263190ULL);
    +
    70 assert(cn.get(20) == 6564120420ULL);
    +
    71}
    diff --git a/de/de4/fibonacci__large_8cpp.html b/de/de4/fibonacci__large_8cpp.html index 187d0b651..9510bebb7 100644 --- a/de/de4/fibonacci__large_8cpp.html +++ b/de/de4/fibonacci__large_8cpp.html @@ -189,12 +189,12 @@ Functions
    38 {
    -
    39 uint64_t N;
    +
    39 uint64_t N;
    40 if (argc == 2) {
    -
    41 N = strtoull(argv[1], NULL, 10);
    +
    41 N = strtoull(argv[1], NULL, 10);
    42 } else {
    43 std::cout << "Enter N: ";
    -
    44 std::cin >> N;
    +
    44 std::cin >> N;
    45 }
    46
    47 clock_t start_time = std::clock();
    @@ -204,12 +204,12 @@ Functions
    51 static_cast<double>(CLOCKS_PER_SEC);
    52
    53 std::cout << std::endl
    -
    54 << N << "^th Fibonacci number: " << result << std::endl
    +
    54 << N << "^th Fibonacci number: " << result << std::endl
    55 << "Number of digits: " << result.num_digits() << std::endl
    56 << "Time taken: " << std::scientific << time_taken << " s"
    57 << std::endl;
    58
    -
    59 N = 5000;
    +
    59 N = 5000;
    60 if (fib(N) ==
    61 large_number(
    62 "387896845438832563370191630832590531208212771464624510616059721489"
    @@ -228,10 +228,10 @@ Functions
    75 "508206686289742063932343848846524098874239587380197699382031717420"
    76 "893226546887936400263079778005875912967138963421425257911687275560"
    77 "0360311370547754724604639987588046985178408674382863125"))
    -
    78 std::cout << "Test for " << N << "^th Fibonacci number passed!"
    +
    78 std::cout << "Test for " << N << "^th Fibonacci number passed!"
    79 << std::endl;
    80 else
    -
    81 std::cerr << "Test for " << N << "^th Fibonacci number failed!"
    +
    81 std::cerr << "Test for " << N << "^th Fibonacci number failed!"
    82 << std::endl;
    83
    84 return 0;
    @@ -239,11 +239,11 @@ Functions
    std::clock
    T clock(T... args)
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    std::endl
    T endl(T... args)
    fib
    large_number fib(uint64_t n)
    Definition fibonacci_large.cpp:24
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition fibonacci_sum.cpp:77
    std::scientific
    T scientific(T... args)
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    std::strtoull
    T strtoull(T... args)
    diff --git a/df/d11/midpoint__integral__method_8cpp.html b/df/d11/midpoint__integral__method_8cpp.html index 5c7bcbdc6..15730bdf3 100644 --- a/df/d11/midpoint__integral__method_8cpp.html +++ b/df/d11/midpoint__integral__method_8cpp.html @@ -332,7 +332,7 @@ Here is the call graph for this function:

    the real axis

    Step, calculated by a, b and N

    162 {
    -
    163 std::int32_t N =
    +
    163 std::int32_t N =
    164 16; /// Number of intervals to divide the integration interval.
    165 /// MUST BE EVEN
    166 double a = 1, b = 3; /// Starting and ending point of the integration in
    @@ -346,7 +346,7 @@ Here is the call graph for this function:
    174 // Get user input (by the command line parameters or the console after
    175 // displaying messages)
    176 if (argc == 4) {
    -
    177 N = std::atoi(argv[1]);
    +
    177 N = std::atoi(argv[1]);
    178 a = std::atof(argv[2]);
    179 b = std::atof(argv[3]);
    180 // Check if a<b else abort
    @@ -355,10 +355,10 @@ Here is the call graph for this function:
    183 if (N < 4 || a != 1 || b != 3) {
    184 used_argv_parameters = true;
    185 }
    -
    186 std::cout << "You selected N=" << N << ", a=" << a << ", b=" << b
    +
    186 std::cout << "You selected N=" << N << ", a=" << a << ", b=" << b
    187 << std::endl;
    188 } else {
    -
    189 std::cout << "Default N=" << N << ", a=" << a << ", b=" << b
    +
    189 std::cout << "Default N=" << N << ", a=" << a << ", b=" << b
    190 << std::endl;
    191 }
    192
    @@ -372,11 +372,11 @@ Here is the call graph for this function:
    std::atof
    T atof(T... args)
    std::atoi
    T atoi(T... args)
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    std::endl
    T endl(T... args)
    test
    static void test()
    Self-test implementations.
    Definition generate_parentheses.cpp:82
    h
    int h(int key)
    Definition hash_search.cpp:45
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    Here is the call graph for this function:
    @@ -433,7 +433,7 @@ Here is the call graph for this function:
    58 // Create the data table
    59 // Loop from x0 to xN-1
    60 double temp = NAN;
    -
    61 for (std::int32_t i = 0; i < N; i++) {
    +
    61 for (std::int32_t i = 0; i < N; i++) {
    62 temp = func(xi + h / 2); // find f(xi+h/2)
    63 data_table.insert(
    64 std::pair<std::int32_t, double>(i, temp)); // add i and f(xi)
    @@ -443,7 +443,7 @@ Here is the call graph for this function:
    68 // Evaluate the integral.
    69 // Remember: {f(x0+h/2) + f(x1+h/2) + ... + f(xN-1+h/2)}
    70 double evaluate_integral = 0;
    -
    71 for (std::int32_t i = 0; i < N; i++) evaluate_integral += data_table.at(i);
    +
    71 for (std::int32_t i = 0; i < N; i++) evaluate_integral += data_table.at(i);
    72
    73 // Multiply by the coefficient h
    74 evaluate_integral *= h;
    diff --git a/dc/d53/dynamic__programming_2subset__sum_8cpp__incl.map b/df/d1f/subset__sum__dynamic_8cpp__incl.map similarity index 85% rename from dc/d53/dynamic__programming_2subset__sum_8cpp__incl.map rename to df/d1f/subset__sum__dynamic_8cpp__incl.map index 713551382..bbcc00129 100644 --- a/dc/d53/dynamic__programming_2subset__sum_8cpp__incl.map +++ b/df/d1f/subset__sum__dynamic_8cpp__incl.map @@ -1,5 +1,5 @@ - - + + diff --git a/df/d1f/subset__sum__dynamic_8cpp__incl.md5 b/df/d1f/subset__sum__dynamic_8cpp__incl.md5 new file mode 100644 index 000000000..b6c3935f2 --- /dev/null +++ b/df/d1f/subset__sum__dynamic_8cpp__incl.md5 @@ -0,0 +1 @@ +724e895b7e1fb10729c324df1c617bf5 \ No newline at end of file diff --git a/dc/d53/dynamic__programming_2subset__sum_8cpp__incl.svg b/df/d1f/subset__sum__dynamic_8cpp__incl.svg similarity index 91% rename from dc/d53/dynamic__programming_2subset__sum_8cpp__incl.svg rename to df/d1f/subset__sum__dynamic_8cpp__incl.svg index 024fcb429..8a5bfd58b 100644 --- a/dc/d53/dynamic__programming_2subset__sum_8cpp__incl.svg +++ b/df/d1f/subset__sum__dynamic_8cpp__incl.svg @@ -3,7 +3,7 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - + @@ -18,14 +18,14 @@ -dynamic_programming/subset_sum.cpp +dynamic_programming/subset_sum_dynamic.cpp Node1 - -dynamic_programming -/subset_sum.cpp + +dynamic_programming +/subset_sum_dynamic.cpp diff --git a/dc/d53/dynamic__programming_2subset__sum_8cpp__incl_org.svg b/df/d1f/subset__sum__dynamic_8cpp__incl_org.svg similarity index 89% rename from dc/d53/dynamic__programming_2subset__sum_8cpp__incl_org.svg rename to df/d1f/subset__sum__dynamic_8cpp__incl_org.svg index 42e555eca..8aca1e9f2 100644 --- a/dc/d53/dynamic__programming_2subset__sum_8cpp__incl_org.svg +++ b/df/d1f/subset__sum__dynamic_8cpp__incl_org.svg @@ -3,18 +3,18 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - + -dynamic_programming/subset_sum.cpp +dynamic_programming/subset_sum_dynamic.cpp Node1 - -dynamic_programming -/subset_sum.cpp + +dynamic_programming +/subset_sum_dynamic.cpp diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html index 737623991..cdb3d67d7 100644 --- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html +++ b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html @@ -377,13 +377,13 @@ Here is the call graph for this function:
    181 }
    182 p >>= 1;
    183 if (p) {
    -
    184 N = addition(N, N, curve_a_coeff, mod);
    +
    184 N = addition(N, N, curve_a_coeff, mod);
    185 }
    186 }
    187 return Q;
    188}
    -
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    ciphers::elliptic_curve_key_exchange::addition
    Point addition(Point a, Point b, const uint256_t &curve_a_coeff, uint256_t mod)
    Addition of points.
    Definition elliptic_curve_key_exchange.cpp:110
    +
    data_structures::sparse_table::N
    constexpr uint32_t N
    A struct to represent sparse table for min() as their invariant function, for the given array A....
    Definition sparse_table.cpp:48
    ciphers::elliptic_curve_key_exchange::Point
    Definition of struct Point.
    Definition elliptic_curve_key_exchange.cpp:46
    Here is the call graph for this function:
    diff --git a/df/d88/namespacedp.html b/df/d88/namespacedp.html index 01af430fa..4d16a80e5 100644 --- a/df/d88/namespacedp.html +++ b/df/d88/namespacedp.html @@ -112,7 +112,7 @@ $(function(){initNavTree('df/d88/namespacedp.html','../../'); initResizable(true More...

    Detailed Description

    for std::vector

    -

    for assert for IO Operations for std::accumulate

    +

    for assert for std::uint64_t for IO Operations for std::accumulate

    diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp.js b/df/dcb/greedy__algorithms_2dijkstra_8cpp.js deleted file mode 100644 index 8cc887271..000000000 --- a/df/dcb/greedy__algorithms_2dijkstra_8cpp.js +++ /dev/null @@ -1,9 +0,0 @@ -var greedy__algorithms_2dijkstra_8cpp = -[ - [ "greedy_algorithms::dijkstra::Graph", "d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html", "d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph" ], - [ "dijkstra", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af915876d0ca33cc71a6a6191a8cd3ccd", null ], - [ "main", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], - [ "minimum_distance", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af6cb29ca6dc5771439f6ea7262058a71", null ], - [ "print", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a7341d7c76a6145e991cdd231f689fca8", null ], - [ "tests", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ] -]; \ No newline at end of file diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map deleted file mode 100644 index dc76fac09..000000000 --- a/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ /dev/null @@ -1,23 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 deleted file mode 100644 index afe3b2eff..000000000 --- a/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -1edcd48bfe806bcce7094807255da485 \ No newline at end of file diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg deleted file mode 100644 index 7377eb53c..000000000 --- a/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ /dev/null @@ -1,229 +0,0 @@ - - - - - - - - - - - - -main - - -Node1 - - -main - - - - - -Node2 - - -tests - - - - - -Node1->Node2 - - - - - - - - -Node3 - - -graph::addEdge - - - - - -Node2->Node3 - - - - - - - - -Node4 - - -graph::dijkstra - - - - - -Node2->Node4 - - - - - - - - -Node11 - - -std::endl - - - - - -Node2->Node11 - - - - - - - - -Node5 - - -std::priority_queue -::empty - - - - - -Node4->Node5 - - - - - - - - -Node6 - - -std::make_pair - - - - - -Node4->Node6 - - - - - - - - -Node7 - - -std::priority_queue::pop - - - - - -Node4->Node7 - - - - - - - - -Node8 - - -std::priority_queue -::push - - - - - -Node4->Node8 - - - - - - - - -Node9 - - -std::vector::size - - - - - -Node4->Node9 - - - - - - - - -Node10 - - -std::priority_queue::top - - - - - -Node4->Node10 - - - - - - - - - - - - - diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg deleted file mode 100644 index 27d96ce05..000000000 --- a/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ /dev/null @@ -1,203 +0,0 @@ - - - - - - -main - - -Node1 - - -main - - - - - -Node2 - - -tests - - - - - -Node1->Node2 - - - - - - - - -Node3 - - -graph::addEdge - - - - - -Node2->Node3 - - - - - - - - -Node4 - - -graph::dijkstra - - - - - -Node2->Node4 - - - - - - - - -Node11 - - -std::endl - - - - - -Node2->Node11 - - - - - - - - -Node5 - - -std::priority_queue -::empty - - - - - -Node4->Node5 - - - - - - - - -Node6 - - -std::make_pair - - - - - -Node4->Node6 - - - - - - - - -Node7 - - -std::priority_queue::pop - - - - - -Node4->Node7 - - - - - - - - -Node8 - - -std::priority_queue -::push - - - - - -Node4->Node8 - - - - - - - - -Node9 - - -std::vector::size - - - - - -Node4->Node9 - - - - - - - - -Node10 - - -std::priority_queue::top - - - - - -Node4->Node10 - - - - - - - - diff --git a/dir_074119ce3a874b57120c49a0cc4bb5ad.html b/dir_074119ce3a874b57120c49a0cc4bb5ad.html index 9a0d43845..38ab5de38 100644 --- a/dir_074119ce3a874b57120c49a0cc4bb5ad.html +++ b/dir_074119ce3a874b57120c49a0cc4bb5ad.html @@ -125,9 +125,6 @@ Files  segtree.cpp  Implementation of [Segment Tree] (https://en.wikipedia.org/wiki/Segment_tree) data structure.
      - sparse_table.cpp - Implementation of Sparse Table data structure.
    -  diff --git a/dir_074119ce3a874b57120c49a0cc4bb5ad.js b/dir_074119ce3a874b57120c49a0cc4bb5ad.js index 9a303641c..6005e0f23 100644 --- a/dir_074119ce3a874b57120c49a0cc4bb5ad.js +++ b/dir_074119ce3a874b57120c49a0cc4bb5ad.js @@ -4,6 +4,5 @@ var dir_074119ce3a874b57120c49a0cc4bb5ad = [ "heavy_light_decomposition.cpp", "d2/de9/heavy__light__decomposition_8cpp.html", "d2/de9/heavy__light__decomposition_8cpp" ], [ "persistent_seg_tree_lazy_prop.cpp", "d5/d58/persistent__seg__tree__lazy__prop_8cpp.html", "d5/d58/persistent__seg__tree__lazy__prop_8cpp" ], [ "prefix_sum_array.cpp", "d1/d9e/prefix__sum__array_8cpp.html", "d1/d9e/prefix__sum__array_8cpp" ], - [ "segtree.cpp", "d2/d45/segtree_8cpp.html", "d2/d45/segtree_8cpp" ], - [ "sparse_table.cpp", "d4/d96/range__queries_2sparse__table_8cpp.html", "d4/d96/range__queries_2sparse__table_8cpp" ] + [ "segtree.cpp", "d2/d45/segtree_8cpp.html", "d2/d45/segtree_8cpp" ] ]; \ No newline at end of file diff --git a/dir_0eaa691bd54ab0922ca7f50599de6d22.html b/dir_0eaa691bd54ab0922ca7f50599de6d22.html index ceb0e34b4..ecfbdf771 100644 --- a/dir_0eaa691bd54ab0922ca7f50599de6d22.html +++ b/dir_0eaa691bd54ab0922ca7f50599de6d22.html @@ -119,8 +119,8 @@ Files  digit_separation.cpp  Separates digits from numbers in forward and reverse order.
      - dijkstra.cpp - Dijkstra algorithm implementation
    + dijkstra_greedy.cpp + Dijkstra algorithm implementation
       gale_shapley.cpp  Gale Shapley Algorithm
    diff --git a/dir_0eaa691bd54ab0922ca7f50599de6d22.js b/dir_0eaa691bd54ab0922ca7f50599de6d22.js index 5ed6aa8a2..4f3ea7df9 100644 --- a/dir_0eaa691bd54ab0922ca7f50599de6d22.js +++ b/dir_0eaa691bd54ab0922ca7f50599de6d22.js @@ -3,7 +3,7 @@ var dir_0eaa691bd54ab0922ca7f50599de6d22 = [ "binary_addition.cpp", "d9/d1f/binary__addition_8cpp.html", "d9/d1f/binary__addition_8cpp" ], [ "boruvkas_minimum_spanning_tree.cpp", "d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html", "d4/d6c/boruvkas__minimum__spanning__tree_8cpp" ], [ "digit_separation.cpp", "d3/d36/digit__separation_8cpp.html", "d3/d36/digit__separation_8cpp" ], - [ "dijkstra.cpp", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html", "df/dcb/greedy__algorithms_2dijkstra_8cpp" ], + [ "dijkstra_greedy.cpp", "da/de8/dijkstra__greedy_8cpp.html", "da/de8/dijkstra__greedy_8cpp" ], [ "gale_shapley.cpp", "db/d80/gale__shapley_8cpp.html", "db/d80/gale__shapley_8cpp" ], [ "jump_game.cpp", "d6/dba/jump__game_8cpp.html", "d6/dba/jump__game_8cpp" ], [ "kruskals_minimum_spanning_tree.cpp", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html", "d8/d7d/kruskals__minimum__spanning__tree_8cpp" ] diff --git a/dir_12552d7fa429bf94a2e32e5cf39f7e69.html b/dir_12552d7fa429bf94a2e32e5cf39f7e69.html index 6ddac6c2f..bcd4dbee0 100644 --- a/dir_12552d7fa429bf94a2e32e5cf39f7e69.html +++ b/dir_12552d7fa429bf94a2e32e5cf39f7e69.html @@ -128,8 +128,8 @@ Files  depth_first_search_with_stack.cpp  Depth First Search Algorithm using Stack (Depth First Search Algorithm)
      - dijkstra.cpp - [Graph Dijkstras Shortest Path Algorithm (Dijkstra's Shortest Path)] (https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)
    + dijkstra.cpp + [Graph Dijkstras Shortest Path Algorithm (Dijkstra's Shortest Path)] (https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)
       hamiltons_cycle.cpp  The implementation of Hamilton's cycle dynamic solution for vertices number less than 20.
    diff --git a/dir_12552d7fa429bf94a2e32e5cf39f7e69.js b/dir_12552d7fa429bf94a2e32e5cf39f7e69.js index aee90d224..d093efe40 100644 --- a/dir_12552d7fa429bf94a2e32e5cf39f7e69.js +++ b/dir_12552d7fa429bf94a2e32e5cf39f7e69.js @@ -6,7 +6,7 @@ var dir_12552d7fa429bf94a2e32e5cf39f7e69 = [ "connected_components_with_dsu.cpp", "d8/d99/connected__components__with__dsu_8cpp.html", "d8/d99/connected__components__with__dsu_8cpp" ], [ "depth_first_search.cpp", "da/d8d/depth__first__search_8cpp.html", "da/d8d/depth__first__search_8cpp" ], [ "depth_first_search_with_stack.cpp", "da/d4b/depth__first__search__with__stack_8cpp.html", "da/d4b/depth__first__search__with__stack_8cpp" ], - [ "dijkstra.cpp", "d7/d1e/graph_2dijkstra_8cpp.html", "d7/d1e/graph_2dijkstra_8cpp" ], + [ "dijkstra.cpp", "d8/d68/dijkstra_8cpp.html", "d8/d68/dijkstra_8cpp" ], [ "hamiltons_cycle.cpp", "dd/d0c/hamiltons__cycle_8cpp.html", "dd/d0c/hamiltons__cycle_8cpp" ], [ "hopcroft_karp.cpp", "d1/d9a/hopcroft__karp_8cpp.html", "d1/d9a/hopcroft__karp_8cpp" ], [ "is_graph_bipartite.cpp", "d6/dd8/is__graph__bipartite_8cpp.html", "d6/dd8/is__graph__bipartite_8cpp" ], diff --git a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html index 77dff3043..9ec5dfaac 100644 --- a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html +++ b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html @@ -167,8 +167,8 @@ Files  skip_list.cpp  Data structure for fast searching and insertion in \(O(\log n)\) time.
      - sparse_table.cpp - Implementation of Sparse Table for min() function.
    + sparse_table.cpp + Implementation of Sparse Table for min() function.
       stack.hpp  This class specifies the basic operation on a stack as a linked list.
    diff --git a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js index e7da12f9f..96baf8596 100644 --- a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js +++ b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js @@ -19,7 +19,7 @@ var dir_2e746e9d06bf2d8ff842208bcc6ebcfc = [ "reverse_a_linked_list.cpp", "d6/d05/reverse__a__linked__list_8cpp.html", "d6/d05/reverse__a__linked__list_8cpp" ], [ "segment_tree.cpp", "de/dd1/segment__tree_8cpp.html", "de/dd1/segment__tree_8cpp" ], [ "skip_list.cpp", "d0/d5a/skip__list_8cpp.html", "d0/d5a/skip__list_8cpp" ], - [ "sparse_table.cpp", "d6/d42/data__structures_2sparse__table_8cpp.html", "d6/d42/data__structures_2sparse__table_8cpp" ], + [ "sparse_table.cpp", "d8/dab/sparse__table_8cpp.html", "d8/dab/sparse__table_8cpp" ], [ "stack.hpp", "df/d47/stack_8hpp.html", "df/d47/stack_8hpp" ], [ "treap.cpp", "d0/dd2/treap_8cpp.html", "d0/dd2/treap_8cpp" ], [ "tree_234.cpp", "db/dbc/tree__234_8cpp.html", "db/dbc/tree__234_8cpp" ], diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.html b/dir_8a20dd5bfd5341a725342bf72b6b686f.html index ae87743e6..34c5826b3 100644 --- a/dir_8a20dd5bfd5341a725342bf72b6b686f.html +++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.html @@ -116,8 +116,8 @@ Files  abbreviation.cpp  Implementation of Abbrievation
      - armstrong_number.cpp - Checks whether a number is an Armstrong Number or not.
    + armstrong_number_templated.cpp + Checks whether a number is an Armstrong Number or not.
       catalan_numbers.cpp  Provides utilities to compute Catalan numbers using dynamic programming. A Catalan numbers satisfy these recurrence relations: C(0) = C(1) = 1; C(n) = sum(C(i).C(n-i-1)), for i = 0 to n-1 Read more about Catalan numbers here: https://en.wikipedia.org/wiki/Catalan_number https://oeis.org/A000108/.
    @@ -131,8 +131,8 @@ Files  house_robber.cpp  Implementation of House Robber Problem algorithm.
      - kadane2.cpp - Implementation of Kadane Algorithm
    + kadane.cpp + Implementation of Kadane Algorithm
       longest_common_string.cpp  contains the definition of the function longest_common_string_length
    @@ -155,8 +155,8 @@ Files  shortest_common_supersequence.cpp  SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained).
      - subset_sum.cpp - Implements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm, which tells whether a subset with target sum exists or not.
    + subset_sum_dynamic.cpp + Implements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm, which tells whether a subset with target sum exists or not.
       trapped_rainwater.cpp  Implementation of the Trapped Rainwater Problem
    diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.js b/dir_8a20dd5bfd5341a725342bf72b6b686f.js index 5e4d78892..a96479ead 100644 --- a/dir_8a20dd5bfd5341a725342bf72b6b686f.js +++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.js @@ -2,12 +2,12 @@ var dir_8a20dd5bfd5341a725342bf72b6b686f = [ [ "0_1_knapsack.cpp", "db/d16/0__1__knapsack_8cpp.html", "db/d16/0__1__knapsack_8cpp" ], [ "abbreviation.cpp", "d7/d73/abbreviation_8cpp.html", "d7/d73/abbreviation_8cpp" ], - [ "armstrong_number.cpp", "d1/db7/dynamic__programming_2armstrong__number_8cpp.html", "d1/db7/dynamic__programming_2armstrong__number_8cpp" ], + [ "armstrong_number_templated.cpp", "d1/da7/armstrong__number__templated_8cpp.html", "d1/da7/armstrong__number__templated_8cpp" ], [ "catalan_numbers.cpp", "de/dd9/catalan__numbers_8cpp.html", "de/dd9/catalan__numbers_8cpp" ], [ "coin_change_topdown.cpp", "d9/d31/coin__change__topdown_8cpp.html", "d9/d31/coin__change__topdown_8cpp" ], [ "cut_rod.cpp", "d6/d10/cut__rod_8cpp.html", "d6/d10/cut__rod_8cpp" ], [ "house_robber.cpp", "d6/d26/house__robber_8cpp.html", "d6/d26/house__robber_8cpp" ], - [ "kadane2.cpp", "db/dca/kadane2_8cpp.html", "db/dca/kadane2_8cpp" ], + [ "kadane.cpp", "d4/da0/kadane_8cpp.html", "d4/da0/kadane_8cpp" ], [ "longest_common_string.cpp", "da/d0d/longest__common__string_8cpp.html", "da/d0d/longest__common__string_8cpp" ], [ "longest_increasing_subsequence.cpp", "d7/d57/longest__increasing__subsequence_8cpp.html", "d7/d57/longest__increasing__subsequence_8cpp" ], [ "longest_palindromic_subsequence.cpp", "d0/d77/longest__palindromic__subsequence_8cpp.html", "d0/d77/longest__palindromic__subsequence_8cpp" ], @@ -15,7 +15,7 @@ var dir_8a20dd5bfd5341a725342bf72b6b686f = [ "minimum_edit_distance.cpp", "da/d52/minimum__edit__distance_8cpp.html", "da/d52/minimum__edit__distance_8cpp" ], [ "palindrome_partitioning.cpp", "d5/d90/palindrome__partitioning_8cpp.html", "d5/d90/palindrome__partitioning_8cpp" ], [ "shortest_common_supersequence.cpp", "d7/d65/shortest__common__supersequence_8cpp.html", "d7/d65/shortest__common__supersequence_8cpp" ], - [ "subset_sum.cpp", "d6/d80/dynamic__programming_2subset__sum_8cpp.html", "d6/d80/dynamic__programming_2subset__sum_8cpp" ], + [ "subset_sum_dynamic.cpp", "dc/d67/subset__sum__dynamic_8cpp.html", "dc/d67/subset__sum__dynamic_8cpp" ], [ "trapped_rainwater.cpp", "d9/d80/trapped__rainwater_8cpp.html", "d9/d80/trapped__rainwater_8cpp" ], [ "unbounded_0_1_knapsack.cpp", "d9/dec/unbounded__0__1__knapsack_8cpp.html", "d9/dec/unbounded__0__1__knapsack_8cpp" ], [ "word_break.cpp", "d3/d84/word__break_8cpp.html", "d3/d84/word__break_8cpp" ] diff --git a/dir_c11585dfcef32a26e29098facab6c144.html b/dir_c11585dfcef32a26e29098facab6c144.html index 71951cd2d..69bc877e0 100644 --- a/dir_c11585dfcef32a26e29098facab6c144.html +++ b/dir_c11585dfcef32a26e29098facab6c144.html @@ -138,8 +138,8 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm  subarray_sum.cpp  Subset-sum (only continuous subsets) problem
      - subset_sum.cpp - Implementation of the Subset Sum problem.
    + subset_sum.cpp + Implementation of the Subset Sum problem.
       sudoku_solver.cpp  Sudoku Solver algorithm.
    diff --git a/dir_c11585dfcef32a26e29098facab6c144.js b/dir_c11585dfcef32a26e29098facab6c144.js index b037edd87..da2392fc2 100644 --- a/dir_c11585dfcef32a26e29098facab6c144.js +++ b/dir_c11585dfcef32a26e29098facab6c144.js @@ -9,7 +9,7 @@ var dir_c11585dfcef32a26e29098facab6c144 = [ "nqueen_print_all_solutions.cpp", "d7/d24/nqueen__print__all__solutions_8cpp.html", "d7/d24/nqueen__print__all__solutions_8cpp" ], [ "rat_maze.cpp", "dc/d5a/rat__maze_8cpp.html", "dc/d5a/rat__maze_8cpp" ], [ "subarray_sum.cpp", "df/d94/subarray__sum_8cpp.html", "df/d94/subarray__sum_8cpp" ], - [ "subset_sum.cpp", "d0/dfe/backtracking_2subset__sum_8cpp.html", "d0/dfe/backtracking_2subset__sum_8cpp" ], + [ "subset_sum.cpp", "d2/d5a/subset__sum_8cpp.html", "d2/d5a/subset__sum_8cpp" ], [ "sudoku_solver.cpp", "d3/d05/sudoku__solver_8cpp.html", "d3/d05/sudoku__solver_8cpp" ], [ "wildcard_matching.cpp", "dc/d14/wildcard__matching_8cpp.html", "dc/d14/wildcard__matching_8cpp" ] ]; \ No newline at end of file diff --git a/doxygen_crawl.html b/doxygen_crawl.html index 61d16f18b..4f648110e 100644 --- a/doxygen_crawl.html +++ b/doxygen_crawl.html @@ -33,8 +33,7 @@ - - + @@ -74,8 +73,7 @@ - - + @@ -85,12 +83,12 @@ - + - + @@ -98,6 +96,7 @@ + @@ -110,6 +109,7 @@ + @@ -120,8 +120,7 @@ - - + @@ -1081,10 +1080,6 @@ - - - - @@ -1226,6 +1221,10 @@ + + + + @@ -1236,10 +1235,6 @@ - - - - @@ -1391,6 +1386,10 @@ + + + + @@ -1762,11 +1761,6 @@ - - - - - @@ -1783,6 +1777,9 @@ + + + @@ -2146,11 +2143,6 @@ - - - - - @@ -2207,11 +2199,6 @@ - - - - - @@ -2315,11 +2302,6 @@ - - - - - @@ -2340,9 +2322,6 @@ - - - @@ -2494,6 +2473,11 @@ + + + + + @@ -2654,6 +2638,11 @@ + + + + + @@ -3123,6 +3112,12 @@ + + + + + + @@ -3367,9 +3362,6 @@ - - - @@ -3449,6 +3441,11 @@ + + + + + @@ -4083,12 +4080,6 @@ - - - - - - diff --git a/files.html b/files.html index 495674377..2bb17725c 100644 --- a/files.html +++ b/files.html @@ -120,7 +120,7 @@ $(function(){initNavTree('files.html',''); initResizable(true); });  rat_maze.cppImplements Rat in a Maze algorithm  subarray_sum.cppSubset-sum (only continuous subsets) problem - subset_sum.cppImplementation of the Subset Sum problem + subset_sum.cppImplementation of the Subset Sum problem  sudoku_solver.cppSudoku Solver algorithm  wildcard_matching.cppImplementation of the Wildcard Matching problem  ► bit_manipulation @@ -167,7 +167,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm  reverse_a_linked_list.cppImplementation of Reversing a single linked list  segment_tree.cppA data structure to quickly do operations on ranges: the Segment Tree algorithm implementation  skip_list.cppData structure for fast searching and insertion in \(O(\log n)\) time - sparse_table.cppImplementation of Sparse Table for min() function + sparse_table.cppImplementation of Sparse Table for min() function  stack.hppThis class specifies the basic operation on a stack as a linked list  treap.cppA balanced binary search tree (BST) on the basis of binary search tree and heap: the Treap algorithm implementation  tree_234.cppA demo 2-3-4 tree implementation @@ -179,12 +179,12 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm  ► dynamic_programming  0_1_knapsack.cppImplementation of [0-1 Knapsack Problem] (https://en.wikipedia.org/wiki/Knapsack_problem)  abbreviation.cppImplementation of Abbrievation - armstrong_number.cppChecks whether a number is an Armstrong Number or not + armstrong_number_templated.cppChecks whether a number is an Armstrong Number or not  catalan_numbers.cppProvides utilities to compute Catalan numbers using dynamic programming. A Catalan numbers satisfy these recurrence relations: C(0) = C(1) = 1; C(n) = sum(C(i).C(n-i-1)), for i = 0 to n-1 Read more about Catalan numbers here: https://en.wikipedia.org/wiki/Catalan_number https://oeis.org/A000108/  coin_change_topdown.cppMinimum coins change problem is a problem used to find the minimum number of coins required to completely reach a target amount  cut_rod.cppImplementation of cutting a rod problem  house_robber.cppImplementation of House Robber Problem algorithm - kadane2.cppImplementation of Kadane Algorithm + kadane.cppImplementation of Kadane Algorithm  longest_common_string.cppDefinition of the function longest_common_string_length  longest_increasing_subsequence.cppCalculate the length of the longest increasing subsequence in an array  longest_palindromic_subsequence.cppProgram to find the Longest Palindormic Subsequence of a string @@ -192,7 +192,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm  minimum_edit_distance.cppImplementation of Minimum Edit Distance using Dynamic Programing  palindrome_partitioning.cppImplements Palindrome Partitioning algorithm, giving you the minimum number of partitions you need to make  shortest_common_supersequence.cppSCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained) - subset_sum.cppImplements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm, which tells whether a subset with target sum exists or not + subset_sum_dynamic.cppImplements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm, which tells whether a subset with target sum exists or not  trapped_rainwater.cppImplementation of the Trapped Rainwater Problem  unbounded_0_1_knapsack.cppImplementation of the Unbounded 0/1 Knapsack Problem  word_break.cppWord Break Problem @@ -209,7 +209,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm  connected_components_with_dsu.cppDisjoint union  depth_first_search.cppDepth First Search Algorithm (Depth First Search)  depth_first_search_with_stack.cppDepth First Search Algorithm using Stack (Depth First Search Algorithm) - dijkstra.cpp[Graph Dijkstras Shortest Path Algorithm (Dijkstra's Shortest Path)] (https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm) + dijkstra.cpp[Graph Dijkstras Shortest Path Algorithm (Dijkstra's Shortest Path)] (https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)  hamiltons_cycle.cppThe implementation of Hamilton's cycle dynamic solution for vertices number less than 20  hopcroft_karp.cppImplementation of Hopcroft–Karp algorithm  is_graph_bipartite.cppAlgorithm to check whether a graph is bipartite @@ -222,7 +222,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm  binary_addition.cppAdds two binary numbers and outputs resulting string  boruvkas_minimum_spanning_tree.cpp[Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) to find the Minimum Spanning Tree  digit_separation.cppSeparates digits from numbers in forward and reverse order - dijkstra.cppDijkstra algorithm implementation + dijkstra_greedy.cppDijkstra algorithm implementation  gale_shapley.cppGale Shapley Algorithm  jump_game.cppJumping Game algorithm implementation  kruskals_minimum_spanning_tree.cppKruskals Minimum Spanning Tree implementation @@ -380,7 +380,6 @@ N)\) time, with precision fixed using persistent_seg_tree_lazy_prop.cppPersistent segment tree with range updates (lazy propagation)  prefix_sum_array.cppPrefix Sum Array data structure implementation  segtree.cppImplementation of [Segment Tree] (https://en.wikipedia.org/wiki/Segment_tree) data structure - sparse_table.cppImplementation of Sparse Table data structure  ► search  exponential_search.cppExponential search algorithm  fibonacci_search.cppFibonacci search algorithm diff --git a/globals_func_m.html b/globals_func_m.html index d8d47af0b..d61925ac2 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -107,7 +107,7 @@ $(function(){initNavTree('globals_func_m.html',''); initResizable(true); });
    Here is a list of all documented functions with links to the documentation:

    - m -

      -
    • main() : generate_parentheses.cpp, graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, bloom_filter.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, skip_list.cpp, sparse_table.cpp, treap.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, armstrong_number.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_common_string.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum.cpp, trapped_rainwater.cpp, unbounded_0_1_knapsack.cpp, word_break.cpp, memory_game.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, topological_sort.cpp, travelling_salesman_problem.cpp, spirograph.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra.cpp, gale_shapley.cpp, jump_game.cpp, kruskals_minimum_spanning_tree.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, sha256.cpp, adaline_learning.cpp, k_nearest_neighbors.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, aliquot_sum.cpp, approximate_pi.cpp, area.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, quadratic_equations_complex_numbers.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, kelvin_to_celsius.cpp, lfu_cache.cpp, longest_substring_without_repeating_characters.cpp, lru_cache.cpp, lru_cache2.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, ground_to_ground_projectile_motion.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, exponential_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, sparse_table.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, bubble_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, stooge_sort.cpp, strand_sort.cpp, wave_sort.cpp, boyer_moore.cpp, brute_force_string_searching.cpp, duval.cpp, horspool.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
      • +
    • main() : generate_parentheses.cpp, graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, bloom_filter.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, skip_list.cpp, sparse_table.cpp, treap.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, armstrong_number_templated.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane.cpp, longest_common_string.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum_dynamic.cpp, trapped_rainwater.cpp, unbounded_0_1_knapsack.cpp, word_break.cpp, memory_game.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, topological_sort.cpp, travelling_salesman_problem.cpp, spirograph.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra_greedy.cpp, gale_shapley.cpp, jump_game.cpp, kruskals_minimum_spanning_tree.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, sha256.cpp, adaline_learning.cpp, k_nearest_neighbors.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, aliquot_sum.cpp, approximate_pi.cpp, area.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, quadratic_equations_complex_numbers.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, kelvin_to_celsius.cpp, lfu_cache.cpp, longest_substring_without_repeating_characters.cpp, lru_cache.cpp, lru_cache2.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, ground_to_ground_projectile_motion.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, exponential_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, bubble_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, stooge_sort.cpp, strand_sort.cpp, wave_sort.cpp, boyer_moore.cpp, brute_force_string_searching.cpp, duval.cpp, horspool.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
    • mat_mul() : qr_eigen_values.cpp
    • max_subarray_sum() : kadanes3.cpp
    • merge() : merge_sort.cpp
      • diff --git a/globals_func_t.html b/globals_func_t.html index 6ef0b6a79..b55efcedc 100644 --- a/globals_func_t.html +++ b/globals_func_t.html @@ -108,7 +108,7 @@ $(function(){initNavTree('globals_func_t.html',''); initResizable(true); });

      - t -

      • ternary_search() : ternary_search.cpp
        • -
      • test() : generate_parentheses.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, list_array.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, sparse_table.cpp, treap.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum.cpp, trapped_rainwater.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, topological_sort.cpp, jump_game.cpp, kruskals_minimum_spanning_tree.cpp, md5.cpp, sha1.cpp, k_nearest_neighbors.cpp, neural_network.cpp, aliquot_sum.cpp, area.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, gcd_of_n_numbers.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, perimeter.cpp, power_of_two.cpp, quadratic_equations_complex_numbers.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, composite_simpson_rule.cpp, fast_fourier_transform.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, midpoint_integral_method.cpp, rungekutta.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, kadanes3.cpp, lfu_cache.cpp, lru_cache2.cpp, smallest_circle.cpp, ground_to_ground_projectile_motion.cpp, exponential_dist.cpp, geometric_dist.cpp, windowed_median.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, bubble_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, duval.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
        • +
      • test() : generate_parentheses.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, list_array.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, sparse_table.cpp, treap.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum_dynamic.cpp, trapped_rainwater.cpp, word_break.cpp, jarvis_algorithm.cpp, connected_components_with_dsu.cpp, is_graph_bipartite.cpp, topological_sort.cpp, jump_game.cpp, kruskals_minimum_spanning_tree.cpp, md5.cpp, sha1.cpp, k_nearest_neighbors.cpp, neural_network.cpp, aliquot_sum.cpp, area.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, fibonacci.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, gcd_of_n_numbers.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, largest_power.cpp, lcm_sum.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, perimeter.cpp, power_of_two.cpp, quadratic_equations_complex_numbers.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, composite_simpson_rule.cpp, fast_fourier_transform.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, midpoint_integral_method.cpp, rungekutta.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, kadanes3.cpp, lfu_cache.cpp, lru_cache2.cpp, smallest_circle.cpp, ground_to_ground_projectile_motion.cpp, exponential_dist.cpp, geometric_dist.cpp, windowed_median.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, floyd_cycle_detection_algo.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, bubble_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, merge_insertion_sort.cpp, pancake_sort.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, strand_sort.cpp, wave_sort.cpp, wiggle_sort.cpp, duval.cpp, horspool.cpp, manacher_algorithm.cpp, z_function.cpp
      • test1() : hill_cipher.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, recursive_tree_traversal.cpp, stooge_sort.cpp
      • test2() : hill_cipher.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, tree_234.cpp, hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, large_factorial.cpp, sum_of_digits.cpp, brent_method_extrema.cpp, durand_kerner_roots.cpp, golden_search_extrema.cpp, lu_decompose.cpp, qr_eigen_values.cpp, iterative_tree_traversals.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, stooge_sort.cpp
      • test3() : hamiltons_cycle.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, brent_method_extrema.cpp, golden_search_extrema.cpp, iterative_tree_traversals.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, stooge_sort.cpp
        • @@ -145,7 +145,7 @@ $(function(){initNavTree('globals_func_t.html',''); initResizable(true); });
      • test_longest_common_string_length_for_reversed_inputs() : longest_common_string.cpp
      • test_longest_common_string_length_is_symmetric() : longest_common_string.cpp
      • test_remove() : binary_search_tree2.cpp
        • -
      • tests() : armstrong_number.cpp, longest_common_string.cpp, unbounded_0_1_knapsack.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hopcroft_karp.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra.cpp, gale_shapley.cpp, approximate_pi.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, factorial.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, sieve_of_eratosthenes.cpp, kelvin_to_celsius.cpp, longest_substring_without_repeating_characters.cpp, recursive_tree_traversal.cpp, fenwick_tree.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, comb_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, quick_sort.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, boyer_moore.cpp, knuth_morris_pratt.cpp
        • +
      • tests() : armstrong_number_templated.cpp, longest_common_string.cpp, unbounded_0_1_knapsack.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hopcroft_karp.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra_greedy.cpp, gale_shapley.cpp, approximate_pi.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, factorial.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, sieve_of_eratosthenes.cpp, kelvin_to_celsius.cpp, longest_substring_without_repeating_characters.cpp, recursive_tree_traversal.cpp, fenwick_tree.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, comb_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, quick_sort.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, boyer_moore.cpp, knuth_morris_pratt.cpp
      • TH() : tower_of_hanoi.cpp
      • tolowerRoman() : decimal_to_roman_numeral.cpp
      • toupperRoman() : decimal_to_roman_numeral.cpp
        • diff --git a/globals_m.html b/globals_m.html index 03b12d0e4..7a7b5fa51 100644 --- a/globals_m.html +++ b/globals_m.html @@ -107,7 +107,7 @@ $(function(){initNavTree('globals_m.html',''); initResizable(true); });
        Here is a list of all documented file members with links to the documentation:

        - m -

          -
        • main() : generate_parentheses.cpp, graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, bloom_filter.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, skip_list.cpp, sparse_table.cpp, treap.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, armstrong_number.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_common_string.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum.cpp, trapped_rainwater.cpp, unbounded_0_1_knapsack.cpp, word_break.cpp, memory_game.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, topological_sort.cpp, travelling_salesman_problem.cpp, spirograph.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra.cpp, gale_shapley.cpp, jump_game.cpp, kruskals_minimum_spanning_tree.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, sha256.cpp, adaline_learning.cpp, k_nearest_neighbors.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, aliquot_sum.cpp, approximate_pi.cpp, area.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, quadratic_equations_complex_numbers.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, kelvin_to_celsius.cpp, lfu_cache.cpp, longest_substring_without_repeating_characters.cpp, lru_cache.cpp, lru_cache2.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, ground_to_ground_projectile_motion.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, exponential_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, sparse_table.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, bubble_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, stooge_sort.cpp, strand_sort.cpp, wave_sort.cpp, boyer_moore.cpp, brute_force_string_searching.cpp, duval.cpp, horspool.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
          • +
        • main() : generate_parentheses.cpp, graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, find_non_repeating_number.cpp, hamming_distance.cpp, next_higher_number_with_same_number_of_set_bits.cpp, power_of_2.cpp, set_kth_bit.cpp, travelling_salesman_using_bit_manipulation.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, bloom_filter.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, segment_tree.cpp, skip_list.cpp, sparse_table.cpp, treap.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, armstrong_number_templated.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane.cpp, longest_common_string.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, maximum_circular_subarray.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, subset_sum_dynamic.cpp, trapped_rainwater.cpp, unbounded_0_1_knapsack.cpp, word_break.cpp, memory_game.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, topological_sort.cpp, travelling_salesman_problem.cpp, spirograph.cpp, binary_addition.cpp, boruvkas_minimum_spanning_tree.cpp, digit_separation.cpp, dijkstra_greedy.cpp, gale_shapley.cpp, jump_game.cpp, kruskals_minimum_spanning_tree.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, sha256.cpp, adaline_learning.cpp, k_nearest_neighbors.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, aliquot_sum.cpp, approximate_pi.cpp, area.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eratosthenes.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, iterative_factorial.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, quadratic_equations_complex_numbers.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, kelvin_to_celsius.cpp, lfu_cache.cpp, longest_substring_without_repeating_characters.cpp, lru_cache.cpp, lru_cache2.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, ground_to_ground_projectile_motion.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, exponential_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, longest_increasing_subsequence_using_binary_search.cpp, median_search.cpp, median_search2.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, bubble_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, insertion_sort_recursive.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, quick_sort_iterative.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, stooge_sort.cpp, strand_sort.cpp, wave_sort.cpp, boyer_moore.cpp, brute_force_string_searching.cpp, duval.cpp, horspool.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
        • mat_mul() : qr_eigen_values.cpp
        • mat_size : matrix_exponentiation.cpp
        • matrix : lu_decomposition.h
          • diff --git a/globals_t.html b/globals_t.html index 711ea38ef..ac0e9b5bc 100644 --- a/globals_t.html +++ b/globals_t.html @@ -108,7 +108,7 @@ $(function(){initNavTree('globals_t.html',''); initResizable(true); });

          - t -

          diff --git a/navtreedata.js b/navtreedata.js index 3211b87cb..ac1057483 100644 --- a/navtreedata.js +++ b/navtreedata.js @@ -139,19 +139,19 @@ var NAVTREEINDEX = "annotated.html", "cpp/iterator/distance.html", "cpp/thread/lock.html", -"d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250", +"d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc", "d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1", "d4/d3e/n__queens_8cpp.html", -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", -"d6/d4e/namespaceciphers.html", -"d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", -"d8/d9c/union__of__two__arrays_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669", -"d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb", -"db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0", -"dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a", -"dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b", -"de/db6/a1z26__cipher_8cpp.html", -"dir_e3380d2178455503f266746fb14246a5.html" +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", +"d6/d57/array__right__rotation_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d", +"d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5", +"d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e", +"d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153", +"db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b", +"dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd", +"dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a", +"de/db4/namespacedisjoint__union.html", +"examples.html" ]; var SYNCONMSG = 'click to disable panel synchronisation'; diff --git a/navtreeindex10.js b/navtreeindex10.js index c5958f17b..f0f71ed0c 100644 --- a/navtreeindex10.js +++ b/navtreeindex10.js @@ -1,12 +1,5 @@ var NAVTREEINDEX10 = { -"d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb":[10,0,21,14], -"d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778":[10,0,21,11], -"d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50":[10,0,21,19], -"d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2":[10,0,21,2], -"d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6":[10,0,21,1], -"d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1":[10,0,21,18], -"d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03":[10,0,21,7], "d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153":[10,0,21,13], "d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153":[10,0,21,6], "d9/dde/structdouble__hashing_1_1_entry.html":[9,0,26,0], @@ -239,6 +232,12 @@ var NAVTREEINDEX10 = "da/dda/namespaceradix__sort.html":[9,0,99], "da/de7/decimal__to__hexadecimal_8cpp.html":[11,0,17,2], "da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe":[11,0,17,2,0], +"da/de8/dijkstra__greedy_8cpp.html":[11,0,11,3], +"da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,3,5], +"da/de8/dijkstra__greedy_8cpp.html#a7341d7c76a6145e991cdd231f689fca8":[11,0,11,3,4], +"da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,3,2], +"da/de8/dijkstra__greedy_8cpp.html#af6cb29ca6dc5771439f6ea7262058a71":[11,0,11,3,3], +"da/de8/dijkstra__greedy_8cpp.html#af915876d0ca33cc71a6a6191a8cd3ccd":[11,0,11,3,1], "da/df2/durand__kerner__roots_8cpp.html":[11,0,15,4], "da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377":[11,0,15,4,1], "da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,4,6], @@ -249,5 +248,6 @@ var NAVTREEINDEX10 = "da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689":[11,0,15,4,0], "db/d01/brent__method__extrema_8cpp.html":[11,0,15,2], "db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70":[11,0,15,2,1], -"db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,2,5] +"db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,2,5], +"db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,2,4] }; diff --git a/navtreeindex11.js b/navtreeindex11.js index 7b7f96076..ba4c5a454 100644 --- a/navtreeindex11.js +++ b/navtreeindex11.js @@ -1,6 +1,5 @@ var NAVTREEINDEX11 = { -"db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,2,4], "db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b":[11,0,15,2,2], "db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e":[11,0,15,2,0], "db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[11,0,15,2,6], @@ -214,9 +213,6 @@ var NAVTREEINDEX11 = "db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88":[11,0,21,2,0], "db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,21,2,2], "db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,2,1], -"db/dca/kadane2_8cpp.html":[11,0,6,7], -"db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,7,0], -"db/dca/kadane2_8cpp.html#af3029007a422a914a85c0b0122f1c7b4":[11,0,6,7,1], "db/dd3/ode__forward__euler_8cpp.html":[11,0,15,15], "db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,15,15,3], "db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f":[11,0,15,15,5], @@ -249,5 +245,9 @@ var NAVTREEINDEX11 = "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e":[10,0,3,0,0,5], "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12":[10,0,3,0,0,6], "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe":[10,0,3,0,0,16], -"dc/d14/wildcard__matching_8cpp.html":[11,0,0,11] +"dc/d14/wildcard__matching_8cpp.html":[11,0,0,11], +"dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a":[11,0,0,11,2], +"dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,11,1], +"dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,11,0], +"dc/d1a/pascal__triangle_8cpp.html":[11,0,17,16] }; diff --git a/navtreeindex12.js b/navtreeindex12.js index eaaedeea9..bfb0c73ab 100644 --- a/navtreeindex12.js +++ b/navtreeindex12.js @@ -1,9 +1,5 @@ var NAVTREEINDEX12 = { -"dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a":[11,0,0,11,2], -"dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,11,1], -"dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,11,0], -"dc/d1a/pascal__triangle_8cpp.html":[11,0,17,16], "dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd":[11,0,17,16,1], "dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c":[11,0,17,16,2], "dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,16,0], @@ -49,6 +45,11 @@ var NAVTREEINDEX12 = "dc/d64/md__coding_guidelines.html":[2], "dc/d64/md__coding_guidelines.html#autotoc_md18":[2,0], "dc/d64/md__coding_guidelines.html#autotoc_md20":[2,1], +"dc/d67/subset__sum__dynamic_8cpp.html":[11,0,6,15], +"dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607":[11,0,6,15,2], +"dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,15,3], +"dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50":[11,0,6,15,1], +"dc/d67/subset__sum__dynamic_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,15,0], "dc/d6d/power__of__2_8cpp.html":[11,0,1,6], "dc/d6d/power__of__2_8cpp.html#a5032470c9974bbd6ec254bf296530a5f":[11,0,1,6,0], "dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,6,2], @@ -248,6 +249,5 @@ var NAVTREEINDEX12 = "dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec":[9,0,69,42], "dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f":[9,0,69,25], "dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca":[9,0,69,17], -"dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967":[9,0,69,23], -"dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a":[9,0,69,14] +"dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967":[9,0,69,23] }; diff --git a/navtreeindex13.js b/navtreeindex13.js index aaf14ec13..03bb9d885 100644 --- a/navtreeindex13.js +++ b/navtreeindex13.js @@ -1,5 +1,6 @@ var NAVTREEINDEX13 = { +"dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a":[9,0,69,14], "dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b":[9,0,69,9], "dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb":[9,0,69,29], "dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0":[9,0,69,22], @@ -248,6 +249,5 @@ var NAVTREEINDEX13 = "de/dab/ncr__modulo__p_8cpp.html#a6c7bfe3bdaa086d32261a5c5584d0fa9":[11,0,14,41,3], "de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86":[11,0,14,41,2], "de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422":[11,0,14,41,1], -"de/db3/namespaceatbash.html":[9,0,3], -"de/db4/namespacedisjoint__union.html":[9,0,23] +"de/db3/namespaceatbash.html":[9,0,3] }; diff --git a/navtreeindex14.js b/navtreeindex14.js index 590d1dd63..07006f97b 100644 --- a/navtreeindex14.js +++ b/navtreeindex14.js @@ -1,5 +1,6 @@ var NAVTREEINDEX14 = { +"de/db4/namespacedisjoint__union.html":[9,0,23], "de/db6/a1z26__cipher_8cpp.html":[11,0,2,0], "de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38":[11,0,2,0,0], "de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744":[11,0,2,0,1], @@ -184,12 +185,6 @@ var NAVTREEINDEX14 = "df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389":[11,0,15,22,0], "df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,22,2], "df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456":[11,0,15,22,1], -"df/dcb/greedy__algorithms_2dijkstra_8cpp.html":[11,0,11,3], -"df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,3,5], -"df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a7341d7c76a6145e991cdd231f689fca8":[11,0,11,3,4], -"df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,3,2], -"df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af6cb29ca6dc5771439f6ea7262058a71":[11,0,11,3,3], -"df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af915876d0ca33cc71a6a6191a8cd3ccd":[11,0,11,3,1], "df/dcb/namespacestrings.html":[9,0,123], "df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html":[12,2], "df/dce/namespacegraph.html":[9,0,39], @@ -249,5 +244,10 @@ var NAVTREEINDEX14 = "dir_9c6faab82c22511b50177aa2e38e2780.html":[11,0,15], "dir_bb1b521853a9c46347182a9d10420771.html":[11,0,22], "dir_c11585dfcef32a26e29098facab6c144.html":[11,0,0], -"dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html":[11,0,3] +"dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html":[11,0,3], +"dir_e3380d2178455503f266746fb14246a5.html":[11,0,8], +"dir_e79632891301b850df87e9c0030293fa.html":[11,0,10], +"dir_ece9b94c107bbaa1dd68197a8c9983b9.html":[11,0,12], +"dir_f1797d0c2a0a12033e7d74efffeb14e1.html":[11,0,4,0], +"dir_f3c4fbc4e901afa0a54d0623c5574aa7.html":[11,0,1] }; diff --git a/navtreeindex15.js b/navtreeindex15.js index a996283e1..65d612414 100644 --- a/navtreeindex15.js +++ b/navtreeindex15.js @@ -1,10 +1,5 @@ var NAVTREEINDEX15 = { -"dir_e3380d2178455503f266746fb14246a5.html":[11,0,8], -"dir_e79632891301b850df87e9c0030293fa.html":[11,0,10], -"dir_ece9b94c107bbaa1dd68197a8c9983b9.html":[11,0,12], -"dir_f1797d0c2a0a12033e7d74efffeb14e1.html":[11,0,4,0], -"dir_f3c4fbc4e901afa0a54d0623c5574aa7.html":[11,0,1], "examples.html":[12], "files.html":[11,0], "functions.html":[10,3,0], diff --git a/navtreeindex2.js b/navtreeindex2.js index b18fe7845..9721e8dee 100644 --- a/navtreeindex2.js +++ b/navtreeindex2.js @@ -157,10 +157,6 @@ var NAVTREEINDEX2 = "d0/de2/gaussian__elimination_8cpp.html":[11,0,15,7], "d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,7,0], "d0/df8/namespaceabbreviation.html":[9,0,1], -"d0/dfe/backtracking_2subset__sum_8cpp.html":[11,0,0,9], -"d0/dfe/backtracking_2subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99":[11,0,0,9,1], -"d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,9,2], -"d0/dfe/backtracking_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,9,0], "d0/dff/structlinkedlist.html":[10,0,38], "d1/d11/gcd__of__n__numbers_8cpp.html":[11,0,14,22], "d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532":[11,0,14,22,1], @@ -249,5 +245,9 @@ var NAVTREEINDEX2 = "d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261":[10,0,61,61], "d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a":[10,0,61,80], "d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484":[10,0,61,60], -"d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839":[10,0,61,23] +"d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839":[10,0,61,23], +"d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250":[10,0,61,9], +"d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363":[10,0,61,13], +"d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183":[10,0,61,42], +"d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963":[10,0,61,25] }; diff --git a/navtreeindex3.js b/navtreeindex3.js index 93ed673ec..da0720521 100644 --- a/navtreeindex3.js +++ b/navtreeindex3.js @@ -1,9 +1,5 @@ var NAVTREEINDEX3 = { -"d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250":[10,0,61,9], -"d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363":[10,0,61,13], -"d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183":[10,0,61,42], -"d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963":[10,0,61,25], "d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc":[10,0,61,75], "d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1":[10,0,61,11], "d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967":[10,0,61,30], @@ -49,6 +45,10 @@ var NAVTREEINDEX3 = "d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856":[11,0,15,21,2], "d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,15,21,3], "d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,21,1], +"d1/da7/armstrong__number__templated_8cpp.html":[11,0,6,2], +"d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,6,2,2], +"d1/da7/armstrong__number__templated_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,2,1], +"d1/da7/armstrong__number__templated_8cpp.html#af046365a8d77a1267acc082f86135a26":[11,0,6,2,0], "d1/daa/random__pivot__quick__sort_8cpp.html":[11,0,22,20], "d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,22,20,3], "d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e":[11,0,22,20,4], @@ -59,10 +59,6 @@ var NAVTREEINDEX3 = "d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10":[11,0,22,20,6], "d1/db3/structcompare.html":[10,0,26], "d1/db6/namespaceknight__tour.html":[9,0,59], -"d1/db7/dynamic__programming_2armstrong__number_8cpp.html":[11,0,6,2], -"d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,6,2,2], -"d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,2,1], -"d1/db7/dynamic__programming_2armstrong__number_8cpp.html#af046365a8d77a1267acc082f86135a26":[11,0,6,2,0], "d1/dbb/n__choose__r_8cpp.html":[11,0,14,40], "d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,40,0], "d1/dbb/n__choose__r_8cpp.html#a6e2dff75c5de70455b90c799d6ad6967":[11,0,14,40,1], @@ -205,6 +201,10 @@ var NAVTREEINDEX3 = "d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,13,4,11], "d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,13,4,6], "d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e":[11,0,13,4,7], +"d2/d5a/subset__sum_8cpp.html":[11,0,0,9], +"d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99":[11,0,0,9,1], +"d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,9,2], +"d2/d5a/subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,9,0], "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html":[10,0,16,0,0], "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8":[10,0,16,0,0,3], "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725":[10,0,16,0,0,10], diff --git a/navtreeindex5.js b/navtreeindex5.js index 2f10d4811..2e0e1c628 100644 --- a/navtreeindex5.js +++ b/navtreeindex5.js @@ -78,11 +78,6 @@ var NAVTREEINDEX5 = "d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[9,0,21,5,5], "d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[10,0,2,12,5], "d4/d91/namespacevector__cross.html":[9,0,137], -"d4/d96/range__queries_2sparse__table_8cpp.html":[11,0,20,5], -"d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300":[11,0,20,5,1], -"d4/d96/range__queries_2sparse__table_8cpp.html#a803a2451e87021d14ae06f148383e6bc":[11,0,20,5,0], -"d4/d96/range__queries_2sparse__table_8cpp.html#a932816c3de9e5ad122b180de60978e8f":[11,0,20,5,2], -"d4/d96/range__queries_2sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,5,3], "d4/d9c/primes__up__to__billion_8cpp.html":[11,0,14,48], "d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c":[11,0,14,48,1], "d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95":[11,0,14,48,2], @@ -99,6 +94,9 @@ var NAVTREEINDEX5 = "d4/da0/gcd__iterative__euclidean_8cpp.html":[11,0,14,21], "d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e":[11,0,14,21,0], "d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,21,1], +"d4/da0/kadane_8cpp.html":[11,0,6,7], +"d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,7,0], +"d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4":[11,0,6,7,1], "d4/db4/struct_segment_intersection.html":[10,0,52], "d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf":[10,0,52,1], "d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655":[10,0,52,0], @@ -249,5 +247,7 @@ var NAVTREEINDEX5 = "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52":[4,6], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53":[4,7], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54":[4,8], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55":[4,9] +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55":[4,9], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56":[4,10], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57":[4,11] }; diff --git a/navtreeindex6.js b/navtreeindex6.js index eaea3fdcd..d13397d98 100644 --- a/navtreeindex6.js +++ b/navtreeindex6.js @@ -1,7 +1,5 @@ var NAVTREEINDEX6 = { -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56":[4,10], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57":[4,11], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58":[4,12], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59":[4,13], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60":[4,14], @@ -228,11 +226,6 @@ var NAVTREEINDEX6 = "d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,3,2], "d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3":[11,0,1,3,0], "d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,3,1], -"d6/d42/data__structures_2sparse__table_8cpp.html":[11,0,4,19], -"d6/d42/data__structures_2sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,4,19,1], -"d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d":[11,0,4,19,4], -"d6/d42/data__structures_2sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,19,2], -"d6/d42/data__structures_2sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e":[11,0,4,19,3], "d6/d42/miller__rabin_8cpp.html":[11,0,14,34], "d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb":[11,0,14,34,4], "d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506":[11,0,14,34,2], @@ -249,5 +242,12 @@ var NAVTREEINDEX6 = "d6/d4a/addition__rule_8cpp.html":[11,0,19,0], "d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d":[11,0,19,0,1], "d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0":[11,0,19,0,0], -"d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,0,2] +"d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,0,2], +"d6/d4e/namespaceciphers.html":[9,0,13], +"d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216":[9,0,13,2], +"d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html":[12,1], +"d6/d53/namespaceword__break.html":[9,0,143], +"d6/d57/array__right__rotation_8cpp.html":[11,0,16,1], +"d6/d57/array__right__rotation_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,1,4], +"d6/d57/array__right__rotation_8cpp.html#a1bfb8711f49e591eb168ccaa3df6fb86":[11,0,16,1,2] }; diff --git a/navtreeindex7.js b/navtreeindex7.js index 1fc61a293..c70dfb743 100644 --- a/navtreeindex7.js +++ b/navtreeindex7.js @@ -1,12 +1,5 @@ var NAVTREEINDEX7 = { -"d6/d4e/namespaceciphers.html":[9,0,13], -"d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216":[9,0,13,2], -"d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html":[12,1], -"d6/d53/namespaceword__break.html":[9,0,143], -"d6/d57/array__right__rotation_8cpp.html":[11,0,16,1], -"d6/d57/array__right__rotation_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,1,4], -"d6/d57/array__right__rotation_8cpp.html#a1bfb8711f49e591eb168ccaa3df6fb86":[11,0,16,1,2], "d6/d57/array__right__rotation_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,1,7], "d6/d57/array__right__rotation_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,1,1], "d6/d57/array__right__rotation_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,1,6], @@ -42,11 +35,6 @@ var NAVTREEINDEX7 = "d6/d80/double__hash__hash__table_8cpp.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b":[11,0,12,1,8], "d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,1,6], "d6/d80/double__hash__hash__table_8cpp.html#af4981819aae8bc7e7beeaef02615e30d":[11,0,12,1,9], -"d6/d80/dynamic__programming_2subset__sum_8cpp.html":[11,0,6,15], -"d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607":[11,0,6,15,2], -"d6/d80/dynamic__programming_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,15,3], -"d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50":[11,0,6,15,1], -"d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,15,0], "d6/d84/classhashing_1_1sha256_1_1_hash.html":[10,0,8,0,0], "d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3":[10,0,8,0,0,1], "d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08":[10,0,8,0,0,0], @@ -141,11 +129,6 @@ var NAVTREEINDEX7 = "d7/d08/namespacegraph__coloring.html":[9,0,40], "d7/d0a/namespacetrie__using__hashmap.html":[9,0,134], "d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html":[6], -"d7/d1e/graph_2dijkstra_8cpp.html":[11,0,9,6], -"d7/d1e/graph_2dijkstra_8cpp.html#a0e30e0dca68cb6e4f671440819b35b6a":[11,0,9,6,0], -"d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,9,6,3], -"d7/d1e/graph_2dijkstra_8cpp.html#adc68cbc8ba09eb1142265935c0d45b84":[11,0,9,6,1], -"d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,6,2], "d7/d24/nqueen__print__all__solutions_8cpp.html":[11,0,0,6], "d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108":[11,0,0,6,2], "d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,6,1], @@ -249,5 +232,22 @@ var NAVTREEINDEX7 = "d7/dba/cll_8h_source.html":[11,0,4,0,0], "d7/dbf/namespacestd_1_1this__thread.html":[9,0,118,4], "d7/ded/queue_8hpp_source.html":[11,0,4,13], -"d7/def/trie__multiple__search_8cpp.html":[11,0,16,6] +"d7/def/trie__multiple__search_8cpp.html":[11,0,16,6], +"d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,6,2], +"d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,16,6,1], +"d8/d10/structlist.html":[10,0,39], +"d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f":[10,0,39,1], +"d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c":[10,0,39,0], +"d8/d13/bubble__sort_8cpp.html":[11,0,22,2], +"d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,2,2], +"d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,2,1], +"d8/d13/bubble__sort_8cpp.html#af3b12930a83915712461d53fe9659686":[11,0,22,2,0], +"d8/d14/namespacen__queens__optimized.html":[9,0,83], +"d8/d1d/namespacestrand.html":[9,0,119], +"d8/d28/classrange__queries_1_1per_seg_tree.html":[9,0,101,1], +"d8/d28/classrange__queries_1_1per_seg_tree.html":[10,0,16,2], +"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[9,0,101,1,4], +"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[10,0,16,2,4], +"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[9,0,101,1,7], +"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[10,0,16,2,7] }; diff --git a/navtreeindex8.js b/navtreeindex8.js index 28021273d..651717092 100644 --- a/navtreeindex8.js +++ b/navtreeindex8.js @@ -1,22 +1,5 @@ var NAVTREEINDEX8 = { -"d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,6,2], -"d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,16,6,1], -"d8/d10/structlist.html":[10,0,39], -"d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f":[10,0,39,1], -"d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c":[10,0,39,0], -"d8/d13/bubble__sort_8cpp.html":[11,0,22,2], -"d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,2,2], -"d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,2,1], -"d8/d13/bubble__sort_8cpp.html#af3b12930a83915712461d53fe9659686":[11,0,22,2,0], -"d8/d14/namespacen__queens__optimized.html":[9,0,83], -"d8/d1d/namespacestrand.html":[9,0,119], -"d8/d28/classrange__queries_1_1per_seg_tree.html":[9,0,101,1], -"d8/d28/classrange__queries_1_1per_seg_tree.html":[10,0,16,2], -"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[9,0,101,1,4], -"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[10,0,16,2,4], -"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[9,0,101,1,7], -"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[10,0,16,2,7], "d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5":[9,0,101,1,10], "d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5":[10,0,16,2,10], "d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6":[9,0,101,1,8], @@ -87,6 +70,11 @@ var NAVTREEINDEX8 = "d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8":[11,0,22,19,1], "d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,19,0], "d8/d64/namespaceboruvkas__minimum__spanning__tree.html":[9,0,10], +"d8/d68/dijkstra_8cpp.html":[11,0,9,6], +"d8/d68/dijkstra_8cpp.html#a0e30e0dca68cb6e4f671440819b35b6a":[11,0,9,6,0], +"d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,9,6,3], +"d8/d68/dijkstra_8cpp.html#adc68cbc8ba09eb1142265935c0d45b84":[11,0,9,6,1], +"d8/d68/dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,6,2], "d8/d69/classgraph_1_1_h_k_graph.html":[9,0,39,1], "d8/d69/classgraph_1_1_h_k_graph.html":[10,0,6,3], "d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[9,0,39,1,1], @@ -249,5 +237,17 @@ var NAVTREEINDEX8 = "d8/d9c/union__of__two__arrays_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,7,2], "d8/d9c/union__of__two__arrays_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,7,6], "d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,7,3], -"d8/d9c/union__of__two__arrays_8cpp.html#aacafde185abd8670abee51157f273dc2":[11,0,16,7,9] +"d8/d9c/union__of__two__arrays_8cpp.html#aacafde185abd8670abee51157f273dc2":[11,0,16,7,9], +"d8/d9c/union__of__two__arrays_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,7,5], +"d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,7,1], +"d8/d9c/union__of__two__arrays_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,7,8], +"d8/d9f/namespacesudoku__solver.html":[9,0,128], +"d8/da7/namespacedepth__first__search.html":[9,0,22], +"d8/dab/classstatistics_1_1stats__computer2.html":[9,0,117,1], +"d8/dab/classstatistics_1_1stats__computer2.html":[10,0,18,1], +"d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[9,0,117,1,0], +"d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[10,0,18,1,0], +"d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[9,0,117,1,4], +"d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[10,0,18,1,4], +"d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[9,0,117,1,2] }; diff --git a/navtreeindex9.js b/navtreeindex9.js index 0c04a497e..85d0e40ab 100644 --- a/navtreeindex9.js +++ b/navtreeindex9.js @@ -1,22 +1,15 @@ var NAVTREEINDEX9 = { -"d8/d9c/union__of__two__arrays_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,7,5], -"d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,7,1], -"d8/d9c/union__of__two__arrays_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,7,8], -"d8/d9f/namespacesudoku__solver.html":[9,0,128], -"d8/da7/namespacedepth__first__search.html":[9,0,22], -"d8/dab/classstatistics_1_1stats__computer2.html":[9,0,117,1], -"d8/dab/classstatistics_1_1stats__computer2.html":[10,0,18,1], -"d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[9,0,117,1,0], -"d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[10,0,18,1,0], -"d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[9,0,117,1,4], -"d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[10,0,18,1,4], -"d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[9,0,117,1,2], "d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[10,0,18,1,2], "d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534":[9,0,117,1,1], "d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534":[10,0,18,1,1], "d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555":[9,0,117,1,3], "d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555":[10,0,18,1,3], +"d8/dab/sparse__table_8cpp.html":[11,0,4,19], +"d8/dab/sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,4,19,1], +"d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d":[11,0,4,19,4], +"d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,19,2], +"d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e":[11,0,4,19,3], "d8/db1/binomial__calculate_8cpp.html":[11,0,14,4], "d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,4,2], "d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978":[11,0,14,4,0], @@ -249,5 +242,12 @@ var NAVTREEINDEX9 = "d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63":[10,0,21,3], "d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb":[10,0,21,4], "d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0":[10,0,21,12], -"d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362":[10,0,21,17] +"d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362":[10,0,21,17], +"d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb":[10,0,21,14], +"d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778":[10,0,21,11], +"d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50":[10,0,21,19], +"d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2":[10,0,21,2], +"d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6":[10,0,21,1], +"d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1":[10,0,21,18], +"d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03":[10,0,21,7] }; diff --git a/search/all_10.js b/search/all_10.js index a9e28163b..f03f173a1 100644 --- a/search/all_10.js +++ b/search/all_10.js @@ -4,7 +4,7 @@ var searchData= ['k_5fnearest_5fneighbors_1',['k_nearest_neighbors',['../d7/d4c/namespacek__nearest__neighbors.html',1,'']]], ['k_5fnearest_5fneighbors_2ecpp_2',['k_nearest_neighbors.cpp',['../d4/d3e/k__nearest__neighbors_8cpp.html',1,'']]], ['kadane_3',['kadane',['../d6/d74/namespacekadane.html',1,'']]], - ['kadane2_2ecpp_4',['kadane2.cpp',['../db/dca/kadane2_8cpp.html',1,'']]], + ['kadane_2ecpp_4',['kadane.cpp',['../d4/da0/kadane_8cpp.html',1,'']]], ['kadanes3_2ecpp_5',['kadanes3.cpp',['../de/dcd/kadanes3_8cpp.html',1,'']]], ['karatsuba_5falgorithm_6',['karatsuba_algorithm',['../de/d41/namespacekaratsuba__algorithm.html',1,'karatsuba_algorithm'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7a890d2f26855ada3b9f1d43aec70a86',1,'divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm()']]], ['karatsuba_5falgorithm_5ffor_5ffast_5fmultiplication_2ecpp_7',['karatsuba_algorithm_for_fast_multiplication.cpp',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html',1,'']]], diff --git a/search/all_12.js b/search/all_12.js index 8e4ef76ff..4139991ad 100644 --- a/search/all_12.js +++ b/search/all_12.js @@ -1,6 +1,6 @@ var searchData= [ - ['m_0',['M',['../d6/d42/data__structures_2sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e',1,'data_structures::sparse_table']]], + ['m_0',['M',['../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e',1,'data_structures::sparse_table']]], ['m_1',['m',['../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74',1,'graph::HKGraph::m'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution::m()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::m()']]], ['machine_20learning_2',['Machine Learning',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58',1,'']]], ['machine_20learning_20algorithms_3',['Machine Learning Algorithms',['../d9/d66/group__machine__learning.html',1,'']]], @@ -9,7 +9,7 @@ var searchData= ['magic_5fnumber_6',['magic_number',['../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0',1,'math']]], ['magic_5fnumber_2ecpp_7',['magic_number.cpp',['../d9/d44/magic__number_8cpp.html',1,'']]], ['magic_5fsequence_8',['magic_sequence',['../d8/d93/namespacemagic__sequence.html',1,'']]], - ['main_9',['main',['../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): skip_list.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): abbreviation.cpp'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): armstrong_number.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): house_robber.cpp'],['../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadane2.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_common_string.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trapped_rainwater.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): unbounded_0_1_knapsack.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): word_break.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): memory_game.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jarvis_algorithm.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components_with_dsu.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): hamiltons_cycle.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hopcroft_karp.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): is_graph_bipartite.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lowest_common_ancestor.cpp'],['../d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): topological_sort.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_problem.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.cpp'],['../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): digit_separation.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gale_shapley.cpp'],['../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kruskals_minimum_spanning_tree.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): chaining.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_hash_hash_table.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): md5.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_probing_hash_table.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha1.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha256.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): k_nearest_neighbors.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): neural_network.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): aliquot_sum.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): approximate_pi.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): area.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_sum.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): finding_number_of_digits_in_a_number.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_factorial.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lcm_sum.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): miller_rabin.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): n_choose_r.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): perimeter.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_two.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_equations_complex_numbers.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): babylonian_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brent_method_extrema.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): composite_simpson_rule.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): fast_fourier_transform.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): golden_search_extrema.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): inverse_fast_fourier_transform.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): midpoint_integral_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rungekutta.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_of_two_arrays.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_integer_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_tree_traversals.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadanes3.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kelvin_to_celsius.cpp'],['../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lfu_cache.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_substring_without_repeating_characters.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache2.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): postfix_evaluation.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ground_to_ground_projectile_motion.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): geometric_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): windowed_median.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fenwick_tree.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heavy_light_decomposition.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segtree.cpp'],['../d4/d96/range__queries_2sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_table.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): floyd_cycle_detection_algo.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sublist_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bubble_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): comb_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heap_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort_recursive.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_insertion_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pancake_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pigeonhole_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_3.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): radix_sort2.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): selection_sort_recursive.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stooge_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wave_sort.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boyer_moore.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): duval.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): manacher_algorithm.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): z_function.cpp']]], + ['main_9',['main',['../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subarray_sum.cpp'],['../d2/d5a/subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): skip_list.cpp'],['../d8/dab/sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): abbreviation.cpp'],['../d1/da7/armstrong__number__templated_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): armstrong_number_templated.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): house_robber.cpp'],['../d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadane.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_common_string.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): shortest_common_supersequence.cpp'],['../dc/d67/subset__sum__dynamic_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum_dynamic.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trapped_rainwater.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): unbounded_0_1_knapsack.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): word_break.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): memory_game.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jarvis_algorithm.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components_with_dsu.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search_with_stack.cpp'],['../d8/d68/dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): hamiltons_cycle.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hopcroft_karp.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): is_graph_bipartite.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lowest_common_ancestor.cpp'],['../d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): topological_sort.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_problem.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.cpp'],['../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): digit_separation.cpp'],['../da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra_greedy.cpp'],['../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gale_shapley.cpp'],['../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kruskals_minimum_spanning_tree.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): chaining.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_hash_hash_table.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): md5.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_probing_hash_table.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha1.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha256.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): k_nearest_neighbors.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): neural_network.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): aliquot_sum.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): approximate_pi.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): area.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_sum.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): finding_number_of_digits_in_a_number.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_factorial.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lcm_sum.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): miller_rabin.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): n_choose_r.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): perimeter.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_two.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_equations_complex_numbers.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): babylonian_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brent_method_extrema.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): composite_simpson_rule.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): fast_fourier_transform.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): golden_search_extrema.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): inverse_fast_fourier_transform.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): midpoint_integral_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rungekutta.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_of_two_arrays.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_integer_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_tree_traversals.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadanes3.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kelvin_to_celsius.cpp'],['../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lfu_cache.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_substring_without_repeating_characters.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache2.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): postfix_evaluation.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ground_to_ground_projectile_motion.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): geometric_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): windowed_median.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fenwick_tree.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heavy_light_decomposition.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segtree.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): floyd_cycle_detection_algo.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sublist_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bubble_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): comb_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heap_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort_recursive.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_insertion_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pancake_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pigeonhole_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_3.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): radix_sort2.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): selection_sort_recursive.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stooge_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wave_sort.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boyer_moore.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): duval.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): manacher_algorithm.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): z_function.cpp']]], ['main_5fq_10',['main_q',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6',1,'data_structures::stack_using_queue::Stack']]], ['maintainer_20reviewer_11',['Maintainer/reviewer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24',1,'']]], ['maintainers_12',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]], @@ -71,7 +71,7 @@ var searchData= ['maxknapsackvalue_68',['maxKnapsackValue',['../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1',1,'dynamic_programming::knapsack']]], ['maxnode_69',['maxNode',['../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099',1,'data_structures::treap']]], ['maxprofitbycuttingrod_70',['maxProfitByCuttingRod',['../d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa',1,'dynamic_programming::cut_rod']]], - ['maxsubarray_71',['maxSubArray',['../db/dca/kadane2_8cpp.html#af3029007a422a914a85c0b0122f1c7b4',1,'dynamic_programming::kadane']]], + ['maxsubarray_71',['maxSubArray',['../d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4',1,'dynamic_programming::kadane']]], ['mblen_72',['mblen',['http://en.cppreference.com/w/cpp/string/multibyte/mblen.html',0,'std']]], ['mbrlen_73',['mbrlen',['http://en.cppreference.com/w/cpp/string/multibyte/mbrlen.html',0,'std']]], ['mbrtoc16_74',['mbrtoc16',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc16.html',0,'std']]], diff --git a/search/all_13.js b/search/all_13.js index 45d260c4f..6b5bfea9f 100644 --- a/search/all_13.js +++ b/search/all_13.js @@ -1,6 +1,6 @@ var searchData= [ - ['n_0',['N',['../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d',1,'data_structures::sparse_table']]], + ['n_0',['N',['../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d',1,'data_structures::sparse_table']]], ['n_1',['n',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635',1,'data_structures::sparse_table::Sparse_table::n'],['../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c',1,'graph::HKGraph::n'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef',1,'graph::is_graph_bipartite::Graph::n'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6',1,'range_queries::fenwick_tree::n'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/n.html',0,'std::student_t_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/n.html',0,'std::chi_squared_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::n()']]], ['n_5fbonacci_2',['N_bonacci',['../db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d',1,'math::n_bonacci']]], ['n_5fbonacci_3',['n_bonacci',['../de/d36/namespacen__bonacci.html',1,'']]], @@ -94,7 +94,7 @@ var searchData= ['num_5fput_91',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put'],['http://en.cppreference.com/w/cpp/locale/num_put/num_put.html',0,'std::num_put::num_put()']]], ['number_5fof_5fpositive_5fdivisors_92',['number_of_positive_divisors',['../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb',1,'number_of_positive_divisors.cpp']]], ['number_5fof_5fpositive_5fdivisors_2ecpp_93',['number_of_positive_divisors.cpp',['../d0/da2/number__of__positive__divisors_8cpp.html',1,'']]], - ['number_5fof_5fsubsets_94',['number_of_subsets',['../d0/dfe/backtracking_2subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99',1,'backtracking::subset_sum']]], + ['number_5fof_5fsubsets_94',['number_of_subsets',['../d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99',1,'backtracking::subset_sum']]], ['number_5fof_5fvertices_95',['number_of_vertices',['../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904',1,'graph::Graph']]], ['numberofchildren_96',['numberOfChildren',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0',1,'operations_on_datastructures::trie_operations::Tnode']]], ['numberofciphersinfactorialn_97',['numberOfCiphersInFactorialN',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0',1,'bit_manipulation::count_of_trailing_ciphers_in_factorial_n']]], diff --git a/search/all_18.js b/search/all_18.js index 5435758ca..c7246e95b 100644 --- a/search/all_18.js +++ b/search/all_18.js @@ -174,7 +174,7 @@ var searchData= ['sparse_5fmatrix_2ecpp_171',['sparse_matrix.cpp',['../d3/d19/sparse__matrix_8cpp.html',1,'']]], ['sparse_5ftable_172',['Sparse_table',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html',1,'data_structures::sparse_table']]], ['sparse_5ftable_173',['sparse_table',['../d9/d55/namespacesparse__table.html',1,'']]], - ['sparse_5ftable_2ecpp_174',['sparse_table.cpp',['../d6/d42/data__structures_2sparse__table_8cpp.html',1,'(Global Namespace)'],['../d4/d96/range__queries_2sparse__table_8cpp.html',1,'(Global Namespace)']]], + ['sparse_5ftable_2ecpp_174',['sparse_table.cpp',['../d8/dab/sparse__table_8cpp.html',1,'']]], ['sphere_5fsurface_5farea_175',['sphere_surface_area',['../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656',1,'math']]], ['sphere_5fvolume_176',['sphere_volume',['../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551',1,'math']]], ['spiral_5fprint_2ecpp_177',['spiral_print.cpp',['../db/d07/spiral__print_8cpp.html',1,'']]], @@ -307,36 +307,37 @@ var searchData= ['sublist_5fsearch_2ecpp_304',['sublist_search.cpp',['../d5/d45/sublist__search_8cpp.html',1,'']]], ['sublistsearch_305',['sublistSearch',['../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c',1,'search::sublist_search']]], ['subset_5fsum_306',['subset_sum',['../dc/d3a/namespacesubset__sum.html',1,'']]], - ['subset_5fsum_2ecpp_307',['subset_sum.cpp',['../d0/dfe/backtracking_2subset__sum_8cpp.html',1,'(Global Namespace)'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html',1,'(Global Namespace)']]], - ['subset_5fsum_5fproblem_308',['subset_sum_problem',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50',1,'dynamic_programming::subset_sum']]], - ['subset_5fsum_5frecursion_309',['subset_sum_recursion',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607',1,'dynamic_programming::subset_sum']]], - ['subsets_310',['Subsets',['../de/d95/namespace_subsets.html',1,'']]], - ['substr_311',['substr',['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::basic_string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::wstring::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u16string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u32string::substr()']]], - ['subtract_5fwith_5fcarry_5fengine_312',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine::subtract_with_carry_engine()']]], - ['subtree_313',['subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]], - ['succ_314',['succ',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3',1,'data_structures::linked_list::link']]], - ['successive_5fapproximation_2ecpp_315',['successive_approximation.cpp',['../df/dc8/successive__approximation_8cpp.html',1,'']]], - ['sudoku_5fsolver_316',['sudoku_solver',['../d8/d9f/namespacesudoku__solver.html',1,'']]], - ['sudoku_5fsolver_2ecpp_317',['sudoku_solver.cpp',['../d3/d05/sudoku__solver_8cpp.html',1,'']]], - ['suffix_318',['suffix',['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::match_results::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wsmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::smatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wcmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::cmatch::suffix()']]], - ['suggestautocomplete_319',['SuggestAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['suggestfreqautocomplete_320',['SuggestFreqAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c',1,'operations_on_datastructures::trie_operations::Tnode']]], - ['sum_321',['sum',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd',1,'range_queries::fenwick_tree::sum()'],['../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35',1,'machine_learning::sum()']]], - ['sum_5fof_5fbinomial_5fcoefficient_2ecpp_322',['sum_of_binomial_coefficient.cpp',['../d4/d9d/sum__of__binomial__coefficient_8cpp.html',1,'']]], - ['sum_5fof_5fdigits_323',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]], - ['sum_5fof_5fdigits_2ecpp_324',['sum_of_digits.cpp',['../d4/d83/sum__of__digits_8cpp.html',1,'']]], - ['sum_5fof_5fdivisor_325',['sum_of_divisor',['../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a',1,'math']]], - ['sum_5frange_326',['sum_range',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe',1,'range_queries::fenwick_tree']]], - ['summary_327',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]], - ['sungetc_328',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()']]], - ['swap_329',['swap',['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::fstream::swap()'],['http://en.cppreference.com/w/cpp/container/vector/swap.html',0,'std::vector::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::match_results::swap()'],['http://en.cppreference.com/w/cpp/container/multiset/swap.html',0,'std::multiset::swap()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/swap.html',0,'std::weak_ptr::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostream::swap()'],['http://en.cppreference.com/w/cpp/container/set/swap.html',0,'std::set::swap()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/swap.html',0,'std::unique_lock::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostringstream::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::regex::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_map/swap.html',0,'std::unordered_map::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::basic_regex::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_filebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ios::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wsmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/tuple/swap.html',0,'std::tuple::swap()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/swap.html',0,'std::shared_ptr::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_fstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::stringbuf::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::wregex::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::smatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wfilebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::iostream::swap()'],['http://en.cppreference.com/w/cpp/container/stack/swap.html',0,'std::stack::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::stringstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/swap.html',0,'std::unordered_multimap::swap()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/swap.html',0,'std::unique_ptr::swap()'],['http://en.cppreference.com/w/cpp/container/forward_list/swap.html',0,'std::forward_list::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::strstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostream::swap()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/swap.html',0,'std::shared_lock::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wcmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/pair/swap.html',0,'std::pair::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wifstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_stringbuf::swap()'],['http://en.cppreference.com/w/cpp/container/deque/swap.html',0,'std::deque::swap()'],['http://en.cppreference.com/w/cpp/thread/promise/swap.html',0,'std::promise::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::strstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_streambuf::swap()'],['http://en.cppreference.com/w/cpp/container/queue/swap.html',0,'std::queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_stringstream::swap()'],['http://en.cppreference.com/w/cpp/thread/thread/swap.html',0,'std::thread::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::basic_string::swap()'],['http://en.cppreference.com/w/cpp/container/priority_queue/swap.html',0,'std::priority_queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostringstream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::wstring::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istrstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/swap.html',0,'std::unordered_multiset::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostream::swap()'],['http://en.cppreference.com/w/cpp/utility/functional/function/swap.html',0,'std::function::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::filebuf::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u16string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wiostream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u32string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/list/swap.html',0,'std::list::swap()'],['http://en.cppreference.com/w/cpp/container/map/swap.html',0,'std::map::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::cmatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::streambuf::swap()'],['http://en.cppreference.com/w/cpp/experimental/optional/swap.html',0,'std::experimental::optional::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostrstream::swap()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/swap.html',0,'std::packaged_task::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_set/swap.html',0,'std::unordered_set::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wfstream::swap()'],['http://en.cppreference.com/w/cpp/container/multimap/swap.html',0,'std::multimap::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_iostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wstringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/array/swap.html',0,'std::array::swap()'],['http://en.cppreference.com/w/cpp/algorithm/swap.html',0,'std::swap(T... args)']]], - ['swap_5franges_330',['swap_ranges',['http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html',0,'std']]], - ['swprintf_331',['swprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], - ['swscanf_332',['swscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]], - ['sync_333',['sync',['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::strstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istrstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wiostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_ifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wfstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wstringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::ifstream::sync()']]], - ['sync_5fwith_5fstdio_334',['sync_with_stdio',['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ios::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ios_base::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::strstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wiostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wfstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wstringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ifstream::sync_with_stdio()']]], - ['system_335',['system',['http://en.cppreference.com/w/cpp/utility/program/system.html',0,'std']]], - ['system_5fcategory_336',['system_category',['http://en.cppreference.com/w/cpp/error/system_category.html',0,'std']]], - ['system_5fclock_337',['system_clock',['http://en.cppreference.com/w/cpp/chrono/system_clock.html',0,'std::chrono']]], - ['system_5ferror_338',['system_error',['http://en.cppreference.com/w/cpp/error/system_error.html',0,'std::system_error'],['http://en.cppreference.com/w/cpp/error/system_error/system_error.html',0,'std::system_error::system_error()']]] + ['subset_5fsum_2ecpp_307',['subset_sum.cpp',['../d2/d5a/subset__sum_8cpp.html',1,'']]], + ['subset_5fsum_5fdynamic_2ecpp_308',['subset_sum_dynamic.cpp',['../dc/d67/subset__sum__dynamic_8cpp.html',1,'']]], + ['subset_5fsum_5fproblem_309',['subset_sum_problem',['../dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50',1,'dynamic_programming::subset_sum']]], + ['subset_5fsum_5frecursion_310',['subset_sum_recursion',['../dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607',1,'dynamic_programming::subset_sum']]], + ['subsets_311',['Subsets',['../de/d95/namespace_subsets.html',1,'']]], + ['substr_312',['substr',['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::basic_string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::wstring::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u16string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u32string::substr()']]], + ['subtract_5fwith_5fcarry_5fengine_313',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine::subtract_with_carry_engine()']]], + ['subtree_314',['subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]], + ['succ_315',['succ',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3',1,'data_structures::linked_list::link']]], + ['successive_5fapproximation_2ecpp_316',['successive_approximation.cpp',['../df/dc8/successive__approximation_8cpp.html',1,'']]], + ['sudoku_5fsolver_317',['sudoku_solver',['../d8/d9f/namespacesudoku__solver.html',1,'']]], + ['sudoku_5fsolver_2ecpp_318',['sudoku_solver.cpp',['../d3/d05/sudoku__solver_8cpp.html',1,'']]], + ['suffix_319',['suffix',['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::match_results::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wsmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::smatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wcmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::cmatch::suffix()']]], + ['suggestautocomplete_320',['SuggestAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe',1,'operations_on_datastructures::trie_operations::Tnode']]], + ['suggestfreqautocomplete_321',['SuggestFreqAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c',1,'operations_on_datastructures::trie_operations::Tnode']]], + ['sum_322',['sum',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd',1,'range_queries::fenwick_tree::sum()'],['../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35',1,'machine_learning::sum()']]], + ['sum_5fof_5fbinomial_5fcoefficient_2ecpp_323',['sum_of_binomial_coefficient.cpp',['../d4/d9d/sum__of__binomial__coefficient_8cpp.html',1,'']]], + ['sum_5fof_5fdigits_324',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]], + ['sum_5fof_5fdigits_2ecpp_325',['sum_of_digits.cpp',['../d4/d83/sum__of__digits_8cpp.html',1,'']]], + ['sum_5fof_5fdivisor_326',['sum_of_divisor',['../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a',1,'math']]], + ['sum_5frange_327',['sum_range',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe',1,'range_queries::fenwick_tree']]], + ['summary_328',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]], + ['sungetc_329',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()']]], + ['swap_330',['swap',['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::fstream::swap()'],['http://en.cppreference.com/w/cpp/container/vector/swap.html',0,'std::vector::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::match_results::swap()'],['http://en.cppreference.com/w/cpp/container/multiset/swap.html',0,'std::multiset::swap()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/swap.html',0,'std::weak_ptr::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostream::swap()'],['http://en.cppreference.com/w/cpp/container/set/swap.html',0,'std::set::swap()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/swap.html',0,'std::unique_lock::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostringstream::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::regex::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_map/swap.html',0,'std::unordered_map::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::basic_regex::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_filebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ios::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wsmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/tuple/swap.html',0,'std::tuple::swap()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/swap.html',0,'std::shared_ptr::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_fstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::stringbuf::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::wregex::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::smatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wfilebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::iostream::swap()'],['http://en.cppreference.com/w/cpp/container/stack/swap.html',0,'std::stack::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::stringstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/swap.html',0,'std::unordered_multimap::swap()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/swap.html',0,'std::unique_ptr::swap()'],['http://en.cppreference.com/w/cpp/container/forward_list/swap.html',0,'std::forward_list::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::strstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostream::swap()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/swap.html',0,'std::shared_lock::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wcmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/pair/swap.html',0,'std::pair::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wifstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_stringbuf::swap()'],['http://en.cppreference.com/w/cpp/container/deque/swap.html',0,'std::deque::swap()'],['http://en.cppreference.com/w/cpp/thread/promise/swap.html',0,'std::promise::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::strstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_streambuf::swap()'],['http://en.cppreference.com/w/cpp/container/queue/swap.html',0,'std::queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_stringstream::swap()'],['http://en.cppreference.com/w/cpp/thread/thread/swap.html',0,'std::thread::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::basic_string::swap()'],['http://en.cppreference.com/w/cpp/container/priority_queue/swap.html',0,'std::priority_queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostringstream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::wstring::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istrstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/swap.html',0,'std::unordered_multiset::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostream::swap()'],['http://en.cppreference.com/w/cpp/utility/functional/function/swap.html',0,'std::function::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::filebuf::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u16string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wiostream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u32string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/list/swap.html',0,'std::list::swap()'],['http://en.cppreference.com/w/cpp/container/map/swap.html',0,'std::map::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::cmatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::streambuf::swap()'],['http://en.cppreference.com/w/cpp/experimental/optional/swap.html',0,'std::experimental::optional::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostrstream::swap()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/swap.html',0,'std::packaged_task::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_set/swap.html',0,'std::unordered_set::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wfstream::swap()'],['http://en.cppreference.com/w/cpp/container/multimap/swap.html',0,'std::multimap::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_iostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wstringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/array/swap.html',0,'std::array::swap()'],['http://en.cppreference.com/w/cpp/algorithm/swap.html',0,'std::swap(T... args)']]], + ['swap_5franges_331',['swap_ranges',['http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html',0,'std']]], + ['swprintf_332',['swprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], + ['swscanf_333',['swscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]], + ['sync_334',['sync',['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::strstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istrstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wiostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_ifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wfstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wstringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::ifstream::sync()']]], + ['sync_5fwith_5fstdio_335',['sync_with_stdio',['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ios::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ios_base::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::strstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wiostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wfstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wstringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ifstream::sync_with_stdio()']]], + ['system_336',['system',['http://en.cppreference.com/w/cpp/utility/program/system.html',0,'std']]], + ['system_5fcategory_337',['system_category',['http://en.cppreference.com/w/cpp/error/system_category.html',0,'std']]], + ['system_5fclock_338',['system_clock',['http://en.cppreference.com/w/cpp/chrono/system_clock.html',0,'std::chrono']]], + ['system_5ferror_339',['system_error',['http://en.cppreference.com/w/cpp/error/system_error.html',0,'std::system_error'],['http://en.cppreference.com/w/cpp/error/system_error/system_error.html',0,'std::system_error::system_error()']]] ]; diff --git a/search/all_19.js b/search/all_19.js index f75fc167f..7c6d4a7d1 100644 --- a/search/all_19.js +++ b/search/all_19.js @@ -23,7 +23,7 @@ var searchData= ['ternary_5fsearch_20',['ternary_search',['../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8',1,'ternary_search.cpp']]], ['ternary_5fsearch_2ecpp_21',['ternary_search.cpp',['../dc/dfe/ternary__search_8cpp.html',1,'']]], ['test_22',['Test',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29',1,'']]], - ['test_23',['test',['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): generate_parentheses.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_bits_flip.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): elliptic_curve_key_exchange.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fcfs_scheduling.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): list_array.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segment_tree.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): treap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): abbreviation.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): house_robber.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): word_break.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jarvis_algorithm.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): connected_components_with_dsu.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): is_graph_bipartite.cpp'],['../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): topological_sort.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kruskals_minimum_spanning_tree.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): md5.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sha1.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): k_nearest_neighbors.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): neural_network.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): aliquot_sum.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): area.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eulers_totient_function.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_sum.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gcd_of_n_numbers.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): iterative_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lcm_sum.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_choose_r.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): perimeter.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_two.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): quadratic_equations_complex_numbers.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): babylonian_method.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): composite_simpson_rule.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inverse_fast_fourier_transform.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): midpoint_integral_method.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rungekutta.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): union_of_two_arrays.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kadanes3.cpp'],['../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lfu_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lru_cache2.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): smallest_circle.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): ground_to_ground_projectile_motion.cpp'],['../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): geometric_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector< int > &vals, int windowSize): windowed_median.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segtree.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): floyd_cycle_detection_algo.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sublist_search.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): bubble_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): heap_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): merge_insertion_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): pancake_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): selection_sort_recursive.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wave_sort.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test(): wiggle_sort.cpp'],['../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): duval.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): manacher_algorithm.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): z_function.cpp']]], + ['test_23',['test',['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): generate_parentheses.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subarray_sum.cpp'],['../d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_bits_flip.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): elliptic_curve_key_exchange.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fcfs_scheduling.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): list_array.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segment_tree.cpp'],['../d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): treap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): abbreviation.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): house_robber.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): shortest_common_supersequence.cpp'],['../dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum_dynamic.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): word_break.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jarvis_algorithm.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): connected_components_with_dsu.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): is_graph_bipartite.cpp'],['../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): topological_sort.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kruskals_minimum_spanning_tree.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): md5.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sha1.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): k_nearest_neighbors.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): neural_network.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): aliquot_sum.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): area.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eulers_totient_function.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_sum.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gcd_of_n_numbers.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): iterative_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lcm_sum.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_choose_r.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): perimeter.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_two.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): quadratic_equations_complex_numbers.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): babylonian_method.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): composite_simpson_rule.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inverse_fast_fourier_transform.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): midpoint_integral_method.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rungekutta.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): union_of_two_arrays.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kadanes3.cpp'],['../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lfu_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lru_cache2.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): smallest_circle.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): ground_to_ground_projectile_motion.cpp'],['../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): geometric_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector< int > &vals, int windowSize): windowed_median.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segtree.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): floyd_cycle_detection_algo.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sublist_search.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): bubble_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): heap_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): merge_insertion_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): pancake_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): selection_sort_recursive.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wave_sort.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test(): wiggle_sort.cpp'],['../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): duval.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): manacher_algorithm.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): z_function.cpp']]], ['test_20examples_24',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]], ['test1_25',['test1',['../d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b',1,'test1(const std::string &text): hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499',1,'test1(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8',1,'test1(): large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5',1,'tests::test1()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0',1,'test1(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root): iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): recursive_tree_traversal.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): stooge_sort.cpp']]], ['test2_26',['test2',['../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712',1,'test2(const std::string &text): hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2(): dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342',1,'test2(int64_t n): tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2(): hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82',1,'test2(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa',1,'test2(): large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669',1,'tests::test2()'],['../d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21',1,'test2(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root): iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): stooge_sort.cpp']]], @@ -70,7 +70,7 @@ var searchData= ['testcase_5f2_67',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]], ['testcase_5f3_68',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]], ['testcases_69',['TestCases',['../d5/d58/class_test_cases.html',1,'']]], - ['tests_70',['tests',['../d9/df4/namespacetests.html',1,'tests'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): unbounded_0_1_knapsack.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): digit_separation.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_substring_without_repeating_characters.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): insertion_sort_recursive.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): knuth_morris_pratt.cpp']]], + ['tests_70',['tests',['../d9/df4/namespacetests.html',1,'tests'],['../d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number_templated.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): unbounded_0_1_knapsack.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): digit_separation.cpp'],['../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra_greedy.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_substring_without_repeating_characters.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): insertion_sort_recursive.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): knuth_morris_pratt.cpp']]], ['text_5fsearch_2ecpp_71',['text_search.cpp',['../dc/db5/text__search_8cpp.html',1,'']]], ['tgamma_72',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]], ['th_73',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]], diff --git a/search/all_1b.js b/search/all_1b.js index ab8938795..5fcdfe5de 100644 --- a/search/all_1b.js +++ b/search/all_1b.js @@ -16,52 +16,53 @@ var searchData= ['vector_13',['vector',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std::vector< T >'],['http://en.cppreference.com/w/cpp/container/vector/vector.html',0,'std::vector::vector()']]], ['vector_3c_20bool_20_3e_14',['vector< bool >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20double_20_3e_15',['vector< double >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20geometry_3a_3ajarvis_3a_3apoint_20_3e_16',['vector< geometry::jarvis::Point >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20int_20_3e_17',['vector< int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20int64_5ft_20_3e_18',['vector< int64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20machine_5flearning_3a_3aneural_5fnetwork_3a_3alayers_3a_3adenselayer_20_3e_19',['vector< machine_learning::neural_network::layers::DenseLayer >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20operations_5fon_5fdatastructures_3a_3atrie_5foperations_3a_3atnode_20_2a_20_3e_20',['vector< operations_on_datastructures::trie_operations::Tnode * >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20size_5ft_20_3e_21',['vector< size_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3afunction_3c_20std_3a_3asize_5ft_28t_29_3e_20_3e_22',['vector< std::function< std::size_t(T)> >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3alist_3c_20int_20_3e_20_3e_23',['vector< std::list< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3apair_3c_20int8_5ft_2c_20int8_5ft_20_3e_20_3e_24',['vector< std::pair< int8_t, int8_t > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3ashared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_20_3e_25',['vector< std::shared_ptr< data_structures::Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3ashared_5fptr_3c_20node_20_3e_20_3e_26',['vector< std::shared_ptr< Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3ashared_5fptr_3c_20range_5fqueries_3a_3apersegtree_3a_3anode_20_3e_20_3e_27',['vector< std::shared_ptr< range_queries::perSegTree::Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3asize_5ft_20_3e_28',['vector< std::size_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3astring_20_3e_29',['vector< std::string >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3atuple_3c_20int_2c_20int_2c_20int_20_3e_20_3e_30',['vector< std::tuple< int, int, int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_20_3e_31',['vector< std::tuple< S, T, E, double, double, double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3auint64_5ft_20_3e_32',['vector< std::uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avalarray_3c_20double_20_3e_20_3e_33',['vector< std::valarray< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avector_3c_20double_20_3e_20_3e_34',['vector< std::vector< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avector_3c_20int_20_3e_20_3e_35',['vector< std::vector< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_36',['vector< std::vector< T > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20uint64_5ft_20_3e_37',['vector< uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20unsigned_20char_20_3e_38',['vector< unsigned char >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20unsigned_20int_20_3e_39',['vector< unsigned int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20x_20_3e_40',['vector< X >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_5fcross_41',['vector_cross',['../d4/d91/namespacevector__cross.html',1,'']]], - ['vector_5fcross_5fproduct_2ecpp_42',['vector_cross_product.cpp',['../df/d66/vector__cross__product_8cpp.html',1,'']]], - ['vector_5fdot_43',['vector_dot',['../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec',1,'qr_algorithm']]], - ['vector_5fimportant_5ffunctions_2ecpp_44',['vector_important_functions.cpp',['../d3/d61/vector__important__functions_8cpp.html',1,'']]], - ['vector_5fmag_45',['vector_mag',['../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f',1,'qr_algorithm']]], - ['vector_5fops_2ehpp_46',['vector_ops.hpp',['../d8/d95/vector__ops_8hpp.html',1,'']]], - ['vector_5fproj_47',['vector_proj',['../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc',1,'qr_algorithm']]], - ['vfprintf_48',['vfprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], - ['vfscanf_49',['vfscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], - ['vfwprintf_50',['vfwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], - ['vfwscanf_51',['vfwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]], - ['vigenere_52',['vigenere',['../d6/da2/namespacevigenere.html',1,'']]], - ['vigenere_5fcipher_2ecpp_53',['vigenere_cipher.cpp',['../dd/d12/vigenere__cipher_8cpp.html',1,'']]], - ['volume_2ecpp_54',['volume.cpp',['../da/d39/volume_8cpp.html',1,'']]], - ['vprintf_55',['vprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], - ['vscanf_56',['vscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], - ['vsnprintf_57',['vsnprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], - ['vsprintf_58',['vsprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], - ['vsscanf_59',['vsscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], - ['vswprintf_60',['vswprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], - ['vswscanf_61',['vswscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]], - ['vwprintf_62',['vwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], - ['vwscanf_63',['vwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]] + ['vector_3c_20edge_20_3e_16',['vector< Edge >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20geometry_3a_3ajarvis_3a_3apoint_20_3e_17',['vector< geometry::jarvis::Point >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20int_20_3e_18',['vector< int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20int64_5ft_20_3e_19',['vector< int64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20machine_5flearning_3a_3aneural_5fnetwork_3a_3alayers_3a_3adenselayer_20_3e_20',['vector< machine_learning::neural_network::layers::DenseLayer >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20operations_5fon_5fdatastructures_3a_3atrie_5foperations_3a_3atnode_20_2a_20_3e_21',['vector< operations_on_datastructures::trie_operations::Tnode * >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20size_5ft_20_3e_22',['vector< size_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3afunction_3c_20std_3a_3asize_5ft_28t_29_3e_20_3e_23',['vector< std::function< std::size_t(T)> >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3alist_3c_20int_20_3e_20_3e_24',['vector< std::list< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3apair_3c_20int8_5ft_2c_20int8_5ft_20_3e_20_3e_25',['vector< std::pair< int8_t, int8_t > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3ashared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_20_3e_26',['vector< std::shared_ptr< data_structures::Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3ashared_5fptr_3c_20node_20_3e_20_3e_27',['vector< std::shared_ptr< Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3ashared_5fptr_3c_20range_5fqueries_3a_3apersegtree_3a_3anode_20_3e_20_3e_28',['vector< std::shared_ptr< range_queries::perSegTree::Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3asize_5ft_20_3e_29',['vector< std::size_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3astring_20_3e_30',['vector< std::string >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3atuple_3c_20int_2c_20int_2c_20int_20_3e_20_3e_31',['vector< std::tuple< int, int, int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_20_3e_32',['vector< std::tuple< S, T, E, double, double, double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3auint64_5ft_20_3e_33',['vector< std::uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avalarray_3c_20double_20_3e_20_3e_34',['vector< std::valarray< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avector_3c_20double_20_3e_20_3e_35',['vector< std::vector< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avector_3c_20int_20_3e_20_3e_36',['vector< std::vector< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_37',['vector< std::vector< T > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20uint64_5ft_20_3e_38',['vector< uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20unsigned_20char_20_3e_39',['vector< unsigned char >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20unsigned_20int_20_3e_40',['vector< unsigned int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20x_20_3e_41',['vector< X >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_5fcross_42',['vector_cross',['../d4/d91/namespacevector__cross.html',1,'']]], + ['vector_5fcross_5fproduct_2ecpp_43',['vector_cross_product.cpp',['../df/d66/vector__cross__product_8cpp.html',1,'']]], + ['vector_5fdot_44',['vector_dot',['../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec',1,'qr_algorithm']]], + ['vector_5fimportant_5ffunctions_2ecpp_45',['vector_important_functions.cpp',['../d3/d61/vector__important__functions_8cpp.html',1,'']]], + ['vector_5fmag_46',['vector_mag',['../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f',1,'qr_algorithm']]], + ['vector_5fops_2ehpp_47',['vector_ops.hpp',['../d8/d95/vector__ops_8hpp.html',1,'']]], + ['vector_5fproj_48',['vector_proj',['../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc',1,'qr_algorithm']]], + ['vfprintf_49',['vfprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vfscanf_50',['vfscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], + ['vfwprintf_51',['vfwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], + ['vfwscanf_52',['vfwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]], + ['vigenere_53',['vigenere',['../d6/da2/namespacevigenere.html',1,'']]], + ['vigenere_5fcipher_2ecpp_54',['vigenere_cipher.cpp',['../dd/d12/vigenere__cipher_8cpp.html',1,'']]], + ['volume_2ecpp_55',['volume.cpp',['../da/d39/volume_8cpp.html',1,'']]], + ['vprintf_56',['vprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vscanf_57',['vscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], + ['vsnprintf_58',['vsnprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vsprintf_59',['vsprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vsscanf_60',['vsscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], + ['vswprintf_61',['vswprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], + ['vswscanf_62',['vswscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]], + ['vwprintf_63',['vwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], + ['vwscanf_64',['vwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]] ]; diff --git a/search/all_6.js b/search/all_6.js index 0b9272e1d..6b7e2bc0d 100644 --- a/search/all_6.js +++ b/search/all_6.js @@ -56,7 +56,7 @@ var searchData= ['adjacent_5ffind_53',['adjacent_find',['http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html',0,'std']]], ['adopt_5flock_5ft_54',['adopt_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], ['advance_55',['advance',['http://en.cppreference.com/w/cpp/iterator/advance.html',0,'std']]], - ['algorithm_56',['Algorithm',['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md71',1,'Algorithm'],['../db/dca/kadane2_8cpp.html#autotoc_md72',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md73',1,'Algorithm'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#autotoc_md74',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md75',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md76',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md82',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md83',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md84',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md85',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md86',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md88',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md102',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md108',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md110',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md115',1,'Algorithm'],['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md116',1,'Algorithm'],['../d5/d4c/group__sorting.html',1,'Sorting Algorithm']]], + ['algorithm_56',['Algorithm',['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md71',1,'Algorithm'],['../d4/da0/kadane_8cpp.html#autotoc_md72',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md73',1,'Algorithm'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#autotoc_md74',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md75',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md76',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md82',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md83',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md84',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md85',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md86',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md88',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md102',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md108',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md110',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md115',1,'Algorithm'],['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md116',1,'Algorithm'],['../d5/d4c/group__sorting.html',1,'Sorting Algorithm']]], ['algorithm_20analysis_20best_20case_20worst_20case_20average_20case_57',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]], ['algorithm_20explanation_58',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]], ['algorithms_59',['Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'Cpu Scheduling Algorithms'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'Greedy Algorithms'],['../d9/d66/group__machine__learning.html',1,'Machine Learning Algorithms']]], @@ -95,7 +95,7 @@ var searchData= ['area_2ecpp_92',['area.cpp',['../dc/d82/area_8cpp.html',1,'']]], ['arg_93',['arg',['../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41',1,'Complex']]], ['argmax_94',['argmax',['../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec',1,'machine_learning']]], - ['armstrong_5fnumber_2ecpp_95',['armstrong_number.cpp',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html',1,'']]], + ['armstrong_5fnumber_5ftemplated_2ecpp_95',['armstrong_number_templated.cpp',['../d1/da7/armstrong__number__templated_8cpp.html',1,'']]], ['arr_96',['arr',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d',1,'data_structures::queue_using_array::Queue_Array::arr'],['../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b',1,'data_structures::trie::arr']]], ['array_97',['array',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], ['array_3c_20data_5fstructures_3a_3atree_5f234_3a_3anode_20_2a_2c_204_20_3e_98',['array< data_structures::tree_234::Node *, 4 >',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], diff --git a/search/all_7.js b/search/all_7.js index b58cd82ff..1490a73ef 100644 --- a/search/all_7.js +++ b/search/all_7.js @@ -148,6 +148,5 @@ var searchData= ['bucket_5fsize_145',['bucket_size',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_size.html',0,'std::unordered_map::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_size.html',0,'std::unordered_multimap::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_size.html',0,'std::unordered_multiset::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_size.html',0,'std::unordered_set::bucket_size()']]], ['build_146',['build',['../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9',1,'range_queries::prefix_sum_array']]], ['building_20locally_147',['Building Locally',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37',1,'']]], - ['buildtable_148',['buildTable',['../d4/d96/range__queries_2sparse__table_8cpp.html#a803a2451e87021d14ae06f148383e6bc',1,'range_queries::sparse_table']]], - ['buzz_5fnumber_2ecpp_149',['buzz_number.cpp',['../d1/d76/buzz__number_8cpp.html',1,'']]] + ['buzz_5fnumber_2ecpp_148',['buzz_number.cpp',['../d1/d76/buzz__number_8cpp.html',1,'']]] ]; diff --git a/search/all_8.js b/search/all_8.js index 3611f8c25..3cccbcdd9 100644 --- a/search/all_8.js +++ b/search/all_8.js @@ -112,90 +112,89 @@ var searchData= ['composite_5fsimpson_5frule_2ecpp_109',['composite_simpson_rule.cpp',['../d4/d18/composite__simpson__rule_8cpp.html',1,'']]], ['compute_5fpadded_5fsize_110',['compute_padded_size',['../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27',1,'hashing::sha256']]], ['computefactorialsmod_111',['computeFactorialsMod',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f',1,'math::ncr_modulo_p::NCRModuloP']]], - ['computelogs_112',['computeLogs',['../d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300',1,'range_queries::sparse_table']]], - ['concept_113',['Concept',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md81',1,'']]], - ['condition_5fvariable_114',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable.html',0,'std::condition_variable'],['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable::condition_variable()']]], - ['condition_5fvariable_5fany_115',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any.html',0,'std::condition_variable_any'],['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any::condition_variable_any()']]], - ['conditional_116',['conditional',['http://en.cppreference.com/w/cpp/types/conditional.html',0,'std']]], - ['conduct_117',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], - ['cone_5fvolume_118',['cone_volume',['../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7',1,'math']]], - ['connected_5fcomponents_2ecpp_119',['connected_components.cpp',['../df/ddd/connected__components_8cpp.html',1,'']]], - ['connected_5fcomponents_5fwith_5fdsu_2ecpp_120',['connected_components_with_dsu.cpp',['../d8/d99/connected__components__with__dsu_8cpp.html',1,'']]], - ['conquer_121',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], - ['const_5fpointer_5fcast_122',['const_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], - ['constree_123',['ConsTree',['../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696',1,'segtree.cpp']]], - ['construct_124',['construct',['http://en.cppreference.com/w/cpp/memory/allocator_traits/construct.html',0,'std::allocator_traits::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator/construct.html',0,'std::allocator::construct()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/construct.html',0,'std::scoped_allocator_adaptor::construct()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4',1,'range_queries::perSegTree::construct(const uint32_t &i, const uint32_t &j)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3',1,'range_queries::perSegTree::construct(const std::vector< int64_t > &vec)']]], - ['contains_125',['Contains',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f',1,'data_structures::tree_234::Node']]], - ['contains_126',['contains',['../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2',1,'binary_search_tree::contains(std::unique_ptr< bst_node > &node, T value)'],['../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63',1,'binary_search_tree::contains(T value)'],['../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac',1,'data_structures::Bitset::contains()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b',1,'data_structures::BloomFilter::contains()']]], - ['contributing_127',['Contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md23',1,'']]], - ['contributing_128',['Before contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'']]], - ['contribution_20guidelines_129',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]], - ['contributions_130',['Contributions',['../index.html#autotoc_md106',1,'']]], - ['contributor_131',['Contributor',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25',1,'']]], - ['contributor_20covenant_20code_20of_20conduct_132',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], - ['convention_133',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], - ['conventions_134',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]], - ['converted_135',['converted',['http://en.cppreference.com/w/cpp/locale/wstring_convert/converted.html',0,'std::wstring_convert']]], - ['convexhull_136',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html',1,'geometry::jarvis::Convexhull'],['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870',1,'geometry::jarvis::Convexhull::Convexhull()']]], - ['copy_137',['copy',['http://en.cppreference.com/w/cpp/string/char_traits/copy.html',0,'std::char_traits::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::basic_string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::wstring::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u16string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u32string::copy()'],['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std::copy()']]], - ['copy_5fall_5fnodes_138',['copy_all_nodes',['../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511',1,'data_structures::linked_list']]], - ['copy_5fbackward_139',['copy_backward',['http://en.cppreference.com/w/cpp/algorithm/copy_backward.html',0,'std']]], - ['copy_5fif_140',['copy_if',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std']]], - ['copy_5fn_141',['copy_n',['http://en.cppreference.com/w/cpp/algorithm/copy_n.html',0,'std']]], - ['copyfmt_142',['copyfmt',['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ios::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::strstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wiostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wfstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wstringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ifstream::copyfmt()']]], - ['copysign_143',['copysign',['http://en.cppreference.com/w/cpp/numeric/math/copysign.html',0,'std']]], - ['correction_144',['1. Correction',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11',1,'']]], - ['cos_145',['cos',['http://en.cppreference.com/w/cpp/numeric/math/cos.html',0,'std']]], - ['cosh_146',['cosh',['http://en.cppreference.com/w/cpp/numeric/math/cosh.html',0,'std']]], - ['count_147',['count',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921',1,'data_structures::tree_234::Node::count'],['http://en.cppreference.com/w/cpp/container/multiset/count.html',0,'std::multiset::count()'],['http://en.cppreference.com/w/cpp/container/set/count.html',0,'std::set::count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/count.html',0,'std::unordered_map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/count.html',0,'std::unordered_multimap::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::minutes::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::seconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::duration::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::milliseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::hours::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::microseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::nanoseconds::count()'],['http://en.cppreference.com/w/cpp/utility/bitset/count.html',0,'std::bitset::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/count.html',0,'std::unordered_multiset::count()'],['http://en.cppreference.com/w/cpp/container/map/count.html',0,'std::map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/count.html',0,'std::unordered_set::count()'],['http://en.cppreference.com/w/cpp/container/multimap/count.html',0,'std::multimap::count()'],['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std::count()']]], - ['count_5fbits_5fflip_148',['count_bits_flip',['../d4/d38/namespacecount__bits__flip.html',1,'']]], - ['count_5fbits_5fflip_2ecpp_149',['count_bits_flip.cpp',['../d7/d56/count__bits__flip_8cpp.html',1,'']]], - ['count_5fif_150',['count_if',['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std']]], - ['count_5finversions_2ecpp_151',['count_inversions.cpp',['../d2/d26/count__inversions_8cpp.html',1,'']]], - ['count_5fof_5fset_5fbits_152',['count_of_set_bits',['../dd/dae/namespacecount__of__set__bits.html',1,'']]], - ['count_5fof_5fset_5fbits_2ecpp_153',['count_of_set_bits.cpp',['../da/db8/count__of__set__bits_8cpp.html',1,'']]], - ['count_5fof_5ftrailing_5fciphers_5fin_5ffactorial_5fn_154',['count_of_trailing_ciphers_in_factorial_n',['../dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html',1,'']]], - ['count_5fof_5ftrailing_5fciphers_5fin_5ffactorial_5fn_2ecpp_155',['count_of_trailing_ciphers_in_factorial_n.cpp',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html',1,'']]], - ['countbitsflip_156',['countBitsFlip',['../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b',1,'bit_manipulation::count_bits_flip']]], - ['countinversion_157',['countInversion',['../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80',1,'sorting::inversion']]], - ['countsetbits_158',['countSetBits',['../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62',1,'bit_manipulation::count_of_set_bits']]], - ['cout_159',['cout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], - ['covenant_20code_20of_20conduct_160',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], - ['cpu_20scheduling_20algorithms_161',['Cpu Scheduling Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'']]], - ['crbegin_162',['crbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::crbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::crbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::crbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::crbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::crbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::crbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::crbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::crbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::crbegin()']]], - ['create_5fhash_163',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]], - ['create_5flist_164',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]], - ['create_5fmatrix_165',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]], - ['create_5fmessage_5fschedule_5farray_166',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]], - ['create_5frandom_5farray_167',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N): insertion_sort_recursive.cpp']]], - ['createnewnode_168',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114',1,'others::recursive_tree_traversals::BT::createNewNode()']]], - ['createnode_169',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]], - ['createset_170',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]], - ['cref_171',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], - ['cregex_5fiterator_172',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::cregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::cregex_iterator::cregex_iterator()']]], - ['cregex_5ftoken_5fiterator_173',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::cregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::cregex_token_iterator::cregex_token_iterator()']]], - ['crend_174',['crend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::crend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::crend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::crend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::crend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::crend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::crend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::crend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::crend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::crend()']]], - ['cross_175',['cross',['../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9',1,'math::vector_cross']]], - ['csub_5fmatch_176',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::csub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::csub_match::csub_match()']]], - ['ctime_177',['ctime',['http://en.cppreference.com/w/cpp/chrono/c/ctime.html',0,'std']]], - ['ctype_178',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype.html',0,'std::ctype'],['http://en.cppreference.com/w/cpp/locale/ctype/ctype.html',0,'std::ctype::ctype()']]], - ['ctype_5fbase_179',['ctype_base',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std']]], - ['ctype_5fbyname_180',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname'],['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname::ctype_byname()']]], - ['cube_5fsurface_5farea_181',['cube_surface_area',['../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c',1,'math']]], - ['cube_5fsurface_5fperimeter_182',['cube_surface_perimeter',['../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b',1,'math']]], - ['cube_5fvolume_183',['cube_volume',['../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725',1,'math']]], - ['cumulative_5fdistribution_184',['cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a',1,'probability::geometric_dist::geometric_distribution']]], - ['curr_5fsymbol_185',['curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::curr_symbol()']]], - ['current_5fexception_186',['current_exception',['http://en.cppreference.com/w/cpp/error/current_exception.html',0,'std']]], - ['current_5fsize_187',['current_size',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b',1,'data_structures::stack_using_queue::Stack']]], - ['cut_5frod_188',['cut_rod',['../d8/d36/namespacecut__rod.html',1,'']]], - ['cut_5frod_2ecpp_189',['cut_rod.cpp',['../d6/d10/cut__rod_8cpp.html',1,'']]], - ['cycle_5fdetection_190',['cycle_detection',['../da/d82/namespacecycle__detection.html',1,'']]], - ['cycle_5fsort_191',['cycle_sort',['../d4/dfb/namespacecycle__sort.html',1,'']]], - ['cycle_5fsort_2ecpp_192',['cycle_sort.cpp',['../de/d07/cycle__sort_8cpp.html',1,'']]], - ['cyclecheck_193',['CycleCheck',['../d3/dbb/class_cycle_check.html',1,'']]], - ['cyclesort_194',['cycleSort',['../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa',1,'sorting::cycle_sort']]], - ['cylinder_5fsurface_5farea_195',['cylinder_surface_area',['../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864',1,'math']]], - ['cylinder_5fsurface_5fperimeter_196',['cylinder_surface_perimeter',['../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73',1,'math']]], - ['cylinder_5fvolume_197',['cylinder_volume',['../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca',1,'math']]] + ['concept_112',['Concept',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md81',1,'']]], + ['condition_5fvariable_113',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable.html',0,'std::condition_variable'],['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable::condition_variable()']]], + ['condition_5fvariable_5fany_114',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any.html',0,'std::condition_variable_any'],['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any::condition_variable_any()']]], + ['conditional_115',['conditional',['http://en.cppreference.com/w/cpp/types/conditional.html',0,'std']]], + ['conduct_116',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], + ['cone_5fvolume_117',['cone_volume',['../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7',1,'math']]], + ['connected_5fcomponents_2ecpp_118',['connected_components.cpp',['../df/ddd/connected__components_8cpp.html',1,'']]], + ['connected_5fcomponents_5fwith_5fdsu_2ecpp_119',['connected_components_with_dsu.cpp',['../d8/d99/connected__components__with__dsu_8cpp.html',1,'']]], + ['conquer_120',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], + ['const_5fpointer_5fcast_121',['const_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['constree_122',['ConsTree',['../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696',1,'segtree.cpp']]], + ['construct_123',['construct',['http://en.cppreference.com/w/cpp/memory/allocator_traits/construct.html',0,'std::allocator_traits::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator/construct.html',0,'std::allocator::construct()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/construct.html',0,'std::scoped_allocator_adaptor::construct()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4',1,'range_queries::perSegTree::construct(const uint32_t &i, const uint32_t &j)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3',1,'range_queries::perSegTree::construct(const std::vector< int64_t > &vec)']]], + ['contains_124',['Contains',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f',1,'data_structures::tree_234::Node']]], + ['contains_125',['contains',['../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2',1,'binary_search_tree::contains(std::unique_ptr< bst_node > &node, T value)'],['../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63',1,'binary_search_tree::contains(T value)'],['../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac',1,'data_structures::Bitset::contains()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b',1,'data_structures::BloomFilter::contains()']]], + ['contributing_126',['Contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md23',1,'']]], + ['contributing_127',['Before contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'']]], + ['contribution_20guidelines_128',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]], + ['contributions_129',['Contributions',['../index.html#autotoc_md106',1,'']]], + ['contributor_130',['Contributor',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25',1,'']]], + ['contributor_20covenant_20code_20of_20conduct_131',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], + ['convention_132',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]], + ['conventions_133',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]], + ['converted_134',['converted',['http://en.cppreference.com/w/cpp/locale/wstring_convert/converted.html',0,'std::wstring_convert']]], + ['convexhull_135',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html',1,'geometry::jarvis::Convexhull'],['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870',1,'geometry::jarvis::Convexhull::Convexhull()']]], + ['copy_136',['copy',['http://en.cppreference.com/w/cpp/string/char_traits/copy.html',0,'std::char_traits::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::basic_string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::wstring::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u16string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u32string::copy()'],['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std::copy()']]], + ['copy_5fall_5fnodes_137',['copy_all_nodes',['../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511',1,'data_structures::linked_list']]], + ['copy_5fbackward_138',['copy_backward',['http://en.cppreference.com/w/cpp/algorithm/copy_backward.html',0,'std']]], + ['copy_5fif_139',['copy_if',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std']]], + ['copy_5fn_140',['copy_n',['http://en.cppreference.com/w/cpp/algorithm/copy_n.html',0,'std']]], + ['copyfmt_141',['copyfmt',['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ios::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::strstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wiostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wfstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wstringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ifstream::copyfmt()']]], + ['copysign_142',['copysign',['http://en.cppreference.com/w/cpp/numeric/math/copysign.html',0,'std']]], + ['correction_143',['1. Correction',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11',1,'']]], + ['cos_144',['cos',['http://en.cppreference.com/w/cpp/numeric/math/cos.html',0,'std']]], + ['cosh_145',['cosh',['http://en.cppreference.com/w/cpp/numeric/math/cosh.html',0,'std']]], + ['count_146',['count',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921',1,'data_structures::tree_234::Node::count'],['http://en.cppreference.com/w/cpp/container/multiset/count.html',0,'std::multiset::count()'],['http://en.cppreference.com/w/cpp/container/set/count.html',0,'std::set::count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/count.html',0,'std::unordered_map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/count.html',0,'std::unordered_multimap::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::minutes::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::seconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::duration::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::milliseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::hours::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::microseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::nanoseconds::count()'],['http://en.cppreference.com/w/cpp/utility/bitset/count.html',0,'std::bitset::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/count.html',0,'std::unordered_multiset::count()'],['http://en.cppreference.com/w/cpp/container/map/count.html',0,'std::map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/count.html',0,'std::unordered_set::count()'],['http://en.cppreference.com/w/cpp/container/multimap/count.html',0,'std::multimap::count()'],['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std::count()']]], + ['count_5fbits_5fflip_147',['count_bits_flip',['../d4/d38/namespacecount__bits__flip.html',1,'']]], + ['count_5fbits_5fflip_2ecpp_148',['count_bits_flip.cpp',['../d7/d56/count__bits__flip_8cpp.html',1,'']]], + ['count_5fif_149',['count_if',['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std']]], + ['count_5finversions_2ecpp_150',['count_inversions.cpp',['../d2/d26/count__inversions_8cpp.html',1,'']]], + ['count_5fof_5fset_5fbits_151',['count_of_set_bits',['../dd/dae/namespacecount__of__set__bits.html',1,'']]], + ['count_5fof_5fset_5fbits_2ecpp_152',['count_of_set_bits.cpp',['../da/db8/count__of__set__bits_8cpp.html',1,'']]], + ['count_5fof_5ftrailing_5fciphers_5fin_5ffactorial_5fn_153',['count_of_trailing_ciphers_in_factorial_n',['../dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html',1,'']]], + ['count_5fof_5ftrailing_5fciphers_5fin_5ffactorial_5fn_2ecpp_154',['count_of_trailing_ciphers_in_factorial_n.cpp',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html',1,'']]], + ['countbitsflip_155',['countBitsFlip',['../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b',1,'bit_manipulation::count_bits_flip']]], + ['countinversion_156',['countInversion',['../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80',1,'sorting::inversion']]], + ['countsetbits_157',['countSetBits',['../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62',1,'bit_manipulation::count_of_set_bits']]], + ['cout_158',['cout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['covenant_20code_20of_20conduct_159',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]], + ['cpu_20scheduling_20algorithms_160',['Cpu Scheduling Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'']]], + ['crbegin_161',['crbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::crbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::crbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::crbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::crbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::crbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::crbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::crbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::crbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::crbegin()']]], + ['create_5fhash_162',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]], + ['create_5flist_163',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]], + ['create_5fmatrix_164',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]], + ['create_5fmessage_5fschedule_5farray_165',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]], + ['create_5frandom_5farray_166',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N): insertion_sort_recursive.cpp']]], + ['createnewnode_167',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114',1,'others::recursive_tree_traversals::BT::createNewNode()']]], + ['createnode_168',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]], + ['createset_169',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]], + ['cref_170',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], + ['cregex_5fiterator_171',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::cregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::cregex_iterator::cregex_iterator()']]], + ['cregex_5ftoken_5fiterator_172',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::cregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::cregex_token_iterator::cregex_token_iterator()']]], + ['crend_173',['crend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::crend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::crend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::crend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::crend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::crend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::crend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::crend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::crend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::crend()']]], + ['cross_174',['cross',['../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9',1,'math::vector_cross']]], + ['csub_5fmatch_175',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::csub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::csub_match::csub_match()']]], + ['ctime_176',['ctime',['http://en.cppreference.com/w/cpp/chrono/c/ctime.html',0,'std']]], + ['ctype_177',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype.html',0,'std::ctype'],['http://en.cppreference.com/w/cpp/locale/ctype/ctype.html',0,'std::ctype::ctype()']]], + ['ctype_5fbase_178',['ctype_base',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std']]], + ['ctype_5fbyname_179',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname'],['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname::ctype_byname()']]], + ['cube_5fsurface_5farea_180',['cube_surface_area',['../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c',1,'math']]], + ['cube_5fsurface_5fperimeter_181',['cube_surface_perimeter',['../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b',1,'math']]], + ['cube_5fvolume_182',['cube_volume',['../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725',1,'math']]], + ['cumulative_5fdistribution_183',['cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a',1,'probability::geometric_dist::geometric_distribution']]], + ['curr_5fsymbol_184',['curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::curr_symbol()']]], + ['current_5fexception_185',['current_exception',['http://en.cppreference.com/w/cpp/error/current_exception.html',0,'std']]], + ['current_5fsize_186',['current_size',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b',1,'data_structures::stack_using_queue::Stack']]], + ['cut_5frod_187',['cut_rod',['../d8/d36/namespacecut__rod.html',1,'']]], + ['cut_5frod_2ecpp_188',['cut_rod.cpp',['../d6/d10/cut__rod_8cpp.html',1,'']]], + ['cycle_5fdetection_189',['cycle_detection',['../da/d82/namespacecycle__detection.html',1,'']]], + ['cycle_5fsort_190',['cycle_sort',['../d4/dfb/namespacecycle__sort.html',1,'']]], + ['cycle_5fsort_2ecpp_191',['cycle_sort.cpp',['../de/d07/cycle__sort_8cpp.html',1,'']]], + ['cyclecheck_192',['CycleCheck',['../d3/dbb/class_cycle_check.html',1,'']]], + ['cyclesort_193',['cycleSort',['../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa',1,'sorting::cycle_sort']]], + ['cylinder_5fsurface_5farea_194',['cylinder_surface_area',['../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864',1,'math']]], + ['cylinder_5fsurface_5fperimeter_195',['cylinder_surface_perimeter',['../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73',1,'math']]], + ['cylinder_5fvolume_196',['cylinder_volume',['../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca',1,'math']]] ]; diff --git a/search/all_9.js b/search/all_9.js index ce81c1302..a4e5574ae 100644 --- a/search/all_9.js +++ b/search/all_9.js @@ -68,95 +68,96 @@ var searchData= ['digitseparationforwardorder_65',['digitSeparationForwardOrder',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8',1,'greedy_algorithms::DigitSeparation']]], ['digitseparationreverseorder_66',['digitSeparationReverseOrder',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79',1,'greedy_algorithms::DigitSeparation']]], ['dijkstra_67',['dijkstra',['../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84',1,'graph::dijkstra()'],['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd',1,'greedy_algorithms::dijkstra::dijkstra()']]], - ['dijkstra_2ecpp_68',['dijkstra.cpp',['../d7/d1e/graph_2dijkstra_8cpp.html',1,'(Global Namespace)'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html',1,'(Global Namespace)']]], - ['direction_69',['direction',['../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655',1,'SegmentIntersection']]], - ['directory_70',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], - ['directory_20guidelines_71',['Directory guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'']]], - ['discard_72',['discard',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937_64::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux24_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux48::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::discard_block_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mersenne_twister_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/discard.html',0,'std::independent_bits_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux48_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::shuffle_order_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux24::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::linear_congruential_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::knuth_b::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand0::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::subtract_with_carry_engine::discard()']]], - ['discard_5fblock_5fengine_73',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::discard_block_engine'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::discard_block_engine::discard_block_engine()']]], - ['discrete_5fdistribution_74',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution.html',0,'std::discrete_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/discrete_distribution.html',0,'std::discrete_distribution::discrete_distribution()']]], - ['disjoint_5fset_2ecpp_75',['disjoint_set.cpp',['../de/d23/disjoint__set_8cpp.html',1,'']]], - ['disjoint_5funion_76',['disjoint_union',['../de/db4/namespacedisjoint__union.html',1,'']]], - ['display_77',['display',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615',1,'data_structures::linked_list::list::display()'],['../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368',1,'queue::display()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631',1,'data_structures::queue_using_array::Queue_Array::display()'],['../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033',1,'stack::display()'],['../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed',1,'hash_chain::display()'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53',1,'others::lru_cache::LRUCache::display()'],['../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd',1,'double_hashing::display()'],['../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635',1,'linear_probing::display()'],['../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357',1,'quadratic_probing::display()'],['../d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289',1,'numerical_methods::gram_schmidt::display()']]], - ['displayelements_78',['displayElements',['../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72',1,'wiggle_sort.cpp']]], - ['displaylist_79',['displayList',['../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c',1,'data_structures::SkipList']]], - ['dist_80',['dist',['../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a',1,'graph::HKGraph']]], - ['distance_81',['distance',['http://en.cppreference.com/w/cpp/iterator/distance.html',0,'std']]], - ['div_82',['div',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], - ['divide_83',['divide',['../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c',1,'uint128_t::divide()'],['../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1',1,'uint256_t::divide()']]], - ['divide_20and_20conquer_84',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], - ['divide_5fand_5fconquer_85',['divide_and_conquer',['../dd/dba/namespacedivide__and__conquer.html',1,'']]], - ['divides_86',['divides',['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std']]], - ['dnf_5fsort_87',['dnf_sort',['../d9/d75/namespacednf__sort.html',1,'']]], - ['dnf_5fsort_2ecpp_88',['dnf_sort.cpp',['../d6/d1a/dnf__sort_8cpp.html',1,'']]], - ['dnfsort_89',['dnfSort',['../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0',1,'sorting::dnf_sort']]], - ['do_5falways_5fnoconv_90',['do_always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::do_always_noconv()']]], - ['do_5fclose_91',['do_close',['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::do_close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::do_close()']]], - ['do_5fcompare_92',['do_compare',['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::do_compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::do_compare()']]], - ['do_5fcurr_5fsymbol_93',['do_curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::do_curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::do_curr_symbol()']]], - ['do_5fdate_5forder_94',['do_date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::do_date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::do_date_order()']]], - ['do_5fdecimal_5fpoint_95',['do_decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::do_decimal_point()']]], - ['do_5fencoding_96',['do_encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::do_encoding()']]], - ['do_5ffalsename_97',['do_falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_falsename()']]], - ['do_5ffrac_5fdigits_98',['do_frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::do_frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::do_frac_digits()']]], - ['do_5fget_99',['do_get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::do_get()']]], - ['do_5fget_5fdate_100',['do_get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::do_get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::do_get_date()']]], - ['do_5fget_5fmonthname_101',['do_get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::do_get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::do_get_monthname()']]], - ['do_5fget_5ftime_102',['do_get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::do_get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::do_get_time()']]], - ['do_5fget_5fweekday_103',['do_get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::do_get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::do_get_weekday()']]], - ['do_5fget_5fyear_104',['do_get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::do_get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::do_get_year()']]], - ['do_5fgrouping_105',['do_grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::do_grouping()']]], - ['do_5fhash_106',['do_hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::do_hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::do_hash()']]], - ['do_5fin_107',['do_in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::do_in()']]], - ['do_5fis_108',['do_is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::do_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::do_is()']]], - ['do_5flength_109',['do_length',['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::do_length()']]], - ['do_5fmax_5flength_110',['do_max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::do_max_length()']]], - ['do_5fnarrow_111',['do_narrow',['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::do_narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::do_narrow()']]], - ['do_5fneg_5fformat_112',['do_neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_neg_format()']]], - ['do_5fnegative_5fsign_113',['do_negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_negative_sign()']]], - ['do_5fopen_114',['do_open',['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::do_open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::do_open()']]], - ['do_5fout_115',['do_out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::do_out()']]], - ['do_5fpos_5fformat_116',['do_pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_pos_format()']]], - ['do_5fpositive_5fsign_117',['do_positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_positive_sign()']]], - ['do_5fput_118',['do_put',['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::do_put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::do_put()']]], - ['do_5fscan_5fis_119',['do_scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::do_scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::do_scan_is()']]], - ['do_5fthousands_5fsep_120',['do_thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::do_thousands_sep()']]], - ['do_5ftolower_121',['do_tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::do_tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::do_tolower()']]], - ['do_5ftoupper_122',['do_toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::do_toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::do_toupper()']]], - ['do_5ftransform_123',['do_transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::do_transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::do_transform()']]], - ['do_5ftruename_124',['do_truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_truename()']]], - ['do_5funshift_125',['do_unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::do_unshift()']]], - ['do_5fwiden_126',['do_widen',['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::do_widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::do_widen()']]], - ['documentation_127',['Documentation',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28',1,'Documentation'],['../index.html#autotoc_md105',1,'Documentation']]], - ['does_20not_20have_20a_20right_20node_20subtree_128',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], - ['domain_5ferror_129',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error'],['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error::domain_error()']]], - ['dot_5fproduct_130',['dot_product',['../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d',1,'numerical_methods::gram_schmidt']]], - ['double_5ffactorial_2ecpp_131',['double_factorial.cpp',['../d7/d89/double__factorial_8cpp.html',1,'']]], - ['double_5ffactorial_5fiterative_132',['double_factorial_iterative',['../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26',1,'double_factorial.cpp']]], - ['double_5ffactorial_5frecursive_133',['double_factorial_recursive',['../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d',1,'double_factorial.cpp']]], - ['double_5fhash_5fhash_5ftable_2ecpp_134',['double_hash_hash_table.cpp',['../d6/d80/double__hash__hash__table_8cpp.html',1,'']]], - ['double_5fhashing_135',['double_hashing',['../d0/d65/namespacedouble__hashing.html',1,'']]], - ['double_5flinked_5flist_136',['double_linked_list',['../d9/dee/classdouble__linked__list.html',1,'']]], - ['doublehash_137',['doubleHash',['../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200',1,'double_hashing']]], - ['dp_138',['dp',['../df/d88/namespacedp.html',1,'']]], - ['dptable_139',['dpTable',['../dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a',1,'backtracking::wildcard_matching']]], - ['draw_5fsample_140',['draw_sample',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3',1,'probability::geometric_dist::geometric_distribution']]], - ['drelu_141',['drelu',['../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9',1,'machine_learning::neural_network::activations']]], - ['dsigmoid_142',['dsigmoid',['../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46',1,'machine_learning::neural_network::activations']]], - ['dsu_143',['dsu',['../dd/d1f/classdsu.html',1,'dsu'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)']]], - ['dsu_5fpath_5fcompression_2ecpp_144',['dsu_path_compression.cpp',['../d3/dae/dsu__path__compression_8cpp.html',1,'']]], - ['dsu_5funion_5frank_2ecpp_145',['dsu_union_rank.cpp',['../df/d28/dsu__union__rank_8cpp.html',1,'']]], - ['dtanh_146',['dtanh',['../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c',1,'machine_learning::neural_network::activations']]], - ['duplicatenumber_147',['duplicateNumber',['../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88',1,'search::cycle_detection']]], - ['durand_5fkerner_5falgo_148',['durand_kerner_algo',['../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd',1,'durand_kerner_roots.cpp']]], - ['durand_5fkerner_5froots_2ecpp_149',['durand_kerner_roots.cpp',['../da/df2/durand__kerner__roots_8cpp.html',1,'']]], - ['duration_150',['duration',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::duration'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::duration::duration()']]], - ['duration_5fcast_151',['duration_cast',['http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html',0,'std::chrono']]], - ['duration_5fvalues_152',['duration_values',['http://en.cppreference.com/w/cpp/chrono/duration_values.html',0,'std::chrono']]], - ['duval_153',['duval',['../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632',1,'string']]], - ['duval_2ecpp_154',['duval.cpp',['../db/d09/duval_8cpp.html',1,'']]], - ['dynamic_20programming_155',['Dynamic Programming',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51',1,'']]], - ['dynamic_5fpointer_5fcast_156',['dynamic_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], - ['dynamic_5fprogramming_157',['dynamic_programming',['../dd/d24/namespacedynamic__programming.html',1,'']]], - ['dynarray_158',['dynarray',['http://en.cppreference.com/w/cpp/container/dynarray.html',0,'std::dynarray'],['http://en.cppreference.com/w/cpp/container/dynarray/dynarray.html',0,'std::dynarray::dynarray()']]] + ['dijkstra_2ecpp_68',['dijkstra.cpp',['../d8/d68/dijkstra_8cpp.html',1,'']]], + ['dijkstra_5fgreedy_2ecpp_69',['dijkstra_greedy.cpp',['../da/de8/dijkstra__greedy_8cpp.html',1,'']]], + ['direction_70',['direction',['../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655',1,'SegmentIntersection']]], + ['directory_71',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]], + ['directory_20guidelines_72',['Directory guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'']]], + ['discard_73',['discard',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937_64::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux24_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux48::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::discard_block_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mersenne_twister_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/discard.html',0,'std::independent_bits_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux48_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::shuffle_order_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux24::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::linear_congruential_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::knuth_b::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand0::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::subtract_with_carry_engine::discard()']]], + ['discard_5fblock_5fengine_74',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::discard_block_engine'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::discard_block_engine::discard_block_engine()']]], + ['discrete_5fdistribution_75',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution.html',0,'std::discrete_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/discrete_distribution.html',0,'std::discrete_distribution::discrete_distribution()']]], + ['disjoint_5fset_2ecpp_76',['disjoint_set.cpp',['../de/d23/disjoint__set_8cpp.html',1,'']]], + ['disjoint_5funion_77',['disjoint_union',['../de/db4/namespacedisjoint__union.html',1,'']]], + ['display_78',['display',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615',1,'data_structures::linked_list::list::display()'],['../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368',1,'queue::display()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631',1,'data_structures::queue_using_array::Queue_Array::display()'],['../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033',1,'stack::display()'],['../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed',1,'hash_chain::display()'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53',1,'others::lru_cache::LRUCache::display()'],['../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd',1,'double_hashing::display()'],['../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635',1,'linear_probing::display()'],['../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357',1,'quadratic_probing::display()'],['../d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289',1,'numerical_methods::gram_schmidt::display()']]], + ['displayelements_79',['displayElements',['../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72',1,'wiggle_sort.cpp']]], + ['displaylist_80',['displayList',['../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c',1,'data_structures::SkipList']]], + ['dist_81',['dist',['../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a',1,'graph::HKGraph']]], + ['distance_82',['distance',['http://en.cppreference.com/w/cpp/iterator/distance.html',0,'std']]], + ['div_83',['div',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], + ['divide_84',['divide',['../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c',1,'uint128_t::divide()'],['../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1',1,'uint256_t::divide()']]], + ['divide_20and_20conquer_85',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]], + ['divide_5fand_5fconquer_86',['divide_and_conquer',['../dd/dba/namespacedivide__and__conquer.html',1,'']]], + ['divides_87',['divides',['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std']]], + ['dnf_5fsort_88',['dnf_sort',['../d9/d75/namespacednf__sort.html',1,'']]], + ['dnf_5fsort_2ecpp_89',['dnf_sort.cpp',['../d6/d1a/dnf__sort_8cpp.html',1,'']]], + ['dnfsort_90',['dnfSort',['../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0',1,'sorting::dnf_sort']]], + ['do_5falways_5fnoconv_91',['do_always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::do_always_noconv()']]], + ['do_5fclose_92',['do_close',['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::do_close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::do_close()']]], + ['do_5fcompare_93',['do_compare',['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::do_compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::do_compare()']]], + ['do_5fcurr_5fsymbol_94',['do_curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::do_curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::do_curr_symbol()']]], + ['do_5fdate_5forder_95',['do_date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::do_date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::do_date_order()']]], + ['do_5fdecimal_5fpoint_96',['do_decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::do_decimal_point()']]], + ['do_5fencoding_97',['do_encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::do_encoding()']]], + ['do_5ffalsename_98',['do_falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_falsename()']]], + ['do_5ffrac_5fdigits_99',['do_frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::do_frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::do_frac_digits()']]], + ['do_5fget_100',['do_get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::do_get()']]], + ['do_5fget_5fdate_101',['do_get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::do_get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::do_get_date()']]], + ['do_5fget_5fmonthname_102',['do_get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::do_get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::do_get_monthname()']]], + ['do_5fget_5ftime_103',['do_get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::do_get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::do_get_time()']]], + ['do_5fget_5fweekday_104',['do_get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::do_get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::do_get_weekday()']]], + ['do_5fget_5fyear_105',['do_get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::do_get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::do_get_year()']]], + ['do_5fgrouping_106',['do_grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::do_grouping()']]], + ['do_5fhash_107',['do_hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::do_hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::do_hash()']]], + ['do_5fin_108',['do_in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::do_in()']]], + ['do_5fis_109',['do_is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::do_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::do_is()']]], + ['do_5flength_110',['do_length',['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::do_length()']]], + ['do_5fmax_5flength_111',['do_max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::do_max_length()']]], + ['do_5fnarrow_112',['do_narrow',['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::do_narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::do_narrow()']]], + ['do_5fneg_5fformat_113',['do_neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_neg_format()']]], + ['do_5fnegative_5fsign_114',['do_negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_negative_sign()']]], + ['do_5fopen_115',['do_open',['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::do_open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::do_open()']]], + ['do_5fout_116',['do_out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::do_out()']]], + ['do_5fpos_5fformat_117',['do_pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_pos_format()']]], + ['do_5fpositive_5fsign_118',['do_positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_positive_sign()']]], + ['do_5fput_119',['do_put',['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::do_put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::do_put()']]], + ['do_5fscan_5fis_120',['do_scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::do_scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::do_scan_is()']]], + ['do_5fthousands_5fsep_121',['do_thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::do_thousands_sep()']]], + ['do_5ftolower_122',['do_tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::do_tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::do_tolower()']]], + ['do_5ftoupper_123',['do_toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::do_toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::do_toupper()']]], + ['do_5ftransform_124',['do_transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::do_transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::do_transform()']]], + ['do_5ftruename_125',['do_truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_truename()']]], + ['do_5funshift_126',['do_unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::do_unshift()']]], + ['do_5fwiden_127',['do_widen',['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::do_widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::do_widen()']]], + ['documentation_128',['Documentation',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28',1,'Documentation'],['../index.html#autotoc_md105',1,'Documentation']]], + ['does_20not_20have_20a_20right_20node_20subtree_129',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['domain_5ferror_130',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error'],['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error::domain_error()']]], + ['dot_5fproduct_131',['dot_product',['../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d',1,'numerical_methods::gram_schmidt']]], + ['double_5ffactorial_2ecpp_132',['double_factorial.cpp',['../d7/d89/double__factorial_8cpp.html',1,'']]], + ['double_5ffactorial_5fiterative_133',['double_factorial_iterative',['../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26',1,'double_factorial.cpp']]], + ['double_5ffactorial_5frecursive_134',['double_factorial_recursive',['../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d',1,'double_factorial.cpp']]], + ['double_5fhash_5fhash_5ftable_2ecpp_135',['double_hash_hash_table.cpp',['../d6/d80/double__hash__hash__table_8cpp.html',1,'']]], + ['double_5fhashing_136',['double_hashing',['../d0/d65/namespacedouble__hashing.html',1,'']]], + ['double_5flinked_5flist_137',['double_linked_list',['../d9/dee/classdouble__linked__list.html',1,'']]], + ['doublehash_138',['doubleHash',['../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200',1,'double_hashing']]], + ['dp_139',['dp',['../df/d88/namespacedp.html',1,'']]], + ['dptable_140',['dpTable',['../dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a',1,'backtracking::wildcard_matching']]], + ['draw_5fsample_141',['draw_sample',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3',1,'probability::geometric_dist::geometric_distribution']]], + ['drelu_142',['drelu',['../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9',1,'machine_learning::neural_network::activations']]], + ['dsigmoid_143',['dsigmoid',['../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46',1,'machine_learning::neural_network::activations']]], + ['dsu_144',['dsu',['../dd/d1f/classdsu.html',1,'dsu'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)']]], + ['dsu_5fpath_5fcompression_2ecpp_145',['dsu_path_compression.cpp',['../d3/dae/dsu__path__compression_8cpp.html',1,'']]], + ['dsu_5funion_5frank_2ecpp_146',['dsu_union_rank.cpp',['../df/d28/dsu__union__rank_8cpp.html',1,'']]], + ['dtanh_147',['dtanh',['../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c',1,'machine_learning::neural_network::activations']]], + ['duplicatenumber_148',['duplicateNumber',['../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88',1,'search::cycle_detection']]], + ['durand_5fkerner_5falgo_149',['durand_kerner_algo',['../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd',1,'durand_kerner_roots.cpp']]], + ['durand_5fkerner_5froots_2ecpp_150',['durand_kerner_roots.cpp',['../da/df2/durand__kerner__roots_8cpp.html',1,'']]], + ['duration_151',['duration',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::duration'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::duration::duration()']]], + ['duration_5fcast_152',['duration_cast',['http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html',0,'std::chrono']]], + ['duration_5fvalues_153',['duration_values',['http://en.cppreference.com/w/cpp/chrono/duration_values.html',0,'std::chrono']]], + ['duval_154',['duval',['../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632',1,'string']]], + ['duval_2ecpp_155',['duval.cpp',['../db/d09/duval_8cpp.html',1,'']]], + ['dynamic_20programming_156',['Dynamic Programming',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51',1,'']]], + ['dynamic_5fpointer_5fcast_157',['dynamic_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['dynamic_5fprogramming_158',['dynamic_programming',['../dd/d24/namespacedynamic__programming.html',1,'']]], + ['dynarray_159',['dynarray',['http://en.cppreference.com/w/cpp/container/dynarray.html',0,'std::dynarray'],['http://en.cppreference.com/w/cpp/container/dynarray/dynarray.html',0,'std::dynarray::dynarray()']]] ]; diff --git a/search/all_c.js b/search/all_c.js index 0e8d795d4..0748749ef 100644 --- a/search/all_c.js +++ b/search/all_c.js @@ -106,54 +106,53 @@ var searchData= ['getmedian_103',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]], ['getmediannaive_104',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]], ['getmin_105',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]], - ['getminimum_106',['getMinimum',['../d4/d96/range__queries_2sparse__table_8cpp.html#a932816c3de9e5ad122b180de60978e8f',1,'range_queries::sparse_table']]], - ['getminitem_107',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]], - ['getnextpossiblechild_108',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]], - ['getnode_109',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]], - ['getnode_110',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]], - ['getnumnodes_111',['getNumNodes',['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096',1,'graph::topological_sort::Graph']]], - ['getpagefault_112',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]], - ['getparents_113',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]], - ['getrandomindex_114',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]], - ['getrightmostchild_115',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]], - ['gets_116',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]], - ['gettreemaxitem_117',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]], - ['gettreeminitem_118',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]], - ['getvertices_119',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]], - ['getwchar_120',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]], - ['giga_121',['giga',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], - ['github_20actions_122',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]], - ['given_20node_20does_20not_20have_20a_20right_20node_20subtree_123',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], - ['given_20node_20has_20the_20right_20node_20subtree_124',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], - ['global_125',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]], - ['gmtime_126',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]], - ['gnome_5fsort_2ecpp_127',['gnome_sort.cpp',['../d2/d21/gnome__sort_8cpp.html',1,'']]], - ['gnomesort_128',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array< T, size > arr)']]], - ['golden_5fsearch_5fextrema_2ecpp_129',['golden_search_extrema.cpp',['../d6/d7a/golden__search__extrema_8cpp.html',1,'']]], - ['good_130',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]], - ['good_5fsuffix_131',['good_suffix',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e',1,'strings::boyer_moore::pattern']]], - ['gptr_132',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]], - ['gram_5fschmidt_133',['gram_schmidt',['../d4/d0f/namespacegram__schmidt.html',1,'gram_schmidt'],['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt::gram_schmidt()']]], - ['gram_5fschmidt_2ecpp_134',['gram_schmidt.cpp',['../d5/d33/gram__schmidt_8cpp.html',1,'']]], - ['graph_135',['Graph',['../da/d9a/class_graph.html',1,'Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph< T >'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html',1,'graph::topological_sort::Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph'],['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &&adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector< Edge > const &edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6',1,'graph::topological_sort::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54',1,'Graph']]], - ['graph_136',['graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'Bipartite graph'],['../df/dce/namespacegraph.html',1,'graph']]], - ['graph_5fcoloring_137',['graph_coloring',['../d7/d08/namespacegraph__coloring.html',1,'']]], - ['graph_5fcoloring_2ecpp_138',['graph_coloring.cpp',['../d3/d40/graph__coloring_8cpp.html',1,'']]], - ['graphcoloring_139',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]], - ['graphics_140',['Graphics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55',1,'']]], - ['gray_5fcode_141',['gray_code',['../de/d9b/namespacegray__code.html',1,'']]], - ['greater_142',['greater',['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std']]], - ['greater_5fequal_143',['greater_equal',['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std']]], - ['greedy_20algorithms_144',['Greedy Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'']]], - ['greedy_5falgorithms_145',['greedy_algorithms',['../d2/d90/namespacegreedy__algorithms.html',1,'']]], - ['greedy_5falgorithms_3a_3adijkstra_146',['dijkstra',['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html',1,'greedy_algorithms']]], - ['greedy_5falgorithms_3a_3astable_5fmatching_147',['stable_matching',['../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html',1,'greedy_algorithms']]], - ['grey_148',['GREY',['../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e',1,'depth_first_search_with_stack.cpp']]], - ['ground_5fto_5fground_5fprojectile_5fmotion_149',['ground_to_ground_projectile_motion',['../d0/d20/namespaceground__to__ground__projectile__motion.html',1,'']]], - ['ground_5fto_5fground_5fprojectile_5fmotion_2ecpp_150',['ground_to_ground_projectile_motion.cpp',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html',1,'']]], - ['grouping_151',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]], - ['guidelines_152',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]], - ['guidelines_153',['Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'Commit Guidelines'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'Enforcement Guidelines']]], - ['guidelines_154',['guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'Directory guidelines'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'File Name guidelines']]], - ['guidelines_20for_20reviewers_20and_20maintainers_155',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]] + ['getminitem_106',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]], + ['getnextpossiblechild_107',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]], + ['getnode_108',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]], + ['getnode_109',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]], + ['getnumnodes_110',['getNumNodes',['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096',1,'graph::topological_sort::Graph']]], + ['getpagefault_111',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]], + ['getparents_112',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]], + ['getrandomindex_113',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]], + ['getrightmostchild_114',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]], + ['gets_115',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]], + ['gettreemaxitem_116',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]], + ['gettreeminitem_117',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]], + ['getvertices_118',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]], + ['getwchar_119',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]], + ['giga_120',['giga',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['github_20actions_121',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]], + ['given_20node_20does_20not_20have_20a_20right_20node_20subtree_122',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]], + ['given_20node_20has_20the_20right_20node_20subtree_123',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]], + ['global_124',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]], + ['gmtime_125',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]], + ['gnome_5fsort_2ecpp_126',['gnome_sort.cpp',['../d2/d21/gnome__sort_8cpp.html',1,'']]], + ['gnomesort_127',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array< T, size > arr)']]], + ['golden_5fsearch_5fextrema_2ecpp_128',['golden_search_extrema.cpp',['../d6/d7a/golden__search__extrema_8cpp.html',1,'']]], + ['good_129',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]], + ['good_5fsuffix_130',['good_suffix',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e',1,'strings::boyer_moore::pattern']]], + ['gptr_131',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]], + ['gram_5fschmidt_132',['gram_schmidt',['../d4/d0f/namespacegram__schmidt.html',1,'gram_schmidt'],['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt::gram_schmidt()']]], + ['gram_5fschmidt_2ecpp_133',['gram_schmidt.cpp',['../d5/d33/gram__schmidt_8cpp.html',1,'']]], + ['graph_134',['Graph',['../da/d9a/class_graph.html',1,'Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph< T >'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html',1,'graph::topological_sort::Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph'],['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &&adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector< Edge > const &edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6',1,'graph::topological_sort::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54',1,'Graph']]], + ['graph_135',['graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'Bipartite graph'],['../df/dce/namespacegraph.html',1,'graph']]], + ['graph_5fcoloring_136',['graph_coloring',['../d7/d08/namespacegraph__coloring.html',1,'']]], + ['graph_5fcoloring_2ecpp_137',['graph_coloring.cpp',['../d3/d40/graph__coloring_8cpp.html',1,'']]], + ['graphcoloring_138',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]], + ['graphics_139',['Graphics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55',1,'']]], + ['gray_5fcode_140',['gray_code',['../de/d9b/namespacegray__code.html',1,'']]], + ['greater_141',['greater',['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std']]], + ['greater_5fequal_142',['greater_equal',['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std']]], + ['greedy_20algorithms_143',['Greedy Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'']]], + ['greedy_5falgorithms_144',['greedy_algorithms',['../d2/d90/namespacegreedy__algorithms.html',1,'']]], + ['greedy_5falgorithms_3a_3adijkstra_145',['dijkstra',['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html',1,'greedy_algorithms']]], + ['greedy_5falgorithms_3a_3astable_5fmatching_146',['stable_matching',['../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html',1,'greedy_algorithms']]], + ['grey_147',['GREY',['../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e',1,'depth_first_search_with_stack.cpp']]], + ['ground_5fto_5fground_5fprojectile_5fmotion_148',['ground_to_ground_projectile_motion',['../d0/d20/namespaceground__to__ground__projectile__motion.html',1,'']]], + ['ground_5fto_5fground_5fprojectile_5fmotion_2ecpp_149',['ground_to_ground_projectile_motion.cpp',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html',1,'']]], + ['grouping_150',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]], + ['guidelines_151',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]], + ['guidelines_152',['Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'Commit Guidelines'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'Enforcement Guidelines']]], + ['guidelines_153',['guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'Directory guidelines'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'File Name guidelines']]], + ['guidelines_20for_20reviewers_20and_20maintainers_154',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]] ]; diff --git a/search/classes_15.js b/search/classes_15.js index 88a83cf5c..4f0d460c3 100644 --- a/search/classes_15.js +++ b/search/classes_15.js @@ -7,29 +7,30 @@ var searchData= ['vector_4',['vector',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20bool_20_3e_5',['vector< bool >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20double_20_3e_6',['vector< double >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20geometry_3a_3ajarvis_3a_3apoint_20_3e_7',['vector< geometry::jarvis::Point >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20int_20_3e_8',['vector< int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20int64_5ft_20_3e_9',['vector< int64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20machine_5flearning_3a_3aneural_5fnetwork_3a_3alayers_3a_3adenselayer_20_3e_10',['vector< machine_learning::neural_network::layers::DenseLayer >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20operations_5fon_5fdatastructures_3a_3atrie_5foperations_3a_3atnode_20_2a_20_3e_11',['vector< operations_on_datastructures::trie_operations::Tnode * >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20size_5ft_20_3e_12',['vector< size_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3afunction_3c_20std_3a_3asize_5ft_28t_29_3e_20_3e_13',['vector< std::function< std::size_t(T)> >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3alist_3c_20int_20_3e_20_3e_14',['vector< std::list< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3apair_3c_20int8_5ft_2c_20int8_5ft_20_3e_20_3e_15',['vector< std::pair< int8_t, int8_t > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3ashared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_20_3e_16',['vector< std::shared_ptr< data_structures::Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3ashared_5fptr_3c_20node_20_3e_20_3e_17',['vector< std::shared_ptr< Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3ashared_5fptr_3c_20range_5fqueries_3a_3apersegtree_3a_3anode_20_3e_20_3e_18',['vector< std::shared_ptr< range_queries::perSegTree::Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3asize_5ft_20_3e_19',['vector< std::size_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3astring_20_3e_20',['vector< std::string >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3atuple_3c_20int_2c_20int_2c_20int_20_3e_20_3e_21',['vector< std::tuple< int, int, int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_20_3e_22',['vector< std::tuple< S, T, E, double, double, double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3auint64_5ft_20_3e_23',['vector< std::uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avalarray_3c_20double_20_3e_20_3e_24',['vector< std::valarray< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avector_3c_20double_20_3e_20_3e_25',['vector< std::vector< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avector_3c_20int_20_3e_20_3e_26',['vector< std::vector< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_27',['vector< std::vector< T > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20uint64_5ft_20_3e_28',['vector< uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20unsigned_20char_20_3e_29',['vector< unsigned char >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20unsigned_20int_20_3e_30',['vector< unsigned int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20x_20_3e_31',['vector< X >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]] + ['vector_3c_20edge_20_3e_7',['vector< Edge >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20geometry_3a_3ajarvis_3a_3apoint_20_3e_8',['vector< geometry::jarvis::Point >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20int_20_3e_9',['vector< int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20int64_5ft_20_3e_10',['vector< int64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20machine_5flearning_3a_3aneural_5fnetwork_3a_3alayers_3a_3adenselayer_20_3e_11',['vector< machine_learning::neural_network::layers::DenseLayer >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20operations_5fon_5fdatastructures_3a_3atrie_5foperations_3a_3atnode_20_2a_20_3e_12',['vector< operations_on_datastructures::trie_operations::Tnode * >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20size_5ft_20_3e_13',['vector< size_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3afunction_3c_20std_3a_3asize_5ft_28t_29_3e_20_3e_14',['vector< std::function< std::size_t(T)> >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3alist_3c_20int_20_3e_20_3e_15',['vector< std::list< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3apair_3c_20int8_5ft_2c_20int8_5ft_20_3e_20_3e_16',['vector< std::pair< int8_t, int8_t > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3ashared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_20_3e_17',['vector< std::shared_ptr< data_structures::Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3ashared_5fptr_3c_20node_20_3e_20_3e_18',['vector< std::shared_ptr< Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3ashared_5fptr_3c_20range_5fqueries_3a_3apersegtree_3a_3anode_20_3e_20_3e_19',['vector< std::shared_ptr< range_queries::perSegTree::Node > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3asize_5ft_20_3e_20',['vector< std::size_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3astring_20_3e_21',['vector< std::string >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3atuple_3c_20int_2c_20int_2c_20int_20_3e_20_3e_22',['vector< std::tuple< int, int, int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_20_3e_23',['vector< std::tuple< S, T, E, double, double, double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3auint64_5ft_20_3e_24',['vector< std::uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avalarray_3c_20double_20_3e_20_3e_25',['vector< std::valarray< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avector_3c_20double_20_3e_20_3e_26',['vector< std::vector< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avector_3c_20int_20_3e_20_3e_27',['vector< std::vector< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_28',['vector< std::vector< T > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20uint64_5ft_20_3e_29',['vector< uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20unsigned_20char_20_3e_30',['vector< unsigned char >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20unsigned_20int_20_3e_31',['vector< unsigned int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20x_20_3e_32',['vector< X >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]] ]; diff --git a/search/files_1.js b/search/files_1.js index 74f71051c..cdfe80484 100644 --- a/search/files_1.js +++ b/search/files_1.js @@ -7,7 +7,7 @@ var searchData= ['aliquot_5fsum_2ecpp_4',['aliquot_sum.cpp',['../de/d99/aliquot__sum_8cpp.html',1,'']]], ['approximate_5fpi_2ecpp_5',['approximate_pi.cpp',['../d0/d51/approximate__pi_8cpp.html',1,'']]], ['area_2ecpp_6',['area.cpp',['../dc/d82/area_8cpp.html',1,'']]], - ['armstrong_5fnumber_2ecpp_7',['armstrong_number.cpp',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html',1,'']]], + ['armstrong_5fnumber_5ftemplated_2ecpp_7',['armstrong_number_templated.cpp',['../d1/da7/armstrong__number__templated_8cpp.html',1,'']]], ['array_5fleft_5frotation_2ecpp_8',['array_left_rotation.cpp',['../d9/d14/array__left__rotation_8cpp.html',1,'']]], ['array_5fright_5frotation_2ecpp_9',['array_right_rotation.cpp',['../d6/d57/array__right__rotation_8cpp.html',1,'']]], ['atbash_5fcipher_2ecpp_10',['atbash_cipher.cpp',['../dc/dfb/atbash__cipher_8cpp.html',1,'']]], diff --git a/search/files_13.js b/search/files_13.js index d693b3a33..48417b2c0 100644 --- a/search/files_13.js +++ b/search/files_13.js @@ -13,7 +13,7 @@ var searchData= ['skip_5flist_2ecpp_10',['skip_list.cpp',['../d0/d5a/skip__list_8cpp.html',1,'']]], ['smallest_5fcircle_2ecpp_11',['smallest_circle.cpp',['../d0/d01/smallest__circle_8cpp.html',1,'']]], ['sparse_5fmatrix_2ecpp_12',['sparse_matrix.cpp',['../d3/d19/sparse__matrix_8cpp.html',1,'']]], - ['sparse_5ftable_2ecpp_13',['sparse_table.cpp',['../d6/d42/data__structures_2sparse__table_8cpp.html',1,'(Global Namespace)'],['../d4/d96/range__queries_2sparse__table_8cpp.html',1,'(Global Namespace)']]], + ['sparse_5ftable_2ecpp_13',['sparse_table.cpp',['../d8/dab/sparse__table_8cpp.html',1,'']]], ['spiral_5fprint_2ecpp_14',['spiral_print.cpp',['../db/d07/spiral__print_8cpp.html',1,'']]], ['spirograph_2ecpp_15',['spirograph.cpp',['../da/d77/spirograph_8cpp.html',1,'']]], ['sqrt_5fdouble_2ecpp_16',['sqrt_double.cpp',['../da/d24/sqrt__double_8cpp.html',1,'']]], @@ -24,9 +24,10 @@ var searchData= ['string_5ffibonacci_2ecpp_21',['string_fibonacci.cpp',['../de/d47/string__fibonacci_8cpp.html',1,'']]], ['subarray_5fsum_2ecpp_22',['subarray_sum.cpp',['../df/d94/subarray__sum_8cpp.html',1,'']]], ['sublist_5fsearch_2ecpp_23',['sublist_search.cpp',['../d5/d45/sublist__search_8cpp.html',1,'']]], - ['subset_5fsum_2ecpp_24',['subset_sum.cpp',['../d0/dfe/backtracking_2subset__sum_8cpp.html',1,'(Global Namespace)'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html',1,'(Global Namespace)']]], - ['successive_5fapproximation_2ecpp_25',['successive_approximation.cpp',['../df/dc8/successive__approximation_8cpp.html',1,'']]], - ['sudoku_5fsolver_2ecpp_26',['sudoku_solver.cpp',['../d3/d05/sudoku__solver_8cpp.html',1,'']]], - ['sum_5fof_5fbinomial_5fcoefficient_2ecpp_27',['sum_of_binomial_coefficient.cpp',['../d4/d9d/sum__of__binomial__coefficient_8cpp.html',1,'']]], - ['sum_5fof_5fdigits_2ecpp_28',['sum_of_digits.cpp',['../d4/d83/sum__of__digits_8cpp.html',1,'']]] + ['subset_5fsum_2ecpp_24',['subset_sum.cpp',['../d2/d5a/subset__sum_8cpp.html',1,'']]], + ['subset_5fsum_5fdynamic_2ecpp_25',['subset_sum_dynamic.cpp',['../dc/d67/subset__sum__dynamic_8cpp.html',1,'']]], + ['successive_5fapproximation_2ecpp_26',['successive_approximation.cpp',['../df/dc8/successive__approximation_8cpp.html',1,'']]], + ['sudoku_5fsolver_2ecpp_27',['sudoku_solver.cpp',['../d3/d05/sudoku__solver_8cpp.html',1,'']]], + ['sum_5fof_5fbinomial_5fcoefficient_2ecpp_28',['sum_of_binomial_coefficient.cpp',['../d4/d9d/sum__of__binomial__coefficient_8cpp.html',1,'']]], + ['sum_5fof_5fdigits_2ecpp_29',['sum_of_digits.cpp',['../d4/d83/sum__of__digits_8cpp.html',1,'']]] ]; diff --git a/search/files_4.js b/search/files_4.js index e729d98d4..4c768fea0 100644 --- a/search/files_4.js +++ b/search/files_4.js @@ -6,13 +6,14 @@ var searchData= ['depth_5ffirst_5fsearch_2ecpp_3',['depth_first_search.cpp',['../da/d8d/depth__first__search_8cpp.html',1,'']]], ['depth_5ffirst_5fsearch_5fwith_5fstack_2ecpp_4',['depth_first_search_with_stack.cpp',['../da/d4b/depth__first__search__with__stack_8cpp.html',1,'']]], ['digit_5fseparation_2ecpp_5',['digit_separation.cpp',['../d3/d36/digit__separation_8cpp.html',1,'']]], - ['dijkstra_2ecpp_6',['dijkstra.cpp',['../d7/d1e/graph_2dijkstra_8cpp.html',1,'(Global Namespace)'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html',1,'(Global Namespace)']]], - ['disjoint_5fset_2ecpp_7',['disjoint_set.cpp',['../de/d23/disjoint__set_8cpp.html',1,'']]], - ['dnf_5fsort_2ecpp_8',['dnf_sort.cpp',['../d6/d1a/dnf__sort_8cpp.html',1,'']]], - ['double_5ffactorial_2ecpp_9',['double_factorial.cpp',['../d7/d89/double__factorial_8cpp.html',1,'']]], - ['double_5fhash_5fhash_5ftable_2ecpp_10',['double_hash_hash_table.cpp',['../d6/d80/double__hash__hash__table_8cpp.html',1,'']]], - ['dsu_5fpath_5fcompression_2ecpp_11',['dsu_path_compression.cpp',['../d3/dae/dsu__path__compression_8cpp.html',1,'']]], - ['dsu_5funion_5frank_2ecpp_12',['dsu_union_rank.cpp',['../df/d28/dsu__union__rank_8cpp.html',1,'']]], - ['durand_5fkerner_5froots_2ecpp_13',['durand_kerner_roots.cpp',['../da/df2/durand__kerner__roots_8cpp.html',1,'']]], - ['duval_2ecpp_14',['duval.cpp',['../db/d09/duval_8cpp.html',1,'']]] + ['dijkstra_2ecpp_6',['dijkstra.cpp',['../d8/d68/dijkstra_8cpp.html',1,'']]], + ['dijkstra_5fgreedy_2ecpp_7',['dijkstra_greedy.cpp',['../da/de8/dijkstra__greedy_8cpp.html',1,'']]], + ['disjoint_5fset_2ecpp_8',['disjoint_set.cpp',['../de/d23/disjoint__set_8cpp.html',1,'']]], + ['dnf_5fsort_2ecpp_9',['dnf_sort.cpp',['../d6/d1a/dnf__sort_8cpp.html',1,'']]], + ['double_5ffactorial_2ecpp_10',['double_factorial.cpp',['../d7/d89/double__factorial_8cpp.html',1,'']]], + ['double_5fhash_5fhash_5ftable_2ecpp_11',['double_hash_hash_table.cpp',['../d6/d80/double__hash__hash__table_8cpp.html',1,'']]], + ['dsu_5fpath_5fcompression_2ecpp_12',['dsu_path_compression.cpp',['../d3/dae/dsu__path__compression_8cpp.html',1,'']]], + ['dsu_5funion_5frank_2ecpp_13',['dsu_union_rank.cpp',['../df/d28/dsu__union__rank_8cpp.html',1,'']]], + ['durand_5fkerner_5froots_2ecpp_14',['durand_kerner_roots.cpp',['../da/df2/durand__kerner__roots_8cpp.html',1,'']]], + ['duval_2ecpp_15',['duval.cpp',['../db/d09/duval_8cpp.html',1,'']]] ]; diff --git a/search/files_b.js b/search/files_b.js index 2a75561ee..d2b53e235 100644 --- a/search/files_b.js +++ b/search/files_b.js @@ -1,7 +1,7 @@ var searchData= [ ['k_5fnearest_5fneighbors_2ecpp_0',['k_nearest_neighbors.cpp',['../d4/d3e/k__nearest__neighbors_8cpp.html',1,'']]], - ['kadane2_2ecpp_1',['kadane2.cpp',['../db/dca/kadane2_8cpp.html',1,'']]], + ['kadane_2ecpp_1',['kadane.cpp',['../d4/da0/kadane_8cpp.html',1,'']]], ['kadanes3_2ecpp_2',['kadanes3.cpp',['../de/dcd/kadanes3_8cpp.html',1,'']]], ['karatsuba_5falgorithm_5ffor_5ffast_5fmultiplication_2ecpp_3',['karatsuba_algorithm_for_fast_multiplication.cpp',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html',1,'']]], ['kelvin_5fto_5fcelsius_2ecpp_4',['kelvin_to_celsius.cpp',['../db/d6b/kelvin__to__celsius_8cpp.html',1,'']]], diff --git a/search/functions_13.js b/search/functions_13.js index 0d38f16e9..9702a28f1 100644 --- a/search/functions_13.js +++ b/search/functions_13.js @@ -209,8 +209,8 @@ var searchData= ['sub_5fmatch_206',['sub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::sub_match']]], ['subarray_5fsum_207',['subarray_sum',['../df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e',1,'backtracking::subarray_sum']]], ['sublistsearch_208',['sublistSearch',['../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c',1,'search::sublist_search']]], - ['subset_5fsum_5fproblem_209',['subset_sum_problem',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50',1,'dynamic_programming::subset_sum']]], - ['subset_5fsum_5frecursion_210',['subset_sum_recursion',['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607',1,'dynamic_programming::subset_sum']]], + ['subset_5fsum_5fproblem_209',['subset_sum_problem',['../dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50',1,'dynamic_programming::subset_sum']]], + ['subset_5fsum_5frecursion_210',['subset_sum_recursion',['../dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607',1,'dynamic_programming::subset_sum']]], ['substr_211',['substr',['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::basic_string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::wstring::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u16string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u32string::substr()']]], ['subtract_5fwith_5fcarry_5fengine_212',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine']]], ['succ_213',['succ',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3',1,'data_structures::linked_list::link']]], diff --git a/search/functions_14.js b/search/functions_14.js index 27bde557a..91da182f1 100644 --- a/search/functions_14.js +++ b/search/functions_14.js @@ -9,7 +9,7 @@ var searchData= ['tellp_6',['tellp',['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::fstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_fstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::iostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::stringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::strstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_stringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wiostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostrstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wfstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_iostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wstringstream::tellp()']]], ['terminate_7',['terminate',['http://en.cppreference.com/w/cpp/error/terminate.html',0,'std']]], ['ternary_5fsearch_8',['ternary_search',['../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8',1,'ternary_search.cpp']]], - ['test_9',['test',['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): generate_parentheses.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_bits_flip.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): elliptic_curve_key_exchange.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fcfs_scheduling.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): list_array.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segment_tree.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): treap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): abbreviation.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): house_robber.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): word_break.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jarvis_algorithm.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): connected_components_with_dsu.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): is_graph_bipartite.cpp'],['../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): topological_sort.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kruskals_minimum_spanning_tree.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): md5.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sha1.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): k_nearest_neighbors.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): neural_network.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): aliquot_sum.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): area.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eulers_totient_function.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_sum.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gcd_of_n_numbers.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): iterative_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lcm_sum.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_choose_r.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): perimeter.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_two.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): quadratic_equations_complex_numbers.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): babylonian_method.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): composite_simpson_rule.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inverse_fast_fourier_transform.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): midpoint_integral_method.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rungekutta.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): union_of_two_arrays.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kadanes3.cpp'],['../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lfu_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lru_cache2.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): smallest_circle.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): ground_to_ground_projectile_motion.cpp'],['../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): geometric_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector< int > &vals, int windowSize): windowed_median.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segtree.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): floyd_cycle_detection_algo.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sublist_search.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): bubble_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): heap_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): merge_insertion_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): pancake_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): selection_sort_recursive.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wave_sort.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test(): wiggle_sort.cpp'],['../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): duval.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): manacher_algorithm.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): z_function.cpp']]], + ['test_9',['test',['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): generate_parentheses.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subarray_sum.cpp'],['../d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_bits_flip.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): elliptic_curve_key_exchange.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fcfs_scheduling.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): list_array.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segment_tree.cpp'],['../d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): treap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): abbreviation.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): house_robber.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): shortest_common_supersequence.cpp'],['../dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): subset_sum_dynamic.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): word_break.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jarvis_algorithm.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): connected_components_with_dsu.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): is_graph_bipartite.cpp'],['../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): topological_sort.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kruskals_minimum_spanning_tree.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): md5.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sha1.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): k_nearest_neighbors.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): neural_network.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): aliquot_sum.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): area.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): eulers_totient_function.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fibonacci_sum.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gcd_of_n_numbers.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): iterative_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lcm_sum.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): n_choose_r.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): perimeter.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): power_of_two.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): quadratic_equations_complex_numbers.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): babylonian_method.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): composite_simpson_rule.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inverse_fast_fourier_transform.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters): midpoint_integral_method.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): rungekutta.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): union_of_two_arrays.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): kadanes3.cpp'],['../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lfu_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): lru_cache2.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): smallest_circle.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): ground_to_ground_projectile_motion.cpp'],['../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): geometric_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector< int > &vals, int windowSize): windowed_median.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): segtree.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): floyd_cycle_detection_algo.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): sublist_search.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): bubble_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): heap_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): merge_insertion_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): pancake_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): selection_sort_recursive.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): wave_sort.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test(): wiggle_sort.cpp'],['../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): duval.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): manacher_algorithm.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test(): z_function.cpp']]], ['test1_10',['test1',['../d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b',1,'test1(const std::string &text): hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1(): hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499',1,'test1(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8',1,'test1(): large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5',1,'tests::test1()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0',1,'test1(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root): iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): recursive_tree_traversal.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): stooge_sort.cpp']]], ['test2_11',['test2',['../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712',1,'test2(const std::string &text): hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2(): dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342',1,'test2(int64_t n): tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2(): hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82',1,'test2(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa',1,'test2(): large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669',1,'tests::test2()'],['../d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21',1,'test2(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root): iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): stooge_sort.cpp']]], ['test3_12',['test3',['../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299',1,'test3(): hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9',1,'test3(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): golden_search_extrema.cpp'],['../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76',1,'tests::test3()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a425c4c8520991999ee6dbe13d99b87f4',1,'test3(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root): iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): stooge_sort.cpp']]], @@ -52,7 +52,7 @@ var searchData= ['testcase_5f1_49',['testCase_1',['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()']]], ['testcase_5f2_50',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]], ['testcase_5f3_51',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]], - ['tests_52',['tests',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): unbounded_0_1_knapsack.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): digit_separation.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_substring_without_repeating_characters.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): insertion_sort_recursive.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): knuth_morris_pratt.cpp']]], + ['tests_52',['tests',['../d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): armstrong_number_templated.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_common_string.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): unbounded_0_1_knapsack.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): depth_first_search_with_stack.cpp'],['../d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): travelling_salesman_problem.cpp'],['../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): digit_separation.cpp'],['../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): dijkstra_greedy.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): kelvin_to_celsius.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_substring_without_repeating_characters.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): insertion_sort_recursive.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests(): knuth_morris_pratt.cpp']]], ['tgamma_53',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]], ['th_54',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]], ['thousands_5fsep_55',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]], diff --git a/search/functions_2.js b/search/functions_2.js index f109e5ea3..139772b73 100644 --- a/search/functions_2.js +++ b/search/functions_2.js @@ -72,6 +72,5 @@ var searchData= ['bucket_69',['bucket',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket.html',0,'std::unordered_map::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket.html',0,'std::unordered_multimap::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket.html',0,'std::unordered_multiset::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket.html',0,'std::unordered_set::bucket()']]], ['bucket_5fcount_70',['bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_count.html',0,'std::unordered_map::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_count.html',0,'std::unordered_multimap::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_count.html',0,'std::unordered_multiset::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_count.html',0,'std::unordered_set::bucket_count()']]], ['bucket_5fsize_71',['bucket_size',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_size.html',0,'std::unordered_map::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_size.html',0,'std::unordered_multimap::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_size.html',0,'std::unordered_multiset::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_size.html',0,'std::unordered_set::bucket_size()']]], - ['build_72',['build',['../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9',1,'range_queries::prefix_sum_array']]], - ['buildtable_73',['buildTable',['../d4/d96/range__queries_2sparse__table_8cpp.html#a803a2451e87021d14ae06f148383e6bc',1,'range_queries::sparse_table']]] + ['build_72',['build',['../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9',1,'range_queries::prefix_sum_array']]] ]; diff --git a/search/functions_3.js b/search/functions_3.js index ec9fb34d4..6a114246a 100644 --- a/search/functions_3.js +++ b/search/functions_3.js @@ -57,57 +57,56 @@ var searchData= ['complex_5fstr_54',['complex_str',['../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c',1,'durand_kerner_roots.cpp']]], ['compute_5fpadded_5fsize_55',['compute_padded_size',['../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27',1,'hashing::sha256']]], ['computefactorialsmod_56',['computeFactorialsMod',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f',1,'math::ncr_modulo_p::NCRModuloP']]], - ['computelogs_57',['computeLogs',['../d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300',1,'range_queries::sparse_table']]], - ['condition_5fvariable_58',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable']]], - ['condition_5fvariable_5fany_59',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any']]], - ['cone_5fvolume_60',['cone_volume',['../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7',1,'math']]], - ['const_5fpointer_5fcast_61',['const_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], - ['constree_62',['ConsTree',['../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696',1,'segtree.cpp']]], - ['construct_63',['construct',['http://en.cppreference.com/w/cpp/memory/allocator_traits/construct.html',0,'std::allocator_traits::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator/construct.html',0,'std::allocator::construct()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/construct.html',0,'std::scoped_allocator_adaptor::construct()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4',1,'range_queries::perSegTree::construct(const uint32_t &i, const uint32_t &j)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3',1,'range_queries::perSegTree::construct(const std::vector< int64_t > &vec)']]], - ['contains_64',['Contains',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f',1,'data_structures::tree_234::Node']]], - ['contains_65',['contains',['../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2',1,'binary_search_tree::contains(std::unique_ptr< bst_node > &node, T value)'],['../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63',1,'binary_search_tree::contains(T value)'],['../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac',1,'data_structures::Bitset::contains()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b',1,'data_structures::BloomFilter::contains()']]], - ['converted_66',['converted',['http://en.cppreference.com/w/cpp/locale/wstring_convert/converted.html',0,'std::wstring_convert']]], - ['convexhull_67',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870',1,'geometry::jarvis::Convexhull']]], - ['copy_68',['copy',['http://en.cppreference.com/w/cpp/string/char_traits/copy.html',0,'std::char_traits::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::basic_string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::wstring::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u16string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u32string::copy()'],['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std::copy()']]], - ['copy_5fall_5fnodes_69',['copy_all_nodes',['../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511',1,'data_structures::linked_list']]], - ['copy_5fbackward_70',['copy_backward',['http://en.cppreference.com/w/cpp/algorithm/copy_backward.html',0,'std']]], - ['copy_5fif_71',['copy_if',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std']]], - ['copy_5fn_72',['copy_n',['http://en.cppreference.com/w/cpp/algorithm/copy_n.html',0,'std']]], - ['copyfmt_73',['copyfmt',['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ios::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::strstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wiostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wfstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wstringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ifstream::copyfmt()']]], - ['copysign_74',['copysign',['http://en.cppreference.com/w/cpp/numeric/math/copysign.html',0,'std']]], - ['cos_75',['cos',['http://en.cppreference.com/w/cpp/numeric/math/cos.html',0,'std']]], - ['cosh_76',['cosh',['http://en.cppreference.com/w/cpp/numeric/math/cosh.html',0,'std']]], - ['count_77',['count',['http://en.cppreference.com/w/cpp/container/multiset/count.html',0,'std::multiset::count()'],['http://en.cppreference.com/w/cpp/container/set/count.html',0,'std::set::count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/count.html',0,'std::unordered_map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/count.html',0,'std::unordered_multimap::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::minutes::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::seconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::duration::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::milliseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::hours::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::microseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::nanoseconds::count()'],['http://en.cppreference.com/w/cpp/utility/bitset/count.html',0,'std::bitset::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/count.html',0,'std::unordered_multiset::count()'],['http://en.cppreference.com/w/cpp/container/map/count.html',0,'std::map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/count.html',0,'std::unordered_set::count()'],['http://en.cppreference.com/w/cpp/container/multimap/count.html',0,'std::multimap::count()'],['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std::count(T... args)']]], - ['count_5fif_78',['count_if',['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std']]], - ['countbitsflip_79',['countBitsFlip',['../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b',1,'bit_manipulation::count_bits_flip']]], - ['countinversion_80',['countInversion',['../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80',1,'sorting::inversion']]], - ['countsetbits_81',['countSetBits',['../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62',1,'bit_manipulation::count_of_set_bits']]], - ['crbegin_82',['crbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::crbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::crbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::crbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::crbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::crbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::crbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::crbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::crbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::crbegin()']]], - ['create_5fhash_83',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]], - ['create_5flist_84',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]], - ['create_5fmatrix_85',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]], - ['create_5fmessage_5fschedule_5farray_86',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]], - ['create_5frandom_5farray_87',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N): insertion_sort_recursive.cpp']]], - ['createnewnode_88',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114',1,'others::recursive_tree_traversals::BT::createNewNode()']]], - ['createnode_89',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]], - ['createset_90',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]], - ['cref_91',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], - ['cregex_5fiterator_92',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::cregex_iterator']]], - ['cregex_5ftoken_5fiterator_93',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::cregex_token_iterator']]], - ['crend_94',['crend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::crend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::crend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::crend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::crend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::crend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::crend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::crend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::crend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::crend()']]], - ['cross_95',['cross',['../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9',1,'math::vector_cross']]], - ['csub_5fmatch_96',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::csub_match']]], - ['ctime_97',['ctime',['http://en.cppreference.com/w/cpp/chrono/c/ctime.html',0,'std']]], - ['ctype_98',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype/ctype.html',0,'std::ctype']]], - ['ctype_5fbyname_99',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname']]], - ['cube_5fsurface_5farea_100',['cube_surface_area',['../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c',1,'math']]], - ['cube_5fsurface_5fperimeter_101',['cube_surface_perimeter',['../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b',1,'math']]], - ['cube_5fvolume_102',['cube_volume',['../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725',1,'math']]], - ['cumulative_5fdistribution_103',['cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a',1,'probability::geometric_dist::geometric_distribution']]], - ['curr_5fsymbol_104',['curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::curr_symbol()']]], - ['current_5fexception_105',['current_exception',['http://en.cppreference.com/w/cpp/error/current_exception.html',0,'std']]], - ['cyclesort_106',['cycleSort',['../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa',1,'sorting::cycle_sort']]], - ['cylinder_5fsurface_5farea_107',['cylinder_surface_area',['../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864',1,'math']]], - ['cylinder_5fsurface_5fperimeter_108',['cylinder_surface_perimeter',['../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73',1,'math']]], - ['cylinder_5fvolume_109',['cylinder_volume',['../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca',1,'math']]] + ['condition_5fvariable_57',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable']]], + ['condition_5fvariable_5fany_58',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any']]], + ['cone_5fvolume_59',['cone_volume',['../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7',1,'math']]], + ['const_5fpointer_5fcast_60',['const_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['constree_61',['ConsTree',['../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696',1,'segtree.cpp']]], + ['construct_62',['construct',['http://en.cppreference.com/w/cpp/memory/allocator_traits/construct.html',0,'std::allocator_traits::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator/construct.html',0,'std::allocator::construct()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/construct.html',0,'std::scoped_allocator_adaptor::construct()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4',1,'range_queries::perSegTree::construct(const uint32_t &i, const uint32_t &j)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3',1,'range_queries::perSegTree::construct(const std::vector< int64_t > &vec)']]], + ['contains_63',['Contains',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f',1,'data_structures::tree_234::Node']]], + ['contains_64',['contains',['../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2',1,'binary_search_tree::contains(std::unique_ptr< bst_node > &node, T value)'],['../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63',1,'binary_search_tree::contains(T value)'],['../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac',1,'data_structures::Bitset::contains()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b',1,'data_structures::BloomFilter::contains()']]], + ['converted_65',['converted',['http://en.cppreference.com/w/cpp/locale/wstring_convert/converted.html',0,'std::wstring_convert']]], + ['convexhull_66',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870',1,'geometry::jarvis::Convexhull']]], + ['copy_67',['copy',['http://en.cppreference.com/w/cpp/string/char_traits/copy.html',0,'std::char_traits::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::basic_string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::wstring::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u16string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u32string::copy()'],['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std::copy()']]], + ['copy_5fall_5fnodes_68',['copy_all_nodes',['../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511',1,'data_structures::linked_list']]], + ['copy_5fbackward_69',['copy_backward',['http://en.cppreference.com/w/cpp/algorithm/copy_backward.html',0,'std']]], + ['copy_5fif_70',['copy_if',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std']]], + ['copy_5fn_71',['copy_n',['http://en.cppreference.com/w/cpp/algorithm/copy_n.html',0,'std']]], + ['copyfmt_72',['copyfmt',['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ios::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::strstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wiostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wfstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wstringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ifstream::copyfmt()']]], + ['copysign_73',['copysign',['http://en.cppreference.com/w/cpp/numeric/math/copysign.html',0,'std']]], + ['cos_74',['cos',['http://en.cppreference.com/w/cpp/numeric/math/cos.html',0,'std']]], + ['cosh_75',['cosh',['http://en.cppreference.com/w/cpp/numeric/math/cosh.html',0,'std']]], + ['count_76',['count',['http://en.cppreference.com/w/cpp/container/multiset/count.html',0,'std::multiset::count()'],['http://en.cppreference.com/w/cpp/container/set/count.html',0,'std::set::count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/count.html',0,'std::unordered_map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/count.html',0,'std::unordered_multimap::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::minutes::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::seconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::duration::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::milliseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::hours::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::microseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::nanoseconds::count()'],['http://en.cppreference.com/w/cpp/utility/bitset/count.html',0,'std::bitset::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/count.html',0,'std::unordered_multiset::count()'],['http://en.cppreference.com/w/cpp/container/map/count.html',0,'std::map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/count.html',0,'std::unordered_set::count()'],['http://en.cppreference.com/w/cpp/container/multimap/count.html',0,'std::multimap::count()'],['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std::count(T... args)']]], + ['count_5fif_77',['count_if',['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std']]], + ['countbitsflip_78',['countBitsFlip',['../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b',1,'bit_manipulation::count_bits_flip']]], + ['countinversion_79',['countInversion',['../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80',1,'sorting::inversion']]], + ['countsetbits_80',['countSetBits',['../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62',1,'bit_manipulation::count_of_set_bits']]], + ['crbegin_81',['crbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::crbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::crbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::crbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::crbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::crbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::crbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::crbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::crbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::crbegin()']]], + ['create_5fhash_82',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]], + ['create_5flist_83',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]], + ['create_5fmatrix_84',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]], + ['create_5fmessage_5fschedule_5farray_85',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]], + ['create_5frandom_5farray_86',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N): insertion_sort_recursive.cpp']]], + ['createnewnode_87',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114',1,'others::recursive_tree_traversals::BT::createNewNode()']]], + ['createnode_88',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]], + ['createset_89',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]], + ['cref_90',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], + ['cregex_5fiterator_91',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::cregex_iterator']]], + ['cregex_5ftoken_5fiterator_92',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::cregex_token_iterator']]], + ['crend_93',['crend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::crend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::crend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::crend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::crend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::crend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::crend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::crend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::crend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::crend()']]], + ['cross_94',['cross',['../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9',1,'math::vector_cross']]], + ['csub_5fmatch_95',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::csub_match']]], + ['ctime_96',['ctime',['http://en.cppreference.com/w/cpp/chrono/c/ctime.html',0,'std']]], + ['ctype_97',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype/ctype.html',0,'std::ctype']]], + ['ctype_5fbyname_98',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname']]], + ['cube_5fsurface_5farea_99',['cube_surface_area',['../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c',1,'math']]], + ['cube_5fsurface_5fperimeter_100',['cube_surface_perimeter',['../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b',1,'math']]], + ['cube_5fvolume_101',['cube_volume',['../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725',1,'math']]], + ['cumulative_5fdistribution_102',['cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a',1,'probability::geometric_dist::geometric_distribution']]], + ['curr_5fsymbol_103',['curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::curr_symbol()']]], + ['current_5fexception_104',['current_exception',['http://en.cppreference.com/w/cpp/error/current_exception.html',0,'std']]], + ['cyclesort_105',['cycleSort',['../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa',1,'sorting::cycle_sort']]], + ['cylinder_5fsurface_5farea_106',['cylinder_surface_area',['../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864',1,'math']]], + ['cylinder_5fsurface_5fperimeter_107',['cylinder_surface_perimeter',['../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73',1,'math']]], + ['cylinder_5fvolume_108',['cylinder_volume',['../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca',1,'math']]] ]; diff --git a/search/functions_7.js b/search/functions_7.js index 3edbb2204..fdd113653 100644 --- a/search/functions_7.js +++ b/search/functions_7.js @@ -91,28 +91,27 @@ var searchData= ['getmedian_88',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]], ['getmediannaive_89',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]], ['getmin_90',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]], - ['getminimum_91',['getMinimum',['../d4/d96/range__queries_2sparse__table_8cpp.html#a932816c3de9e5ad122b180de60978e8f',1,'range_queries::sparse_table']]], - ['getminitem_92',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]], - ['getnextpossiblechild_93',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]], - ['getnode_94',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]], - ['getnode_95',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]], - ['getnumnodes_96',['getNumNodes',['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096',1,'graph::topological_sort::Graph']]], - ['getpagefault_97',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]], - ['getparents_98',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]], - ['getrandomindex_99',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]], - ['getrightmostchild_100',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]], - ['gets_101',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]], - ['gettreemaxitem_102',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]], - ['gettreeminitem_103',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]], - ['getvertices_104',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]], - ['getwchar_105',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]], - ['global_106',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]], - ['gmtime_107',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]], - ['gnomesort_108',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array< T, size > arr)']]], - ['good_109',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]], - ['gptr_110',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]], - ['gram_5fschmidt_111',['gram_schmidt',['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt']]], - ['graph_112',['Graph',['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &&adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector< Edge > const &edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6',1,'graph::topological_sort::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()']]], - ['graphcoloring_113',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]], - ['grouping_114',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]] + ['getminitem_91',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]], + ['getnextpossiblechild_92',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]], + ['getnode_93',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]], + ['getnode_94',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]], + ['getnumnodes_95',['getNumNodes',['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096',1,'graph::topological_sort::Graph']]], + ['getpagefault_96',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]], + ['getparents_97',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]], + ['getrandomindex_98',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]], + ['getrightmostchild_99',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]], + ['gets_100',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]], + ['gettreemaxitem_101',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]], + ['gettreeminitem_102',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]], + ['getvertices_103',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]], + ['getwchar_104',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]], + ['global_105',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]], + ['gmtime_106',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]], + ['gnomesort_107',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array< T, size > arr)']]], + ['good_108',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]], + ['gptr_109',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]], + ['gram_5fschmidt_110',['gram_schmidt',['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt']]], + ['graph_111',['Graph',['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &&adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector< Edge > const &edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6',1,'graph::topological_sort::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()']]], + ['graphcoloring_112',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]], + ['grouping_113',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]] ]; diff --git a/search/functions_d.js b/search/functions_d.js index 28f570b66..b6557f32e 100644 --- a/search/functions_d.js +++ b/search/functions_d.js @@ -3,7 +3,7 @@ var searchData= ['m_0',['m',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution::m()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::m()']]], ['mag_1',['mag',['../df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8',1,'math::vector_cross']]], ['magic_5fnumber_2',['magic_number',['../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0',1,'math']]], - ['main_3',['main',['../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subarray_sum.cpp'],['../d0/dfe/backtracking_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): skip_list.cpp'],['../d6/d42/data__structures_2sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): abbreviation.cpp'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): armstrong_number.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): house_robber.cpp'],['../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadane2.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_common_string.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): shortest_common_supersequence.cpp'],['../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trapped_rainwater.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): unbounded_0_1_knapsack.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): word_break.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): memory_game.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jarvis_algorithm.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components_with_dsu.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): hamiltons_cycle.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hopcroft_karp.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): is_graph_bipartite.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lowest_common_ancestor.cpp'],['../d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): topological_sort.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_problem.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.cpp'],['../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): digit_separation.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gale_shapley.cpp'],['../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kruskals_minimum_spanning_tree.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): chaining.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_hash_hash_table.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): md5.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_probing_hash_table.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha1.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha256.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): k_nearest_neighbors.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): neural_network.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): aliquot_sum.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): approximate_pi.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): area.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_sum.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): finding_number_of_digits_in_a_number.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_factorial.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lcm_sum.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): miller_rabin.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): n_choose_r.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): perimeter.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_two.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_equations_complex_numbers.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): babylonian_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brent_method_extrema.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): composite_simpson_rule.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): fast_fourier_transform.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): golden_search_extrema.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): inverse_fast_fourier_transform.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): midpoint_integral_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rungekutta.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_of_two_arrays.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_integer_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_tree_traversals.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadanes3.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kelvin_to_celsius.cpp'],['../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lfu_cache.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_substring_without_repeating_characters.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache2.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): postfix_evaluation.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ground_to_ground_projectile_motion.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): geometric_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): windowed_median.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fenwick_tree.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heavy_light_decomposition.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segtree.cpp'],['../d4/d96/range__queries_2sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_table.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): floyd_cycle_detection_algo.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sublist_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bubble_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): comb_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heap_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort_recursive.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_insertion_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pancake_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pigeonhole_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_3.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): radix_sort2.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): selection_sort_recursive.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stooge_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wave_sort.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boyer_moore.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): duval.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): manacher_algorithm.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): z_function.cpp']]], + ['main_3',['main',['../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subarray_sum.cpp'],['../d2/d5a/subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): skip_list.cpp'],['../d8/dab/sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): 0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): abbreviation.cpp'],['../d1/da7/armstrong__number__templated_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): armstrong_number_templated.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): house_robber.cpp'],['../d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadane.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_common_string.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): shortest_common_supersequence.cpp'],['../dc/d67/subset__sum__dynamic_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): subset_sum_dynamic.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trapped_rainwater.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): unbounded_0_1_knapsack.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): word_break.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): memory_game.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jarvis_algorithm.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): connected_components_with_dsu.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): depth_first_search_with_stack.cpp'],['../d8/d68/dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): hamiltons_cycle.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hopcroft_karp.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): is_graph_bipartite.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lowest_common_ancestor.cpp'],['../d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): topological_sort.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): travelling_salesman_problem.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.cpp'],['../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): digit_separation.cpp'],['../da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dijkstra_greedy.cpp'],['../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gale_shapley.cpp'],['../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kruskals_minimum_spanning_tree.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): chaining.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_hash_hash_table.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): md5.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_probing_hash_table.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha1.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sha256.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): k_nearest_neighbors.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): neural_network.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): aliquot_sum.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): approximate_pi.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): area.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_sum.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): finding_number_of_digits_in_a_number.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_factorial.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lcm_sum.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): miller_rabin.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): n_choose_r.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): perimeter.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_of_two.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quadratic_equations_complex_numbers.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): babylonian_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brent_method_extrema.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): composite_simpson_rule.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): fast_fourier_transform.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): golden_search_extrema.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): inverse_fast_fourier_transform.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): midpoint_integral_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): rungekutta.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_of_two_arrays.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_integer_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): iterative_tree_traversals.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kadanes3.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): kelvin_to_celsius.cpp'],['../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lfu_cache.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_substring_without_repeating_characters.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): lru_cache2.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): postfix_evaluation.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ground_to_ground_projectile_motion.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): geometric_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): windowed_median.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fenwick_tree.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heavy_light_decomposition.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): segtree.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): floyd_cycle_detection_algo.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): longest_increasing_subsequence_using_binary_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sublist_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bubble_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): comb_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): heap_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): insertion_sort_recursive.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_insertion_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): merge_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pancake_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pigeonhole_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_3.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): radix_sort2.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): selection_sort_recursive.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stooge_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): wave_sort.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): boyer_moore.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): duval.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): manacher_algorithm.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): z_function.cpp']]], ['make_5fexception_5fptr_4',['make_exception_ptr',['http://en.cppreference.com/w/cpp/error/make_exception_ptr.html',0,'std']]], ['make_5fheap_5',['make_heap',['http://en.cppreference.com/w/cpp/algorithm/make_heap.html',0,'std']]], ['make_5fmove_5fiterator_6',['make_move_iterator',['http://en.cppreference.com/w/cpp/iterator/make_move_iterator.html',0,'std']]], @@ -37,7 +37,7 @@ var searchData= ['maxcircularsum_34',['maxCircularSum',['../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb',1,'dynamic_programming']]], ['maxknapsackvalue_35',['maxKnapsackValue',['../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1',1,'dynamic_programming::knapsack']]], ['maxprofitbycuttingrod_36',['maxProfitByCuttingRod',['../d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa',1,'dynamic_programming::cut_rod']]], - ['maxsubarray_37',['maxSubArray',['../db/dca/kadane2_8cpp.html#af3029007a422a914a85c0b0122f1c7b4',1,'dynamic_programming::kadane']]], + ['maxsubarray_37',['maxSubArray',['../d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4',1,'dynamic_programming::kadane']]], ['mblen_38',['mblen',['http://en.cppreference.com/w/cpp/string/multibyte/mblen.html',0,'std']]], ['mbrlen_39',['mbrlen',['http://en.cppreference.com/w/cpp/string/multibyte/mbrlen.html',0,'std']]], ['mbrtoc16_40',['mbrtoc16',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc16.html',0,'std']]], diff --git a/search/functions_e.js b/search/functions_e.js index 0b802b87a..6f7798018 100644 --- a/search/functions_e.js +++ b/search/functions_e.js @@ -56,7 +56,7 @@ var searchData= ['num_5fget_53',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get/num_get.html',0,'std::num_get']]], ['num_5fput_54',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put/num_put.html',0,'std::num_put']]], ['number_5fof_5fpositive_5fdivisors_55',['number_of_positive_divisors',['../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb',1,'number_of_positive_divisors.cpp']]], - ['number_5fof_5fsubsets_56',['number_of_subsets',['../d0/dfe/backtracking_2subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99',1,'backtracking::subset_sum']]], + ['number_5fof_5fsubsets_56',['number_of_subsets',['../d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99',1,'backtracking::subset_sum']]], ['number_5fof_5fvertices_57',['number_of_vertices',['../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904',1,'graph::Graph']]], ['numberofchildren_58',['numberOfChildren',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0',1,'operations_on_datastructures::trie_operations::Tnode']]], ['numberofciphersinfactorialn_59',['numberOfCiphersInFactorialN',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0',1,'bit_manipulation::count_of_trailing_ciphers_in_factorial_n']]], diff --git a/search/variables_c.js b/search/variables_c.js index be1329c32..fcc13f43e 100644 --- a/search/variables_c.js +++ b/search/variables_c.js @@ -1,6 +1,6 @@ var searchData= [ - ['m_0',['M',['../d6/d42/data__structures_2sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e',1,'data_structures::sparse_table']]], + ['m_0',['M',['../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e',1,'data_structures::sparse_table']]], ['m_1',['m',['../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74',1,'graph::HKGraph']]], ['main_5fq_2',['main_q',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6',1,'data_structures::stack_using_queue::Stack']]], ['mat_5fsize_3',['mat_size',['../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54',1,'matrix_exponentiation.cpp']]], diff --git a/search/variables_d.js b/search/variables_d.js index c33d522f4..ea002435a 100644 --- a/search/variables_d.js +++ b/search/variables_d.js @@ -1,6 +1,6 @@ var searchData= [ - ['n_0',['N',['../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d',1,'data_structures::sparse_table']]], + ['n_0',['N',['../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d',1,'data_structures::sparse_table']]], ['n_1',['n',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635',1,'data_structures::sparse_table::Sparse_table::n'],['../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c',1,'graph::HKGraph::n'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef',1,'graph::is_graph_bipartite::Graph::n'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6',1,'range_queries::fenwick_tree::n']]], ['neighbors_2',['neighbors',['../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a',1,'graph::Graph']]], ['next_3',['next',['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e',1,'data_structures::linked_list::Node::next'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77',1,'operations_on_datastructures::circular_linked_list::Node::next'],['../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd',1,'others::Cache::D_Node::next'],['../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f',1,'list::next'],['../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1',1,'ListNode::next'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a',1,'search::sublist_search::Node::next']]],