Core::NodeTree
Container representing a tree of nodes connected together using a particular type of connections. More...
#include "Core/Nodes/Iterators.h"
Public Functions
Name | |
---|---|
NodeTree(Node * root, int connectionType =-1) | |
TreeIterator | begin()<br>Get a node iterator pointing to the root of this node tree. |
std::vector< Node * > | collect()<br>Collect all nodes in the tree and return them as a std::vector of non-owning raw pointers. |
TreeIterator | end()<br>Get a node iterator pointing to an element following the last element of this node range. |
Detailed Description
class Core::NodeTree;
class Core::NodeTree;
Container representing a tree of nodes connected together using a particular type of connections.
The tree is defined by a single root node and consists of all its children. The root node itself can have parents, but those aren't considered part of the tree (hence a sub tree can be represented).
Public Functions Documentation
function NodeTree
inline NodeTree(
Node * root,
int connectionType =-1
)
inline NodeTree(
Node * root,
int connectionType =-1
)
function begin
inline TreeIterator begin()
inline TreeIterator begin()
Get a node iterator pointing to the root of this node tree.
function collect
inline std::vector< Node * > collect()
inline std::vector< Node * > collect()
Collect all nodes in the tree and return them as a std::vector of non-owning raw pointers.
This operation iterates over the underlying tree iterator and collects all it's elements.
function end
inline TreeIterator end()
inline TreeIterator end()
Get a node iterator pointing to an element following the last element of this node range.
Updated on 2025-05-31 at 12:55:31 +0000