This is the string-case Reference Manual, version 0.0.2, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon May 15 06:32:00 2023 GMT+0.
The main system appears first, followed by any subsystem dependency.
string-casestring-case is a macro that generates specialised decision trees to dispatch on string equality
Paul Khuong
3-clause BSD
0.0.2
string-case.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
string-case/string-case.lispstring-case (system).
string-case (macro).
*input-string* (special variable).
*no-match-form* (special variable).
all-equal (function).
emit-common-checks (function).
emit-string-case (function).
find-best-split (function).
hash-table->list (function).
iota (function).
make-search-tree (function).
numeric-char= (function).
split (function).
split-at (function).
Packages are listed by definition order.
string-casecommon-lisp.
sb-c.
sb-vm.
string-case (macro).
*input-string* (special variable).
*no-match-form* (special variable).
all-equal (function).
emit-common-checks (function).
emit-string-case (function).
find-best-split (function).
hash-table->list (function).
iota (function).
make-search-tree (function).
numeric-char= (function).
split (function).
split-at (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
(string-case (string &key default)
case*)
case ::= string form*
| t form*
Where t is the default case.
Symbol of the variable holding the input string
Form to insert when no match is found.
Iterate over all the indices left to check to find which index (and which character) to test for equality with, keeping the ones which result in the most balanced split.
Saves the keys and/or values in table to a list. As with hash table iterating functions, there is no implicit ordering.
Splits input list into sublists of elements
whose elements are all such that (key element)
are all test.
It’s assumed that test and key form an equality class.
(This is similar to groupBy)
Split list in k lists of n elements (or less for the last list)
| Jump to: | A E F H I M N S |
|---|
| Jump to: | A E F H I M N S |
|---|
| Jump to: | *
S |
|---|
| Jump to: | *
S |
|---|
| Jump to: | F P S |
|---|
| Jump to: | F P S |
|---|