| actDepth | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| actPath | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| cmCursor typedef | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| cmNode typedef | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| cmTree typedef | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| CurrentDepth() const | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| CurrentPath() const | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| DeleteNode() | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| FullPath(AString &target, lang::CurrentData targetData=lang::CurrentData::Clear) const | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| Initialize(cmTree &pTree, unsigned int depth=(std::numeric_limits< unsigned int >::max)()) | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| Initialize(cmCursor cursor, unsigned int depth=(std::numeric_limits< unsigned int >::max)()) | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| Initialize(const TRecursiveIterator &other, unsigned int depth=(std::numeric_limits< unsigned int >::max)()) | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| initialize(cmTree *pTree, cmNode *newnode, unsigned int depth) | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inlineprotected |
| Invalidate() | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| IsInvalid() const | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| IsValid() const | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| Next() | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| next(int skipMode) | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inlineprotected |
| nextCustomSorter | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| nextIsSorting | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| NextParentSibling() | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| NextSibling() | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| nextSortingIsCaseSensitive | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| nextSortingIsDescending | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| Node() const | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| node | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| operator=(const TRecursiveIterator &)=default | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | |
| operator=(TRecursiveIterator &&)=default | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | |
| recursion() | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inlineprotected |
| recursionDepth | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| RequestedDepth() const | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| SetPathGeneration(lang::Switch pathGeneration) | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| SetSorting(lang::Switch sorting) | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| SetSorting(lang::SortOrder order=lang::SortOrder::Ascending, lang::Case sensitivity=lang::Case::Ignore) | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| SetSorting(bool(*customSorterFunction)(const Cursor &, const Cursor &)) | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | inline |
| stack | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| TRecursiveIterator()=default | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | |
| TRecursiveIterator(const TRecursiveIterator &)=default | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | |
| TRecursiveIterator(TRecursiveIterator &&)=default | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | |
| tree | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | protected |
| ~TRecursiveIterator()=default | StringTree< T, TNodeMaintainer, TRecycling >::TRecursiveIterator< TConst > | |
