Implementation of HashMap which guarantees a stable
(between executions) order for its elements upon iteration.
This is quite useful for maps of Locals, to avoid nondeterministic
Constructs a DeterministicHashMap with the given initial capacity.
Constructs a DeterministicHashMap with the given initial capacity and load factor.
Inserts a mapping in this HashMap from
return super.put(key, value);
Returns a backed list of entries for this HashMap (unsupported).
Removes the given object from this HashMap (unsupported).
Returns a backed list of keys for this HashMap (unsupported).
ArraySet which doesn't check that the elements that you insert
are previous uncontained.
Create a set which contains the given elements.
for (Object element : elements)