# Copyright (c) 2019 Calvin Rose # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to # deal in the Software without restriction, including without limitation the # rights to use, copy, modify, merge, publish, distribute, sublicense, and/or # sell copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in # all copies or substantial portions of the Software. # # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING # FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS # IN THE SOFTWARE. (import test/helper :prefix "" :exit true) (start-suite 3) (assert (= (length (range 10)) 10) "(range 10)") (assert (= (length (range 1 10)) 9) "(range 1 10)") (assert (deep= @{:a 1 :b 2 :c 3} (zipcoll '[:a :b :c] '[1 2 3])) "zipcoll") (def- a 100) (assert (= a 100) "def-") (assert (= :first (match @[1 3 5] @[x y z] :first :second)) "match 1") (def val1 :avalue) (assert (= :second (match val1 @[x y z] :first :avalue :second :third)) "match 2") (assert (= 100 (match @[50 40] @[x x] (* x 3) @[x y] (+ x y 10) 0)) "match 3") # Edge case should cause old compilers to fail due to # if statement optimization (var var-a 1) (var var-b (if false 2 (string "hello"))) (assert (= var-b "hello") "regression 1") # Some macros (assert (= 2 (if-not 1 3 2)) "if-not 1") (assert (= 3 (if-not false 3)) "if-not 2") (assert (= 3 (if-not nil 3 2)) "if-not 3") (assert (= nil (if-not true 3)) "if-not 4") (assert (= 4 (unless false (+ 1 2 3) 4)) "unless") (def res @{}) (loop [[k v] :pairs @{1 2 3 4 5 6}] (put res k v)) (assert (and (= (get res 1) 2) (= (get res 3) 4) (= (get res 5) 6)) "loop :pairs") # Another regression test - no segfaults (defn afn [x] x) (assert (= 1 (try (afn) ([err] 1))) "bad arity 1") (assert (= 4 (try ((fn [x y] (+ x y)) 1) ([_] 4))) "bad arity 2") (assert (= 1 (try (identity) ([err] 1))) "bad arity 3") (assert (= 1 (try (map) ([err] 1))) "bad arity 4") (assert (= 1 (try (not) ([err] 1))) "bad arity 5") # Assembly test # Fibonacci sequence, implemented with naive recursion. (def fibasm (asm '{ arity 1 bytecode [ (ltim 1 0 0x2) # $1 = $0 < 2 (jmpif 1 :done) # if ($1) goto :done (lds 1) # $1 = self (addim 0 0 -0x1) # $0 = $0 - 1 (push 0) # push($0), push argument for next function call (call 2 1) # $2 = call($1) (addim 0 0 -0x1) # $0 = $0 - 1 (push 0) # push($0) (call 0 1) # $0 = call($1) (add 0 0 2) # $0 = $0 + $2 (integers) :done (ret 0) # return $0 ] })) (assert (= 0 (fibasm 0)) "fibasm 1") (assert (= 1 (fibasm 1)) "fibasm 2") (assert (= 55 (fibasm 10)) "fibasm 3") (assert (= 6765 (fibasm 20)) "fibasm 4") # Calling non functions (assert (= 1 ({:ok 1} :ok)) "calling struct") (assert (= 2 (@{:ok 2} :ok)) "calling table") (assert (= :bad (try (@{:ok 2} :ok :no) ([err] :bad))) "calling table too many arguments") (assert (= :bad (try (:ok @{:ok 2} :no) ([err] :bad))) "calling keyword too many arguments") (assert (= :oops (try (1 1) ([err] :oops))) "calling number fails") # Method test (def Dog @{:bark (fn bark [self what] (string (self :name) " says " what "!"))}) (defn make-dog [name] (table/setproto @{:name name} Dog)) (assert (= "fido" ((make-dog "fido") :name)) "oo 1") (def spot (make-dog "spot")) (assert (= "spot says hi!" (:bark spot "hi")) "oo 2") # Negative tests (assert-error "+ check types" (+ 1 ())) (assert-error "- check types" (- 1 ())) (assert-error "* check types" (* 1 ())) (assert-error "/ check types" (/ 1 ())) (end-suite)