### ISortedMapAsBstTree

  ISortedMapAsBstTree is the B* tree implementation variant of IASortedMap.

  The implementation of the class ISortedMapAsBstTree requires the following element and key-type functions:

  Element Type

  - Default constructor
  - Copy constructor
  - Destructor
  - Assignment
  - Key access
  - Equality test

  Key Type

  Ordering relation

### ISortedMapAsBstTree - Member Functions and Data by Group

### ISortedMapAsBstTree - Inherited Member Functions and Data

#### Inherited Public Functions

  IACollection

  -     virtual ~IACollection()

  -     virtual bool add(Element const&)

  -     virtual bool add(Element const&, ICursor&)

  -     virtual void addAllFrom(IACollection < Element > const&)

  -     void adoptStreamer(IACollectionStreamer*)

  -     bool
          allElementsDo( bool ( * applicatorFunction ) ( Element&,
                         void * ) , void* additionalArgument = 0 )

  -     bool
          allElementsDo( bool ( * applicatorFunction ) ( Element const&,
                         void * ) , void* additionalArgument = 0 ) const

  -     bool allElementsDo(IApplicator < Element >&)

  -     bool allElementsDo(IConstantApplicator < Element >&) const

  -     Element const& any() const

  -     Element const& anyElement() const

  -     virtual void copy(IACollection < Element > const&)

  -     INotifier& disableNotification()

  -     Element& elementAt(ICursor const&)

  -     Element const& elementAt(ICursor const&) const

  -     INotifier& enableNotification(bool = true)

  -     IACollection(INotifier&)

  -     bool isBounded() const

  -     bool isConsistent() const

  -     bool isEmpty() const

  -     bool isEnabledForNotification() const

  -     bool isFull() const

  -     INumber maxNumberOfElements() const

  -     virtual ICursor* newCursor() const

  -     ICursor* newMngCursor() const

  -     INotifier const& notifier() const

  -     INotifier& notifier()

  -     INotifier& notifyObservers(INotificationEvent const&)

  -     INumber numberOfElements() const

  -     virtual void operator <<=(IDataStream&)

  -     virtual void operator >>=(IDataStream&)

  -     operator INotifier &() const

  -     virtual INumber removeAll()

  -     virtual INumber
          removeAll( bool ( * predicateFunction ) ( Element const&,
                     void * ) , void* additionalArgument = 0 )

  -     virtual void removeAt(ICursor&)

  -     virtual void replaceAt(ICursor const&, Element const&)

  -     bool setToFirst(ICursor&) const

  -     bool setToNext(ICursor&) const

  IAEqualityKeySortedCollection

  -     ~IAEqualityKeySortedCollection()

  -     IAEqualityKeySortedCollection(INotifier&)

  IAOrderedCollection

  -     ~IAOrderedCollection()

  -     Element const& elementAtPosition(IPosition) const

  -     Element const& first() const

  -     Element const& firstElement() const

  -     IAOrderedCollection(INotifier&)

  -     bool isFirst(ICursor const&) const

  -     bool isFirstAt(ICursor const&) const

  -     bool isLast(ICursor const&) const

  -     bool isLastAt(ICursor const&) const

  -     Element const& last() const

  -     Element const& lastElement() const

  -     IPosition position(ICursor const&) const

  -     IPosition positionAt(ICursor const&) const

  -     virtual void removeAtPosition(IPosition)

  -     virtual void removeFirst()

  -     virtual void removeLast()

  -     bool setToLast(ICursor&) const

  -     void setToPosition(IPosition, ICursor&) const

  -     bool setToPrevious(ICursor&) const

  IASortedCollection

  -     ~IASortedCollection()

  -     IASortedCollection(INotifier&)

  IASortedMap

  -     ~IASortedMap()

  -     virtual void
          addDifference( IASortedMap < Element,
                         Key > const&,
                         IASortedMap < Element,
                         Key > const& )

  -     virtual void
          addIntersection( IASortedMap < Element,
                           Key > const&,
                           IASortedMap < Element,
                           Key > const& )

  -     virtual void
          addUnion( IASortedMap < Element,
                    Key > const&,
                    IASortedMap < Element,
                    Key > const& )

  -     long
          compare( IASortedMap < Element,
                   Key > const&,
                   long ( * comparisonFunction ) ( Element const & ,
                   Element const & ) ) const

  -     virtual void
          differenceWith( IASortedMap < Element,
                          Key > const& )

  -     IASortedMap(INotifier&)

  -     virtual void
          intersectionWith( IASortedMap < Element,
                            Key > const& )

  -     IBoolean
          operator !=( IASortedMap < Element,
                       Key > const& ) const

  -     IBoolean
          operator ==( IASortedMap < Element,
                       Key > const& ) const

  -     virtual void unionWith(IASortedMap < Element, Key > const&)

#### Inherited Public Data

  - None

#### Inherited Protected Functions

  IACollectionBase

  -     ~IACollectionBase()

  -     static ICursorImpl const& CrsrImplOf(ICursor const& cursor)

  -     static ICursorImpl& CrsrImplOf(ICursor& cursor)

  -     IACollectionBase()

  -     IACollectionBase(IACollectionBase const&)

  -     static ICursor* InterfaceFor(ICursorImpl* cursor)

  IACollection

  -     IACollection()

  -     IACollection(IACollection < Element > const&)

  -     static Implementation&
          ImplOf( IACollection < Element > const& )

  IAEqualityKeySortedCollection

  -     IAEqualityKeySortedCollection()

  -     IAEqualityKeySortedCollection( IAEqualityKeySortedCollection < Element,
                                       Key > const& )

  IAOrderedCollection

  -     IAOrderedCollection()

  -     IAOrderedCollection(IAOrderedCollection < Element > const&)

  IASortedCollection

  -     IASortedCollection(IASortedCollection < Element > const&)

  -     IASortedCollection()

  IASortedMap

  -     IASortedMap(IASortedMap < Element, Key > const&)

  -     IASortedMap()

  -     INumber numberOfDifferentKeys() const

  -     INumber numberOfElementsWithKey(Key const&) const

  -     INumber numberOfOccurrences(Element const&) const

  -     INumber removeAllElementsWithKey(Key const&)

  -     INumber removeAllOccurrences(Element const&)

  -     IBoolean setToNextWithDifferentKey(ICursor&) const

#### Inherited Protected Data

  - None