Variant of ISortedSet with generic operations class.
Construct and destruct IGSortedSet objects.
![]() |
public:
IGSortedSet(INumber = 100)
Windows | OS/2 | AIX |
Yes | Yes | Yes |
public:
IGSortedSet(IGSortedSet < Element, ElementOps > const&)
Windows | OS/2 | AIX |
Yes | Yes | Yes |
protected:
IGSortedSet(PureImplementation&)
Windows | OS/2 | AIX |
Yes | Yes | Yes |
![]() |
protected:
IGSortedSetTypedef(Element, ElementOps)
Windows | OS/2 | AIX |
Yes | Yes | Yes |
Assign IGSortedSet objects.
![]() |
public:
IGSortedSet < Element , ElementOps >& operator =( IGSortedSet < Element, ElementOps > const& )
Windows | OS/2 | AIX |
Yes | Yes | Yes |
These members provide access to object implementation details.
![]() |
protected:
static Implementation& ImplOf( IGSortedSet < Element, ElementOps > const& )
Windows | OS/2 | AIX |
Yes | Yes | Yes |
![]() |
typedef ISortedSetAsAvlTreeImpl PureImplementation
Windows | OS/2 | AIX |
Yes | Yes | Yes |
![]() |
typedef IGSortedSet < Element , ElementOps > Self
Windows | OS/2 | AIX |
Yes | Yes | Yes |
![]() |
typedef ICollectionGuard < Element > Guard
Windows | OS/2 | AIX |
Yes | Yes | Yes |
![]() |
typedef ICSortedSetImpl < PureImplementation > Implementation
typedef ICSortedSetImpl < PureImplementation > Implementation
Windows | OS/2 | AIX |
Yes | Yes | Yes |
typedef PureImplementation Implementation
Windows | OS/2 | AIX |
Yes | Yes | Yes |
![]() |
typedef IGSortedSetCursor < Element , ElementOps > Cursor
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(IConstantApplicator < Element >&) const
bool allElementsDo( bool ( * applicatorFunction ) ( Element const&, void * ) , void* additionalArgument = 0 ) 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& notifier()
INotifier const& notifier() const
INotifier& notifyObservers(INotificationEvent const&)
INumber numberOfElements() const
virtual void operator <<=(IDataStream&)
virtual void operator >>=(IDataStream&)
operator INotifier &() const
virtual INumber removeAll( bool ( * predicateFunction ) ( Element const&, void * ) , void* additionalArgument = 0 )
virtual INumber removeAll()
virtual void removeAt(ICursor&)
virtual void replaceAt(ICursor const&, Element const&)
bool setToFirst(ICursor&) const
bool setToNext(ICursor&) const
~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&)
~IASortedSet()
virtual void addDifference( IASortedSet < Element > const&, IASortedSet < Element > const& )
virtual void addIntersection( IASortedSet < Element > const&, IASortedSet < Element > const& )
virtual void addUnion( IASortedSet < Element > const&, IASortedSet < Element > const& )
long compare( IASortedSet < Element > const&, long ( * comparisonFunction ) ( Element const & , Element const & ) ) const
virtual void differenceWith(IASortedSet < Element > const&)
IASortedSet(INotifier&)
virtual void intersectionWith( IASortedSet < Element > const& )
IBoolean operator !=(IASortedSet < Element > const&) const
IBoolean operator ==(IASortedSet < Element > const&) const
virtual void unionWith(IASortedSet < Element > const&)
IACollection(IACollection < Element > const&)
IACollection()
static Implementation& ImplOf( IACollection < Element > const& )
IAOrderedCollection(IAOrderedCollection < Element > const&)
IAOrderedCollection()
IASortedCollection(IASortedCollection < Element > const&)
IASortedCollection()
IASortedSet(IASortedSet < Element > const&)
IASortedSet()
INumber numberOfOccurrences(Element const&) const
INumber removeAllOccurrences(Element const&)