|
| RWHashDictionary () |
|
| RWHashDictionary (const RWHashDictionary &hd) |
|
| RWHashDictionary (RWHashDictionary &&hd) |
|
| RWHashDictionary (size_t n) |
|
virtual | ~RWHashDictionary () |
|
void | applyToKeyAndValue (RWapplyKeyAndValue ap, void *x) |
|
virtual void | clear () |
|
virtual void | clearAndDestroy () |
|
virtual RWCollectable * | copy () const |
|
virtual RWCollectable * | find (const RWCollectable *target) const |
|
RWCollectable * | findKeyAndValue (const RWCollectable *target, RWCollectable *&v) const |
|
RWCollectable * | findValue (const RWCollectable *target) const |
|
RWCollectable * | findValue (const RWCollectable *target, RWCollectable *newValue) const |
|
virtual RWCollectable * | insert (RWCollectable *a) |
|
RWCollectable * | insertKeyAndValue (RWCollectable *key, RWCollectable *value) |
|
virtual RWClassID | isA () const |
|
virtual bool | isEqual (const RWCollectable *) const |
|
virtual RWConstIterator * | newConstIterator () const |
|
virtual RWIterator * | newIterator () |
|
virtual RWCollectable * | newSpecies () const |
|
bool | operator<= (const RWHashDictionary &hd) const |
|
RWHashDictionary & | operator= (const RWHashDictionary &hd) |
|
RWHashDictionary & | operator= (RWHashDictionary &&hd) |
|
bool | operator== (const RWHashDictionary &hd) const |
|
virtual RWCollectable * | remove (const RWCollectable *target) |
|
virtual void | removeAndDestroy (const RWCollectable *target) |
|
RWCollectable * | removeKeyAndValue (const RWCollectable *target, RWCollectable *&v) |
|
virtual void | restoreGuts (RWFile &) |
|
virtual void | restoreGuts (RWvistream &) |
|
virtual RWCollection * | select (RWtestCollectable tst, void *x) const |
|
virtual RWCollection * | select (RWtestCollectablePair testfunc, void *x) const |
|
| RWSet () |
|
| RWSet (const RWSet &h) |
|
| RWSet (RWSet &&h) |
|
| RWSet (size_t n) |
|
virtual | ~RWSet () |
|
void | intersectWith (const RWSet &h, RWSet &ret) const |
|
virtual size_t | occurrencesOf (const RWCollectable *target) const |
|
RWSet & | operator*= (const RWSet &h) |
|
bool | operator< (const RWSet &h) const |
|
bool | operator<= (const RWSet &h) const |
|
RWSet & | operator= (const RWSet &h) |
|
RWSet & | operator= (RWSet &&h) |
|
| RWHashTable () |
|
| RWHashTable (const RWHashTable &t) |
|
| RWHashTable (RWHashTable &&t) |
|
| RWHashTable (size_t N) |
|
virtual void | apply (RWapplyCollectable ap, void *) |
|
virtual size_t | entries () const |
|
virtual bool | isEmpty () const |
|
bool | operator!= (const RWHashTable &) const |
|
bool | operator<= (const RWHashTable &t) const |
|
RWHashTable & | operator= (const RWHashTable &t) |
|
RWHashTable & | operator= (RWHashTable &&t) |
|
bool | operator== (const RWHashTable &t) const |
|
virtual void | resize (size_t n=0) |
|
void | swap (RWHashTable &t) |
|
virtual | ~RWCollection () |
|
RWBag | asBag () const |
|
RWBinaryTree | asBinaryTree () const |
|
RWOrdered | asOrderedCollection () const |
|
RWSet | asSet () const |
|
RWBinaryTree | asSortedCollection () const |
|
virtual RWspace | binaryStoreSize () const |
|
virtual bool | contains (const RWCollectable *target) const |
|
void | operator+= (const RWCollection &c) |
|
void | operator-= (const RWCollection &c) |
|
virtual void | saveGuts (RWFile &) const |
|
virtual void | saveGuts (RWvostream &) const |
|
RWCollection * | select (RWtestCollectable tst, void *vp) const |
|
virtual | ~RWCollectable () |
|
virtual int | compareTo (const RWCollectable *) const |
|
virtual unsigned | hash () const |
|
RWspace | recursiveStoreSize () const |
|
RWStringID | stringID () const |
|
An RWHashDictionary represents a group of unordered values, accessible by external keys. Duplicate keys are not allowed. RWHashDictionary is implemented as a hash table of associations of keys and values. Both the key and the value must inherit from the abstract base class RWCollectable, with a suitable definition of the virtual function hash() and isEqual() for the key.
This class corresponds to the Smalltalk class Dictionary.
- Synopsis
#include <rw/hashdict.h>
Represents a group of unordered values, accessible by external keys.
Definition hashdict.h:48
- Persistence
- Polymorphic