From 4f2c7bb5cf6828eb710fd18b603828ab295d0fa5 Mon Sep 17 00:00:00 2001
From: Stuart Halloway <stu@thinkrelevance.com>
Date: Wed, 24 Jun 2009 01:08:56 -0400
Subject: gtic: move clojure tests and supporting libraries into clojure repos

---
 .../contrib/test_clojure/data_structures.clj       | 735 ---------------------
 1 file changed, 735 deletions(-)
 delete mode 100644 src/clojure/contrib/test_clojure/data_structures.clj

(limited to 'src/clojure/contrib/test_clojure/data_structures.clj')

diff --git a/src/clojure/contrib/test_clojure/data_structures.clj b/src/clojure/contrib/test_clojure/data_structures.clj
deleted file mode 100644
index 7ca8f4e6..00000000
--- a/src/clojure/contrib/test_clojure/data_structures.clj
+++ /dev/null
@@ -1,735 +0,0 @@
-;;  Copyright (c) Frantisek Sodomka. All rights reserved.  The use and
-;;  distribution terms for this software are covered by the Eclipse Public
-;;  License 1.0 (http://opensource.org/licenses/eclipse-1.0.php) which can
-;;  be found in the file epl-v10.html at the root of this distribution.  By
-;;  using this software in any fashion, you are agreeing to be bound by the
-;;  terms of this license.  You must not remove this notice, or any other,
-;;  from this software.
-;;
-
-(ns clojure.contrib.test-clojure.data-structures
-  (:use clojure.contrib.test-is
-        [clojure.contrib.test-clojure.test-utils :only (all-are)]))
-
-
-;; *** Helper functions ***
-
-(defn diff [s1 s2]
-  (seq (reduce disj (set s1) (set s2))))
-
-
-;; *** General ***
-
-(defstruct equality-struct :a :b)
-
-(deftest test-equality
-  ; nil is not equal to any other value
-  (are [x] (not (= nil x))
-      true false
-      0 0.0
-      \space
-      "" #""
-      () [] #{} {}
-      (lazy-seq nil)  ; SVN 1292: fixed (= (lazy-seq nil) nil)
-      (lazy-seq ())
-      (lazy-seq [])
-      (lazy-seq {})
-      (lazy-seq #{})
-      (lazy-seq "")
-      (lazy-seq (into-array []))
-      (new Object) )
-
-  ; numbers equality across types (see tests below - NOT IMPLEMENTED YET)
-
-  ; ratios
-  (is (= 1/2 0.5))
-  (is (= 1/1000 0.001))
-  (is (not= 2/3 0.6666666666666666))
-
-  ; vectors equal other seqs by items equality
-  (are [x y] (= x y)
-      '() []        ; regression fixed in r1208; was not equal
-      '(1) [1]
-      '(1 2) [1 2]
-
-      [] '()        ; same again, but vectors first
-      [1] '(1)
-      [1 2] '(1 2) )
-  (is (not= [1 2] '(2 1)))  ; order of items matters
-
-  ; list and vector vs. set and map
-  (are [x y] (not= x y)
-      ; only () equals []
-      () #{}
-      () {}
-      [] #{}
-      [] {}
-      #{} {}
-      ; only '(1) equals [1]
-      '(1) #{1}
-      [1] #{1} )
-
-  ; sorted-map, hash-map and array-map - classes differ, but content is equal
-  
-;; TODO: reimplement all-are with new do-template?  
-;;   (all-are (not= (class _1) (class _2))
-;;       (sorted-map :a 1)
-;;       (hash-map   :a 1)
-;;       (array-map  :a 1))
-;;   (all-are (= _1 _2)
-;;       (sorted-map)
-;;       (hash-map)
-;;       (array-map))
-;;   (all-are (= _1 _2)
-;;       (sorted-map :a 1)
-;;       (hash-map   :a 1)
-;;       (array-map  :a 1))
-;;   (all-are (= _1 _2)
-;;       (sorted-map :a 1 :z 3 :c 2)
-;;       (hash-map   :a 1 :z 3 :c 2)
-;;       (array-map  :a 1 :z 3 :c 2))
-
-  ; struct-map vs. sorted-map, hash-map and array-map
-  (are [x] (and (not= (class (struct equality-struct 1 2)) (class x))
-                (= (struct equality-struct 1 2) x))
-      (sorted-map :a 1 :b 2)
-      (hash-map   :a 1 :b 2)
-      (array-map  :a 1 :b 2))
-
-  ; sorted-set vs. hash-set
-  (is (not= (class (sorted-set 1)) (class (hash-set 1))))
-  (are [x y] (= x y)
-      (sorted-set) (hash-set)
-      (sorted-set 1) (hash-set 1)
-      (sorted-set 3 2 1) (hash-set 3 2 1) ))
-
-
-;; *** Collections ***
-
-(deftest test-count
-  (are [x y] (= x y)
-      (count nil) 0
-
-      (count ()) 0
-      (count '(1)) 1
-      (count '(1 2 3)) 3
-
-      (count []) 0
-      (count [1]) 1
-      (count [1 2 3]) 3
-
-      (count #{}) 0
-      (count #{1}) 1
-      (count #{1 2 3}) 3
-
-      (count {}) 0
-      (count {:a 1}) 1
-      (count {:a 1 :b 2 :c 3}) 3
-
-      (count "") 0
-      (count "a") 1
-      (count "abc") 3
-
-      (count (into-array [])) 0
-      (count (into-array [1])) 1
-      (count (into-array [1 2 3])) 3
-
-      (count (java.util.ArrayList. [])) 0
-      (count (java.util.ArrayList. [1])) 1
-      (count (java.util.ArrayList. [1 2 3])) 3
-
-      (count (java.util.HashMap. {})) 0
-      (count (java.util.HashMap. {:a 1})) 1
-      (count (java.util.HashMap. {:a 1 :b 2 :c 3})) 3 )
-
-  ; different types
-  (are [x]  (= (count [x]) 1)
-      nil true false
-      0 0.0 "" \space
-      () [] #{} {}  ))
-
-
-(deftest test-conj
-  ; doesn't work on strings or arrays
-  (is (thrown? ClassCastException (conj "" \a)))
-  (is (thrown? ClassCastException (conj (into-array []) 1)))
-
-  (are [x y] (= x y)
-      (conj nil 1) '(1)
-      (conj nil 3 2 1) '(1 2 3)
-
-      (conj nil nil) '(nil)
-      (conj nil nil nil) '(nil nil)
-      (conj nil nil nil 1) '(1 nil nil)
-
-      ; list -> conj puts the item at the front of the list
-      (conj () 1) '(1)
-      (conj () 1 2) '(2 1)
-
-      (conj '(2 3) 1) '(1 2 3)
-      (conj '(2 3) 1 4 3) '(3 4 1 2 3)
-
-      (conj () nil) '(nil)
-      (conj () ()) '(())
-
-      ; vector -> conj puts the item at the end of the vector
-      (conj [] 1) [1]
-      (conj [] 1 2) [1 2]
-
-      (conj [2 3] 1) [2 3 1]
-      (conj [2 3] 1 4 3) [2 3 1 4 3]
-
-      (conj [] nil) [nil]
-      (conj [] []) [[]]
-
-      ; map -> conj expects another (possibly single entry) map as the item,
-      ;   and returns a new map which is the old map plus the entries
-      ;   from the new, which may overwrite entries of the old.
-      ;   conj also accepts a MapEntry or a vector of two items (key and value).
-      (conj {} {}) {}
-      (conj {} {:a 1}) {:a 1}
-      (conj {} {:a 1 :b 2}) {:a 1 :b 2}
-      (conj {} {:a 1 :b 2} {:c 3}) {:a 1 :b 2 :c 3}
-      (conj {} {:a 1 :b 2} {:a 3 :c 4}) {:a 3 :b 2 :c 4}
-
-      (conj {:a 1} {:a 7}) {:a 7}
-      (conj {:a 1} {:b 2}) {:a 1 :b 2}
-      (conj {:a 1} {:a 7 :b 2}) {:a 7 :b 2}
-      (conj {:a 1} {:a 7 :b 2} {:c 3}) {:a 7 :b 2 :c 3}
-      (conj {:a 1} {:a 7 :b 2} {:b 4 :c 5}) {:a 7 :b 4 :c 5}
-
-      (conj {} (first {:a 1})) {:a 1}           ; MapEntry
-      (conj {:a 1} (first {:b 2})) {:a 1 :b 2}
-      (conj {:a 1} (first {:a 7})) {:a 7}
-      (conj {:a 1} (first {:b 2}) (first {:a 5})) {:a 5 :b 2}
-
-      (conj {} [:a 1]) {:a 1}                   ; vector
-      (conj {:a 1} [:b 2]) {:a 1 :b 2}
-      (conj {:a 1} [:a 7]) {:a 7}
-      (conj {:a 1} [:b 2] [:a 5]) {:a 5 :b 2}
-
-      (conj {} {nil {}}) {nil {}}
-      (conj {} {{} nil}) {{} nil}
-      (conj {} {{} {}}) {{} {}}
-
-      ; set
-      (conj #{} 1) #{1}
-      (conj #{} 1 2 3) #{1 2 3}
-
-      (conj #{2 3} 1) #{3 1 2}
-      (conj #{3 2} 1) #{1 2 3}
-
-      (conj #{2 3} 2) #{2 3}
-      (conj #{2 3} 2 3) #{2 3}
-      (conj #{2 3} 4 1 2 3) #{1 2 3 4}
-
-      (conj #{} nil) #{nil}
-      (conj #{} #{}) #{#{}} ))
-
-
-;; *** Lists and Vectors ***
-
-(deftest test-peek
-  ; doesn't work for sets and maps
-  (is (thrown? ClassCastException (peek #{1})))
-  (is (thrown? ClassCastException (peek {:a 1})))
-
-  (are [x y] (= x y)
-      (peek nil) nil
-
-      ; list = first
-      (peek ()) nil
-      (peek '(1)) 1
-      (peek '(1 2 3)) 1
-
-      (peek '(nil)) nil     ; special cases
-      (peek '(1 nil)) 1
-      (peek '(nil 2)) nil
-      (peek '(())) ()
-      (peek '(() nil)) ()
-      (peek '(() 2 nil)) ()
-
-      ; vector = last
-      (peek []) nil
-      (peek [1]) 1
-      (peek [1 2 3]) 3
-
-      (peek [nil]) nil      ; special cases
-      (peek [1 nil]) nil
-      (peek [nil 2]) 2
-      (peek [[]]) []
-      (peek [[] nil]) nil
-      (peek [[] 2 nil]) nil ))
-
-
-(deftest test-pop
-  ; doesn't work for sets and maps
-  (is (thrown? ClassCastException (pop #{1})))
-  (is (thrown? ClassCastException (pop #{:a 1})))
-
-  ; collection cannot be empty
-  (is (thrown? IllegalStateException (pop ())))
-  (is (thrown? IllegalStateException (pop [])))
-
-  (are [x y] (= x y)
-      (pop nil) nil
-
-      ; list - pop first
-      (pop '(1)) ()
-      (pop '(1 2 3)) '(2 3)
-
-      (pop '(nil)) ()
-      (pop '(1 nil)) '(nil)
-      (pop '(nil 2)) '(2)
-      (pop '(())) ()
-      (pop '(() nil)) '(nil)
-      (pop '(() 2 nil)) '(2 nil)
-
-      ; vector - pop last
-      (pop [1]) []
-      (pop [1 2 3]) [1 2]
-
-      (pop [nil]) []
-      (pop [1 nil]) [1]
-      (pop [nil 2]) [nil]
-      (pop [[]]) []
-      (pop [[] nil]) [[]]
-      (pop [[] 2 nil]) [[] 2] ))
-
-
-;; *** Lists (IPersistentList) ***
-
-(deftest test-list
-  (are [x]  (list? x)
-      ()
-      '()
-      (list)
-      (list 1 2 3) )
-
-  ; order is important
-  (are [x y] (not (= x y))
-      (list 1 2) (list 2 1)
-      (list 3 1 2) (list 1 2 3) )
-
-  (are [x y] (= x y)
-      '() ()
-      (list) '()
-      (list 1) '(1)
-      (list 1 2) '(1 2)
-
-      ; nesting
-      (list 1 (list 2 3) (list 3 (list 4 5 (list 6 (list 7)))))
-        '(1 (2 3) (3 (4 5 (6 (7)))))
-
-      ; different data structures
-      (list true false nil)
-        '(true false nil)
-      (list 1 2.5 2/3 "ab" \x 'cd :kw)
-        '(1 2.5 2/3 "ab" \x cd :kw)
-      (list (list 1 2) [3 4] {:a 1 :b 2} #{:c :d})
-        '((1 2) [3 4] {:a 1 :b 2} #{:c :d})
-
-      ; evaluation
-      (list (+ 1 2) [(+ 2 3) 'a] (list (* 2 3) 8))
-        '(3 [5 a] (6 8))
-
-      ; special cases
-      (list nil) '(nil)
-      (list 1 nil) '(1 nil)
-      (list nil 2) '(nil 2)
-      (list ()) '(())
-      (list 1 ()) '(1 ())
-      (list () 2) '(() 2) ))
-
-
-;; *** Maps (IPersistentMap) ***
-
-(deftest test-find
-  (are [x y] (= x y)
-      (find {} :a) nil
-
-      (find {:a 1} :a) [:a 1]
-      (find {:a 1} :b) nil
-
-      (find {:a 1 :b 2} :a) [:a 1]
-      (find {:a 1 :b 2} :b) [:b 2]
-      (find {:a 1 :b 2} :c) nil
-
-      (find {} nil) nil
-      (find {:a 1} nil) nil
-      (find {:a 1 :b 2} nil) nil ))
-
-
-(deftest test-contains?
-  ; contains? is designed to work preferably on maps and sets
-  (are [x y] (= x y)
-      (contains? {} :a) false
-      (contains? {} nil) false
-
-      (contains? {:a 1} :a) true
-      (contains? {:a 1} :b) false
-      (contains? {:a 1} nil) false
-
-      (contains? {:a 1 :b 2} :a) true
-      (contains? {:a 1 :b 2} :b) true
-      (contains? {:a 1 :b 2} :c) false
-      (contains? {:a 1 :b 2} nil) false
-
-      ; sets
-      (contains? #{} 1) false
-      (contains? #{} nil) false
-
-      (contains? #{1} 1) true
-      (contains? #{1} 2) false
-      (contains? #{1} nil) false
-
-      (contains? #{1 2 3} 1) true
-      (contains? #{1 2 3} 3) true
-      (contains? #{1 2 3} 10) false
-      (contains? #{1 2 3} nil) false)
-
-  ; numerically indexed collections (e.g. vectors and Java arrays)
-  ; => test if the numeric key is WITHIN THE RANGE OF INDEXES
-  (are [x y] (= x y)
-      (contains? [] 0) false
-      (contains? [] -1) false
-      (contains? [] 1) false
-
-      (contains? [1] 0) true
-      (contains? [1] -1) false
-      (contains? [1] 1) false
-
-      (contains? [1 2 3] 0) true
-      (contains? [1 2 3] 2) true
-      (contains? [1 2 3] 3) false
-      (contains? [1 2 3] -1) false
-
-      ; arrays
-      (contains? (into-array []) 0) false
-      (contains? (into-array []) -1) false
-      (contains? (into-array []) 1) false
-
-      (contains? (into-array [1]) 0) true
-      (contains? (into-array [1]) -1) false
-      (contains? (into-array [1]) 1) false
-
-      (contains? (into-array [1 2 3]) 0) true
-      (contains? (into-array [1 2 3]) 2) true
-      (contains? (into-array [1 2 3]) 3) false
-      (contains? (into-array [1 2 3]) -1) false)
-
-  ; 'contains?' operates constant or logarithmic time,
-  ; it WILL NOT perform a linear search for a value.
-  (are [x]  (= x false)
-      (contains? '(1 2 3) 0)
-      (contains? '(1 2 3) 1)
-      (contains? '(1 2 3) 3)
-      (contains? '(1 2 3) 10)
-      (contains? '(1 2 3) nil)
-      (contains? '(1 2 3) ()) ))
-
-
-(deftest test-keys
-  (are [x y] (= x y)      ; other than map data structures
-      (keys ()) nil
-      (keys []) nil
-      (keys #{}) nil
-      (keys "") nil )
-
-  (are [x y] (= x y)
-      ; (class {:a 1}) => clojure.lang.PersistentArrayMap
-      (keys {}) nil
-      (keys {:a 1}) '(:a)
-      (diff (keys {:a 1 :b 2}) '(:a :b)) nil              ; (keys {:a 1 :b 2}) '(:a :b)
-
-      ; (class (sorted-map :a 1)) => clojure.lang.PersistentTreeMap
-      (keys (sorted-map)) nil
-      (keys (sorted-map :a 1)) '(:a)
-      (diff (keys (sorted-map :a 1 :b 2)) '(:a :b)) nil   ; (keys (sorted-map :a 1 :b 2)) '(:a :b)
-
-      ; (class (hash-map :a 1)) => clojure.lang.PersistentHashMap
-      (keys (hash-map)) nil
-      (keys (hash-map :a 1)) '(:a)
-      (diff (keys (hash-map :a 1 :b 2)) '(:a :b)) nil ))  ; (keys (hash-map :a 1 :b 2)) '(:a :b)
-
-
-(deftest test-vals
-  (are [x y] (= x y)      ; other than map data structures
-      (vals ()) nil
-      (vals []) nil
-      (vals #{}) nil
-      (vals "") nil )
-
-  (are [x y] (= x y)
-      ; (class {:a 1}) => clojure.lang.PersistentArrayMap
-      (vals {}) nil
-      (vals {:a 1}) '(1)
-      (diff (vals {:a 1 :b 2}) '(1 2)) nil              ; (vals {:a 1 :b 2}) '(1 2)
-
-      ; (class (sorted-map :a 1)) => clojure.lang.PersistentTreeMap
-      (vals (sorted-map)) nil
-      (vals (sorted-map :a 1)) '(1)
-      (diff (vals (sorted-map :a 1 :b 2)) '(1 2)) nil   ; (vals (sorted-map :a 1 :b 2)) '(1 2)
-
-      ; (class (hash-map :a 1)) => clojure.lang.PersistentHashMap
-      (vals (hash-map)) nil
-      (vals (hash-map :a 1)) '(1)
-      (diff (vals (hash-map :a 1 :b 2)) '(1 2)) nil ))  ; (vals (hash-map :a 1 :b 2)) '(1 2)
-
-
-(deftest test-key
-  (are [x]  (= (key (first (hash-map x :value))) x)
-      nil
-      false true
-      0 42
-      0.0 3.14
-      2/3
-      0M 1M
-      \c
-      "" "abc"
-      'sym
-      :kw
-      () '(1 2)
-      [] [1 2]
-      {} {:a 1 :b 2}
-      #{} #{1 2} ))
-
-
-(deftest test-val
-  (are [x]  (= (val (first (hash-map :key x))) x)
-      nil
-      false true
-      0 42
-      0.0 3.14
-      2/3
-      0M 1M
-      \c
-      "" "abc"
-      'sym
-      :kw
-      () '(1 2)
-      [] [1 2]
-      {} {:a 1 :b 2}
-      #{} #{1 2} ))
-
-
-;; *** Sets ***
-
-(deftest test-hash-set
-  (are [x] (set? x)
-      #{}
-      #{1 2}
-      (hash-set)
-      (hash-set 1 2) )
-
-  ; order isn't important
-  (are [x y] (= x y)
-      #{1 2} #{2 1}
-      #{3 1 2} #{1 2 3}
-      (hash-set 1 2) (hash-set 2 1)
-      (hash-set 3 1 2) (hash-set 1 2 3) )
-
-  ; equal and unique
-  (are [x] (and (= (hash-set x)   #{x})
-                (= (hash-set x x) #{x}))
-      nil
-      false true
-      0 42
-      0.0 3.14
-      2/3
-      0M 1M
-      \c
-      "" "abc"
-      'sym
-      :kw
-      () '(1 2)
-      [] [1 2]
-      {} {:a 1 :b 2}
-      #{} #{1 2} )
-
-  (are [x y] (= x y)
-      ; equal classes
-      (class #{}) (class (hash-set))
-      (class #{1 2}) (class (hash-set 1 2))
-
-      ; creating
-      (hash-set) #{}
-      (hash-set 1) #{1}
-      (hash-set 1 2) #{1 2}
-
-      ; nesting
-      (hash-set 1 (hash-set 2 3) (hash-set 3 (hash-set 4 5 (hash-set 6 (hash-set 7)))))
-        #{1 #{2 3} #{3 #{4 5 #{6 #{7}}}}}
-
-      ; different data structures
-      (hash-set true false nil)
-        #{true false nil}
-      (hash-set 1 2.5 2/3 "ab" \x 'cd :kw)
-        #{1 2.5 2/3 "ab" \x 'cd :kw}
-      (hash-set (list 1 2) [3 4] {:a 1 :b 2} #{:c :d})
-        #{'(1 2) [3 4] {:a 1 :b 2} #{:c :d}}
-
-      ; evaluation
-      (hash-set (+ 1 2) [(+ 2 3) :a] (hash-set (* 2 3) 8))
-        #{3 [5 :a] #{6 8}}
-
-      ; special cases
-      (hash-set nil) #{nil}
-      (hash-set 1 nil) #{1 nil}
-      (hash-set nil 2) #{nil 2}
-      (hash-set #{}) #{#{}}
-      (hash-set 1 #{}) #{1 #{}}
-      (hash-set #{} 2) #{#{} 2} ))
-
-
-(deftest test-sorted-set
-  ; only compatible types can be used
-  (is (thrown? ClassCastException (sorted-set 1 "a")))
-  (is (thrown? ClassCastException (sorted-set '(1 2) [3 4])))
-
-  ; creates set?
-  (are [x] (set? x)
-       (sorted-set)
-       (sorted-set 1 2) )
-
-  ; equal and unique
-  (are [x] (and (= (sorted-set x) #{x})
-                (= (sorted-set x x) (sorted-set x)))
-      nil
-      false true
-      0 42
-      0.0 3.14
-      2/3
-      0M 1M
-      \c
-      "" "abc"
-      'sym
-      :kw
-      ()  ; '(1 2)
-      [] [1 2]
-      {}  ; {:a 1 :b 2}
-      #{} ; #{1 2}
-  )
-  ; cannot be cast to java.lang.Comparable
-  (is (thrown? ClassCastException (sorted-set '(1 2) '(1 2))))
-  (is (thrown? ClassCastException (sorted-set {:a 1 :b 2} {:a 1 :b 2})))
-  (is (thrown? ClassCastException (sorted-set #{1 2} #{1 2})))
-
-  (are [x y] (= x y)
-      ; generating
-      (sorted-set) #{}
-      (sorted-set 1) #{1}
-      (sorted-set 1 2) #{1 2}
-
-      ; sorting
-      (seq (sorted-set 5 4 3 2 1)) '(1 2 3 4 5)
-
-      ; special cases
-      (sorted-set nil) #{nil}
-      (sorted-set 1 nil) #{nil 1}
-      (sorted-set nil 2) #{nil 2}
-      (sorted-set #{}) #{#{}} ))
-
-
-(deftest test-set
-  ; set?
-  (are [x] (set? (set x))
-      () '(1 2)
-      [] [1 2]
-      #{} #{1 2}
-      {} {:a 1 :b 2}
-      (into-array []) (into-array [1 2])
-      "" "abc" )
-
-  ; unique
-  (are [x] (= (set [x x]) #{x})
-      nil
-      false true
-      0 42
-      0.0 3.14
-      2/3
-      0M 1M
-      \c
-      "" "abc"
-      'sym
-      :kw
-      () '(1 2)
-      [] [1 2]
-      {} {:a 1 :b 2}
-      #{} #{1 2} )
-
-  ; conversion
-  (are [x y] (= (set x) y)
-      () #{}
-      '(1 2) #{1 2}
-
-      [] #{}
-      [1 2] #{1 2}
-
-      #{} #{}         ; identity
-      #{1 2} #{1 2}   ; identity
-
-      {} #{}
-      {:a 1 :b 2} #{[:a 1] [:b 2]}
-
-      (into-array []) #{}
-      (into-array [1 2]) #{1 2}
-
-      "" #{}
-      "abc" #{\a \b \c} ))
-
-
-(deftest test-disj
-  ; doesn't work on lists, vectors or maps
-  (is (thrown? ClassCastException (disj '(1 2) 1)))
-  (is (thrown? ClassCastException (disj [1 2] 1)))
-  (is (thrown? ClassCastException (disj {:a 1} :a)))
-
-  ; identity
-  (are [x] (= (disj x) x)
-      #{}
-      #{1 2 3}
-      ; different data types
-      #{nil
-        false true
-        0 42
-        0.0 3.14
-        2/3
-        0M 1M
-        \c
-        "" "abc"
-        'sym
-        :kw
-        [] [1 2]
-        {} {:a 1 :b 2}
-        #{} #{1 2}} )
-
-  ; type identity
-  (are [x] (= (class (disj x)) (class x))
-      (hash-set)
-      (hash-set 1 2)
-      (sorted-set)
-      (sorted-set 1 2) )
-
-  (are [x y] (= x y)
-      (disj #{} :a) #{}
-      (disj #{} :a :b) #{}
-
-      (disj #{:a} :a) #{}
-      (disj #{:a} :a :b) #{}
-      (disj #{:a} :c) #{:a}
-
-      (disj #{:a :b :c :d} :a) #{:b :c :d}
-      (disj #{:a :b :c :d} :a :d) #{:b :c}
-      (disj #{:a :b :c :d} :a :b :c) #{:d}
-      (disj #{:a :b :c :d} :d :a :c :b) #{}
-
-      (disj #{nil} :a) #{nil}
-      (disj #{nil} #{}) #{nil}
-      (disj #{nil} nil) #{}
-
-      (disj #{#{}} nil) #{#{}}
-      (disj #{#{}} #{}) #{}
-      (disj #{#{nil}} #{nil}) #{} ))
-
-
-- 
cgit v1.2.3-18-g5258