Construct a hashmap reserving a minimum of :minimumSize: space for the bucket list. The actual space allocated may be some number larger than the requested size, but it will be enough to fit as many items as requested without another allocation.
Copy an existing map into a new mutable map.
Get a value from the map, or return the given default value, which is lazy-evaluated.
Get a value from the map, or return V.init if a value is not set for a given key.
Implement the 'in' operator for a map.
Implement boolean conversion for a map.
Test if two maps are equal.
Retrieve a value from the map.
Set a value in the map.
Remove a entry from the map if it is set, given a key.
Get or create a value from/in the map.
Get or create a value from/in a hashmap.
This struct implements a hashmap type, much like the standard associative array type.
This map should be almost totally usable in @safe pure nothrow functions.
An empty map will be a valid object, and will not result in any allocations.