Package "srfi1"


Version:
v1.0.16
Released:
2433 days ago
Maintainer:
Jeremie Lasalle Ratelle <pouexmachinax at gmail.com>
Author:
Olin Shivers <shivers at ai.mit.edu>
Homepage:
http://srfi.schemers.org/srfi-1
Description:
Coherent and comprehensive set of list-processing procedures
Keywords:
srfi
Package form:
(package*
 srfi1/v1.0.16
 (provide:
  (define (xcons d a))
  (define (make-list len . maybe-elt))
  (define (list-tabulate len proc))
  (define (cons* first . rest))
  (define (list-copy lis))
  (define (iota count . maybe-start+step))
  (define (circular-list val1 . vals))
  (define (proper-list? x))
  (define (dotted-list? x))
  (define (circular-list? x))
  (define (not-pair? x))
  (define (null-list? l))
  (define (list= = . lists))
  (define (length+ x))
  (define (zip list1 . more-lists))
  (define (first x))
  (define (second x))
  (define (third x))
  (define (fourth x))
  (define (fifth x))
  (define (sixth x))
  (define (seventh x))
  (define (eighth x))
  (define (ninth x))
  (define (tenth x))
  (define (car+cdr pair))
  (define (take lis k))
  (define (drop lis k))
  (define (take! lis k))
  (define (take-right lis k))
  (define (drop-right lis k))
  (define (drop-right! lis k))
  (define (split-at x k))
  (define (split-at! x k))
  (define (last lis))
  (define (last-pair lis))
  (define (unzip1 lis))
  (define (unzip2 lis))
  (define (unzip3 lis))
  (define (unzip4 lis))
  (define (unzip5 lis))
  (define (append! . lists))
  (define (append-reverse rev-head tail))
  (define (append-reverse! rev-head tail))
  (define (concatenate lists))
  (define (concatenate! lists))
  (define (count pred list1 . lists))
  (define (unfold-right p f g seed . maybe-tail))
  (define (unfold p f g seed . maybe-tail-gen))
  (define (fold kons knil lis1 . lists))
  (define (fold-right kins knil lis1 . lists))
  (define (pair-fold-right f zero lis1 . lists))
  (define (pair-fold f zero lis1 . lists))
  (define (reduce f ridentity lis))
  (define (reduce-right f ridentity lis))
  (define (append-map f lis1 . lists))
  (define (append-map! f lis2 . lists))
  (define (pair-for-each proc lis1 . lists))
  (define (map! f lis1 . lists))
  (define (filter-map f lis1 . lists))
  (define (map-in-order f lis1 . lists))
  (define (map f lis1 . lists))
  (define (filter pred lis))
  (define (filter! pred lis))
  (define (partition pred lis))
  (define (partition! pred lis))
  (define (remove pred l))
  (define (remove! pred l))
  (define (delete x lis . maybe-=))
  (define (delete! x lis . maybe-=))
  (define (member x lis . maybe-=))
  (define (delete-duplicates lis . maybe-=))
  (define (delete-duplicates! lis . maybe-=))
  (define (assoc x lis . maybe-=))
  (define (alist-cons key datum alist))
  (define (alist-copy alist))
  (define (alist-delete key alist . maybe-=))
  (define (alist-delete! key alist . maybe-=))
  (define (find pred list))
  (define (find-tail pred list))
  (define (take-while pred lis))
  (define (drop-while pred lis))
  (define (take-while! pred lis))
  (define (span pred lis))
  (define (span! pred lis))
  (define (break pred lis))
  (define (break! pred lis))
  (define (any pred lis1 . lists))
  (define (every pred lis1 . lists))
  (define (list-index pred lis1 . lists))
  (define (reverse! lis))
  (define (lset<= = . lists))
  (define (lset= = . lists))
  (define (lset-adjoin = lis . elts))
  (define (lset-union = . lists))
  (define (lset-union! = . lists))
  (define (lset-intersection = lis1 . lists))
  (define (lset-intersection! = lis1 . lists))
  (define (lset-difference = lis1 . lists))
  (define (lset-difference! = lis1 . lists))
  (define (lset-xor = . lists))
  (define (lset-xor! = . lists)))
 (author: "Olin Shivers <shivers at ai.mit.edu>")
 (maintainer: "Jeremie Lasalle Ratelle <pouexmachinax at gmail.com>")
 (description: "Coherent and comprehensive set of list-processing procedures")
 (keywords: srfi)
 (homepage: "http://srfi.schemers.org/srfi-1"))

