Package "srfi13"


Version:
v1.0.2
Released:
2377 days ago
Maintainer:
Jeremie Lasalle Ratelle <pouexmachinax at gmail.com>
Author:
Olin Shivers <shivers at ai.mit.edu>
Homepage:
http://srfi.schemers.org/srfi-13
Description:
Coherent and comprehensive set of string-processing procedures
Keywords:
srfi
Package form:
(package*
 srfi13/v1.0.2
 (provide:
  (define (string-map proc s . maybe-start+end))
  (define (string-map! proc s . maybe-start+end))
  (define (string-fold kons knil s . maybe-start+end))
  (define (string-fold-right kons knil s . maybe-start+end))
  (define (string-unfold p f g seed . base+make-final))
  (define (string-unfold-right p f g seed . base+make-final))
  (define (string-for-each proc s . maybe-start+end))
  (define (string-for-each-index proc s . maybe-start+end))
  (define (string-every criterion s . maybe-start+end))
  (define (string-any criterion s . maybe-start+end))
  (define (string-tabulate proc len))
  (define (string-prefix-length s1 s2 . maybe-starts+ends))
  (define (string-suffix-length s1 s2 . maybe-starts+ends))
  (define (string-prefix-length-ci s1 s2 . maybe-starts+ends))
  (define (string-suffix-length-ci s1 s2 . maybe-starts+ends))
  (define (string-prefix? s1 s2 . maybe-starts+ends))
  (define (string-suffix? s1 s2 . maybe-starts+ends))
  (define (string-prefix-ci? s1 s2 . maybe-starts+ends))
  (define (string-suffix-ci? s1 s2 . maybe-starts+ends))
  (define (string-compare s1 s2 proc< proc= proc> . maybe-starts+ends))
  (define (string-compare-ci s1 s2 proc< proc= proc> . maybe-starts+ends))
  (define (string= s1 s2 . maybe-starts+ends))
  (define (string<> s1 s2 . maybe-starts+ends))
  (define (string< s1 s2 . maybe-starts+ends))
  (define (string> s1 s2 . maybe-starts+ends))
  (define (string<= s1 s2 . maybe-starts+ends))
  (define (string>= s1 s2 . maybe-starts+ends))
  (define (string-ci= s1 s2 . maybe-starts+ends))
  (define (string-ci<> s1 s2 . maybe-starts+ends))
  (define (string-ci< s1 s2 . maybe-starts+ends))
  (define (string-ci> s1 s2 . maybe-starts+ends))
  (define (string-ci<= s1 s2 . maybe-starts+ends))
  (define (string-ci>= s1 s2 . maybe-starts+ends))
  (define (string-hash s . maybe-bound+start+end))
  (define (string-hash-ci s . maybe-bound+start+end))
  (define (string-upcase s . maybe-start+end))
  (define (string-upcase! s . maybe-start+end))
  (define (string-downcase s . maybe-start+end))
  (define (string-downcase! s . maybe-start+end))
  (define (string-titlecase! s . maybe-start+end))
  (define (string-titlecase s . maybe-start+end))
  (define (string-take s n))
  (define (string-take-right s n))
  (define (string-drop s n))
  (define (string-drop-right s n))
  (define (string-trim s . criterion+start+end))
  (define (string-trim-right s . criterion+start+end))
  (define (string-trim-both s . criterion+start+end))
  (define (string-pad-right s n . char+start+end))
  (define (string-pad s n . char+start+end))
  (define (string-delete criterion s . maybe-start+end))
  (define (string-filter criterion s . maybe-start+end))
  (define (string-index str criterion . maybe-start+end))
  (define (string-index-right str criterion . maybe-start+end))
  (define (string-skip str criterion . maybe-start+end))
  (define (string-skip-right str criterion . maybe-start+end))
  (define (string-count s criterion . maybe-start+end))
  (define (string-fill! s char . maybe-start+end))
  (define (string-copy! to tstart from . maybe-fstart+fend))
  (define (string-contains text pattern . maybe-starts+ends))
  (define (string-contains-ci text pattern . maybe-starts+ends))
  (define (string-null? s))
  (define (string-reverse s . maybe-start+end))
  (define (string-reverse! s . maybe-start+end))
  (define (reverse-list->string clist))
  (define (string->list s . maybe-start+end))
  (define (string-append/shared . strings))
  (define (string-concatenate/shared strings))
  (define (string-concatenate strings))
  (define (string-concatenate-reverse string-list . maybe-final+end))
  (define (string-concatenate-reverse/shared string-list . maybe-final+end))
  (define (string-replace s1 s2 start1 end1 . maybe-start+end))
  (define (string-tokenize s . token-chars+start+end))
  (define (xsubstring s from . maybe-to+start+end))
  (define (string-xcopy! target tstart s sfrom . maybe-sto+start+end))
  (define (string-join strings . delim+grammar)))
 (author: "Olin Shivers <shivers at ai.mit.edu>")
 (maintainer: "Jeremie Lasalle Ratelle <pouexmachinax at gmail.com>")
 (description:
  "Coherent and comprehensive set of string-processing procedures")
 (keywords: srfi)
 (homepage: "http://srfi.schemers.org/srfi-13")
 (require: fixnum/v1)
 (require: srfi14/v1))

