StringMap
haxe.ds.StringMap (Class)
StringMap allows mapping of String keys to arbitrary values.
See Map for documentation details.
See: https://haxe.org/manual/std-Map.html
Instance Members
set(key: String, value: haxe.ds.StringMap.T): Void
See Map.set
| Name |
Type |
key |
String |
value |
haxe.ds.StringMap.T |
See Map.get
| Returns |
| Null<haxe.ds.StringMap.T> |
See Map.exists
See Map.remove
See Map.keys
(cs, java) Implementation detail: Do not set() any new value while
iterating, as it may cause a resize, which will break iteration.
See Map.iterator
(cs, java) Implementation detail: Do not set() any new value while
iterating, as it may cause a resize, which will break iteration.
See Map.keyValueIterator
See Map.clear
Creates a new StringMap.
Private Members
This is the most important structure here and the reason why it's so fast.
It's an array of all the hashes contained in the table. These hashes cannot be 0 nor 1,
which stand for "empty" and "deleted" states.
The lookup algorithm will keep looking until a 0 or the key wanted is found;
The insertion algorithm will do the same but will also break when FLAG_DEL is found;
| Name |
Type |
newNBuckets |
Int |