wraps a non-list argument in a list

keep only true elements in list. removes all boolean false values

delete elements from the first list that are included in the other lists

delete elements in both lists that are included in both lists

splits the list into two lists, the first being a list of all beginning elements of \"a\" that consecutively matched
\"f\", the second being the rest.
like srfi-1 span but the result is a list and not multiple return values

test if argument \"a\" contains all of the given values

test if argument \"a\" contains any of the given values

return a boolean indicating if list \"a\" contains \"value\"

true if list contains value.
comparison with eq?

test if argument \"a\" contains any of the given values

true if list contains value.
comparison with eqv?

count occurences of \"value\" in list

like count-value but with an optional parameter for a count at which to stop counting

like \"count\" but with an optional parameter for a count at which to stop counting

delete duplicates from a sorted list using a more efficient algorithm than for unsorted lists

result in a list of elements not included in all given lists

results in a list with two elements, one being the symmetric-difference between the given lists and one being the intersection.
that means one list of all elements that are included in all lists, and one list of elements that are not included in all lists.
it does both calculations in one step saving resources compared to making them in separate steps.

like difference+intersection but the predicate for comparing list elements can be specified

like

like srfi-1 drop but with reversed argument order (like stream-drop from srfi-41) and
returns null if list contains less elements than count instead of raising an exception

get a list of distinct values that occur more than once in the same list

untested.
call \"first-f\" for the first element,
call \"last-f\" for the last element,
call \"middle-f\" for a list of all elements inbetween

untested.
call f only for elements in index range between \"start\" and \"end\" inclusively

apply f to each slice of slice-length elements from list.

apply f to each element and its index in list a

like fold but results in false if any result of f is not a true value

like map but results in false if any result of f is not a true value

true if \"f\" is true for all elements, otherwise the index of the element for which \"f\" was false

apply filter-map and then apply append on the result

procedure list ...
apply \"f\" to each ordered combination of elements from lists, cartesian product, and return true results in a list.
supports multiple lists and treats non-list arguments as the single element of a list.
example:
(produce f (1 2) (4 5) 6)
is equivalent to
(list (f 1 4 6) (f 1 5 6) (f 2 4 6) (f 2 5 6))

give the first found element that is included in both lists

like first-intersection but the procedure for comparing elements can be specified

give the first element of a list if it is not null, otherwise false

results in the first element of a list if it is not null, otherwise null

true if the list does not contain a list

replace sublists with their content, resulting in a list that does not contain lists

like fold but with multiple state values. the state values are updated by returning a list from a call to \"f\".
apply \"f\" to each element of \"a\" and the state-value elements that were given to
fold-multiple or subsequently the updated state-values from the previous call to \"f\"

like fold but with multiple state values. the state values are updated by returning a list from a call to \"f\".
apply \"f\" to each element of \"a\" and the state-value elements that were given to
fold-multiple or subsequently the updated state-values from the previous call to \"f\"

fold over integers from 0 to count - 1

like fold but with multiple state values. the state values are updated by returning a list from a call to \"f\".
apply \"f\" to each element of \"a\" and the state-value elements that were given to
fold-multiple or subsequently the updated state-values from the previous call to \"f\"

procedure:{any:element procedure:continue:{list:next-pair any:state-value ...} any:state-value ... -> any} list any:state-value ... -> list

like fold-multiple but works through the list elements from last to first

like fold-multiple but works through the list elements from last to first

