The sycamore Reference Manual

This is the sycamore Reference Manual, version 0.0.20120604, generated automatically by Declt version 4.0 beta 2 "William Riker" on Thu Feb 15 07:35:06 2024 GMT+0.

Table of Contents


1 Introduction


2 Systems

The main system appears first, followed by any subsystem dependency.


2.1 sycamore

A fast, purely functional data structure library

Author

Neil T. Dantam

Home Page

http://ndantam.github.io/sycamore

Source Control

https://github.com/ndantam/sycamore

License

BSD-3

Long Description

Sycamore is a purely functional data structure library in Common Lisp. It include fast, weight-balanced binary trees, set and map (dictionary) interfaces, pairing heaps, and amortized queues.

Version

0.0.20120604

Dependencies
  • cl-ppcre (system).
  • alexandria (system).
  • lisp-unit (system).
  • cl-fuzz (system).
Source

sycamore.asd.

Child Components

3 Files

Files are sorted by type and then listed depth-first from the systems components trees.


3.1 Lisp


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

3.1.3 sycamore/util.lisp

Dependency

package.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Public Interface
Internals

3.1.4 sycamore/heap.lisp

Dependency

util.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Internals

3.1.5 sycamore/queue.lisp

Dependency

util.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Public Interface
Internals

3.1.6 sycamore/array.lisp

Dependency

util.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Internals

3.1.7 sycamore/binary.lisp

Dependencies
Source

sycamore.asd.

Parent Component

sycamore (system).

Internals

3.1.8 sycamore/wb-tree.lisp

Dependencies
Source

sycamore.asd.

Parent Component

sycamore (system).

Public Interface

print-object (method).

Internals

3.1.9 sycamore/interfaces.lisp

Dependency

wb-tree.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Public Interface
Internals

3.1.10 sycamore/rope.lisp

Dependency

util.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Public Interface
Internals

3.1.11 sycamore/cgen.lisp

Dependency

rope.lisp (file).

Source

sycamore.asd.

Parent Component

sycamore (system).

Public Interface
Internals

4 Packages

Packages are listed by definition order.


4.1 sycamore-util

Source

package.lisp.

Use List
  • alexandria.
  • common-lisp.
Used By List
Public Interface
Internals

4.2 sycamore-cgen

Source

package.lisp.

Use List
Public Interface
Internals

4.3 sycamore

Source

package.lisp.

Use List
Used By List

sycamore-cgen.

Public Interface
Internals

5 Definitions

Definitions are sorted by export status, category, package, and then by lexicographic order.


5.1 Public Interface


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 Internals


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.


5.2.4 Ordinary functions

Function: %cgen-binop (op a b)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: %cgen-unop-post (a op)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: %cgen-unop-pre (op a)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: %make-amortized-queue (forward reverse)
Package

sycamore.

Source

queue.lisp.

Function: %make-aux-tree (%compare root)
Package

sycamore.

Source

interfaces.lisp.

Function: %make-tree-bag (%compare root)
Package

sycamore.

Source

interfaces.lisp.

Function: %make-tree-map (compare root)
Package

sycamore.

Source

interfaces.lisp.

Function: %make-tree-set (%compare %root)
Package

sycamore.

Source

interfaces.lisp.

Function: %make-wb-tree (weight left value right)
Package

sycamore.

Source

wb-tree.lisp.

Function: %rope-helper (rope)
Package

sycamore.

Source

rope.lisp.

Function: %tree-bag-insert (tree compare x)
Package

sycamore.

Source

interfaces.lisp.

Function: %wb-tree (&key weight left value right)
Package

sycamore.

Source

wb-tree.lisp.

Reader: amortized-queue-forward (instance)
Writer: (setf amortized-queue-forward) (instance)
Package

sycamore.

Source

queue.lisp.

Target Slot

forward.

Function: amortized-queue-p (object)
Package

sycamore.

Source

queue.lisp.

Reader: amortized-queue-reverse (instance)
Writer: (setf amortized-queue-reverse) (instance)
Package

sycamore.

Source

queue.lisp.

Target Slot

reverse.

Function: array-tree-builder (compare)
Package

sycamore.

Source

array.lisp.

Function: array-tree-compare (vector-1 vector-2 compare)
Package

sycamore.

Source

array.lisp.

Function: array-tree-count-unique (vector-1 vector-2 compare)

Count number of unique elements between VECTOR-1 and VECTOR-2

Package

sycamore.

Source

array.lisp.

Function: array-tree-insert (vector value compare)

Insert ‘value’ in order into ‘original-array’, nondestructive.

Package

sycamore.

Source

array.lisp.

Function: array-tree-insert-at (vector value i &optional start end)
Package

sycamore.

Source

array.lisp.

Function: array-tree-insert-position (vector value compare &optional start end)
Package

sycamore.

Source

array.lisp.

Function: array-tree-intersection (tree1 tree2 compare)
Package

sycamore.

Source

array.lisp.

Function: array-tree-position (vector value compare &optional start end)
Package

sycamore.

Source

array.lisp.

Function: array-tree-remove (vector value compare)

Remove VALUE from VECTOR.

Package

sycamore.

Source

array.lisp.

Function: array-tree-remove-position (vector i)

Remove I’th element of VECTOR.

Package

sycamore.

Source

array.lisp.

Function: array-tree-replace (vector value compare)

Insert ‘value’ in order into ‘original-array’, nondestructive.

Package

sycamore.

Source

array.lisp.

Function: array-tree-search (vector value compare &optional start end)
Package

sycamore.

Source

array.lisp.

Function: array-tree-set (vector value i)
Package

sycamore.

Source

array.lisp.

Function: array-tree-split (tree x compare)
Package

sycamore.

Source

array.lisp.

Function: array-tree-split-at (tree position &optional start end)
Package

sycamore.

Source

array.lisp.

Function: balance-wb-tree (left value right)
Package

sycamore.

Source

wb-tree.lisp.

Function: balance-wb-tree-array-pair (left value right)
Package

sycamore.

Source

wb-tree.lisp.

Function: balance-wb-tree-left (old-tree old-left left value right)
Package

sycamore.

Source

wb-tree.lisp.

Function: balance-wb-tree-right (old-tree old-right left value right)
Package

sycamore.

Source

wb-tree.lisp.

Function: binary-tree-compare (tree-1 tree-2 compare)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-count (tree)

Number of elements in TREE.

Package

sycamore.

Source

binary.lisp.

Function: binary-tree-depth (tree)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-dot (tree &key output node-label-function)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-equal (tree-1 tree-2 compare)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-every (predicate tree)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-find (tree value compare)

Return the node of TREE containing VALUE or NIL if not present.

Package

sycamore.

Source

binary.lisp.

Function: binary-tree-from-list (list)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-half-leaf-p (tree)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-leaf-p (tree)
Package

sycamore.

Source

binary.lisp.

Reader: binary-tree-left (instance)
Writer: (setf binary-tree-left) (instance)
Package

sycamore.

Source

binary.lisp.

Target Slot

left.

Function: binary-tree-left-left (tree)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-left-right (tree)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-max (tree)

Return maximum (rightmost) value of TREE.

Package

sycamore.

Source

binary.lisp.

Function: binary-tree-member-p (tree value compare)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-min (tree)

Return minimum (leftmost) value of TREE.

Package

sycamore.

Source

binary.lisp.

Function: binary-tree-p (object)
Package

sycamore.

Source

binary.lisp.

Reader: binary-tree-right (instance)
Writer: (setf binary-tree-right) (instance)
Package

sycamore.

Source

binary.lisp.

Target Slot

right.

Function: binary-tree-right-left (tree)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-right-right (tree)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-search-node (tree value compare)

Return the node of TREE containing VALUE or NIL if not present.

Package

sycamore.

Source

binary.lisp.

Function: binary-tree-some (predicate tree)
Package

sycamore.

Source

binary.lisp.

Reader: binary-tree-value (instance)
Writer: (setf binary-tree-value) (instance)
Package

sycamore.

Source

binary.lisp.

Target Slot

value.

Function: binary-tree-value-left (tree)
Package

sycamore.

Source

binary.lisp.

Function: binary-tree-value-right (tree)
Package

sycamore.

Source

binary.lisp.

Function: build-wb-tree (compare initial-tree elements)
Package

sycamore.

Source

wb-tree.lisp.

Function: cgen-binop (op a b)
Package

sycamore-cgen.

Source

cgen.lisp.

Reader: cgen-binop-a (instance)
Writer: (setf cgen-binop-a) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Target Slot

a.

Reader: cgen-binop-b (instance)
Writer: (setf cgen-binop-b) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Target Slot

b.