Version:
v1.0.1
Released:
2478 days ago
Maintainer:
Jeremie Lasalle Ratelle <pouexmachinax at gmail.com>
Author:
Olin Shivers <shivers at ai.mit.edu>
Homepage:
http://srfi.schemers.org/srfi-13
Description:
Coherent and comprehensive set of string-processing procedures
Keywords:
srfi
Package form:
(package*
 srfi13/v1.0.1
 (provide:
  (define (string-map proc s . maybe-start+end))
  (define (string-map! proc s . maybe-start+end))
  (define (string-fold kons knil s . maybe-start+end))
  (define (string-fold-right kons knil s . maybe-start+end))
  (define (string-unfold p f g seed . base+make-final))
  (define (string-unfold-right p f g seed . base+make-final))
  (define (string-for-each proc s . maybe-start+end))
  (define (string-for-each-index proc s . maybe-start+end))
  (define (string-every criterion s . maybe-start+end))
  (define (string-any criterion s . maybe-start+end))
  (define (string-tabulate proc len))
  (define (string-prefix-length s1 s2 . maybe-starts+ends))
  (define (string-suffix-length s1 s2 . maybe-starts+ends))
  (define (string-prefix-length-ci s1 s2 . maybe-starts+ends))
  (define (string-suffix-length-ci s1 s2 . maybe-starts+ends))
  (define (string-prefix? s1 s2 . maybe-starts+ends))
  (define (string-suffix? s1 s2 . maybe-starts+ends))
  (define (string-prefix-ci? s1 s2 . maybe-starts+ends))
  (define (string-suffix-ci? s1 s2 . maybe-starts+ends))
  (define (string-compare s1 s2 proc< proc= proc> . maybe-starts+ends))
  (define (string-compare-ci s1 s2 proc< proc= proc> . maybe-starts+ends))
  (define (string= s1 s2 . maybe-starts+ends))
  (define (string<> s1 s2 . maybe-starts+ends))
  (define (string< s1 s2 . maybe-starts+ends))
  (define (string> s1 s2 . maybe-starts+ends))
  (define (string<= s1 s2 . maybe-starts+ends))
  (define (string>= s1 s2 . maybe-starts+ends))
  (define (string-ci= s1 s2 . maybe-starts+ends))
  (define (string-ci<> s1 s2 . maybe-starts+ends))
  (define (string-ci< s1 s2 . maybe-starts+ends))
  (define (string-ci> s1 s2 . maybe-starts+ends))
  (define (string-ci<= s1 s2 . maybe-starts+ends))
  (define (string-ci>= s1 s2 . maybe-starts+ends))
  (define (string-hash s . maybe-bound+start+end))
  (define (string-hash-ci s . maybe-bound+start+end))
  (define (string-upcase s . maybe-start+end))
  (define (string-upcase! s . maybe-start+end))
  (define (string-downcase s . maybe-start+end))
  (define (string-downcase! s . maybe-start+end))
  (define (string-titlecase! s . maybe-start+end))
  (define (string-titlecase s . maybe-start+end))
  (define (string-take s n))
  (define (string-take-right s n))
  (define (string-drop s n))
  (define (string-drop-right s n))
  (define (string-trim s . criterion+start+end))
  (define (string-trim-right s . criterion+start+end))
  (define (string-trim-both s . criterion+start+end))
  (define (string-pad-right s n . char+start+end))
  (define (string-pad s n . char+start+end))
  (define (string-delete criterion s . maybe-start+end))
  (define (string-filter criterion s . maybe-start+end))
  (define (string-index str criterion . maybe-start+end))
  (define (string-index-right str criterion . maybe-start+end))
  (define (string-skip str criterion . maybe-start+end))
  (define (string-skip-right str criterion . maybe-start+end))
  (define (string-count s criterion . maybe-start+end))
  (define (string-fill! s char . maybe-start+end))
  (define (string-copy! to tstart from . maybe-fstart+fend))
  (define (string-contains text pattern . maybe-starts+ends))
  (define (string-contains-ci text pattern . maybe-starts+ends))
  (define (string-null? s))
  (define (string-reverse s . maybe-start+end))
  (define (string-reverse! s . maybe-start+end))
  (define (reverse-list->string clist))
  (define (string->list s . maybe-start+end))
  (define (string-append/shared . strings))
  (define (string-concatenate/shared strings))
  (define (string-concatenate strings))
  (define (string-concatenate-reverse string-list . maybe-final+end))
  (define (string-concatenate-reverse/shared string-list . maybe-final+end))
  (define (string-replace s1 s2 start1 end1 . maybe-start+end))
  (define (string-tokenize s . token-chars+start+end))
  (define (xsubstring s from . maybe-to+start+end))
  (define (string-xcopy! target tstart s sfrom . maybe-sto+start+end))
  (define (string-join strings . delim+grammar)))
 (author: "Olin Shivers <shivers at ai.mit.edu>")
 (maintainer: "Jeremie Lasalle Ratelle <pouexmachinax at gmail.com>")
 (description:
  "Coherent and comprehensive set of string-processing procedures")
 (keywords: srfi)
 (homepage: "http://srfi.schemers.org/srfi-13")
 (require: fixnum/v1)
 (require: srfi14/v1))

