This is the split-sequence Reference Manual, version 2.0.1, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon Feb 26 17:57:06 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
split-sequenceSplits a sequence into a list of subsequences delimited by objects satisfying a test.
Sharp Lispers <sharplispers@googlegroups.com>
Arthur Lemmens <alemmens@xs4all.nl>
MIT
2.0.1
version.sexp (file).
package.lisp (file).
vector.lisp (file).
list.lisp (file).
extended-sequence.lisp (file).
api.lisp (file).
documentation.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
split-sequence/split-sequence.asdsplit-sequence/package.lispsplit-sequence/vector.lispsplit-sequence/list.lispsplit-sequence/extended-sequence.lispsplit-sequence/api.lispsplit-sequence/documentation.lispsplit-sequence/split-sequence.asdsplit-sequence (system).
split-sequence/vector.lispsplit-sequence (system).
array-index (type).
split-vector (function).
split-vector-from-end (function).
split-vector-from-start (function).
split-vector-if (function).
split-vector-if-not (function).
split-sequence/list.lispsplit-sequence (system).
collect-until (function).
count-while (function).
split-list (function).
split-list-from-end (function).
split-list-from-start (function).
split-list-if (function).
split-list-if-not (function).
split-list-internal (function).
split-sequence/extended-sequence.lisp(:or :sbcl :abcl)
split-sequence (system).
extended-sequence (type).
split-extended-sequence (function).
split-extended-sequence-from-end (function).
split-extended-sequence-from-start (function).
split-extended-sequence-if (function).
split-extended-sequence-if-not (function).
split-sequence/api.lispsplit-sequence (system).
split-sequence (function).
split-sequence-if (function).
split-sequence-if-not (function).
check-bounds (function).
check-tests (macro).
list-long-enough-p (function).
simple-program-error (condition).
Packages are listed by definition order.
split-sequencecommon-lisp.
split-sequence (function).
split-sequence-if (function).
split-sequence-if-not (function).
array-index (type).
check-bounds (function).
check-tests (macro).
collect-until (function).
count-while (function).
extended-sequence (type).
list-long-enough-p (function).
simple-program-error (condition).
split-extended-sequence (function).
split-extended-sequence-from-end (function).
split-extended-sequence-from-start (function).
split-extended-sequence-if (function).
split-extended-sequence-if-not (function).
split-list (function).
split-list-from-end (function).
split-list-from-start (function).
split-list-if (function).
split-list-if-not (function).
split-list-internal (function).
split-vector (function).
split-vector-from-end (function).
split-vector-from-start (function).
split-vector-if (function).
split-vector-if-not (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Return a list of subsequences in seq delimited by delimiter.
If :remove-empty-subseqs is NIL, empty subsequences will be included
in the result; otherwise they will be discarded. All other keywords
work analogously to those for CL:SUBSTITUTE. In particular, the
behaviour of :from-end is possibly different from other versions of
this function; :from-end values of NIL and T are equivalent unless
:count is supplied. :count limits the number of subseqs in the main
resulting list. The second return value is an index suitable as an
argument to CL:SUBSEQ into the sequence indicating where processing
stopped.
Return a list of subsequences in seq delimited by items satisfying
predicate.
If :remove-empty-subseqs is NIL, empty subsequences will be included
in the result; otherwise they will be discarded. All other keywords
work analogously to those for CL:SUBSTITUTE-IF. In particular, the
behaviour of :from-end is possibly different from other versions of
this function; :from-end values of NIL and T are equivalent unless
:count is supplied. :count limits the number of subseqs in the main
resulting list. The second return value is an index suitable as an
argument to CL:SUBSEQ into the sequence indicating where processing
stopped.
Return a list of subsequences in seq delimited by items satisfying
(CL:COMPLEMENT predicate).
If :remove-empty-subseqs is NIL, empty subsequences will be included
in the result; otherwise they will be discarded. All other keywords
work analogously to those for CL:SUBSTITUTE-IF-NOT. In particular,
the behaviour of :from-end is possibly different from other versions
of this function; :from-end values of NIL and T are equivalent unless
:count is supplied. :count limits the number of subseqs in the main
resulting list. The second return value is an index suitable as an
argument to CL:SUBSEQ into the sequence indicating where processing
stopped.
Collect elements from LIST until one that satisfies PREDICATE is found.
At most END elements will be examined. If END is null, all elements will be examined.
Returns four values:
* The collected items.
* The remaining items.
* The number of elements examined.
* Whether the search ended by running off the end, instead of by finding a delimiter.
Count the number of elements satisfying PREDICATE at the beginning of LIST.
At most END elements will be counted. If END is null, all elements will be examined.
program-error.
simple-condition.
| Jump to: | C F L M S |
|---|
| Jump to: | C F L M S |
|---|
| Jump to: | A C D E F L P S T V |
|---|
| Jump to: | A C D E F L P S T V |
|---|