About
maxon::HashMap is a generic class template for a map that maps keys to values with the help of hash values. It can use data types as a key that implement a "GetHashCode" and "IsEqual" function. maxon::HashMap is based on maxon::MapBase and maxon::Collection.
Create
A new hash map object can simply be created using the class template:
Definition: hashmap.h:1119
ResultRef< Entry > Insert(KEY &&key, const V &value, Bool &created=BoolLValue())
Definition: hashmap.h:1611
#define iferr_return
Definition: resultbase.h:1519
The data stored in a maxon::HashMap can be cleared with:
Access
An entry in a maxon::HashMap is represented as a maxon::HashMap::Entry object. New entries can be inserted with:
{
entry.SetValue("Beryllium"_s);
};
e->SetValue(
"Deuterium"_s);
Definition: hashmap.h:1954
Result< Entry * > InsertLambda(KEY &&key, LAMBDA &&lambda, Bool &created=BoolLValue())
Definition: hashmap.h:1592
ResultRef< Entry > InsertMultiEntry(KEY &&key)
Definition: hashmap.h:1658
ResultRef< V > InsertKey(const K &key, Bool &created=BoolLValue())
Definition: hashmap.h:1533
ResultRef< Entry > InsertEntry(const K &key, Bool &created=BoolLValue())
Definition: hashmap.h:1491
Definition: string.h:1235
void * str
Definition: bytesobject.h:77
bool Bool
boolean type, possible values are only false/true, 8 bit
Definition: apibase.h:181
return OK
Definition: apibase.h:2690
Py_ssize_t * e
Definition: longobject.h:89
An entry stored in the maxon::HashMap can be found using the proper key:
Opt< V & > FindValue(const KEY &key)
Definition: hashmap.h:1372
Entry * Find(const KEY &key)
Definition: hashmap.h:1340
#define DiagnosticOutput(formatString,...)
Definition: debugdiagnostics.h:176
An entry of the maxon::HashMap can also be deleted:
{
}
ResultOk< void > Erase(const Entry *entry, Bool deleteEntry=true)
Definition: hashmap.h:1716
It is easily possible to iterate trough all stored key and values with:
See also Iterate.
for (
const auto& it : atoms.
FindAll(1))
{
const auto value = it.GetValue();
}
PyObject * value
Definition: abstract.h:715
PyObject * key
Definition: abstract.h:289
KeyIterator GetKeys()
Definition: hashmap.h:2424
MultiEntryIterator< false > FindAll(const K &key)
Definition: hashmap.h:2131
ValueIterator GetValues()
Definition: hashmap.h:2442
Int64 Int
signed 32/64 bit int, size depends on the platform
Definition: apibase.h:188
A maxon::HashMap stores a certain number of elements and has a certain capacity to store further elements:
Py_ssize_t count
Definition: abstract.h:640
Int GetCount() const
Definition: hashmap.h:1242
Int GetNonEmptyBucketCount() const
Definition: hashmap.h:1280
Int GetTableSize() const
Definition: hashmap.h:1251
Iterate
It is easily to iterate over all entries in the maxon::HashMap:
for (
const auto&
e : atoms)
{
}
{
auto it = atoms.GetIterator(
e);
++it;
}
Utility
A maxon::HashMap can easily be copied:
Further utility functions are:
Further Reading