Function: cgen-binop-op (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: (setf cgen-binop-op) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-binop-p (object)
Package

sycamore-cgen.

Source

cgen.lisp.

Reader: cgen-block-header (instance)
Writer: (setf cgen-block-header) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Target Slot

header.

Function: cgen-block-p (object)
Package

sycamore-cgen.

Source

cgen.lisp.

Reader: cgen-block-stmts (instance)
Writer: (setf cgen-block-stmts) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Target Slot

stmts.

Function: cgen-call-list (function args)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-define-constant (symbol &optional value)
Package

sycamore-cgen.

Source

cgen.lisp.

Reader: cgen-op-op (instance)
Writer: (setf cgen-op-op) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Target Slot

op.

Function: cgen-op-p (object)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-op-rope (op)

Return the C rope of op

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-op-symbol (op)

Return the canonical symbol of op

Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-parenthesize (parent child)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-subscript-a (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: (setf cgen-subscript-a) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-subscript-b (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: (setf cgen-subscript-b) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-subscript-op (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: (setf cgen-subscript-op) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-subscript-p (object)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-unop-post (a op)
Package

sycamore-cgen.

Source

cgen.lisp.

Reader: cgen-unop-post-a (instance)
Writer: (setf cgen-unop-post-a) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Target Slot

a.

Function: cgen-unop-post-op (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: (setf cgen-unop-post-op) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-unop-post-p (object)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-unop-pre (op a)
Package

sycamore-cgen.

Source

cgen.lisp.

Reader: cgen-unop-pre-a (instance)
Writer: (setf cgen-unop-pre-a) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Target Slot

a.

Function: cgen-unop-pre-op (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: (setf cgen-unop-pre-op) (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: cgen-unop-pre-p (object)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: copy-amortized-queue (instance)
Package

sycamore.

Source

queue.lisp.

Function: copy-binary-tree (instance)
Package

sycamore.

Source

binary.lisp.

Function: copy-cgen-binop (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: copy-cgen-block (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: copy-cgen-op (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: copy-cgen-subscript (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: copy-cgen-unop-post (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: copy-cgen-unop-pre (instance)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: copy-pairing-heap (instance)
Package

sycamore.

Source

heap.lisp.

Function: copy-root-tree (instance)
Package

sycamore.

Source

interfaces.lisp.

Function: copy-rope-iterator (instance)
Package

sycamore.

Source

rope.lisp.

Function: copy-rope-node (instance)
Package

sycamore.

Source

rope.lisp.

Function: copy-tree-bag (instance)
Package

sycamore.

Source

interfaces.lisp.

Function: copy-tree-map (instance)
Package

sycamore.

Source

interfaces.lisp.

Function: copy-tree-set (instance)
Package

sycamore.

Source

interfaces.lisp.

Function: copy-wb-tree (instance)
Package

sycamore.

Source

wb-tree.lisp.

Function: fold-1 (function initial-value sequence)

Fold ‘FUNCTION’ over each value in ‘SEQUENCE’.

Package

sycamore-util.

Source

util.lisp.

Function: fold-binary-tree (order function initial-value tree)
Package

sycamore.

Source

binary.lisp.

Function: gsymbol-compare-atom (a b)
Package

sycamore-util.

Source

util.lisp.

Function: join-wb-tree (left value right compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: join-wb-tree-left (tree old-left left value right compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: join-wb-tree-left-right (tree old-left old-right left value right compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: join-wb-tree-right (tree old-right left value right compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: left-right-wb-tree (left value right)

Right rotation then left rotation

Package

sycamore.

Source

wb-tree.lisp.

Function: left-wb-tree (left value right)

Left rotation

Package

sycamore.

Source

wb-tree.lisp.

Function: make-aux-compare (compare)
Package

sycamore.

Source

interfaces.lisp.

Function: make-binary-tree (left value right)
Package

sycamore.

Source

binary.lisp.

Function: make-cgen-block (&key header stmts)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: make-cgen-op (&key op)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: make-cgen-subscript (&key op a b)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: make-pairing-heap (&key root next children)
Package

sycamore.

Source

heap.lisp.

Function: make-rope-iterator (&key i stack)
Package

sycamore.

Source

rope.lisp.

Function: make-rope-node (&key length height left right)
Package

sycamore.

Source

rope.lisp.

Function: make-wb-tree (left value right)
Package

sycamore.

Source

wb-tree.lisp.

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

Map elements of tree.
ORDER: (or :inorder :preorder :postorder) RESULT-TYPE: (or ’list nil)

Package

sycamore.

Source

binary.lisp.

Function: map-binary-tree-inorder (function tree)
Package

sycamore.

Source

binary.lisp.

Function: map-binary-tree-list (order function tree)
Package

sycamore.

Source

binary.lisp.

Function: map-binary-tree-nil (order function tree)
Package

sycamore.

Source

binary.lisp.

Function: map-binary-tree-postorder (function tree)
Package

sycamore.

Source

binary.lisp.

Function: map-binary-tree-preorder (function tree)
Package

sycamore.

Source

binary.lisp.

Function: object-rope-check (object)

Call (OBJECT-ROPE OBJECT) and check that result is a rope

Package

sycamore.

Source

rope.lisp.

Function: op-precedence (op)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: output-dot-file (program output function lang)

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)

Package

sycamore-util.

Source

util.lisp.

Function: pairing-heap-builder (compare)
Package

sycamore.

Source

heap.lisp.

Reader: pairing-heap-children (instance)
Writer: (setf pairing-heap-children) (instance)
Package

sycamore.

Source

heap.lisp.

Target Slot

children.

Function: pairing-heap-find-min (heap)
Package

sycamore.

Source

heap.lisp.

Function: pairing-heap-insert (heap element compare)
Package

sycamore.

Source

heap.lisp.

Function: pairing-heap-list (heap compare)
Package

sycamore.

Source

heap.lisp.

Function: pairing-heap-merge (heap1 heap2 compare &optional next)
Package

sycamore.

Source

heap.lisp.

Function: pairing-heap-merge-pairs (heaps compare)
Package

sycamore.

Source

heap.lisp.

Reader: pairing-heap-next (instance)
Writer: (setf pairing-heap-next) (instance)
Package

sycamore.

Source

heap.lisp.

Target Slot

next.

Function: pairing-heap-p (object)
Package

sycamore.

Source

heap.lisp.

Function: pairing-heap-remove-min (heap compare)
Package

sycamore.

Source

heap.lisp.

Reader: pairing-heap-root (instance)
Writer: (setf pairing-heap-root) (instance)
Package

sycamore.

Source

heap.lisp.

Target Slot

root.

Function: precedence (e)
Package

sycamore-cgen.

Source

cgen.lisp.

Function: right-left-wb-tree (left value right)

Left rotation then right rotation

Package

sycamore.

Source

wb-tree.lisp.

Function: right-wb-tree (left value right)

Right rotation

Package

sycamore.

Source

wb-tree.lisp.

Function: root-pairing-heap (root children)
Package

sycamore.

Source

heap.lisp.

Reader: root-tree-%compare (instance)
Writer: (setf root-tree-%compare) (instance)
Package

sycamore.

Source

interfaces.lisp.

Target Slot

%compare.

Function: root-tree-p (object)
Package

sycamore.

Source

interfaces.lisp.

Reader: root-tree-root (instance)
Writer: (setf root-tree-root) (instance)
Package

sycamore.

Source

interfaces.lisp.

Target Slot

root.

Function: rope-1 (rope)
Package

sycamore.

Source

rope.lisp.

Function: rope-2 (a1 a2)
Package

sycamore.

Source

rope.lisp.

Function: rope-3 (a1 a2 a3)
Package

sycamore.

Source

rope.lisp.

Function: rope-4 (a1 a2 a3 a4)
Package

sycamore.

Source

rope.lisp.

Function: rope-5 (a1 a2 a3 a4 a5)
Package

sycamore.

Source

rope.lisp.

Function: rope-6 (a1 a2 a3 a4 a5 a6)
Package

sycamore.

Source

rope.lisp.

Function: rope-7 (a1 a2 a3 a4 a5 a6 a7)
Package

sycamore.

Source

rope.lisp.

Function: rope-8 (a1 a2 a3 a4 a5 a6 a7 a8)
Package

sycamore.

Source

rope.lisp.

Function: rope-array-cat (array &key start end)
Package

sycamore.

Source

rope.lisp.

Function: rope-height (rope)

Return height of rope

Package

sycamore.

Source

rope.lisp.

Function: rope-iterator (rope)
Package

sycamore.

Source

rope.lisp.

Reader: rope-iterator-i (instance)
Writer: (setf rope-iterator-i) (instance)
Package

sycamore.

Source

rope.lisp.

Target Slot

i.

Function: rope-iterator-next (itr)
Package

sycamore.

Source

rope.lisp.

Function: rope-iterator-p (object)
Package

sycamore.

Source

rope.lisp.

Function: rope-iterator-pop (itr)
Package

sycamore.

Source

rope.lisp.

Function: rope-iterator-push (itr rope)
Package

sycamore.

Source

rope.lisp.

Reader: rope-iterator-stack (instance)
Writer: (setf rope-iterator-stack) (instance)
Package

sycamore.

Source

rope.lisp.

Target Slot

stack.

Function: rope-list-cat (list)
Package

sycamore.

Source

rope.lisp.

Reader: rope-node-height (instance)
Writer: (setf rope-node-height) (instance)
Package

sycamore.

Source

rope.lisp.

Target Slot

height.

Reader: rope-node-left (instance)
Writer: (setf rope-node-left) (instance)
Package

sycamore.

Source

rope.lisp.

Target Slot

left.

Reader: rope-node-length (instance)
Writer: (setf rope-node-length) (instance)
Package

sycamore.

Source

rope.lisp.

Target Slot

length.

Function: rope-node-p (object)
Package

sycamore.

Source

rope.lisp.

Reader: rope-node-right (instance)
Writer: (setf rope-node-right) (instance)
Package

sycamore.

Source

rope.lisp.

Target Slot

right.

Function: simple-string-compare (a b)
Package

sycamore-util.

Source

util.lisp.

Function: strcat (&rest args)
Package

sycamore-util.

Source

util.lisp.

Function: string-compare-inline (a b)
Package

sycamore-util.

Source

util.lisp.

Function: tree-bag (compare &rest args)
Package

sycamore.

Source

interfaces.lisp.

Function: tree-bag-%compare (instance)
Package

sycamore.

Source

interfaces.lisp.

Function: (setf tree-bag-%compare) (instance)
Package

sycamore.

Source

interfaces.lisp.

Function: tree-bag-count (bag key)

Return count of ‘KEY’ in ‘BAG’.

Package

sycamore.

Source

interfaces.lisp.

Function: tree-bag-decrement (value)
Package

sycamore.

Source

interfaces.lisp.

Function: tree-bag-increment (value)
Package

sycamore.

Source

interfaces.lisp.

Function: tree-bag-insert (tb x)
Package

sycamore.

Source

interfaces.lisp.

Function: tree-bag-p (object)
Package

sycamore.

Source

interfaces.lisp.

Function: tree-bag-root (instance)
Package

sycamore.

Source

interfaces.lisp.

Function: (setf tree-bag-root) (instance)
Package

sycamore.

Source

interfaces.lisp.

Reader: tree-map-compare (instance)
Writer: (setf tree-map-compare) (instance)
Package

sycamore.

Source

interfaces.lisp.

Target Slot

compare.

Function: tree-map-p (object)
Package

sycamore.

Source

interfaces.lisp.

Reader: tree-map-root (instance)
Writer: (setf tree-map-root) (instance)
Package

sycamore.

Source

interfaces.lisp.

Target Slot

root.

Reader: tree-set-%compare (instance)
Writer: (setf tree-set-%compare) (instance)
Package

sycamore.

Source

interfaces.lisp.

Target Slot

%compare.

Reader: tree-set-%root (instance)
Writer: (setf tree-set-%root) (instance)
Package

sycamore.

Source

interfaces.lisp.

Target Slot

%root.

Function: tree-set-root (set)
Package

sycamore.

Source

interfaces.lisp.

Function: vector-range (start end)
Package

sycamore-util.

Source

util.lisp.

Function: wb-tree (compare &rest elements)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-array (tree)

Convert TREE to an array.

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-array-intersection (tree1 tree2 compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-balanced-p (x)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-builder (compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-compare (tree-1 tree-2 compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-concatenate (tree-1 tree-2 compare)

Concatenate TREE-1 and TREE-2.

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-concatenate-array (left right)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-count (tree)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-difference (tree-1 tree-2 compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-dot (tree &key output)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-insert (tree value compare)

Insert VALUE into TREE, returning new tree.

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-insert-max (tree value)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-insert-max-array (tree value)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-insert-min (tree value)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-insert-min-array (tree value)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-insert-vector (tree value compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-intersection (tree-1 tree-2 compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-intersection-difference (tree-1 tree-2 compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-intersection-tree-array (tree array compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-left (instance)
Package

sycamore.

Source

wb-tree.lisp.

Function: (setf wb-tree-left) (instance)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-list (tree)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-midpoint (tree compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-modify (tree value compare modify &optional default)

Modify ‘VALUE’ in ‘TREE’, returning new tree.

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-modify-vector (tree value compare modify default)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-p (object)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-position (tree value compare)

Return the position of ‘VALUE’ in ‘TREE’ or nil.

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-ref (tree subscript)

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

Leftmost (least) element of TREE has SUBSCRIPT of zero.

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-reinsert (tree value compare)

Insert VALUE into TREE, returning new tree.

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-reinsert-vector (tree value compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-remove (tree x compare)

Remove X from TREE, returning new tree.

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-remove-max (tree)

Remove minimum element of TREE, returning element and tree.

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-remove-min (tree)

Remove minimum element of TREE, returning element and tree.

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-remove-position (tree i compare)

Remove I’th element of TREE and return (values new-tree element).

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-replace (tree value compare)

Insert VALUE into TREE, returning new tree.

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-replace-vector (tree value compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-right (instance)
Package

sycamore.

Source

wb-tree.lisp.

Function: (setf wb-tree-right) (instance)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-serialize (x)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-smaller (tree-1 tree-2)

Is ‘tree-1’ shorter than ‘tree-2’?

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-split (tree x compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-subset (tree-1 tree-2 compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-union (tree-1 tree-2 compare)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-union-array (tree-1 tree-2 compare)

Merge two arrays into and wb-tree

Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-union-tree-vector (tree vector compare &optional start end)
Package

sycamore.

Source

wb-tree.lisp.

Function: wb-tree-value (instance)
Package

sycamore.

Source

wb-tree.lisp.

Function: (setf wb-tree-value) (instance)
Package

sycamore.

Source

wb-tree.lisp.

Reader: wb-tree-weight (instance)
Writer: (setf wb-tree-weight) (instance)
Package

sycamore.

Source

wb-tree.lisp.

Target Slot

weight.


5.2.5 Structures

Structure: binary-tree
Package

sycamore.

Source

binary.lisp.

Direct superclasses

structure-object.

Direct subclasses

wb-tree.

Direct slots
Slot: left
Readers

binary-tree-left.

Writers

(setf binary-tree-left).

Slot: value
Readers

binary-tree-value.

Writers

(setf binary-tree-value).

Slot: right
Readers

binary-tree-right.

Writers

(setf binary-tree-right).

Structure: cgen-binop
Package

sycamore-cgen.

Source

cgen.lisp.

Direct superclasses

cgen-op.

Direct subclasses

cgen-subscript.

Direct methods

object-rope.

Direct slots
Slot: a
Readers

cgen-binop-a.

Writers

(setf cgen-binop-a).

Slot: b
Readers

cgen-binop-b.

Writers

(setf cgen-binop-b).

Structure: cgen-op
Package

sycamore-cgen.

Source

cgen.lisp.

Direct superclasses

structure-object.

Direct subclasses
Direct slots
Slot: op
Readers

cgen-op-op.

Writers

(setf cgen-op-op).

Structure: cgen-unop-post
Package

sycamore-cgen.

Source

cgen.lisp.

Direct superclasses

cgen-op.

Direct methods

object-rope.

Direct slots
Slot: a
Readers

cgen-unop-post-a.

Writers

(setf cgen-unop-post-a).

Structure: cgen-unop-pre
Package

sycamore-cgen.

Source

cgen.lisp.

Direct superclasses

cgen-op.

Direct methods

object-rope.

Direct slots
Slot: a
Readers

cgen-unop-pre-a.

Writers

(setf cgen-unop-pre-a).

Structure: pairing-heap
Package

sycamore.

Source

heap.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: root
Readers

pairing-heap-root.

Writers

(setf pairing-heap-root).

Slot: next
Readers

pairing-heap-next.

Writers

(setf pairing-heap-next).

Slot: children
Readers

pairing-heap-children.

Writers

(setf pairing-heap-children).

Structure: root-tree
Package

sycamore.

Source

interfaces.lisp.

Direct superclasses

structure-object.

Direct subclasses

tree-bag.

Direct slots
Slot: %compare
Readers

root-tree-%compare.

Writers

(setf root-tree-%compare).

Slot: root
Readers

root-tree-root.

Writers

(setf root-tree-root).

Structure: rope-iterator
Package

sycamore.

Source

rope.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: i
Type

alexandria:non-negative-fixnum

Initform

0

Readers

rope-iterator-i.

Writers

(setf rope-iterator-i).

Slot: stack
Type

list

Readers

rope-iterator-stack.

Writers

(setf rope-iterator-stack).

Structure: rope-node
Package

sycamore.

Source

rope.lisp.

Direct superclasses

structure-object.

Direct methods
Direct slots
Slot: length
Package

common-lisp.

Type

sycamore::rope-length-type

Initform

0

Readers

rope-node-length.

Writers

(setf rope-node-length).

Slot: height
Type

sycamore::rope-height-type

Initform

1

Readers

rope-node-height.

Writers

(setf rope-node-height).

Slot: left
Type

sycamore:rope

Readers

rope-node-left.

Writers

(setf rope-node-left).

Slot: right
Type

sycamore:rope

Readers

rope-node-right.

Writers

(setf rope-node-right).

Structure: tree-bag
Package

sycamore.

Source

interfaces.lisp.

Direct superclasses

root-tree.

Structure: wb-tree
Package

sycamore.

Source

wb-tree.lisp.

Direct superclasses

binary-tree.

Direct methods

print-object.

Direct slots
Slot: weight
Type

sycamore-util:unsigned-fixnum

Initform

0

Readers

wb-tree-weight.

Writers

(setf wb-tree-weight).


5.2.6 Types

Type: rope-height-type ()
Package

sycamore.

Source

rope.lisp.

Type: rope-length-type ()
Package

sycamore.

Source

rope.lisp.


Appendix A Indexes


A.1 Concepts


A.2 Functions

Jump to:   %   (  
A   B   C   D   E   F   G   H   I   J   L   M   O   P   R   S   T   V   W  
Index Entry  Section

%
%cgen-binop: Private ordinary functions
%cgen-unop-post: Private ordinary functions
%cgen-unop-pre: Private ordinary functions
%make-amortized-queue: Private ordinary functions
%make-aux-tree: Private ordinary functions
%make-tree-bag: Private ordinary functions
%make-tree-map: Private ordinary functions
%make-tree-set: Private ordinary functions
%make-wb-tree: Private ordinary functions
%rope: Public ordinary functions
%rope-helper: Private ordinary functions
%tree-bag-insert: Private ordinary functions
%wb-tree: Private ordinary functions

(
(setf amortized-queue-forward): Private ordinary functions
(setf amortized-queue-reverse): Private ordinary functions
(setf binary-tree-left): Private ordinary functions
(setf binary-tree-right): Private ordinary functions
(setf binary-tree-value): Private ordinary functions
(setf cgen-binop-a): Private ordinary functions
(setf cgen-binop-b): Private ordinary functions
(setf cgen-binop-op): Private ordinary functions
(setf cgen-block-header): Private ordinary functions
(setf cgen-block-stmts): Private ordinary functions
(setf cgen-op-op): Private ordinary functions
(setf cgen-subscript-a): Private ordinary functions
(setf cgen-subscript-b): Private ordinary functions
(setf cgen-subscript-op): Private ordinary functions
(setf cgen-unop-post-a): Private ordinary functions
(setf cgen-unop-post-op): Private ordinary functions
(setf cgen-unop-pre-a): Private ordinary functions
(setf cgen-unop-pre-op): Private ordinary functions
(setf pairing-heap-children): Private ordinary functions
(setf pairing-heap-next): Private ordinary functions
(setf pairing-heap-root): Private ordinary functions
(setf root-tree-%compare): Private ordinary functions
(setf root-tree-root): Private ordinary functions
(setf rope-iterator-i): Private ordinary functions
(setf rope-iterator-stack): Private ordinary functions
(setf rope-node-height): Private ordinary functions
(setf rope-node-left): Private ordinary functions
(setf rope-node-length): Private ordinary functions
(setf rope-node-right): Private ordinary functions
(setf tree-bag-%compare): Private ordinary functions
(setf tree-bag-root): Private ordinary functions
(setf tree-map-compare): Private ordinary functions
(setf tree-map-find): Public ordinary functions
(setf tree-map-root): Private ordinary functions
(setf tree-set-%compare): Private ordinary functions
(setf tree-set-%root): Private ordinary functions
(setf tree-set-find): Public ordinary functions
(setf wb-tree-left): Private ordinary functions
(setf wb-tree-right): Private ordinary functions
(setf wb-tree-value): Private ordinary functions
(setf wb-tree-weight): Private ordinary functions

A
alist-tree-map: Public ordinary functions
amortized-dequeue: Public ordinary functions
amortized-enqueue: Public ordinary functions
amortized-queue: Public ordinary functions
amortized-queue-empty-p: Public ordinary functions
amortized-queue-forward: Private ordinary functions
amortized-queue-list: Public ordinary functions
amortized-queue-p: Private ordinary functions
amortized-queue-push: Public ordinary functions
amortized-queue-reverse: Private ordinary functions
array-tree-builder: Private ordinary functions
array-tree-compare: Private ordinary functions
array-tree-count-unique: Private ordinary functions
array-tree-insert: Private ordinary functions
array-tree-insert-at: Private ordinary functions
array-tree-insert-position: Private ordinary functions
array-tree-intersection: Private ordinary functions
array-tree-position: Private ordinary functions
array-tree-remove: Private ordinary functions
array-tree-remove-position: Private ordinary functions
array-tree-replace: Private ordinary functions
array-tree-search: Private ordinary functions
array-tree-set: Private ordinary functions
array-tree-split: Private ordinary functions
array-tree-split-at: Private ordinary functions

B
balance-wb-tree: Private ordinary functions
balance-wb-tree-array-pair: Private ordinary functions
balance-wb-tree-left: Private ordinary functions
balance-wb-tree-right: Private ordinary functions
binary-tree-compare: Private ordinary functions
binary-tree-count: Private ordinary functions
binary-tree-depth: Private ordinary functions
binary-tree-dot: Private ordinary functions
binary-tree-equal: Private ordinary functions
binary-tree-every: Private ordinary functions
binary-tree-find: Private ordinary functions
binary-tree-from-list: Private ordinary functions
binary-tree-half-leaf-p: Private ordinary functions
binary-tree-leaf-p: Private ordinary functions
binary-tree-left: Private ordinary functions
binary-tree-left-left: Private ordinary functions
binary-tree-left-right: Private ordinary functions
binary-tree-max: Private ordinary functions
binary-tree-member-p: Private ordinary functions
binary-tree-min: Private ordinary functions
binary-tree-p: Private ordinary functions
binary-tree-right: Private ordinary functions
binary-tree-right-left: Private ordinary functions
binary-tree-right-right: Private ordinary functions
binary-tree-search-node: Private ordinary functions
binary-tree-some: Private ordinary functions
binary-tree-value: Private ordinary functions
binary-tree-value-left: Private ordinary functions
binary-tree-value-right: Private ordinary functions
bit-vector-compare: Public ordinary functions
build-wb-tree: Private ordinary functions

C
cgen-*: Public ordinary functions
cgen-+: Public ordinary functions
cgen--: Public ordinary functions
cgen-/: Public ordinary functions
cgen-addr: Public ordinary functions
cgen-array-initializer: Public ordinary functions
cgen-assign: Public ordinary functions
cgen-assign-stmt: Public ordinary functions
cgen-binop: Private ordinary functions
cgen-binop-a: Private ordinary functions
cgen-binop-b: Private ordinary functions
cgen-binop-op: Private ordinary functions
cgen-binop-p: Private ordinary functions
cgen-block: Public ordinary functions
cgen-block-header: Private ordinary functions
cgen-block-p: Private ordinary functions
cgen-block-stmts: Private ordinary functions
cgen-call: Public ordinary functions
cgen-call-list: Private ordinary functions
cgen-call-stmt: Public ordinary functions
cgen-comment: Public ordinary functions
cgen-declare: Public ordinary functions
cgen-declare-array: Public ordinary functions
cgen-declare-fun: Public ordinary functions
cgen-define-constant: Private ordinary functions
cgen-defun: Public ordinary functions
cgen-deref: Public ordinary functions
cgen-double-float: Public ordinary functions
cgen-equal: Public ordinary functions
cgen-exp: Public ordinary functions
cgen-identifier: Public ordinary functions
cgen-if: Public ordinary functions
cgen-include-local: Public ordinary functions
cgen-include-system: Public ordinary functions
cgen-line-comment: Public ordinary functions
cgen-op-op: Private ordinary functions
cgen-op-p: Private ordinary functions
cgen-op-rope: Private ordinary functions
cgen-op-symbol: Private ordinary functions
cgen-parenthesize: Private ordinary functions
cgen-return: Public ordinary functions
cgen-single-float: Public ordinary functions
cgen-sizeof: Public ordinary functions
cgen-stmt: Public ordinary functions
cgen-string: Public ordinary functions
cgen-subscript: Public ordinary functions
cgen-subscript-a: Private ordinary functions
cgen-subscript-b: Private ordinary functions
cgen-subscript-op: Private ordinary functions
cgen-subscript-p: Private ordinary functions
cgen-unop-post: Private ordinary functions
cgen-unop-post-a: Private ordinary functions
cgen-unop-post-op: Private ordinary functions
cgen-unop-post-p: Private ordinary functions
cgen-unop-pre: Private ordinary functions
cgen-unop-pre-a: Private ordinary functions
cgen-unop-pre-op: Private ordinary functions
cgen-unop-pre-p: Private ordinary functions
cgen-while: Public ordinary functions
check-wb-balance: Private macros
Compiler Macro, rope: Public compiler macros
cond-compare: Public macros
cond-wb-tree-compare: Private macros
cond-wb-tree-vector-compare: Private macros
copy-amortized-queue: Private ordinary functions
copy-binary-tree: Private ordinary functions
copy-cgen-binop: Private ordinary functions
copy-cgen-block: Private ordinary functions
copy-cgen-op: Private ordinary functions
copy-cgen-subscript: Private ordinary functions
copy-cgen-unop-post: Private ordinary functions
copy-cgen-unop-pre: Private ordinary functions
copy-pairing-heap: Private ordinary functions
copy-root-tree: Private ordinary functions
copy-rope-iterator: Private ordinary functions
copy-rope-node: Private ordinary functions
copy-tree-bag: Private ordinary functions
copy-tree-map: Private ordinary functions
copy-tree-set: Private ordinary functions
copy-wb-tree: Private ordinary functions

D
def-cgen-binop: Private macros
def-tree-set-binop: Private macros
def-tree-set-item-op: Private macros
do-tree-map: Public macros
do-tree-set: Public macros
double-compare: Public ordinary functions

E
empty-tree-map: Public ordinary functions
empty-tree-set: Public ordinary functions

F
fixnum-compare: Public ordinary functions
fold: Public ordinary functions
fold-1: Private ordinary functions
fold-binary-tree: Private ordinary functions
fold-n: Public ordinary functions
fold-tree-map: Public ordinary functions
fold-tree-set: Public ordinary functions
Function, %cgen-binop: Private ordinary functions
Function, %cgen-unop-post: Private ordinary functions
Function, %cgen-unop-pre: Private ordinary functions
Function, %make-amortized-queue: Private ordinary functions
Function, %make-aux-tree: Private ordinary functions
Function, %make-tree-bag: Private ordinary functions
Function, %make-tree-map: Private ordinary functions
Function, %make-tree-set: Private ordinary functions
Function, %make-wb-tree: Private ordinary functions
Function, %rope: Public ordinary functions
Function, %rope-helper: Private ordinary functions
Function, %tree-bag-insert: Private ordinary functions
Function, %wb-tree: Private ordinary functions
Function, (setf amortized-queue-forward): Private ordinary functions
Function, (setf amortized-queue-reverse): Private ordinary functions
Function, (setf binary-tree-left): Private ordinary functions
Function, (setf binary-tree-right): Private ordinary functions
Function, (setf binary-tree-value): Private ordinary functions
Function, (setf cgen-binop-a): Private ordinary functions
Function, (setf cgen-binop-b): Private ordinary functions
Function, (setf cgen-binop-op): Private ordinary functions
Function, (setf cgen-block-header): Private ordinary functions
Function, (setf cgen-block-stmts): Private ordinary functions
Function, (setf cgen-op-op): Private ordinary functions
Function, (setf cgen-subscript-a): Private ordinary functions
Function, (setf cgen-subscript-b): Private ordinary functions
Function, (setf cgen-subscript-op): Private ordinary functions
Function, (setf cgen-unop-post-a): Private ordinary functions
Function, (setf cgen-unop-post-op): Private ordinary functions
Function, (setf cgen-unop-pre-a): Private ordinary functions
Function, (setf cgen-unop-pre-op): Private ordinary functions
Function, (setf pairing-heap-children): Private ordinary functions
Function, (setf pairing-heap-next): Private ordinary functions
Function, (setf pairing-heap-root): Private ordinary functions
Function, (setf root-tree-%compare): Private ordinary functions
Function, (setf root-tree-root): Private ordinary functions
Function, (setf rope-iterator-i): Private ordinary functions
Function, (setf rope-iterator-stack): Private ordinary functions
Function, (setf rope-node-height): Private ordinary functions
Function, (setf rope-node-left): Private ordinary functions
Function, (setf rope-node-length): Private ordinary functions
Function, (setf rope-node-right): Private ordinary functions
Function, (setf tree-bag-%compare): Private ordinary functions
Function, (setf tree-bag-root): Private ordinary functions
Function, (setf tree-map-compare): Private ordinary functions
Function, (setf tree-map-find): Public ordinary functions
Function, (setf tree-map-root): Private ordinary functions
Function, (setf tree-set-%compare): Private ordinary functions
Function, (setf tree-set-%root): Private ordinary functions
Function, (setf tree-set-find): Public ordinary functions
Function, (setf wb-tree-left): Private ordinary functions
Function, (setf wb-tree-right): Private ordinary functions
Function, (setf wb-tree-value): Private ordinary functions
Function, (setf wb-tree-weight): Private ordinary functions
Function, alist-tree-map: Public ordinary functions
Function, amortized-dequeue: Public ordinary functions
Function, amortized-enqueue: Public ordinary functions
Function, amortized-queue: Public ordinary functions
Function, amortized-queue-empty-p: Public ordinary functions
Function, amortized-queue-forward: Private ordinary functions
Function, amortized-queue-list: Public ordinary functions
Function, amortized-queue-p: Private ordinary functions
Function, amortized-queue-push: Public ordinary functions
Function, amortized-queue-reverse: Private ordinary functions
Function, array-tree-builder: Private ordinary functions
Function, array-tree-compare: Private ordinary functions
Function, array-tree-count-unique: Private ordinary functions
Function, array-tree-insert: Private ordinary functions
Function, array-tree-insert-at: Private ordinary functions
Function, array-tree-insert-position: Private ordinary functions
Function, array-tree-intersection: Private ordinary functions
Function, array-tree-position: Private ordinary functions
Function, array-tree-remove: Private ordinary functions
Function, array-tree-remove-position: Private ordinary functions
Function, array-tree-replace: Private ordinary functions
Function, array-tree-search: Private ordinary functions
Function, array-tree-set: Private ordinary functions
Function, array-tree-split: Private ordinary functions
Function, array-tree-split-at: Private ordinary functions
Function, balance-wb-tree: Private ordinary functions
Function, balance-wb-tree-array-pair: Private ordinary functions
Function, balance-wb-tree-left: Private ordinary functions
Function, balance-wb-tree-right: Private ordinary functions
Function, binary-tree-compare: Private ordinary functions
Function, binary-tree-count: Private ordinary functions
Function, binary-tree-depth: Private ordinary functions
Function, binary-tree-dot: Private ordinary functions
Function, binary-tree-equal: Private ordinary functions
Function, binary-tree-every: Private ordinary functions
Function, binary-tree-find: Private ordinary functions
Function, binary-tree-from-list: Private ordinary functions
Function, binary-tree-half-leaf-p: Private ordinary functions
Function, binary-tree-leaf-p: Private ordinary functions
Function, binary-tree-left: Private ordinary functions
Function, binary-tree-left-left: Private ordinary functions
Function, binary-tree-left-right: Private ordinary functions
Function, binary-tree-max: Private ordinary functions
Function, binary-tree-member-p: Private ordinary functions
Function, binary-tree-min: Private ordinary functions
Function, binary-tree-p: Private ordinary functions
Function, binary-tree-right: Private ordinary functions
Function, binary-tree-right-left: Private ordinary functions
Function, binary-tree-right-right: Private ordinary functions
Function, binary-tree-search-node: Private ordinary functions
Function, binary-tree-some: Private ordinary functions
Function, binary-tree-value: Private ordinary functions
Function, binary-tree-value-left: Private ordinary functions
Function, binary-tree-value-right: Private ordinary functions
Function, bit-vector-compare: Public ordinary functions
Function, build-wb-tree: Private ordinary functions
Function, cgen-*: Public ordinary functions
Function, cgen-+: Public ordinary functions
Function, cgen--: Public ordinary functions
Function, cgen-/: Public ordinary functions
Function, cgen-addr: Public ordinary functions
Function, cgen-array-initializer: Public ordinary functions
Function, cgen-assign: Public ordinary functions
Function, cgen-assign-stmt: Public ordinary functions
Function, cgen-binop: Private ordinary functions
Function, cgen-binop-a: Private ordinary functions
Function, cgen-binop-b: Private ordinary functions
Function, cgen-binop-op: Private ordinary functions
Function, cgen-binop-p: Private ordinary functions
Function, cgen-block: Public ordinary functions
Function, cgen-block-header: Private ordinary functions
Function, cgen-block-p: Private ordinary functions
Function, cgen-block-stmts: Private ordinary functions
Function, cgen-call: Public ordinary functions
Function, cgen-call-list: Private ordinary functions
Function, cgen-call-stmt: Public ordinary functions
Function, cgen-comment: Public ordinary functions
Function, cgen-declare: Public ordinary functions
Function, cgen-declare-array: Public ordinary functions
Function, cgen-declare-fun: Public ordinary functions
Function, cgen-define-constant: Private ordinary functions
Function, cgen-defun: Public ordinary functions
Function, cgen-deref: Public ordinary functions
Function, cgen-double-float: Public ordinary functions
Function, cgen-equal: Public ordinary functions
Function, cgen-exp: Public ordinary functions
Function, cgen-identifier: Public ordinary functions
Function, cgen-if: Public ordinary functions
Function, cgen-include-local: Public ordinary functions
Function, cgen-include-system: Public ordinary functions
Function, cgen-line-comment: Public ordinary functions
Function, cgen-op-op: Private ordinary functions
Function, cgen-op-p: Private ordinary functions
Function, cgen-op-rope: Private ordinary functions
Function, cgen-op-symbol: Private ordinary functions
Function, cgen-parenthesize: Private ordinary functions
Function, cgen-return: Public ordinary functions
Function, cgen-single-float: Public ordinary functions
Function, cgen-sizeof: Public ordinary functions
Function, cgen-stmt: Public ordinary functions
Function, cgen-string: Public ordinary functions
Function, cgen-subscript: Public ordinary functions
Function, cgen-subscript-a: Private ordinary functions
Function, cgen-subscript-b: Private ordinary functions
Function, cgen-subscript-op: Private ordinary functions
Function, cgen-subscript-p: Private ordinary functions
Function, cgen-unop-post: Private ordinary functions
Function, cgen-unop-post-a: Private ordinary functions
Function, cgen-unop-post-op: Private ordinary functions
Function, cgen-unop-post-p: Private ordinary functions
Function, cgen-unop-pre: Private ordinary functions
Function, cgen-unop-pre-a: Private ordinary functions
Function, cgen-unop-pre-op: Private ordinary functions
Function, cgen-unop-pre-p: Private ordinary functions
Function, cgen-while: Public ordinary functions
Function, copy-amortized-queue: Private ordinary functions
Function, copy-binary-tree: Private ordinary functions
Function, copy-cgen-binop: Private ordinary functions
Function, copy-cgen-block: Private ordinary functions
Function, copy-cgen-op: Private ordinary functions
Function, copy-cgen-subscript: Private ordinary functions
Function, copy-cgen-unop-post: Private ordinary functions
Function, copy-cgen-unop-pre: Private ordinary functions
Function, copy-pairing-heap: Private ordinary functions
Function, copy-root-tree: Private ordinary functions
Function, copy-rope-iterator: Private ordinary functions
Function, copy-rope-node: Private ordinary functions
Function, copy-tree-bag: Private ordinary functions
Function, copy-tree-map: Private ordinary functions
Function, copy-tree-set: Private ordinary functions
Function, copy-wb-tree: Private ordinary functions
Function, double-compare: Public ordinary functions
Function, empty-tree-map: Public ordinary functions
Function, empty-tree-set: Public ordinary functions
Function, fixnum-compare: Public ordinary functions
Function, fold: Public ordinary functions
Function, fold-1: Private ordinary functions
Function, fold-binary-tree: Private ordinary functions
Function, fold-n: Public ordinary functions
Function, fold-tree-map: Public ordinary functions
Function, fold-tree-set: Public ordinary functions
Function, gsymbol-compare: Public ordinary functions
Function, gsymbol-compare-atom: Private ordinary functions
Function, hash-table-tree-map: Public ordinary functions
Function, join-wb-tree: Private ordinary functions
Function, join-wb-tree-left: Private ordinary functions
Function, join-wb-tree-left-right: Private ordinary functions
Function, join-wb-tree-right: Private ordinary functions
Function, left-right-wb-tree: Private ordinary functions
Function, left-wb-tree: Private ordinary functions
Function, make-amortized-queue: Public ordinary functions
Function, make-aux-compare: Private ordinary functions
Function, make-binary-tree: Private ordinary functions
Function, make-cgen-block: Private ordinary functions
Function, make-cgen-op: Private ordinary functions
Function, make-cgen-subscript: Private ordinary functions
Function, make-pairing-heap: Private ordinary functions
Function, make-rope-iterator: Private ordinary functions
Function, make-rope-node: Private ordinary functions
Function, make-tree-map: Public ordinary functions
Function, make-tree-set: Public ordinary functions
Function, make-wb-tree: Private ordinary functions
Function, map-binary-tree: Private ordinary functions
Function, map-binary-tree-inorder: Private ordinary functions
Function, map-binary-tree-list: Private ordinary functions
Function, map-binary-tree-nil: Private ordinary functions
Function, map-binary-tree-postorder: Private ordinary functions
Function, map-binary-tree-preorder: Private ordinary functions
Function, map-tree-map: Public ordinary functions
Function, map-tree-set: Public ordinary functions
Function, object-rope-check: Private ordinary functions
Function, op-precedence: Private ordinary functions
Function, output-dot: Public ordinary functions
Function, output-dot-file: Private ordinary functions
Function, output-rope: Public ordinary functions
Function, pairing-heap-builder: Private ordinary functions
Function, pairing-heap-children: Private ordinary functions
Function, pairing-heap-find-min: Private ordinary functions
Function, pairing-heap-insert: Private ordinary functions
Function, pairing-heap-list: Private ordinary functions
Function, pairing-heap-merge: Private ordinary functions
Function, pairing-heap-merge-pairs: Private ordinary functions
Function, pairing-heap-next: Private ordinary functions
Function, pairing-heap-p: Private ordinary functions
Function, pairing-heap-remove-min: Private ordinary functions
Function, pairing-heap-root: Private ordinary functions
Function, precedence: Private ordinary functions
Function, right-left-wb-tree: Private ordinary functions
Function, right-wb-tree: Private ordinary functions
Function, root-pairing-heap: Private ordinary functions
Function, root-tree-%compare: Private ordinary functions
Function, root-tree-p: Private ordinary functions
Function, root-tree-root: Private ordinary functions
Function, rope: Public ordinary functions
Function, rope-1: Private ordinary functions
Function, rope-2: Private ordinary functions
Function, rope-3: Private ordinary functions
Function, rope-4: Private ordinary functions
Function, rope-5: Private ordinary functions
Function, rope-6: Private ordinary functions
Function, rope-7: Private ordinary functions
Function, rope-8: Private ordinary functions
Function, rope-array-cat: Private ordinary functions
Function, rope-compare-fast: Public ordinary functions
Function, rope-compare-lexographic: Public ordinary functions
Function, rope-height: Private ordinary functions
Function, rope-iterator: Private ordinary functions
Function, rope-iterator-i: Private ordinary functions
Function, rope-iterator-next: Private ordinary functions
Function, rope-iterator-p: Private ordinary functions
Function, rope-iterator-pop: Private ordinary functions
Function, rope-iterator-push: Private ordinary functions
Function, rope-iterator-stack: Private ordinary functions
Function, rope-length: Public ordinary functions
Function, rope-list-cat: Private ordinary functions
Function, rope-map: Public ordinary functions
Function, rope-node-height: Private ordinary functions
Function, rope-node-left: Private ordinary functions
Function, rope-node-length: Private ordinary functions
Function, rope-node-p: Private ordinary functions
Function, rope-node-right: Private ordinary functions
Function, rope-parenthesize: Public ordinary functions
Function, rope-pathname: Public ordinary functions
Function, rope-ref: Public ordinary functions
Function, rope-split: Public ordinary functions
Function, rope-string: Public ordinary functions
Function, rope-write: Public ordinary functions
Function, rope/=: Public ordinary functions
Function, rope<: Public ordinary functions
Function, rope<=: Public ordinary functions
Function, rope=: Public ordinary functions
Function, rope>: Public ordinary functions
Function, rope>=: Public ordinary functions
Function, ropep: Public ordinary functions
Function, sexp-rope: Public ordinary functions
Function, simple-string-compare: Private ordinary functions
Function, strcat: Private ordinary functions
Function, string-compare: Public ordinary functions
Function, string-compare-inline: Private ordinary functions
Function, subrope: Public ordinary functions
Function, tree-bag: Private ordinary functions
Function, tree-bag-%compare: Private ordinary functions
Function, tree-bag-count: Private ordinary functions
Function, tree-bag-decrement: Private ordinary functions
Function, tree-bag-increment: Private ordinary functions
Function, tree-bag-insert: Private ordinary functions
Function, tree-bag-p: Private ordinary functions
Function, tree-bag-root: Private ordinary functions
Function, tree-map-alist: Public ordinary functions
Function, tree-map-compare: Private ordinary functions
Function, tree-map-contains: Public ordinary functions
Function, tree-map-count: Public ordinary functions
Function, tree-map-find: Public ordinary functions
Function, tree-map-hash-table: Public ordinary functions
Function, tree-map-insert: Public ordinary functions
Function, tree-map-insert-alist: Public ordinary functions
Function, tree-map-insert-hash-table: Public ordinary functions
Function, tree-map-insert-map: Public ordinary functions
Function, tree-map-keys: Public ordinary functions
Function, tree-map-p: Private ordinary functions
Function, tree-map-remove: Public ordinary functions
Function, tree-map-root: Private ordinary functions
Function, tree-map-values: Public ordinary functions
Function, tree-set: Public ordinary functions
Function, tree-set-%compare: Private ordinary functions
Function, tree-set-%root: Private ordinary functions
Function, tree-set-compare: Public ordinary functions
Function, tree-set-count: Public ordinary functions
Function, tree-set-difference: Public ordinary functions
Function, tree-set-equal-p: Public ordinary functions
Function, tree-set-find: Public ordinary functions
Function, tree-set-insert: Public ordinary functions
Function, tree-set-intern: Public ordinary functions
Function, tree-set-intersection: Public ordinary functions
Function, tree-set-intersection-difference: Public ordinary functions
Function, tree-set-list: Public ordinary functions
Function, tree-set-max: Public ordinary functions
Function, tree-set-member-p: Public ordinary functions
Function, tree-set-min: Public ordinary functions
Function, tree-set-p: Public ordinary functions
Function, tree-set-position: Public ordinary functions
Function, tree-set-ref: Public ordinary functions
Function, tree-set-remove: Public ordinary functions
Function, tree-set-remove-max: Public ordinary functions
Function, tree-set-remove-min: Public ordinary functions
Function, tree-set-remove-position: Public ordinary functions
Function, tree-set-replace: Public ordinary functions
Function, tree-set-root: Private ordinary functions
Function, tree-set-subset-p: Public ordinary functions
Function, tree-set-union: Public ordinary functions
Function, vector-range: Private ordinary functions
Function, wb-tree: Private ordinary functions
Function, wb-tree-array: Private ordinary functions
Function, wb-tree-array-intersection: Private ordinary functions
Function, wb-tree-balanced-p: Private ordinary functions
Function, wb-tree-builder: Private ordinary functions
Function, wb-tree-compare: Private ordinary functions
Function, wb-tree-concatenate: Private ordinary functions
Function, wb-tree-concatenate-array: Private ordinary functions
Function, wb-tree-count: Private ordinary functions
Function, wb-tree-difference: Private ordinary functions
Function, wb-tree-dot: Private ordinary functions
Function, wb-tree-insert: Private ordinary functions
Function, wb-tree-insert-max: Private ordinary functions
Function, wb-tree-insert-max-array: Private ordinary functions
Function, wb-tree-insert-min: Private ordinary functions
Function, wb-tree-insert-min-array: Private ordinary functions
Function, wb-tree-insert-vector: Private ordinary functions
Function, wb-tree-intersection: Private ordinary functions
Function, wb-tree-intersection-difference: Private ordinary functions
Function, wb-tree-intersection-tree-array: Private ordinary functions
Function, wb-tree-left: Private ordinary functions
Function, wb-tree-list: Private ordinary functions
Function, wb-tree-midpoint: Private ordinary functions
Function, wb-tree-modify: Private ordinary functions
Function, wb-tree-modify-vector: Private ordinary functions
Function, wb-tree-p: Private ordinary functions
Function, wb-tree-position: Private ordinary functions
Function, wb-tree-ref: Private ordinary functions
Function, wb-tree-reinsert: Private ordinary functions
Function, wb-tree-reinsert-vector: Private ordinary functions
Function, wb-tree-remove: Private ordinary functions
Function, wb-tree-remove-max: Private ordinary functions
Function, wb-tree-remove-min: Private ordinary functions
Function, wb-tree-remove-position: Private ordinary functions
Function, wb-tree-replace: Private ordinary functions
Function, wb-tree-replace-vector: Private ordinary functions
Function, wb-tree-right: Private ordinary functions
Function, wb-tree-serialize: Private ordinary functions
Function, wb-tree-smaller: Private ordinary functions
Function, wb-tree-split: Private ordinary functions
Function, wb-tree-subset: Private ordinary functions
Function, wb-tree-union: Private ordinary functions
Function, wb-tree-union-array: Private ordinary functions
Function, wb-tree-union-tree-vector: Private ordinary functions
Function, wb-tree-value: Private ordinary functions
Function, wb-tree-weight: Private ordinary functions

G
Generic Function, object-rope: Public generic functions
gsymbol-compare: Public ordinary functions
gsymbol-compare-atom: Private ordinary functions

H
hash-table-tree-map: Public ordinary functions

I
if-less-eq-compare: Public macros

J
join-wb-tree: Private ordinary functions
join-wb-tree-left: Private ordinary functions
join-wb-tree-left-right: Private ordinary functions
join-wb-tree-right: Private ordinary functions

L
left-right-wb-tree: Private ordinary functions
left-wb-tree: Private ordinary functions

M
Macro, check-wb-balance: Private macros
Macro, cond-compare: Public macros
Macro, cond-wb-tree-compare: Private macros
Macro, cond-wb-tree-vector-compare: Private macros
Macro, def-cgen-binop: Private macros
Macro, def-tree-set-binop: Private macros
Macro, def-tree-set-item-op: Private macros
Macro, do-tree-map: Public macros
Macro, do-tree-set: Public macros
Macro, if-less-eq-compare: Public macros
Macro, or-compare: Public macros
Macro, tree-map-insertf: Public macros
Macro, tree-set-insertf: Public macros
Macro, with-array-tree: Private macros
Macro, with-cgen-indent: Private macros
Macro, with-temp-array: Public macros
Macro, with-temp-wb-array: Private macros
Macro, with-timing: Public macros
Macro, with-wb-tree: Private macros
Macro, with-wb-tree-split: Private macros
Macro, with-wb-trees: Private macros
make-amortized-queue: Public ordinary functions
make-aux-compare: Private ordinary functions
make-binary-tree: Private ordinary functions
make-cgen-block: Private ordinary functions
make-cgen-op: Private ordinary functions
make-cgen-subscript: Private ordinary functions
make-pairing-heap: Private ordinary functions
make-rope-iterator: Private ordinary functions
make-rope-node: Private ordinary functions
make-tree-map: Public ordinary functions
make-tree-set: Public ordinary functions
make-wb-tree: Private ordinary functions
map-binary-tree: Private ordinary functions
map-binary-tree-inorder: Private ordinary functions
map-binary-tree-list: Private ordinary functions
map-binary-tree-nil: Private ordinary functions
map-binary-tree-postorder: Private ordinary functions
map-binary-tree-preorder: Private ordinary functions
map-tree-map: Public ordinary functions
map-tree-set: Public ordinary functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, object-rope: Public generic functions
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods

O
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope: Public generic functions
object-rope-check: Private ordinary functions
op-precedence: Private ordinary functions
or-compare: Public macros
output-dot: Public ordinary functions
output-dot-file: Private ordinary functions
output-rope: Public ordinary functions

P
pairing-heap-builder: Private ordinary functions
pairing-heap-children: Private ordinary functions
pairing-heap-find-min: Private ordinary functions
pairing-heap-insert: Private ordinary functions
pairing-heap-list: Private ordinary functions
pairing-heap-merge: Private ordinary functions
pairing-heap-merge-pairs: Private ordinary functions
pairing-heap-next: Private ordinary functions
pairing-heap-p: Private ordinary functions
pairing-heap-remove-min: Private ordinary functions
pairing-heap-root: Private ordinary functions
precedence: Private ordinary functions
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods

R
right-left-wb-tree: Private ordinary functions
right-wb-tree: Private ordinary functions
root-pairing-heap: Private ordinary functions
root-tree-%compare: Private ordinary functions
root-tree-p: Private ordinary functions
root-tree-root: Private ordinary functions
rope: Public compiler macros
rope: Public ordinary functions
rope-1: Private ordinary functions
rope-2: Private ordinary functions
rope-3: Private ordinary functions
rope-4: Private ordinary functions
rope-5: Private ordinary functions
rope-6: Private ordinary functions
rope-7: Private ordinary functions
rope-8: Private ordinary functions
rope-array-cat: Private ordinary functions
rope-compare-fast: Public ordinary functions
rope-compare-lexographic: Public ordinary functions
rope-height: Private ordinary functions
rope-iterator: Private ordinary functions
rope-iterator-i: Private ordinary functions
rope-iterator-next: Private ordinary functions
rope-iterator-p: Private ordinary functions
rope-iterator-pop: Private ordinary functions
rope-iterator-push: Private ordinary functions
rope-iterator-stack: Private ordinary functions
rope-length: Public ordinary functions
rope-list-cat: Private ordinary functions
rope-map: Public ordinary functions
rope-node-height: Private ordinary functions
rope-node-left: Private ordinary functions
rope-node-length: Private ordinary functions
rope-node-p: Private ordinary functions
rope-node-right: Private ordinary functions
rope-parenthesize: Public ordinary functions
rope-pathname: Public ordinary functions
rope-ref: Public ordinary functions
rope-split: Public ordinary functions
rope-string: Public ordinary functions
rope-write: Public ordinary functions
rope/=: Public ordinary functions
rope<: Public ordinary functions
rope<=: Public ordinary functions
rope=: Public ordinary functions
rope>: Public ordinary functions
rope>=: Public ordinary functions
ropep: Public ordinary functions

S
sexp-rope: Public ordinary functions
simple-string-compare: Private ordinary functions
strcat: Private ordinary functions
string-compare: Public ordinary functions
string-compare-inline: Private ordinary functions
subrope: Public ordinary functions

T
tree-bag: Private ordinary functions
tree-bag-%compare: Private ordinary functions
tree-bag-count: Private ordinary functions
tree-bag-decrement: Private ordinary functions
tree-bag-increment: Private ordinary functions
tree-bag-insert: Private ordinary functions
tree-bag-p: Private ordinary functions
tree-bag-root: Private ordinary functions
tree-map-alist: Public ordinary functions
tree-map-compare: Private ordinary functions
tree-map-contains: Public ordinary functions
tree-map-count: Public ordinary functions
tree-map-find: Public ordinary functions
tree-map-hash-table: Public ordinary functions
tree-map-insert: Public ordinary functions
tree-map-insert-alist: Public ordinary functions
tree-map-insert-hash-table: Public ordinary functions
tree-map-insert-map: Public ordinary functions
tree-map-insertf: Public macros
tree-map-keys: Public ordinary functions
tree-map-p: Private ordinary functions
tree-map-remove: Public ordinary functions
tree-map-root: Private ordinary functions
tree-map-values: Public ordinary functions
tree-set: Public ordinary functions
tree-set-%compare: Private ordinary functions
tree-set-%root: Private ordinary functions
tree-set-compare: Public ordinary functions
tree-set-count: Public ordinary functions
tree-set-difference: Public ordinary functions
tree-set-equal-p: Public ordinary functions
tree-set-find: Public ordinary functions
tree-set-insert: Public ordinary functions
tree-set-insertf: Public macros
tree-set-intern: Public ordinary functions
tree-set-intersection: Public ordinary functions
tree-set-intersection-difference: Public ordinary functions
tree-set-list: Public ordinary functions
tree-set-max: Public ordinary functions
tree-set-member-p: Public ordinary functions
tree-set-min: Public ordinary functions
tree-set-p: Public ordinary functions
tree-set-position: Public ordinary functions
tree-set-ref: Public ordinary functions
tree-set-remove: Public ordinary functions
tree-set-remove-max: Public ordinary functions
tree-set-remove-min: Public ordinary functions
tree-set-remove-position: Public ordinary functions
tree-set-replace: Public ordinary functions
tree-set-root: Private ordinary functions
tree-set-subset-p: Public ordinary functions
tree-set-union: Public ordinary functions

V
vector-range: Private ordinary functions

W
wb-tree: Private ordinary functions
wb-tree-array: Private ordinary functions
wb-tree-array-intersection: Private ordinary functions
wb-tree-balanced-p: Private ordinary functions
wb-tree-builder: Private ordinary functions
wb-tree-compare: Private ordinary functions
wb-tree-concatenate: Private ordinary functions
wb-tree-concatenate-array: Private ordinary functions
wb-tree-count: Private ordinary functions
wb-tree-difference: Private ordinary functions
wb-tree-dot: Private ordinary functions
wb-tree-insert: Private ordinary functions
wb-tree-insert-max: Private ordinary functions
wb-tree-insert-max-array: Private ordinary functions
wb-tree-insert-min: Private ordinary functions
wb-tree-insert-min-array: Private ordinary functions
wb-tree-insert-vector: Private ordinary functions
wb-tree-intersection: Private ordinary functions
wb-tree-intersection-difference: Private ordinary functions
wb-tree-intersection-tree-array: Private ordinary functions
wb-tree-left: Private ordinary functions
wb-tree-list: Private ordinary functions
wb-tree-midpoint: Private ordinary functions
wb-tree-modify: Private ordinary functions
wb-tree-modify-vector: Private ordinary functions
wb-tree-p: Private ordinary functions
wb-tree-position: Private ordinary functions
wb-tree-ref: Private ordinary functions
wb-tree-reinsert: Private ordinary functions
wb-tree-reinsert-vector: Private ordinary functions
wb-tree-remove: Private ordinary functions
wb-tree-remove-max: Private ordinary functions
wb-tree-remove-min: Private ordinary functions
wb-tree-remove-position: Private ordinary functions
wb-tree-replace: Private ordinary functions
wb-tree-replace-vector: Private ordinary functions
wb-tree-right: Private ordinary functions
wb-tree-serialize: Private ordinary functions
wb-tree-smaller: Private ordinary functions
wb-tree-split: Private ordinary functions
wb-tree-subset: Private ordinary functions
wb-tree-union: Private ordinary functions
wb-tree-union-array: Private ordinary functions
wb-tree-union-tree-vector: Private ordinary functions
wb-tree-value: Private ordinary functions
wb-tree-weight: Private ordinary functions
with-array-tree: Private macros
with-cgen-indent: Private macros
with-temp-array: Public macros
with-temp-wb-array: Private macros
with-timing: Public macros
with-wb-tree: Private macros
with-wb-tree-split: Private macros
with-wb-trees: Private macros


A.3 Variables

Jump to:   %   *   +  
A   B   C   F   H   I   L   N   O   R   S   V   W  
Index Entry  Section

%
%compare: Public structures
%compare: Private structures
%root: Public structures

*
*cgen-indent*: Private special variables
*cgen-indent-mark*: Private special variables
*cgen-newline-indent*: Private special variables
*rope-print*: Public special variables
*wb-tree-print-depth*: Private special variables
*wb-tree-print-max*: Private special variables

+
+pairing-heap-max-array-length+: Private constants
+wb-tree-max-array-length+: Private constants
+wb-tree-min-array-length+: Private constants
+wb-tree-rebalance-log+: Private special variables

A
a: Private structures
a: Private structures
a: Private structures

B
b: Private structures

C
children: Private structures
compare: Public structures
Constant, +pairing-heap-max-array-length+: Private constants
Constant, +wb-tree-max-array-length+: Private constants
Constant, +wb-tree-min-array-length+: Private constants

F
forward: Public structures

H
header: Public structures
height: Private structures

I
i: Private structures

L
left: Private structures
left: Private structures
length: Private structures

N
next: Private structures

O
op: Private structures

R
reverse: Public structures
right: Private structures
right: Private structures
root: Public structures
root: Private structures
root: Private structures

S
Slot, %compare: Public structures
Slot, %compare: Private structures
Slot, %root: Public structures
Slot, a: Private structures
Slot, a: Private structures
Slot, a: Private structures
Slot, b: Private structures
Slot, children: Private structures
Slot, compare: Public structures
Slot, forward: Public structures
Slot, header: Public structures
Slot, height: Private structures
Slot, i: Private structures
Slot, left: Private structures
Slot, left: Private structures
Slot, length: Private structures
Slot, next: Private structures
Slot, op: Private structures
Slot, reverse: Public structures
Slot, right: Private structures
Slot, right: Private structures
Slot, root: Public structures
Slot, root: Private structures
Slot, root: Private structures
Slot, stack: Private structures
Slot, stmts: Public structures
Slot, value: Private structures
Slot, weight: Private structures
Special Variable, *cgen-indent*: Private special variables
Special Variable, *cgen-indent-mark*: Private special variables
Special Variable, *cgen-newline-indent*: Private special variables
Special Variable, *rope-print*: Public special variables
Special Variable, *wb-tree-print-depth*: Private special variables
Special Variable, *wb-tree-print-max*: Private special variables
Special Variable, +wb-tree-rebalance-log+: Private special variables
stack: Private structures
stmts: Public structures

V
value: Private structures

W
weight: Private structures


A.4 Data types

Jump to:   A   B   C   F   H   I   P   Q   R   S   T   U   W  
Index Entry  Section

A
amortized-queue: Public structures
array.lisp: The sycamore/array․lisp file

B
binary-tree: Private structures
binary.lisp: The sycamore/binary․lisp file

C
cgen-binop: Private structures
cgen-block: Public structures
cgen-op: Private structures
cgen-subscript: Public structures
cgen-unop-post: Private structures
cgen-unop-pre: Private structures
cgen.lisp: The sycamore/cgen․lisp file

F
File, array.lisp: The sycamore/array․lisp file
File, binary.lisp: The sycamore/binary․lisp file
File, cgen.lisp: The sycamore/cgen․lisp file
File, heap.lisp: The sycamore/heap․lisp file
File, interfaces.lisp: The sycamore/interfaces․lisp file
File, package.lisp: The sycamore/package․lisp file
File, queue.lisp: The sycamore/queue․lisp file
File, rope.lisp: The sycamore/rope․lisp file
File, sycamore.asd: The sycamore/sycamore․asd file
File, util.lisp: The sycamore/util․lisp file
File, wb-tree.lisp: The sycamore/wb-tree․lisp file

H
heap.lisp: The sycamore/heap․lisp file

I
interfaces.lisp: The sycamore/interfaces․lisp file

P
Package, sycamore: The sycamore package
Package, sycamore-cgen: The sycamore-cgen package
Package, sycamore-util: The sycamore-util package
package.lisp: The sycamore/package․lisp file
pairing-heap: Private structures

Q
queue.lisp: The sycamore/queue․lisp file

R
root-tree: Private structures
rope: Public types
rope-height-type: Private types
rope-iterator: Private structures
rope-length-type: Private types
rope-node: Private structures
rope.lisp: The sycamore/rope․lisp file

S
Structure, amortized-queue: Public structures
Structure, binary-tree: Private structures
Structure, cgen-binop: Private structures
Structure, cgen-block: Public structures
Structure, cgen-op: Private structures
Structure, cgen-subscript: Public structures
Structure, cgen-unop-post: Private structures
Structure, cgen-unop-pre: Private structures
Structure, pairing-heap: Private structures
Structure, root-tree: Private structures
Structure, rope-iterator: Private structures
Structure, rope-node: Private structures
Structure, tree-bag: Private structures
Structure, tree-map: Public structures
Structure, tree-set: Public structures
Structure, wb-tree: Private structures
sycamore: The sycamore system
sycamore: The sycamore package
sycamore-cgen: The sycamore-cgen package
sycamore-util: The sycamore-util package
sycamore.asd: The sycamore/sycamore․asd file
System, sycamore: The sycamore system

T
tree-bag: Private structures
tree-map: Public structures
tree-set: Public structures
Type, rope: Public types
Type, rope-height-type: Private types
Type, rope-length-type: Private types
Type, unsigned-fixnum: Public types

U
unsigned-fixnum: Public types
util.lisp: The sycamore/util․lisp file

W
wb-tree: Private structures
wb-tree.lisp: The sycamore/wb-tree․lisp file