| (require mzlib/list) | package: compatibility-lib |
NOTE: This library is deprecated; use racket/list, instead.
The mzlib/list library re-exports several functions from scheme/base and scheme/list:
cons? empty? empty foldl foldr remv remq remove remv* remq* remove* findf memf assf filter sort
procedure
(first v) → any/c
v : pair?
procedure
(second v) → any/c
v : (and/c pair? ....)
procedure
(third v) → any/c
v : (and/c pair? ....)
procedure
(fourth v) → any/c
v : (and/c pair? ....)
procedure
(fifth v) → any/c
v : (and/c pair? ....)
procedure
(sixth v) → any/c
v : (and/c pair? ....)
procedure
(seventh v) → any/c
v : (and/c pair? ....)
procedure
(eighth v) → any/c
v : (and/c pair? ....)
Accesses the first, second, etc. elment of “list” v. The
argument need not actually be a list; it is inspected only as far as
necessary to obtain an element (unlike the same-named functions from
scheme/list, which do require the argument to be a
list).
The same as cdr.
Returns the last pair in v, raising an error if v is
not a pair (but v does not have to be a proper list).
procedure
(merge-sorted-lists lst1 lst2 less-than?) → list?
lst1 : list? lst2 : lst? less-than? : (any/c any/c . -> . any/c)
Merges the two sorted input lists, creating a new sorted list. The
merged result is stable: equal items in both lists stay in the same
order, and these in lst1 precede lst2.
The same as sort.
The same as sort.