+
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 eab0e9648..de2d632ba 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
@@ -238,7 +238,7 @@ static constexpr uint8_t E
55 endOfWord = node.endOfWord;
56 frequency = node.frequency;
57 }
-for std::vector Definition: avltree.cpp:13 Definition: avltree.cpp:13 | data [MAX] = {1, 1
node hashtab[HASHMAX] array of nodes Definition: hash_search.cpp:35 for std::vector Definition: avltree.cpp:13 Definition: avltree.cpp:13
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html
index fc78084b8..91acfc227 100644
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html
+++ b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html
@@ -715,7 +715,7 @@ template<typename X >
479 }
void update(int p, X v) Update the value at a node. Definition: heavy_light_decomposition.cpp:293 for std::vector Definition: avltree.cpp:13 Definition: avltree.cpp:13
diff --git a/d3/d09/node_8hpp.html b/d3/d09/node_8hpp.html
new file mode 100644
index 000000000..75fa46c98
--- /dev/null
+++ b/d3/d09/node_8hpp.html
@@ -0,0 +1,259 @@
+
+
+
+
+
+
+
+ Algorithms_in_C++: data_structures/node.hpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ |
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Loading...
+ Searching...
+ No Matches
+
+
+
+
+
+
+
+
+ Provides Node class and related utilities.
+More...
+ #include <iostream>
+#include <memory>
+#include <vector>
+
+ Go to the source code of this file.
+
+
+ Provides Node class and related utilities.
+
+
+ ◆ display_all()
+
+
+
+
+template<typename Node >
+
+
+ | void display_all |
+ ( |
+ const Node *const |
+ inNode | ) |
+ |
+
+
+
+ 31 {
+ 32 traverse(inNode,
+ 33 []( const Node& curNode) { std::cout << curNode.data << " "; });
+ 34}
+
+ Definition: linkedlist_implentation_usingarray.cpp:14
+
+
+
+
+ ◆ push_all_to_vector()
+
+
+
+
+template<typename Node >
+
+
+ | std::vector< typename Node::value_type > push_all_to_vector |
+ ( |
+ const Node *const |
+ inNode, |
+
+
+ |
+ |
+ const std::size_t |
+ expected_size = 0 |
+
+
+ |
+ ) |
+ | |
+
+
+
+ 38 {
+
+
+ 41 traverse(inNode,
+ 42 [&res]( const Node& curNode) { res. push_back(curNode.data); });
+ 43 return res;
+ 44}
+
+
+
+
+
+
+
+ ◆ traverse()
+
+
+
+
+template<typename Node , typename Action >
+
+
+ | void traverse |
+ ( |
+ const Node *const |
+ inNode, |
+
+
+ |
+ |
+ const Action & |
+ action |
+
+
+ |
+ ) |
+ | |
+
+
+
+ 23 {
+ 24 if (inNode) {
+ 25 action(*inNode);
+ 26 traverse(inNode->next.get(), action);
+ 27 }
+ 28}
+
+
+
+
+
+
+
+
+
diff --git a/d3/d09/node_8hpp.js b/d3/d09/node_8hpp.js
new file mode 100644
index 000000000..daa92726f
--- /dev/null
+++ b/d3/d09/node_8hpp.js
@@ -0,0 +1,4 @@
+var node_8hpp =
+[
+ [ "Node< ValueType >", "db/d8b/struct_node.html", null ]
+];
\ No newline at end of file
diff --git a/d3/d09/node_8hpp_source.html b/d3/d09/node_8hpp_source.html
new file mode 100644
index 000000000..8df0b8412
--- /dev/null
+++ b/d3/d09/node_8hpp_source.html
@@ -0,0 +1,166 @@
+
+
+
+
+
+
+
+ Algorithms_in_C++: data_structures/node.hpp Source File
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ |
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Loading...
+ Searching...
+ No Matches
+
+
+
+
+
+
+
+ Go to the documentation of this file.
+
+
+
+ 5#ifndef DATA_STRUCTURES_NODE_HPP_
+ 6#define DATA_STRUCTURES_NODE_HPP_
+
+
+
+
+
+
+
+
+ 15template < class ValueType>
+
+ 17 using value_type = ValueType;
+
+
+
+
+ 22template < typename Node, typename Action>
+ 23void traverse( const Node* const inNode, const Action& action) {
+
+
+ 26 traverse(inNode->next.get(), action);
+
+
+
+ 30template < typename Node>
+ 31void display_all( const Node* const inNode) {
+
+ 33 []( const Node& curNode) { std::cout << curNode.data << " "; });
+
+
+ 36template < typename Node>
+
+
+
+
+
+ 42 [&res]( const Node& curNode) { res. push_back(curNode.data); });
+
+
+
+
+
+
+
+
+
+ Definition: linkedlist_implentation_usingarray.cpp:14
+
+
+
+
+
+
+
diff --git a/d3/d26/binary__search__tree_8cpp.html b/d3/d26/binary__search__tree_8cpp.html
index dc3a322df..7e8af0953 100644
--- a/d3/d26/binary__search__tree_8cpp.html
+++ b/d3/d26/binary__search__tree_8cpp.html
@@ -117,8 +117,7 @@ Include dependency graph for binary_search_tree.cpp:
-
-
- Kind front() Definition: queue.h:61
+
+
+ value_type front() const Definition: queue.hpp:72 |
49 }
50 }
51}
-for std::vector
Definition: avltree.cpp:13
Definition: avltree.cpp:13
125 {
-
+
128 int value;
129 int ch;
diff --git a/d3/d26/binary__search__tree_8cpp.js b/d3/d26/binary__search__tree_8cpp.js
index 5e4431e11..a8be3a140 100644
--- a/d3/d26/binary__search__tree_8cpp.js
+++ b/d3/d26/binary__search__tree_8cpp.js
@@ -1,5 +1,5 @@
var binary__search__tree_8cpp =
[
- [ "node< Kind >", "d5/da1/structnode.html", "d5/da1/structnode" ],
+ [ "node", "d5/da1/structnode.html", null ],
[ "Queue", "dc/db5/struct_queue.html", null ]
];
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html
index b52c92bca..42e88a32c 100644
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html
@@ -631,7 +631,7 @@ Here is the call graph for this function:
631}
Node * SplitNode(Node *node)
Split a 4-node to 1 parent and 2 children, and return the parent node.
Definition: tree_234.cpp:745
void MergeNodeNotFull(Node *dst_node, Node *node)
Merge node to a not-full target node.
Definition: tree_234.cpp:730
-
for std::vector
Definition: avltree.cpp:13
+
Definition: avltree.cpp:13
diff --git a/d3/dbb/class_cycle_check.html b/d3/dbb/class_cycle_check.html
index 416d6683e..20da043c4 100644
--- a/d3/dbb/class_cycle_check.html
+++ b/d3/dbb/class_cycle_check.html
@@ -247,7 +247,7 @@ Static Private Member Functions
Definition: hash_search.cpp:29
-
for std::vector
Definition: avltree.cpp:13
+
Definition: avltree.cpp:13