100 child = child->
next();
181 if ( child == maybeParent )
260 while ( child->
next() &&
261 child->
next()->value() < newChild->
value() )
263 child = child->
next();
310 template<
class ITEM,
class PAYLOAD>
inline 318 if ( child->
value() == searchVal )
319 return dynamic_cast<ITEM *> (child);
321 child = child->
next();
TreeItem< PAYLOAD > * next() const
Definition: TreeItem.h:128
SortedTreeItem< PAYLOAD > * parent() const
Definition: TreeItem.h:278
SortedTreeItem< PAYLOAD > * firstChild() const
Definition: TreeItem.h:290
TreeItem< PAYLOAD > * firstChild() const
Definition: TreeItem.h:133
void setValue(PAYLOAD newValue)
Definition: TreeItem.h:118
SortedTreeItem< PAYLOAD > * next() const
Definition: TreeItem.h:284
TreeItem< PAYLOAD > * _firstChild
Definition: TreeItem.h:194
Template class for tree items that maintain sort order.
Definition: TreeItem.h:205
const PAYLOAD & value() const
Definition: TreeItem.h:109
void setParent(TreeItem< PAYLOAD > *newParent)
Definition: TreeItem.h:138
TreeItem< PAYLOAD > * _next
Definition: TreeItem.h:193
Template class for tree items that can handle tree children in a generic way - firstChild(), next() and parent(). Each item stores one value of type 'PAYLOAD'.
Definition: TreeItem.h:36
bool isChildOf(const TreeItem< PAYLOAD > *maybeParent) const
Definition: TreeItem.h:175
TreeItem< PAYLOAD > * parent() const
Definition: TreeItem.h:123
TreeItem< PAYLOAD > & operator=(const TreeItem< PAYLOAD > &)
Definition: TreeItem.h:84
TreeItem< PAYLOAD > * _parent
Definition: TreeItem.h:192
void insertChildSorted(SortedTreeItem< PAYLOAD > *newChild)
Definition: TreeItem.h:241
void addChild(TreeItem< PAYLOAD > *newChild)
Definition: TreeItem.h:161
PAYLOAD _value
Definition: TreeItem.h:191
void setNext(TreeItem< PAYLOAD > *newNext)
Definition: TreeItem.h:143
ITEM * findDirectChild(ITEM *item, PAYLOAD searchVal)
Definition: TreeItem.h:312
void setFirstChild(TreeItem< PAYLOAD > *newFirstChild)
Definition: TreeItem.h:148