17 Lists
This library is unstable;
compatibility will not be maintained.
See Unstable: May Change Without Warning for more information.
True if l is a prefix of r.
Returns the longest common prefix of l and r.
Returns the tails of l and r with the common
prefix removed.
Returns the longest common prefix together with the tails of
l and r with the common prefix removed.
The subsequent bindings were added by Sam Tobin-Hochstadt.
Extends
l2 to be as long as
l1 by adding
(- (length l1) (length l2)) copies of
v to the end of
l2.
Example: |
| > (extend '(1 2 3) '(a) 'b) | '(a b b) |
|
The subsequent bindings were added by Ryan Culpepper.
Returns the first duplicate item in lst. More precisely, it
returns the first x such that there was a previous
y where (same? (extract-key x) (extract-key y)).
The same? argument can either be an equivalence predicate
such as equal? or eqv? or a dictionary. In the
latter case, the elements of the list are mapped to #t in the
dictionary until an element is discovered that is already mapped to a
true value. The procedures equal?, eqv?, and
eq? automatically use a dictionary for speed.
The subsequent bindings were added by Carl Eastlund.
Produces lists of the respective values of
f applied to the elements in
lst ... sequentially.
Produces a pair of lists of the respective values of
f applied to the
elements in
lst ... sequentially.
The subsequent bindings were added by David Van Horn.
Returns a list that is like lst, omitting the first element of lst
for which pred produces a true value.
The subsequent bindings were added by Vincent St-Amour.
Groups the given list into equivalence classes, with equivalence being
determined by =?.
Example: |
| > (group-by = '(1 2 1 2 54 2 5 43 7 2 643 1 2 0)) | '((0) (2 2 2 2 2) (7) (43) (5) (54) (643) (1 1 1)) |
|