Construct and destruct IGSortedMapCursor objects.
![]() |
Since the content and application accessability to the system menu vary from platform to platform, not all of the items referenced by these identifiers can be accessed on all platforms.
public:
IGSortedMapCursor( IGSortedMap < Element, Key, ElementOps > const& )
Windows | OS/2 | AIX |
Yes | Yes | Yes |
protected:
IGSortedMapCursor(ICursorImpl*)
Windows | OS/2 | AIX |
Yes | Yes | Yes |
Assign another sorted map cursor to this object.
![]() |
public:
IGSortedMapCursor < Element , Key , ElementOps >& operator =( IGSortedMapCursor < Element, Key, ElementOps > const& )
Windows | OS/2 | AIX |
Yes | Yes | Yes |
virtual ~IACollection()
virtual bool add(Element const&, ICursor&)
virtual bool add(Element const&)
virtual void addAllFrom(IACollection < Element > const&)
void adoptStreamer(IACollectionStreamer*)
bool allElementsDo( bool ( * applicatorFunction ) ( Element&, void * ) , void* additionalArgument = 0 )
bool allElementsDo(IApplicator < Element >&)
bool allElementsDo( bool ( * applicatorFunction ) ( Element const&, void * ) , void* additionalArgument = 0 ) const
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(INotifier&)
~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(INotifier&)
~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&)
IACollection()
IACollection(IACollection < Element > const&)
static Implementation& ImplOf( IACollection < Element > const& )
IAEqualityKeySortedCollection()
IAEqualityKeySortedCollection( IAEqualityKeySortedCollection < Element, Key > const& )
IAOrderedCollection()
IAOrderedCollection(IAOrderedCollection < Element > const&)
IASortedCollection(IASortedCollection < Element > const&)
IASortedCollection()
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