mirror of
https://github.com/janet-lang/janet
synced 2024-11-15 21:24:48 +00:00
130 lines
4.1 KiB
Plaintext
130 lines
4.1 KiB
Plaintext
# Copyright (c) 2018 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 "")
|
|
(start-suite 1)
|
|
|
|
(assert (= 400.0 (sqrt 160000)) "sqrt(160000)=400")
|
|
(assert (= (real 400) (sqrt 160000)) "sqrt(160000)=400")
|
|
|
|
(def test-struct {'def 1 'bork 2 'sam 3 'a 'b 'het @[1 2 3 4 5]})
|
|
(assert (= (get test-struct 'def) 1) "struct get")
|
|
(assert (= (get test-struct 'bork) 2) "struct get")
|
|
(assert (= (get test-struct 'sam) 3) "struct get")
|
|
(assert (= (get test-struct 'a) 'b) "struct get")
|
|
(assert (= :array (type (get test-struct 'het))) "struct get")
|
|
|
|
(defn myfun [x]
|
|
(var a 10)
|
|
(:= a (do
|
|
(def y x)
|
|
(if x 8 9))))
|
|
|
|
(assert (= (myfun true) 8) "check do form regression")
|
|
(assert (= (myfun false) 9) "check do form regression")
|
|
|
|
(defn assert-many [f n e]
|
|
(var good true)
|
|
(loop [i :range [0 n]]
|
|
(if (not (f i))
|
|
(:= good false)))
|
|
(assert good e))
|
|
|
|
(assert-many (fn [] (>= 1 (random) 0)) 200 "(random) between 0 and 1")
|
|
|
|
## Table prototypes
|
|
|
|
(def roottab @{
|
|
:parentprop 123
|
|
})
|
|
|
|
(def childtab @{
|
|
:childprop 456
|
|
})
|
|
|
|
(table.setproto childtab roottab)
|
|
|
|
(assert (= 123 (get roottab :parentprop)) "table get 1")
|
|
(assert (= 123 (get childtab :parentprop)) "table get proto")
|
|
(assert (= nil (get roottab :childprop)) "table get 2")
|
|
(assert (= 456 (get childtab :childprop)) "proto no effect")
|
|
|
|
# Long strings
|
|
|
|
(assert (= "hello, world" `hello, world`) "simple long string")
|
|
(assert (= "hello, \"world\"" `hello, "world"`) "long string with embedded quotes")
|
|
(assert (= "hello, \\\\\\ \"world\"" `hello, \\\ "world"`),
|
|
"long string with embedded quotes and backslashes")
|
|
|
|
# More fiber semantics
|
|
|
|
(var myvar 0)
|
|
(defn fiberstuff []
|
|
(++ myvar)
|
|
(def f (fiber.new (fn [] (++ myvar) (debug) (++ myvar))))
|
|
(fiber.resume f)
|
|
(++ myvar))
|
|
|
|
(def myfiber (fiber.new fiberstuff :dey))
|
|
|
|
(assert (= myvar 0) "fiber creation does not call fiber function")
|
|
(fiber.resume myfiber)
|
|
(assert (= myvar 2) "fiber debug statement breaks at proper point")
|
|
(assert (= (fiber.status myfiber) :debug) "fiber enters debug state")
|
|
(fiber.resume myfiber)
|
|
(assert (= myvar 4) "fiber resumes properly from debug state")
|
|
(assert (= (fiber.status myfiber) :dead) "fiber properly dies from debug state")
|
|
|
|
# Test max triangle program
|
|
|
|
# Find the maximum path from the top (root)
|
|
# of the triangle to the leaves of the triangle.
|
|
|
|
(defn myfold [xs ys]
|
|
(let [xs1 (tuple.prepend xs 0)
|
|
xs2 (tuple.append xs 0)
|
|
m1 (map + xs1 ys)
|
|
m2 (map + xs2 ys)]
|
|
(map max m1 m2)))
|
|
|
|
(defn maxpath [t]
|
|
(extreme > (reduce myfold () t)))
|
|
|
|
# Test it
|
|
# Maximum path is 3 -> 10 -> 3 -> 9 for a total of 25
|
|
|
|
(def triangle '[
|
|
[3]
|
|
[7 10]
|
|
[4 3 7]
|
|
[8 9 1 3]
|
|
])
|
|
|
|
(assert (= (maxpath triangle) 25) `max triangle`)
|
|
|
|
(assert (= (string.join @["one" "two" "three"]) "onetwothree") "string.join 1 argument")
|
|
(assert (= (string.join @["one" "two" "three"] ", ") "one, two, three") "string.join 2 arguments")
|
|
(assert (= (string.join @[] ", ") "") "string.join empty array")
|
|
|
|
(assert (= (string.find "123" "abc123def") 3) "string.find positive")
|
|
(assert (= (string.find "1234" "abc123def") nil) "string.find negative")
|
|
|
|
(end-suite)
|