10.3.1 scheme.list - R7RS lists ¶

Module: scheme.list ¶

This module is a rich collection of list manipulation procedures, and same as srfi.1.

Note that Gauche supports quite a few scheme.list procedures as built-in. The following procedures can be used without loading scheme.list module. For the manual entries of these procedures, Pairs and lists.

null-list? cons* last member
take drop take-right drop-right take! drop-right!
delete delete! delete-duplicates delete-duplicates!
assoc alist-copy alist-delete alist-delete!
any every filter filter! fold fold-right find find-tail
split-at split-at! iota

List constructors ¶

Function: xcons cd ca ¶

[R7RS list] {scheme.list} Equivalent to (cons ca cd). Useful to pass to higher-order procedures.

Function: list-tabulate n init-proc ¶

[R7RS list] {scheme.list} Constructs an n-element list, in which each element is generated by (init-proc i).

(list-tabulate 4 values) ⇒ (0 1 2 3)

Function: circular-list elt1 elt2 … ¶

[R7RS list] {scheme.list} Constructs a circular list of the elements.

(circular-list 'z 'q) ⇒ (z q z q z q ...)

List predicates ¶

Function: not-pair? x ¶

[R7RS list] {scheme.list} Same as (lambda (x) (not (pair? x))).

SRFI-1 says: Provided as a procedure as it can be useful as the termination condition for list-processing procedures that wish to handle all finite lists, both proper and dotted.

Function: list= elt= list … ¶

[R7RS list] {scheme.list} Determines list equality by comparing every n-th element of given lists by the procedure elt=.

It is an error to apply list= to anything except proper lists.

The equality procedure must be consistent with eq?, i.e.

(eq? x y) ⇒ (elt= x y).

List selectors ¶

Function: first pair ¶

Function: second pair ¶

Function: third pair ¶

Function: fourth pair ¶

Function: fifth pair ¶

Function: sixth pair ¶

Function: seventh pair ¶

Function: eighth pair ¶

Function: ninth pair ¶

Function: tenth pair ¶

[R7RS list] {scheme.list} Returns n-th element of the (maybe improper) list.

Function: car+cdr pair ¶

[R7RS list] {scheme.list} Returns two values, (car pair) and (cdr pair).

List miscellaneous routines ¶

Function: zip clist1 clist2 … ¶

[R7RS list] {scheme.list} Equivalent to (map list clist1 clist2 …). If zip is passed n lists, it returns a list as long as the shortest of these lists, each element of which is an n-element list comprised of the corresponding elements from the parameter lists.

