1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419
|
; Copyright (c) Rich Hickey. 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.
; Author: Frantisek Sodomka, Mike Hinchey, Stuart Halloway
;;
;; Test "flow control" constructs.
;;
(ns clojure.test-clojure.control
(:use clojure.test
clojure.test-helper))
;; *** Helper functions ***
(defn maintains-identity [f]
(are [x] (= (f 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} ))
; http://clojure.org/special_forms
; http://clojure.org/macros
(deftest test-do
(are [x y] (= x y)
; no params => nil
(do) nil
; return last
(do 1) 1
(do 1 2) 2
(do 1 2 3 4 5) 5
; evaluate and return last
(let [a (atom 0)]
(do (reset! a (+ @a 1)) ; 1
(reset! a (+ @a 1)) ; 2
(reset! a (+ @a 1)) ; 3
@a)) 3 )
; identity (= (do x) x)
(maintains-identity (fn [_] (do _))) )
;; loop/recur
(deftest test-loop
(are [x y] (= x y)
1 (loop []
1)
3 (loop [a 1]
(if (< a 3)
(recur (inc a))
a))
[2 4 6] (loop [a []
b [1 2 3]]
(if (seq b)
(recur (conj a (* 2 (first b)))
(next b))
a))
[6 4 2] (loop [a ()
b [1 2 3]]
(if (seq b)
(recur (conj a (* 2 (first b)))
(next b))
a))
)
)
;; throw, try
; if: see logic.clj
(deftest test-when
(are [x y] (= x y)
1 (when true 1)
nil (when true)
nil (when false)
nil (when false (exception))
))
(deftest test-when-not
(are [x y] (= x y)
1 (when-not false 1)
nil (when-not true)
nil (when-not false)
nil (when-not true (exception))
))
(deftest test-if-not
(are [x y] (= x y)
1 (if-not false 1)
1 (if-not false 1 (exception))
nil (if-not true 1)
2 (if-not true 1 2)
nil (if-not true (exception))
1 (if-not true (exception) 1)
))
(deftest test-when-let
(are [x y] (= x y)
1 (when-let [a 1]
a)
2 (when-let [[a b] '(1 2)]
b)
nil (when-let [a false]
(exception))
))
(deftest test-if-let
(are [x y] (= x y)
1 (if-let [a 1]
a)
2 (if-let [[a b] '(1 2)]
b)
nil (if-let [a false]
(exception))
1 (if-let [a false]
a 1)
1 (if-let [[a b] nil]
b 1)
1 (if-let [a false]
(exception)
1)
))
(deftest test-when-first
(are [x y] (= x y)
1 (when-first [a [1 2]]
a)
2 (when-first [[a b] '((1 2) 3)]
b)
nil (when-first [a nil]
(exception))
))
(deftest test-cond
(are [x y] (= x y)
(cond) nil
(cond nil true) nil
(cond false true) nil
(cond true 1 true (exception)) 1
(cond nil 1 false 2 true 3 true 4) 3
(cond nil 1 false 2 true 3 true (exception)) 3 )
; false
(are [x] (= (cond x :a true :b) :b)
nil false )
; true
(are [x] (= (cond x :a true :b) :a)
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} )
; evaluation
(are [x y] (= x y)
(cond (> 3 2) (+ 1 2) true :result true (exception)) 3
(cond (< 3 2) (+ 1 2) true :result true (exception)) :result )
; identity (= (cond true x) x)
(maintains-identity (fn [_] (cond true _))) )
(deftest test-condp
(are [x] (= :pass x)
(condp = 1
1 :pass
2 :fail)
(condp = 1
2 :fail
1 :pass)
(condp = 1
2 :fail
:pass)
(condp = 1
:pass)
(condp = 1
2 :fail
;; doc of condp says result-expr is returned
;; shouldn't it say similar to cond: "evaluates and returns
;; the value of the corresponding expr and doesn't evaluate any of the
;; other tests or exprs."
(identity :pass))
(condp + 1
1 :>> #(if (= % 2) :pass :fail))
(condp + 1
1 :>> #(if (= % 3) :fail :pass))
)
(is (thrown? IllegalArgumentException
(condp = 1)
))
(is (thrown? IllegalArgumentException
(condp = 1
2 :fail)
))
)
; [for, doseq (for.clj)]
(deftest test-dotimes
;; dotimes always returns nil
(is (= nil (dotimes [n 1] n)))
;; test using an atom since dotimes is for modifying
;; test executes n times
(is (= 3
(let [a (atom 0)]
(dotimes [n 3]
(swap! a inc))
@a)
))
;; test all values of n
(is (= [0 1 2]
(let [a (atom [])]
(dotimes [n 3]
(swap! a conj n))
@a)))
(is (= []
(let [a (atom [])]
(dotimes [n 0]
(swap! a conj n))
@a)))
)
(deftest test-while
(is (= nil (while nil (throw (Exception. "never")))))
(is (= [0 nil]
;; a will dec to 0
;; while always returns nil
(let [a (atom 3)
w (while (pos? @a)
(swap! a dec))]
[@a w])))
(is (thrown? Exception (while true (throw (Exception. "expected to throw")))))
)
; locking, monitor-enter, monitor-exit
; case
(deftest test-case
(testing "can match many kinds of things"
(let [two 2
test-fn
#(case %
1 :number
"foo" :string
\a :char
pow :symbol
:zap :keyword
(2 \b "bar") :one-of-many
[1 2] :sequential-thing
{:a 2} :map
{:r 2 :d 2} :droid
#{2 3 4 5} :set
[1 [[[2]]]] :deeply-nested
nil :nil
:default)]
(are [result input] (= result (test-fn input))
:number 1
:string "foo"
:char \a
:keyword :zap
:symbol 'pow
:one-of-many 2
:one-of-many \b
:one-of-many "bar"
:sequential-thing [1 2]
:sequential-thing (list 1 2)
:sequential-thing [1 two]
:map {:a 2}
:map {:a two}
:set #{2 3 4 5}
:set #{two 3 4 5}
:default #{2 3 4 5 6}
:droid {:r 2 :d 2}
:deeply-nested [1 [[[two]]]]
:nil nil
:default :anything-not-appearing-above)))
(testing "throws IllegalArgumentException if no match"
(is (thrown-with-msg?
IllegalArgumentException #"No matching clause: 2"
(case 2 1 :ok))))
(testing "sorting doesn't matter"
(let [test-fn
#(case %
{:b 2 :a 1} :map
#{3 2 1} :set
:default)]
(are [result input] (= result (test-fn input))
:map {:a 1 :b 2}
:map (sorted-map :a 1 :b 2)
:set #{3 2 1}
:set (sorted-set 2 1 3))))
(testing "test number equivalence"
(is (= :1 (case 1N 1 :1 :else))))
(testing "test warn when boxing/hashing expr for all-ints case"
(should-print-err-message
#"Performance warning, .*:\d+ - case has int tests, but tested expression is not primitive..*\r?\n"
(let [x (Object.)] (case x 1 1 2))))
(testing "test correct behavior on sparse ints"
(are [result input] (= result (case input
2r1000000000000000000000000000000 :big
1 :small
:else))
:small 1
:big 1073741824
:else 2)
(are [result input] (= result (case input
1 :small
2r1000000000000000000000000000000 :big
:else))
:small 1
:big 1073741824
:else 2))
(testing "test emits return types"
(should-not-reflect (Long. (case 1 1 1))) ; new Long(long)
(should-not-reflect (Long. (case 1 1 "1")))) ; new Long(String)
(testing "non-equivalence of chars and nums"
(are [result input] (= result (case input 97 :97 :else))
:else \a
:else (char \a)
:97 (int \a))
(are [result input] (= result (case input \a :a :else))
:else 97
:else 97N
:a (char 97)))
(testing "test error on duplicate test constants"
(is (thrown-with-msg?
IllegalArgumentException
#"Duplicate case test constant: 1"
(eval `(case 0 1 :x 1 :y)))))
(testing "test correct behaviour on Number truncation"
(let [^Object x (Long. 8589934591) ; force bindings to not be emitted as a primitive long
^Object y (Long. -1)]
(is (= :diff (case x -1 :oops :diff)))
(is (= :same (case y -1 :same :oops)))))
(testing "test correct behavior on hash collision"
(is (== (hash 1) (hash 9223372039002259457N)))
(are [result input] (= result (case input
1 :long
9223372039002259457N :big
:else))
:long 1
:big 9223372039002259457N
:else 4294967296
:else 2)
(are [result input] (= result (case input
9223372039002259457N :big
1 :long
:else))
:long 1
:big 9223372039002259457N
:else 4294967296
:else 2)
(are [result input] (= result (case input
0 :zero
-1 :neg1
2 :two
:oops :OOPS))
:zero 0
:neg1 -1
:two 2
:OOPS :oops)
(are [result input] (= result (case input
1204766517646190306 :a
1 :b
-2 :c
:d))
:a 1204766517646190306
:b 1
:c -2
:d 4294967296
:d 3))
(testing "test warn for hash collision"
(should-print-err-message
#"Performance warning, .*:\d+ - hash collision of some case test constants; if selected, those entries will be tested sequentially..*\r?\n"
(case 1 1 :long 9223372039002259457N :big 2)))
(testing "test constants are *not* evaluated"
(let [test-fn
;; never write code like this...
#(case %
(throw (RuntimeException. "boom")) :piece-of-throw-expr
:no-match)]
(are [result input] (= result (test-fn input))
:piece-of-throw-expr 'throw
:piece-of-throw-expr '[RuntimeException. "boom"]
:no-match nil))))
|