aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMark Engelberg <mark.engelberg@gmail.com>2011-05-20 21:47:17 -0700
committerMark Engelberg <mark.engelberg@gmail.com>2011-05-20 21:47:17 -0700
commitaf2b419d3b6a77db735eff98eb48173376b8226c (patch)
treef25c4b7160c40d49032223e029e4d34d2a281a19
parent7bad658b80f5d948022d6b8ae0cc304eeccfa11b (diff)
Priority-map: One more improvement to equals method
-rw-r--r--modules/priority-map/src/main/clojure/clojure/contrib/priority_map.clj2
1 files changed, 1 insertions, 1 deletions
diff --git a/modules/priority-map/src/main/clojure/clojure/contrib/priority_map.clj b/modules/priority-map/src/main/clojure/clojure/contrib/priority_map.clj
index fb1b67b1..b29cf1f5 100644
--- a/modules/priority-map/src/main/clojure/clojure/contrib/priority_map.clj
+++ b/modules/priority-map/src/main/clojure/clojure/contrib/priority_map.clj
@@ -211,7 +211,7 @@ to Clojure's assortment of built-in maps (hash-map and sorted-map).
; their key-value pairs are the same.
(equiv [this o] (.equiv item->priority o))
(hashCode [this] (.hashCode item->priority))
- (equals [this o] (.equals item->priority o))
+ (equals [this o] (or (identical? this o) (.equals item->priority o)))
;containsKey implements (contains? pm k) behavior
(containsKey [this item] (contains? item->priority item))