A peer-to-peer stack for code collaboration
Implement take-while for sequences (#315)
Merle Breitkreuz95674752e28b
diff --git a/docs/source/reference.rst b/docs/source/reference.rstindex b697925..abe2158 100644--- a/docs/source/reference.rst+++ b/docs/source/reference.rst@@ -794,6 +794,12 @@ Concatenates ``list1`` and ``list2``.Returns ``ls`` with only the elements that satisfy ``pred``.+``(take-while pred ls)``+~~~~~~~~~~~~~~~~~~~~~~~~++Returns all elements of a sequence ``ls`` until one does not satisfy+``pred``+``prelude/dict``----------------diff --git a/rad/prelude/list.rad b/rad/prelude/list.radindex 0be4ced..96969ef 100644--- a/rad/prelude/list.rad+++ b/rad/prelude/list.rad@@ -1,10 +1,11 @@{:module 'prelude/list:doc "Functions for manipulating lists."- :exports ['nil 'empty? 'reverse 'range 'concat 'filter]}+ :exports ['nil 'empty? 'reverse 'range 'concat 'filter 'take-while]};; nil(import prelude/basic :unqualified)+(import prelude/bool :unqualified)(def nil "The empty list." (list))@@ -76,3 +77,20 @@[ (filter (fn [x] (< x 10)) [3 10 11 5])==> [3 5] ])++;; take-while++(def-rec take-while+ "Returns all elements of a sequence `ls` until one does not satisfy `pred`"+ (fn [pred ls]+ (cond+ (empty? ls) ls+ (pred (head ls)) (cons (head ls) (take-while pred (tail ls)))+ :else (if (list? ls)+ (list)+ []))))++(:test "take-while"+ [ (take-while (fn [x] (eq? x "bar")) (list "foo" "bar") ) ==> () ]+ [ (take-while (fn [x] (not (eq? x "bar"))) (list "foo" "bar") ) ==> ("foo") ]+ [ (take-while (fn [x] (< x 10)) [3 9 10 11] ) ==> [3 9] ])