IGTree

IGTree is the default implementation variant with generic operations class.

IGTree - Member Functions and Data by Group

Assign an IGTree objet to this object.

---

operator =

public:
IGTree < Element , ElementOps , numOfChildren >&
  operator =( IGTree < Element,
              ElementOps,
              numOfChildren > const& tree )

Assign an IGTree objet to this object.

Supported Platforms

Windows	OS/2	AIX
Yes	Yes	Yes

IGTree - Inherited Member Functions and Data

IATree

• ~IATree()
  

• void
    addAsChild( ITreeCursor const&,
                IPosition,
                Element const& )
  

• void addAsRoot(Element const&)
  

• void adoptStreamer(IACollectionStreamer*)
  

• IBoolean
    allElementsDo( IConstantApplicator < Element >&,
                   ITreeIterationOrder ) const
  

• IBoolean
    allElementsDo( IBoolean ( * applicatorFunction ) ( Element const&,
                    void * ),
                   ITreeIterationOrder ,
                   void* additionalArgument = 0 ) const
  

• IBoolean
    allElementsDo( IApplicator < Element >&,
                   ITreeIterationOrder )
  

• IBoolean
    allElementsDo( IBoolean ( * applicatorFunction ) ( Element&,
                    void * ),
                   ITreeIterationOrder ,
                   void* additionalArgument = 0 )
  

• IBoolean
    allSubtreeElementsDo( ITreeCursor const&,
                          IConstantApplicator < Element >&,
                          ITreeIterationOrder ) const
  

• IBoolean
    allSubtreeElementsDo( ITreeCursor const&,
                          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 )
  

• IPosition childPositionAt(ITreeCursor const&) const
  

• Element& elementAt(ITreeCursor const&)
  

• Element const& elementAt(ITreeCursor const&) 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
  

IAMultiwayTree

• void
    attachAsChild( ITreeCursor const&,
                   IPosition,
                   IAMultiwayTree < numOfChildren,
                   Element > const& )
  

• void
    attachAsRoot( IAMultiwayTree < numOfChildren,
                  Element > const& )
  

• void
    attachSubtreeAsChild( ITreeCursor const&,
                          IPosition,
                          IAMultiwayTree < numOfChildren,
                          Element > const&,
                          ITreeCursor const& )
  

• void
    attachSubtreeAsRoot( IAMultiwayTree < numOfChildren,
                         Element > const&,
                         ITreeCursor const& )
  

• void copy(IAMultiwayTree < numOfChildren, Element > const&)
  

• void
    copySubtree( IAMultiwayTree < numOfChildren,
                 Element > const&,
                 ITreeCursor const& )
  

• bool hasChild(IPosition, ITreeCursor const&) const
  

• INumber numberOfChildren() const
  

IGMultiwayTree

• IGMultiwayTree()
  

• IGMultiwayTree( IGMultiwayTree < numOfChildren,
                  Element,
                  ElementOps > const& )
  

• IGMultiwayTree < numOfChildren , Element , ElementOps >&
    operator =( IGMultiwayTree < numOfChildren,
                Element,
                ElementOps > const& )
  

• None

IATreeBase

• ~IATreeBase()
  

• static ITreeCursorImpl& CrsrImplOf(ITreeCursor& cursor)
  

• static ITreeCursorImpl const&
    CrsrImplOf( ITreeCursor const& cursor )
  

• IATreeBase()
  

• IATreeBase(IATreeBase const&)
  

• static ITreeCursor* InterfaceFor(ITreeCursorImpl* cursor)
  

IAMultiwayTree

• IAMultiwayTree( IAMultiwayTree < numOfChildren,
                  Element > const& )
  

• IAMultiwayTree()
  

IATree

• IATree()
  

• IATree(IATree < Element > const&)
  

• static Implementation& ImplOf(IATree < Element > const&)
  

IGMultiwayTree

• IGMultiwayTree(PureImplementation&)
  

• IGMultiwayTreeTypedef(Element, ElementOps)
  

• static Implementation&
    ImplOf( IGMultiwayTree < numOfChildren,
            Element,
            ElementOps > const& )
  

• None