(zip '(one two three)
     '(1 2 3)
     '(odd even odd even odd even odd even))
     ⇒ ((one 1 odd) (two 2 even) (three 3 odd))

(zip '(1 2 3)) ⇒ ((1) (2) (3))

At least one of the argument lists must be finite:

(zip '(3 1 4 1) (circular-list #f #t))
     ⇒ ((3 #f) (1 #t) (4 #f) (1 #t))

Function: unzip1 list ¶

Function: unzip2 list ¶

Function: unzip3 list ¶

Function: unzip4 list ¶

Function: unzip5 list ¶

[R7RS list] {scheme.list} unzip1 takes a list of lists, where every list must contain at least one element, and returns a list containing the initial element of each such list. unzip2 takes a list of lists, where every list must contain at least two elements, and returns two values: a list of the first elements, and a list of the second elements. unzip3 does the same for the first three elements of the lists, and so on.

(unzip2 '((1 one) (2 two) (3 three))) ⇒
   (1 2 3) and
   (one two three)

List fold, unfold & map ¶

Function: pair-fold kons knil clist1 clist2 … ¶

Function: pair-fold-right kons knil clist1 clist2 … ¶

[R7RS list] {scheme.list} Like fold and fold-right, but the procedure kons gets each cdr of the given clists, instead of car.

(pair-fold cons '() '(a b c d e))
  ⇒ ((e) (d e) (c d e) (b c d e) (a b c d e))

(pair-fold-right cons '() '(a b c d e))
  ⇒ ((a b c d e) (b c d e) (c d e) (d e) (e))

Function: unfold p f g seed :optional tail-gen ¶

[R7RS list] {scheme.list} Fundamental recursive list constructor. Defined by the following recursion.

(unfold p f g seed tail-gen) ≡
   (if (p seed)
       (tail-gen seed)
       (cons (f seed)
             (unfold p f g (g seed))))

That is, p determines where to stop, g is used to generate successive seed value from the current seed value, and f is used to map each seed value to a list element.

(unfold (pa$ = 53) integer->char (pa$ + 1) 48)
  ⇒ (#\0 #\1 #\2 #\3 #\4)

Function: unfold-right p f g seed :optional tail ¶

[R7RS list] {scheme.list} Fundamental iterative list constructor. Defined by the following recursion.

(unfold-right p f g seed tail) ≡
  (let lp ((seed seed) (lis tail))
    (if (p seed)
        lis
        (lp (g seed) (cons (f seed) lis))))

(unfold-right (pa$ = 53) integer->char (pa$ + 1) 48)
 ⇒ (#\4 #\3 #\2 #\1 #\0)

Function: map! f clist1 clist2 … ¶

[R7RS list] {scheme.list} The procedure f is applied to each element of clist1 and corresponding elements of clist2s, and the result is collected to a list. Cells in clist1 is reused to construct the result list.

Function: map-in-order f clist1 clist2 … ¶

[R7RS list] {scheme.list} A variant of map, but it guarantees to apply f on each elements of arguments in a left-to-right order. Since Gauche’s map implementation follows the same order, this function is just a synonym of map.

Function: pair-for-each f clist1 clist2 … ¶

[R7RS list] {scheme.list} Like for-each, but the procedure f is applied on clists themselves first, then each cdrs of them, and so on.

(pair-for-each write '(a b c))
 ⇒ prints (a b c)(b c)(c)

List partitioning ¶

Function: partition pred list ¶

Function: partition! pred list ¶

[R7RS list] {scheme.list} filter and remove simultaneously, i.e. returns two lists, the first is the result of filtering elements of list by pred, and the second is the result of removing elements of list by pred.

(partition odd? '(3 1 4 5 9 2 6))
  ⇒ (3 1 5 9) (4 2 6)

partition! is the linear-update variant. It may destructively modifies list to produce the result.

List searching ¶

Function: take-while pred clist ¶

Function: take-while! pred list ¶

[R7RS list] {scheme.list} Returns the longest initial prefix of clist whose elements all satisfy pred.

Function: drop-while pred clist ¶

[R7RS list] {scheme.list} Drops the longest initial prefix of clist whose elements all satisfy pred, and returns the rest.

Function: span pred clist ¶

Function: span! pred list ¶

Function: break pred clist ¶

Function: break! pred list ¶

[R7RS list] {scheme.list} span is equivalent to (values (take-while pred clist) (drop-while pred clist)). break inverts the sense of pred.

Function: list-index pred clist1 clist2 … ¶

[R7RS list] {scheme.list} Returns the index of the leftmost element that satisfies pred. If no element satisfies pred, #f is returned.

Association lists ¶

Function: alist-cons key datum alist ¶

[R7RS list] {scheme.list} Returns (cons (cons key datum) alist). This is an alias of the Gauche builtin procedure acons.

Lists as sets ¶

These procedures use a list as a set, that is, the elements in a list matter, but their order doesn’t.

All procedures in this category takes a comparison procedure elt=, as the first argument, which is used to determine two elements in the given sets are the same.

Since lists require linear time to search, those procedures aren’t suitable to deal with large sets. See scheme.set - R7RS sets, if you know your sets will contain more than a dozen items or so.

See also util.combinations - Combination library, which concerns combinations of elements in the set.

Function: lset<= elt= list1 … ¶

[R7RS list] {scheme.list} Returns #t iff all elements in list1 are also included in list2, and so on. If no lists are given, or a single list is given, #t is returned.

Function: lset= elt= list1 list2 … ¶

[R7RS list] {scheme.list} Returns #t if all elements in list1 are in list2, and all elements in list2 are in list1, and so on.

(lset= eq? '(b e a) '(a e b) '(e e b a)) ⇒ #t

Function: lset-adjoin elt= list elt … ¶

[R7RS list] {scheme.list} Adds elt … to the set list, if each one is not already a member of list. (The order doesn’t matter).

(lset-adjoin eq? '(a b c) 'a 'e) ⇒ '(e a b c)

Function: lset-union elt= list1 … ¶

[R7RS list] {scheme.list} Returns the union of the sets list1 ….

Function: lset-intersection elt= list1 list2 … ¶

[R7RS list] {scheme.list} Returns a set of elements that are in every lists.

Function: lset-difference elt= list1 list2 … ¶

[R7RS list] {scheme.list} Returns a set of elements that are in list1 but not in list2. In n-ary case, binary difference operation is simply folded.

Function: lset-xor elt= list1 … ¶

[R7RS list] {scheme.list} Returns the exclusive-or of given sets; that is, the returned set consists of the elements that are in either list1 or list2, but not in both. In n-ary case, binary xor operation is simply folded.

Function: lset-diff+intersection elt= list1 list2 … ¶

[R7RS list] {scheme.list} Returns two sets, a difference and an intersection of given sets.

Function: lset-union! elt= list … ¶

Function: lset-intersection! elt= list1 list2 … ¶

Function: lset-difference! elt= list1 list2 … ¶

Function: lset-xor! elt= list1 … ¶

Function: lset-diff+intersection! elt= list1 list2 … ¶

[R7RS list] {scheme.list} Linear update variant of the corresponding procedures. The cells in the first list argument may be reused to construct the result.

10.3.2 scheme.vector - R7RS vectors ¶

Module: scheme.vector ¶

This module adds rich set of vector operations to the built-in / R7RS vector procedures.

The following procedures are built-in. See Vectors, for the description. We only explain the procedures that are not built-in.

make-vector          vector               vector?
vector-ref           vector-set!          vector-length
vector-fill!         vector-copy          vector-copy!
vector-append        vector->list         list->vector
reverse-list->vector vector->string       string->vector
vector-map           vector-map!          vector-for-each

This module is srfi.133, which supersedes srfi.43 (see srfi.43 - Vector library (legacy)). Note that the interface of following procedures in srfi.43 are changed for the consistency:

vector-map           vector-map!          vector-for-each
vector-fold          vector-fold-right    vector-count

Some of the functionalities of srfi.43 version is supported by built-in procedures (e.g. Built-in vector-map-with-index is the same as srfi.43’s vector-map). So there’s little point for new code to use srfi.43.

Vector constructors ¶

Function: vector-unfold f length seed … ¶

[R7RS vector] {scheme.vector} Creates a vector of length length, filling elements left to right by calling f repeatedly.

The procedure f must take as many arguments as one plus number of seed values, and must return the same number of values. The first argument is the index. The first return value is used for the element of the result vector, and the rest of return values are passed to the next call of f.

(vector-unfold (^[i] (* i i)) 5)
 ⇒ #(0 1 4 9 16)

(vector-unfold (^[i x] (values (cons i x) (* x 2))) 8 1)
 ⇒ #((0 . 1) (1 . 2) (2 . 4) (3 . 8)
    (4 . 16) (5 . 32) (6 . 64) (7 . 128))

Note: This protocol is different from the list unfold and most of other *-unfold constructors (see scheme.list - R7RS lists). For fixed-length strcuctures like vectors, it makes more sense to know the final length beforehand, rather than checking the termination condition for each iteration.

Function: vector-unfold-right f length seed … ¶

[R7RS vector] {scheme.vector} Creates a vector of length length, filling elements right to left by calling f repeatedly.

The procedure f must take as many arguments as one plus number of seed values, and must return the same number of values. The first argument is the index. The first return value is used for the element of the result vector, and the rest of return values are passed to the next call of f.

(vector-unfold-right (^[i] (* i i)) 5)
 ⇒ #(0 1 4 9 16)

(vector-unfold-right (^[i x] (values (cons i x) (* x 2))) 8 1)
 ⇒ #((0 . 128) (1 . 64) (2 . 32) (3 . 16)
    (4 . 8) (5 . 4) (6 . 2) (7 . 1))

Function: vector-reverse-copy vec :optional start end ¶

[R7RS vector] {scheme.vector} Copies the vector vec with reversing its elements. Optional start and end arguments can limit the range of the input.

(vector-reverse-copy '#(a b c d e) 1 4)
 ⇒ #(d c b)

Function: vector-concatenate list-of-vectors ¶

[R7RS vector] {scheme.vector} Same as (apply vector-append list-of-vectors).

Function: vector-append-subvectors spec … ¶

[R7RS vector] {scheme.vector} The number of arguments must be multiple of 3. The argument list must be in the following format, where each vecN is a vector, and startN and endN are nonnegative exact integers:

vec1 start1 end1 vec2 start2 end2 ...

This procedure creates a new vector by concatenating subvectors specified by each triplet. That is, it works as if it’s the following code, except it avoids copying each subvector:

(vector-append (vector-copy vec1 start1 end1)
               (vector-copy vec2 start2 end2)
               ...)

Here’s an example:

(vector-append-subvectors '#(a b c d e) 0 3
                          '#(f g h i j) 2 5)
  ⇒ #(a b c h i j)

Vector predicates ¶

Function: vector-empty? vec ¶

[R7RS vector] {scheme.vector} Returns #t if vec’s length is zero, and #f if vec’s length is more than zero. Signals an error if vec is not a vector.

Function: vector= elt= vec … ¶

[R7RS vector] {scheme.vector} Compares vecs element-wise, using given predicate elt=. Returns #t iff lengths of all the vectors are the same, and every corresponding elements are equal by elt=.

Elt= is always called with two arguments and must return #t iff two are the same.

When zero or one vector is passed, elt= won’t be called and vector= always returns #t.

Vector iteration ¶

Function: vector-fold kons knil vec1 vec2 … ¶

[R7RS vector] {scheme.vector} Kons is a procedure that takes n+1 arguments, where n is the number of given vectors. For each element of the given vectors, kons is called as (kons seed e_1i e_2i …), where and e_ni is the i-th element of the vector n. If the lengths of the vectors differ, iteration stops when the shortest vector is exhausted.

The initial value of seed is knil, and the return value from kons is used as the next seed value. The last return value of kons is returned from vector-fold.

The iteration is strictly left to right.

Note that the seed value precedes elements, which is opposite to fold (see Mapping over collection). It’s an unfortunate historical glitch; vector-fold-left would be more consistent name.

(vector-fold (^[a b] (cons b a)) '() '#(a b c d))
  ⇒ (d c b a)

Function: vector-fold-right kons knil vec1 vec2 … ¶

[R7RS vector] {scheme.vector} Like vector-fold, but elements in the vec1 vec2 … are visited from right to left.

If the lengths of the vectors differ, this procedure only looks up to the number of elements of the shortest vector and ignores any excessive elements. See the second example below.

Unlike fold-right (see Mapping over sequences), the procedure kons takes the seed value in the first argument.

(vector-fold-right (^[a b] (cons b a)) '() '#(a b c d))
  ⇒ (a b c d)

(vector-fold-right (^[s x y] (cons (list x y) s)) '()
                   '#(a b c) '#(1 2 3 4))
  ⇒ ((a 1) (b 2) (c 3))

Function: vector-count pred vec1 vec2 … ¶

[R7RS vector] {scheme.vector} Applies pred on each elements in argument vectors (if N vectors are given, pred takes N arguments, the first being i-th element of vec1, the second being i-th element of vec2, etc.) Then returns the number of times pred returned true value. The order pred applied to each element is unspecified.

(vector-count odd? '#(0 1 2 3 4)
  ⇒ 2

(vector-count < '#(7 3 9 1 5) '#(6 8 2 3 8 8))
  ⇒ 3

Function: vector-cumulate f seed vec ¶

[R7RS vector] {scheme.vector} Returns a fresh vector with the same size of vec, with the elements calculated as follows:

The first element of result vector is a result of procedure f called with seed and the first element of vec.

The i-th element of result vector is a result of procedure f called with i-1-th element of result vector and i-th element of vec.

(vector-cumulate string-append "z" '#("a" "b" "c"))
  ⇒ #("za" "zab" "zabc")

Vector searching ¶

Function: vector-index pred vec1 vec2 … ¶

Function: vector-index-right pred vec1 vec2 … ¶

[R7RS vector] {scheme.vector} Returns the index of the first or the last elements in vec1 vec2 … that satisfy pred, respectively. Returns #f if no elements satisfy pred. In vector-index, comparison ends at the end of the shortest vector. For vector-index-right, all the vectors must have the same length.

Function: vector-skip pred vec1 vec2 … ¶

Function: vector-skip-right pred vec1 vec2 … ¶

[R7RS vector] {scheme.vector} Like vector-index and vector-index-right, except that the result of pred is negated. That is, returns the index of the first or the last elements that don’t satisfy pred.

Function: vector-binary-search vec value cmp :optional start end ¶

[R7RS+ vector] {scheme.vector} Look for value in a sorted vector vec, and returns its index if it is found, or #f if it is not found.

Comparison of value and an element in vec is done by a procedure cmp, which takes two arguments, and should return a negative integer if the first argument is less than the second, 0 if they are the same, and a positive integer if the first is greater than the second.

Elements in vec must be ordered from smaller to greater w.r.t. cmp. Using that fact, this procedure performs binary search instead of linear search.

The optional arguments start and end are an extension to SRFI-133, and can be used to limit the range of the search in start-th element (inclusive) to end-th element (exclusive).

Function: vector-any pred vec1 vec2 … ¶

[R7RS vector] {scheme.vector} Applies pred on each corresponding elements of vec1 vec2 … left to right, and as soon as pred returns non-#f value, the procedure stops iteration and returns the value.

If no elements that satisfy pred are found, it returns #f.

Vectors can have different lengths. Iteration stops at the end of the shortest.

Function: vector-every pred vec1 vec2 … ¶

[R7RS vector] {scheme.vector} Applies pred on each corresponding elements of vec1 vec2 … left to right. If all the elements (when the lengths of vectors differ, the first N elements where N is the length of the shortest) satisfy pred, returns the last result of pred. If any of the elements don’t satisfy pred, it returns #f immediately without looking further.

(vector-every < '#(1 2 3 4 5) '#(2 3 4 4 5)
  ⇒ #f

(vector-every (^[x y] (and (real? x) (real? y) (- x y)))
              '#(1 2 3)
              '#(2 4 6))
  ⇒ -3

Function: vector-partition pred vec ¶

[R7RS vector] {scheme.vector} Allocates a fresh vector of the same size as vec, then fill it with elements in vec that satisfy pred, followed by elements that don’t satisfy pred.

Returns two values, the newly created vector and an exact integer of the index of the first element that doesn’t satisfy pred in the returned vector.

(vector-partition odd? '#(1 2 3 4 5 6 7 8))
  ⇒ #(1 3 5 7 2 4 6 8) and 4

Vector mutators ¶

Function: vector-swap! vec i j ¶

[R7RS vector] {scheme.vector} Swaps vector vec’s i-th and j-th elements. Returns unspecified value.

(rlet1 v (vector 'a 'b 'c 'd 'e)
  (vector-swap! v 0 2))
  ⇒ #(c b a d e)

Function: vector-reverse! vec :optional start end ¶

[R7RS vector] {scheme.vector} Reverse the elements of vec. Returns an undefined value. Optional start and end arguments can limit the range of operation.

(rlet1 v (vector 'a 'b 'c 'd 'e)
  (vector-reverse! v 0 4))
  ⇒ #(d c b a e)

Function: vector-reverse-copy! target tstart source :optional sstart send ¶

[R7RS vector] {scheme.vector} Like vector-copy!, but reverses the order of elements from start.

(rlet1 v (vector 'a 'b 'c 'd 'e)
  (vector-reverse-copy! v 2 '#(1 2)))
  ⇒ #(a b 2 1 e)

It is ok to pass the same vector to target and source; it always works even if the regions of source and destination are overlapping.

(rlet1 v (vector 'a 'b 'c 'd 'e)
  (vector-reverse-copy! v 1 v 1))
  ⇒ #(a e d c b)

Function: vector-unfold! f rvec start end seeds … ¶

Function: vector-unfold-right! f rvec start end seeds … ¶

[R7RS vector] {scheme.vector} Fill rvec starting from index start (inclusive) and ending at index end (exclusive), with the elements calculated by f.

The procedure f takes the number of seed values seeds … plus one arguments. The first argument is the current index, followed by seed values. The same number of values as the arguments must be returned from f; the first return value is used to fill the current element of rvec, and the rest of the values are used as the next seed values.

The result vector is filled from left to right by vector-unfold!, and right to left by vector-unfold-right!. The return value is unspecified.

(let1 rvec (vector 'a 'b 'c 'd 'e 'f)
  (vector-unfold! (^[i] (+ i 1)) rvec 1 4)
  rvec)
 ⇒ #(a 2 3 4 e f)

(let1 rvec (vector 'a 'b 'c 'd 'e 'f)
  (vector-unfold-right! (^[i] (+ i 1)) rvec 1 4)
  rvec)
 ⇒ #(a 2 3 4 e f)

(let1 rvec (vector 'a 'b 'c 'd 'e 'f)
  (vector-unfold! (^[i x] (values x (* x 2))) rvec 1 5 10)
  rvec)
 ⇒ #(a 10 20 40 80 f)

(let1 rvec (vector 'a 'b 'c 'd 'e 'f)
  (vector-unfold! (^[i x] (values x (* x 2))) rvec 1 5 10)
  rvec)
 ⇒ #(a 80 40 20 10 f)

Vector conversion ¶

Function: reverse-vector->list vec :optional start end ¶

[R7RS vector] {scheme.vector} Same as (reverse (vector->list vec start end)), but more efficient.

10.3.3 scheme.vector.@ - R7RS uniform vectors ¶

Module: scheme.vector.@ ¶

@ is actually one of u8, s8, u16, s16, u32, s32, u64, s64, f32, f64, c64 or c128. (Gauche’s gauche.uvector module also provides f16 and c32 vectors.)

These modules provides vectors that can hold specific range of numeric values. In Gauche we use packed representation, meaning numbers are tightly stored in consecutive memory region.

Additionally, scheme.vector.base module exports basic procedures, make-@vector, @vector, @vector?, @vector-length, @vector-ref, @vector-set!, @vector->list, list->@vector, @?, for @ being over all element types.

The gauche.uvector module is a superset of these modules, and all procedures are described there. See Uniform vectors for the details.

10.3.4 scheme.sort - R7RS sort ¶

Module: scheme.sort ¶

Provides utilities to sort, and to work on sorted lists/vectors. This module is the same as srfi.132.

Gauche has built-in sort and merge procedures (see Sorting and merging). This module has a bit different API. Notably, the ordering predicate comes first than the sequence to be sorted, and the procedures dealing with vectors uniformly support start/end arguments

This module also provide useful procedures working on sorted or partially sorted sequences.

Function: list-sort elt< lis ¶

Function: list-sort! elt< lis ¶

Function: list-stable-sort elt< lis ¶

Function: list-stable-sort! elt< lis ¶

[R7RS sort] {scheme.sort} Sort elements in a list lis according to the ordering predicate elt<, which takes two elements from lis and returns true iff the first argument is strictly less than the second argument.

Returns a sorted list. The procedures with bang are linear update version. They are allowed, but not required, to reuse lis. The “stable” variation guarantees stable sort.

These are basically the same as Gauche’s built-in sort, sort!, stable-sort and stable-sort!, except the Gauche’s version works on any sequences and takes arguments differently. (See Sorting and merging.)

Function: list-sorted? elt< lis ¶

[R7RS sort] {scheme.sort} Returns true iff the list list is sorted according to the ordering predicate elt<.

See also sorted? in Sorting and merging.

Function: list-merge elt< lis1 lis2 ¶

Function: list-merge! elt< lis1 lis2 ¶

[R7RS sort] {scheme.sort} Given two sorted lists lis1 and lis2, returns a new sorted list according to the ordering predicate elt<.

Note that list-merge! works in-place, that is, all the pairs in lis1 and lis2 are reused.

See also merge and merge! in Sorting and merging.

Function: vector-sort elt< vec :optional start end ¶

Function: vector-stable-sort elt< vec :optional start end ¶

[R7RS sort] {scheme.sort} Sort elements in a vector vec according to the ordering predicate elt<, which takes two elements from vec and returns true iff the first argument is strictly less than the second argument. Returns a fresh sorted vector. The “stable” variation guarantees stable sort.

When the optional start and/or end arguments are given, only the portion from start (inclusive) and end (exclusive) of vec are looked at. The result vector’s length is end - start). When end is omitted, the length of vec is assumed.

See also sort and stable-sort in Sorting and merging.

Function: vector-sort! elt< vec :optional start end ¶

Function: vector-stable-sort! elt< vec :optional start end ¶

[R7RS sort] {scheme.sort} Sort elements “in-place” in a vector vec according to the ordering predicate elt<, which takes two elements from vec and returns true iff the first argument is strictly less than the second argument. Upon successful return, vec’s elements are sorted. Returns unspecified value; the caller must rely on the side effect.

Note that most of recent APIs with ! is linear updating, meaning it may or may not change the argument, and the caller must use the return value. On the other hand, vector-sort! and vector-stable-sort! are purely for side effects, and use minimal space (vector-sort! doesn’t need extra space, while vector-stable-sort! may allocate a temporary storage up to the size of the input).

When the optional start and/or end arguments are given, only the portion from start (inclusive) and end (exclusive) of vec are sorted; other elements will remain intact. When end is omitted, the length of vec is assumed.

See also sort! and stable-sort! in Sorting and merging.

Function: vector-sorted? elt< vec :optional start end ¶

[R7RS sort] {scheme.sort} Returns true iff vec between start (inclusive) and end (exclusive) is sorted according to the ordering predicate elt<. If start and/or end is/are omitted, 0 and the length of vec are assumed, respectively.

See also sorted? in Sorting and merging.

Function: vector-merge elt< vec1 vec2 :optional start1 end1 start2 end2 ¶

Function: vector-merge! elt< rvec vec1 vec2 :optional rstart start1 end1 start2 end2 ¶

[R7RS sort] {scheme.sort} Merge two sorted vectors vec1 and vec2 into one vector, according to the ordering predicate elt<.

The optional argument start1 and end1 restricts vec1’s portion to be looked at, and start2 and end2 restricts vec2’s portion to be looked at. Each is integer index to the corresponding vector, and the start index is inclusive, while the end index is exclusive.

The functional version vector-merge allocates a fresh vector to hold the result, and returns it.

The side-effecting version vector-merge! uses rvec. to hold the result. The procedure doesn’t return a meaningful value. The optional rstart argument specifies the index of rvec from which the result is filled; the default is 0. The length of rvec must be greater than rstart + (end1-start1) + (end2-start2).

Function: list-delete-neighbor-dups elt= lis ¶

Function: list-delete-neighbor-dups! elt= lis ¶

Function: vector-delete-neighbor-dups elt= vec :optional start end ¶

Function: vector-delete-neighbor-dups! elt= vec :optional start end ¶

[R7RS sort] {scheme.sort} From the given list lis or vector vec, these procedures delete adjacent duplicate elements. Equivalence is checked by elt= procedure.

(list-delete-neighbor-dups eq? '(m i s s i s s i p p i))
  ⇒ (m i s i s i p i)

The non-destructive versions list-delete-neighbor-dups and vector-delete-neighbor-dups returns a freshly allocated list and vector, respectively.

The destructive list-delete-neighbor-dups! works in-place, reusing pairs of lis. No allocation will be done. It is a single-pass iterative algorithm, and the first cell of input is the first cell of output (except when the input is an empty list).

The destructive vector-delete-neighbor-dups! has a bit different interface. It updates vec in-place, but since we can’t change the length of the vector, it gathers the result from the beginning of the vec, then returns the next index newend of vec—that is, after calling this procedure, [start, newend) holds the result. The elements between [newend, end) will remain intact.

The optional start and end arguments limits the region of vec to be looked at.

(vector-delete-neighbor-dups eq? '#(a a a b b c c d d e e f f) 3 10)
  ⇒ #(b c d e)

(let1 v '#(a a a b b c c d d e e f f)
  (cons (vector-delete-neighbor-dups! eq? v 3 10) v))
  ⇒ (7 . #(a a a b c d e d d e e f f))

Note: The gauche.sequence module provides neighbor duplicate deletion on generic sequences. Those procedures are implemented by the generic versions as shown below. See Other operations over sequences, for the details.

list-delete-neighbor-dups

delete-neighbor-dups

list-delete-neighbor-dups!

delete-neighbor-dups-squeeze!

vector-delete-neighbor-dups

delete-neighbor-dups

vector-delete-neighbor-dups!

delete-neighbor-dups!

Function: vector-select! elt< vec k :optional start end ¶

[R7RS sort] {scheme.sort} Select k-th smallest element in vec according to the ordering predicate elt<. K is zero based, i.e. 0 means the smallest. The optional start and end arguments limits the range of vec to be looked at, and defaulted to 0 and the length of vec, respectively. K must satisfy start <= k < end.

This procedure runs in O(n) time in average, and requires no extra stroage. This procedure may partially modify vec.

Function: vector-separate! elt< vec k :optional start end ¶

[R7RS sort] {scheme.sort} Find k-th smallerst element in vec (pivot) between between start and end, according to the ordering predicate elt<, then rearrange elements between start and end so that elements smaller than the pivot comes between start and start + k, and the rest of the elements come afterwards. When omitted, start is 0 and end is the length of the vec.

This can be used as a building block for in-place divide-and-conquer algorithms. Runs in O(n) time.

Function: vector-find-median elt< vec knil :optional mean ¶

Function: vector-find-median! elt< vec knil :optional mean ¶

[R7RS sort] {scheme.sort} Find median value of elements in vec, when ordered by the ordering predicate elt<. Non-destructive version vector-find-median runs in O(n) time. The destructive version vector-find-median! is specified to leave vec sorted, so it runs in O(n log n).

1. If vec is empty, knil is returned. This is the only case knil is used.
2. If vec has odd number of elements, the element falls in the exactly the midpoint when ordered, is returned.
3. If vec has even number of elements, the two elements closest to the midpoint is chosen and passed to the procedure mean, and its result is returned. The default of mean is an arithmetic mean of numbers.

(vector-find-median < #() 0)
  ⇒ 0

(vector-find-median < #(78 61 19 38 51) 0)
  ⇒ 51

(vector-find-median < #(78 61 19 38 51 52) 0)
  ⇒ 103/2

10.3.5 scheme.set - R7RS sets ¶

Module: scheme.set ¶

Sets and bags are unordered collection of Scheme values. A set doesn’t count duplicates; if you add an item which is already in a set, you still have one item of the kind. A bag counts duplicates; if you add an item which is already in a bag, you have two items of the kind.

To check whether the items are “the same”, sets and bags takes a comparator at construction time. The comparator doesn’t need to have an ordering predicate (we don’t need to order the elements) but has to have a hash function. See Basic comparators, for the details of comparators.

This module is originally specified as srfi.113, and then incorporated to R7RS large.

As a Gauche’s extension, sets and bags implement collection protocol (see gauche.collection - Collection framework, for the details), and generic collection operations can be applied.

(coerce-to <list> (set eq-comparator 'a 'b 'a 'b))
  ⇒ (a b)      ; order may differ

(coerce-to <list> (bag eq-comparator 'a 'b 'a 'b))
  ⇒ (a a b b)  ; order may differ

Constructors ¶

Function: set comparator elt … ¶

Function: bag comparator elt … ¶

[R7RS set] {scheme.set} Creates a new set and bag from given elements elt …. Given comparator will be used to compare equality of elements.

(set->list (set eq-comparator 'a 'b 'a 'b))
  ⇒ (a b)

(bag->list (bag eq-comparator 'a 'b 'a 'b))
  ⇒ (a a b b)

Function: set-unfold stop? mapper successor seed comparator ¶

Function: bag-unfold stop? mapper successor seed comparator ¶

[R7RS set] {scheme.set} Procedurally creates a set or a bag. The first three arguments, stop?, mapper and successor, are all procedures that takes one argument, the current seed value. It may be easier to know their types:

seed      :: Seed
stop?     :: Seed -> Boolean
mapper    :: Seed -> ElementType
successor :: Seed -> Seed

The stop? procedure takes the current seed value and returns a boolean value - if it is true, iteration stops.

The mapper procedure takes the current seed value and returns an item, which is to be included in the resulting set or bag.

The successor procedure takes the current seed value and returns the next seed value.

And the seed argument gives the initial seed value.

(set->list (set-unfold (^s (= s 75))
                       integer->char
                       (^s (+ s 1))
                       65
                       eqv-comparator))
 ⇒ (#\D #\H #\A #\E #\I #\J #\B #\F #\C #\G)

Predicates ¶

Function: set-contains? set obj ¶

Function: bag-contains? bag obj ¶

[R7RS set] {scheme.set} Check if obj is in the set or the bag.

Function: set-empty? set ¶

Function: bag-empty? bag ¶

[R7RS set] {scheme.set} Returns #t iff the given set or bag is empty.

Function: set-disjoint? set1 set2 ¶

Function: bag-disjoint? bag1 bag2 ¶

[R7RS set] {scheme.set} Returns #t iff the given arguments (sets or bags) don’t have common items. Both arguments must have the same comparator—otherwise an error is signaled.

Accessors ¶

Function: set-member set obj default ¶

Function: bag-member bag obj default ¶

[R7RS set] {scheme.set} Returns an element in the given set or bag which is equal to obj in terms of the set’s or the bag’s comparator. If no such element is found, default will be returned.

Note that the returned object doesn’t need to be “the same” as obj in a usual sense. See the following example:

(let1 s (set string-ci-comparator "abc" "def")
  (set-member s "ABC" #f))
  ⇒ "abc"

Function: set-element-comparator set ¶

Function: bag-element-comparator bag ¶

[R7RS set] {scheme.set} Returns the comparator used to compare the elements for the set or the bag.

Updaters ¶

Function: set-adjoin set elt … ¶

Function: bag-adjoin bag elt … ¶

[R7RS set] {scheme.set} Returns a newly created set or bag that contains all the elements in the original set/bag, plus given elements. The new set/bag’s comparator is the same as the original set/bag’s one.

Function: set-replace set elt ¶

Function: bag-replace bag elt ¶

[R7RS set] {scheme.set} Returns a newly created set/bag with the same comparator with the original set/bag, and the same elements, except that the elements equal to elt (in terms of set/bag’s comparator) is replaced by elt. If the original set/bag doesn’t contain an element equal to elt, the original one is returned.

(let ((s (set string-ci-comparator "ABC" "def")))
  (set->list (set-replace s "abc")))
  ⇒ ("abc" "def")

Function: set-delete set elt … ¶

Function: bag-delete bag elt … ¶

[R7RS set] {scheme.set} Returns a newly created set or bag that has the same comparator and the same elements in the original set/bag, except that the item which is equal to elt.

Function: set-delete-all set elt-list ¶

Function: bag-delete-all bag elt-list ¶

[R7RS set] {scheme.set} Returns a newly created set or bag with the same comparator of the original set/bag, with the elements of the original set/bag except the ones listed in elt-list.

Function: set-adjoin! set elt … ¶

Function: bag-adjoin! bag elt … ¶

Function: set-replace! set elt ¶

Function: bag-replace! bag elt ¶

Function: set-delete! set elt … ¶

Function: bag-delete! bag elt … ¶

Function: set-delete-all! set elt-list ¶

Function: bag-delete-all! bag elt-list ¶

[R7RS set] {scheme.set} These are the linear update versions of their counterparts. It works just like the ones without !, except that the original set/bag may be reused to produce the result, instead of new one being allocated.

Note that it’s not guaranteed that the original set/bag is modified, so you should use the return value of them, instead of relying on the side effects.

Function: set-search! set elt failure success ¶

Function: bag-search! bag elt failure success ¶

[R7RS set] {scheme.set} Lookup-and-modify procedures. The failure and success arguments are procedures.

First, they search an item that matches elt in the given set/bag. If an item that matches elt is found, the success procedure is called with three arguments, as follows:

(success item update remove)

wheras, item is the matched item in the set/bag.

The update argument is a procedure that takes two arguments, as (update new-item retval). It returns two values: (1) A set/bag that are the same as the given one except that item is replaced with new-item, and (2) retval.

The remove argument is a procedure that takes one argument, as (remove retval). It returns two values: (1) A set/bag that are the same as the given one except item is removed, and (2) retval.

If an item that matches elt is not found, the failure procedure is called with two arguments, as follows:

(failure insert ignore)

The insert argument is a procedure that takes one argument, as (insert retval). It returns two values: (1) a set/bag that has all the items in the given one plus elt, and (2) retval.

The ignore argument is a procedure that takes one argument, as (ignore retval). It returns two values: (1) the original set/bag, and (2) retval.

The original set/bag may be reused to produce the result by update, remove and insert procedures.

The return values of set-search! and bag-search! is what either success or failure procedure returns. These caller-provided procedures should invoke the passed-in procedures (update, remove, insert or ignore) and return their results—which is a potentially modified set/bag (which may or may not be eq? to the passed one) and the retval.

If there are more than one item that matches elt in a bag, bag-search! only invokes success for the first item it finds. You can recurse into bag-search! in the success procedure to visit all matching items. It is guaranteed that success and failure procedures are tail-called.

The whole set ¶

Function: set-size set ¶

Function: bag-size bag ¶

[R7RS set] {scheme.set} Returns the number of items in the set/bag.

Function: set-find pred set failure ¶

Function: bag-find pred bag failure ¶

[R7RS set] {scheme.set} Apply pred on each item in the set/bag, and returns the first item on which pred returns true. Since sets and bags are unordered, if there are more than one items that satisfy pred, you won’t know which one will be returned.

If there’re no items that satisfy pred, a thunk failure is tail-called.

NB: The API differs from find in scheme.list (built-in in Gauche), that find does not take failure procedure.

Function: set-count pred set ¶

Function: bag-count pred bag ¶

[R7RS set] {scheme.set} Returns the number of items that satisfy pred in the set/bag.

Function: set-any? pred set ¶

Function: bag-any? pred bag ¶

[R7RS set] {scheme.set} Returns #f iff any item in the set/bag satisfy pred.

NB: It differs from any defined in scheme.list (built-in in Gauche) that any returns the true result of pred, while set-any? always returns a boolean value (hence the question mark).

Function: set-every? pred set ¶

Function: bag-every? pred bag ¶

[R7RS set] {scheme.set} Returns #t iff every item in the set/bag satisfy pred.

NB: It differs from every defined in scheme.list (built-in in Gauche) that every returns the last true result of pred when all the elements satisfy pred, while set-every? always returns a boolean value (hence the question mark).

Mapping and folding ¶

Function: set-map comparator proc set ¶

Function: bag-map comparator proc bag ¶

[R7RS set] {scheme.set} Create and return a new set/bag with the comparator comparator, whose items are calculated by applying proc to each element in the original set/bag.

Function: set-for-each proc set ¶

Function: bag-for-each proc bag ¶

[R7RS set] {scheme.set} Apply proc to each element in the set/bag. The result of proc is ignored. Return value is undefined.

Function: set-fold proc seed set ¶

Function: bag-fold proc seed bag ¶

[R7RS set] {scheme.set} For each item in the set/bag, call proc with two arguments, an item and a seed value. What proc returns becomes the next seed value. The seed argument gives the initial seed value, and the last return value of proc will be the result of set-fold/bag-fold.

(bag-fold + 0 (bag eqv-comparator 1 1 2 2 3 3 4 4))
  ⇒ 20

Function: set-filter pred set ¶

Function: bag-filter pred bag ¶

[R7RS set] {scheme.set} Returns a newly created set/bag with the same comparator of the original set/bag, and its content consists of items from the original set/bag that satisfy pred.

(set->list (set-filter odd? (set eqv-comparator 1 2 3 4 5)))
  ⇒ (1 3 5)

Function: set-remove pred set ¶

Function: bag-remove pred bag ¶

[R7RS set] {scheme.set} Returns a newly created set/bag with the same comparator of the original set/bag, and its content consists of items from the original set/bag that does not satisfy pred.

(set->list (set-remove odd? (set eqv-comparator 1 2 3 4 5)))
  ⇒ (2 4)

Function: set-partition pred set ¶

Function: bag-partition pred bag ¶

[R7RS set] {scheme.set} Returns two sets or bags, both have the same comparator of the original set or bag. The first one consists of the items from the original set/bag that satisfy pred, and the second one consists of the items that don’t.

(receive (in out) (set-remove odd? (set eqv-comparator 1 2 3 4 5))
  (values (set->list in)
          (set->list out)))
  ⇒ (1 3 5) and (2 4)

Function: set-filter! pred set ¶

Function: bag-filter! pred bag ¶

Function: set-remove! pred set ¶

Function: bag-remove! pred bag ¶

Function: set-partition! pred set ¶

Function: bag-partition! pred bag ¶

[R7RS set] {scheme.set} Linear update versions of their counterparts (the procedures without !). They work like their respective counterpart, but they are allowed (but not required) to reuse the original set/bag to produce the result(s).

Note that it is not guaranteed that the original set/bag is modified, so you have to use the return value(s) instead of relying on the side effects.

Copying and conversion ¶

Function: set-copy set ¶

Function: bag-copy bag ¶

[R7RS set] {scheme.set} Returns a copy of the set/bag.

Function: set->list set ¶

Function: bag->list bag ¶

[R7RS set] {scheme.set} Returns a list of all items in the set/bag. Since sets and bags are unordered, there’s no guarantee on the order of items.

Function: list->set comparator elt-list ¶

Function: list->bag comparator elt-list ¶

[R7RS set] {scheme.set} Creates a set or a bag with the given comparator, and the list of element. Functionally equivalent to the followings:

(apply set comparator elt-list)
(apply bag comparator elt-list)

Function: list->set! set elt-list ¶

Function: list->bag! bag elt-list ¶

[R7RS set] {scheme.set} Add items in elt-list to the existing set/bag, and returns the updated set/bag. The original set/bag may or may not be modified. Functionally equivalent to the followings:

(apply set-adjoin! set elt-list)
(apply bag-adjoin! bag elt-list)

Function: bag->set bag ¶

Function: set->bag set ¶

[R7RS set] {scheme.set} Conversions between a bag and a set. Returns a newly created bag or set, respectively.

If bag has duplicated items, bag->set coerces them to one item.

Function: set->bag! bag set ¶

[R7RS set] {scheme.set} Returns a bag that contains all items in set plus all iterms in bag, which may be modified to create the result. Both bag and set must have the same comparator.

Function: bag->alist bag ¶

[R7RS set] {scheme.set} Returns a list of (item . count), where item is an item in bag, and count is the number of that item in the bag.

Function: alist->bag comparator alist ¶

[R7RS set] {scheme.set} Creates a new bag with comparator, and fills it according to alist, which must be a list of (item . count).

If there’s duplicate items in alist, only fist one counts.

Subsets ¶

Function: set=? set1 set2 … ¶

Function: bag=? bag1 bag2 … ¶

[R7RS set] {scheme.set} Returns true iff all sets/bags have exactly same items.

Function: set<? set1 set2 … ¶

Function: bag<? bag1 bag2 … ¶

Function: set>? set1 set2 … ¶

Function: bag>? bag1 bag2 … ¶

Function: set<=? set1 set2 … ¶

Function: bag<=? bag1 bag2 … ¶

Function: set>=? set1 set2 … ¶

Function: bag>=? bag1 bag2 … ¶

[R7RS set] {scheme.set} These predicates checks inclusion relationship between sets or bags. For example, (set<? set1 set2) is #t iff set1 is a proper subset of set2, and (bag>=? bag1 bag2) is #t iff bag2 is a subset (including the ’equal to’ case) of bag1, etc.

If more than two arguments are given, the predicate returns #t iff every consecutive arguments satisfies the relationship.

Set theory operations ¶

Function: set-union set1 set2 … ¶

Function: bag-union bag1 bag2 … ¶

[R7RS set] {scheme.set} Returns a newly allocated set or bag which is a union of all the sets/bags.

Function: set-intersection set1 set2 … ¶

Function: bag-intersection bag1 bag2 … ¶

[R7RS set] {scheme.set} Returns a newly allocated set or bag which is an intersection of all the sets/bags.

Function: set-difference set1 set2 … ¶

Function: bag-difference bag1 bag2 … ¶

[R7RS set] {scheme.set} Returns a newly created set or bag that contains items in set1/bag1 except those are also in set2/bag2 ….

(sort (set->list (set-difference (set eqv-comparator 1 2 3 4 5 6 7)
                                 (set eqv-comparator 3 5 7 9 11 13)
                                 (set eqv-comparator 4 8 16 32))))
  ⇒ (1 2 6)

Function: set-xor set1 set2 ¶

Function: bag-xor bag1 bag2 ¶

[R7RS set] {scheme.set} Returns a newly created set or bag that consists of items that are either in set1/bag1 or set2/bag2, but not in both.

(sort (set->list (set-xor (set eqv-comparator 2 3 5 7 11 13 17)
                          (set eqv-comparator 3 5 7 9 11 13 15))))
  ⇒ (2 9 15 17)

Function: set-union! set1 set2 … ¶

Function: bag-union! bag1 bag2 … ¶

Function: set-intersection! set1 set2 … ¶

Function: bag-intersection! bag1 bag2 … ¶

Function: set-difference! set1 set2 … ¶

Function: bag-difference! bag1 bag2 … ¶

Function: set-xor! set1 set2 ¶

Function: bag-xor! bag1 bag2 ¶

[R7RS set] {scheme.set} Linear update versions of their corresponding procedures. Those procedures works like their !-less counterparts, except that they are allowed to, but not required to, reuse set1/bag1 to produce the result.

The caller should always use the returned set/bag instead of relying on the side effects.

Bag-specific procedures ¶

Function: bag-sum bag1 bag2 … ¶

Function: bag-sum! bag1 bag2 … ¶

[R7RS set] {scheme.set} Returns a bag that gathers all the items in given bags, counting duplicates. The functional version bag-sum always creates new bag to return. The linear update version bag-sum! is allowed to, but not required to, modify bag1 to produce the result.

(sort (bag->list (bag-sum (bag eqv-comparator 1 1 2 4 5 5 6)
                          (bag eqv-comparator 3 3 5 9))))
  ⇒ (1 1 2 3 3 4 5 5 5 6 9)

Note the difference from bag-union:

(sort (bag->list (bag-union (bag eqv-comparator 1 1 2 4 5 5 6)
                            (bag eqv-comparator 3 3 5 9))))
  ⇒ (1 1 2 3 3 4 5 5 6 9)

Function: bag-product n bag ¶

Function: bag-product! n bag ¶

[R7RS set] {scheme.set} Returns a bag that contains every item as n-times many as the original bag. A fresh bag is created and returned by bag-product, while bag-product! may reuse bag to produce the result.

(sort (bag->list (bag-product 2 (bag eq-comparator 'a 'b 'r 'a))))
  ⇒ (a a a a b b r r)

Function: bag-unique-size bag ¶

[R7RS set] {scheme.set} Returns the number of unique elements in bag.

(bag-unique-size (bag eqv-comparator 1 1 2 2 3 3 4))
 ⇒ 4

Function: bag-element-count bag elt ¶

[R7RS set] {scheme.set} Returns the number of specified element elt in bag.

(bag-element-count (bag eqv-comparator 1 1 2 2 2 3 3) 2)
 ⇒ 3

Function: bag-for-each-unique proc bag ¶

[R7RS set] {scheme.set} For each unique item in bag, calls proc with two arguments: The item, and the count of the item in the bag.

Function: bag-fold-unique proc seed bag ¶

[R7RS set] {scheme.set} For each unique item in bag, calls proc with three arguments: The item, the count of the item, and the previous seed value. The seed argument provides the initial seed value; the result of proc is used for the next seed value, and the last result of proc is returned from bag-fold-unique.

(sort (bag-fold-unique acons '()
        (bag equal-comparator "a" "a" "b" "b" "b" "c" "d"))
      string<? car)
 ⇒ (("a" . 2) ("b" . 3) ("c" . 1) ("d" . 1))

Function: bag-increment! bag elt count ¶

Function: bag-decrement! bag elt count ¶

[R7RS set] {scheme.set} Linearly update bag to increase or decrease the count of elt in it by count, which must be an exact integer. Note that the element count won’t get below zero; if a bag has two a’s, and you call (bag-decrement! bag 'a 100), you get a bag with zero a’s.

Comparators ¶

Comparator: set-comparator ¶

Comparator: bag-comparator ¶

[R7RS comparator] {scheme.set} Comparators to be used to compare sets or bags. They don’t provide comparison procedure, for you cannot define a total order among sets or bags. They do provide hash functions.

10.3.6 scheme.charset - R7RS character sets ¶

Module: scheme.charset ¶

Implements character set library, originally defined as SRFI-14. Note that the following character-set procedures and pre-defined charsets are Gauche’s build-in. See Character Sets.

char-set             char-set?            char-set-contains?
char-set-copy        char-set-complement  char-set-complement!

char-set:lower-case  char-set:upper-case  char-set:title-case
char-set:letter      char-set:digit       char-set:letter+digit
char-set:graphic     char-set:printing    char-set:whitespace
char-set:iso-control char-set:punctuation char-set:symbol
char-set:hex-digit   char-set:blank       char-set:ascii
char-set:empty       char-set:full

In Gauche, the <char-set> class inherits <collection> and implements the collection protocol, so that the generic operations defined in gauche.collection can also be used (see gauche.collection - Collection framework).

10.3.7 scheme.hash-table - R7RS hash tables ¶

Module: scheme.hash-table ¶

This module provides hash table library, originally defined as srfi.125.

Hash table provided with this module is the same as Gauche’s built-in hash table. However, SRFI-125 introduces procedures that conflict with Gauche’s original procedures, so Gauche provides those procedures built-in but under aliases. See Hashtables, for the built-in hash table procedures.

With this module, procedures are provided as defined in R7RS. Use this module when you’re writing portable code.

SRFI-125 also defines compatibility procedures with SRFI-69, although saying they’re deprecated. Those deprecated procedures are supported in this module, too.

The following procedures are the same as Gauche’s built-in.

hash-table?         hash-table-contains? hash-table-exists?
hash-table-empty?   hash-table=?         hash-table-mutable?
hash-table-ref      hash-table-ref/default
hash-table-set!     hash-table-update!/default
hash-table-clear!   hash-table-size   hash-table-keys
hash-table-values   hash-table-copy   hash-table-empty-copy
hash-table->alist   hash-table-union! hash-table-intersection!
hash-table-difference!                hash-table-xor!

See Hashtables, for the description of those procedures.

The following procedures are also provided as Gauche’s built-in, but with -r7 suffix.

hash-table         hash-table-delete! hash-table-intern!
hash-table-update! hash-table-pop!    hash-table-find
hash-table-count   hash-table-map     hash-table-for-each
hash-table-map!    hash-table-map->list
hash-table-prune!

Function: make-hash-table comparator arg … ¶

Function: make-hash-table equal-proc hash-proc arg … ¶

[R7RS hash-table] {scheme.hash-table} This enhances built-in make-hash-table with the second form, that takes two procedures instead of one comparator, as SRFI-69.

In the SRFI-69 form, equal-proc is a procedure taking two keys to see if they are the same, and hash-proc is a procedure taking a key to calculate its hash value (nonnegative fixnum). The compatibility form is deprecated and should be avoided in the new code.

The optional arg … are implementation-dependent, and specify various properties of the created hash table. They are ignored in Gauche.

Function: hash-table cmpr key value … ¶

[R7RS hash-table] {scheme.hash-table} This is the same as built-in hash-table-r7 (see Hashtables).

Construct a new hash table with key-comparator cmpr. It is populated by key value …, which is a list with keys and values appear alternatively. It is an error if the length of key-value list is not even.

Note that SRFI-125 defines this procedure to return an immutable hash table if the implementation supports one. Gauche doesn’t provide immutable hash tables (we do have immutable map instead, see data.imap - Immutable map), but when you’re writing a portable program, be careful not to modify the table returned by this procedure.

Function: alist->hash-table alist cmpr arg … ¶

Function: alist->hash-table alist equal-proc hash-proc cmpr arg … ¶

[R7RS hash-table] {scheme.hash-table} This enhances built-in alist->hash-table with the second form, that takes two procedures instead of one comparator, as SRFI-69.

In the SRFI-69 form, equal-proc is a procedure taking two keys to see if they are the same, and hash-proc is a procedure taking a key to calculate its hash value (nonnegative fixnum). The compatibility form is deprecated and should be avoided in the new code.

The optional arg … are implementation-dependent, and specify various properties of the created hash table. They are ignored in Gauche.

Function: hash-table-unfold p f g seed comparator :optional arg … ¶

[R7RS hash-table] {scheme.hash-table} Same as Gauche’s built-in hash-table-unfold, except that this allows optional arguments, which are ignored. They are implementation-specific parameters to tune the created hash tables. See Hashtables, for the detailed description.

Function: hash-table-delete! ht key … ¶

[R7RS hash-table] {scheme.hash-table} This is the same as built-in hash-table-delete!-r7.

Deletes entries associated with the given keys from the table ht. It is ok if ht doesn’t have key. Returns the number of entries that are actually deleted.

It differs from built-in hash-table-delete! in two points: The built-in one can take exactly one key, and returns a boolean indicating if the entry is actually deleted.

Function: hash-table-intern! ht key failure ¶

[R7RS hash-table] {scheme.hash-table} This is the same as built-in hash-table-intern!-r7.

Search key in ht. If it is found, returns the associated value. If it is not found, call failure without artuments, and insert a new entry associating key and the value failure returns, and returns that new value.

Function: hash-table-update! ht key updater :optional failure success ¶

[R7RS hash-table] {scheme.hash-table} This is the same as built-in hash-table-update!-r7. It takes different optional arguments from built-in hash-table-update!.

Updater is a procedure that takes one argument, failure is a thunk, and success is a procedure that takes one argument.

Works the same as follows, except maybe more efficiently.

(hash-table-set! ht key (updater (hash-table-ref ht key failure success)))

Function: hash-table-pop! ht ¶

[R7RS hash-table] {scheme.hash-table} This is the same as built-in hash-table-pop!-r7. It is a completely different procedure as built-in hash-table-pop!.

Removes an arbitrary entry in the hash table ht, and returns the removed entry’s key and value as two values.

If ht is empty, an error is signalled.

Function: hash-table-find proc ht failure ¶

[R7RS hash-table] {scheme.hash-table} This is the same as built-in hash-table-find-r7. It takes different arguments from built-in hash-table-find.

Calls proc with a key and a value of each entry in ht, until proc returns non-false value. If proc returns non-false value, hash-table-find immediately returns it. If proc returns #f for all entries, calls a thunk failure and returns its result.

Function: hash-table-count proc ht ¶

[R7RS hash-table] {scheme.hash-table} This is the same as built-in hash-table-count-r7.

Calls proc with a key and a value of each entry in ht, and returns the number of times when proc returned true.

Function: hash-table-map proc cmpr ht ¶

[R7RS hash-table] {scheme.hash-table} This is the same as built-in hash-table-map-r7. This is different from built-in hash-table-map.

Creates a fresh hashtable with a key comparator cmpr, then populate it by inserting the key and the result of applying proc on the value of each entry in ht.

Function: hash-table-map! proc ht ¶

[R7RS hash-table] {scheme.hash-table} This is the same as built-in hash-table-map!-r7.

Calls proc on the key and value of each entry in ht, and update the entry of the key with the result of proc.

Function: hash-table-map->list proc ht ¶

[R7RS hash-table] {scheme.hash-table} This is the same as built-in hash-table-map->list-r7, and same as built-in hash-table-map (not the scheme.hash-table’s hash-table-map) except the order of the arguments.

Apply proc on a key and a value of each entry in ht, in arbitrary order, and returns a list of results.

Function: hash-table-for-each proc ht ¶

Function: hash-table-for-each ht proc ¶

[R7RS hash-table] {scheme.hash-table} Apply proc on a key and a value of each entry in ht. The result of proc is discarded. Returns an unspecified value.

This procedure allows arguments in both order for the compatibility— the first way is the scheme.hash-table recommended one, which is the same as built-in hash-table-for-each-r7, and the latter way is compatible with SRFI-69, which is the same as built-in hash-table-for-each.

It is unfortunate that this compatibility thing is extremely confusing; especially in Gauche, you can make anything applicable, so the distinction between procedures and other objects is blurred.

We recommend that you stick to one way or another within a module; if your module uses built-in interface, use (hash-table-for-each ht proc). If your module imports scheme.hash-table, use (hash-table-for-each proc ht).

Function: hash-table-fold proc seed ht ¶

Function: hash-table-fold ht proc seed ¶

[R7RS hash-table] {scheme.hash-table} The proc argument takes three arguments, a key, a value, and the current seed value. The procedure applies proc for each entry in ht, using seed as the first seed value, and using the previous result of proc as the subsequent seed value. Returns the result of the last call of seed.

This procedure allows arguments in both order for the compatibility— the first way is the scheme.hash-table recommended one, which is the same as built-in hash-table-fold-r7, and the latter way is compatible with SRFI-69, which is the same as built-in hash-table-fold.

It is unfortunate that this compatibility thing is extremely confusing. We recommend that you stick to one way or another within a module; if your module uses built-in interface, use the second interface. If your module is for portable R7RS code, use the first interface.

Function: hash-table-prune! proc ht ¶

[R7RS hash-table] {scheme.hash-table} This is the same as built-in hash-table-prune!-r7.

Apply proc on a key and a value of each entry in ht, and deletes the entry if proc returns a true value. This procedure returns an unspecified value.

Function: hash-table-merge! ht1 ht2 ¶

[R7RS hash-table] {scheme.hash-table} Deprecated. This is the same as hash-table-union!, and provided just for the compatibility with SRFI-69.

Function: hash obj :optional ignore ¶

Function: string-hash obj :optional ignore ¶

Function: string-ci-hash obj :optional ignore ¶

Function: hash-by-identity obj :optional ignore ¶

[R7RS hash-table] {scheme.hash-table} Provided for the compatibility with SRFI-69, and are deprecated.

The first three are the same as built-in default-hash, string-hash, and string-ci-hash, except that these accept an optional second argument, which is ignored. Note that hash-by-identity is also defined as the same as default-hash except the ignored optional second argument, per SRFI-125, although the name suggests that it would work as if eq-hash.

Do not use these procedures in the new code; you can use comparators instead (default-comparator, string-comparator, string-ci-comparator and eq-comparator, see Predefined comparators). If you do need hash function, you should still avoid hash and hash-by-identity, and use default-hash and eq-hash instead.

Function: hash-table-equivalence-function ht ¶

Function: hash-table-hash-function ht ¶

[R7RS hash-table] {scheme.hash-table} Provided for the compatibility with SRFI-69, and are deprecated.

Returns the equivalence function and hash function of a hash table ht.

Note that SRFI-69’s hash function takes an optional bound argument; so, if you build ht with a comparator or a hash function that does not take optional argument, hash-table-hash-function wraps the real hash function with a procedure that allows optional bound argument.

For the introspection, we recommend to use built-in hash-table-comparator (see Hashtables).

10.3.8 scheme.ilist - R7RS immutable lists ¶

Module: scheme.ilist ¶

This module provides a set of procedures that handles immutable pairs and lists.

The standard allows an implementation to have mutable pairs and immutable pairs separately, so it defines immutable version of most scheme.list procedures. In Gauche, mutable pairs and immutable pairs are both abstract “pairs”, and all procedures that accesses pairs (without modifying them) works seamlessly on both kind.

Consequently, the following procedures are just aliases of their non-immutable versions (just remove i prefix from them). Note that these procedures and variables in Gauche do not reject if the input is mutable pairs/lists, but such usage may not be portable (see Mutable and immutable pairs).

proper-ilist?     ilist?            dotted-ilist?     not-ipair?
null-ilist?       ilist=
icar              icdr              icaar             icadr
icdar             icddr             icaaar            icaadr
icadar            icaddr            icdaar            icdadr
icddar            icdddr            icaaaar           icaaadr
icaadar           icaaddr           icadaar           icadadr
icaddar           icadddr           icdaaar           icdaadr
icdadar           icdaddr           icddaar           icddadr
icdddar           icddddr           icar+icdr         ilist-ref
ifirst            isecond           ithird            ifourth
ififth            isixth            iseventh          ieighth
ininth            itenth
idrop             ilist-tail        itake-right
ilast             last-ipair        ilength           icount
ifor-each         ifold             ipair-fold        ireduce
ifold-right       ipair-fold-right  ireduce-right     ipair-for-each
imember           imemv             imemq             ifind-tail
iany              ievery            ilist-index       idrop-while
iassoc            iassq             iassv             iapply
make-ilist-comparator               make-improper-ilist-comparator
make-icar-comparator                make-icdr-comparator
make-ipair-comparator

10.3.9 scheme.rlist - R7RS random-access lists ¶

Module: scheme.rlist ¶

This module provides an alternative datatype for pairs and lists, which are immutable and allows O(log n) random access, while maintaining O(1) car and cdr operations. This is originally defined as srfi.101. We call this datatype rlist in the following explanation.

The srfi allows a Scheme implementation to adopt rlist as the built-in pairs and lists, so the procedure names are duplicated from the Scheme primitives. If you use this module, you might want to import with prefix (e.g. (use scheme.rlist :prefix rlist:)).

In Gauche, we implement rlist on top of skew-list (see data.skew-list - Skew binary random-access lists). The main difference is that skew-list only allows proper lists, while rlist allows improper lists (the cdr of the last pair can be an arbitrary objects).

However, having improper lists makes things a lot complicated. If you just need a list with fast random access, you want to use skew-list. Use rlist only if you need to deal with improper lists.

The following procedures behave just like the built-in counterparts, except they take/return rlists instead of ordinary pairs and lists. (NB: list-ref and list-tail here doesn’t take the optional fallback argument, for they are Gauche’s extension).

pair?     cons       car        cdr
caar      cadr       cdar       cddr
caaar     caadr      cadar      caddr
cdaar     cdadr      cddar      cdddr
caaaar    caaadr     caadar     caaddr
cadaar    cadadr     caddar     cadddr
cdaaar    cdaadr     cdadar     cdaddr
cddaar    cddadr     cdddar     cddddr
null?     list?      list       make-list
length    append     reverse    list-tail
list-ref  map        for-each

This module also exports a syntax quote, which denotes the literal rlist. (quote (a (b c))) becomes a literal rlist consists of elements a, and an rlist consists of b and c.

Note that if you import scheme.rlist without suffix, the shorthand notation '(a (b c)) refers to scheme.rlist#quote, instead of built-in quote.

Function: list-set rlist k obj ¶

[R7RS rlist] {scheme.rlist} Returns a new rlist which is the same as rlist except that its k-th element is replaced with obj. This is O(log n) operation where n is the length of rlist.

Function: list-ref/update rlist k proc ¶

[R7RS rlist] {scheme.rlist} Returns two values, the result of (list-ref rlist k) and the result of (list-set rlist k (proc (list-ref rlist k))), but may be more efficient.

Function: random-access-list->linear-access-list rlist ¶

[R7RS rlist] {scheme.rlist} Convert a proper rlist to an ordinary list. An error is thrown when rlist is not proper. The conversion is only done in the “spine” of rlist; that is, if rlist is nested, only the outermost rlist is converted.

Function: linear-access-list->random-access-list list ¶

[R7RS rlist] {scheme.rlist} Convert a proper ordinary list to an rlist. An error is thrown when list is not proper. The conversion is only done in the “spine” of list; that is, if list is nested, only the outermost list is converted.

10.3.10 scheme.ideque - R7RS immutable deques ¶

Module: scheme.ideque ¶

This module provides a functional double-ended queue (deque, pronounced as “deck”), with amortized O(1) access of queue operations on either end.

It also serves as a convenient bidirectional list structures in a sense that operations from the end of the list is just as efficient as the ones from the front.

Note: If you don’t need immutability and wants space-efficient deque, you can also use data.ring-buffer as a deque (see data.ring-buffer - Ring buffer).

This module was originally defined as srfi.134, then became a part of R7RS large.

Gauche’s data.ideque is a superset of this module. See data.ideque - Immutable deques.

Function: ideque element … ¶

[R7RS ideque] {scheme.ideque} Returns an ideque with the given elements.

Function: ideque-unfold p f g seed ¶

[R7RS ideque] {scheme.ideque} Construct an ideque in the same way as unfold (see scheme.list - R7RS lists), that is, a predicate p is applied to a current state value; if it returns true, the iteration stops. Otherwise, an item generator function f is applied to the current state value, and its value becomes an element of the ideque. Then a next state function g is applied to the current state value, and its result becomes the next state value, and we iterate. The result of f is gathered in order, and becomes the content of the returned ideque. The seed argument specifies the initial state value.

(ideque->list
  (ideque-unfold (cut > <> 10) square (cut + <> 1) 0))
 ⇒ (0 1 4 9 16 25 36 49 64 81 100)

Function: ideque-unfold-right p f g seed ¶

[R7RS ideque] {scheme.ideque} Similar to ideque-unfold, but the generated elements are stored in the reverse order in the resulting ideque.

(ideque->list
  (ideque-unfold-right (cut > <> 10) square (cut + <> 1) 0))
 ⇒ (100 81 64 49 36 25 16 9 4 1 0)

Function: ideque-tabulate size init ¶

[R7RS ideque] {scheme.ideque} Create an ideque of length size, whose i-th element is computed by (init i).

(ideque->list (ideque-tabulate 11 square))
 ⇒ (0 1 4 9 16 25 36 49 64 81 100)

Function: ideque? obj ¶

[R7RS ideque] {scheme.ideque} Returns true iff obj is an ideque.

Function: ideque-empty? idq ¶

[R7RS ideque] {scheme.ideque} Returns true iff an ideque idq is empty.

Function: ideque-add-front idq x ¶

Function: ideque-add-back idq x ¶

[R7RS ideque] {scheme.ideque} Returns an ideque with an item x added to the front or back of an ideque idq, respectively. These are O(1) operations.

Function: ideque-front idq ¶

Function: ideque-back idq ¶

[R7RS ideque] {scheme.ideque} Returns the front or back element of an ideque idq, respectively. An error is thrown if idq is empty. Thess are O(1) operations.

Function: ideque-remove-front idq ¶

Function: ideque-remove-back idq ¶

[R7RS ideque] {scheme.ideque} Returns an ideque with the front or back element of idq removed, respectively. An error is thrown if idq is empty. These are O(1) operations.

Function: ideque-reverse idq ¶

[R7RS ideque] {scheme.ideque} Returns an ideque with the elements of idq in reverse order. This is O(1) operation.

Function: ideque= elt= idq … ¶

[R7RS ideque] {scheme.ideque} Returns #t iff all ideques are of the same length, and each corresponding element compares equal by elt=, which is called with two arguments, one element from i-th ideque and another element from (i+1)-th ideque.

If zero or one ideque is given, elt= won’t be called at all and this procedure returns #t.

Function: ideque-ref idq n ¶

[R7RS ideque] {scheme.ideque} Returns n-th element of idq. An error is signaled if n is out of range.

Function: ideque-take idq n ¶

Function: ideque-take-right idq n ¶

[R7RS ideque] {scheme.ideque} Returns an ideque that has first or last n elements of idq, respectively An error is signaled if n is greater than the length of idq.

Function: ideque-drop idq n ¶

Function: ideque-drop-right idq n ¶

[R7RS ideque] {scheme.ideque} Returns an ideque that has elements of idq with first or last n elements removed, respectively. An error is signaled if n is greater than the length of idq.

Function: ideque-split-at idq n ¶

[R7RS ideque] {scheme.ideque} Returns two ideques, the first one is (ideque-take idq n) and the second one is (ideque-drop idq n). An error is signaled if n is greater than the length of idq.

Function: ideque-length idq ¶

[R7RS ideque] {scheme.ideque} Returns the length of idq.

Function: ideque-append idq … ¶

[R7RS ideque] {scheme.ideque} Returns an ideque that concatenates contents of given ideques.

Function: ideque-zip idq idq2 … ¶

[R7RS ideque] {scheme.ideque} Returns an ideque whose i-th element is a list of i-th elements of given ideques. If the length of given ideques differ, the result terminates at the shortest ideque.

(ideque->list
  (ideque-zip (ideque 'a 'b 'c) (ideque 1 2) (ideque 'x 'y 'z)))
 ⇒ ((a 1 x) (b 2 y))

Function: ideque-map proc idq … ¶

[R7RS ideque] {scheme.ideque} Applies proc to each element of idq, and returns an ideque containins the results in order. The dynamic order of calls of proc is unspecified. This is O(n) operation.

Note that R7RS ideque only supports single idq argument. It is Gauche’s extension to allow more than one idq arguments; in that case, proc gets as many arguments as the given ideques, each argument taken from each ideque. The length of the result ideque is limited to the shortest length of the input ideques.

(ideque->list (ideque-map square (ideque 1 2 3 4 5)))
  ⇒ (1 4 9 16 25)
(ideque->list (ideque-map + (ideque 1 2 3 4 5) (ideque 2 2 2)))
  ⇒ (11 12 13)

Function: ideque-filter-map proc idq … ¶

[R7RS ideque] {scheme.ideque} Applies proc to each element of idq, and returns an ideque containins the results in order, except #f. The dynamic order of calls of proc is unspecified.

Note that R7RS ideque only supports single idq argument. It is Gauche’s extension to allow more than one idq arguments; in that case, proc gets as many arguments as the given ideques, each argument taken from each ideque. The input is read until any of the idq reaches at the end.

Function: ideque-for-each proc idq … ¶

Function: ideque-for-each-right proc idq … ¶

[R7RS ideque] {scheme.ideque} Applies proc to each element of idq from left to right (ideque-for-each) or right to left (ideque-for-each-right). Results of proc are discarded.

Returns an unspecified value.

Note that R7RS ideque only supports single idq argument. If more than one ideques are given, proc gets as many arguments as the given ideques, each argument taken from each ideque.

ideque-for-each takes each ideque’s elements from leftmost ones, while ideque-for-each-right takes each ideque’s elements from rightmost ones. Both ends when the shortest ideque is exhausted.

(ideque-for-each ($ display $ list $)
                 (ideque 'a 'b 'c 'd 'e)
                 (ideque 1 2 3))
 ⇒ prints (a 1)(b 2)(c 3)

(ideque-for-each-right ($ display $ list $)
                       (ideque 'a 'b 'c 'd 'e)
                       (ideque 1 2 3))
 ⇒ prints (e 3)(d 2)(c 1)

Function: ideque-fold proc knil idq … ¶

Function: ideque-fold-right proc knil idq … ¶

[R7RS ideque] {scheme.ideque}

Function: ideque-append-map proc idq … ¶

[R7RS ideque] {scheme.ideque}

Function: ideque-filter pred idq ¶

Function: ideque-remove pred idq ¶

[R7RS ideque] {scheme.ideque}

Function: ideque-partition pred idq ¶

[R7RS ideque] {scheme.ideque}

Function: ideque-find pred idq :optional failure ¶

Function: ideque-find-right pred idq :optional failure ¶

[R7RS ideque] {scheme.ideque}

Function: ideque-take-while pred idq ¶

Function: ideque-take-while-right pred idq ¶

[R7RS ideque] {scheme.ideque}

Function: ideque-drop-while pred idq ¶

Function: ideque-drop-while-right pred idq ¶

[R7RS ideque] {scheme.ideque}

Function: ideque-span pred idq ¶

Function: ideque-break pred idq ¶

[R7RS ideque] {scheme.ideque}

Function: ideque-any pred idq … ¶

Function: ideque-every pred idq … ¶

[R7RS ideque] {scheme.ideque}

Function: ideque->list idq ¶

Function: list->ideque list ¶

[R7RS ideque] {scheme.ideque}

Function: ideque->generator idq ¶

Function: generator->ideque gen ¶

[R7RS ideque] {scheme.ideque}

10.3.11 scheme.text - R7RS immutable texts ¶

Module: scheme.text ¶

This module provides text type, an immutable string with O(1) random access. This is originally defined in SRFI-135.

In Gauche, a string with index access generally takes O(n) because of mulit-byte representation; however, if the string is ASCII-only or you precalculate string indexes, index access becomes O(1) (see String indexing). So, a text in Gauche is just an immutable indexed string. It satisfies string?, too.

Since text is not disjoint from string in Gauche, textual type mentioned in this srfi is equivalent to a string type, and many textual-* procedures are just aliases to the corresponding string-* procedures.

However, if you’re writing portable code, keep it in mind that some implementation may have disjoint text and string types.

Function: text? obj ¶

[R7RS text] {scheme.text} Returns #t iff obj is a text, which is an immutable indexed string in Gauche. Note that a text type is not disjoint from a string in Gauche.

Function: textual? obj ¶

[R7RS text] {scheme.text} Returns #t iff obj is either a text or a string. In Gauche, this is just an alias of string?.

Function: textual-null? obj ¶

[R7RS text] {scheme.text} Returns #t iff obj is an empty string/text. In Gauche this is just an alias of string-null?.

Function: textual-every pred textual :optional start end ¶

Function: textual-any pred textual :optional start end ¶

[R7RS text] {scheme.text} Like string-every and string-any, but can work on both texts and strings. In Gauche, these are just aliases of string-every and string-any.

Function: make-text len char ¶

[R7RS text] {scheme.text} In Gauche it is same as make-string, except that the returned string is immutable and indexed, and you can’t omit char.

Function: text char … ¶

[R7RS text] {scheme.text} Like string, but returned string is immutable and indexed.

Function: text-tabulate proc len ¶

[R7RS text] {scheme.text} Like string-tabulate, but returned string is immutable and indexed (see String constructors).

Function: text-unfold p f g seed :optional base make-final ¶

Function: text-unfold-right p f g seed :optional base make-final ¶

[R7RS text] {scheme.text} Like string-unfold and string-unfold-right, but returned string is immutable and indexed (see String constructors). The mapper procedure f may return a string instead of a character.

Function: text-length text ¶

[R7RS text] {scheme.text} Returns the length of text. An error is signaled if text is not a text.

Function: text-ref text index ¶

[R7RS text] {scheme.text} Returns index-th character of the text. Guaranteed to be O(1). An error is signaled if text is not a text.

Function: textual-length textual ¶

[R7RS text] {scheme.text} Returns the length of a text or a string. This is just an alias of string-length in Gauche.

Function: textual-ref textual index ¶

[R7RS text] {scheme.text} Returns index-th character of the text. This is just an alias of string-ref in Gauche.

Function: textual->text textual ¶

[R7RS text] {scheme.text} Takes a string, and returns an immutable, indexed string of the same content. If textual is already a such string, it is returned as is.

Function: textual->string textual :optional start end ¶

Function: textual->vector textual :optional start end ¶

Function: textual->list textual :optional start end ¶

[R7RS text] {scheme.text} Converts a textual to a fresh mutable string, a vector and a list, respectively. These are aliases of string-copy, string->vector and string->list in Gauche.

Function: string->text string :optional start end ¶

Function: vector->text char-vector :optional start end ¶

Function: list->text char-list :optional start end ¶

[R7RS text] {scheme.text} Convert a string, a vector of characters, and a list of characters to an immutable indexed string. If an immutable indexed string is given to string->text without start/end arguments, the input is returned as is.

Function: reverse-list->text char-list ¶

[R7RS text] {scheme.text} Same as (list->text (reverse char-list)) but maybe more efficient.

Function: textual->utf8 textual :optional start end ¶

[R7RS text] {scheme.text} Returns a bytevector (u8vector) that contains utf8 encoding of the input textual. In Gauche, it is the same as string->utf8 (see Unicode transfer encodings).

Function: textual->utf16 textual :optional start end ¶

[R7RS text] {scheme.text} Returns a bytevector (u8vector) that contains utf16 encoding of the input textual, with BOM attached, and in the native byteorder. In Gauche, it is the same as (string->utf16 textual (native-endian) #t [start end]) (see Unicode transfer encodings).

Function: textual->utf16be textual :optional start end ¶

Function: textual->utf16le textual :optional start end ¶

[R7RS text] {scheme.text} Returns a bytevector that contains utf16be and utf16le encoding of the input textual. No BOM is attached. In Gauche, they are the same as (string->utf16 textual 'big-endian #f [start end]) and (string->utf16 textual 'little-endian #t [start end]) (see Unicode transfer encodings).

Function: utf8->text bytevector :optional start end ¶

[R7RS text] {scheme.text} Converts a utf8 octet sequence stored in bytevector (u8vector) to a text. If the octet sequence begins with BOM sequence, it is interpreted as a character U+FEFF. Optional start/end arguments limits the input range of bytevector.

If the input contains an invalid utf-8 sequence, and Gauche’s native encoding is utf-8, it is replaced by a unicode replacement character U+FFFD. (NB: SRFI-135 says it is an error.)

Function: utf16->text bytevector :optional start end ¶

Function: utf16be->text bytevector :optional start end ¶

Function: utf16le->text bytevector :optional start end ¶

[R7RS text] {scheme.text} Converts a utf16 octet sequence stored in bytevector to a text. For utf16->text, the sequence may begin with BOM, in which case it determines the endianness. Otherwise, platform’s native endianness is assumed. Fro utf16be->text and utf16le->text, the input is assumed to be in UTF16BE/UTF16LE respectively; if it begins with BOM it is treated as a character U+FEFF.

Optional start/end arguments limits the input range of bytevector. If the length of input (end - start, if the range is limited) isn’t even, an error is thrown.

If the input contains an invalid utf-16 sequence (unpaired surrogates), it is replaced by a unicode replacement character U+FFFD. (NB: SRFI-135 says it is an error.)

Function: subtext text start end ¶

Function: subtextual textual start end ¶

[R7RS text] {scheme.text} Returns a text between start-th (inclusive) and end-th (exclusive) characters in the input.

Function: textual-copy textual :optional start end ¶

[R7RS text] {scheme.text} Returns a copy of textual, optionally limited between start/end, as a text.

SRFI-135 specifies that even the input is a text, the returned one must be freshly allocated (as opposed to subtextual, which is allowed to return the result sharing the input). In Gauche, string body is immutable anyway, so it isn’t a big deal.

Function: textual-take textual nchars ¶

Function: textual-drop textual nchars ¶

Function: textual-take-right textual nchars ¶

Function: textual-drop-right textual nchars ¶

Function: textual-pad textual len :optional char start end ¶

Function: textual-pad-right textual len :optional char start end ¶

Function: textual-trim textual :optional pred start end ¶

Function: textual-trim-right textual :optional pred start end ¶

Function: textual-trim-both textual :optional pred start end ¶

[R7RS text] {scheme.text} In Gauche, these are the same as corresponding string operations (string-take, string-drop, string-take-right, string-drop-right, string-pad, string-pad-right, string-trim, string-tirm-right, and string-trim-both), except that the returned string is always immutable and indexed. See String selection, for these string procedures.

Function: textual-replace textual1 textual2 start1 end1 :optional start2 end2 ¶

[R7RS text] {scheme.text} In Gauche, this is same as string-replace, except that the returned string is always immutable and indexed. See Other string operations, for the details.

Function: textual=? textual1 textual2 textual3 … ¶

Function: textual<? textual1 textual2 textual3 … ¶

Function: textual>? textual1 textual2 textual3 … ¶

Function: textual<=? textual1 textual2 textual3 … ¶

Function: textual>=? textual1 textual2 textual3 … ¶

[R7RS text] {scheme.text}  EN In Gauche, these are just aliases of built-in string=?, string<?, string>?, string<=? and string>?, respectively. See String comparison, for the details.

Function: textual-ci=? textual1 textual2 textual3 … ¶

Function: textual-ci<? textual1 textual2 textual3 … ¶

Function: textual-ci>? textual1 textual2 textual3 … ¶

Function: textual-ci<=? textual1 textual2 textual3 … ¶

Function: textual-ci>=? textual1 textual2 textual3 … ¶

[R7RS text] {scheme.text} In Gauche, these are just aliases of the unicode version of string-ci=?, string-ci<?, string-ci>?, string-ci<=? and string-ci>?, respectively. See Full string case conversion, for the details.

Function: textual-prefix-length textual1 textual2 :optional start1 end1 start2 end2 ¶

Function: textual-suffix-length textual1 textual2 :optional start1 end1 start2 end2 ¶

Function: textual-prefix? textual1 textual2 :optional start1 end1 start2 end2 ¶

Function: textual-suffix? textual1 textual2 :optional start1 end1 start2 end2 ¶

[R7RS text] {scheme.text} In Gauche, these are just aliases of srfi.13’s string-prefix-length, string-suffix-length, string-prefix?, and string-suffix?, respectively. See String prefixes & suffixes, for the details.

Function: textual-index textual pred :optional start end ¶

Function: textual-index-right textual pred :optional start end ¶

Function: textual-skip textual pred :optional start end ¶

Function: textual-skip-right textual pred :optional start end ¶

Function: textual-contains textual-haystack textual-needle :optional start1 end1 start2 end2 ¶

Function: textual-contains-right textual-haystack textual-needle :optional start1 end1 start2 end2 ¶

[R7RS text] {scheme.text} In Gauche, these are just aliases of srfi.13’s string-index, string-index-right, string-skip, string-skip-right, string-contains, and string-contains-right, respectively. See String searching, for the details.

Function: textual-upcase textual ¶

Function: textual-downcase textual ¶

Function: textual-foldcase textual ¶

Function: textual-titlecase textual ¶

[R7RS text] {scheme.text} In Gauche, these are the same as string-upcase, string-downcase, string-foldcase and string-titlecase of gauche.unicode, respectively, except that the result is always an immutable and indexed string. See Full string case conversion, for the details.

Function: textual-append textual … ¶

Function: textual-concatenate textual-list ¶

[R7RS text] {scheme.text} In Gauche, these are the same as string-append and string-concatenate respectively, except that the result is always an immutable and indexed string.

Function: textual-concatenate-reversse args :optional final-textual end ¶

[R7RS text] {scheme.text} The args must be a list of textuals (same as strings in Gauche). As to the optional arguments, final-textual must be a textual, and end must be a nonnegative exact integer, if provided.

Without optional arguments, this is the same as string-concatenate-reverse of srfi.13 (see String reverse & append, except that the result is always an immutable and indexed string.

If final-textual is provided, it is appended to the last. If end is also provided, (subtext final-textual 0 end) is appended to the last.

Function: textual-join textual-list :optional delimiter grammar ¶

[R7RS text] {scheme.text} This is the same as string-join except that the result is always an immutable and indexed string (see String utilities).

Function: textual-fold kons knil textual :optional start end ¶

Function: textual-fold-right kons knil textual :optional start end ¶

[R7RS text] {scheme.text} These are just aliases of srfi.13’s string-fold and string-fold-right, respectively (see String mapping).

Function: textual-map proc textual1 textual2 … ¶

[R7RS text] {scheme.text} For every corresponding characters from input textuals, proc is applied. It must return either a character or a text. The result of proc is concatenated into a new text and returned. Similar to string-map, but the difference is it allows 1-to-n mappinb by letting proc return a string.

The dynamic order in which proc is called is unspecified.

If more than one textual are given, it scans up to the shortest textual.

(textual-map (^c (string c c)) "abc")
 ⇒ "aabbcc"
(textual-map (^[a b] (if (char<? a b) a b))
             "continuation" "parameterization")
 ⇒ "canaietarioa"

Function: textual-for-each proc textual1 textual2 … ¶

[R7RS text] {scheme.text} For every corresponding characters from input textuals, proc is applied, from left to right order. The result of proc is discarded. The procedure returns an undefined value.

If more than one textual are given, it scans up to the shortest textual.

Function: textual-map-index proc textual :optional start end ¶

[R7RS text] {scheme.text}

Function: textual-for-each-index proc textual :optional start end ¶

[R7RS text] {scheme.text}

Function: textual-count textual pred :optional start end ¶

[R7RS text] {scheme.text}

Function: textual-filter pred textual :optional start end ¶

Function: textual-remove pred textual :optional start end ¶

[R7RS text] {scheme.text}

Function: textual-replicate textual from to :optional start end ¶

[R7RS text] {scheme.text}

Function: textual-split textual delimiter :optional grammar limit start end ¶

[R7RS text] {scheme.text} Like string-split, except that the returned strings are all immutable and indexed. See String utilities, for the details.

10.3.12 scheme.generator - R7RS generators ¶

Module: scheme.generator ¶

This module provides generators and accumulators. They were first defined in SRFI-121, then enhanced in SRFI-158, and finally incorporated R7RS large as (scheme generator).

A generator is a thunk to generate a sequence of values, potentially terminated by EOF. Procedures to deal with generators are provided by gauche.generator, which is a superset of SRFI-121. See gauche.generator - Generators, for the details.

An accumulator is an opposite of generators. They are procedures that work as consumers. An accumulator takes one argument. When non-eof value is given, the value is stored, and when EOF is given, the accumulated value is returned. How the values are accumulated depends on the accumulator.

Once EOF is given, the accumulator is “finalized”. Subsequent EOF makes it return the same accumulated value. It is undefined if other values are passed after EOF is passed.

The accumulator can be used to parameterize procedures that yield aggregate objects. Consider the following procedure, which takes items from two generators and accumulate them alternatively. (Note that glet* is Gauche’s procedure but not in SRFI-158).

(define (intertwine acc gen1 gen2)
  (let loop ()
    (glet* ([a (gen1)]
            [b (gen2)])
      (acc a)
      (acc b)
      (loop)))
  (acc (eof-object)))

The procedure can return various type of collections, without knowing the actual type—the passed accumulator determines it.

(intertwine (list-accumulator) (giota 5) (giota 5 100))
  ⇒ (0 100 1 101 2 102 3 103 4 104)
(intertwine (vector-accumulator) (giota 5) (giota 5 100))
  ⇒ #(0 100 1 101 2 102 3 103 4 104)
(intertwine (bytevector-accumulator) (giota 5) (giota 5 100))
  ⇒ #u8(0 100 1 101 2 102 3 103 4 104)

Note: In Gauche, you can also use classes to parameterize returned container types (e.g. map-to), for many collection classes support builder protocol. See gauche.collection - Collection framework, for the details. Accumulator has the flexibility that you can provide more than one ways to construct return value on the same type (e.g. forward and reverse list).

The following generator procedures are explained in gauche.generator section (see gauche.generator - Generators):

• Generator constructors:

  generator                circular-generator       make-iota-generator
  make-range-generator     make-coroutine-generator
  make-unfold-generator    make-for-each-generator
  list->generator
  vector->generator        reverse-vector->generator
  string->generator        bytevector->generator
  

• Generator operations:

  gcons*                   gappend                  gflatten
  ggroup                   gmerge                   gmap
  gcombine                 gfilter                  gremove
  gstate-filter            ggroup
  gtake                    gdrop                    gtake-while
  gdrop-while              gdelete                  gdelete-neighbor-dups
  gindex                   gselect
  

• Generator consumers:

  generator->list         generator->reverse-list   generator-map->list
  generator->vector       generator->vector!        generator->string
  generator-count         generator-any             generator-every
  generator-unfold
  

• Folding generated values:

  generator-fold          generator-for-each        generator-find
  

The following are accumulator procedures:

Function: make-accumulator kons knil finalizer ¶

[R7RS generator] {scheme.generator} Creates and returns an accumulator with a state, whose initial value is knil. When non-EOF value v is passed to the accumulator, kons is called as (kons v state), and its result becomes the new state value. When EOF value is passed, (finalizer state) is called and its result becomes the result of accumulator.

Function: list-accumulator ¶

Function: reverse-list-accumulator ¶

[R7RS generator] {scheme.generator} Creates and returns accumulators that return accumulated value as a list, in the accumulated order (list-accumulator) or the reverse order (reverse-list-accumulator).

Function: vector-accumulator ¶

Function: reverse-vector-accumulator ¶

Function: bytevector-accumulator ¶

[R7RS generator] {scheme.generator} Returns accumulators that return accumulated value as a fresh vector or bytevector (u8vector), in the accumulated order (vector-accumulator, bytevector-accumulator) or the reverse order (reverse-vector-accumulator). There’s no reverse-bytevector-accumulator.

Function: vector-accumulator! vec at ¶

Function: bytevector-accumulator! bvec at ¶

[R7RS generator] {scheme.generator} The vec or bvec argument is a mutable vector or bytevector (u8vector), and is used as a buffer.

Returns an accumulator that stores the accumulated values in the buffer, starting from the index at. It is an error if the accumulator gets more values after the buffer reaches at the end.

Once EOF is passed to the accumulator, vec or bvec is returned, respectively.

Function: string-accumulator ¶

[R7RS generator] {scheme.generator} Returns an accumulator that accepts characters and accumulates them to a string.

Function: sum-accumulator ¶

Function: product-accumulator ¶

Function: count-accumulator ¶

[R7RS generator] {scheme.generator} Returns accumulators that yield a scalar value.

The accumulator created by sum-accumulator and product-accumulator accepts numbers, and keep adding or multiplying it with the accumulated value (the default value is 0 and 1, respectively).

The accumulator created by count-accumulator accepts any objects and just counting it.

10.3.13 scheme.lseq - R7RS lazy sequences ¶

Module: scheme.lseq ¶

This module provides lightweight lazy sequence (lseq), conceptually represented by a pair of element and generator. When the rest of sequence is taken, the generator is evaluated and yields another pair of element and generator, and so on. The overhead is one allocation of a pair per element. It is much lighter than streams (see util.stream - Stream library), which requires to create a thunk for every element.

Gauche already has built-in support for such lazy sequences; we go further to make it behave like ordinary pairs—that is, if you take cdr of a lazy pair, we automatically forces the generator so it is indistinguishable from an ordinary pair, modulo side effects. See Lazy sequences.

SRFI-127, the original srfi for this module, is a bit ambiguous whether its lazy sequence must be implemented with a pair whose cdr is a generator procedure, or it refers to the pair+generator as a conceptual model. Considering of the purpose of lazy sequence, the concrete implementation shouldn’t matter; that is, the user of lazy sequence should not count on the fact that the lseq is an improper list terminated by a generator procedure. Instead, an lseq should be treated as an opaque object that can be passed to scheme.lseq procedures.

With that premise, we implement this module as just a thin wrapper of Gauche’s native lazy sequence. It is upper-compatible, except that the code that assumes the internal structure could break. Notably, the constructor generator->lseq is the same as Gauche’s built-in, which returns Gauche’s lseq, undistinguishable to the ordinary list.

(procedure? (generator->lseq (generator 1)))
  ;; => #t, in SRFI-127 reference implementation,
  ;;    #f, in our implementation.

Function: lseq? x ¶

[R7RS lseq] {scheme.lseq} Returns true iff x is an object that can be passed to lseq procedures. In Gauche, it returns #t if x is a pair or an empty list, since a lazy pair is indistinguishable from a pair.

Function: lseq=? elt=? lseq1 lseq2 ¶

[R7RS lseq] {scheme.lseq} Compare two lseqs element-wise using elt=? and returns #t iff two lseqs are equal.

Function: lseq-car lseq ¶

Function: lseq-first lseq ¶

[R7RS lseq] {scheme.lseq} Returns the first item of lseq. If lseq is empty, an error is raised. In Gauche, these are just aliases of car.

Function: lseq-cdr lseq ¶

Function: lseq-rest lseq ¶

[R7RS lseq] {scheme.lseq} Returns the rest of lseq. If lseq is empty, an error is raised. In Gauche, these are just aliases of cdr.

Function: lseq-take lseq k ¶

Function: lseq-drop lseq k ¶

[R7RS lseq] {scheme.lseq} Returns an lseq that has first k items, or an lseq that skips first k items, respectively.

An error is signaled when the resulting lseq of lseq-take reached at the end of sequence before k items are taken. It is different from Gauche’s ltake, which simply returns () in such case.

On the other hand, lseq-drop is the same as drop in Gauche; it just drops k items from the head of input sequence, regardless of whether it is an ordinary list or lseq.

Function: lseq-realize lseq ¶

[R7RS lseq] {scheme.lseq} Realizes all the elements in lseq, resulting an ordinary list.

Function: lseq->generator lseq ¶

[R7RS lseq] {scheme.lseq} Creates a generator from lseq. In Gauche, this is same as list->generator.

Function: lseq-length lseq ¶

[R7RS lseq] {scheme.lseq} Returns the length of lseq. All the elements in lseq are realized as the side effect. In Gauche, this is same as length.

Function: lseq-append lseq lseq2 … ¶

[R7RS lseq] {scheme.lseq} Append one or more lseqs lazily. This is the same as lappend in Gauche.

Function: lseq-zip lseq lseq2 … ¶

[R7RS lseq] {scheme.lseq} Returns a lazy sequence in which the first element is a list of first elements of lseqs, and so on.

Function: lseq-map proc lseq lseq2 … ¶

[R7RS lseq] {scheme.lseq} Lazy map. The same as Gauche’s lmap. Returns a lazy sequence.

Function: lseq-for-each proc lseq lseq2 … ¶

[R7RS lseq] {scheme.lseq} This one consumes all the input lseqs, applying proc on each corresponding elements of the input sequences for the side effects. In Gauche, it is the same as for-each, for Gauche doesn’t distinguish lseqs and ordinary lists.

Function: lseq-filter pred lseq ¶

Function: lseq-remove pred lseq ¶

[R7RS lseq] {scheme.lseq} Returns an lseq that contains elements from the input lseq that satisfy or don’t satisfy pred, respectively. Lseq-filter is the same as Gauche’s lfilter.

Function: lseq-take-while pred lseq ¶

Function: lseq-drop-while pred lseq ¶

[R7RS lseq] {scheme.lseq} These are the same as Gauche’s ltake-while and drop-while (the latter doesn’t have l-prefix, since it just drops items from the head of the input sequence, regardless of whether it is an ordinary list or an lseq.

Function: lseq-find pred lseq ¶

Function: lseq-find-tail pred lseq ¶

Function: lseq-any pred lseq ¶

Function: lseq-every pred lseq ¶

Function: lseq-index pred lseq ¶

Function: lseq-member pred lseq :optional eq ¶

Function: lseq-memq pred lseq ¶

Function: lseq-memv pred lseq ¶

[R7RS lseq] {scheme.lseq} In Gauche, these are the same as the corresponding list functions, find, find-tail, any, every, list-index, member, memq and memv, respectively, for all of those functions won’t look at input more than necessary so lseqs work just as well as ordinary lists.

10.3.14 scheme.stream - R7RS stream ¶

Module: scheme.stream ¶

This module provides utilities for lazily evaluated streams. It is more heavyweight than lazy sequences (see Lazy sequences), but it strictly implements “as lazy as possible” semantics—elements are never evaluated until it is actually accessed.

The following procedures are provided in Gauche’s util.stream module; see util.stream - Stream library for their description:

stream-null         stream-cons       stream?          stream-null?
stream-pair?        stream-car        stream-cdr       stream-lambda

define-stream       list->stream      port->stream
stream->list        stream-append     stream-concat    stream-constant
stream-drop-while   stream-filter     stream-fold
stream-for-each     stream-from       stream-iterate   stream-length
stream-let          stream-map        stream-match     stream-of
stream-range        stream-ref        stream-reverse   stream-scan
stream-take-while   stream-unfold     stream-unfolds   stream-zip

The following macro and procedures have different interface from Gauche’s util.stream module:

stream              stream-take      stream-drop

Macro: stream expr … ¶

[R7RS stream] {scheme.stream} Returns a new stream whose elements are the result of expr …. Arguments won’t be evaluated until required.

This differs from SRFI-40 and util.stream’s stream, which is a procedure so arguments are evaluated (see Stream constructors, for the details).

Function: stream-take n stream ¶

Function: stream-drop n stream ¶

[R7RS stream] {scheme.stream} Returns a stream that contains first n elements from stream, or elements without first n elements from it, respectively. If stream has less than n elements, stream-take returns a copy of the entire stream, while stream-drop returns a null stream.

Note that the argument order doesn’t follow the Scheme tradition, which takes the main object (stream in this case) first, then the count. Procedures with the same name is provided in util.stream with the different argument order.

10.3.15 scheme.box - R7RS boxes ¶

Module: scheme.box ¶

Gauche supports boxes built-in (see Boxes), so this module is merely a facade that exports the following identifiers:

box    box?    unbox    set-box!

10.3.16 scheme.list-queue - R7RS list queues ¶

Module: scheme.list-queue ¶

A library of simple queue based on lists. Gauche has a queue support in data.queue module, which also includes MT-safe queue (see data.queue - Queue). This library is implemented on top of data.queue’s <queue> object and mainly provided for portable code.

The list-queue is just an instance of <queue>, so you can pass a queue created by make-queue to scheme.list-queue API and a list-queue created by make-list-queue to Gauche’s queue API.

Note: Some API of this library requires to return internal pairs the queue uses, for the efficiency. The pair’s car/cdr will be mutated by subsequent queue operation, and also any mutation done on the pair would cause inconsistency in the original queue.

Function: make-list-queue lis :optional last ¶

[R7RS list-queue] {scheme.list-queue} Creates and returns a list-queue whose initial content is lis. In Gauche, a list queue is just an instance of <queue> (see data.queue - Queue).

The cells in lis are owned by the queue; the caller shouldn’t mutate it afterwards, nor assume its structure remains the same.

The optional last argument must be the last pair of lis. If it is passed, make-list-queue will skip scanning lis and just hold a reference to last as the tail of the queue.

Function: list-queue elt … ¶

[R7RS list-queue] {scheme.list-queue} Creates and returns a list-queue whose initial content is elt …. In Gauche, a list queue is just an instance of <queue> (see data.queue - Queue).

Function: list-queue-copy queue ¶

[R7RS list-queue] {scheme.list-queue} Returns a copy of a list-queue queue.

Function: list-queue-unfold p f g seed :optional queue ¶

[R7RS list-queue] {scheme.list-queue} Prepend queue with the items generated by (unfold p f g seed) and returns the updated queue. See scheme.list - R7RS lists, for unfold. If queue is omitted, a fresh queue is created.

(list-queue-unfold (pa$ = 5) ; p
                   (pa$ * 2) ; f
                   (pa$ + 1) ; g
                   0         ; seed
                   (list-queue 'x 'y 'z))
 ⇒ a queue containing (0 2 4 6 8 x y z)

Function: list-queue-unfold-right p f g seed :optional queue ¶

[R7RS list-queue] {scheme.list-queue} Append queue with the items generated by (unfold-right p f g seed) and returns the updated queue. See scheme.list - R7RS lists, for unfold-right. If queue is omitted, a fresh queue is created.

(list-queue-unfold-right (pa$ = 5) ; p
                         (pa$ * 2) ; f
                         (pa$ + 1) ; g
                         0         ; seed
                         (list-queue 'x 'y 'z))
 ⇒ a queue containing (x y z 8 6 4 2 0)

Function: list-queue? obj ¶

[R7RS list-queue] {scheme.list-queue} Returns true iff queue is a list-queue. In Gauche, it is the same as queue? in the data.queue module.

Function: list-queue-empty? queue ¶

[R7RS list-queue] {scheme.list-queue} Returns true iff queue is empty. Same as queue-empty? of data.queue.

Function: list-queue-front queue ¶

[R7RS list-queue] {scheme.list-queue} Returns the front element of the queue. An error is thrown if queue is empty. Same as queue-front of data.queue.

Function: list-queue-back queue ¶

[R7RS list-queue] {scheme.list-queue} Returns the rear element of the queue. An error is thrown if queue is empty. Same as queue-rear of data.queue.

Function: list-queue-list queue ¶

[R7RS list-queue] {scheme.list-queue} Returns the internal list of queue. Note that the list would be modified by subsequent operations of queue, and any modification on the list would make queue inconsistent. The primary purpose of this procedure is to implement other queue-related operations with small overhead.

If you merely need a cheap access the content of the queue, consider list-queue-remove-all!. That returns the list of elements of the queue without copying, and simultaneously reset the queue to empty, so it’s safe.

Function: list-queue-fist-last queue ¶

[R7RS list-queue] {scheme.list-queue} Returns two values, the first and last pair of queue. If the queue is empty, two empty lists are returned.

This also returns the internal pair of the queue, so any subsequent operations of queue would change the contents of the pairs, and any modification on the pairs would make queue inconsistent. The purpose of this procedure is to implement other queue-related operations with small overhead. This procedure should not be used in general.

Function: list-queue-add-front! queue elt ¶

[R7RS list-queue] {scheme.list-queue} Add elt to the front of queue. Same as (queue-push! queue elt) of data.queue.

Function: list-queue-add-back! queue elt ¶

[R7RS list-queue] {scheme.list-queue} Add elt to the back of queue. Same as (enqueue! queue elt) of data.queue.

Function: list-queue-remove-front! queue ¶

[R7RS list-queue] {scheme.list-queue} Remove an element from the front of queue and returns the removed element. Throws an error if queue is empty. Same as dequeue! of data.queue.

Function: list-queue-remove-back! queue ¶

[R7RS list-queue] {scheme.list-queue} Remove an element from the back of queue and returns the removed element. Throws an error if queue is empty. This isn’t guaranteed to be efficient; it is O(n) operation where n is the number of elements. In general, if you need this operation frequently, you should consider double-ended queue. (See data.ideque - Immutable deques, and also see data.ring-buffer - Ring buffer.)

Function: list-queue-remove-all! queue ¶

[R7RS list-queue] {scheme.list-queue} Remove all the elements from queue and returns them as a list. The list isn’t copied—this is O(1) operation. This should be preferred over list-queue-list, for it’s safer. In Gauche, this is the same as dequeue-all! in data.queue.

Function: list-queue-set-list! queue lis :optional last ¶

[R7RS list-queue] {scheme.list-queue} Modify queue to have the elements in lis as its element. The original content of queue is discarded. If the optional last argument is provided, it must be the last pair of lis, and the procedure uses that instead of scanning lis, to achieve O(1) operation.

After calling this, lis is owned by queue and it may be mutated. The caller shouldn’t change, or rely on lis afterwards.

Function: list-queue-append queue … ¶

[R7RS list-queue] {scheme.list-queue} Returns a fresh list-queue whose contents are concatenation of queues. The contents of arguments are intact. This is O(n) operation where n is the total number of elements.

Function: list-queue-append! queue … ¶

[R7RS list-queue] {scheme.list-queue} Returns a list-queue whose contents are concatenation of queues. During the operation, the contents of queues may be mutated, and they shouldn’t be used any longer. (In Gauche, to avoid accident, we actually empty all the queues.) It is also noted that the result doesn’t need to be eq? to any of the arguments. This is O(m) operation where m is the total number of queues (as opposed to the number of elements).

Function: list-queue-concatenate queues ¶

[R7RS list-queue] {scheme.list-queue} (apply list-queue-append queues).

Function: list-queue-map proc queue ¶

[R7RS list-queue] {scheme.list-queue} Returns a fresh list-queue whose elements are obtained by applying proc on every elements in queue.

Function: list-queue-map! proc queue ¶

[R7RS list-queue] {scheme.list-queue} Replaces every element in queue by the result of application of proc on the element.

Function: list-queue-for-each proc queue ¶

[R7RS list-queue] {scheme.list-queue} Applies proc on every element of queue. The results are discarded.

10.3.17 scheme.ephemeron - R7RS ephemeron ¶

Module: scheme.ephemeron ¶

This module defined ephemerons, a weak reference structure to hold key-value association. This is originally defined as SRFI-142.

Gauche supports weak pointers in the form of weak vectors (see Weak vectors), but it is known that a simple weak pointer (a single pointer that doesn’t prevent the pointed object from being collected) isn’t enough to implement weak key-value association such as mappings.

An ephemeron is a record that points to a key and an associated datum, with the following characteristics:

1. Reference to the key is weak; it doesn’t prevent the key from being collected if there’s no strong reference to the key, except from the datum associated by the ephemeron.
2. Reference to the datum is also a kind of weak; it doesn’t prevent the datum from being collected if there’s no strong reference to the datum, and there’s no strong reference to the associated key. Note that the datum is retained as long as the key is retained, even there’s no strong reference to the datum itself.

Implementing the proper ephemeron requires deep integration with the GC. At this moment, Gauche’s ephemeron is implemented separately from GC, and has the following limitations:

• If the datum has a strong reference to the associated key, the key won’t be collected even if there’s no other strong reference to it.
• After the key is collected and there’s no strong reference to the datum, ephemeron-broken? needs to be called in order to trigger the collection of the datum.

Since the timing of collection isn’t specified in the spec, Gauche’s implementation still conforms SRFI-142, but in practice you need to be aware of these limitations. Eventually we want to support full ephemeron integrated with GC.

Once the key and/or the datum is collected (we call such ephemeron “broken”), referencing them returns a bogus value. The proper way to use an ephemeron e is the following pattern:

(let ([k (ephemeron-key e)]
      [d (ephemeron-datum e)])
  (if (ephemeron-broken? e)
    (... k and d are invalid ...)
    (... k and d are valid ...)))

You should take values, then check if the ephemeron isn’t broken yet. If you call ephemeron-broken? first, there’s a chance that the ephemeron is broken between the check and the time you reference it.

Function: make-ephemeron key datum ¶

[R7RS ephemeron] {scheme.ephemeron} Create a new ephemeron associating the key to the datum.

Function: ephemeron? obj ¶

[R7RS ephemeron] {scheme.ephemeron} Returns #t iff obj is an ephemeron.

Function: ephemeron-key ephemeron ¶

Function: ephemeron-datum ephemeron ¶

[R7RS ephemeron] {scheme.ephemeron} Returns the key and the datum of ephemeron, respectively. If the ephemeron is already broken, there’s no guarantee on what is returned. Thus you should always call ephemeron-broken? after calling these procedure to ensure the values are meaningful. See the scheme.ephemeron entry for the details.

Function: ephemeron-broken? ephemeron ¶

[R7RS ephemeron] {scheme.ephemeron} Returns #t iff ephemeron has been broken, that is, its key and/or datum may be collected and cannot be reliably retrieved. See the scheme.ephemeron entry for the details.

Function: reference-barrier key ¶

[R7RS ephemeron] {scheme.ephemeron} This procedure does nothing by itself, but guarantees key is strongly reference until returning from this procedure.

10.3.18 scheme.comparator - R7RS comparators ¶

Module: scheme.comparator ¶

This module defines comparators and related procedures. Originally called srfi.128.

Gauche supports comparators fully compatible to scheme.comparator built-in. See Basic comparators, for the following procedures defined in this module.

comparator? comparator-ordered? comparator-hashable?
make-comparator make-pair-comparator
make-list-comparator make-vector-comparator
make-eq-comparator make-eqv-comparator make-equal-comparator

boolean-hash char-hash char-ci-hash string-hash
string-ci-hash symbol-hash number-hash
hash-bound hash-salt

make-default-comparator default-hash
comparator-register-default!

comparator-type-test-predicate comparator-equality-predicate
comparator-ordering-predicate comparator-hash-function
comparator-test-type comparator-check-type comparator-hash

=? <? >? <=? >=? comparator-if<=>

10.3.19 scheme.regex - R7RS regular expressions ¶

Module: scheme.regex ¶

This module provides operations on Scheme Regular Expressions (SRE). Originally defined as srfi.115.

Gauche has built-in support of regular expressions, and this module simply tranlsates SRE to Gauche’s native regular expressions. The regular expression object returned from the regexp procedure in this module is Gauche’s <regexp> object, for example. You can pass Gauche’s regexp object to the procedures that expects compiled SRE in this module as well.

Scheme regular expression syntax ¶

Syntax summary ¶

SRE is just an S-expression with the structure summarized below.

With the exception of or, any syntax that takes multiple <sre> processes them in a sequence. In other words (foo <sre> ...) is equivalent to (foo (seq <sre> ...)).

Note: SRE uses the symbol | for alteration, but the vertical bar character is used for symbol escape in Gauche (and R7RS), so you have to write such symbol as |\||. We recommend to use or instead.

    <sre> ::=
     | <string>                    ; A literal string match.
     | <cset-sre>                  ; A character set match.
     | (* <sre> ...)               ; 0 or more matches.
     | (zero-or-more <sre> ...)
     | (+ <sre> ...)               ; 1 or more matches.
     | (one-or-more <sre> ...)
     | (? <sre> ...)               ; 0 or 1 matches.
     | (optional <sre> ...)
     | (= <n> <sre> ...)           ; <n> matches.
     | (exactly <n> <sre> ...)
     | (>= <n> <sre> ...)          ; <n> or more matches.
     | (at-least <n> <sre> ...)
     | (** <n> <m> <sre> ...)      ; <n> to <m> matches.
     | (repeated <n> <m> <sre> ...)

     | (|\||  <sre> ...)           ; Alternation.
     | (or <sre> ...)

     | (:   <sre> ...)             ; Sequence.
     | (seq <sre> ...)
     | ($ <sre> ...)               ; Numbered submatch.
     | (submatch <sre> ...)
     | (-> <name> <sre> ...)               ;  Named submatch.  <name> is
     | (submatch-named <name> <sre> ...)   ;  a symbol.

     | (w/case   <sre> ...)        ; Introduce a case-sensitive context.
     | (w/nocase <sre> ...)        ; Introduce a case-insensitive context.

     | (w/unicode   <sre> ...)     ; Introduce a unicode context.
     | (w/ascii <sre> ...)         ; Introduce an ascii context.

     | (w/nocapture <sre> ...)     ; Ignore all enclosed submatches.

     | bos                         ; Beginning of string.
     | eos                         ; End of string.

     | bol                         ; Beginning of line.
     | eol                         ; End of line.

     | bow                         ; Beginning of word.
     | eow                         ; End of word.
     | nwb                         ; A non-word boundary.
     | (word <sre> ...)            ; An SRE wrapped in word boundaries.
     | (word+ <cset-sre> ...)      ; A single word restricted to a cset.
     | word                        ; A single word.

     | bog                         ; Beginning of a grapheme cluster.
     | eog                         ; End of a grapheme cluster.
     | grapheme                    ; A single grapheme cluster.

     | (?? <sre> ...)              ; A non-greedy pattern, 0 or 1 match.
     | (non-greedy-optional <sre> ...)
     | (*? <sre> ...)              ; Non-greedy 0 or more matches.
     | (non-greedy-zero-or-more <sre> ...)
     | (**? <m> <n> <sre> ...)     ; Non-greedy <m> to <n> matches.
     | (non-greedy-repeated <sre> ...)
     | (atomic <sre> ...)          ; Atomic clustering.

     | (look-ahead <sre> ...)      ; Zero-width look-ahead assertion.
     | (look-behind <sre> ...)     ; Zero-width look-behind assertion.
     | (neg-look-ahead <sre> ...)  ; Zero-width negative look-ahead assertion.
     | (neg-look-behind <sre> ...) ; Zero-width negative look-behind assertion.

     | (backref <n-or-name>)       ; Match a previous submatch.
                              

The grammar for cset-sre is as follows.

    <cset-sre> ::=
     | <char>                      ; literal char
     | "<char>"                    ; string of one char
     | <char-set>                  ; embedded SRFI 14 char set
     | (<string>)                  ; literal char set
     | (char-set <string>)
     | (/ <range-spec> ...)        ; ranges
     | (char-range <range-spec> ...)
     | (or <cset-sre> ...)         ; union
     | (|\|| <cset-sre> ...)
     | (and <cset-sre> ...)        ; intersection
     | (& <cset-sre> ...)
     | (- <cset-sre> ...)          ; difference
     | (- <difference> ...)
     | (~ <cset-sre> ...)          ; complement of union
     | (complement <cset-sre> ...)
     | (w/case <cset-sre>)         ; case and unicode toggling
     | (w/nocase <cset-sre>)
     | (w/ascii <cset-sre>)
     | (w/unicode <cset-sre>)
     | any | nonl | ascii | lower-case | lower
     | upper-case | upper | title-case | title
     | alphabetic | alpha | alphanumeric | alphanum | alnum
     | numeric | num | punctuation | punct | symbol
     | graphic | graph | whitespace | white | space
     | printing | print | control | cntrl | hex-digit | xdigit

    <range-spec> ::= <string> | <char>

Basic patterns ¶

<string>

A literal string.

(regexp-search "needle" "hayneedlehay")
 ⇒ #<regexp-match>
(regexp-search "needle" "haynEEdlehay")
 ⇒ #f

(seq <sre> ...)

(: <sre> ...)

A sequence of patterns that should be matched in the same order. This is the same as RE syntax (?:re…)

(regexp-search '(: "one" space "two" space "three") "one two three")
 ⇒ #<regexp-match>

(or <sre> ...)

(|\|| <sre> ...)

Matches one of the given patterns. This is the same as RE syntax pattern1|pattern2|…

(regexp-search '(or "eeney" "meeney" "miney") "meeney")
 ⇒ #<regexp-match>
(regexp-search '(or "eeney" "meeney" "miney") "moe")
 ⇒ #f

(w/nocase <sre> ...)

Changes to match the given patterns case-insensitively. Sub-patterns can still be made sensitive with w/case. This is the same as RE syntax (?i:re…)

(regexp-search "needle" "haynEEdlehay") ⇒ #f
(regexp-search '(w/nocase "needle") "haynEEdlehay")
  ⇒  #<regexp-match>

(regexp-search '(~ ("Aab")) "B") ⇒ #<regexp-match>
(regexp-search '(~ ("Aab")) "b") ⇒ #f
(regexp-search '(w/nocase (~ ("Aab"))) "B") ⇒ #f
(regexp-search '(w/nocase (~ ("Aab"))) "b") ⇒ #f
(regexp-search '(~ (w/nocase ("Aab"))) "B") ⇒ #f
(regexp-search '(~ (w/nocase ("Aab"))) "b") ⇒ #f

(w/case <sre> ...)

Changes to match the given patterns case-sensitively. Sub-patterns can still be made case-insensitive. This is the same as RE syntax (?-i:re…). This is the default.

(regexp-search '(w/nocase "SMALL" (w/case "BIG")) "smallBIGsmall")
 ⇒ #<regexp-match>
(regexp-search '(w/nocase (~ (w/case ("Aab")))) "b") ⇒ #f

(w/ascii <sre> ...)

Limits the character sets and other predefined patterns to ASCII. This affects patterns or character sets like any, alpha, (word)…

(regexp-search '(w/ascii bos (* alpha) eos) "English")
 ⇒ #<regexp-match>
(regexp-search '(w/ascii bos (* alpha) eos) "Ελληνική") ⇒ #f

(w/unicode <sre> ...)

Changes the character sets and other predefined patterns back to Unicode if w/ascii has been used in the outer scope. This is the default.

(regexp-search '(w/unicode bos (* alpha) eos) "English")
 ⇒ #<regexp-match>
(regexp-search '(w/unicode bos (* alpha) eos) "Ελληνική")
 ⇒ #<regexp-match>

(w/nocapture <sre> ...)

Disables capturing for all submatch and submatch-named inside.

(let ((number '($ (+ digit))))
  (cdr
   (regexp-match->list
    (regexp-search `(: ,number "-" ,number "-" ,number)
                   "555-867-5309")))  ; ⇒ '("555" "867" "5309")
  (cdr
   (regexp-match->list
    (regexp-search `(: ,number "-" (w/nocapture ,number) "-" ,number)
                   "555-867-5309"))))   ⇒ '("555" "5309")

Repeating patterns ¶

(optional <sre> ...)

(? <sre> ...)

Matches the pattern(s) one or zero times.

(regexp-search '(: "match" (? "es") "!") "matches!")
 ⇒ #<regexp-match>
(regexp-search '(: "match" (? "es") "!") "match!")
 ⇒ #<regexp-match>
(regexp-search '(: "match" (? "es") "!") "matche!")
 ⇒ #f

(zero-or-more <sre> ...)

(* <sre> ...)

Matches the pattern(s) zero or more times.

(regexp-search '(: "<" (* (~ #\>)) ">") "<html>")
 ⇒ #<regexp-match>
(regexp-search '(: "<" (* (~ #\>)) ">") "<>")
 ⇒ #<regexp-match>
(regexp-search '(: "<" (* (~ #\>)) ">") "<html")
 ⇒ #f

(one-or-more <sre> ...)

(+ <sre> ...)

Matches the pattern(s) at least once.

(regexp-search '(: "<" (+ (~ #\>)) ">") "<html>")
 ⇒ #<regexp-match>
(regexp-search '(: "<" (+ (~ #\>)) ">") "<a>")
 ⇒ #<regexp-match>
(regexp-search '(: "<" (+ (~ #\>)) ">") "<>")
 ⇒ #f

(at-least n <sre> ...)

(>= n <sre> ...)

Matches the pattern(s) at least n times.

(regexp-search '(: "<" (>= 3 (~ #\>)) ">") "<table>")
 ⇒ #<regexp-match>
(regexp-search '(: "<" (>= 3 (~ #\>)) ">") "<pre>")
 ⇒ #<regexp-match>
(regexp-search '(: "<" (>= 3 (~ #\>)) ">") "<tr>")
 ⇒ #f

(exactly n <sre> ...)

(= n <sre> ...)

Matches the pattern(s) exactly n times.

(regexp-search '(: "<" (= 4 (~ #\>)) ">") "<html>")
 ⇒ #<regexp-match>
(regexp-search '(: "<" (= 4 (~ #\>)) ">") "<table>")
 ⇒ #f

(repeated from to <sre> ...)

(** from to <sre> ...)

Matches the pattern(s) at least from times and up to to times.

(regexp-search '(: (= 3 (** 1 3 numeric) ".") (** 1 3 numeric))
               "192.168.1.10")
 ⇒ #<regexp-match>
(regexp-search '(: (= 3 (** 1 3 numeric) ".") (** 1 3 numeric))
               "192.0168.1.10")
 ⇒ #f

Submatch Patterns ¶

(submatch <sre> ...)

($ <sre> ...)

Captures the matched string. Each capture is numbered increasing from one (capture zero is the entire matched string). For nested captures, the numbering scheme is depth-first walk.

(submatch-named <name> <sre> ...)

(-> <name> <sre> ...)

Captures the matched string and assigns a name to it in addition to a number. This is the equivalent of (?<name>re…)

(backref <n-or-name>)

Matches a previously matched submatch. This is the same as RE syntax \n or \k<name>.

Character Sets ¶

<char>

A character set contains a single character.

(regexp-matches '(* #\-) "---") ⇒ #<regexp-match>
(regexp-matches '(* #\-) "-_-") ⇒ #f

"<char>"

A character set contains a single character. This is technically ambiguous with SRE matching a literal string. However the end result of both syntaxes is the same.

<char-set>

A SRFI-14 character set.

Note that while currently there is no portable written representation of SRFI 14 character sets, you can use Gauche reader syntax #[char-set-spec], see Character Sets.

(regexp-partition `(+ ,char-set:vowels) "vowels")
 ⇒ ("v" "o" "w" "e" "ls")

(char-set <string>)

(<string>)

A character set contains the characters in the given string. This is the same as `(char-set ,(string->char-set <string>)).

(regexp-matches '(* ("aeiou")) "oui") ⇒ #<regexp-match>
(regexp-matches '(* ("aeiou")) "ouais") ⇒ #f
(regexp-matches '(* ("e\x0301")) "e\x0301") ⇒ #<regexp-match>
(regexp-matches '("e\x0301") "e\x0301") ⇒ #f
(regexp-matches '("e\x0301") "e") ⇒ #<regexp-match>
(regexp-matches '("e\x0301") "\x0301") ⇒ #<regexp-match>
(regexp-matches '("e\x0301") "\x00E9") ⇒ #f

(char-range <range-spec> ...)

(/ <range-spec> ...)

A character set contains the characters within <range-set>. This is the same as RE syntax [].

(regexp-matches '(* (/ "AZ09")) "R2D2") ⇒ #<regexp-match>
(regexp-matches '(* (/ "AZ09")) "C-3PO") ⇒ #f

(or <cset-sre> ...)

(|\|| <cset-sre> ...)

A shorthand for `(char-set ,(char-set-union <cset-sre>...)).

(complement <cset-sre> ...)

(~ <cset-sre> ...)

A shorthand for `(char-set ,(char-set-complement <cset-sre>...)).

(difference <cset-sre> ...)

(- <cset-sre> ...)

A shorthand for `(char-set ,(char-set-difference <cset-sre>...)).

(regexp-matches '(* (- (/ "az") ("aeiou"))) "xyzzy")
 ⇒ #<regexp-match>
(regexp-matches '(* (- (/ "az") ("aeiou"))) "vowels")
 ⇒ #f

(and <cset-sre> ...)

(& <cset-sre> ...)

A shorthand for `(char-set ,(char-set-intersection <cset-sre>...)).

(regexp-matches '(* (& (/ "az") (~ ("aeiou")))) "xyzzy")
 ⇒ #<regexp-match>
(regexp-matches '(* (& (/ "az") (~ ("aeiou")))) "vowels")
 ⇒ #f

(w/case <cset-sre>)

(w/nocase <cset-sre>)

(w/ascii <cset-sre>)

(w/unicode <cset-sre>)

This is similar to the SRE equivalent, listed to indicate that they can also be applied on character sets.

Named Character Sets ¶

Note that if w/ascii is in effect, these character sets will return the ASCII subset. Otherwise they return full Unicode ones.

any

Matches any character. This is the . in regular expression.

nonl

Matches any character other than #\return or #\newline.

ascii

A shorthand for `(char-set ,char-set:ascii).

lower-case

lower

A shorthand for `(char-set ,char-set:lower-case).

upper-case

upper

A shorthand for `(char-set ,char-set:upper-case).

title-case

title

A shorthand for `(char-set ,char-set:title-case).

alphabetic

alpha

A shorthand for `(char-set ,char-set:letter).

numeric

num

A shorthand for `(char-set ,char-set:digit).

alphanumeric

alphanum

alnum

A shorthand for `(char-set ,char-set:letter+digit).

punctuation

punct

A shorthand for `(char-set ,char-set:punctuation).

symbol

A shorthand for `(char-set ,char-set:symbol).

graphic

graph

A shorthand for `(char-set ,char-set:graphic).

(or alphanumeric punctuation symbol)

whitespace

white

space

A shorthand for `(char-set ,char-set:whitespace).

printing

print

A shorthand for `(char-set ,char-set:printing).

control

cntrl

A character set contains ASCII characters with from 0 to 31.

hex-digit

xdigit

A shorthand for `(char-set ,char-set:hex-digit).

Boundary Assertions ¶

bos

eos

Matches the beginning of the string. If start/end parameters are specified, matches the start or end of the substring as specified.

bol

eol

Matches the beginning or end of a line (or the string). For single line matching, this is the same as bos and eos. A line is interpreted the same way with read-line.

bow

eow

Matches the beginning or the end of a word.

  (regexp-search '(: bow "foo") "foo") ⇒ #<regexp-match>
  (regexp-search '(: bow "foo") "<foo>>") ⇒ #<regexp-match>
  (regexp-search '(: bow "foo") "snafoo") ⇒ #f
  (regexp-search '(: "foo" eow) "foo") ⇒ #<regexp-match>
  (regexp-search '(: "foo" eow) "foo!") ⇒ #<regexp-match>
  (regexp-search '(: "foo" eow) "foobar") ⇒ #f

nwb

A shorthand for (neg-look-ahead (or bow eow)).

(word <sre> ...)

Matches the word boundary around the given SRE:

(: bow <sre> ... eow)

(word+ <cset-sre> ...)

Matches a single word composed of characters of the given characters sets:

(word (+ (and (or alphanumeric "_") (or cset-sre ...))))

word

A shorthand for (word+ any).

bog

eog

Matches the beginning or end of a graphame cluster. See Unicode text segmentation, for the low-level grapheme cluster segmentation.

grapheme

Matches a single grapheme cluster. See Unicode text segmentation, for the low-level grapheme cluster segmentation.

Non-Greedy Patterns ¶

(non-greedy-optional <sre> ...)

(?? <sre> ...)

The non-greedy equivalent of (optional <sre>...). This is the same as RE syntax re??

(non-greedy-zero-or-more< <sre> ...)

(*? <sre> ...)

The non-greedy equivalent of (zero-or-more <sre>...). This is the same as RE syntax re*?

(non-greedy-repeated <m> <n> <sre> ...)

(**? <m> <n> <sre> ...)

The non-greedy equivalent of (repeated <sre>...). This is the same as RE syntax re{n,m}?

(atomic <sre> ...)

Atomic clustering. Once <sre> ... matches, the match is fixed; even if the following pattern fails, the engine won’t backtrack to try the alternative match in <sre> .... This is Gauche extension and is the same as RE syntax (?>pattern)

Look Around Patterns ¶

(look-ahead <sre> ...)

Zero-width look-ahead assertion. Asserts the sequence matches from the current position, without advancing the position. This is the same as RE syntax (?=pattern)

(regexp-matches '(: "regular" (look-ahead " expression") " expression")
                "regular expression")
 ⇒ #<regexp-match>
(regexp-matches '(: "regular" (look-ahead " ") "expression")
                "regular expression")
 ⇒ #f

(look-behind <sre> ...)

Zero-width look-behind assertion. Asserts the sequence matches behind the current position, without advancing the position. It is an error if the sequence does not have a fixed length. This is the same as RE syntax (?<=pattern)

(neg-look-ahead <sre> ...)

Zero-width negative look-ahead assertion. This is the same as RE syntax (?!pattern)

(neg-look-behind <sre> ...)

Zero-width negative look-behind assertion. This is the same as RE syntax (?<!pattern)

Using regular expressions ¶

Function: regexp re ¶

[R7RS regex] {scheme.regex} Compiles the given Scheme Regular Expression into a <regexp> object. If re is already a regexp object, the object is returned as-is.

Macro: rx sre … ¶

[R7RS regex] {scheme.regex} A macro shorthand for (regexp `(: sre ...)).

Function: regexp->sre re ¶

[R7RS regex] {scheme.regex} Returns the SRE corresponding to the given given regexp object. Note that if the regexp object is not created from an SRE, it may contain features that cannot be expressed in SRE and cause an error.

Function: char-set->sre char-set ¶

[R7RS regex] {scheme.regex} Returns the SRE of the given character set. Currently this is not optimized. If you convert any to SRE for example, you may get an SRE listing every single character.

Function: valid-sre? obj ¶

[R7RS regex] {scheme.regex} Returns true iff obj can be safely passed to regexp.

Function: regexp? obj ¶

[R7RS regex] {scheme.regex} Returns true iff obj is a regexp.

Function: regexp-matches re str [start [end]] ¶

[R7RS regex] {scheme.regex} Returns an <regexp-match> object if re successfully matches the entire string str or optionally from start (inclusive) to end (exclusive), or #f is the match fails.

For convenience, end accepts #f and interprets it as the end of the string.

The regexp-match object will contain information needed to extract any submatches.

Function: regexp-matches? re str [start [end]] ¶

[R7RS regex] {scheme.regex} Similar to regexp-matches but returns #t instead of a <regexp-match> object.

Function: regexp-search re str [start [end]] ¶

[R7RS regex] {scheme.regex} Similar to regexp-matches except that re only has to match a substring in str instead.

Function: regexp-fold re kons knil str [finish [start [end]]] ¶

[R7RS regex] {scheme.regex} Calls the procedure kons for every match found in str with following four arguments:

• The position of the end of the last matched string.
• The <regexp-match> object.
• The argument str.
• The result of the last kons call or knil if this is the first call.

If finish is given, it is called after all matches with the same parameters as calling kons except that #f is passed instead of <regexp-match> and the result is returned. Otherwise the result of the last kons call is returned.

   (regexp-fold 'word
                (lambda (i m str acc)
                  (let ((s (regexp-match-submatch m 0)))
                   (cond ((assoc s acc)
                          => (lambda (x) (set-cdr! x (+ 1 (cdr x))) acc))
                         (else `((,s . 1) ,@acc)))))
                '()
                "to be or not to be")
   ⇒ '(("not" . 1) ("or" . 1) ("be" . 2) ("to" . 2))

Function: regexp-extract re str [start [end]] ¶

[R7RS regex] {scheme.regex} Returns a list of matched string or an empty list if no matches.

   (regexp-extract '(+ numeric) "192.168.0.1")
   ⇒ ("192" "168" "0" "1")

Function: regexp-split re str [start [end]] ¶

[R7RS regex] {scheme.regex} Returns a list of not matched substrings. This can be seen as the opposite of regexp-extract where the matched strings are removed instead of returned.

   (regexp-split '(+ space) " fee fi  fo\tfum\n")
   ⇒ ("fee" "fi" "fo" "fum")
   (regexp-split '(",;") "a,,b,")
   ⇒ ("a" "" "b" "")
   (regexp-split '(* numeric) "abc123def456ghi789")
   ⇒ ("abc" "def" "ghi" "")

Function: regexp-partition re str [start [end]] ¶

[R7RS regex] {scheme.regex} Returns a list of all matched and not matched substrings. In other words it’s the combination of regexp-extract and regexp-split where the boundary of matched strings are used to split the original string.

   (regexp-partition '(+ (or space punct)) "")
   ⇒ ("")
   (regexp-partition '(+ (or space punct)) "Hello, world!\n")
   ⇒ ("Hello" ", " "world" "!\n")
   (regexp-partition '(+ (or space punct)) "¿Dónde Estás?")
   ⇒ ("" "¿" "Dónde" " " "Estás" "?")
   (regexp-partition '(* numeric) "abc123def456ghi789")
   ⇒ ("abc" "123" "def" "456" "ghi" "789")

Function: regexp-replace re str subst [start [end [count]]] ¶

[R7RS regex] {scheme.regex} Returns a new string where the first matched substring is replaced with subst. If count is specified, the count-th match will be replaced instead of the first one.

subst can be either a string (the replacement), an integer or a symbol to refer to the capture group that will be used as the replacement, or a list of those.

The special symbols pre and post use the substring to the left or right of the match as replacement, respectively.

subst could also be a procedure, which is called with the given match object and the result will be used as the replacement.

The optional parameters start and end essentially transform the substitution into this

   (regexp-replace re (substring str start end) subst)

except that end can take #f which is the same as (string-length str).

   (regexp-replace '(+ space) "one two three" "_")
   ⇒ "one_two three"
   (regexp-replace '(+ space) "one two three" "_" 1 10)
   ⇒ "ne_two th"
   (regexp-replace '(+ space) "one two three" "_" 0 #f 0)
   ⇒ "one_two three"
   (regexp-replace '(+ space) "one two three" "_" 0 #f 1)
   ⇒ "one two_three"
   (regexp-replace '(+ space) "one two three" "_" 0 #f 2)
   ⇒ "one two three"

Note that Gauche also has a builtin procedure of the same name, but works slightly differently, see Using regular expressions.

Function: regexp-replace-all re str subst [start [end]] ¶

[R7RS regex] {scheme.regex} Returns a new string where all matches in str are replaced with subst. subst can also take a string, a number, a symbol or a procedure similar to regexp-replace.

(regexp-replace-all '(+ space) "one two three" "_")
   ⇒ "one_two_three"

Note that Gauche also has a builtin procedure of the same name, but works slightly differently, see Using regular expressions.

Function: regexp-match? obj ¶

[R7RS regex] {scheme.regex} Returns true iff obj is a <regexp-match> object.

(regexp-match? (regexp-matches "x" "x"))  ⇒ #t
(regexp-match? (regexp-matches "x" "y"))  ⇒ #f

Function: regexp-match-count regexp-match ¶

[R7RS regex] {scheme.regex} Returns the number of matches in match except the implicit zero full match. This is just an alias of rxmatch-num-matches minus one.

(regexp-match-count (regexp-matches "x" "x"))  ⇒ 0
(regexp-match-count (regexp-matches '($ "x") "x"))  ⇒ 1

Function: regexp-match-submatch regexp-match field ¶

[R7RS regex] {scheme.regex} This is an alias of rxmatch-substring

   (regexp-match-submatch (regexp-search 'word "**foo**") 0)  ⇒ "foo"
   (regexp-match-submatch
    (regexp-search '(: "*" ($ word) "*") "**foo**") 0)  ⇒ "*foo*"
   (regexp-match-submatch
    (regexp-search '(: "*" ($ word) "*") "**foo**") 1)  ⇒ "foo"

Function: regexp-match-submatch-start regexp-match field ¶

[R7RS regex] {scheme.regex} This is an alias of regexp-match-submatch-start.

   (regexp-match-submatch-start
    (regexp-search 'word "**foo**") 0)  ⇒ 2
   (regexp-match-submatch-start
    (regexp-search '(: "*" ($ word) "*") "**foo**") 0)  ⇒ 1
   (regexp-match-submatch-start
    (regexp-search '(: "*" ($ word) "*") "**foo**") 1)  ⇒ 2

Function: regexp-match-submatch-end regexp-match field ¶

[R7RS regex] {scheme.regex} This is an alias of regexp-match-submatch-end.

   (regexp-match-submatch-end
    (regexp-search 'word "**foo**") 0)  ⇒ 5
   (regexp-match-submatch-end
    (regexp-search '(: "*" ($ word) "*") "**foo**") 0)  ⇒ 6
   (regexp-match-submatch-end
    (regexp-search '(: "*" ($ word) "*") "**foo**") 1)  ⇒ 5

Function: regexp-match->list regexp-match ¶

[R7RS regex] {scheme.regex} This is an alias of rxmatch-substrings

   (regexp-match->list
    (regexp-search '(: ($ word) (+ (or space punct)) ($ word)) "cats & dogs"))
    ⇒ '("cats & dogs" "cats" "dogs")

10.3.20 scheme.mapping - R7RS mappings ¶

Module: scheme.mapping ¶

Module: scheme.mapping.hash ¶

This module defines immutable mappings from keys to values. Originally called srfi.146 and srfi.146.hash.

The scheme.mapping module provides mapping objects, where keys have total order. The scheme.mapping.hash module provides hashmap objects, where keys can be hashed.

Currently, Gauche uses built-in <tree-map> for the mapping object (see Treemaps), and built-in <hash-table> for the hashmap object (see Hashtables). The actual implementation may be changed in future versions, so the user must not rely on the underlying implementations.

The caller must treat mappings and hashmaps as immutable object. The modules also provide “linear update” APIs, which is allowed to mutate the mappings passed to the arguments, under assumption that the argument won’t be used afterwards. The linear update APIs are marked with ! at the end of the name. You should always use the returned value of the linear update APIs, for the side effect isn’t guaranteed.