AssemblePath(AString &targetString, lang::CurrentData targetData=lang::CurrentData::Clear) const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
AssemblePath(AString &targetString, const TCursor &parent, lang::CurrentData targetData=lang::CurrentData::Clear) const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
Child(const NameType &name) const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
Clone() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
cmCursor typedef | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | protected |
cmNode typedef | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | protected |
cmTree typedef | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | protected |
CountChildren() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
CreateChild(const NameType &childName, TArgs &&... args) const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
CreateChildIfNotExistent(const NameType &name, TArgs &&... args) | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
CreatePathIfNotExistent(const NameType &path, TArgs &&... args) | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
Delete() | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
DeleteChild(const NameType &childName) const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
DeleteChild(TCursor &child) const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
DeleteChildren() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
Depth() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
Export() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
FirstChild() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
GoToChild(const NameType &name) | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
GoToCreateChildIfNotExistent(const NameType &name, TArgs &&... args) | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
GoToCreatedPathIfNotExistent(const NameType &path, TArgs &&... args) | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
GoToFirstChild() | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
GoToLastChild() | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
GoToNextSibling() | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
GoToParent() | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
GoToPreviousSibling() | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
GoToRoot() | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
GoToTraversedPath(const NameType &path) | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
HasChildren() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
HasNextSibling() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
HasPreviousSibling() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
IsInvalid() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
IsRoot() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
IsValid() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
LastChild() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
Name() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
NextSibling() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
operator TCursor<!TConst >() | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
operator!=(const TCursor &other) const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
operator=(const TCursor &) noexcept=default | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | |
operator=(TCursor &&) noexcept=default | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | |
operator==(const TCursor &other) const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
Parent() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
PreviousSibling() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
Root() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
TCursor(cmTree *pTree, cmNode *pNode) noexcept | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inlineprotected |
TCursor() noexcept=default | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | |
TCursor(TStringTree &pTree, uinteger exportValue) noexcept | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
TCursor(const TCursor &src) noexcept | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
TCursor(TCursor &&src) noexcept | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
TraversePath(const NameType &path) const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
Tree() | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
Tree() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
TStringTree typedef | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | |
Value() | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | |
Value() const | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | inline |
~TCursor() noexcept=default | StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst > | |