| AssemblePath(AString &target, CurrentData targetData=CurrentData::Clear) const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| Child(const NameType &name) | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| Clone() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| CountChildren() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| CreateChild(const NameType &childName, TArgs &&... args) const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| CreateChildIfNotExistent(const NameType &name, TArgs &&... args) | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| CreatePathIfNotExistent(const NameType &path, TArgs &&... args) | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| Delete() | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| DeleteChild(const NameType &childName) const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| DeleteChild(NodePtr &child) const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| DeleteChildren() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| Depth() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| FirstChild() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| GoToChild(const NameType &name) | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| GoToCreateChildIfNotExistent(const NameType &name, TArgs &&... args) | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| GoToCreatedPathIfNotExistent(const NameType &path, TArgs &&... args) | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| GoToFirstChild() | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| GoToLastChild() | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| GoToNextSibling() | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| GoToParent() | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| GoToPreviousSibling() | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| GoToRoot() | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| GoToTraversedPath(const NameType &path) | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| HasChildren() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| HasNextSibling() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| HasPreviousSibling() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| IsInvalid() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| IsRoot() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| IsValid() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| LastChild() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| Name() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| NextSibling() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| NodePtr(basetree *pTree, baseNode *pNode) noexcept | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inlineprotected |
| NodePtr() noexcept=default | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | |
| NodePtr(const NodePtr &) noexcept=default | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | |
| NodePtr(NodePtr &&) noexcept=default | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | |
| operator!=(const NodePtr &other) const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| operator=(const NodePtr &) noexcept=default | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | |
| operator=(NodePtr &&) noexcept=default | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | |
| operator==(const NodePtr &other) const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| Parent() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| PreviousSibling() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| Root() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| TraversePath(const NameType &path) | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| Tree() | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| Value() | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| Value() const | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | inline |
| ~NodePtr() noexcept=default | StringTree< T, TNodeMaintainer, TRecycling >::NodePtr | |