ALib C++ Library
Library Version: 2402 R1
Documentation generated by doxygen
Loading...
Searching...
No Matches
StringTreeBase< T, TNodeMaintainer, TRecycling >::Node Member List

This is the complete list of members for StringTreeBase< T, TNodeMaintainer, TRecycling >::Node, including all inherited members.

addBefore(NodeBase *elem)BidiNodeBase< NodeBase >inline
addBehind(NodeBase *elem)BidiNodeBase< NodeBase >inline
assemblePath(AString &target, const NodeBase *childNode, const NodeBase *maxParent, character separatorChar) constStringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBaseinline
BidiNodeBase() noexcept=defaultBidiNodeBase< NodeBase >
BidiNodeBase(const BidiNodeBase &)=deleteBidiNodeBase< NodeBase >
BidiNodeBase(BidiNodeBase &&) noexcept=defaultBidiNodeBase< NodeBase >
BidiNodeBase(NodeBase *next, NodeBase *prev) noexceptBidiNodeBase< NodeBase >inline
childrenStringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBase
count(SidiNodeBase *end=nullptr) constSidiNodeBase< NodeBase >inline
dataStringTreeBase< T, TNodeMaintainer, TRecycling >::Node
deleteChild(StringTreeBase *tree, NodeBase *child)StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBaseinline
deleteChildren(StringTreeBase *tree)StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBaseinline
depth() constStringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBaseinline
findChild(StringTreeBase *tree, const NameType &childName)StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBaseinline
findOrCreateChild(StringTreeBase *tree, const NameType &childName, TArgs &&... args)StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBaseinline
FWDNode typedefBidiNodeBase< NodeBase >
hasNext() constSidiNodeBase< NodeBase >inline
isRoot() constStringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBaseinline
nameStringTreeBase< T, TNodeMaintainer, TRecycling >::NodeKey
next(SidiNodeBase *p)SidiNodeBase< NodeBase >inline
next() constSidiNodeBase< NodeBase >inline
Node(const Node &)=deleteStringTreeBase< T, TNodeMaintainer, TRecycling >::Node
Node(Node &&)=deleteStringTreeBase< T, TNodeMaintainer, TRecycling >::Node
Node(const NodeKey &pKey, TArgs &&... args)StringTreeBase< T, TNodeMaintainer, TRecycling >::Nodeinline
Node(NodeBase *pParent, const NameType &pName, TArgs &&... args)StringTreeBase< T, TNodeMaintainer, TRecycling >::Nodeinline
NodeBase(const NodeKey &pKey)StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBaseinline
NodeBase(NodeBase *pParent, const NameType &pName)StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBaseinline
NodeKey(NodeBase *pParent, const NameType &pName)StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeKeyinline
operator=(const BidiNodeBase &)=deleteBidiNodeBase< NodeBase >
operator=(BidiNodeBase &&) noexcept=defaultBidiNodeBase< NodeBase >
SidiNodeBase< NodeBase >::operator=(const SidiNodeBase &)=deleteSidiNodeBase< NodeBase >
SidiNodeBase< NodeBase >::operator=(SidiNodeBase &&) noexcept=defaultSidiNodeBase< NodeBase >
parentStringTreeBase< T, TNodeMaintainer, TRecycling >::NodeKey
pnextSidiNodeBase< NodeBase >
pointsTo(const SidiNodeBase *elem) constSidiNodeBase< NodeBase >inline
pprevBidiNodeBase< NodeBase >
prev() constBidiNodeBase< NodeBase >inline
prev(BidiNodeBase *newPrev)BidiNodeBase< NodeBase >inline
qtyChildrenStringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBase
remove()BidiNodeBase< NodeBase >inline
remove(NodeBase *last)BidiNodeBase< NodeBase >inline
removeNext()SidiNodeBase< NodeBase >inline
removeRangeBehind(NodeBase *last)SidiNodeBase< NodeBase >inline
SidiNodeBase() noexcept=defaultSidiNodeBase< NodeBase >
SidiNodeBase(const SidiNodeBase &)=deleteSidiNodeBase< NodeBase >
SidiNodeBase(SidiNodeBase &&) noexcept=defaultSidiNodeBase< NodeBase >
SidiNodeBase(NodeBase *next) noexceptSidiNodeBase< NodeBase >inline