Version:
v1.0.0
Released:
2502 days ago
Maintainer:
Jeremie Lasalle Ratelle <pouexmachinax at gmail.com>
Author:
Olin Shivers <shivers at ai.mit.edu>
Homepage:
http://srfi.schemers.org/srfi-13
Description:
Coherent and comprehensive set of string-processing procedures
Keywords:
srfi
Package form:
(package*
 srfi13/v1.0.0
 (provide:
  (define (string-map proc s . maybe-start+end))
  (define (string-map! proc s . maybe-start+end))
  (define (string-fold kons knil s . maybe-start+end))
  (define (string-fold-right kons knil s . maybe-start+end))
  (define (string-unfold p f g seed . base+make-final))
  (define (string-unfold-right p f g seed . base+make-final))
  (define (string-for-each proc s . maybe-start+end))
  (define (string-for-each-index proc s . maybe-start+end))
  (define (string-every criterion s . maybe-start+end))
  (define (string-any criterion s . maybe-start+end))
  (define (string-tabulate proc len))
  (define (string-prefix-length s1 s2 . maybe-starts+ends))
  (define (string-suffix-length s1 s2 . maybe-starts+ends))
  (define (string-prefix-length-ci s1 s2 . maybe-starts+ends))
  (define (string-suffix-length-ci s1 s2 . maybe-starts+ends))
  (define (string-prefix? s1 s2 . maybe-starts+ends))
  (define (string-suffix? s1 s2 . maybe-starts+ends))
  (define (string-prefix-ci? s1 s2 . maybe-starts+ends))
  (define (string-suffix-ci? s1 s2 . maybe-starts+ends))
  (define (string-compare s1 s2 proc< proc= proc> . maybe-starts+ends))
  (define (string-compare-ci s1 s2 proc< proc= proc> . maybe-starts+ends))
  (define (string= s1 s2 . maybe-starts+ends))
  (define (string<> s1 s2 . maybe-starts+ends))
  (define (string< s1 s2 . maybe-starts+ends))
  (define (string> s1 s2 . maybe-starts+ends))
  (define (string<= s1 s2 . maybe-starts+ends))
  (define (string>= s1 s2 . maybe-starts+ends))
  (define (string-ci= s1 s2 . maybe-starts+ends))
  (define (string-ci<> s1 s2 . maybe-starts+ends))
  (define (string-ci< s1 s2 . maybe-starts+ends))
  (define (string-ci> s1 s2 . maybe-starts+ends))
  (define (string-ci<= s1 s2 . maybe-starts+ends))
  (define (string-ci>= s1 s2 . maybe-starts+ends))
  (define (string-hash s . maybe-bound+start+end))
  (define (string-hash-ci s . maybe-bound+start+end))
  (define (string-upcase s . maybe-start+end))
  (define (string-upcase! s . maybe-start+end))
  (define (string-downcase s . maybe-start+end))
  (define (string-downcase! s . maybe-start+end))
  (define (string-titlecase! s . maybe-start+end))
  (define (string-titlecase s . maybe-start+end))
  (define (string-take s n))
  (define (string-take-right s n))
  (define (string-drop s n))
  (define (string-drop-right s n))
  (define (string-trim s . criterion+start+end))
  (define (string-trim-right s . criterion+start+end))
  (define (string-trim-both s . criterion+start+end))
  (define (string-pad-right s n . char+start+end))
  (define (string-pad s n . char+start+end))
  (define (string-delete criterion s . maybe-start+end))
  (define (string-filter criterion s . maybe-start+end))
  (define (string-index str criterion . maybe-start+end))
  (define (string-index-right str criterion . maybe-start+end))
  (define (string-skip str criterion . maybe-start+end))
  (define (string-skip-right str criterion . maybe-start+end))
  (define (string-count s criterion . maybe-start+end))
  (define (string-fill! s char . maybe-start+end))
  (define (string-copy! to tstart from . maybe-fstart+fend))
  (define (string-contains text pattern . maybe-starts+ends))
  (define (string-contains-ci text pattern . maybe-starts+ends))
  (define (string-null? s))
  (define (string-reverse s . maybe-start+end))
  (define (string-reverse! s . maybe-start+end))
  (define (reverse-list->string clist))
  (define (string->list s . maybe-start+end))
  (define (string-append/shared . strings))
  (define (string-concatenate/shared strings))
  (define (string-concatenate strings))
  (define (string-concatenate-reverse string-list . maybe-final+end))
  (define (string-concatenate-reverse/shared string-list . maybe-final+end))
  (define (string-replace s1 s2 start1 end1 . maybe-start+end))
  (define (string-tokenize s . token-chars+start+end))
  (define (xsubstring s from . maybe-to+start+end))
  (define (string-xcopy! target tstart s sfrom . maybe-sto+start+end))
  (define (string-join strings . delim+grammar)))
 (author: "Olin Shivers <shivers at ai.mit.edu>")
 (maintainer: "Jeremie Lasalle Ratelle <pouexmachinax at gmail.com>")
 (description:
  "Coherent and comprehensive set of string-processing procedures")
 (keywords: srfi)
 (homepage: "http://srfi.schemers.org/srfi-13")
 (require: fixnum/v1)
 (require: srfi14/v1))