2023-01-07 21:04:16 +00:00
|
|
|
# Copyright (c) 2023 Calvin Rose & contributors
|
2019-02-25 17:49:04 +00:00
|
|
|
#
|
|
|
|
# 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.
|
|
|
|
|
2019-06-19 02:01:14 +00:00
|
|
|
(import ./helper :prefix "" :exit true)
|
2019-02-25 17:49:04 +00:00
|
|
|
(start-suite 5)
|
2019-03-08 05:41:26 +00:00
|
|
|
|
2019-03-08 15:17:57 +00:00
|
|
|
# Array remove
|
|
|
|
|
|
|
|
(assert (deep= (array/remove @[1 2 3 4 5] 2) @[1 2 4 5]) "array/remove 1")
|
|
|
|
(assert (deep= (array/remove @[1 2 3 4 5] 2 2) @[1 2 5]) "array/remove 2")
|
|
|
|
(assert (deep= (array/remove @[1 2 3 4 5] 2 200) @[1 2]) "array/remove 3")
|
|
|
|
(assert (deep= (array/remove @[1 2 3 4 5] -3 200) @[1 2 3]) "array/remove 4")
|
2019-02-25 17:49:04 +00:00
|
|
|
|
2019-03-09 21:47:05 +00:00
|
|
|
# Break
|
|
|
|
|
|
|
|
(var summation 0)
|
|
|
|
(for i 0 10
|
|
|
|
(+= summation i)
|
|
|
|
(if (= i 7) (break)))
|
|
|
|
(assert (= summation 28) "break 1")
|
|
|
|
|
|
|
|
(assert (= nil ((fn [] (break) 4))) "break 2")
|
|
|
|
|
2019-03-10 03:01:10 +00:00
|
|
|
# Break with value
|
|
|
|
|
|
|
|
# Shouldn't error out
|
|
|
|
(assert-no-error "break 3" (for i 0 10 (if (> i 8) (break i))))
|
|
|
|
(assert-no-error "break 4" ((fn [i] (if (> i 8) (break i))) 100))
|
|
|
|
|
2019-08-05 13:36:24 +00:00
|
|
|
# take
|
|
|
|
|
|
|
|
(assert (deep= (take 0 []) []) "take 1")
|
|
|
|
(assert (deep= (take 10 []) []) "take 2")
|
|
|
|
(assert (deep= (take 0 [1 2 3 4 5]) []) "take 3")
|
|
|
|
(assert (deep= (take 10 [1 2 3]) [1 2 3]) "take 4")
|
|
|
|
(assert (deep= (take -1 [:a :b :c]) []) "take 5")
|
2021-08-06 19:40:29 +00:00
|
|
|
(assert (deep= (take 3 (generate [x :in [1 2 3 4 5]] x)) @[1 2 3]) "take from fiber")
|
|
|
|
# NB: repeatedly resuming a fiber created with `generate` includes a `nil` as
|
|
|
|
# the final element. Thus a generate of 2 elements will create an array of 3.
|
2021-08-06 21:17:47 +00:00
|
|
|
(assert (= (length (take 4 (generate [x :in [1 2]] x))) 2) "take from short fiber")
|
2019-08-05 13:36:24 +00:00
|
|
|
|
|
|
|
# take-until
|
|
|
|
|
2019-08-06 07:33:55 +00:00
|
|
|
(assert (deep= (take-until pos? @[]) []) "take-until 1")
|
|
|
|
(assert (deep= (take-until pos? @[1 2 3]) []) "take-until 2")
|
|
|
|
(assert (deep= (take-until pos? @[-1 -2 -3]) [-1 -2 -3]) "take-until 3")
|
|
|
|
(assert (deep= (take-until pos? @[-1 -2 3]) [-1 -2]) "take-until 4")
|
|
|
|
(assert (deep= (take-until pos? @[-1 1 -2]) [-1]) "take-until 5")
|
|
|
|
(assert (deep= (take-until |(= $ 115) "books") "book") "take-until 6")
|
2021-08-06 19:40:29 +00:00
|
|
|
(assert (deep= (take-until |(= $ 115) (generate [x :in "books"] x))
|
|
|
|
@[98 111 111 107]) "take-until from fiber")
|
2019-08-05 13:36:24 +00:00
|
|
|
|
|
|
|
# take-while
|
|
|
|
|
2019-08-06 07:33:55 +00:00
|
|
|
(assert (deep= (take-while neg? @[]) []) "take-while 1")
|
|
|
|
(assert (deep= (take-while neg? @[1 2 3]) []) "take-while 2")
|
|
|
|
(assert (deep= (take-while neg? @[-1 -2 -3]) [-1 -2 -3]) "take-while 3")
|
|
|
|
(assert (deep= (take-while neg? @[-1 -2 3]) [-1 -2]) "take-while 4")
|
|
|
|
(assert (deep= (take-while neg? @[-1 1 -2]) [-1]) "take-while 5")
|
2021-08-06 19:40:29 +00:00
|
|
|
(assert (deep= (take-while neg? (generate [x :in @[-1 1 -2]] x))
|
|
|
|
@[-1]) "take-while from fiber")
|
2019-08-05 13:36:24 +00:00
|
|
|
|
|
|
|
# drop
|
|
|
|
|
|
|
|
(assert (deep= (drop 0 []) []) "drop 1")
|
|
|
|
(assert (deep= (drop 10 []) []) "drop 2")
|
|
|
|
(assert (deep= (drop 0 [1 2 3 4 5]) [1 2 3 4 5]) "drop 3")
|
|
|
|
(assert (deep= (drop 10 [1 2 3]) []) "drop 4")
|
2023-04-24 04:35:15 +00:00
|
|
|
(assert (deep= (drop -1 [1 2 3]) [1 2]) "drop 5")
|
|
|
|
(assert (deep= (drop -10 [1 2 3]) []) "drop 6")
|
|
|
|
(assert (deep= (drop 1 "abc") "bc") "drop 7")
|
|
|
|
(assert (deep= (drop 10 "abc") "") "drop 8")
|
|
|
|
(assert (deep= (drop -1 "abc") "ab") "drop 9")
|
|
|
|
(assert (deep= (drop -10 "abc") "") "drop 10")
|
|
|
|
(assert-error :invalid-type (drop 3 {}) "drop 11")
|
2019-08-05 13:36:24 +00:00
|
|
|
|
2019-03-10 06:50:28 +00:00
|
|
|
# drop-until
|
|
|
|
|
2019-08-06 07:33:55 +00:00
|
|
|
(assert (deep= (drop-until pos? @[]) []) "drop-until 1")
|
|
|
|
(assert (deep= (drop-until pos? @[1 2 3]) [1 2 3]) "drop-until 2")
|
|
|
|
(assert (deep= (drop-until pos? @[-1 -2 -3]) []) "drop-until 3")
|
|
|
|
(assert (deep= (drop-until pos? @[-1 -2 3]) [3]) "drop-until 4")
|
|
|
|
(assert (deep= (drop-until pos? @[-1 1 -2]) [1 -2]) "drop-until 5")
|
|
|
|
(assert (deep= (drop-until |(= $ 115) "books") "s") "drop-until 6")
|
2019-03-10 06:50:28 +00:00
|
|
|
|
2019-03-31 18:14:25 +00:00
|
|
|
# Quasiquote bracketed tuples
|
|
|
|
(assert (= (tuple/type ~[1 2 3]) (tuple/type '[1 2 3])) "quasiquote bracket tuples")
|
|
|
|
|
2019-03-09 21:47:05 +00:00
|
|
|
(end-suite)
|