4 ms·
Well, that is how hash tables in go works, so you'd not have to look that far.
by yxhuvud 1y ago
Well, that is how hash tables in go works, so you'd not have to look that far.
- not_kurt_godel 1y agoGreat. Maybe GP will go a step farther and also mandate arrays that return elements in random order too. Relying on insertion order for any reason is for weaklings.
- tasty_freeze 1y agoPerl since 5.8.something has had the option of perturbing the hash function, so it is different from run to run. You can also set the set to a given value in order to lock in the sequence. In any case, it is not ordered. If you want that, you have to explicitly sort the keys of the hash.