the keys to create a tree data structure with the hash
> value as a search key. seq on hash-map's traverses these trees in a
> deterministic order, so the return order of keys from the clojure.core/keys
> or clojure.core/seq functions are in increasing order of hash value of t
in a
deterministic order, so the return order of keys from the clojure.core/keys
or clojure.core/seq functions are in increasing order of hash value of the
keys (or maybe it is decreasing -- either way, it is independent of the
order that you added the keys to the map).
For memory and run-time efficiency,
Why does the keys function return unexpected order when there are 8 or more
keys in a map?
I believe the order issue also applies to seq.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
N
