StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeBase Member List

This is the complete list of members for StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeBase, including all inherited members.

addBefore(NodeBase *elem) noexcept	BidiNodeBase< NodeBase >	inline
addBehind(NodeBase *elem) noexcept	BidiNodeBase< NodeBase >	inline
assemblePath(strings::TAString< CharacterType, lang::HeapAllocator > &target, const NodeBase *childNode, const NodeBase *maxParent, CharacterType separatorChar) const	StringTreeBase< TAllocator, T, TNodeHandler, 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< TAllocator, T, TNodeHandler, TRecycling >::NodeBase
count(SidiNodeBase *end=nullptr) const noexcept	SidiNodeBase< NodeBase >	inline
deleteChild(StringTreeBase *tree, NodeBase *child)	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeBase	inline
deleteChildren(StringTreeBase *tree)	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeBase	inline
depth() const	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeBase	inline
distance(const NodeBase *other) const	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeBase	inline
findChild(StringTreeBase *tree, const NameType &childName)	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeBase	inline
findOrCreateChild(StringTreeBase *tree, const NameType &childName, TArgs &&... args)	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeBase	inline
FWDNode typedef	BidiNodeBase< NodeBase >
hasNext() const	SidiNodeBase< NodeBase >	inline
isRoot() const	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeBase	inline
n	SidiNodeBase< NodeBase >
name	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeKey
next(SidiNodeBase *p)	SidiNodeBase< NodeBase >	inline
next() const	SidiNodeBase< NodeBase >	inline
NodeBase(const NodeKey &pKey)	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeBase	inline
NodeBase(NodeBase *pParent, const NameType &pName)	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeBase	inline
NodeKey(NodeBase *pParent, const NameType &pName)	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeKey	inline
operator=(const BidiNodeBase &)=delete	BidiNodeBase< NodeBase >
operator=(BidiNodeBase &&) noexcept=default	BidiNodeBase< NodeBase >
alib::lang::SidiNodeBase< NodeBase >::operator=(const SidiNodeBase &)=delete	SidiNodeBase< NodeBase >
alib::lang::SidiNodeBase< NodeBase >::operator=(SidiNodeBase &&) noexcept=default	SidiNodeBase< NodeBase >
p	BidiNodeBase< NodeBase >
parent	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeKey
pointsTo(const SidiNodeBase *elem) const	SidiNodeBase< NodeBase >	inline
prev() const noexcept	BidiNodeBase< NodeBase >	inline
prev(BidiNodeBase *previous) noexcept	BidiNodeBase< NodeBase >	inline
qtyChildren	StringTreeBase< TAllocator, T, TNodeHandler, TRecycling >::NodeBase
remove() noexcept	BidiNodeBase< NodeBase >	inline
remove(NodeBase *last) noexcept	BidiNodeBase< NodeBase >	inline
removeNext() noexcept	SidiNodeBase< NodeBase >	inline
removeRangeBehind(NodeBase *last) noexcept	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 >	inlineexplicit