| addBefore(NodeBase *elem) | BidiNodeBase< NodeBase > | inline |
| addBehind(NodeBase *elem) | BidiNodeBase< NodeBase > | inline |
| assemblePath(AString &target, const NodeBase *childNode, const NodeBase *maxParent, character separatorChar) const | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBase | inline |
| BidiNodeBase() noexcept=default | BidiNodeBase< NodeBase > | |
| BidiNodeBase(const BidiNodeBase &)=delete | BidiNodeBase< NodeBase > | |
| BidiNodeBase(BidiNodeBase &&) noexcept=default | BidiNodeBase< NodeBase > | |
| BidiNodeBase(NodeBase *next, NodeBase *prev) noexcept | BidiNodeBase< NodeBase > | inline |
| children | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBase | |
| count(SidiNodeBase *end=nullptr) const | SidiNodeBase< NodeBase > | inline |
| data | StringTreeBase< T, TNodeMaintainer, TRecycling >::Node | |
| deleteChild(StringTreeBase *tree, NodeBase *child) | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBase | inline |
| deleteChildren(StringTreeBase *tree) | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBase | inline |
| depth() const | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBase | inline |
| findChild(StringTreeBase *tree, const NameType &childName) | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBase | inline |
| findOrCreateChild(StringTreeBase *tree, const NameType &childName, TArgs &&... args) | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBase | inline |
| FWDNode typedef | BidiNodeBase< NodeBase > | |
| hasNext() const | SidiNodeBase< NodeBase > | inline |
| isRoot() const | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBase | inline |
| name | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeKey | |
| next(SidiNodeBase *p) | SidiNodeBase< NodeBase > | inline |
| next() const | SidiNodeBase< NodeBase > | inline |
| Node(const Node &)=delete | StringTreeBase< T, TNodeMaintainer, TRecycling >::Node | |
| Node(Node &&)=delete | StringTreeBase< T, TNodeMaintainer, TRecycling >::Node | |
| Node(const NodeKey &pKey, TArgs &&... args) | StringTreeBase< T, TNodeMaintainer, TRecycling >::Node | inline |
| Node(NodeBase *pParent, const NameType &pName, TArgs &&... args) | StringTreeBase< T, TNodeMaintainer, TRecycling >::Node | inline |
| NodeBase(const NodeKey &pKey) | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBase | inline |
| NodeBase(NodeBase *pParent, const NameType &pName) | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeBase | inline |
| NodeKey(NodeBase *pParent, const NameType &pName) | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeKey | inline |
| operator=(const BidiNodeBase &)=delete | BidiNodeBase< NodeBase > | |
| operator=(BidiNodeBase &&) noexcept=default | BidiNodeBase< NodeBase > | |
| SidiNodeBase< NodeBase >::operator=(const SidiNodeBase &)=delete | SidiNodeBase< NodeBase > | |
| SidiNodeBase< NodeBase >::operator=(SidiNodeBase &&) noexcept=default | SidiNodeBase< NodeBase > | |
| parent | StringTreeBase< T, TNodeMaintainer, TRecycling >::NodeKey | |
| pnext | SidiNodeBase< NodeBase > | |
| pointsTo(const SidiNodeBase *elem) const | SidiNodeBase< NodeBase > | inline |
| pprev | BidiNodeBase< NodeBase > | |
| prev() const | BidiNodeBase< NodeBase > | inline |
| prev(BidiNodeBase *newPrev) | BidiNodeBase< NodeBase > | inline |
| qtyChildren | StringTreeBase< 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=default | SidiNodeBase< NodeBase > | |
| SidiNodeBase(const SidiNodeBase &)=delete | SidiNodeBase< NodeBase > | |
| SidiNodeBase(SidiNodeBase &&) noexcept=default | SidiNodeBase< NodeBase > | |
| SidiNodeBase(NodeBase *next) noexcept | SidiNodeBase< NodeBase > | inline |
