This is the generic-sequences Reference Manual, version 0.1.1, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 06:16:49 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
generic-sequences
Generic sequences for Common Lisp.
David Sorokin
MIT
0.1.1
src
(module).
Modules are listed depth-first from the system components tree.
generic-sequences/src
generic-sequences
(system).
generic-seq-pkg.lisp
(file).
generic-seq.lisp
(file).
readme
(file).
license
(file).
Files are sorted by type and then listed depth-first from the systems components trees.
generic-sequences/generic-sequences.asd
generic-sequences/src/generic-seq-pkg.lisp
generic-sequences/src/generic-seq.lisp
generic-sequences/generic-sequences.asd
generic-sequences
(system).
generic-sequences/src/generic-seq.lisp
generic-seq-pkg.lisp
(file).
src
(module).
delay-seq
(macro).
enum-append
(macro).
enum-car
(macro).
enum-cdr
(macro).
enum-cons
(macro).
make-seq
(macro).
seq
(type).
seq->list
(function).
seq->vector
(function).
seq-append
(function).
seq-car
(function).
seq-cdr
(function).
seq-compare
(function).
seq-cons
(function).
seq-count
(function).
seq-count-if
(function).
seq-count-if-not
(function).
seq-cycle
(function).
seq-drop
(function).
seq-drop-while
(function).
seq-drop-while-not
(function).
seq-elt
(function).
seq-enum
(generic function).
seq-equal
(function).
seq-every
(function).
seq-find
(function).
seq-find-if
(function).
seq-find-if-not
(function).
seq-foreach
(function).
seq-interpose
(function).
seq-iterate
(function).
seq-length
(function).
seq-map
(function).
seq-mappend
(function).
seq-member
(function).
seq-member-if
(function).
seq-member-if-not
(function).
seq-notany
(function).
seq-notevery
(function).
seq-null
(function).
seq-position
(function).
seq-position-if
(function).
seq-position-if-not
(function).
seq-range
(function).
seq-reduce
(function).
seq-remove
(function).
seq-remove-if
(function).
seq-remove-if-not
(function).
seq-repeat
(function).
seq-repeatedly
(function).
seq-some
(function).
seq-split
(function).
seq-split-if
(function).
seq-split-if-not
(function).
seq-take
(function).
seq-take-nth
(function).
seq-take-while
(function).
seq-take-while-not
(function).
seq-zip
(function).
seqp
(generic function).
basic-seq
(structure).
basic-seq-delayed-enum
(reader).
(setf basic-seq-delayed-enum)
(writer).
basic-seq-p
(function).
copy-basic-seq
(function).
copy-delayed-seq
(function).
delayed-seq
(structure).
delayed-seq-delayed-seq
(reader).
(setf delayed-seq-delayed-seq)
(writer).
delayed-seq-p
(function).
enum-append-2
(function).
enum-reduce
(function).
make-basic-seq
(function).
make-delayed-seq
(function).
seq-every-1
(function).
seq-foreach-1
(function).
seq-map-1
(function).
seq-mappend-1
(function).
seq-notany-1
(function).
seq-notevery-1
(function).
seq-some-1
(function).
generic-sequences/src/README
generic-seq.lisp
(file).
src
(module).
Packages are listed by definition order.
generic-seq
gen-seq
common-lisp
.
delay-seq
(macro).
enum-append
(macro).
enum-car
(macro).
enum-cdr
(macro).
enum-cons
(macro).
make-seq
(macro).
seq
(type).
seq->list
(function).
seq->vector
(function).
seq-append
(function).
seq-car
(function).
seq-cdr
(function).
seq-compare
(function).
seq-cons
(function).
seq-count
(function).
seq-count-if
(function).
seq-count-if-not
(function).
seq-cycle
(function).
seq-drop
(function).
seq-drop-while
(function).
seq-drop-while-not
(function).
seq-elt
(function).
seq-enum
(generic function).
seq-equal
(function).
seq-every
(function).
seq-find
(function).
seq-find-if
(function).
seq-find-if-not
(function).
seq-foreach
(function).
seq-interpose
(function).
seq-iterate
(function).
seq-length
(function).
seq-map
(function).
seq-mappend
(function).
seq-member
(function).
seq-member-if
(function).
seq-member-if-not
(function).
seq-notany
(function).
seq-notevery
(function).
seq-null
(function).
seq-position
(function).
seq-position-if
(function).
seq-position-if-not
(function).
seq-range
(function).
seq-reduce
(function).
seq-remove
(function).
seq-remove-if
(function).
seq-remove-if-not
(function).
seq-repeat
(function).
seq-repeatedly
(function).
seq-some
(function).
seq-split
(function).
seq-split-if
(function).
seq-split-if-not
(function).
seq-take
(function).
seq-take-nth
(function).
seq-take-while
(function).
seq-take-while-not
(function).
seq-zip
(function).
seqp
(generic function).
basic-seq
(structure).
basic-seq-delayed-enum
(reader).
(setf basic-seq-delayed-enum)
(writer).
basic-seq-p
(function).
copy-basic-seq
(function).
copy-delayed-seq
(function).
delayed-seq
(structure).
delayed-seq-delayed-seq
(reader).
(setf delayed-seq-delayed-seq)
(writer).
delayed-seq-p
(function).
enum-append-2
(function).
enum-reduce
(function).
make-basic-seq
(function).
make-delayed-seq
(function).
seq-every-1
(function).
seq-foreach-1
(function).
seq-map-1
(function).
seq-mappend-1
(function).
seq-notany-1
(function).
seq-notevery-1
(function).
seq-some-1
(function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Delay the sequence.
Append the specified enumerators.
Return the CAR part.
Return the CDR part.
Construct a new enumerator.
Create a sequence by specifying its enumerator.
Convert the sequence to a list.
Convert the sequence to a vector.
Append the specified sequences.
Return the head of sequence.
Return the tail of sequence.
Compare two sequences where the test function for items must return <0, >0 or 0.
Construct a new sequence that begins with the specified item and ends with the sequence.
Count and return the number of elements in the sequence that satisfy the test.
Count and return the number of elements in the sequence that satisfy the test.
Count and return the number of elements in the sequence that satisfy the test.
It returns a lazy infinite sequence obtained by successively repeating the values in the supplied sequence.
Drop the first N elements of the sequence and return the rest.
SEQ-DROP-WHILE takes a predicate function taking a single argument
and a sequence. It returns a sequence of all items in the original sequence, starting
from the first item for which the predicate function returns NIL.
SEQ-DROP-WHILE-NOT takes a predicate function taking a single argument
and a sequence. It returns a sequence of all items in the original sequence, starting
from the first item for which the predicate function returns T.
Access the element of the sequence specified by index.
Test two sequences for equality.
Like the EVERY function but applied to generic sequences.
Search a sequence for an item and return this element; otherwise NIL is returned.
Search a sequence for an item for which the predicate returns T and return this element; otherwise NIL is returned.
Search a sequence for an item for which the predicate returns NIL and return this element; otherwise NIL is returned.
Apply the specified function to the sequences.
SEQ-INTERPOSE takes two arguments, a value and a sequence. It returns
a lazy sequence obtained by inserting the supplied value between the values
in the sequence.
It returns an infinite lazy sequence obtained by starting with the supplied value, and then by calling the supplied function passing the previous item in the sequence as its argument.
Return the length of the specified sequence.
Like the MAPCAR function but applied to generic sequences.
Like SEQ-MAP but the specified function must return a sequence.
Search a sequence for an item and return the tail of the sequence beginning with this element; otherwise NIL is returned.
Search a sequence for a top-level item for which the predicate returns T and
return the tail of the sequence beginning with this element; otherwise NIL is returned.
Search a sequence for a top-level item for which the predicate returns NIL and return the tail of the sequence beginning with this element; otherwise NIL is returned.
Like the NOTANY function but applied to generic sequences.
Like the NOTEVERY function but applied to generic sequences.
Test whether the sequence is empty.
Search a sequence for an element and return the index within the sequence; otherwise, NIL is returned.
Search a sequence for an element for which the predicate returns T and return the index within the sequence; otherwise, NIL is returned.
Search a sequence for an element for which the predicate returns NIL and return the index within the sequence; otherwise, NIL is returned.
SEQ-RANGE returns a lazy sequence of numbers from the start (inclusive, 0 by default) to the end (exclusive, nil by default) incremented by the step (1 by default).
Like REDUCE but applied to the generic sequences.
Like the REMOVE function but applied to the generic sequence.
Like the REMOVE-IF function but applied to the generic sequence.
Like the REMOVE-IF-NOT function but applied to the generic sequence.
It returns an infinite lazy sequence consisting of the argument value repeated endlessly.
Return an infinite lazy sequence obtained by calling the function repeatedly.
Like the SOME function but applied to generic sequences.
Split the sequence at the N-th element and return the both parts as a list.
SEQ-SPLIT-IF takes a predicate function taking a single argument
and a sequence. It splits the sequence at the first item for which the predicate
function returns T and and then SEQ-SPLIT-IF returns the both parts as a list.
SEQ-SPLIT-IF-NOT takes a predicate function taking a single argument
and a sequence. It splits the sequence at the first item for which the predicate
function returns NIL and then SEQ-SPLIT-IF-NOT returns the both parts as a list.
Take the first N elements of the sequence.
TAKE-NTH takes two arguments, a number and a sequence. It returns a sequence of items from the supplied sequence, taking the first item and every Nth item, where N is the supplied number.
SEQ-TAKE-WHILE takes a predicate function taking a single argument
and a sequence. It returns a sequence of all items in the original sequence, up until
the first item for which the predicate function returns NIL.
SEQ-TAKE-WHILE-NOT takes two arguments, a predicate function taking a single argument and a sequence. It returns a sequence of all items in the original sequence, up until the first item for which the predicate function returns T.
Return a sequence that returns lists of items from the provided sequences.
Returns either NIL or an enumerator.
vector
)) ¶list
)) ¶delayed-seq
)) ¶Test whether this is a sequence.
vector
)) ¶list
)) ¶delayed-seq
)) ¶Append two enumerators.
Like REDUCE but applied to the enumerators.
Like EVERY but applied to one generic sequence.
Apply the specified function to the sequence.
Like the MAPCAR function but applied to a single generic sequence.
Like SEQ-MAP-1 but the specified function must return a sequence. In other words, this is a monadic bind function.
Like NOTANY but applied to one generic sequence.
Like NOTEVERY but applied to one generic sequence.
Like SOME but applied to one generic sequence.
Represents the basic sequence that is defined only by its enumerator.
structure-object
.
The delayed sequence.
structure-object
.
Jump to: | (
B C D E F G M S |
---|
Jump to: | (
B C D E F G M S |
---|
Jump to: | D S |
---|
Index Entry | Section | ||
---|---|---|---|
| |||
D | |||
delayed-enum : | Private structures | ||
delayed-seq : | Private structures | ||
| |||
S | |||
Slot, delayed-enum : | Private structures | ||
Slot, delayed-seq : | Private structures | ||
|
Jump to: | D S |
---|
Jump to: | B D F G L M P R S T |
---|
Jump to: | B D F G L M P R S T |
---|