The sycamore Reference Manual

3.1.1 sycamore/sycamore.asd

Source

sycamore.asd.

Parent Component

sycamore (system).

ASDF Systems

sycamore.

---

3.1.2 sycamore/package.lisp

Source

sycamore.asd.

Parent Component

sycamore (system).

Packages

• sycamore-util.
• sycamore-cgen.
• sycamore.

---

3.1.3 sycamore/util.lisp

Dependency

package.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Public Interface

• 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).

Internals

• fold-1 (function).
• gsymbol-compare-atom (function).
• output-dot-file (function).
• simple-string-compare (function).
• strcat (function).
• string-compare-inline (function).
• vector-range (function).

---

3.1.4 sycamore/heap.lisp

Dependency

util.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Internals

• +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).

---

3.1.5 sycamore/queue.lisp

Dependency

util.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Public Interface

• 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).

Internals

• %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).

---

3.1.6 sycamore/array.lisp

Dependency

util.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Internals

• 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).

---

3.1.7 sycamore/binary.lisp

Dependencies

• util.lisp (file).
• array.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Internals

• 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).

---

3.1.8 sycamore/wb-tree.lisp

Dependencies

• binary.lisp (file).
• array.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Public Interface

print-object (method).

Internals

• %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-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).

---

3.1.9 sycamore/interfaces.lisp

Dependency

wb-tree.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Public Interface

• alist-tree-map (function).
• do-tree-map (macro).
• do-tree-set (macro).
• empty-tree-map (function).
• empty-tree-set (function).
• fold-tree-map (function).
• fold-tree-set (function).
• hash-table-tree-map (function).
• make-tree-map (function).
• make-tree-set (function).
• map-tree-map (function).
• map-tree-set (function).
• 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-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).

Internals

• %make-aux-tree (function).
• %make-tree-bag (function).
• %make-tree-map (function).
• %make-tree-set (function).
• %tree-bag-insert (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).
• 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).

---

3.1.10 sycamore/rope.lisp

Dependency

util.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Public Interface

• %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).

Internals

• %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).

---

3.1.11 sycamore/cgen.lisp

Dependency

rope.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Public Interface

• 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).

Internals

• %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).

---

5.1.1 Special variables

Special Variable: *rope-print* ¶

How to print ropes, one of (or :rope :string :structure)

Package

sycamore.

Source

rope.lisp.

---

5.1.2 Macros

Macro: cond-compare ((value1 value2 compare) lt-case eq-case gt-case) ¶

Package

sycamore-util.

Source

util.lisp.

Macro: do-tree-map (((key value) map &optional result) &body body) ¶

Package

sycamore.

Source

interfaces.lisp.

Macro: do-tree-set ((var set &optional result) &body body) ¶

Package

sycamore.

Source

interfaces.lisp.

Macro: if-less-eq-compare ((value1 value2 compare) lt-eq-case gt-case) ¶

Package

sycamore-util.

Source

util.lisp.

Macro: or-compare (&rest comparisons) ¶

Short-circuit evaluatation of arguments, returning the first one that is nonzero.

Package

sycamore-util.

Source

util.lisp.

Macro: tree-map-insertf (place key value) ¶

Insert KEY=>VALUE into the tree map at PLACE, store at place.

Package

sycamore.

Source

interfaces.lisp.

Macro: tree-set-insertf (place item) ¶

Insert INTER into the tree set at PLACE, store at PLACE.

Package

sycamore.

Source

interfaces.lisp.

Macro: with-temp-array ((name length &key dynamic-extent-limit) &body body) ¶

Create a temprary array and attempt to stack allocate if size is below dynamic-extent-limit.

Package

sycamore-util.

Source

util.lisp.

Macro: with-timing (&body body) ¶

Evaluate all forms in body, computing the real and run time.

Returns: (values ‘(progn ,@body) RUN-TIME REAL-TIME)

Package

sycamore-util.

Source

util.lisp.

---

5.1.3 Compiler macros

Compiler Macro: rope (&rest args) ¶

Package

sycamore.

Source

rope.lisp.

---

5.1.4 Ordinary functions

Function: %rope (first second) ¶

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

