[ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |

__Function:__**length+***x*- [SRFI-1] If
`x`is a proper list, returns its length. Otherwise, returns`#f`

.

__Function:__**concatenate***list-of-lists*__Function:__**concatenate!***list-of-lists!*- [SRFI-1] Equivalent to
`(apply append`

and`list-of-lists`)`(apply append!`

, respectively.`list-of-lists`)

__Function:__**append-reverse***rev-head tail*__Function:__**append-reverse!***rev-head tail*- [SRFI-1]
`append-reverse`

returns`(append (reverse rev-head) tail)`

.`append-reverse!`

is the linear-update variant.

__Function:__**zip***clist1 clist2 ...*- [SRFI-1] 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.

At least one of the argument lists must be finite:(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))

(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*- [SRFI-1]
`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)

__Function:__**count***pred clist1 clist2 ...*- [SRFI-1] A procedure
`pred`is applied to the`n`-th element of given lists, from`n`is zero to the length of the the shortest finite list in the given lists, and the count of times`pred`returned true is returned.

At least one of the argument lists must be finite:(count even? '(3 1 4 1 5 9 2 5 6)) => 3 (count < '(1 2 4 8) '(2 4 6 8 10 12 14 16)) => 3

(count < '(3 1 4 1) (circular-list 1 10)) => 2

__Function:__**count$***pred*- Partial application version of
`count`

((count$ pred) arg ...) === (count pred arg ...)

[ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |

This document was generated by