template<typename TAllocator, typename T, typename TNodeHandler,
Recycling TRecycling>
struct alib::containers::detail::StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::Node
This is the "final" internal node type, just adds a field of template type T to its base class.
Objects of this type cannot be received directly, and all interfaces are available via public type Cursor only, which holds a pointer to an object of this class.
Definition at line 366 of file stringtreebase.inl.
|
|
| Node (const Node &)=delete |
| | Deleted copy constructor.
|
| template<typename... TArgs> |
| | Node (const NodeKey &pKey, TArgs &&... args) |
|
| Node (Node &&)=delete |
| | Deleted move constructor.
|
| template<typename... TArgs> |
| | Node (NodeBase *pParent, const NameType &pName, TArgs &&... args) |
| | NodeBase (const NodeKey &pKey) |
| | NodeBase (NodeBase *pParent, const NameType &pName) |
| strings::TAString< CharacterType, lang::HeapAllocator > & | assemblePath (strings::TAString< CharacterType, lang::HeapAllocator > &target, const NodeBase *childNode, const NodeBase *maxParent, CharacterType separatorChar) const |
| uinteger | deleteChild (StringTreeBase *tree, NodeBase *child) |
| uinteger | deleteChildren (StringTreeBase *tree) |
| int | depth () const |
| int | distance (const NodeBase *other) const |
| NodeBase * | findChild (StringTreeBase *tree, const NameType &childName) |
| template<typename... TArgs> |
| std::pair< NodeBase *, bool > | findOrCreateChild (StringTreeBase *tree, const NameType &childName, TArgs &&... args) |
| bool | isRoot () const |
|
| BidiNodeBase () noexcept=default |
| | Default constructor. (Does not initialize the pointer!).
|
| void | addBefore (NodeBase *elem) noexcept |
| void | addBehind (NodeBase *elem) noexcept |
| BidiNodeBase & | operator= (const BidiNodeBase &)=delete |
| NodeBase * | prev () const noexcept |
| void | remove () noexcept |
| | Unhooks this node from a list.
|
|
| SidiNodeBase () noexcept=default |
| | Default constructor. (Does not initialize the pointer.).
|
| NodeBase * | addBehind (NodeBase *elem) noexcept |
| integer | count (SidiNodeBase *end=nullptr) const noexcept |
| bool | hasNext () const |
| void | next (SidiNodeBase *p) |
| SidiNodeBase & | operator= (const SidiNodeBase &)=delete |
| bool | pointsTo (const SidiNodeBase *elem) const |
| NodeBase * | removeNext () noexcept |
| NodeBase * | removeRangeBehind (NodeBase *last) noexcept |
| | NodeKey (NodeBase *pParent, const NameType &pName) |