Std.HashMap.HashMap

type

This declaration introduces a public type.

What it does

A map that finds a key by hashing it rather than by comparing it.

The ordered Map reaches a key by comparison, so a lookup walks a tree

whose depth grows with the collection. This reaches a bucket by a number,

which costs the same at any size; what it gives up is that keys come back

in insertion order rather than sorted, and that a key must be able to hash

as well as compare equal.

placed counts upwards and is never reused. Two entries can therefore

never claim one position, which is what makes enumeration a total order

rather than an order with ties the sort would break arbitrarily.

Read the signature

• This declaration has no value signature because it introduces a type or trait.