While searching for MultiSet or Bag resources, I found this implementation by Achim Passen at: A simple multiset/bag implementation for Clojure<https://github.com/achim/multiset> .
However, I found I could meet my needs by adding functions to treat vectors, or other collection types, as unordered. For the hash, from Clojure Data Structures<http://clojure.org/data_structures#hash> : (defn hash-unordered [collection] (-> (reduce unchecked-add-int 0 (map hash collection)) (mix-collection-hash (count collection)))) For equality: (defn equals-unordered [coll-a coll-b] "Treat collections as unordered for 1st level of comparison." (or (identical? coll-a coll-b) (and (empty? coll-a) (empty? coll-b)) (let [set-a (set coll-a) set-b (set coll-b)] (and (= set-a set-b) (loop [[item & items] (seq set-a)] (let [finder #(= item %) found-a (filter finder coll-a) found-b (filter finder coll-b)] (if (not= (count found-a) (count found-b)) false (if (empty? items) true (recur items))))))))) Neither Achim's deftype, nor the above, is likely as efficient as a core collection MultiSet. In the meantime, I hope these observations are useful. Greg -- 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 Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
