HP Integrity NonStop J-Series - Manual (Page 308)

Comments Insertion happens
based on the hashing
function.
Constant time costs
assume that the items
are well scattered in the
hash slots. Worst case
is linear in the number
of items per slot.
Replace for dictionary
or map: The new value
is copied in place.
Otherwise, requires
remove then insert. Does not automatically resize.
We recommend that the number of items
be between one half and double the number
of slots for most uses.