This is the big-string Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon May 15 03:23:25 2023 GMT+0.
The main system appears first, followed by any subsystem dependency.
big-stringBig strings, similar to Java’s StringBuilder.
Robert Smith <quad@symbo1ics.com>
BSD 3-clause (see LICENSE)
package.lisp (file).
big-string.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
big-string/big-string.lisppackage.lisp (file).
big-string (system).
big-string (structure).
big-string-append (function).
big-string-char (function).
big-string-length (function).
big-string-p (function).
big-string-substring (function).
copy-big-string (function).
make-big-string (function).
print-object (method).
string-of-big-string (function).
array-size (type).
big-string-cumulative-lengths (reader).
(setf big-string-cumulative-lengths) (writer).
big-string-size (type).
big-string-strings (reader).
(setf big-string-strings) (writer).
big-string-tracked-length (reader).
(setf big-string-tracked-length) (writer).
binary-search (function).
Packages are listed by definition order.
big-stringcommon-lisp.
big-string (structure).
big-string-append (function).
big-string-char (function).
big-string-length (function).
big-string-p (function).
big-string-substring (function).
copy-big-string (function).
make-big-string (function).
string-of-big-string (function).
array-size (type).
big-string-cumulative-lengths (reader).
(setf big-string-cumulative-lengths) (writer).
big-string-size (type).
big-string-strings (reader).
(setf big-string-strings) (writer).
big-string-tracked-length (reader).
(setf big-string-tracked-length) (writer).
binary-search (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Destructively append the string STRING to the big string BS.
Time complexity: O(1) [amortized]
Find the Nth char in the big string BS.
Time complexity: O(log n)
Return the total length of the big string BS.
Time complexity: O(1)
Compute the substring from the big string BS from the index START
to before the index END.
Time complexity: with n = end - start, O(n log n)
Build a string from the big string BS.
Time complexity: O(size(bs))
structure-object.
big-string::big-string-size
0
(and (vector big-string::big-string-size) (not simple-array))
(make-array 10 :element-type (quote big-string::big-string-size) :initial-element 0 :adjustable t :fill-pointer 0)
(and (vector simple-string) (not simple-array))
(make-array 10 :element-type (quote simple-string) :initial-element "" :adjustable t :fill-pointer 0)
Find the least value in the array ARRAY greater than N. Return NIL if N is negative or no such number is found.
| Jump to: | (
B C F M P S |
|---|
| Jump to: | (
B C F M P S |
|---|
| Jump to: | C S T |
|---|
| Jump to: | C S T |
|---|
| Jump to: | A B F P S T |
|---|
| Jump to: | A B F P S T |
|---|