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

This is the complete list of members for StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >, including all inherited members.

AssemblePath(AString &targetString, lang::CurrentData targetData=lang::CurrentData::Clear) constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
AssemblePath(AString &targetString, const TCursor &parent, lang::CurrentData targetData=lang::CurrentData::Clear) constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
Child(const NameType &name) constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
Clone() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
cmCursor typedefStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >protected
cmNode typedefStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >protected
cmTree typedefStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >protected
CountChildren() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
CreateChild(const NameType &childName, TArgs &&... args) constStringTree< 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) constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
DeleteChild(TCursor &child) constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
DeleteChildren() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
Depth() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
Export() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
FirstChild() constStringTree< 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() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
HasNextSibling() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
HasPreviousSibling() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
IsInvalid() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
IsRoot() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
IsValid() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
LastChild() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
Name() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
NextSibling() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
operator TCursor<!TConst >()StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
operator!=(const TCursor &other) constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
operator=(const TCursor &) noexcept=defaultStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >
operator=(TCursor &&) noexcept=defaultStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >
operator==(const TCursor &other) constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
Parent() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
PreviousSibling() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
Root() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
TCursor(cmTree *pTree, cmNode *pNode) noexceptStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inlineprotected
TCursor() noexcept=defaultStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >
TCursor(TStringTree &pTree, uinteger exportValue) noexceptStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
TCursor(const TCursor &src) noexceptStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
TCursor(TCursor &&src) noexceptStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
TraversePath(const NameType &path) constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
Tree()StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
Tree() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
TStringTree typedefStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >
Value()StringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >
Value() constStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >inline
~TCursor() noexcept=defaultStringTree< T, TNodeMaintainer, TRecycling >::TCursor< TConst >