Warning: This is the manual of the legacy Guile 2.0 series. You may want to read the manual of the current stable series instead.
Next: rnrs sorting, Previous: rnrs bytevectors, Up: R6RS Standard Libraries [Contents][Index]
The (rnrs lists (6))
library provides procedures additional
procedures for working with lists.
This procedure is identical to the one defined in Guile’s SRFI-1 implementation. See SRFI-1 Searching, for documentation.
The for-all
procedure is identical to the every
procedure
defined by SRFI-1; the exists
procedure is identical to SRFI-1’s
any
. See SRFI-1 Searching, for documentation.
These procedures are identical to the ones provided by SRFI-1.
See List Modification, for a description of filter
;
See SRFI-1 Filtering and Partitioning, for partition
.
This procedure is identical the fold-right
procedure provided by
SRFI-1. See SRFI-1 Fold and Map, for documentation.
This procedure is like fold
from SRFI-1, but combine is
called with the seed as the first argument. See SRFI-1 Fold and Map,
for documentation.
remove
, remv
, and remq
are identical to the
delete
, delv
, and delq
procedures provided by
Guile’s core library, (see List Modification). remp
is
identical to the alternate remove
procedure provided by SRFI-1;
See SRFI-1 Deleting.
member
, memv
, and memq
are identical to the
procedures provided by Guile’s core library; See List Searching,
for their documentation. memp
uses the specified predicate
function proc
to test elements of the list list—it
behaves similarly to find
, except that it returns the first
sublist of list whose car
satisfies proc.
assoc
, assv
, and assq
are identical to the
procedures provided by Guile’s core library;
See Alist Key Equality, for their documentation. assp
uses
the specified predicate function proc
to test keys in the
association list alist.
This procedure is identical to the one exported by Guile’s core library. See List Constructors, for documentation.
Next: rnrs sorting, Previous: rnrs bytevectors, Up: R6RS Standard Libraries [Contents][Index]