Next: heaps, Previous: fingertrees, Up: Top [Contents][Index]
Sequences are a general–purpose, variable–length collections, similar to lists, however they support efficient addition and removal from both ends, and random–access. Like other Scheme collections, sequences are zero–indexed.
Return a new empty sequence.
Return a new sequence containing all of the argument items, in the given order.
Return #t if the argument is a sequence, #f otherwise.
Return #t if sequence contains no items, #f otherwise.
Return a non–negative integer representing the number of items in sequence.
Return a new sequence created by adding item to the front of sequence.
Return 2 values: the first item of sequence, and a new sequence containing all but the first
items. If the sequence is empty: raise a condition with kind pfds-sequence-empty-condition.
Return a new sequence created by adding item to the end of sequence.
Return 2 values: a new sequence containing all but the last item of sequence, and the last
item itself. If sequence is empty: raise a condition with kind
pfds-sequence-empty-condition.
Return #t if OBJ is a condition with kind pfds-sequence-empty-condition; otherwise
return #f.
Return a new sequence containing all the items of sequence1, followed by all the items of sequence2.
Return a new sequence containing all the items from the given list, in the same order.
Return a new list containing all the items of sequence, in the same order.
Return 2 new sequences: the first containing the first N items of sequence, the second containing the remaining items. If N is negative: return the empty sequence as the first value, and the original sequence as the second value. Similarly, if N is greater than the size of sequence: return the original sequence as the first value, and the empty sequence as the second value.
Consequently:
(let-values (((a b) (sequence-split-at SEQ N))) (sequence-append a b))
is equivalent to SEQ for all sequences SEQ, and integers N.
Return a new sequence containing the first N items of sequence. If N is negative: the empty sequence is returned. If N is larger than the size of sequence: the whole sequence is returned.
Return a new sequence containing all but the first N items of sequence. If N is negative: the whole sequence is returned. If N is larger than the size of sequence: the empty sequence is returned.
Return the item at the specified INDEX in the sequence; INDEX must be a non–negative exact integer. If INDEX is outside the range:
0 <= INDEX < (sequence-size sequence)
an assertion violation is raised.
Return the new sequence obtained by replacing the item at the specified INDEX in sequence with the given item. If INDEX is outside the range:
0 <= INDEX < (sequence-size sequence)
an assertion violation is raised.
Return the value obtained by iterating the COMBINER procedure over sequence in left–to–right order. The COMBINER procedure takes two arguments: the value of the position in the sequence, and an accumulator, and its return value is used as the value of the accumulator for the next call. The initial accumulator value is given by the ACCUM-BASE argument.
Like sequence-fold, but the sequence is traversed in right–to–left order, rather than
left–to–right.
Return a new sequence containing all the item of sequence, in reverse order.
Return a new sequence obtained by applying the procedure mapper to each item of sequence in turn.
Return a new sequence containing all the items of sequence for which the predicate is true.
Next: heaps, Previous: fingertrees, Up: Top [Contents][Index]
This document describes version 0.5.0-devel.1 of MMCK PFDS.