57 _parent->addChild(
this );
77 if ( _parent && autoAddChild )
78 _parent->addChild(
this );
104 child = child->
next();
113 const PAYLOAD &
value()
const {
return _value; }
122 void setValue( PAYLOAD newValue ) { _value = newValue; }
153 { _firstChild = newFirstChild; }
212 parentItem->addChild(
this );
246 while ( child->
next() &&
247 child->
next()->value() < newChild->
value() )
249 child = child->
next();
296 template<
class ITEM,
class PAYLOAD>
inline
298 findDirectChild( ITEM * item, PAYLOAD searchVal )
304 if ( child->
value() == searchVal )
305 return dynamic_cast<ITEM *> ( child );
307 child = child->
next();
TreeItem< PAYLOAD > * next() const
SortedTreeItem< PAYLOAD > * parent() const
SortedTreeItem< PAYLOAD > * firstChild() const
TreeItem< PAYLOAD > * firstChild() const
void setValue(PAYLOAD newValue)
SortedTreeItem< PAYLOAD > * next() const
const PAYLOAD & value() const
void setParent(TreeItem< PAYLOAD > *newParent)
TreeItem< PAYLOAD > * parent() const
void insertChildSorted(SortedTreeItem< PAYLOAD > *newChild)
void addChild(TreeItem< PAYLOAD > *newChild)
void setNext(TreeItem< PAYLOAD > *newNext)
void setFirstChild(TreeItem< PAYLOAD > *newFirstChild)