Version:
v1.0.15
Released:
2729 days ago
Maintainer:
Pouex Machinax <pouexmachinax at gmail.com>
Author:
Olin Shivers <shivers at ai.mit.edu>
Homepage:
---
Description:
Coherent and comprehensive set of list-processing procedures
Keywords:
srfi
Package form:
(package*
 srfi1/v1.0.15
 (author: "Olin Shivers <shivers at ai.mit.edu>")
 (maintainer: "Pouex Machinax <pouexmachinax at gmail.com>")
 (description: "Coherent and comprehensive set of list-processing procedures")
 (keywords: srfi)
 (provide:
  (define* (xcons d a))
  (define* (make-list len (elt #f)))
  (define* (list-tabulate len proc))
  (define* (cons* first . rest))
  (define* (list-copy lis))
  (define* (iota count (start _) (step _)))
  (define* (circular-list val1 . vals))
  (define* (proper-list? x))
  (define* (dotted-list? x))
  (define* (circular-list? x))
  (define* (not-pair? x))
  (define* (null-list? l))
  (define* (list= = . lists))
  (define* (length+ x))
  (define* (zip list1 . more-lists))
  (define* (first x))
  (define* (second x))
  (define* (third x))
  (define* (fourth x))
  (define* (fifth x))
  (define* (sixth x))
  (define* (seventh x))
  (define* (eighth x))
  (define* (ninth x))
  (define* (tenth x))
  (define* (car+cdr pair))
  (define* (take lis k))
  (define* (drop lis k))
  (define* (take! lis k))
  (define* (take-right lis k))
  (define* (drop-right lis k))
  (define* (drop-right! lis k))
  (define* (split-at x k))
  (define* (split-at! x k))
  (define* (last lis))
  (define* (last-pair lis))
  (define* (unzip1 lis))
  (define* (unzip2 lis))
  (define* (unzip3 lis))
  (define* (unzip4 lis))
  (define* (unzip5 lis))
  (define* (append! . lists))
  (define* (append-reverse rev-head tail))
  (define* (append-reverse! rev-head tail))
  (define* (concatenate lists))
  (define* (concatenate! lists))
  (define* (count pred list1 . lists))
  (define* (unfold-right p f g seed (tail _)))
  (define* (unfold p f g seed tail-gen))
  (define* (fold kons knil lis1 . lists))
  (define* (fold-right kins knil lis1 . lists))
  (define* (pair-fold-right f zero lis1 . lists))
  (define* (pair-fold f zero lis1 . lists))
  (define* (reduce f ridentity lis))
  (define* (reduce-right f ridentity lis))
  (define* (append-map f lis1 . lists))
  (define* (append-map! f lis2 . lists))
  (define* (pair-for-each proc lis1 . lists))
  (define* (map! f lis1 . lists))
  (define* (filter-map f lis1 . lists))
  (define* (map-in-order f lis1 . lists))
  (define* (map f lis1 . lists))
  (define* (filter pred lis))
  (define* (filter! pred lis))
  (define* (partition pred lis))
  (define* (partition! pred lis))
  (define* (remove pred l))
  (define* (remove! pred l))
  (define* (delete x lis (= _)))
  (define* (delete! x lis (= _)))
  (define* (member x lis (= _)))
  (define* (delete-duplicates lis (elt= _)))
  (define* (delete-duplicates! lis (elt= _)))
  (define* (assoc x lis (= _)))
  (define* (alist-cons key datum alist))
  (define* (alist-copy alist))
  (define* (alist-delete key alist (= _)))
  (define* (alist-delete! key alist (= _)))
  (define* (find pred list))
  (define* (find-tail pred list))
  (define* (take-while pred lis))
  (define* (drop-while pred lis))
  (define* (take-while! pred lis))
  (define* (span pred lis))
  (define* (span! pred lis))
  (define* (break pred lis))
  (define* (break! pred lis))
  (define* (any pred lis1 . lists))
  (define* (every pred lis1 . lists))
  (define* (list-index pred lis1 . lists))
  (define* (reverse! lis))
  (define* (lset<= = . lists))
  (define* (lset= = . lists))
  (define* (lset-adjoin = lis . elts))
  (define* (lset-union = . lists))
  (define* (lset-union! = . lists))
  (define* (lset-intersection = lis1 . lists))
  (define* (lset-intersection! = lis1 . lists))
  (define* (lset-difference = lis1 . lists))
  (define* (lset-difference! = lis1 . lists))
  (define* (lset-xor = . lists))
  (define* (lset-xor! = . lists))))

Version:
v1.0.14
Released:
2729 days ago
Maintainer:
---
Author:
---
Homepage:
---
Description:
---
Keywords:
---
Package form:
(package*
 srfi1/v1.0.14
 (provide:
  (define* (xcons d a))
  (define* (make-list len (elt #f)))
  (define* (list-tabulate len proc))
  (define* (cons* first . rest))
  (define* (list-copy lis))
  (define* (iota count (start _) (step _)))
  (define* (circular-list val1 . vals))
  (define* (proper-list? x))
  (define* (dotted-list? x))
  (define* (circular-list? x))
  (define* (not-pair? x))
  (define* (null-list? l))
  (define* (list= = . lists))
  (define* (length+ x))
  (define* (zip list1 . more-lists))
  (define* (first x))
  (define* (second x))
  (define* (third x))
  (define* (fourth x))
  (define* (fifth x))
  (define* (sixth x))
  (define* (seventh x))
  (define* (eighth x))
  (define* (ninth x))
  (define* (tenth x))
  (define* (car+cdr pair))
  (define* (take lis k))
  (define* (drop lis k))
  (define* (take! lis k))
  (define* (take-right lis k))
  (define* (drop-right lis k))
  (define* (drop-right! lis k))
  (define* (split-at x k))
  (define* (split-at! x k))
  (define* (last lis))
  (define* (last-pair lis))
  (define* (unzip1 lis))
  (define* (unzip2 lis))
  (define* (unzip3 lis))
  (define* (unzip4 lis))
  (define* (unzip5 lis))
  (define* (append! . lists))
  (define* (append-reverse rev-head tail))
  (define* (append-reverse! rev-head tail))
  (define* (concatenate lists))
  (define* (concatenate! lists))
  (define* (count pred list1 . lists))
  (define* (unfold-right p f g seed (tail _)))
  (define* (unfold p f g seed tail-gen))
  (define* (fold kons knil lis1 . lists))
  (define* (fold-right kins knil lis1 . lists))
  (define* (pair-fold-right f zero lis1 . lists))
  (define* (pair-fold f zero lis1 . lists))
  (define* (reduce f ridentity lis))
  (define* (reduce-right f ridentity lis))
  (define* (append-map f lis1 . lists))
  (define* (append-map! f lis2 . lists))
  (define* (pair-for-each proc lis1 . lists))
  (define* (map! f lis1 . lists))
  (define* (filter-map f lis1 . lists))
  (define* (map-in-order f lis1 . lists))
  (define* (map f lis1 . lists))
  (define* (filter pred lis))
  (define* (filter! pred lis))
  (define* (partition pred lis))
  (define* (partition! pred lis))
  (define* (remove pred l))
  (define* (remove! pred l))
  (define* (delete x lis (= _)))
  (define* (delete! x lis (= _)))
  (define* (member x lis (= _)))
  (define* (delete-duplicates lis (elt= _)))
  (define* (delete-duplicates! lis (elt= _)))
  (define* (assoc x lis (= _)))
  (define* (alist-cons key datum alist))
  (define* (alist-copy alist))
  (define* (alist-delete key alist (= _)))
  (define* (alist-delete! key alist (= _)))
  (define* (find pred list))
  (define* (find-tail pred list))
  (define* (take-while pred lis))
  (define* (drop-while pred lis))
  (define* (take-while! pred lis))
  (define* (span pred lis))
  (define* (span! pred lis))
  (define* (break pred lis))
  (define* (break! pred lis))
  (define* (any pred lis1 . lists))
  (define* (every pred lis1 . lists))
  (define* (list-index pred lis1 . lists))
  (define* (reverse! lis))
  (define* (lset<= = . lists))
  (define* (lset= = . lists))
  (define* (lset-adjoin = lis . elts))
  (define* (lset-union = . lists))
  (define* (lset-union! = . lists))
  (define* (lset-intersection = lis1 . lists))
  (define* (lset-intersection! = lis1 . lists))
  (define* (lset-difference = lis1 . lists))
  (define* (lset-difference! = lis1 . lists))
  (define* (lset-xor = . lists))
  (define* (lset-xor! = . lists))))