HashMap.put

put pair (k,v) into hash. inherits @safe and @nogc properties from K and V It can resize table if table is overloaded or has too much deleted entries. Returns: Nullable with old value if value was updated, or empty Nullable if we just stored new value.

struct HashMap(K, V, Allocator = Mallocator, bool GCRangesAllowed = true)
put
(
K
)
(
K k
,
V v
)