Because key sorted collection is an abstract class, it cannot be used to create any objects. The key sorted collection inherits from sorted collection and key collection. It defines the interfaces for the following properties:
You can construct and destruct objects of this class.
![]() |
public:
~IAKeySortedCollection()
Removes all elements from the collection. Destructors are called for all elements contained in the collection and for elements that have been constructed in advance.
Side Effects
All cursors of the collection become undefined.
Windows | OS/2 | AIX |
Yes | Yes | Yes |
![]() |
You can construct objects of this class.
public:
IAKeySortedCollection(INotifier&)
Use this constructor to create a collection with support for notification.
Windows | OS/2 | AIX |
Yes | Yes | Yes |
protected:
IAKeySortedCollection( IAKeySortedCollection < Element, Key > const& )
Constructs a collection.
The collection is unbounded and is initially empty.
Exception
IOutOfMemory
Note:
Windows | OS/2 | AIX |
Yes | Yes | Yes |
protected:
IAKeySortedCollection()
The default constructor.
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(IConstantApplicator < Element >&) const
bool allElementsDo(IApplicator < Element >&)
bool allElementsDo( bool ( * applicatorFunction ) ( Element&, void * ) , void* additionalArgument = 0 )
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 const& elementAt(ICursor const&) const
Element& elementAt(ICursor 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
~IAKeyCollection()
virtual bool addOrReplaceElementWithKey(Element const&)
virtual bool addOrReplaceElementWithKey( Element const&, ICursor& )
bool containsAllKeysFrom( IACollection < Element > const& ) const
bool containsElementWithKey(Key const&) const
Element const& elementWithKey(Key const&) const
Element& elementWithKey(Key const&)
IAKeyCollection(INotifier&)
Key const& key(Element const&) const
bool locateElementWithKey(Key const&, ICursor&) const
bool locateNextElementWithKey(Key const&, ICursor&) const
virtual bool locateOrAddElementWithKey( Element const&, ICursor& )
virtual bool locateOrAddElementWithKey(Element const&)
INumber numberOfDifferentKeys() const
INumber numberOfElementsWithKey(Key const&) const
virtual INumber removeAllElementsWithKey(Key const&)
virtual bool removeElementWithKey(Key const&)
virtual bool replaceElementWithKey( Element const&, ICursor& )
virtual bool replaceElementWithKey(Element const&)
bool setToNextWithDifferentKey(ICursor&) const
IACollection(IACollection < Element > const&)
IACollection()
static Implementation& ImplOf( IACollection < Element > const& )
IAKeyCollection(IAKeyCollection < Element, Key > const&)
IAKeyCollection()