Too Long; Didn't Read
Map is basically key-value storage with really fast lookup. Hash map is based on random seed, so each map is built differently. Map is a pointer to hmap structure, it is mutable! If you need a new one, you shall create a copy of it manually. Hash function will transform keys like that: hash(key)->{1..BN; map(map) = fastrand(); Map is iterable, not ordered, and new iterable is randomized.