integer {any:state element ... -> any:state} any:state list -> any
fold over each overlapping segment with length \"size\".
example:
(fold-segments f 2 #t (list 4 5 6 7))

call f with each slice-length number of consecutive elements of a

fold over each list of elements that consecutively matched filter-f (utilising the \"span\" procedure)

like fold, but returns \"default\" if \"stop?\" is true

end folding if \"stop?\" is true for a result and return the result

wrap multiple elements that consecutively match \"filter-f\" in a list

wrap consecutive elements in lists. elements for which \"start-group?\" is true become the first element of a new list.
example
(group-split-at-matches integer? (list \"a\" \"b\" 1 \"c\" \"d\" 2 \"e\"))
->
((\"a\" \"b\") (1 \"c\" \"d\") (2 \"e\"))

insert \"a\" as the second element into list \"b\"

inserts value in front of each element in \"a\" except the first element.
example: (interleave (list 1 2 3) 4) -> (1 4 2 4 3)

result in a list of all elements which are contained in all given lists

like \"intersection\" but the predicate for comparing the list elements can be specified

calls \"f\" for each list element, previous list elements and following list elements.
multiple custom values can be updated each call with the result of \"f\" which must be a list

like \"iterate-three\" but takes two additional procedures - one for stopping the iteration
after a \"map-f\" result, and one that is called for the last element or when \"stop?\" is true

bind elements of list \"a\" to \"lambda-formals\"

return a new, eventually smaller, list consisting of values not at specified indices

creates a new list with values from list a at positions indices. the value for \"no-element\" is set at indices
not included in the list indices. the length of indices must equal the length of a, and indices should not have duplicates.

like list-distribute but faster. works only correctly for indices lists that are sorted ascending

get the index of value in list

create a list of all indices for which f results in true

true if \"a\" is a list-logical condition

test for value inclusion with a condition list like ([or/and/not] value/condition ...).
example:
(list-logical-contains? (list 1 2 3) (quote (and 2 3 (or 4 1 5) (not 8)))) -> #t

match a logical condition that is a possibly nested list with and/or/not symbol prefixes.
match-one? is called for each element in condition that is not a condition prefix.
returns false early if a required part of the condition does not match.
condition: ([symbol:and/or/not] any/condition ...)
example
(list-logical-match (l (b) (contains? somelist b)) (q (and 1 2 (or (and 3 4) (and 5 6)))))

pass a list of \"entry-count\" elements at an offset of (* number entry-count),
eventually including \"lookahead\" number of elements if they are the last elements
and a boolean indicating if it is the last page to continuation procedure \"c\"

true if the given \"prefix\" elements exist in order at the beginning of list.
examples:
(list-prefix? (list 3 2 4) (list 3 1)) -> #f
(list-prefix? (list 3 2 4) (list 3 2)) -> #t

replace the last element in a list

return a new list consisting of values at indices

Add to LIST any of the elements of REST not already in the list.
These elements are `cons'ed onto the start of LIST (so the return shares
a common tail with LIST), but the order they're added is unspecified.

The given `=' procedure is used for comparing elements, called
as `(@var{=} listelem elem)', i.e., the second argument is one of the
given REST parameters.

true if all elements of the given lists appear in all others.
uses \"equal?\" for element equality comparison

like \"list-set-equal?\" but uses \"eqv?\" for element equality comparison

sort a list so the elements correspond to the order of elements in list \"order\".
elements not contained in \"order\" are moved to the end of the result list.
examples:
(list-sort-by-list (list 3 2 4) (list 4 2 3)) -> (3 2 4)
(list-sort-by-list (list 3 2 4) (list 4 5 2 3)) -> (3 2 4 5)

sort list by calling accessor for each argument before comparison. only the order of elements changes, the individual elements are not changed

true if the given \"suffix\" elements exist in order at the end of list.
see also \"list-prefix?\"

like map but the procedure is applied with elements of \"a\" as arguments.
instead of calling f like (f (list 1 2)) like \"map\" would do, f is called like (f 1 2)
example
(map-apply f (list (list 1 2) (list 3 4)))

map over list with a procedure that when called with the current map result continues the mapping.
if the procedure is not called, the result of the current call will become the tail of the result list.
maps only the length of the shortest list if multiple lists are given
example
(map-c (l (c a) (if (> 3 a) (c (+ 1 a)) (list))) (list 1 2 3 4 5))
->
(2 3 4)

\"f\" is called for and with every list of elements that consecutively matched \"filter-f\". at least two elements at a time

call \"f\" for the first element of list and replace the first element in the list with the result of \"f\".
replace-first

procedure:{(list-element state ...) -> (list-element state ...)}
combination of map and fold.
call f with each list element and state values, which are set to init for the first call.
each call to f must return a list of: the mapped result element and one
element for each updated value of state.
example: (map-fold (l (a index) (list (+ a index) (+ 1 index))) (list 1 2 3) 0)

map over integers from 0 to count - 1

call f to replace the last n elements in list b.
if the result of f is a list it is spliced so that the
elements can be replaced with multiple elements

given a list of lists, maps over the elements of lists.
like (map (l (a) (map f a) a))

apply f only to the first element that matches predicate.
all elements that do not match are mapped with the \"identity\" function

map over each overlapping segment of length len.
each segment is one step apart.
example: for (1 2 3 4) size 2 maps (1 2) (2 3) (3 4)

apply f only to elements for which \"select?\" is true. unmatched items are included in the result list.
if multiple lists are given, it works like \"map\" except that the elements from the multiple lists for one call that are not selected are saved as a list.
map-some/map-only

call \"f\" with each \"slice-length\" number of consecutive elements of \"a\"

apply \"f\" to each list of elements that consecutively matched \"filter-f\".
an unpredictable number of arguments might be passed to f. with (lambda a body ...) a single list can still be accessed.
this allows for things like (map-span string? string-append a)

map unless \"stop?\" is true for a mapping-result. return an empty list or \"default\" if \"stop?\" was true

bind the first and second value of \"a\" to \"b\" and \"c\" respectively.
ideally, maybe, lambda/apply should support (apply (lambda (a . b)) (pair 1 2))

like fold-multiple but calling f with the pairs of list

like map but not the list elements are passed to \"f\" but the pairs of the list.
for example (1 2 3) is just another notation for the pair notation (1 . (2 . (3 . ())))
instead of mapping (1 2 3) pair-map maps ((1 2 3) (2 3) (3))

reverse the order of values in a pair.
example: (pair-reverse (pair 1 2)) -> (2 . 1)

takes a flat list with symbols and ellipses and counts the required parts of a pattern with
symbols interpreted as matching any element and ellipses to match zero or many occurences of the previous element.
# examples
((a ...)) -> 0
((a a ...)) -> 1
((a ... b ...)) -> 0
((a ... b ... c d)) -> 2

produce two lists unless \"stop?\" is true for a production-result. if stop? is true, result in false

all elements matching \"match?\" are collected in a list and passed to \"f\".
the result of \"f\" is then used to replace the matched elements in source in order

examples:
(((1 2))) -> (1 2)
(((1 2) (3))) -> ((1 2) (3))
removes extra nesting

splice elements that are lists and match predicate

if the last element is a list, append it to the previous elements.
example: (splice-last-list (1 2 (3 4))) -> (1 2 3 4)

get a list with the list of the initial elements and a list with the last element

basic matcher that only supports matching single or repeated elements with multiple ellipses.
creates alist elements for variables in pattern that match elements in list \"a\".
the result is a list with two values: one for the match and one for the unmatched rest.
if pattern did not match, then both values are false. if pattern is null, matches is null and rest is the input list.
unlike other pattern matchers, \"pattern\" is a list and not syntax and so can be passed as a variable.
# example
(split-by-pattern (quote (a b ... c)) (list 1 2 3 4)) -> (((a . 1) (b 2 3) (c . 4)) ())

return the tail of list or null if there is no tail which is
the case when list is null

like srfi-1 take but with reversed argument order (like stream-take from srfi-41) and
returns null if list contains less elements than count instead of raising an exception