count all distinct sub-vectors in a vector with lengths from min-width to max-width.
distinctness is defined by elements, order and length

calculate the maximum number of possible distinct tuples in a tuple up to width, optionally ignoring widths smaller than min-width

return a stream of all distinct sub-vectors in a vector with lengths from min-width to max-width.
top to bottom.
distinctness is defined as with vector-distinct-count

treat integers in a vector as digits of a number to "base" and increment it.
the least significant digit is the last element of the vector.
returns false if the maximum value has been reached

like "vector-numeric-increment-be" but modifies the input vector

treat integers in a vector as digits of a number to "base" and increment it.
the least significant digit is the first element of the vector.
return false if the maximum value has been reached

like "vector-numeric-increment-le" but modifies the input vector

return a new vector of values at indices in set

calculate the maximum number of possible distinct selections from a set with length "set-length" and
optional "selection-width" which defaults to "set-length"

return a list of all distinct selections of values from "set" with duplicate elements allowed. set can contain any datatype.
the optional parameter "width" specifies the length of selections.
for example, a width of two creates all possible two element selections of set.
the default for "width" is the length of the set

like vector-selections but returns an srfi-41-stream and calculates next results on demand