A hash table is an instrument used to sort data. A string serves as the access key, whose hash value ensures fast access. This class provides all the necessary methods to be able to work comfortably with a hash table.
More...
|
| | Hashtable () noexcept |
| | Default constructor for the Hashtable class.
|
| |
| | ~Hashtable () noexcept override |
| | Destructor for the Hashtable class.
|
| |
| void * | put (String key, void *value) noexcept |
| | This method inserts a new element into the hash table.
|
| |
| void * | get (const String &key) const noexcept |
| | This method returns the object associated with the specified key.
|
| |
| void * | remove (const String &key) noexcept |
| | This method removes the object associated with the specified key.
|
| |
| size_t | size () const noexcept |
| | Returns the number of entries in this hash table.
|
| |
| bool | isEmpty () const noexcept |
| | This method returns true if the hashtable is empty.
|
| |
| bool | containsKey (const String &key) const noexcept |
| | This method returns true if an object is associated with the specified key.
|
| |
| bool | containsValue (void *value) const noexcept |
| | This method returns true if the hashtable contains an object associated with the specified value.
|
| |
| Iterator * | keys () noexcept |
| | This method returns an object of the "Iterator" class that iterates through the keys of this table.
|
| |
| Iterator * | values () noexcept |
| | This method returns an object of the "Iterator" class that iterates through the values of this table.
|
| |
| void | clear () noexcept |
| | This method removes all elements from the Hashtable.
|
| |
| | Object () noexcept |
| | Constructor.
|
| |
| virtual | ~Object () noexcept |
| | Destructor.
|
| |
| void | release () noexcept |
| | Decreases the reference counter and releases the object immediately when the reference counter becomes 0.
|
| |
| Object * | retain () noexcept |
| | Increases the reference counter of this object by 1.
|
| |
| Object * | autorelease () noexcept |
| | Same function as release(), but releases the object with a delay if the reference counter is 0. AutoreleasePool::drain() must be called in the to release the object.
|
| |
| int32 | referenceCount () const noexcept |
| | Returns the value of the reference counter.
|
| |
| virtual bool | equals (const Object *other) const |
| | Comparison of objects.
|
| |
| virtual String | displayName () const |
| | Returns the display name of the object intended to present to a user.
|
| |
| virtual void | printDiffInfo (DiffOperation operation, Object *other) const |
| | Output method for outputting the diff results for the diff algorithm.
|
| |
| void | setHighBit (bool status) noexcept |
| |
| bool | highBit () const noexcept |
| |
A hash table is an instrument used to sort data. A string serves as the access key, whose hash value ensures fast access. This class provides all the necessary methods to be able to work comfortably with a hash table.