Package

sycamore.

Source

rope.lisp.

Function: alist-tree-map (alist compare) ¶

Returns a tree-map containing the keys and values of the association list ALIST.

Package

sycamore.

Source

interfaces.lisp.

Function: amortized-dequeue (queue) ¶

Remove first element of QUEUE. RETURNS: (VALUES new-queue element)

Package

sycamore.

Source

queue.lisp.

Function: amortized-enqueue (queue element) ¶

Add ELEMENT to QUEUE. RETURNS: new-queue

Package

sycamore.

Source

queue.lisp.

Function: amortized-queue (&rest args) ¶

Create an amortized queue of ARGS.

Package

sycamore.

Source

queue.lisp.

Function: amortized-queue-empty-p (queue) ¶

Is the queue empty?

Package

sycamore.

Source

queue.lisp.

Function: amortized-queue-list (queue) ¶

Return an inorder list of elements in QUEUE.

Package

sycamore.

Source

queue.lisp.

Function: amortized-queue-push (queue element) ¶

Add ELEMENT to the front of QUEUE.

Package

sycamore.

Source

queue.lisp.

Function: bit-vector-compare (a b) ¶

Compare bitvectors ‘A’ and ‘B’.

Package

sycamore-util.

Source

util.lisp.

Function: cgen-* (a0 b1) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-+ (a0 b1) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-- (a0 b1) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-/ (a0 b1) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-addr (e) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-array-initializer (values) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-assign (a b) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-assign-stmt (a b) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-block (&rest stmts) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-call (function &rest args) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-call-stmt (function &rest args) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-comment (value) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-declare (type name &optional initial-value) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-declare-array (type name values-or-size) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-declare-fun (result name args) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-defun (result name args body) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-deref (e) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-double-float (value) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-equal (a b) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-exp (e) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-identifier (rope &key case) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-if (test &rest body) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-include-local (thing) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-include-system (thing) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-line-comment (value) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-return (value) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-single-float (value) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-sizeof (arg) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-stmt (stmt) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-string (value) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-subscript (array index) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-while (test &rest body) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Function: double-compare (a b) ¶

Compare two doubles

Package

sycamore-util.

Source

util.lisp.

Function: empty-tree-map (tree-map) ¶

Create a new empty tree-map.

Package

sycamore.

Source

interfaces.lisp.

Function: empty-tree-set (tree-set) ¶

Create a new empty tree-set.

Package

sycamore.

Source

interfaces.lisp.

Function: fixnum-compare (a b) ¶

Compare two fixnums

Package

sycamore-util.

Source

util.lisp.

Function: fold (function initial-value &rest sequences) ¶

Package

sycamore-util.

Source

util.lisp.

Function: fold-n (function initial-value sequences) ¶

Fold ‘FUNCTION’ over each sequence in ‘SEQUENCES’.

Package

sycamore-util.

Source

util.lisp.

Function: fold-tree-map (function initial-value tree-map) ¶

Fold FUNCTION over members of the map FUNCTION: (lambda (accumulated-value key value)).

Package

sycamore.

Source

interfaces.lisp.

Function: fold-tree-set (function initial-value set) ¶

Fold FUNCTION over every element of SET.

Package

sycamore.

Source

interfaces.lisp.

Function: gsymbol-compare (a b) ¶

Package

sycamore-util.

Source

util.lisp.

Function: hash-table-tree-map (hash-table compare) ¶

Returns a tree-map containing the keys and values of the hash-table list HASH-TABLE.

Package

sycamore.

Source

interfaces.lisp.

Function: make-amortized-queue () ¶

Make a new queue.

Package

sycamore.

Source

queue.lisp.

Function: make-tree-map (compare) ¶

Create a new tree-map.

Package

sycamore.

Source

interfaces.lisp.

Function: make-tree-set (compare) ¶

Create a new tree-set.

Package

sycamore.

Source

interfaces.lisp.

Function: map-tree-map (order result-type function tree-map) ¶

Apply FUNCTION to all elements in TREE-MAP. ORDER: (or :inorder :preorder :postorder). RESULT-TYPE: (or nil ’list).
FUNCTION: (lambda (key value)).

