IMapAsDilTable is the diluted table implementation variant of IAMap.
The implementation of this class requires the following element and key-type functions:
Element Type
virtual ~IACollection()
virtual bool add(Element const&)
virtual bool add(Element const&, ICursor&)
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& 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( 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
~IAEqualityKeyCollection()
IAEqualityKeyCollection(INotifier&)
~IAKeyCollection()
virtual bool addOrReplaceElementWithKey(Element const&)
virtual bool addOrReplaceElementWithKey( Element const&, ICursor& )
bool containsAllKeysFrom( IACollection < Element > const& ) const
bool containsElementWithKey(Key const&) const
Element& elementWithKey(Key const&)
Element const& elementWithKey(Key const&) const
IAKeyCollection(INotifier&)
Key const& key(Element const&) const
bool locateElementWithKey(Key const&, ICursor&) const
virtual bool locateOrAddElementWithKey(Element const&)
virtual bool locateOrAddElementWithKey( Element const&, ICursor& )
virtual INumber removeAllElementsWithKey(Key const&)
virtual bool removeElementWithKey(Key const&)
virtual bool replaceElementWithKey(Element const&)
virtual bool replaceElementWithKey( Element const&, ICursor& )
~IAMap()
virtual void addDifference( IAMap < Element, Key > const&, IAMap < Element, Key > const& )
virtual void addIntersection( IAMap < Element, Key > const&, IAMap < Element, Key > const& )
virtual void addUnion( IAMap < Element, Key > const&, IAMap < Element, Key > const& )
virtual void differenceWith(IAMap < Element, Key > const&)
IAMap(INotifier&)
virtual void intersectionWith( IAMap < Element, Key > const& )
bool operator !=(IAMap < Element, Key > const&) const
bool operator ==(IAMap < Element, Key > const&) const
virtual void unionWith(IAMap < Element, Key > const&)
IACollection(IACollection < Element > const&)
IACollection()
static Implementation& ImplOf( IACollection < Element > const& )
IAEqualityKeyCollection()
IAEqualityKeyCollection( IAEqualityKeyCollection < Element, Key > const& )
IAKeyCollection(IAKeyCollection < Element, Key > const&)
IAKeyCollection()
IAMap(IAMap < Element, Key > const&)
IAMap()
bool locateNext(Element const&, ICursor&) const
bool locateNextElementWithKey(Key const&, ICursor&) const
INumber numberOfDifferentKeys() const
INumber numberOfElementsWithKey(Key const&) const
INumber numberOfOccurrences(Element const&) const
INumber removeAllElementsWithKey(Key const&)
INumber removeAllOccurrences(Element const&)
bool setToNextWithDifferentKey(ICursor&) const