unfold.lisp @@ -40,6 +40,7 @@ (:file "curry") (:file "vector") (:file "assemble") + (:file "unfold") (:file "range") (:file "prelude") (:file "hash-table") incf-cl.asd @@ -29,6 +29,7 @@ (:export #:curry #:vector+ #:vector- #:vector* #:vector> #:vector= #:vector-zero-p #:assemble #:<- + #:unfold #:unfold-right #:range #:break* #:drop #:drop-while #:filter #:flip #:insert #:replicate #:span #:split-at #:take #:take-while #:unzip package.lisp @@ -26,6 +26,8 @@ ;;; resembling Matlab vector notation). (defun range (a b &optional c) + ;; This could be implemented using unfold too but we do it this way + ;; for efficiency. (flet ((aux (start step stop) (assert (and (<= start stop) (> step 0))) (loop for x from start to stop by step collect x))) range.lisp @@ -174,6 +174,34 @@ (is (string= "Hello, world" (string-join (list "Hello" "world") ", ")))) +(defun read-lines (stream) + (when (streamp stream) + (unfold (curry #'eq stream) + #'identity + (lambda (x) + (declare (ignore x)) + (read-line stream nil stream)) + (read-line stream nil stream)))) + +(deftest test-unfold () + (is (eq nil (unfold (constantly t) #'identity #'identity 0))) + (is (eq t (doctest :incf-cl :function #'unfold))) + (is (equal (range 0 .1 (/ pi 2)) + (unfold (curry (flip #'>) (/ pi 2)) + #'identity + (lambda (x) (+ x 0.1)) + 0))) + (with-input-from-string (stream + "1 + 2 + 3") + (is (equal (list "1" "2" "3") + (mapcar (curry #'string-trim " #\Tab") + (read-lines stream)))))) + +(deftest test-unfold-right () + (is (eq t (doctest :incf-cl :function #'unfold-right)))) + (deftest test-doctest () "This is a sample docstring. tests.lisp 02ff91200a1dc984c471897d6d4f9ab8b677c774 Juan M. Bello Rivas jmbr@superadditive.com http://github.com/jmbr/incf-cl/commit/b87f605079df6cd96abea6a7e748b1f5d06c4083 b87f605079df6cd96abea6a7e748b1f5d06c4083 2007-12-14T07:44:59-08:00 2007-12-14T07:44:59-08:00 Implemented unfold and unfold-right 5a88af2d07f8220c5bf0dcaf19289d9b7590c5b9 Juan M. Bello Rivas jmbr@superadditive.com