(guile.info.gz) SRFI-1 Predicates
Info Catalog
(guile.info.gz) SRFI-1 Constructors
(guile.info.gz) SRFI-1
(guile.info.gz) SRFI-1 Selectors
39.3.2 Predicates
-----------------
The procedures in this section test specific properties of lists.
-- Scheme Procedure: proper-list? obj
Return `#t' if OBJ is a proper list, that is a finite list,
terminated with the empty list. Otherwise, return `#f'.
-- Scheme Procedure: circular-list? obj
Return `#t' if OBJ is a circular list, otherwise return `#f'.
-- Scheme Procedure: dotted-list? obj
Return `#t' if OBJ is a dotted list, return `#f' otherwise. A
dotted list is a finite list which is not terminated by the empty
list, but some other value.
-- Scheme Procedure: null-list? lst
Return `#t' if LST is the empty list `()', `#f' otherwise. If
something else than a proper or circular list is passed as LST, an
error is signalled. This procedure is recommended for checking
for the end of a list in contexts where dotted lists are not
allowed.
-- Scheme Procedure: not-pair? obj
Return `#t' is OBJ is not a pair, `#f' otherwise. This is
shorthand notation `(not (pair? OBJ))' and is supposed to be used
for end-of-list checking in contexts where dotted lists are
allowed.
-- Scheme Procedure: list= elt= list1 ...
Return `#t' if all argument lists are equal, `#f' otherwise. List
equality is determined by testing whether all lists have the same
length and the corresponding elements are equal in the sense of the
equality predicate ELT=. If no or only one list is given, `#t' is
returned.
Info Catalog
(guile.info.gz) SRFI-1 Constructors
(guile.info.gz) SRFI-1
(guile.info.gz) SRFI-1 Selectors
automatically generated byinfo2html