Package

sycamore.

Source

interfaces.lisp.

Function: map-tree-set (result-type function set) ¶

Apply FUNCTION to every element of SET.

Package

sycamore.

Source

interfaces.lisp.

Function: output-dot (output function &key program lang) ¶

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)

Package

sycamore-util.

Source

util.lisp.

Function: output-rope (object place &key if-exists) ¶

Package

sycamore.

Source

rope.lisp.

Function: rope (&rest args) ¶

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

Package

sycamore.

Source

rope.lisp.

Function: rope-compare-fast (rope-1 rope-2) ¶

Compare ropes quickly.

The resulting order is not necessarily lexographic.

Package

sycamore.

Source

rope.lisp.

Function: rope-compare-lexographic (rope-1 rope-2) ¶

Compare ropes lexographically.

Package

sycamore.

Source

rope.lisp.

Function: rope-length (rope) ¶

Return the number of characters in rope

Package

sycamore.

Source

rope.lisp.

Function: rope-map (function sequence &key start end separator) ¶

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

Package

sycamore.

Source

rope.lisp.

Function: rope-parenthesize (rope) ¶

Return the parenthesized ROPE.

Package

sycamore.

Source

rope.lisp.

Function: rope-pathname (rope) ¶

Convert the rope to a pathname.

Package

sycamore.

Source

rope.lisp.

Function: rope-ref (rope i) ¶

Return the character at position I.

Package

sycamore.

Source

rope.lisp.

Function: rope-split (separator sequence &key start end) ¶

Package

sycamore.

Source

rope.lisp.

Function: rope-string (rope &key element-type) ¶

Convert the rope to a string.

Package

sycamore.

Source

rope.lisp.

Function: rope-write (rope &key escape stream) ¶

Write ROPE to STREAM.

Package

sycamore.

Source

rope.lisp.

Function: rope/= (rope-1 rope-2) ¶

Package

sycamore.

Source

rope.lisp.

Function: rope< (rope-1 rope-2) ¶

Package

sycamore.

Source

rope.lisp.

Function: rope<= (rope-1 rope-2) ¶

Package

sycamore.

Source

rope.lisp.

Function: rope= (rope-1 rope-2) ¶

Package

sycamore.

Source

rope.lisp.

Function: rope> (rope-1 rope-2) ¶

Package

sycamore.

Source

rope.lisp.

Function: rope>= (rope-1 rope-2) ¶

Package

sycamore.

Source

rope.lisp.

Function: ropep (object) ¶

Package

sycamore.

Source

rope.lisp.

Function: sexp-rope (sexp &key symbol-function) ¶

Construct a rope representing S-Expression SEXP.

SYMBOL-FUNCTION: A function to transform symbols in the rope. (lambda (symbol)) => rope
RETURNS: a rope

Package

sycamore.

Source

rope.lisp.

Function: string-compare (a b) ¶

Package

sycamore-util.

Source

util.lisp.

Function: subrope (rope &key start end copy) ¶

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

Package

sycamore.

Source

rope.lisp.

Function: tree-map-alist (tree-map) ¶

Returns an association list containging the keys and values of tree-map TREE-MAP.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-map-contains (tree-map key) ¶

Test if a key is present in tree-map

Package

sycamore.

Source

interfaces.lisp.

Function: tree-map-count (map) ¶

Number of elements in MAP.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-map-find (tree-map key &optional default) ¶

Find value indexed by KEY in TREE-MAP.

Package

sycamore.

Source

interfaces.lisp.

Function: (setf tree-map-find) (map key) ¶

Destructively insert value item into map.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-map-hash-table (tree-map &rest hash-table-initargs) ¶

Returns a hash table containing the keys and values of the tree-map TREE-MAP. Hash table is initialized using the HASH-TABLE-INITARGS.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-map-insert (tree-map key value) ¶

Insert KEY=>VALUE into TREE-MAP, returning the new tree-map.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-map-insert-alist (tree-map alist) ¶

Insert all elements of ALIST into TREE-MAP

Package

sycamore.

Source

interfaces.lisp.

