OpenShot Library | OpenShotAudio
0.2.1
|
Holds a set of mappings between some key/value pairs. More...
#include <juce_HashMap.h>
Classes | |
struct | Iterator |
Iterates over the items in a HashMap. More... | |
Public Types | |
using | ScopedLockType = typename TypeOfCriticalSectionToUse::ScopedLockType |
Returns the type of scoped lock to use for locking this array. | |
Public Member Functions | |
HashMap (int numberOfSlots=defaultHashTableSize, HashFunctionType hashFunction=HashFunctionType()) | |
Creates an empty hash-map. More... | |
~HashMap () | |
Destructor. More... | |
void | clear () |
Removes all values from the map. More... | |
int | size () const noexcept |
Returns the current number of items in the map. More... | |
ValueType | operator[] (KeyTypeParameter keyToLookFor) const |
Returns the value corresponding to a given key. More... | |
ValueType & | getReference (KeyTypeParameter keyToLookFor) |
Returns a reference to the value corresponding to a given key. More... | |
bool | contains (KeyTypeParameter keyToLookFor) const |
Returns true if the map contains an item with the specified key. More... | |
bool | containsValue (ValueTypeParameter valueToLookFor) const |
Returns true if the hash contains at least one occurrence of a given value. More... | |
void | set (KeyTypeParameter newKey, ValueTypeParameter newValue) |
Adds or replaces an element in the hash-map. More... | |
void | remove (KeyTypeParameter keyToRemove) |
Removes an item with the given key. More... | |
void | removeValue (ValueTypeParameter valueToRemove) |
Removes all items with the given value. More... | |
void | remapTable (int newNumberOfSlots) |
Remaps the hash-map to use a different number of slots for its hash function. More... | |
int | getNumSlots () const noexcept |
Returns the number of slots which are available for hashing. More... | |
template<class OtherHashMapType > | |
void | swapWith (OtherHashMapType &otherHashMap) noexcept |
Efficiently swaps the contents of two hash-maps. More... | |
const TypeOfCriticalSectionToUse & | getLock () const noexcept |
Returns the CriticalSection that locks this structure. More... | |
Iterator | begin () const noexcept |
Returns a start iterator for the values in this tree. More... | |
Iterator | end () const noexcept |
Returns an end iterator for the values in this tree. More... | |
Friends | |
struct | Iterator |
Holds a set of mappings between some key/value pairs.
The types of the key and value objects are set as template parameters. You can also specify a class to supply a hash function that converts a key value into an hashed integer. This class must have the form:
Like the Array class, the key and value types are expected to be copy-by-value types, so if you define them to be pointer types, this class won't delete the objects that they point to.
If you don't supply a class for the HashFunctionType template parameter, the default one provides some simple mappings for strings and ints.
HashFunctionType | The class of hash function, which must be copy-constructible. |
Definition at line 107 of file juce_HashMap.h.
|
inlineexplicit |
Creates an empty hash-map.
numberOfSlots | Specifies the number of hash entries the map will use. This will be the "upperLimit" parameter that is passed to your generateHash() function. The number of hash slots will grow automatically if necessary, or it can be remapped manually using remapTable(). |
hashFunction | An instance of HashFunctionType, which will be copied and stored to use with the HashMap. This parameter can be omitted if HashFunctionType has a default constructor. |
Definition at line 125 of file juce_HashMap.h.
|
inline |
Destructor.
Definition at line 133 of file juce_HashMap.h.
|
inline |
Removes all values from the map.
Note that this will clear the content, but won't affect the number of slots (see remapTable and getNumSlots).
Definition at line 143 of file juce_HashMap.h.
|
inlinenoexcept |
Returns the current number of items in the map.
Definition at line 165 of file juce_HashMap.h.
|
inline |
Returns the value corresponding to a given key.
If the map doesn't contain the key, a default instance of the value type is returned.
keyToLookFor | the key of the item being requested |
Definition at line 174 of file juce_HashMap.h.
|
inline |
Returns a reference to the value corresponding to a given key.
If the map doesn't contain the key, a default instance of the value type is added to the map and a reference to this is returned.
keyToLookFor | the key of the item being requested |
Definition at line 189 of file juce_HashMap.h.
Referenced by juce::ZipFile::Builder::writeToStream().
|
inline |
Returns true if the map contains an item with the specified key.
Definition at line 211 of file juce_HashMap.h.
|
inline |
Returns true if the hash contains at least one occurrence of a given value.
Definition at line 219 of file juce_HashMap.h.
|
inline |
Adds or replaces an element in the hash-map.
If there's already an item with the given key, this will replace its value. Otherwise, a new item will be added to the map.
Definition at line 236 of file juce_HashMap.h.
|
inline |
Removes an item with the given key.
Definition at line 239 of file juce_HashMap.h.
|
inline |
Removes all items with the given value.
Definition at line 270 of file juce_HashMap.h.
|
inline |
Remaps the hash-map to use a different number of slots for its hash function.
Each slot corresponds to a single hash-code, and each one can contain multiple items.
Definition at line 307 of file juce_HashMap.h.
References juce::Array< ElementType, TypeOfCriticalSectionToUse, minimumAllocatedSize >::getUnchecked(), juce::Array< ElementType, TypeOfCriticalSectionToUse, minimumAllocatedSize >::insertMultiple(), and juce::Array< ElementType, TypeOfCriticalSectionToUse, minimumAllocatedSize >::set().
|
inlinenoexcept |
Returns the number of slots which are available for hashing.
Each slot corresponds to a single hash-code, and each one can contain multiple items.
Definition at line 336 of file juce_HashMap.h.
|
inlinenoexcept |
Efficiently swaps the contents of two hash-maps.
Definition at line 344 of file juce_HashMap.h.
|
inlinenoexcept |
Returns the CriticalSection that locks this structure.
To lock, you can call getLock().enter() and getLock().exit(), or preferably use an object of ScopedLockType as an RAII lock for it.
Definition at line 358 of file juce_HashMap.h.
|
inlinenoexcept |
Returns a start iterator for the values in this tree.
Definition at line 474 of file juce_HashMap.h.
References juce::HashMap< KeyType, ValueType, HashFunctionType, TypeOfCriticalSectionToUse >::Iterator::next().
|
inlinenoexcept |
Returns an end iterator for the values in this tree.
Definition at line 477 of file juce_HashMap.h.
References juce::DefaultHashFunctions::generateHash(), and juce::Array< ElementType, TypeOfCriticalSectionToUse, minimumAllocatedSize >::getUnchecked().