Contiguous tree representation optimized for depth-first traversal.
More...
#include <VectorTree.h>
|
| size_t | find_node_index (const std::string &node_name) |
| | Find index of a node by name.
|
| |
| bool | insert (NodeType node, const std::string &parent_name) |
| | Insert a node.
|
| |
|
|
std::vector< NodeType > | nodes |
| |
template<class NodeType>
class eeng::VectorTree< NodeType >
Contiguous tree representation optimized for depth-first traversal.
- Template Parameters
-
| NodeType | Node type, should inherit from TreeNode Nodes are organized in pre-order, which means that the first child of a node is located directly after the node. Each node has information about number children, stride of its branch, and offset from its parent. |
◆ find_node_index()
template<class NodeType >
| size_t eeng::VectorTree< NodeType >::find_node_index |
( |
const std::string & | node_name | ) |
|
|
inline |
Find index of a node by name.
- Parameters
-
| node_name | Node name to search for |
- Returns
- Index Node index
◆ insert()
template<class NodeType >
| bool eeng::VectorTree< NodeType >::insert |
( |
NodeType | node, |
|
|
const std::string & | parent_name ) |
|
inline |
Insert a node.
- Parameters
-
| node | Node to insert |
| parent | Name of parent node. If empty, node is inserted as a root |
- Returns
- True if insertion was successfull, false otherwise
The documentation for this class was generated from the following file:
