aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMark Engelberg <mark.engelberg@gmail.com>2011-05-20 21:35:06 -0700
committerMark Engelberg <mark.engelberg@gmail.com>2011-05-20 21:35:06 -0700
commit7bad658b80f5d948022d6b8ae0cc304eeccfa11b (patch)
tree29a5e26ca447026d4b497ca8a94b46c61113dc6d
parent9fe43dbfa1d38085eeee0392b7469ac79afa15c3 (diff)
Priority-map: Further modifications to equals and equiv methods
-rw-r--r--modules/priority-map/src/main/clojure/clojure/contrib/priority_map.clj4
1 files changed, 2 insertions, 2 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 158dc5fe..fb1b67b1 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
@@ -209,9 +209,9 @@ to Clojure's assortment of built-in maps (hash-map and sorted-map).
; Like sorted maps, priority maps are equal to other maps provided
; their key-value pairs are the same.
- (equiv [this o] (= item->priority o))
+ (equiv [this o] (.equiv item->priority o))
(hashCode [this] (.hashCode item->priority))
- (equals [this o] (.mapEquals item->priority o))
+ (equals [this o] (.equals item->priority o))
;containsKey implements (contains? pm k) behavior
(containsKey [this item] (contains? item->priority item))