package hamt

The number of bits taken from the hashed key at every step of an elementary function. Note that 2 ^ (2 ^ shift_step) must be a valid OCaml int on the considered architecture (the bigger the better).

Arbitrary. It is used to balance time and space consumption. A good value seems to be 2 ^ shift_step - 1.

Arbitrary. Must be lesser than bmnode_max. A good value seems to be bmnode_max / 2.