Function: tree-map-insert-hash-table (tree-map hash-table) ¶

Insert all elements of HASH-TABLE into TREE-MAP

Package

sycamore.

Source

interfaces.lisp.

Function: tree-map-insert-map (tree-map other-map) ¶

Insert all elements of OTHER-MAP into TREE-MAP

Package

sycamore.

Source

interfaces.lisp.

Function: tree-map-keys (tree-map) ¶

Package

sycamore.

Source

interfaces.lisp.

Function: tree-map-remove (tree-map key) ¶

Insert KEY from TREE-MAP, returning the new tree-map.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-map-values (tree-map) ¶

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set (compare &rest args) ¶

Create a new tree-set containing all items in ARGS.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-compare (tree-1 tree-2) ¶

Order relation on sets.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-count (set) ¶

Number of elements in SET.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-difference (set-1 set-2) ¶

Difference of SET-1 and SET-2.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-equal-p (set-1 set-2) ¶

Do SET-1 and SET-2 contain the same elements?

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-find (set item) ¶

Find ITEM in SET

Package

sycamore.

Source

interfaces.lisp.

Function: (setf tree-set-find) (set) ¶

Destructively insert item into set.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-insert (set item) ¶

Insert ITEM into SET.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-intern (set item) ¶

Add item to set, unless it already exists. RETURNS: (values NEW-SET NEW-ITEM)

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-intersection (set-1 set-2) ¶

Intersection of SET-1 and SET-2.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-intersection-difference (tree-1 tree-2) ¶

Simultanously compute intersection and difference.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-list (set) ¶

Return list of elements in ‘SET’ in comparison order.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-max (set) ¶

Return the greatest item in SET.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-member-p (set item) ¶

Is ITEM a member of SET?

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-min (set) ¶

Return the lest item in SET.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-p (object) ¶

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-position (set value) ¶

Return the position of ‘VALUE’ in ‘SET’ or NIL.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-ref (set subscript) ¶

Return the element of ‘SET’ at position ‘SUBSCRIPT’.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-remove (set item) ¶

Remove ITEM from SET.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-remove-max (set) ¶

Remove maximum element of SET.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-remove-min (set) ¶

Remove minimum element of SET.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-remove-position (set i) ¶

Remove element of SET and position I.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-replace (set item) ¶

Replace ITEM into SET.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-subset-p (set-1 set-2) ¶

Is SET-1 as subset of SET-2?

Package

sycamore.

Source

interfaces.lisp.

Function: tree-set-union (set-1 set-2) ¶

Union of SET-1 and SET-2.

Package

sycamore.

Source

interfaces.lisp.

---

5.1.5 Generic functions

Generic Function: object-rope (object) ¶

Package

sycamore.

Source

rope.lisp.

Methods

Method: object-rope ((object cgen-subscript)) ¶

Source

cgen.lisp.

Method: object-rope ((object cgen-binop)) ¶

Source

cgen.lisp.

Method: object-rope ((object cgen-unop-post)) ¶

Source

cgen.lisp.

Method: object-rope ((object cgen-unop-pre)) ¶

Source

cgen.lisp.

Method: object-rope ((object cgen-block)) ¶

Source

cgen.lisp.

Method: object-rope (object) ¶

Method: object-rope ((object pathname)) ¶

Method: object-rope ((object double-float)) ¶

Method: object-rope ((object float)) ¶

Method: object-rope ((object array)) ¶

Method: object-rope ((object list)) ¶

Method: object-rope ((object symbol)) ¶

Method: object-rope ((object character)) ¶

Method: object-rope ((object rope-node)) ¶

Method: object-rope ((object string)) ¶

---

5.1.6 Standalone methods

Method: print-object ((object tree-set) stream) ¶

Source

interfaces.lisp.

Method: print-object ((object tree-map) stream) ¶

Source

interfaces.lisp.

Method: print-object ((obj wb-tree) stream) ¶

Source

wb-tree.lisp.

Method: print-object ((object rope-node) stream) ¶

Source

rope.lisp.

---

5.1.7 Structures

Structure: amortized-queue ¶

Package

sycamore.

Source

queue.lisp.

