Version: 4.1.5.4
1 Bindings
The main module provides bindings for list operations.
Cons x onto xs.
The empty list.
Returns a list containing the given xs as its elements.
Returns a list containing the give xs as its elements
and xs as its tail.
Is x the empty list?
Is x a cons (a non-empty list)?
Is x a list?
Returns the first element of the list xs.
Returns the rest of the element of the list xs.
Returns the element of xs at position i. This operation
runs in O((min i (log2 (length xs)))).
Returns a list identical to xs, except v is the ith
element. This operation runs in O((min i (log2 (length xs)))).
Returns (list-set xs i (f (list-ref xs i))).
Returns (values (list-ref xs i) (list-set xs i v)), but is more
efficient.
Returns (values (list-ref xs i) (list-set xs i (f (list-ref xs i)))),
but is more efficient.
Returns the second element of the list.
Returns the third element of the list.
Returns the fourth element of the list.
Returns the fifth element of the list.
Returns the sixth element of the list.
Returns the seventh element of the list.
Returns the eighth element of the list.
Returns the ninth element of the list.
Returns the tenth element of the list.
Returns the last element of the list.
Applies f to each element of xss from the first element
to the last. The f argument must accept the same number of arguments
as the number of supplied xss. The result is a list containing each
result of proc in order.
Like foldr but for random-access lists.
Like foldl but for random-access lists.
Like andmap but for random-access lists.
Like ormap but for random-access lists.
Returns a list with n elements, all of which are x.
Equivalent to (build-list n (lambda (i) x)).
Like build-list but produces a random-access list.
Returns the length of the list. This operation runs in
O((log2 (length xs))).
Returns the list after the first i elements of xs.
This operation, like its pair counterpart runs in O(i).
Returns a list with all the elements of the given lists
in order.
Returns a list with all the elements of xs in reverse order.
Returns a sequence equivalent to xs. Since lists are sequences,
this is a list identity function, but an in-list application can
provide better performance when it appears directly in a for clause.