This is the sycamore Reference Manual, version 0.0.20250808, generated automatically by Declt version 4.0 beta 2 "William Riker" on Fri May 15 13:05:25 2026 GMT+0.
sycamore/sycamore.asdsycamore/package.lispsycamore/util.lispsycamore/heap.lispsycamore/queue.lispsycamore/array.lispsycamore/binary.lispsycamore/wb-tree.lispsycamore/bits/bits-generic.lispsycamore/bits/bits-sbcl-x86-64.lispsycamore/hamt.lispsycamore/interfaces.lispsycamore/rope.lispsycamore/cgen.lispThe main system appears first, followed by any subsystem dependency.
sycamoreFast, purely functional data structures
Neil T. Dantam
BSD-3
Sycamore is a fast, purely functional data structure library in Common Lisp. It include hash array mapped tries, weight-balanced binary trees, set and map (dictionary) interfaces, pairing heaps, and amortized queues.
0.0.20250808
cl-ppcre (system).
alexandria (system).
lisp-unit (system).
cl-fuzz (system).
package.lisp (file).
util.lisp (file).
heap.lisp (file).
queue.lisp (file).
array.lisp (file).
binary.lisp (file).
wb-tree.lisp (file).
bits (module).
hamt.lisp (file).
interfaces.lisp (file).
rope.lisp (file).
cgen.lisp (file).
Modules are listed depth-first from the system components tree.
sycamore/bitspackage.lisp (file).
sycamore (system).
bits-generic.lisp (file).
bits-sbcl-x86-64.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
sycamore/sycamore.asdsycamore/package.lispsycamore/util.lispsycamore/heap.lispsycamore/queue.lispsycamore/array.lispsycamore/binary.lispsycamore/wb-tree.lispsycamore/bits/bits-generic.lispsycamore/bits/bits-sbcl-x86-64.lispsycamore/hamt.lispsycamore/interfaces.lispsycamore/rope.lispsycamore/cgen.lispsycamore/util.lisppackage.lisp (file).
sycamore (system).
bit-vector-compare (function).
cond-compare (macro).
double-compare (function).
fixnum-compare (function).
fold (function).
fold-n (function).
gsymbol-compare (function).
if-less-eq-compare (macro).
or-compare (macro).
output-dot (function).
string-compare (function).
unsigned-fixnum (type).
with-temp-array (macro).
with-timing (macro).
fold-1 (function).
gsymbol-compare-atom (function).
output-dot-file (function).
simple-string-compare (function).
strcat (function).
string-compare-inline (function).
vector-range (function).
sycamore/heap.lisputil.lisp (file).
sycamore (system).
+pairing-heap-max-array-length+ (constant).
copy-pairing-heap (function).
make-pairing-heap (function).
pairing-heap (structure).
pairing-heap-builder (function).
pairing-heap-children (reader).
(setf pairing-heap-children) (writer).
pairing-heap-find-min (function).
pairing-heap-insert (function).
pairing-heap-list (function).
pairing-heap-merge (function).
pairing-heap-merge-pairs (function).
pairing-heap-next (reader).
(setf pairing-heap-next) (writer).
pairing-heap-p (function).
pairing-heap-remove-min (function).
pairing-heap-root (reader).
(setf pairing-heap-root) (writer).
root-pairing-heap (function).
sycamore/queue.lisputil.lisp (file).
sycamore (system).
amortized-dequeue (function).
amortized-enqueue (function).
amortized-queue (function).
amortized-queue (structure).
amortized-queue-empty-p (function).
amortized-queue-list (function).
amortized-queue-push (function).
make-amortized-queue (function).
%make-amortized-queue (function).
amortized-queue-forward (reader).
(setf amortized-queue-forward) (writer).
amortized-queue-p (function).
amortized-queue-reverse (reader).
(setf amortized-queue-reverse) (writer).
copy-amortized-queue (function).
sycamore/array.lisputil.lisp (file).
sycamore (system).
array-tree-builder (function).
array-tree-compare (function).
array-tree-count-unique (function).
array-tree-insert (function).
array-tree-insert-at (function).
array-tree-insert-position (function).
array-tree-intersection (function).
array-tree-position (function).
array-tree-remove (function).
array-tree-remove-position (function).
array-tree-replace (function).
array-tree-search (function).
array-tree-set (function).
array-tree-split (function).
array-tree-split-at (function).
with-array-tree (macro).
sycamore/binary.lisputil.lisp (file).
array.lisp (file).
sycamore (system).
binary-tree (structure).
binary-tree-compare (function).
binary-tree-count (function).
binary-tree-depth (function).
binary-tree-dot (function).
binary-tree-equal (function).
binary-tree-every (function).
binary-tree-find (function).
binary-tree-from-list (function).
binary-tree-half-leaf-p (function).
binary-tree-leaf-p (function).
binary-tree-left (reader).
(setf binary-tree-left) (writer).
binary-tree-left-left (function).
binary-tree-left-right (function).
binary-tree-max (function).
binary-tree-member-p (function).
binary-tree-min (function).
binary-tree-p (function).
binary-tree-right (reader).
(setf binary-tree-right) (writer).
binary-tree-right-left (function).
binary-tree-right-right (function).
binary-tree-search-node (function).
binary-tree-some (function).
binary-tree-value (reader).
(setf binary-tree-value) (writer).
binary-tree-value-left (function).
binary-tree-value-right (function).
copy-binary-tree (function).
fold-binary-tree (function).
make-binary-tree (function).
map-binary-tree (function).
map-binary-tree-inorder (function).
map-binary-tree-list (function).
map-binary-tree-nil (function).
map-binary-tree-postorder (function).
map-binary-tree-preorder (function).
sycamore/wb-tree.lispbinary.lisp (file).
array.lisp (file).
sycamore (system).
print-object (method).
%make-wb-tree (function).
%wb-tree (function).
*wb-tree-print-depth* (special variable).
*wb-tree-print-max* (special variable).
+wb-tree-max-array-length+ (constant).
+wb-tree-min-array-length+ (constant).
+wb-tree-rebalance-log+ (special variable).
balance-wb-tree (function).
balance-wb-tree-array-pair (function).
balance-wb-tree-left (function).
balance-wb-tree-right (function).
build-wb-tree (function).
check-wb-balance (macro).
cond-wb-tree-compare (macro).
cond-wb-tree-vector-compare (macro).
copy-wb-tree (function).
join-wb-tree (function).
join-wb-tree-left (function).
join-wb-tree-left-right (function).
join-wb-tree-right (function).
left-right-wb-tree (function).
left-wb-tree (function).
make-wb-tree (function).
right-left-wb-tree (function).
right-wb-tree (function).
wb-tree (function).
wb-tree (structure).
wb-tree-array (function).
wb-tree-array-intersection (function).
wb-tree-balanced-p (function).
wb-tree-builder (function).
wb-tree-compare (function).
wb-tree-concatenate (function).
wb-tree-concatenate-array (function).
wb-tree-count (function).
wb-tree-difference (function).
wb-tree-dot (function).
wb-tree-insert (function).
wb-tree-insert-max (function).
wb-tree-insert-max-array (function).
wb-tree-insert-min (function).
wb-tree-insert-min-array (function).
wb-tree-insert-vector (function).
wb-tree-intersection (function).
wb-tree-intersection-difference (function).
wb-tree-intersection-p (function).
wb-tree-intersection-tree-array (function).
wb-tree-left (function).
(setf wb-tree-left) (function).
wb-tree-list (function).
wb-tree-midpoint (function).
wb-tree-modify (function).
wb-tree-modify-vector (function).
wb-tree-p (function).
wb-tree-position (function).
wb-tree-ref (function).
wb-tree-reinsert (function).
wb-tree-reinsert-vector (function).
wb-tree-remove (function).
wb-tree-remove-max (function).
wb-tree-remove-min (function).
wb-tree-remove-position (function).
wb-tree-replace (function).
wb-tree-replace-vector (function).
wb-tree-right (function).
(setf wb-tree-right) (function).
wb-tree-serialize (function).
wb-tree-smaller (function).
wb-tree-split (function).
wb-tree-subset (function).
wb-tree-union (function).
wb-tree-union-array (function).
wb-tree-union-tree-vector (function).
wb-tree-value (function).
(setf wb-tree-value) (function).
wb-tree-weight (reader).
(setf wb-tree-weight) (writer).
with-temp-wb-array (macro).
with-wb-tree (macro).
with-wb-tree-split (macro).
with-wb-trees (macro).
sycamore/bits/bits-generic.lispbits (module).
%bit-ctz (function).
%bit-popcnt (function).
sycamore/hamt.lisparray.lisp (file).
bits (module).
sycamore (system).
%hamt-set-map-nil (function).
+hamt-bits+ (constant).
+hamt-mask+ (constant).
+hamt-maxdepth+ (constant).
+hamt-size+ (constant).
case-hamt-present (macro).
check-hamt-debug (macro).
check-hamt-debug-member (macro).
check-hamt-debug-not-member (macro).
check-hamt-debug-set (macro).
copy-hamt-bucket (function).
do-hamt-bits (macro).
hamt-bit (function).
hamt-bit (type).
hamt-bit-depth (type).
hamt-bit-depth-inc (function).
hamt-bit-depth-subhash (function).
hamt-bitmap (type).
hamt-bitmap-least (function).
hamt-bucket (function).
hamt-bucket (structure).
hamt-bucket-hash-code (reader).
(setf hamt-bucket-hash-code) (writer).
hamt-bucket-list (reader).
(setf hamt-bucket-list) (writer).
hamt-bucket-p (function).
hamt-depth (type).
hamt-hash-code (type).
hamt-index (function).
hamt-index (type).
hamt-layer (type).
hamt-layer-1 (function).
hamt-layer-2 (function).
hamt-layer-bitmap (function).
hamt-layer-finish (function).
hamt-layer-insert (function).
hamt-layer-nupdate (function).
hamt-layer-open (function).
hamt-layer-ref (function).
hamt-layer-remove (function).
hamt-layer-singleton (function).
hamt-layer-test-update (function).
hamt-layer-update (function).
hamt-popcount (function).
hamt-set-bucket* (function).
hamt-set-bucket-member (function).
hamt-set-check (function).
hamt-set-count (function).
hamt-set-difference (function).
hamt-set-do (macro).
hamt-set-entry (function).
hamt-set-entry (type).
hamt-set-entry-= (function).
hamt-set-entry-hash-code (function).
hamt-set-entry-key (function).
hamt-set-find (function).
hamt-set-fold-left (function).
hamt-set-fold-right (function).
hamt-set-insert (function).
hamt-set-insert-2 (function).
hamt-set-intersection (function).
hamt-set-intersection-p (function).
hamt-set-layer-singleton (function).
hamt-set-map (function).
hamt-set-map-list (function).
hamt-set-map-nil (function).
hamt-set-map-vector (function).
hamt-set-member (function).
hamt-set-ninsert (function).
hamt-set-ninsert-2 (function).
hamt-set-nreplace (function).
hamt-set-remove (function).
hamt-set-replace (function).
hamt-set-subset-p (function).
hamt-set-union (function).
hamt-subhash (function).
if-hamt-present (macro).
sycamore/interfaces.lispwb-tree.lisp (file).
hamt.lisp (file).
sycamore (system).
alist-hash-map (function).
alist-tree-map (function).
do-hash-map (macro).
do-tree-map (macro).
do-tree-set (macro).
empty-hash-map (function).
empty-tree-map (function).
empty-tree-set (function).
fold-hash-map (function).
fold-hash-map-keys (function).
fold-hash-map-values (function).
fold-hash-set (function).
fold-right-hash-set (function).
fold-tree-map (function).
fold-tree-set (function).
hash-map (structure).
hash-map-alist (function).
hash-map-contains (function).
hash-map-find (function).
hash-map-hash-table (function).
hash-map-insert (function).
hash-map-keys (function).
hash-map-remove (function).
hash-map-values (function).
hash-set (structure).
hash-set-difference (function).
hash-set-empty-p (function).
hash-set-find (function).
hash-set-insert (function).
hash-set-intersection (function).
hash-set-intersection-p (function).
hash-set-list (function).
hash-set-remove (function).
hash-set-subset-p (function).
hash-set-union (function).
hash-table-hash-map (function).
hash-table-tree-map (function).
list-hash-set (function).
make-hash-map (function).
make-hash-set (function).
make-tree-map (function).
make-tree-set (function).
map-hash-map (function).
map-hash-set (function).
map-tree-map (function).
map-tree-set (function).
print-object (method).
print-object (method).
print-object (method).
print-object (method).
tree-map (structure).
tree-map-alist (function).
tree-map-contains (function).
tree-map-count (function).
tree-map-find (function).
(setf tree-map-find) (function).
tree-map-hash-table (function).
tree-map-insert (function).
tree-map-insert-alist (function).
tree-map-insert-hash-table (function).
tree-map-insert-map (function).
tree-map-insertf (macro).
tree-map-keys (function).
tree-map-remove (function).
tree-map-values (function).
tree-set (function).
tree-set (structure).
tree-set-compare (function).
tree-set-count (function).
tree-set-difference (function).
tree-set-equal-p (function).
tree-set-find (function).
(setf tree-set-find) (function).
tree-set-insert (function).
tree-set-insertf (macro).
tree-set-intern (function).
tree-set-intersection (function).
tree-set-intersection-difference (function).
tree-set-intersection-p (function).
tree-set-list (function).
tree-set-max (function).
tree-set-member-p (function).
tree-set-min (function).
tree-set-p (function).
tree-set-position (function).
tree-set-ref (function).
tree-set-remove (function).
tree-set-remove-max (function).
tree-set-remove-min (function).
tree-set-remove-position (function).
tree-set-replace (function).
tree-set-subset-p (function).
tree-set-union (function).
%hash-function (function).
%hash-map-functions (function).
%hash-set-functions (function).
%make-aux-tree (function).
%make-hash-map (function).
%make-hash-set (function).
%make-tree-bag (function).
%make-tree-map (function).
%make-tree-set (function).
%print-object-map (function).
%print-object-set (function).
%set-hash-set (function).
%tree-bag-insert (function).
%update-hash-map (function).
%update-hash-set (function).
%with-hash-map (macro).
%with-hash-set (macro).
copy-hash-map (function).
copy-hash-set (function).
copy-root-tree (function).
copy-tree-bag (function).
copy-tree-map (function).
copy-tree-set (function).
def-tree-set-binop (macro).
def-tree-set-item-op (macro).
empty-hash-set (function).
hash-map-%functions (reader).
(setf hash-map-%functions) (writer).
hash-map-p (function).
hash-map-root (reader).
(setf hash-map-root) (writer).
hash-set-%functions (reader).
(setf hash-set-%functions) (writer).
hash-set-member-p (function).
hash-set-p (function).
hash-set-root (reader).
(setf hash-set-root) (writer).
make-aux-compare (function).
root-tree (structure).
root-tree-%compare (reader).
(setf root-tree-%compare) (writer).
root-tree-p (function).
root-tree-root (reader).
(setf root-tree-root) (writer).
tree-bag (function).
tree-bag (structure).
tree-bag-%compare (function).
(setf tree-bag-%compare) (function).
tree-bag-count (function).
tree-bag-decrement (function).
tree-bag-increment (function).
tree-bag-insert (function).
tree-bag-p (function).
tree-bag-root (function).
(setf tree-bag-root) (function).
tree-map-compare (reader).
(setf tree-map-compare) (writer).
tree-map-p (function).
tree-map-root (reader).
(setf tree-map-root) (writer).
tree-set-%compare (reader).
(setf tree-set-%compare) (writer).
tree-set-%root (reader).
(setf tree-set-%root) (writer).
tree-set-root (function).
with-map-key (macro).
sycamore/rope.lisputil.lisp (file).
sycamore (system).
%rope (function).
*rope-print* (special variable).
object-rope (generic function).
output-rope (function).
print-object (method).
rope (compiler macro).
rope (function).
rope (type).
rope-compare-fast (function).
rope-compare-lexographic (function).
rope-length (function).
rope-map (function).
rope-parenthesize (function).
rope-pathname (function).
rope-ref (function).
rope-split (function).
rope-string (function).
rope-write (function).
rope/= (function).
rope< (function).
rope<= (function).
rope= (function).
rope> (function).
rope>= (function).
ropep (function).
sexp-rope (function).
subrope (function).
%rope-helper (function).
copy-rope-iterator (function).
copy-rope-node (function).
make-rope-iterator (function).
make-rope-node (function).
object-rope-check (function).
rope-1 (function).
rope-2 (function).
rope-3 (function).
rope-4 (function).
rope-5 (function).
rope-6 (function).
rope-7 (function).
rope-8 (function).
rope-array-cat (function).
rope-height (function).
rope-height-type (type).
rope-iterator (function).
rope-iterator (structure).
rope-iterator-i (reader).
(setf rope-iterator-i) (writer).
rope-iterator-next (function).
rope-iterator-p (function).
rope-iterator-pop (function).
rope-iterator-push (function).
rope-iterator-stack (reader).
(setf rope-iterator-stack) (writer).
rope-length-type (type).
rope-list-cat (function).
rope-node (structure).
rope-node-height (reader).
(setf rope-node-height) (writer).
rope-node-left (reader).
(setf rope-node-left) (writer).
rope-node-length (reader).
(setf rope-node-length) (writer).
rope-node-p (function).
rope-node-right (reader).
(setf rope-node-right) (writer).
sycamore/cgen.lisprope.lisp (file).
sycamore (system).
cgen-* (function).
cgen-+ (function).
cgen-- (function).
cgen-/ (function).
cgen-addr (function).
cgen-array-initializer (function).
cgen-assign (function).
cgen-assign-stmt (function).
cgen-block (function).
cgen-block (structure).
cgen-call (function).
cgen-call-stmt (function).
cgen-comment (function).
cgen-declare (function).
cgen-declare-array (function).
cgen-declare-fun (function).
cgen-defun (function).
cgen-deref (function).
cgen-double-float (function).
cgen-equal (function).
cgen-exp (function).
cgen-identifier (function).
cgen-if (function).
cgen-include-local (function).
cgen-include-system (function).
cgen-line-comment (function).
cgen-return (function).
cgen-single-float (function).
cgen-sizeof (function).
cgen-stmt (function).
cgen-string (function).
cgen-subscript (function).
cgen-subscript (structure).
cgen-while (function).
object-rope (method).
object-rope (method).
object-rope (method).
object-rope (method).
object-rope (method).
%cgen-binop (function).
%cgen-unop-post (function).
%cgen-unop-pre (function).
*cgen-indent* (special variable).
*cgen-indent-mark* (special variable).
*cgen-newline-indent* (special variable).
cgen-binop (function).
cgen-binop (structure).
cgen-binop-a (reader).
(setf cgen-binop-a) (writer).
cgen-binop-b (reader).
(setf cgen-binop-b) (writer).
cgen-binop-op (function).
(setf cgen-binop-op) (function).
cgen-binop-p (function).
cgen-block-header (reader).
(setf cgen-block-header) (writer).
cgen-block-p (function).
cgen-block-stmts (reader).
(setf cgen-block-stmts) (writer).
cgen-call-list (function).
cgen-define-constant (function).
cgen-op (structure).
cgen-op-op (reader).
(setf cgen-op-op) (writer).
cgen-op-p (function).
cgen-op-rope (function).
cgen-op-symbol (function).
cgen-parenthesize (function).
cgen-subscript-a (function).
(setf cgen-subscript-a) (function).
cgen-subscript-b (function).
(setf cgen-subscript-b) (function).
cgen-subscript-op (function).
(setf cgen-subscript-op) (function).
cgen-subscript-p (function).
cgen-unop-post (function).
cgen-unop-post (structure).
cgen-unop-post-a (reader).
(setf cgen-unop-post-a) (writer).
cgen-unop-post-op (function).
(setf cgen-unop-post-op) (function).
cgen-unop-post-p (function).
cgen-unop-pre (function).
cgen-unop-pre (structure).
cgen-unop-pre-a (reader).
(setf cgen-unop-pre-a) (writer).
cgen-unop-pre-op (function).
(setf cgen-unop-pre-op) (function).
cgen-unop-pre-p (function).
copy-cgen-binop (function).
copy-cgen-block (function).
copy-cgen-op (function).
copy-cgen-subscript (function).
copy-cgen-unop-post (function).
copy-cgen-unop-pre (function).
def-cgen-binop (macro).
make-cgen-block (function).
make-cgen-op (function).
make-cgen-subscript (function).
op-precedence (function).
precedence (function).
with-cgen-indent (macro).
Packages are listed by definition order.
sycamore-utilalexandria.
common-lisp.
bit-vector-compare (function).
cond-compare (macro).
double-compare (function).
fixnum-compare (function).
fold (function).
fold-n (function).
gsymbol-compare (function).
if-less-eq-compare (macro).
or-compare (macro).
output-dot (function).
string-compare (function).
unsigned-fixnum (type).
with-temp-array (macro).
with-timing (macro).
fold-1 (function).
gsymbol-compare-atom (function).
output-dot-file (function).
simple-string-compare (function).
strcat (function).
string-compare-inline (function).
vector-range (function).
sycamore-cgenalexandria.
common-lisp.
sycamore.
sycamore-util.
cgen-* (function).
cgen-+ (function).
cgen-- (function).
cgen-/ (function).
cgen-addr (function).
cgen-array-initializer (function).
cgen-assign (function).
cgen-assign-stmt (function).
cgen-block (function).
cgen-block (structure).
cgen-call (function).
cgen-call-stmt (function).
cgen-comment (function).
cgen-declare (function).
cgen-declare-array (function).
cgen-declare-fun (function).
cgen-defun (function).
cgen-deref (function).
cgen-double-float (function).
cgen-equal (function).
cgen-exp (function).
cgen-identifier (function).
cgen-if (function).
cgen-include-local (function).
cgen-include-system (function).
cgen-line-comment (function).
cgen-return (function).
cgen-single-float (function).
cgen-sizeof (function).
cgen-stmt (function).
cgen-string (function).
cgen-subscript (function).
cgen-subscript (structure).
cgen-while (function).
%cgen-binop (function).
%cgen-unop-post (function).
%cgen-unop-pre (function).
*cgen-indent* (special variable).
*cgen-indent-mark* (special variable).
*cgen-newline-indent* (special variable).
cgen-binop (function).
cgen-binop (structure).
cgen-binop-a (reader).
(setf cgen-binop-a) (writer).
cgen-binop-b (reader).
(setf cgen-binop-b) (writer).
cgen-binop-op (function).
(setf cgen-binop-op) (function).
cgen-binop-p (function).
cgen-block-header (reader).
(setf cgen-block-header) (writer).
cgen-block-p (function).
cgen-block-stmts (reader).
(setf cgen-block-stmts) (writer).
cgen-call-list (function).
cgen-define-constant (function).
cgen-op (structure).
cgen-op-op (reader).
(setf cgen-op-op) (writer).
cgen-op-p (function).
cgen-op-rope (function).
cgen-op-symbol (function).
cgen-parenthesize (function).
cgen-subscript-a (function).
(setf cgen-subscript-a) (function).
cgen-subscript-b (function).
(setf cgen-subscript-b) (function).
cgen-subscript-op (function).
(setf cgen-subscript-op) (function).
cgen-subscript-p (function).
cgen-unop-post (function).
cgen-unop-post (structure).
cgen-unop-post-a (reader).
(setf cgen-unop-post-a) (writer).
cgen-unop-post-op (function).
(setf cgen-unop-post-op) (function).
cgen-unop-post-p (function).
cgen-unop-pre (function).
cgen-unop-pre (structure).
cgen-unop-pre-a (reader).
(setf cgen-unop-pre-a) (writer).
cgen-unop-pre-op (function).
(setf cgen-unop-pre-op) (function).
cgen-unop-pre-p (function).
copy-cgen-binop (function).
copy-cgen-block (function).
copy-cgen-op (function).
copy-cgen-subscript (function).
copy-cgen-unop-post (function).
copy-cgen-unop-pre (function).
def-cgen-binop (macro).
make-cgen-block (function).
make-cgen-op (function).
make-cgen-subscript (function).
op-precedence (function).
precedence (function).
with-cgen-indent (macro).
sycamorealexandria.
common-lisp.
sycamore-util.
%rope (function).
*rope-print* (special variable).
alist-hash-map (function).
alist-tree-map (function).
amortized-dequeue (function).
amortized-enqueue (function).
amortized-queue (function).
amortized-queue (structure).
amortized-queue-empty-p (function).
amortized-queue-list (function).
amortized-queue-push (function).
do-hash-map (macro).
do-tree-map (macro).
do-tree-set (macro).
empty-hash-map (function).
empty-tree-map (function).
empty-tree-set (function).
fold-hash-map (function).
fold-hash-map-keys (function).
fold-hash-map-values (function).
fold-hash-set (function).
fold-right-hash-set (function).
fold-tree-map (function).
fold-tree-set (function).
hash-map (structure).
hash-map-alist (function).
hash-map-contains (function).
hash-map-find (function).
hash-map-hash-table (function).
hash-map-insert (function).
hash-map-keys (function).
hash-map-remove (function).
hash-map-values (function).
hash-set (structure).
hash-set-difference (function).
hash-set-empty-p (function).
hash-set-find (function).
hash-set-insert (function).
hash-set-intersection (function).
hash-set-intersection-p (function).
hash-set-list (function).
hash-set-remove (function).
hash-set-subset-p (function).
hash-set-union (function).
hash-table-hash-map (function).
hash-table-tree-map (function).
list-hash-set (function).
make-amortized-queue (function).
make-hash-map (function).
make-hash-set (function).
make-tree-map (function).
make-tree-set (function).
map-hash-map (function).
map-hash-set (function).
map-tree-map (function).
map-tree-set (function).
object-rope (generic function).
output-rope (function).
rope (compiler macro).
rope (function).
rope (type).
rope-compare-fast (function).
rope-compare-lexographic (function).
rope-length (function).
rope-map (function).
rope-parenthesize (function).
rope-pathname (function).
rope-ref (function).
rope-split (function).
rope-string (function).
rope-write (function).
rope/= (function).
rope< (function).
rope<= (function).
rope= (function).
rope> (function).
rope>= (function).
ropep (function).
sexp-rope (function).
subrope (function).
tree-map (structure).
tree-map-alist (function).
tree-map-contains (function).
tree-map-count (function).
tree-map-find (function).
(setf tree-map-find) (function).
tree-map-hash-table (function).
tree-map-insert (function).
tree-map-insert-alist (function).
tree-map-insert-hash-table (function).
tree-map-insert-map (function).
tree-map-insertf (macro).
tree-map-keys (function).
tree-map-remove (function).
tree-map-values (function).
tree-set (function).
tree-set (structure).
tree-set-compare (function).
tree-set-count (function).
tree-set-difference (function).
tree-set-equal-p (function).
tree-set-find (function).
(setf tree-set-find) (function).
tree-set-insert (function).
tree-set-insertf (macro).
tree-set-intern (function).
tree-set-intersection (function).
tree-set-intersection-difference (function).
tree-set-intersection-p (function).
tree-set-list (function).
tree-set-max (function).
tree-set-member-p (function).
tree-set-min (function).
tree-set-p (function).
tree-set-position (function).
tree-set-ref (function).
tree-set-remove (function).
tree-set-remove-max (function).
tree-set-remove-min (function).
tree-set-remove-position (function).
tree-set-replace (function).
tree-set-subset-p (function).
tree-set-union (function).
%bit-ctz (function).
%bit-popcnt (function).
%hamt-set-map-nil (function).
%hash-function (function).
%hash-map-functions (function).
%hash-set-functions (function).
%make-amortized-queue (function).
%make-aux-tree (function).
%make-hash-map (function).
%make-hash-set (function).
%make-tree-bag (function).
%make-tree-map (function).
%make-tree-set (function).
%make-wb-tree (function).
%print-object-map (function).
%print-object-set (function).
%rope-helper (function).
%set-hash-set (function).
%tree-bag-insert (function).
%update-hash-map (function).
%update-hash-set (function).
%wb-tree (function).
%with-hash-map (macro).
%with-hash-set (macro).
*wb-tree-print-depth* (special variable).
*wb-tree-print-max* (special variable).
+hamt-bits+ (constant).
+hamt-mask+ (constant).
+hamt-maxdepth+ (constant).
+hamt-size+ (constant).
+pairing-heap-max-array-length+ (constant).
+wb-tree-max-array-length+ (constant).
+wb-tree-min-array-length+ (constant).
+wb-tree-rebalance-log+ (special variable).
amortized-queue-forward (reader).
(setf amortized-queue-forward) (writer).
amortized-queue-p (function).
amortized-queue-reverse (reader).
(setf amortized-queue-reverse) (writer).
array-tree-builder (function).
array-tree-compare (function).
array-tree-count-unique (function).
array-tree-insert (function).
array-tree-insert-at (function).
array-tree-insert-position (function).
array-tree-intersection (function).
array-tree-position (function).
array-tree-remove (function).
array-tree-remove-position (function).
array-tree-replace (function).
array-tree-search (function).
array-tree-set (function).
array-tree-split (function).
array-tree-split-at (function).
balance-wb-tree (function).
balance-wb-tree-array-pair (function).
balance-wb-tree-left (function).
balance-wb-tree-right (function).
binary-tree (structure).
binary-tree-compare (function).
binary-tree-count (function).
binary-tree-depth (function).
binary-tree-dot (function).
binary-tree-equal (function).
binary-tree-every (function).
binary-tree-find (function).
binary-tree-from-list (function).
binary-tree-half-leaf-p (function).
binary-tree-leaf-p (function).
binary-tree-left (reader).
(setf binary-tree-left) (writer).
binary-tree-left-left (function).
binary-tree-left-right (function).
binary-tree-max (function).
binary-tree-member-p (function).
binary-tree-min (function).
binary-tree-p (function).
binary-tree-right (reader).
(setf binary-tree-right) (writer).
binary-tree-right-left (function).
binary-tree-right-right (function).
binary-tree-search-node (function).
binary-tree-some (function).
binary-tree-value (reader).
(setf binary-tree-value) (writer).
binary-tree-value-left (function).
binary-tree-value-right (function).
build-wb-tree (function).
case-hamt-present (macro).
check-hamt-debug (macro).
check-hamt-debug-member (macro).
check-hamt-debug-not-member (macro).
check-hamt-debug-set (macro).
check-wb-balance (macro).
cond-wb-tree-compare (macro).
cond-wb-tree-vector-compare (macro).
copy-amortized-queue (function).
copy-binary-tree (function).
copy-hamt-bucket (function).
copy-hash-map (function).
copy-hash-set (function).
copy-pairing-heap (function).
copy-root-tree (function).
copy-rope-iterator (function).
copy-rope-node (function).
copy-tree-bag (function).
copy-tree-map (function).
copy-tree-set (function).
copy-wb-tree (function).
def-tree-set-binop (macro).
def-tree-set-item-op (macro).
do-hamt-bits (macro).
empty-hash-set (function).
fold-binary-tree (function).
hamt-bit (function).
hamt-bit (type).
hamt-bit-depth (type).
hamt-bit-depth-inc (function).
hamt-bit-depth-subhash (function).
hamt-bitmap (type).
hamt-bitmap-least (function).
hamt-bucket (function).
hamt-bucket (structure).
hamt-bucket-hash-code (reader).
(setf hamt-bucket-hash-code) (writer).
hamt-bucket-list (reader).
(setf hamt-bucket-list) (writer).
hamt-bucket-p (function).
hamt-depth (type).
hamt-hash-code (type).
hamt-index (function).
hamt-index (type).
hamt-layer (type).
hamt-layer-1 (function).
hamt-layer-2 (function).
hamt-layer-bitmap (function).
hamt-layer-finish (function).
hamt-layer-insert (function).
hamt-layer-nupdate (function).
hamt-layer-open (function).
hamt-layer-ref (function).
hamt-layer-remove (function).
hamt-layer-singleton (function).
hamt-layer-test-update (function).
hamt-layer-update (function).
hamt-popcount (function).
hamt-set-bucket* (function).
hamt-set-bucket-member (function).
hamt-set-check (function).
hamt-set-count (function).
hamt-set-difference (function).
hamt-set-do (macro).
hamt-set-entry (function).
hamt-set-entry (type).
hamt-set-entry-= (function).
hamt-set-entry-hash-code (function).
hamt-set-entry-key (function).
hamt-set-find (function).
hamt-set-fold-left (function).
hamt-set-fold-right (function).
hamt-set-insert (function).
hamt-set-insert-2 (function).
hamt-set-intersection (function).
hamt-set-intersection-p (function).
hamt-set-layer-singleton (function).
hamt-set-map (function).
hamt-set-map-list (function).
hamt-set-map-nil (function).
hamt-set-map-vector (function).
hamt-set-member (function).
hamt-set-ninsert (function).
hamt-set-ninsert-2 (function).
hamt-set-nreplace (function).
hamt-set-remove (function).
hamt-set-replace (function).
hamt-set-subset-p (function).
hamt-set-union (function).
hamt-subhash (function).
hash-map-%functions (reader).
(setf hash-map-%functions) (writer).
hash-map-p (function).
hash-map-root (reader).
(setf hash-map-root) (writer).
hash-set-%functions (reader).
(setf hash-set-%functions) (writer).
hash-set-member-p (function).
hash-set-p (function).
hash-set-root (reader).
(setf hash-set-root) (writer).
if-hamt-present (macro).
join-wb-tree (function).
join-wb-tree-left (function).
join-wb-tree-left-right (function).
join-wb-tree-right (function).
left-right-wb-tree (function).
left-wb-tree (function).
make-aux-compare (function).
make-binary-tree (function).
make-pairing-heap (function).
make-rope-iterator (function).
make-rope-node (function).
make-wb-tree (function).
map-binary-tree (function).
map-binary-tree-inorder (function).
map-binary-tree-list (function).
map-binary-tree-nil (function).
map-binary-tree-postorder (function).
map-binary-tree-preorder (function).
object-rope-check (function).
pairing-heap (structure).
pairing-heap-builder (function).
pairing-heap-children (reader).
(setf pairing-heap-children) (writer).
pairing-heap-find-min (function).
pairing-heap-insert (function).
pairing-heap-list (function).
pairing-heap-merge (function).
pairing-heap-merge-pairs (function).
pairing-heap-next (reader).
(setf pairing-heap-next) (writer).
pairing-heap-p (function).
pairing-heap-remove-min (function).
pairing-heap-root (reader).
(setf pairing-heap-root) (writer).
right-left-wb-tree (function).
right-wb-tree (function).
root-pairing-heap (function).
root-tree (structure).
root-tree-%compare (reader).
(setf root-tree-%compare) (writer).
root-tree-p (function).
root-tree-root (reader).
(setf root-tree-root) (writer).
rope-1 (function).
rope-2 (function).
rope-3 (function).
rope-4 (function).
rope-5 (function).
rope-6 (function).
rope-7 (function).
rope-8 (function).
rope-array-cat (function).
rope-height (function).
rope-height-type (type).
rope-iterator (function).
rope-iterator (structure).
rope-iterator-i (reader).
(setf rope-iterator-i) (writer).
rope-iterator-next (function).
rope-iterator-p (function).
rope-iterator-pop (function).
rope-iterator-push (function).
rope-iterator-stack (reader).
(setf rope-iterator-stack) (writer).
rope-length-type (type).
rope-list-cat (function).
rope-node (structure).
rope-node-height (reader).
(setf rope-node-height) (writer).
rope-node-left (reader).
(setf rope-node-left) (writer).
rope-node-length (reader).
(setf rope-node-length) (writer).
rope-node-p (function).
rope-node-right (reader).
(setf rope-node-right) (writer).
tree-bag (function).
tree-bag (structure).
tree-bag-%compare (function).
(setf tree-bag-%compare) (function).
tree-bag-count (function).
tree-bag-decrement (function).
tree-bag-increment (function).
tree-bag-insert (function).
tree-bag-p (function).
tree-bag-root (function).
(setf tree-bag-root) (function).
tree-map-compare (reader).
(setf tree-map-compare) (writer).
tree-map-p (function).
tree-map-root (reader).
(setf tree-map-root) (writer).
tree-set-%compare (reader).
(setf tree-set-%compare) (writer).
tree-set-%root (reader).
(setf tree-set-%root) (writer).
tree-set-root (function).
wb-tree (function).
wb-tree (structure).
wb-tree-array (function).
wb-tree-array-intersection (function).
wb-tree-balanced-p (function).
wb-tree-builder (function).
wb-tree-compare (function).
wb-tree-concatenate (function).
wb-tree-concatenate-array (function).
wb-tree-count (function).
wb-tree-difference (function).
wb-tree-dot (function).
wb-tree-insert (function).
wb-tree-insert-max (function).
wb-tree-insert-max-array (function).
wb-tree-insert-min (function).
wb-tree-insert-min-array (function).
wb-tree-insert-vector (function).
wb-tree-intersection (function).
wb-tree-intersection-difference (function).
wb-tree-intersection-p (function).
wb-tree-intersection-tree-array (function).
wb-tree-left (function).
(setf wb-tree-left) (function).
wb-tree-list (function).
wb-tree-midpoint (function).
wb-tree-modify (function).
wb-tree-modify-vector (function).
wb-tree-p (function).
wb-tree-position (function).
wb-tree-ref (function).
wb-tree-reinsert (function).
wb-tree-reinsert-vector (function).
wb-tree-remove (function).
wb-tree-remove-max (function).
wb-tree-remove-min (function).
wb-tree-remove-position (function).
wb-tree-replace (function).
wb-tree-replace-vector (function).
wb-tree-right (function).
(setf wb-tree-right) (function).
wb-tree-serialize (function).
wb-tree-smaller (function).
wb-tree-split (function).
wb-tree-subset (function).
wb-tree-union (function).
wb-tree-union-array (function).
wb-tree-union-tree-vector (function).
wb-tree-value (function).
(setf wb-tree-value) (function).
wb-tree-weight (reader).
(setf wb-tree-weight) (writer).
with-array-tree (macro).
with-map-key (macro).
with-temp-wb-array (macro).
with-wb-tree (macro).
with-wb-tree-split (macro).
with-wb-trees (macro).
Definitions are sorted by export status, category, package, and then by lexicographic order.
How to print ropes, one of (or :rope :string :structure)
Short-circuit evaluatation of arguments, returning the first one that is nonzero.
Insert KEY=>VALUE into the tree map at PLACE, store at place.
Insert INTER into the tree set at PLACE, store at PLACE.
Create a temprary array and attempt to stack allocate if size is below dynamic-extent-limit.
Evaluate all forms in body, computing the real and run time.
Returns: (values ‘(progn ,@body) RUN-TIME REAL-TIME)
Construct a rope from FIRST and SECOND. FIRST: an object of rope or sequence type SECOND: an object of rope or sequence type RETURNS: a rope concatenating FIRST and SECOND
Returns a hash-map from keys and values of association list ‘ALIST’
Returns a tree-map containing the keys and values of the association list ALIST.
Remove first element of QUEUE. RETURNS: (VALUES new-queue element)
Add ELEMENT to QUEUE. RETURNS: new-queue
Create an amortized queue of ARGS.
Is the queue empty?
Return an inorder list of elements in QUEUE.
Add ELEMENT to the front of QUEUE.
Compare bitvectors ‘A’ and ‘B’.
Compare two doubles
Create a new empty hash-map.
Create a new empty tree-map.
Create a new empty tree-set.
Compare two fixnums
Fold ‘FUNCTION’ over members of the ‘HASH-MAP’
FUNCTION: (FUNCTION (initial-value key value)) -> initial-value
Fold ‘FUNCTION’ over members of the ‘HASH-MAP’ FUNCTION: (FUNCTION (initial-value key)) -> initial-value
Fold ‘FUNCTION’ over members of the ‘HASH-MAP’ FUNCTION: (FUNCTION (initial-value value)) -> initial-value
Fold ‘FUNCTION’ over every element of ‘SET’.
FUNCTION: (lambda (initial-value element)) -> next-initial-value.
INITIAL-VALUE: value passed as first argument to initial call to ‘FUNCTION’.
SET: a hash-set whose elements are past as the second argument in each call to ‘FUNCTION’.
Fold ‘FUNCTION’ over each sequence in ‘SEQUENCES’.
Fold ‘FUNCTION’ over every element of ‘SET’.
FUNCTION: (lambda (element initial-value)) -> next-initial-value.
SET: a hash-set whose elements are past as the first argument in each call to ‘FUNCTION’.
INITIAL-VALUE: value passed as second argument to initial call to ‘FUNCTION’.
Fold FUNCTION over members of the map
FUNCTION: (FUNCTION initial-value key value) -> initial-value
Fold FUNCTION over every element of SET.
Return an association list of all elements in the hash-map.
Test if a ‘KEY’ is present in ‘HASH-MAP’
Find value indexed by ‘KEY’ in ‘HASH-MAP’
RETURNS: (values VALUE T) if ‘KEY’ is in ‘HASH-MAP’, or
(values DEFAULT NIL) if ‘KEY’ is not in ‘HASH-MAP’.
Returns a hash table containing the keys and values of ‘HASH-MAP’. Hash table is initialized using the HASH-TABLE-INITARGS.
Insert ‘KEY’=>‘VALUE’ into ‘HASH-MAP’, returning the new hash-map.
Remove ‘KEY’ from ‘HASH-MAP’, returning the new hash-map.
Difference of ‘SET-1’ and ‘SET-2’.
Test if ‘SET’ is empty.
RETURNS: T if ‘SET’ contains zero items, or
NIL ‘SET’ contains some items.
Search ‘SET’ for ‘ITEM’.
RETURNS: (values ITEM T) if ‘ITEM’ is in ‘SET’, or
(values DEFAULT NIL) if ‘ITEM’ is not in ‘SET’.
Insert ‘ITEM’ into ‘SET’.
Intersection of ‘SET-1’ and ‘SET-2’.
Do ‘SET-1’ and ‘SET-2’ intersect?
Return a list of elements in ‘SET’.
Remove ‘ITEM’ from ‘SET’.
Is ‘SET-1’ a subset of ‘SET-2’? RETURNS: T or NIL
Union of ‘SET-1’ and ‘SET-2’.
Returns a hash-map containing the keys and values of the hash-table ‘HASH-TABLE’.
Returns a tree-map containing the keys and values of the hash-table HASH-TABLE.
Construct a hash-set from a list of elements.
Make a new queue.
Create and return new HASH-mAP. The keywords are as follows:
:TEST
Function to compare items: (TEST key-1 key-2) -> BOOLEAN.
:HASH-FUNCTION
Function to compute hash codes:
(HASH-FUNCTION key) -> non-negative-fixnum.
If not provided, MAKE-HASH-SET will try to find a valid hash
function for TEST.
Create and return new HASH-SET. The keywords are as follows:
:TEST
Function to compare items: (TEST item-1 item-2) -> BOOLEAN.
:HASH-FUNCTION
Function to compute hash codes:
(HASH-FUNCTION item) -> non-negative-fixnum.
If not provided, MAKE-HASH-SET will try to find a valid hash
function for TEST.
:KEY
If provided, apply ‘TEST’ and ‘HASH-FUNCTION’ to ‘(FUNCALL KEY
ITEM)’.
Note 1: It is required that when (TEST ITEM-1 ITEM-2) is true, HASH-FUNCTION will return the same value for both ITEM-1 and ITEM-2.
Note 2: ANSI Common Lisp DOES NOT require #’SXHASH to return the same
value for two numbers that are #’= but of different types, or for two
objects that are #’EQUALP, but not #’EQUAL. MAKE-HASH-SET will attempt
to use implementation-specific hashing functions for those
tests. However, if either the implementation specific function is not
known to MAKE-HASH-SET or the caller is using some other TEST, then
the caller must provide a valid HASH-FUNCTION.
Create a new tree-map.
Create a new tree-set.
Apply ‘FUNCTION’ to all elements in ‘HASH-MAP’. RESULT-TYPE: (or nil ’list ’vector). FUNCTION: (FUNCTION key value) -> result
Apply ‘FUNCTION’ to all elements in ‘SET’. RESULT-TYPE: (or nil ’list ’vector) FUNCTION: (lambda (element)).
Apply FUNCTION to all elements in TREE-MAP.
ORDER: (or :inorder :preorder :postorder).
RESULT-TYPE: (or nil ’list).
FUNCTION: (FUNCTION key value) -> result
Apply FUNCTION to every element of SET.
Produce graphiz output, dispatching on type of OUTPUT.
OUTPUT: (or filename stream t nil)
FUNCTION: (lambda (stream)) => nil, prints dot text on STREAM
LANG: language output for dot, (or pdf ps eps png)
Concatenate all ropes in ARGS.
Arguments of sequence type will be flattened and concatanted into the
rope. Other non-rope arguments will be coerced to a rope type by
calling the OBJECT-ROPE generic function.
RETURNS: a rope
Compare ropes quickly.
The resulting order is not necessarily lexographic.
Compare ropes lexographically.
Return the number of characters in rope
Apply FUNCTION to each element of SEQUENCE and collect results into a rope.
FUNCTION: (lambda (x)) => ROPE
SEQUENCE: a sequence
START: initial position in SEQUENCE
END: final position in SEQUENCE
SEPARATOR: a rope to splice between the items of SEQUENCE
RETURNS: a rope
Return the parenthesized ROPE.
Convert the rope to a pathname.
Return the character at position I.
Convert the rope to a string.
Write ROPE to STREAM.
Construct a rope representing S-Expression SEXP.
SYMBOL-FUNCTION: A function to transform symbols in the rope.
(lambda (symbol)) => rope
RETURNS: a rope
Return the subrope of ROPE,
beginning with element number START
and continuing up to element number END.
START: initial element number of the subrope
END: one past the final element number of the subrope
COPY: if true, copy leaf strings
Returns an association list containging the keys and values of tree-map TREE-MAP.
Test if a key is present in tree-map
Number of elements in MAP.
Find value indexed by KEY in TREE-MAP.
Destructively insert value item into map.
Returns a hash table containing the keys and values of the tree-map TREE-MAP. Hash table is initialized using the HASH-TABLE-INITARGS.
Insert KEY=>VALUE into TREE-MAP, returning the new tree-map.
Insert all elements of ALIST into TREE-MAP
Insert all elements of HASH-TABLE into TREE-MAP
Insert all elements of OTHER-MAP into TREE-MAP
Remove KEY from TREE-MAP, returning the new tree-map.
Create a new tree-set containing all items in ARGS.
Order relation on sets.
Number of elements in SET.
Difference of SET-1 and SET-2.
Do SET-1 and SET-2 contain the same elements?
Find ITEM in SET
Destructively insert item into set.
Insert ITEM into SET.
Add item to set, unless it already exists. RETURNS: (values NEW-SET NEW-ITEM)
Intersection of SET-1 and SET-2.
Simultanously compute intersection and difference.
Do SET-1 and SET-2 intersect? RETURNS: T or NIL
Return list of elements in ‘SET’ in comparison order.
Return the greatest item in SET.
Is ITEM a member of SET?
Return the lest item in SET.
Return the position of ‘VALUE’ in ‘SET’ or NIL.
Return the element of ‘SET’ at position ‘SUBSCRIPT’.
Remove ITEM from SET.
Remove maximum element of SET.
Remove minimum element of SET.
Remove element of SET and position I.
Replace ITEM into SET.
Is SET-1 a subset of SET-2? RETURNS: T or NIL
Union of SET-1 and SET-2.
cgen-subscript)) ¶cgen-binop)) ¶cgen-unop-post)) ¶cgen-unop-pre)) ¶cgen-block)) ¶pathname)) ¶double-float)) ¶float)) ¶array)) ¶list)) ¶symbol)) ¶character)) ¶string)) ¶Compare VALUE to value of TREE and execute the corresponding case.
Compare VALUE to value of TREE and execute the corresponding case.
Attempt to find a hash function for TEST
Count number of unique elements between VECTOR-1 and VECTOR-2
Insert ‘value’ in order into ‘original-array’, nondestructive.
Remove VALUE from VECTOR.
Remove I’th element of VECTOR.
Insert ‘value’ in order into ‘original-array’, nondestructive.
Number of elements in TREE.
Return the node of TREE containing VALUE or NIL if not present.
left.
Return maximum (rightmost) value of TREE.
Return minimum (leftmost) value of TREE.
Return the node of TREE containing VALUE or NIL if not present.
a.
b.
op.
Return the C rope of op
Return the canonical symbol of op
a.
a.
Create an empty hash-set
Fold ‘FUNCTION’ over each value in ‘SEQUENCE’.
root.
Test if ‘ITEM’ is a member of ‘SET’ RETURNS: T if ‘ITEM’ is in ‘SET’, or NIL if ‘ITEM’ is not in ‘SET’.
root.
Right rotation then left rotation
Left rotation
Map elements of tree.
ORDER: (or :inorder :preorder :postorder)
RESULT-TYPE: (or ’list nil)
Call (OBJECT-ROPE OBJECT) and check that result is a rope
Run ‘dot’ on the output of FUNCTION.
OUTPUT: output filename
FUNCTION: (lambda (stream)) => nil, prints dot on STREAM
LANG: language output for dot, (or pdf ps eps png)
Left rotation then right rotation
Right rotation
root.
Return count of ‘KEY’ in ‘BAG’.
root.
Convert TREE to an array.
Concatenate TREE-1 and TREE-2.
Insert VALUE into TREE, returning new tree.
Modify ‘VALUE’ in ‘TREE’, returning new tree.
Return the position of ‘VALUE’ in ‘TREE’ or nil.
Return the element of ‘TREE’ at position ‘SUBSCRIPT’.
Leftmost (least) element of TREE has SUBSCRIPT of zero.
Insert VALUE into TREE, returning new tree.
Remove X from TREE, returning new tree.
Remove minimum element of TREE, returning element and tree.
Remove minimum element of TREE, returning element and tree.
Remove I’th element of TREE and return (values new-tree element).
Insert VALUE into TREE, returning new tree.
Is ‘tree-1’ shorter than ‘tree-2’?
Merge two arrays into and wb-tree
structure-object.
structure-object.
common-lisp.
sycamore::rope-length-type
0
sycamore::rope-height-type
1
sycamore:rope
sycamore:rope
sycamore-util:unsigned-fixnum
0
| Jump to: | %
(
A B C D E F G H I J L M O P R S T V W |
|---|
| Jump to: | %
(
A B C D E F G H I J L M O P R S T V W |
|---|
| Jump to: | %
*
+
A B C F H I L N O R S V W |
|---|
| Jump to: | %
*
+
A B C F H I L N O R S V W |
|---|
| Jump to: | A B C F H I M P Q R S T U W |
|---|
| Jump to: | A B C F H I M P Q R S T U W |
|---|