Direct superclasses

structure-object.

Direct slots

Slot: forward ¶

Type

list

Readers

amortized-queue-forward.

Writers

(setf amortized-queue-forward).

Slot: reverse ¶

Package

common-lisp.

Type

list

Readers

amortized-queue-reverse.

Writers

(setf amortized-queue-reverse).

Structure: cgen-block ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Direct superclasses

structure-object.

Direct methods

object-rope.

Direct slots

Slot: header ¶

Readers

cgen-block-header.

Writers

(setf cgen-block-header).

Slot: stmts ¶

Readers

cgen-block-stmts.

Writers

(setf cgen-block-stmts).

Structure: cgen-subscript ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Direct superclasses

cgen-binop.

Direct methods

object-rope.

Structure: tree-map ¶

Package

sycamore.

Source

interfaces.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots

Slot: compare ¶

Readers

tree-map-compare.

Writers

(setf tree-map-compare).

Slot: root ¶

Readers

tree-map-root.

Writers

(setf tree-map-root).

Structure: tree-set ¶

Package

sycamore.

Source

interfaces.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots

Slot: %compare ¶

Readers

tree-set-%compare.

Writers

(setf tree-set-%compare).

Slot: %root ¶

Readers

tree-set-%root.

Writers

(setf tree-set-%root).

---

5.1.8 Types

Type: rope () ¶

Package

sycamore.

Source

rope.lisp.

Type: unsigned-fixnum () ¶

Package

sycamore-util.

Source

util.lisp.

---

5.2.1 Constants

Constant: +pairing-heap-max-array-length+ ¶

Package

sycamore.

Source

heap.lisp.

Constant: +wb-tree-max-array-length+ ¶

Package

sycamore.

Source

wb-tree.lisp.

Constant: +wb-tree-min-array-length+ ¶

Package

sycamore.

Source

wb-tree.lisp.

---

5.2.2 Special variables

Special Variable: *cgen-indent* ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Special Variable: *cgen-indent-mark* ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Special Variable: *cgen-newline-indent* ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Special Variable: *wb-tree-print-depth* ¶

Package

sycamore.

Source

wb-tree.lisp.

Special Variable: *wb-tree-print-max* ¶

Package

sycamore.

Source

wb-tree.lisp.

Special Variable: +wb-tree-rebalance-log+ ¶

Package

sycamore.

Source

wb-tree.lisp.

---

5.2.3 Macros

Macro: check-wb-balance (tree) ¶

Package

sycamore.

Source

wb-tree.lisp.

Macro: cond-wb-tree-compare ((value tree compare) null-case less-case equal-case greater-case) ¶

Compare VALUE to value of TREE and execute the corresponding case.

Package

sycamore.

Source

wb-tree.lisp.

Macro: cond-wb-tree-vector-compare ((value tree compare) null-case vector-case less-case equal-case greater-case) ¶

Compare VALUE to value of TREE and execute the corresponding case.

Package

sycamore.

Source

wb-tree.lisp.

Macro: def-cgen-binop (symbol) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Macro: def-tree-set-binop (name implementation-name doc) ¶

Package

sycamore.

Source

interfaces.lisp.

Macro: def-tree-set-item-op (name implementation-name doc) ¶

Package

sycamore.

Source

interfaces.lisp.

Macro: with-array-tree ((left value right) tree &body body) ¶

Package

sycamore.

Source

array.lisp.

Macro: with-cgen-indent (&body body) ¶

Package

sycamore-cgen.

Source

cgen.lisp.

Macro: with-temp-wb-array ((var &optional size) &body body) ¶

Package

sycamore.

Source

wb-tree.lisp.

Macro: with-wb-tree ((left value right &optional count) tree &body body) ¶

Package

sycamore.

Source

wb-tree.lisp.

Macro: with-wb-tree-split ((left present right) tree x compare &body body) ¶

Package

sycamore.

Source

wb-tree.lisp.

Macro: with-wb-trees ((left1 value1 right1 &optional count1) tree1 (left2 value2 right2 &optional count2) tree2 &body body) ¶

Package

sycamore.

Source

wb-tree.lisp.

---