a |
l |
p |
b |
f |
q |
c |
g |
q |
t |
m |
h |
r |
r |
d |
n |
s |
s |
e |
i |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::tree_234::Tree234 Class Reference
+
+
+
+
+
+
The documentation for this class was generated from the following file:
+2-3-4 tree class + More...
+
+Collaboration diagram for data_structures::tree_234::Tree234:
+
+[legend]
+
+
++Public Member Functions | |
| + | Tree234 (const Tree234 &)=delete |
| + | Tree234 (const Tree234 &&)=delete |
| +Tree234 & | operator= (const Tree234 &)=delete |
| +Tree234 & | operator= (const Tree234 &&)=delete |
| void | Insert (int64_t item) |
| Insert item to tree. More... | |
| bool | Remove (int64_t item) |
| Remove item from tree. More... | |
| void | Traverse () |
| In-order traverse. More... | |
| void | Print (const char *file_name=nullptr) |
| Print tree into a dot file. More... | |
+Private Member Functions | |
| void | InsertPreSplit (int64_t item) |
| A insert implementation of pre-split. More... | |
| void | InsertPostMerge (int64_t item) |
| A insert implementation of post-merge. More... | |
| Node * | Insert (Node *tree, int64_t item) |
| A helper function used by post-merge insert. More... | |
| Node * | MergeNode (Node *dst_node, Node *node) |
| A helper function used during post-merge insert. More... | |
| void | MergeNodeNotFull (Node *dst_node, Node *node) |
| Merge node to a not-full target node. More... | |
| Node * | SplitNode (Node *node) |
| Split a 4-node to 1 parent and 2 children, and return the parent node. More... | |
| int64_t | GetTreeMaxItem (Node *tree) |
| Get the max item of the tree. More... | |
| int64_t | GetTreeMinItem (Node *tree) |
| Get the min item of the tree. More... | |
| bool | TryLeftRotate (Node *parent, Node *to_child) |
| A handy function to try if we can do a left rotate to the target node. More... | |
| bool | TryRightRotate (Node *parent, Node *to_child) |
| A handy function to try if we can do a right rotate to the target node. More... | |
| void | RightRotate (Node *parent, int8_t index) |
| Do the actual right rotate operation. More... | |
| void | LeftRotate (Node *parent, int8_t index) |
| Do the actual left rotate operation. More... | |
| bool | RemovePreMerge (Node *node, int64_t item) |
| Main function implement the pre-merge remove operation. More... | |
| Node * | Merge (Node *parent, int8_t index) |
| Merge the item at index of the parent node, and its left and right child. More... | |
| void | DeleteNode (Node *tree) |
| Recursive release the tree. More... | |
| void | Traverse (Node *tree) |
| In-order traverse the tree, print items. More... | |
| void | PrintNode (std::ofstream &ofs, Node *node, int64_t parent_index, int64_t index, int8_t parent_child_index) |
| Print the tree to a dot file. You can convert it to picture with graphviz. More... | |
+Private Attributes | |
| +Node * | root_ {nullptr} |
| root node of the tree | |
Detailed Description
+2-3-4 tree class
+Member Function Documentation
+ +◆ DeleteNode()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+Recursive release the tree.
+- Parameters
-
+
+
+tree root node of the tree to delete
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ GetTreeMaxItem()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+Get the max item of the tree.
+- Parameters
-
+
+
+tree the tree we will get item from
+
- Returns
- max item of the tree
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ GetTreeMinItem()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+Get the min item of the tree.
+- Parameters
-
+
+
+tree the tree we will get item from
+
- Returns
- min item of the tree
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ Insert() [1/2]
+ +
+
+
+
+
+
+
| void data_structures::tree_234::Tree234::Insert | +( | +int64_t | +item | ) | ++ |
+
+
+Insert item to tree.
+- Parameters
-
+
+
+item item to insert
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ Insert() [2/2]
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+A helper function used by post-merge insert.
+- Parameters
-
+
+
+tree tree where to insert item item item to insert
+
- Returns
- the node that split as the parent when overflow happen
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ InsertPostMerge()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+A insert implementation of post-merge.
+- Parameters
-
+
+
+item item to insert
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ InsertPreSplit()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+A insert implementation of pre-split.
+- Parameters
-
+
+
+item item to insert
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ LeftRotate()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+Do the actual left rotate operation.
+Given parent node, and the pivot item index, the left rotate operation is uniquely identified. The function assume the requirements are fulfilled and won't do any extra check. This function is call by TryLeftRotate(), and the condition checking should be done before call it.
+- Parameters
-
+
+
+parent the parent node in this right rotate operation index the pivot item index of this right rotate operation.
+
+
+
+
+
+
+
+
+
+
+
+
+
+◆ Merge()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+Merge the item at index of the parent node, and its left and right child.
+the left and right child node must be 2-node. The 3 items will be merged into a 4-node. In our case the parent can be a 2-node iff it is the root. Otherwise, it must be 3-node or 4-node.
+- Parameters
-
+
+
+parent the parent node in the merging operation index the item index of the parent node that involved in the merging
+
- Returns
- the merged 4-node
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ MergeNode()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+A helper function used during post-merge insert.
+When the inserting leads to overflow, it will split the node to 1 parent and 2 children. The parent will be merged to its origin parent after that. This is the function to complete this task. So the param node is always a 2-node.
+- Parameters
-
+
+
+dst_node the target node we will merge node to, can be type of 2-node, 3-node or 4-node node the source node we will merge from, type must be 2-node
+
- Returns
- overflow node of this level
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ MergeNodeNotFull()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+Merge node to a not-full target node.
+Since the target node is not-full, no overflow will happen. So we have nothing to return.
+- Parameters
-
+
+
+dst_node the target not-full node, that is the type is either 2-node or 3-node, but not 4-node node the source node we will merge from, type must be 2-node
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ Print()
+ +
+
+
+
+
+
+
| void data_structures::tree_234::Tree234::Print | +( | +const char * | +file_name = nullptr | ) | ++ |
+
+
+Print tree into a dot file.
+- Parameters
-
+
+
+file_name output file name, if nullptr then use "out.dot" as default
+
This is a helper structure to do a level order traversal to print the tree.
+< tree node
+< node index of level order that used when draw the link between child and parent
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ PrintNode()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+Print the tree to a dot file. You can convert it to picture with graphviz.
+- Parameters
-
+
+
+ofs output file stream to print to node current node to print parent_index current node's parent node index, this is used to draw the link from parent to current node index current node's index of level order which is used to name the node in dot file parent_child_index the index that current node in parent's children array, range in [0,4), help to locate the start position of the link between nodes
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+◆ Remove()
+ +
+
+
+
+
+
+
| bool data_structures::tree_234::Tree234::Remove | +( | +int64_t | +item | ) | ++ |
+
+
+Remove item from tree.
+- Parameters
-
+
+
+item item to remove
+
- Returns
- true if item found and removed, false otherwise
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ RemovePreMerge()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+Main function implement the pre-merge remove operation.
+- Parameters
-
+
+
+node the tree to remove item from item item to remove
+
- Returns
- true if remove success, false otherwise
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ RightRotate()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+Do the actual right rotate operation.
+Given parent node, and the pivot item index, the right rotate operation is uniquely identified. The function assume the requirements are fulfilled and won't do any extra check. This function is call by TryRightRotate(), and the condition checking should be done before call it.
+- Parameters
-
+
+
+parent the parent node in this right rotate operation index the pivot item index of this right rotate operation.
+
+
+
+
+
+
+
+
+
+
+
+
+
+◆ SplitNode()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+Split a 4-node to 1 parent and 2 children, and return the parent node.
+- Parameters
-
+
+
+node the node to split, it must be a 4-node
+
- Returns
- split parent node
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+◆ Traverse() [1/2]
+ +
+
+
+
+
+
+
+| void data_structures::tree_234::Tree234::Traverse | +( | +) | ++ |
◆ Traverse() [2/2]
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+In-order traverse the tree, print items.
+- Parameters
-
+
+
+tree tree to traverse
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ TryLeftRotate()
+ +
+
+
+
+
+
+
+
|
+ +private | +
+
+
+A handy function to try if we can do a left rotate to the target node.
+Given two node, the parent and the target child, the left rotate operation is uniquely identified. The source node must be the right sibling of the target child. The operation can be successfully done if the to_child has a right sibling and its right sibling is not 2-node.
+- Parameters
-
+
+
+parent the parent node in this left rotate operation to_child the target child of this left rotate operation. In our case, this node is always 2-node
+
- Returns
- true if we successfully do the rotate. false if the requirements are not fulfilled.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ TryRightRotate()
+ +
+
+
+
+
+
+
|
+ +private | +
+
+
+A handy function to try if we can do a right rotate to the target node.
+Given two node, the parent and the target child, the right rotate operation is uniquely identified. The source node must be the left sibling of the target child. The operation can be successfully done if the to_child has a left sibling and its left sibling is not 2-node.
+- Parameters
-
+
+
+parent the parent node in this right rotate operation to_child the target child of this right rotate operation. In our case, it is always 2-node
+
- Returns
- true if we successfully do the rotate. false if the requirements are not fulfilled.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+The documentation for this class was generated from the following file:
-
+
- data_structures/tree_234.cpp +
bool TryLeftRotate(Node *parent, Node *to_child)
A handy function to try if we can do a left rotate to the target node.
Definition: tree_234.cpp:778
void RightRotate(Node *parent, int8_t index)
Do the actual right rotate operation.
Definition: tree_234.cpp:845
void LeftRotate(Node *parent, int8_t index)
Do the actual left rotate operation.
Definition: tree_234.cpp:869
T get(T... args)
Definition: avltree.cpp:13
struct list node
STL class.
T reset(T... args)
void Traverse()
In-order traverse.
Definition: tree_234.cpp:562
Definition: linkedlist_implentation_usingarray.cpp:14
Node * MergeNode(Node *dst_node, Node *node)
A helper function used during post-merge insert.
Definition: tree_234.cpp:700
void DeleteNode(Node *tree)
Recursive release the tree.
Definition: tree_234.cpp:547
int64_t GetTreeMaxItem(Node *tree)
Get the max item of the tree.
Definition: tree_234.cpp:1098
STL class.
T close(T... args)
void InsertPreSplit(int64_t item)
A insert implementation of pre-split.
Definition: tree_234.cpp:585
void Insert(int64_t item)
Insert item to tree.
Definition: tree_234.cpp:655
T open(T... args)
Node * Merge(Node *parent, int8_t index)
Merge the item at index of the parent node, and its left and right child.
Definition: tree_234.cpp:895
void MergeNodeNotFull(Node *dst_node, Node *node)
Merge node to a not-full target node.
Definition: tree_234.cpp:730
void PrintNode(std::ofstream &ofs, Node *node, int64_t parent_index, int64_t index, int8_t parent_child_index)
Print the tree to a dot file. You can convert it to picture with graphviz.
Definition: tree_234.cpp:1226
bool TryRightRotate(Node *parent, Node *to_child)
A handy function to try if we can do a right rotate to the target node.
Definition: tree_234.cpp:813
int64_t GetTreeMinItem(Node *tree)
Get the min item of the tree.
Definition: tree_234.cpp:1115
T min(T... args)
T endl(T... args)
T left(T... args)
bool RemovePreMerge(Node *node, int64_t item)
Main function implement the pre-merge remove operation.
Definition: tree_234.cpp:937
Node * SplitNode(Node *node)
Split a 4-node to 1 parent and 2 children, and return the parent node.
Definition: tree_234.cpp:745
Node * root_
root node of the tree
Definition: tree_234.cpp:538
T max(T... args)
STL class.
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.js b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.js
new file mode 100644
index 000000000..b8d7974d2
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.js
@@ -0,0 +1,31 @@
+var classdata__structures_1_1tree__234_1_1_tree234 =
+[
+ [ "Tree234", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a58d9c491d36e9499a5e757454418abd2", null ],
+ [ "Tree234", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac9099c95f6ff571169b1d8d6ad9ab57d", null ],
+ [ "Tree234", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aad307a836df0f2ba1ee2e82a48b83fef", null ],
+ [ "~Tree234", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac4e7d1eb145af5e18b11c26f94a01e0e", null ],
+ [ "DeleteNode", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855", null ],
+ [ "GetTreeMaxItem", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657", null ],
+ [ "GetTreeMinItem", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36", null ],
+ [ "Insert", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e", null ],
+ [ "Insert", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f", null ],
+ [ "InsertPostMerge", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703", null ],
+ [ "InsertPreSplit", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d", null ],
+ [ "LeftRotate", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e", null ],
+ [ "Merge", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9", null ],
+ [ "MergeNode", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805", null ],
+ [ "MergeNodeNotFull", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95", null ],
+ [ "operator=", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#abb8a213b152c15b2b155f7a3a4e56425", null ],
+ [ "operator=", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a205e5ad2882c7c618ab9d60e5b725284", null ],
+ [ "Print", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165", null ],
+ [ "PrintNode", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be", null ],
+ [ "Remove", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11", null ],
+ [ "RemovePreMerge", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4", null ],
+ [ "RightRotate", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9", null ],
+ [ "SplitNode", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9", null ],
+ [ "Traverse", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd", null ],
+ [ "Traverse", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a", null ],
+ [ "TryLeftRotate", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9", null ],
+ [ "TryRightRotate", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3", null ],
+ [ "root_", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36", null ]
+];
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.map
new file mode 100644
index 000000000..b027f963e
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.map
@@ -0,0 +1,18 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.md5
new file mode 100644
index 000000000..316c975ba
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.md5
@@ -0,0 +1 @@
+d58e222fb33fa0b11bebbadf2aa404f9
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.svg
new file mode 100644
index 000000000..0ad40eedb
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.svg
@@ -0,0 +1,386 @@
+
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph_org.svg
new file mode 100644
index 000000000..409aa5286
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph_org.svg
@@ -0,0 +1,298 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.map
new file mode 100644
index 000000000..b20d467c8
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.map
@@ -0,0 +1,11 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.md5
new file mode 100644
index 000000000..fe602c9e2
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.md5
@@ -0,0 +1 @@
+59f600087f8a69910f8dcf9ff48c12c0
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.svg
new file mode 100644
index 000000000..d6a91d4fb
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.svg
@@ -0,0 +1,244 @@
+
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph_org.svg
new file mode 100644
index 000000000..c1366aea5
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph_org.svg
@@ -0,0 +1,156 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.map
new file mode 100644
index 000000000..b2f9f7380
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.map
@@ -0,0 +1,12 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.md5
new file mode 100644
index 000000000..35b997934
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.md5
@@ -0,0 +1 @@
+7ac5081a4b5c78cea46e435f0a736aae
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg
new file mode 100644
index 000000000..868814eff
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg
@@ -0,0 +1,267 @@
+
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph_org.svg
new file mode 100644
index 000000000..0958c52e9
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph_org.svg
@@ -0,0 +1,179 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.map
new file mode 100644
index 000000000..92b832a2b
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.md5
new file mode 100644
index 000000000..9cda4d13f
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.md5
@@ -0,0 +1 @@
+26685d2b67471ba4e64c5f532b65e60b
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.svg
new file mode 100644
index 000000000..9775ef148
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.svg
@@ -0,0 +1,55 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.map
new file mode 100644
index 000000000..83bdd2d01
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.map
@@ -0,0 +1,7 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.md5
new file mode 100644
index 000000000..1e6e41da3
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.md5
@@ -0,0 +1 @@
+6d4eadd20efa10ca50cb4a00fbff61aa
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.svg
new file mode 100644
index 000000000..db7cfe31c
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.svg
@@ -0,0 +1,84 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.map
new file mode 100644
index 000000000..ae1eb2629
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.map
@@ -0,0 +1,9 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.md5
new file mode 100644
index 000000000..c7d8eae53
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.md5
@@ -0,0 +1 @@
+f49128167d7f74247f1da1ae6373cede
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.svg
new file mode 100644
index 000000000..8d682a868
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.svg
@@ -0,0 +1,119 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.map
new file mode 100644
index 000000000..9d43f8f6e
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.map
@@ -0,0 +1,22 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.md5
new file mode 100644
index 000000000..b14128f77
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.md5
@@ -0,0 +1 @@
+ebce3b0c3cff48832756c2feb50249e9
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.svg
new file mode 100644
index 000000000..c1ce74cd7
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.svg
@@ -0,0 +1,445 @@
+
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph_org.svg
new file mode 100644
index 000000000..008c1bfdc
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph_org.svg
@@ -0,0 +1,357 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.map
new file mode 100644
index 000000000..ce062bfb7
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.map
@@ -0,0 +1,21 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.md5
new file mode 100644
index 000000000..a477ce01a
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.md5
@@ -0,0 +1 @@
+1a975e1748532630553aa7d57164f43e
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.svg
new file mode 100644
index 000000000..071e3afdd
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.svg
@@ -0,0 +1,429 @@
+
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph_org.svg
new file mode 100644
index 000000000..f3f405ee8
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph_org.svg
@@ -0,0 +1,341 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.map
new file mode 100644
index 000000000..d3acdd9b0
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.md5
new file mode 100644
index 000000000..8f8c46b1f
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.md5
@@ -0,0 +1 @@
+318341c680aa903c87b567d9c96ba4fc
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.svg
new file mode 100644
index 000000000..033da9778
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.svg
@@ -0,0 +1,55 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.map
new file mode 100644
index 000000000..55d3b70fa
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.map
@@ -0,0 +1,12 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.md5
new file mode 100644
index 000000000..3ff4bca3b
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.md5
@@ -0,0 +1 @@
+b6818f8ee427ec1e8e0e87db79443f63
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.svg
new file mode 100644
index 000000000..0381a7cf9
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.svg
@@ -0,0 +1,260 @@
+
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph_org.svg
new file mode 100644
index 000000000..92859ffa2
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph_org.svg
@@ -0,0 +1,172 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.map
new file mode 100644
index 000000000..8b334014f
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.md5
new file mode 100644
index 000000000..33a6c6158
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.md5
@@ -0,0 +1 @@
+f56272b9d8f8d5420a3fbddf367c3e4d
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.svg
new file mode 100644
index 000000000..17ce94947
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.map
new file mode 100644
index 000000000..e5e980a7b
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.md5
new file mode 100644
index 000000000..565f92e1f
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.md5
@@ -0,0 +1 @@
+61d6ed4d4693ab1211f841de10864e87
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.svg
new file mode 100644
index 000000000..680ef6415
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.svg
@@ -0,0 +1,54 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.map
new file mode 100644
index 000000000..38489f1e7
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.map
@@ -0,0 +1,13 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.md5
new file mode 100644
index 000000000..4b12d73ef
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.md5
@@ -0,0 +1 @@
+955b6ffc668fb656c1e90ef2e5e669b8
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.svg
new file mode 100644
index 000000000..90efe348d
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.svg
@@ -0,0 +1,276 @@
+
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph_org.svg
new file mode 100644
index 000000000..d6386a49d
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph_org.svg
@@ -0,0 +1,188 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.map
new file mode 100644
index 000000000..59c366764
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.md5
new file mode 100644
index 000000000..fcee58d09
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.md5
@@ -0,0 +1 @@
+63e91fc7b69fa69c7d07f8b81cffb9fd
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.svg
new file mode 100644
index 000000000..0db985f8c
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.svg
@@ -0,0 +1,55 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.map
new file mode 100644
index 000000000..ba97c30e5
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.md5
new file mode 100644
index 000000000..dc4f5b384
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.md5
@@ -0,0 +1 @@
+200da935de00d91ce0235829520fc36c
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.svg
new file mode 100644
index 000000000..86faebc0a
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.svg
@@ -0,0 +1,55 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.map
new file mode 100644
index 000000000..eabae39a7
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.map
@@ -0,0 +1,8 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.md5
new file mode 100644
index 000000000..2e1fc4f95
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.md5
@@ -0,0 +1 @@
+238760087b008105369d253716d4c468
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.svg
new file mode 100644
index 000000000..c8a5800d9
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.svg
@@ -0,0 +1,197 @@
+
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph_org.svg
new file mode 100644
index 000000000..6096113ac
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph_org.svg
@@ -0,0 +1,109 @@
+
+
+
+
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.map
new file mode 100644
index 000000000..4a498966c
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.md5
new file mode 100644
index 000000000..155b59747
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.md5
@@ -0,0 +1 @@
+92acd11559ecffc94ad234d859224e35
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.svg
new file mode 100644
index 000000000..5987ed9b2
--- /dev/null
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.svg
@@ -0,0 +1,55 @@
+
+
+
+
+
diff --git a/d4/dc8/tree__234_8cpp__incl.map b/d4/dc8/tree__234_8cpp__incl.map
new file mode 100644
index 000000000..771fc9551
--- /dev/null
+++ b/d4/dc8/tree__234_8cpp__incl.map
@@ -0,0 +1,10 @@
+
diff --git a/d4/dc8/tree__234_8cpp__incl.md5 b/d4/dc8/tree__234_8cpp__incl.md5
new file mode 100644
index 000000000..90ec82a2b
--- /dev/null
+++ b/d4/dc8/tree__234_8cpp__incl.md5
@@ -0,0 +1 @@
+812b2ea8c8803704b332da9439430b1b
\ No newline at end of file
diff --git a/d4/dc8/tree__234_8cpp__incl.svg b/d4/dc8/tree__234_8cpp__incl.svg
new file mode 100644
index 000000000..0a4e8a8f9
--- /dev/null
+++ b/d4/dc8/tree__234_8cpp__incl.svg
@@ -0,0 +1,128 @@
+
+
+
+
+
diff --git a/d5/d3c/namespacedata__structures.html b/d5/d3c/namespacedata__structures.html
index de98f9aa3..e45f5fbd3 100644
--- a/d5/d3c/namespacedata__structures.html
+++ b/d5/d3c/namespacedata__structures.html
@@ -124,8 +124,11 @@ constexpr float -
+
+
- Generated by
1.8.20
+
Detailed Description
Data Structures algorithms.
+for std::to_string
Data-structure algorithms.
-Algorithms with data structures.
+Algorithms with data structures.
+for std::array for assert for std::ofstream for std::cout for std::unique_ptr for std::queue
+Algorithms with data structures
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+tree_234 Namespace Reference
+
+
+
diff --git a/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html b/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html
new file mode 100644
index 000000000..689f58b52
--- /dev/null
+++ b/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html
@@ -0,0 +1,136 @@
+
+
+
+
+
+
+
+-
+
+
- Generated by 1.8.20
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::tree_234::Node Member List
+
+
+This is the complete list of members for data_structures::tree_234::Node, including all inherited members.
+
+
+
+
diff --git a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.map b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.map
new file mode 100644
index 000000000..6ad4ffd67
--- /dev/null
+++ b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.map
@@ -0,0 +1,6 @@
+
diff --git a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.md5 b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.md5
new file mode 100644
index 000000000..3ceda7b80
--- /dev/null
+++ b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.md5
@@ -0,0 +1 @@
+e20696daf2a134c47cb5c1a10cdcfb06
\ No newline at end of file
diff --git a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg
new file mode 100644
index 000000000..4f3dbdde6
--- /dev/null
+++ b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg
@@ -0,0 +1,79 @@
+
+
+
+
+
diff --git a/d8/d95/vector__ops_8hpp_source.html b/d8/d95/vector__ops_8hpp_source.html
index 1de387f78..cc3aeb4a5 100644
--- a/d8/d95/vector__ops_8hpp_source.html
+++ b/d8/d95/vector__ops_8hpp_source.html
@@ -617,13 +617,16 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
-
+
- Generated by 1.8.20
+
Functions for Palindrome Partitioning algorithm.
int64_t GetMinItem()
get min item (leftmost) in the current node
Definition: tree_234.cpp:126
T srand(T... args)
void addEdge(std::vector< std::vector< std::pair< int, int >>> *adj, int u, int v, int w)
Function that add edge between two nodes or vertices of graph.
Definition: dijkstra.cpp:48
T max_element(T... args)
Node * GetLeftmostChild()
Get leftmose child of the current node.
Definition: tree_234.cpp:271
int Bidijkstra(std::vector< std::vector< std::pair< uint64_t, uint64_t >>> *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t >>> *adj2, uint64_t s, uint64_t t)
Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...
Definition: bidirectional_dijkstra.cpp:86
void uniform_random_initialization(std::vector< std::valarray< T >> &A, const std::pair< size_t, size_t > &shape, const T &low, const T &high)
Definition: vector_ops.hpp:166
T setprecision(T... args)
T resize(T... args)
bool Contains(int64_t item)
Check if item is in the node.
Definition: tree_234.cpp:92
T make_tuple(T... args)
T inner_product(T... args)
int m
m is the number of vertices on left side of Bipartite Graph
Definition: hopcroft_karp.cpp:68
Entry(int key=notPresent)
constructor
Definition: linear_probing_hash_table.cpp:36
void SetChild(int8_t index, Node *child)
Set child pointer to the position of index.
Definition: tree_234.cpp:259
T move(T... args)
std::vector< std::valarray< T > > operator/(const std::vector< std::valarray< T >> &A, const T &val)
Definition: vector_ops.hpp:365
std::vector< T > operator+(std::vector< T > const &A, std::vector< T > const &B)
Definition: ordinary_least_squares_regressor.cpp:204
int64_t GetMaxItem()
Get max item (rightmost) in the current node.
Definition: tree_234.cpp:120
int n
n is the number of vertices on right side of Bipartite Graph
Definition: hopcroft_karp.cpp:69
for io operations
bool putProber(const Entry &entry, int key)
Definition: linear_probing_hash_table.cpp:98
bool TryLeftRotate(Node *parent, Node *to_child)
A handy function to try if we can do a left rotate to the target node.
Definition: tree_234.cpp:778
std::valarray< T > pop_front(const std::valarray< T > &A)
Definition: vector_ops.hpp:102
An implementation of hash table using double hashing algorithm.
STL class.
STL class.
T find(T... args)
An implementation of hash table using quadratic probing algorithm.
void Print(const char *file_name=nullptr)
Print tree into a dot file.
Definition: tree_234.cpp:1131
std::array< int64_t, 3 > items
store items
Definition: tree_234.cpp:315
T size(T... args)
double fit(const std::vector< double > &x, const int &y)
Definition: adaline_learning.cpp:119
STL class.
Entry(int key=notPresent)
constructor
Definition: double_hash_hash_table.cpp:37
int64_t GetItem(int8_t index)
Get item of the \index index.
Definition: tree_234.cpp:133
void RightRotate(Node *parent, int8_t index)
Do the actual right rotate operation.
Definition: tree_234.cpp:845
NeuralNetwork load_model(const std::string &file_name)
Definition: neural_network.cpp:732
std::string scs(const std::string &str1, const std::string &str2)
Definition: shortest_common_supersequence.cpp:42
void LeftRotate(Node *parent, int8_t index)
Do the actual left rotate operation.
Definition: tree_234.cpp:869
static bool hasChildren(std::shared_ptr< TrieNode > node)
Definition: trie_modern.cpp:41
void populate_up()
Definition: lowest_common_ancestor.cpp:212
STL class.
T get(T... args)
void test_3d_classes(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:359
NeuralNetwork & operator=(const NeuralNetwork &model)=default
Definition: trie_modern.cpp:26
std::vector< std::valarray< T > > transpose(const std::vector< std::valarray< T >> &A)
Definition: vector_ops.hpp:382
T strerror(T... args)
void InsertPostMerge(int64_t item)
A insert implementation of post-merge.
Definition: tree_234.cpp:637
bool is_square(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:59
size_t hashFxn(int key)
Hash a key. Uses the STL library's std::hash() function.
Definition: linear_probing_hash_table.cpp:46
Trie implementation for small-case English alphabets a-z
Definition: trie_tree.cpp:25
T sort(T... args)
T reset(T... args)
std::ostream & operator<<(std::ostream &out, std::vector< std::valarray< T >> const &A)
Definition: vector_ops.hpp:32
DenseLayer & operator=(DenseLayer &&)=default
bool check_size_match(const std::vector< double > &x)
Definition: adaline_learning.cpp:196
T clear(T... args)
void add(int x, int h)
create and add a new node with a give value and at a given height
Definition: chaining.cpp:45
Node * GetItemLeftChild(int8_t item_index)
Get left child of item at item_index.
Definition: tree_234.cpp:278
void Traverse()
In-order traverse.
Definition: tree_234.cpp:562
int8_t count
track the current item count
Definition: tree_234.cpp:319
int linearProbe(int key, bool searching)
Definition: linear_probing_hash_table.cpp:55
std::vector< std::vector< T > > operator*(std::vector< std::vector< T >> const &A, std::vector< std::vector< T >> const &B)
Definition: ordinary_least_squares_regressor.cpp:78
size_t argmax(const std::vector< std::valarray< T >> &A)
Definition: vector_ops.hpp:307
static void test1()
simple test to insert a given array and delete some item, and print the tree
Definition: tree_234.cpp:1263
T tie(T... args)
Definition: linkedlist_implentation_usingarray.cpp:14
T push_back(T... args)
bool isEndofWord
identifier if a node is terminal node
Definition: trie_tree.cpp:30
bool Is34Node()
Check if node is a 3-node or 4-node, this is useful when we delete item from 2-3-4 tree.
Definition: tree_234.cpp:85
std::ostream & operator<<(std::ostream &out, std::vector< std::vector< T >> const &v)
Definition: ordinary_least_squares_regressor.cpp:22
static bool isCyclicDFS(Graph const &graph)
Definition: cycle_check_directed_graph.cpp:212
Node * GetNextPossibleChild(int64_t item)
Get next node which is possibly contains item.
Definition: tree_234.cpp:304
Node * GetItemRightChild(int8_t item_index)
Get right child of item at item_index.
Definition: tree_234.cpp:291
double dot_product(const std::array< double, 10 > &x, const std::array< double, 10 > &y, const int &c)
Definition: gram_schmidt.cpp:59
T stoi(T... args)
Definition: cycle_check_directed_graph.cpp:158
void evaluate(const std::vector< std::vector< std::valarray< double >>> &X, const std::vector< std::vector< std::valarray< double >>> &Y)
Definition: neural_network.cpp:606
Functions for 2–3–4 tree
Node * MergeNode(Node *dst_node, Node *node)
A helper function used during post-merge insert.
Definition: tree_234.cpp:700
void unit_matrix_initialization(std::vector< std::valarray< T >> &A, const std::pair< size_t, size_t > &shape)
Definition: vector_ops.hpp:193
std::vector< std::vector< int > > up
for every vertex stores a list of its ancestors by powers of two For each vertex, the first element o...
Definition: lowest_common_ancestor.cpp:206
std::vector< int > parent
Stores parent of every vertex and for root its own index. The root is technically not its own parent,...
Definition: lowest_common_ancestor.cpp:104
void DeleteNode(Node *tree)
Recursive release the tree.
Definition: tree_234.cpp:547
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
static bool isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)
Definition: cycle_check_directed_graph.cpp:170
RootedTree(const std::vector< std::pair< int, int > > &undirected_edges, int root_)
Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is ...
Definition: lowest_common_ancestor.cpp:93
static void tests()
Function to test the provided algorithm above.
Definition: bidirectional_dijkstra.cpp:199
int64_t GetTreeMaxItem(Node *tree)
Get the max item of the tree.
Definition: tree_234.cpp:1098
static void test2(int64_t n)
simple test to insert continuous number of range [0, n), and print the tree
Definition: tree_234.cpp:1281
T at(T... args)
STL class.
int direction(Point first_point, Point second_point, Point third_point)
Definition: line_segment_intersection.cpp:63
bool Is2Node()
Check if node is a 2-node.
Definition: tree_234.cpp:79
const double eta
learning rate of the algorithm
Definition: adaline_learning.cpp:207
T min_element(T... args)
void fit(const std::vector< std::vector< std::valarray< double >>> &X_, const std::vector< std::vector< std::valarray< double >>> &Y_, const int &epochs=100, const double &learning_rate=0.01, const size_t &batch_size=32, const bool &shuffle=true)
Definition: neural_network.cpp:485
int8_t GetCount()
Get the item count that current saved in the node.
Definition: tree_234.cpp:50
T c_str(T... args)
Various activation functions used in Neural network.
double sigmoid(const double &x)
Definition: neural_network.cpp:60
T top(T... args)
double relu(const double &x)
Definition: neural_network.cpp:74
Edge(unsigned int source, unsigned int destination)
Definition: cycle_check_directed_graph.cpp:40
T to_string(T... args)
Definition: prims_minimum_spanning_tree.cpp:9
Dynamic Programming algorithms.
STL class.
void addEdge(unsigned int source, unsigned int destination)
Definition: cycle_check_directed_graph.cpp:136
bool IsLeaf()
Check if node is a leaf.
Definition: tree_234.cpp:67
std::valarray< T > insert_element(const std::valarray< T > &A, const T &ele)
Definition: vector_ops.hpp:85
T close(T... args)
void InsertPreSplit(int64_t item)
A insert implementation of pre-split.
Definition: tree_234.cpp:585
std::vector< std::vector< std::valarray< double > > > __detailed_single_prediction(const std::vector< std::valarray< double >> &X)
Definition: neural_network.cpp:289
double square(const double &x)
Definition: neural_network.cpp:106
void Insert(int64_t item)
Insert item to tree.
Definition: tree_234.cpp:655
T erase(T... args)
Data Structures algorithms.
std::array< Node *, 4 > children
store the children pointers
Definition: tree_234.cpp:317
bool on_segment(Point first_point, Point second_point, Point third_point)
Definition: line_segment_intersection.cpp:75
bool is_bipartite()
function to add edges to our graph
Definition: is_graph_bipartite.cpp:106
Node * Merge(Node *parent, int8_t index)
Merge the item at index of the parent node, and its left and right child.
Definition: tree_234.cpp:895
DenseLayer(const int &neurons, const std::string &activation, const std::pair< size_t, size_t > &kernel_shape, const bool &random_kernel)
Definition: neural_network.cpp:141
std::vector< std::vector< int > > neighbors
for each vertex it stores a list indicies of its neighbors
Definition: lowest_common_ancestor.cpp:77
static constexpr uint8_t NUM_CHARS
Number of alphabets.
Definition: trie_tree.cpp:27
std::vector< std::vector< int > > adj
adj stores the graph as an adjacency list
Definition: is_graph_bipartite.cpp:56
void MergeNodeNotFull(Node *dst_node, Node *node)
Merge node to a not-full target node.
Definition: tree_234.cpp:730
uint8_t char_to_int(const char &ch) const
Convert a character to integer for indexing.
Definition: trie_tree.cpp:38
void fit_from_csv(const std::string &file_name, const bool &last_label, const int &epochs, const double &learning_rate, const bool &normalize, const int &slip_lines=1, const size_t &batch_size=32, const bool &shuffle=true)
Definition: neural_network.cpp:587
void print(uint32_t N, const std::vector< bool > &is_prime)
Definition: sieve_of_eratosthenes.cpp:44
void SetCount(int8_t c)
Set the item count of the node.
Definition: tree_234.cpp:61
void PrintNode(std::ofstream &ofs, Node *node, int64_t parent_index, int64_t index, int8_t parent_child_index)
Print the tree to a dot file. You can convert it to picture with graphviz.
Definition: tree_234.cpp:1226
NeuralNetwork()=default
Graph(unsigned int vertices, AdjList &&adjList)
Definition: cycle_check_directed_graph.cpp:76
Definition: neural_network.cpp:247
bool TryRightRotate(Node *parent, Node *to_child)
A handy function to try if we can do a right rotate to the target node.
Definition: tree_234.cpp:813
STL class.
T rand(T... args)
Functions for Jarvis’s algorithm.
std::vector< int > side
stores the side of the vertex
Definition: is_graph_bipartite.cpp:58
int save_2d_data(const char *fname, const std::vector< std::valarray< double >> &X)
Definition: kohonen_som_topology.cpp:65
int64_t GetTreeMinItem(Node *tree)
Get the min item of the tree.
Definition: tree_234.cpp:1115
An implementation of hash table using linear probing algorithm.
void test_lamniscate(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:277
T swap(T... args)
Definition: jarvis_algorithm.cpp:55
int InsertItem(int item)
Insert item to the proper position of the node and return the position index.
Definition: tree_234.cpp:163
void add_edge(T u, T v, bool bidir=true)
Definition: breadth_first_search.cpp:74
bool bfs()
This function checks for the possibility of augmented path availability.
Definition: hopcroft_karp.cpp:133
bool hamilton_cycle(const std::vector< std::vector< bool >> &routes)
Definition: hamiltons_cycle.cpp:30
bool deleteString(const std::string &str, int index)
Definition: trie_tree.cpp:134
Node * RemoveItemByIndex(int8_t index, bool keep_left)
Insert a value to the index position.
Definition: tree_234.cpp:217
DenseLayer(DenseLayer &&)=default
T endl(T... args)
std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:226
bool search(const std::shared_ptr< trie > &root, const std::string &str, int index)
Definition: trie_tree.cpp:56
std::pair< std::vector< std::vector< std::valarray< double > > >, std::vector< std::vector< std::valarray< double > > > > get_XY_from_csv(const std::string &file_name, const bool &last_label, const bool &normalize, const int &slip_lines=1)
Definition: neural_network.cpp:382
STL namespace.
std::vector< std::list< int > > adj
adj[u] stores adjacents of left side and 0 is used for dummy vertex
Definition: hopcroft_karp.cpp:73
T insert(T... args)
bool Remove(int64_t item)
Remove item from tree.
Definition: tree_234.cpp:929
NeuralNetwork & operator=(NeuralNetwork &&)=default
void save_model(const std::string &_file_name)
Definition: neural_network.cpp:652
bool RemovePreMerge(Node *node, int64_t item)
Main function implement the pre-merge remove operation.
Definition: tree_234.cpp:937
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
Definition: huffman.cpp:28
Definition: stack.h:26
Node * GetRightmostChild()
Get rightmose child of the current node.
Definition: tree_234.cpp:265
double dsigmoid(const double &x)
Definition: neural_network.cpp:67
double get_clock_diff(clock_t start_t, clock_t end_t)
Definition: kohonen_som_topology.cpp:577
int doubleHash(int key, bool searching)
Performs double hashing to resolve collisions.
Definition: double_hash_hash_table.cpp:71
Graph Algorithms.
T count(T... args)
void explore(const std::vector< std::vector< int >> *adj, int u, std::vector< bool > *visited)
Utility function for depth first seach algorithm this function explores the vertex which is passed in...
Definition: connected_components.cpp:59
Definition: knapsack.cpp:4
Node * SplitNode(Node *node)
Split a 4-node to 1 parent and 2 children, and return the parent node.
Definition: tree_234.cpp:745
T empty(T... args)
T assign(T... args)
bool search(const std::string &str, int index)
Definition: trie_tree.cpp:107
DenseLayer(const DenseLayer &layer)=default
std::vector< std::valarray< T > > operator*(const std::vector< std::valarray< T >> &A, const T &val)
Definition: vector_ops.hpp:347
void InsertItemByIndex(int8_t index, int64_t item, Node *with_child, bool to_left=true)
Insert a value to the index position.
Definition: tree_234.cpp:189
bool check(const std::string &s, const std::unordered_set< std::string > &strSet, int pos, std::vector< int > *dp)
Function that checks if the string passed in param can be segmented from position 'pos',...
Definition: word_break.cpp:80
int maxKnapsackValue(const int capacity, const std::array< int, n > &weight, const std::array< int, n > &value)
Picking up all those items whose combined weight is below given capacity and calculating value of tho...
Definition: 0_1_knapsack.cpp:51
T time(T... args)
T malloc(T... args)
Node * root_
root node of the tree
Definition: tree_234.cpp:538
T end(T... args)
int quadraticProbe(int key, bool searching)
Definition: quadratic_probing_hash_table.cpp:56
int8_t GetChildIndex(Node *child)
Get the child's index of the children array.
Definition: tree_234.cpp:237
Implementation of cutting a rod problem.
static int orientation(const Point &p, const Point &q, const Point &r)
Definition: jarvis_algorithm.cpp:133
int pal_part(const std::string &str)
Definition: palindrome_partitioning.cpp:45
STL class.
Node * GetChild(int8_t index)
Get the child pointer at position of index.
Definition: tree_234.cpp:252
Definition: line_segment_intersection.cpp:12
std::vector< std::valarray< T > > hadamard_product(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)
Definition: vector_ops.hpp:494
Class for representing graph as an adjacency list.
Definition: is_graph_bipartite.cpp:51
std::vector< int > pair_u
value of vertex 'u' ranges from 1 to m
Definition: hopcroft_karp.cpp:75
STL class.
bool IsFull()
Check if node is a full (4-node)
Definition: tree_234.cpp:73
T partition(T... args)
void SetItem(int8_t index, int64_t new_item)
Set item value at position of index.
Definition: tree_234.cpp:140
Definition: adaline_learning.cpp:46
T data(T... args)
void zeroes_initialization(std::vector< std::valarray< T >> &A, const std::pair< size_t, size_t > &shape)
Definition: vector_ops.hpp:213
T is_open(T... args)
STL class.
std::map< T, std::list< T > > adjacency_list
Definition: breadth_first_search.cpp:69
std::vector< float > operator/(std::vector< T > const &A, float const scalar)
Definition: ordinary_least_squares_regressor.cpp:174
void kohonen_som_tracer(const std::vector< std::valarray< double >> &X, std::vector< std::valarray< double >> *W, double alpha_min)
Definition: kohonen_som_trace.cpp:149
Various utility functions used in Neural network.
int8_t GetItemIndex(int64_t item)
Get the index of the item in the node, 0-based.
Definition: tree_234.cpp:107
bool dfs(int u)
This functions checks whether an augmenting path is available exists beginning with free vertex u.
Definition: hopcroft_karp.cpp:191
void addEdge(int u, int v)
Function that add an edge between two nodes or vertices of graph.
Definition: is_graph_bipartite.cpp:83
T eof(T... args)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+tree_234.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+A demo 2-3-4 tree implementation. +More...
+#include <array>+
#include <cassert>+
#include <fstream>+
#include <iostream>+
#include <memory>+
#include <queue>+
#include <string>+
+Include dependency graph for tree_234.cpp:
+
+
+
+
++Classes | |
| class | data_structures::tree_234::Node |
| 2-3-4 tree node class More... | |
| class | data_structures::tree_234::Tree234 |
| 2-3-4 tree class More... | |
+Namespaces | |
| data_structures | |
| Data Structures algorithms. | |
| tree_234 | |
| Functions for 2–3–4 tree | |
+Functions | |
| +static void | test1 () |
| simple test to insert a given array and delete some item, and print the tree | |
| static void | test2 (int64_t n) |
| simple test to insert continuous number of range [0, n), and print the tree More... | |
| int | main (int argc, char *argv[]) |
| Main function. More... | |
Detailed Description
+A demo 2-3-4 tree implementation.
+2–3–4 tree is a self-balancing data structure that is an isometry of red–black trees. Though we seldom use them in practice, we study them to understand the theory behind Red-Black tree. Please read following links for more infomation. 2–3–4 tree 2-3-4 Trees: A Visual Introduction We Only implement some basic and complicated operations in this demo. Other operations should be easy to be added.
+Function Documentation
+ +◆ main()
+ +
+
+
+
+
+
+
| int main | +( | +int | +argc, | +
| + | + | char * | +argv[] | +
| + | ) | ++ |
+
+
+Main function.
+- Parameters
-
+
+
+argc commandline argument count (ignored) argv commandline array of arguments (ignored)
+
- Returns
- 0 on exit
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ test2()
+ +
+
+
+
+
+
+
|
+ +static | +
+
+
+simple test to insert continuous number of range [0, n), and print the tree
+- Parameters
-
+
+
+n upper bound of the range number to insert
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+void Print(const char *file_name=nullptr)
Print tree into a dot file.
Definition: tree_234.cpp:1131
void Traverse()
In-order traverse.
Definition: tree_234.cpp:562
static void test1()
simple test to insert a given array and delete some item, and print the tree
Definition: tree_234.cpp:1263
T stoi(T... args)
static void test2(int64_t n)
simple test to insert continuous number of range [0, n), and print the tree
Definition: tree_234.cpp:1281
T to_string(T... args)
void Insert(int64_t item)
Insert item to tree.
Definition: tree_234.cpp:655
+
+
+
diff --git a/db/dbc/tree__234_8cpp.js b/db/dbc/tree__234_8cpp.js
new file mode 100644
index 000000000..02d33a20a
--- /dev/null
+++ b/db/dbc/tree__234_8cpp.js
@@ -0,0 +1,8 @@
+var tree__234_8cpp =
+[
+ [ "Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", "dd/d40/classdata__structures_1_1tree__234_1_1_node" ],
+ [ "Tree234", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html", "d3/d95/classdata__structures_1_1tree__234_1_1_tree234" ],
+ [ "main", "db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ],
+ [ "test1", "db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243", null ],
+ [ "test2", "db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342", null ]
+];
\ No newline at end of file
diff --git a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
new file mode 100644
index 000000000..965192fff
--- /dev/null
+++ b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
@@ -0,0 +1,42 @@
+
diff --git a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
new file mode 100644
index 000000000..4afab0782
--- /dev/null
+++ b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
@@ -0,0 +1 @@
+7af86b82c287411a00b90504692d1bcb
\ No newline at end of file
diff --git a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
new file mode 100644
index 000000000..706c615e4
--- /dev/null
+++ b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
@@ -0,0 +1,786 @@
+
+
+
+
+
+
diff --git a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
new file mode 100644
index 000000000..0e73d3a29
--- /dev/null
+++ b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
@@ -0,0 +1,698 @@
+
+
+
+
+
diff --git a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.map b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.map
new file mode 100644
index 000000000..f385dad36
--- /dev/null
+++ b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.map
@@ -0,0 +1,20 @@
+
diff --git a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.md5 b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.md5
new file mode 100644
index 000000000..f9e203f5c
--- /dev/null
+++ b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.md5
@@ -0,0 +1 @@
+aca61c6163d489dcf9126d517b845eb4
\ No newline at end of file
diff --git a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.svg b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.svg
new file mode 100644
index 000000000..12318c90b
--- /dev/null
+++ b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.svg
@@ -0,0 +1,389 @@
+
+
+
+
+
+
diff --git a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph_org.svg b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph_org.svg
new file mode 100644
index 000000000..a261c2005
--- /dev/null
+++ b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph_org.svg
@@ -0,0 +1,301 @@
+
+
+
+
+
diff --git a/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html b/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html
new file mode 100644
index 000000000..63b930d51
--- /dev/null
+++ b/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html
@@ -0,0 +1,137 @@
+
+
+
+
+
+
+
+-
+
+
- Generated by 1.8.20
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::tree_234::Tree234 Member List
+
+
+This is the complete list of members for data_structures::tree_234::Tree234, including all inherited members.
+
+
+
+
diff --git a/dd/d40/classdata__structures_1_1tree__234_1_1_node.html b/dd/d40/classdata__structures_1_1tree__234_1_1_node.html
new file mode 100644
index 000000000..fb3f7a26b
--- /dev/null
+++ b/dd/d40/classdata__structures_1_1tree__234_1_1_node.html
@@ -0,0 +1,1182 @@
+
+
+
+
+
+
+
+-
+
- Generated by 1.8.20
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::tree_234::Node Class Reference
+
+
+
+
+
The documentation for this class was generated from the following file:
+2-3-4 tree node class + More...
+
+Collaboration diagram for data_structures::tree_234::Node:
+
+[legend]
+
+
++Public Member Functions | |
| Node (int64_t item) | |
| Node constructor. More... | |
| int8_t | GetCount () |
| Get the item count that current saved in the node. More... | |
| void | SetCount (int8_t c) |
| Set the item count of the node. More... | |
| bool | IsLeaf () |
| Check if node is a leaf. More... | |
| bool | IsFull () |
| Check if node is a full (4-node) More... | |
| bool | Is2Node () |
| Check if node is a 2-node. More... | |
| bool | Is34Node () |
| Check if node is a 3-node or 4-node, this is useful when we delete item from 2-3-4 tree. More... | |
| bool | Contains (int64_t item) |
| Check if item is in the node. More... | |
| int8_t | GetItemIndex (int64_t item) |
| Get the index of the item in the node, 0-based. More... | |
| int64_t | GetMaxItem () |
| Get max item (rightmost) in the current node. More... | |
| int64_t | GetMinItem () |
| get min item (leftmost) in the current node More... | |
| int64_t | GetItem (int8_t index) |
| Get item of the \index index. More... | |
| void | SetItem (int8_t index, int64_t new_item) |
| Set item value at position of index. More... | |
| int | InsertItem (int item) |
| Insert item to the proper position of the node and return the position index. More... | |
| void | InsertItemByIndex (int8_t index, int64_t item, Node *with_child, bool to_left=true) |
| Insert a value to the index position. More... | |
| Node * | RemoveItemByIndex (int8_t index, bool keep_left) |
| Insert a value to the index position. More... | |
| int8_t | GetChildIndex (Node *child) |
| Get the child's index of the children array. More... | |
| Node * | GetChild (int8_t index) |
| Get the child pointer at position of index. More... | |
| void | SetChild (int8_t index, Node *child) |
| Set child pointer to the position of index. More... | |
| Node * | GetRightmostChild () |
| Get rightmose child of the current node. More... | |
| Node * | GetLeftmostChild () |
| Get leftmose child of the current node. More... | |
| Node * | GetItemLeftChild (int8_t item_index) |
| Get left child of item at item_index. More... | |
| Node * | GetItemRightChild (int8_t item_index) |
| Get right child of item at item_index. More... | |
| Node * | GetNextPossibleChild (int64_t item) |
| Get next node which is possibly contains item. More... | |
+Private Attributes | |
| +std::array< int64_t, 3 > | items |
| store items | |
| +std::array< Node *, 4 > | children |
| store the children pointers | |
| +int8_t | count = 0 |
| track the current item count | |
Detailed Description
+2-3-4 tree node class
+Constructor & Destructor Documentation
+ +◆ Node()
+ +
+
+
+
+
+
+
+
|
+ +inlineexplicit | +
Member Function Documentation
+ +◆ Contains()
+ +
+
+
+
+
+
+
+
+
|
+ +inline | +
◆ GetChild()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Get the child pointer at position of index.
+- Parameters
-
+
+
+index index of child to get
+
- Returns
- the child pointer
+
+◆ GetChildIndex()
+ +
+
+
+
+
+
+
+
+
|
+ +inline | +
◆ GetCount()
+ +
+
+
+
+
+
+
+
+
|
+ +inline | +
◆ GetItem()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Get item of the \index index.
+- Parameters
-
+
+
+index the item index to get
+
- Returns
- the item
+
+◆ GetItemIndex()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Get the index of the item in the node, 0-based.
+- Parameters
-
+
+
+item item to check
+
- Returns
- 0-based index of the item in the node, if not in the node, -1 is returned
◆ GetItemLeftChild()
+ +
+
+
+
+
+
+
+
+
|
+ +inline | +
◆ GetItemRightChild()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Get right child of item at item_index.
+- Parameters
-
+
+
+item_index index of the item whose right child to be get
+
- Returns
- right child of items[index]'s
◆ GetLeftmostChild()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Get leftmose child of the current node.
+- Returns
- the leftmost child
+
+◆ GetMaxItem()
+ +
+
+
+
+
+
+
+
+
|
+ +inline | +
◆ GetMinItem()
+ +
+
+
+
+
+
+
+
+
|
+ +inline | +
◆ GetNextPossibleChild()
+ +
+
+
+
+
+
+
+
+
|
+ +inline | +
◆ GetRightmostChild()
+ +
+
+
+
+
+
+
+
+
|
+ +inline | +
◆ InsertItem()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Insert item to the proper position of the node and return the position index.
+This is a helper function we use during insertion. Please mind that when insert a item, we aslo need to take care of two child pointers. One is the original child pointer at the insertion position. It can be placed as new item's either left child or right child. And the other is the new child that should be added. For our dedicated situation here, we choose to use the original child as the new item's left child, and add a null pointer to its right child. So after use the function, please update these two children pointer manually.
+- Parameters
-
+
+
+item value to be inserted to the node
+
- Returns
- index where item is inserted, caller can use this index to update its left and right child
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ InsertItemByIndex()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Insert a value to the index position.
+- Parameters
-
+
+
+index index where to insert item item value to insert with_child new added child pointer to_left true indicate adding with_child to new item's left child, otherwise to right child
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+◆ Is2Node()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Check if node is a 2-node.
+- Returns
- true if node is 2-node, otherwise false
+
+◆ Is34Node()
+ +
+
+
+
+
+
+
+
+
|
+ +inline | +
◆ IsFull()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Check if node is a full (4-node)
+- Returns
- true if node is full (4-node), false otherwise
+
+◆ IsLeaf()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Check if node is a leaf.
+- Returns
- true if node is leaf, false otherwise
+
+◆ RemoveItemByIndex()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Insert a value to the index position.
+- Parameters
-
+
+
+index index of the item to remove keep_left which child of the item to keep, true keep the left child, false keep the right child
+
- Returns
- the removed child pointer
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+◆ SetChild()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Set child pointer to the position of index.
+- Parameters
-
+
+
+index children index child pointer to set
+
+
+◆ SetCount()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+
+Set the item count of the node.
+This is only used when we spliting and merging node where we need to do some raw operation manually. In common inserting and removing operation the count is maintained automatically.
+- Parameters
-
+
+
+c the count to set
+
+
+◆ SetItem()
+ +
+
+
+
+
+
+
|
+ +inline | +
+
+
+Set item value at position of index.
+- Parameters
-
+
+
+index the index of the item to set new_item item value
+
The documentation for this class was generated from the following file:
-
+
- data_structures/tree_234.cpp +
bool Contains(int64_t item)
Check if item is in the node.
Definition: tree_234.cpp:92
std::array< int64_t, 3 > items
store items
Definition: tree_234.cpp:315
int8_t count
track the current item count
Definition: tree_234.cpp:319
Definition: linkedlist_implentation_usingarray.cpp:14
std::array< Node *, 4 > children
store the children pointers
Definition: tree_234.cpp:317
void InsertItemByIndex(int8_t index, int64_t item, Node *with_child, bool to_left=true)
Insert a value to the index position.
Definition: tree_234.cpp:189
bool IsFull()
Check if node is a full (4-node)
Definition: tree_234.cpp:73
+
+
+
diff --git a/dd/d40/classdata__structures_1_1tree__234_1_1_node.js b/dd/d40/classdata__structures_1_1tree__234_1_1_node.js
new file mode 100644
index 000000000..f3f05102b
--- /dev/null
+++ b/dd/d40/classdata__structures_1_1tree__234_1_1_node.js
@@ -0,0 +1,30 @@
+var classdata__structures_1_1tree__234_1_1_node =
+[
+ [ "Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670", null ],
+ [ "Contains", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f", null ],
+ [ "GetChild", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5f6d943abaac52a236fe5d945e9d0e25", null ],
+ [ "GetChildIndex", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37", null ],
+ [ "GetCount", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06", null ],
+ [ "GetItem", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3", null ],
+ [ "GetItemIndex", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629", null ],
+ [ "GetItemLeftChild", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a9ba4f652baa900f0634822ec380a6996", null ],
+ [ "GetItemRightChild", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a976998a7553ab92ef79cc04fac305e5b", null ],
+ [ "GetLeftmostChild", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a692a971c577511abdf7027e7e92a031b", null ],
+ [ "GetMaxItem", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57", null ],
+ [ "GetMinItem", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71", null ],
+ [ "GetNextPossibleChild", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a0f60199d0d175c248c67bfad9b9bdafe", null ],
+ [ "GetRightmostChild", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#abe9725b6422fd974642f9c9618b0f3be", null ],
+ [ "InsertItem", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb", null ],
+ [ "InsertItemByIndex", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956", null ],
+ [ "Is2Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631", null ],
+ [ "Is34Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18", null ],
+ [ "IsFull", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd", null ],
+ [ "IsLeaf", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8", null ],
+ [ "RemoveItemByIndex", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8384b8c0fdc8e5e443010d2eb1187847", null ],
+ [ "SetChild", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74", null ],
+ [ "SetCount", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1", null ],
+ [ "SetItem", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc", null ],
+ [ "children", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d", null ],
+ [ "count", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921", null ],
+ [ "items", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9", null ]
+];
\ No newline at end of file
diff --git a/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.map b/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.map
new file mode 100644
index 000000000..c0eb05cf7
--- /dev/null
+++ b/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.map
@@ -0,0 +1,6 @@
+
diff --git a/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.md5 b/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.md5
new file mode 100644
index 000000000..3f04c13b8
--- /dev/null
+++ b/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.md5
@@ -0,0 +1 @@
+61075ce66e20bb917fcff1c565223865
\ No newline at end of file
diff --git a/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.svg b/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.svg
new file mode 100644
index 000000000..fdb03a7f9
--- /dev/null
+++ b/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.svg
@@ -0,0 +1,71 @@
+
+
+
+
+
diff --git a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html
index 2a22e1091..4e1aee8d1 100644
--- a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html
+++ b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html
@@ -131,6 +131,9 @@ Files-
+
+
- Generated by 1.8.20
+
a-z a-z