~IATree()
void
addAsChild( ITreeCursor const&,
IPosition,
Element const& )
void addAsRoot(Element const&)
void adoptStreamer(IACollectionStreamer*)
IBoolean
allElementsDo( IBoolean ( * applicatorFunction ) ( Element&,
void * ),
ITreeIterationOrder ,
void* additionalArgument = 0 )
IBoolean
allElementsDo( IApplicator < Element >&,
ITreeIterationOrder )
IBoolean
allElementsDo( IConstantApplicator < Element >&,
ITreeIterationOrder ) const
IBoolean
allElementsDo( IBoolean ( * applicatorFunction ) ( Element const&,
void * ),
ITreeIterationOrder ,
void* additionalArgument = 0 ) const
IBoolean
allSubtreeElementsDo( ITreeCursor const&,
IApplicator < Element >&,
ITreeIterationOrder )
IBoolean
allSubtreeElementsDo( ITreeCursor const&,
IBoolean ( * applicatorFunction ) ( Element&,
void * ),
ITreeIterationOrder ,
void* additionalArgument = 0 )
IBoolean
allSubtreeElementsDo( ITreeCursor const&,
IBoolean ( * applicatorFunction ) ( Element const&,
void * ),
ITreeIterationOrder ,
void* additionalArgument = 0 ) const
IBoolean
allSubtreeElementsDo( ITreeCursor const&,
IConstantApplicator < Element >&,
ITreeIterationOrder ) const
IPosition childPositionAt(ITreeCursor const&) const
Element const& elementAt(ITreeCursor const&) const
Element& elementAt(ITreeCursor const&)
IBoolean isConsistent() const
IBoolean isEmpty() const
IBoolean isLeaf(ITreeCursor const&) const
IBoolean isRoot(ITreeCursor const&) const
ITreeCursor* newCursor() const
INumber numberOfElements() const
INumber numberOfLeaves() const
INumber numberOfSubtreeElements(ITreeCursor const&) const
INumber numberOfSubtreeLeaves(ITreeCursor const&) const
void operator <<=(IDataStream&)
void operator >>=(IDataStream&)
IPosition position(ITreeCursor const&) const
INumber removeAll()
INumber removeSubtree(ITreeCursor&)
void replaceAt(ITreeCursor const&, Element const&)
IBoolean setToChild(IPosition, ITreeCursor&) const
IBoolean
setToFirst( ITreeCursor&,
ITreeIterationOrder ) const
IBoolean setToFirstExistingChild(ITreeCursor&) const
IBoolean setToLast(ITreeCursor&, ITreeIterationOrder) const
IBoolean setToLastExistingChild(ITreeCursor&) const
IBoolean setToNext(ITreeCursor&, ITreeIterationOrder) const
IBoolean setToNextExistingChild(ITreeCursor&) const
IBoolean setToParent(ITreeCursor&) const
IBoolean
setToPrevious( ITreeCursor&,
ITreeIterationOrder ) const
IBoolean setToPreviousExistingChild(ITreeCursor&) const
IBoolean setToRoot(ITreeCursor&) const