The sycamore Reference Manual

Table of Contents

Next: , Previous: , Up: (dir)   [Contents][Index]

The sycamore Reference Manual

This is the sycamore Reference Manual, version 0.0.20120604, generated automatically by Declt version 2.4 patchlevel 1 "Will Decker" on Mon Jul 29 16:43:41 2019 GMT+0.


Next: , Previous: , Up: Top   [Contents][Index]

1 Introduction

SYCAMORE
========

A fast, purely functional data structure library in Common Lisp.

API Documentation: http://ndantam.github.io/sycamore

Features
========
* Fast, purely functional weight-balanced binary trees.
  - http://en.wikipedia.org/wiki/Weight-balanced_tree
  - Leaf nodes are simple-vectors, greatly reducing tree height.
* Interfaces for tree Sets and Maps (dictionaries).
* Ropes
  - http://en.wikipedia.org/wiki/Rope_(data_structure)
* Purely functional pairing heaps
  - http://en.wikipedia.org/wiki/Pairing_heap
* Purely functional amortized queue

Installation
============

* Sycamore uses ASDF (https://common-lisp.net/project/asdf/)
* See `INSTALL` file for details

Examples
========

See also `./example.lisp`

Sets
----

Define an ordering function:

    CL-USER> (defun compare (a b)
               (cond ((< a b) -1)
                     ((> a b) 1)
                     (t 0)))

    COMPARE

Create a set for integers:

    CL-USER> (sycamore:tree-set #'compare 1 2 -10 40)

    #

Insertion:

    CL-USER> (sycamore:tree-set-insert (sycamore:tree-set #'compare 1 2)
                                       0)
    #

Removal:

    CL-USER> (sycamore:tree-set-remove (sycamore:tree-set #'compare 1 2 0)
                                       0)
    #

Union operation:

    CL-USER> (sycamore:tree-set-union (sycamore:tree-set #'compare 1 2)
                                      (sycamore:tree-set #'compare 1 0 3))

    #

Intersection operation:

    CL-USER> (sycamore:tree-set-intersection (sycamore:tree-set #'compare 1 2)
                                             (sycamore:tree-set #'compare 1 0 3))

    #

Difference operation:

    CL-USER> (sycamore:tree-set-difference (sycamore:tree-set #'compare 1 2)
                                           (sycamore:tree-set #'compare 1 0 3))

    #

Map set:

    CL-USER> (sycamore:map-tree-set 'list #'1+
                                    (sycamore:tree-set #'compare 1 0 10 2))

    (1 2 3 11)

Fold set:

    CL-USER> (sycamore:fold-tree-set (lambda (list item) (cons item list))
                                     nil
                                     (sycamore:tree-set #'compare 1 0 10 2))

    (10 2 1 0)

Ropes
-----

Create a Rope:

    CL-USER> (sycamore:rope "Hello" #\Space 'World!)

    #

Also works on lists:

    CL-USER> (sycamore:rope (list "Hello" #\Space 'World!))

    #

And arrays:

    CL-USER> (sycamore:rope (vector "Hello" #\Space 'World!))

    #

Rope to string:

    CL-USER> (sycamore:rope-string (sycamore:rope "Hello" #\Space 'World!))

    "Hello WORLD!"

Print a rope:

    CL-USER> (sycamore:rope-write (sycamore:rope "Hello" #\Space 'World!)
                                  :escape nil :stream *standard-output*)

    Hello WORLD!

Alternatives
============

There are many other Common Lisp data structure libraries.  Here are a
few alternatives and their trade-offs relative to Sycamore.

FSet
----
https://common-lisp.net/project/fset/Site/FSet-CL.html

FSet implements finite sets with a CLOS-based set interface, while
Sycamore's finite sets take a parameter for a comparison function.
Both used weight-balanced trees with minor algorithmic differences.
Generic vs. explicit comparison functions is both an aesthetic and
performance issue.  FSet's generic comparison functions do not need to
be passed explicitly, while Sycamore's explicit comparison function
parameter makes it easier to compare the same type differently if
needed, e.g., lexicographic vs. fast string comparison.

Included benchmarks show that Sycamore is 30-50% faster than FSet.

CL-Containers
-------------
https://github.com/gwkkwg/cl-containers

CL-Containers is stateful/mutable/imperative, while Sycamore is
purely-functional/persistent.

Lisp Interface Library (LIL)
----------------------------
https://github.com/fare/lisp-interface-library

Lisp Interface Library (LIL) provides abstracted data structures using
Interface Passing Style, while Sycamore provides a few concrete data
structures. LIL's Interface Passing Style presumably improves
flexibility at the cost of runtime overhead and API complexity.
Sycamore's explicit data structures have low-overhead, optimized
implementations and a simple, documented API.


References
==========

* Okasaki, Chris. "Purely Functional Data Structures." Cambridge
  University Press. June 1999. ISBN: 978-0521663502.

* Boehm, H.J., Atkinson, R. and Plass, M., 1995. Ropes: an alternative
  to strings. Software: Practice and Experience, 25(12), pp.1315-1330.

* Adams, Stephen., 1992. Implementing sets efficiently in a functional
  language. University of Southampton. Tech Report CSTR 92-10.


Name
====
http://en.wikipedia.org/wiki/Platanus_occidentalis


Next: , Previous: , Up: Top   [Contents][Index]

2 Systems

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


Previous: , Up: Systems   [Contents][Index]

2.1 sycamore

Author

Neil T. Dantam

Home Page

http://ndantam.github.io/sycamore

Source Control

https://github.com/ndantam/sycamore

License

BSD-3

Description

A fast, purely functional data structure library

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
Source

sycamore.asd (file)

Components

Next: , Previous: , Up: Top   [Contents][Index]

3 Files

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


Previous: , Up: Files   [Contents][Index]

3.1 Lisp


Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.1 sycamore.asd

Location

sycamore.asd

Systems

sycamore (system)


Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.2 sycamore/package.lisp

Parent

sycamore (system)

Location

package.lisp

Packages

Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.3 sycamore/util.lisp

Dependency

package.lisp (file)

Parent

sycamore (system)

Location

util.lisp

Exported Definitions
Internal Definitions

Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.4 sycamore/heap.lisp

Dependency

util.lisp (file)

Parent

sycamore (system)

Location

heap.lisp

Internal Definitions

Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.5 sycamore/queue.lisp

Dependency

util.lisp (file)

Parent

sycamore (system)

Location

queue.lisp

Exported Definitions
Internal Definitions

Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.6 sycamore/array.lisp

Dependency

util.lisp (file)

Parent

sycamore (system)

Location

array.lisp

Internal Definitions

Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.7 sycamore/binary.lisp

Dependencies
Parent

sycamore (system)

Location

binary.lisp

Internal Definitions

Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.8 sycamore/wb-tree.lisp

Dependencies
Parent

sycamore (system)

Location

wb-tree.lisp

Internal Definitions

Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.9 sycamore/interfaces.lisp

Dependency

wb-tree.lisp (file)

Parent

sycamore (system)

Location

interfaces.lisp

Exported Definitions
Internal Definitions

Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.10 sycamore/rope.lisp

Dependency

util.lisp (file)

Parent

sycamore (system)

Location

rope.lisp

Exported Definitions
Internal Definitions

Previous: , Up: Lisp files   [Contents][Index]

3.1.11 sycamore/cgen.lisp

Dependency

rope.lisp (file)

Parent

sycamore (system)

Location

cgen.lisp

Exported Definitions
Internal Definitions

Next: , Previous: , Up: Top   [Contents][Index]

4 Packages

Packages are listed by definition order.


Next: , Previous: , Up: Packages   [Contents][Index]

4.1 sycamore-util

Source

package.lisp (file)

Use List
Used By List
Exported Definitions
Internal Definitions

Next: , Previous: , Up: Packages   [Contents][Index]

4.2 sycamore-cgen

Source

package.lisp (file)

Use List
Exported Definitions
Internal Definitions

Previous: , Up: Packages   [Contents][Index]

4.3 sycamore

Source

package.lisp (file)

Use List
Used By List

sycamore-cgen

Exported Definitions
Internal Definitions

Next: , Previous: , Up: Top   [Contents][Index]

5 Definitions

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


Next: , Previous: , Up: Definitions   [Contents][Index]

5.1 Exported definitions


Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.1 Special variables

Special Variable: *rope-print*

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

Package

sycamore

Source

rope.lisp (file)


Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.2 Macros

Macro: cond-compare (VALUE1 VALUE2 COMPARE) LT-CASE EQ-CASE GT-CASE
Package

sycamore-util

Source

util.lisp (file)

Macro: do-tree-map ((KEY VALUE) MAP &optional RESULT) &body BODY
Package

sycamore

Source

interfaces.lisp (file)

Macro: do-tree-set (VAR SET &optional RESULT) &body BODY
Package

sycamore

Source

interfaces.lisp (file)

Macro: if-less-eq-compare (VALUE1 VALUE2 COMPARE) LT-EQ-CASE GT-CASE
Package

sycamore-util

Source

util.lisp (file)

Macro: or-compare &rest COMPARISONS

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

Package

sycamore-util

Source

util.lisp (file)

Macro: tree-map-insertf PLACE KEY VALUE

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

Package

sycamore

Source

interfaces.lisp (file)

Macro: tree-set-insertf PLACE ITEM

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

Package

sycamore

Source

interfaces.lisp (file)

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 (file)

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 (file)


Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.3 Compiler macros

Compiler Macro: rope &rest ARGS
Package

sycamore

Source

rope.lisp (file)


Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.4 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 (file)

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 (file)

Function: amortized-dequeue QUEUE

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

Package

sycamore

Source

queue.lisp (file)

Function: amortized-enqueue QUEUE ELEMENT

Add ELEMENT to QUEUE. RETURNS: new-queue

Package

sycamore

Source

queue.lisp (file)

Function: amortized-queue &rest ARGS

Create an amortized queue of ARGS.

Package

sycamore

Source

queue.lisp (file)

Function: amortized-queue-empty-p QUEUE

Is the queue empty?

Package

sycamore

Source

queue.lisp (file)

Function: amortized-queue-list QUEUE

Return an inorder list of elements in QUEUE.

Package

sycamore

Source

queue.lisp (file)

Function: amortized-queue-push QUEUE ELEMENT

Add ELEMENT to the front of QUEUE.

Package

sycamore

Source

queue.lisp (file)

Function: bit-vector-compare A B

Compare bitvectors ‘A’ and ‘B’.

Package

sycamore-util

Source

util.lisp (file)

Function: cgen-* A0 B1
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-+ A0 B1
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-- A0 B1
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-/ A0 B1
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-addr E
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-array-initializer VALUES
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-assign A B
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-assign-stmt A B
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-block &rest STMTS
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-call FUNCTION &rest ARGS
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-call-stmt FUNCTION &rest ARGS
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-comment VALUE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-declare TYPE NAME &optional INITIAL-VALUE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-declare-array TYPE NAME VALUES-OR-SIZE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-declare-fun RESULT NAME ARGS
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-defun RESULT NAME ARGS BODY
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-deref E
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-double-float VALUE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-equal A B
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-exp E
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-identifier ROPE &key CASE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-if TEST &rest BODY
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-include-local THING
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-include-system THING
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-line-comment VALUE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-return VALUE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-single-float VALUE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-sizeof ARG
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-stmt STMT
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-string VALUE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-subscript ARRAY INDEX
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-while TEST &rest BODY
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: double-compare A B

Compare two doubles

Package

sycamore-util

Source

util.lisp (file)

Function: empty-tree-map TREE-MAP

Create a new empty tree-map.

Package

sycamore

Source

interfaces.lisp (file)

Function: fixnum-compare A B

Compare two fixnums

Package

sycamore-util

Source

util.lisp (file)

Function: fold FUNCTION INITIAL-VALUE &rest SEQUENCES
Package

sycamore-util

Source

util.lisp (file)

Function: fold-n FUNCTION INITIAL-VALUE SEQUENCES

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

Package

sycamore-util

Source

util.lisp (file)

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 (file)

Function: fold-tree-set FUNCTION INITIAL-VALUE SET

Fold FUNCTION over every element of SET.

Package

sycamore

Source

interfaces.lisp (file)

Function: gsymbol-compare A B
Package

sycamore-util

Source

util.lisp (file)

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 (file)

Function: make-amortized-queue ()

Make a new queue.

Package

sycamore

Source

queue.lisp (file)

Function: make-tree-map COMPARE

Create a new tree-map.

Package

sycamore

Source

interfaces.lisp (file)

Function: make-tree-set COMPARE

Create a new tree-set.

Package

sycamore

Source

interfaces.lisp (file)

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 (file)

Function: map-tree-set RESULT-TYPE FUNCTION SET

Apply FUNCTION to every element of SET.

Package

sycamore

Source

interfaces.lisp (file)

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 (file)

Function: output-rope OBJECT PLACE &key IF-EXISTS
Package

sycamore

Source

rope.lisp (file)

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 (file)

Function: rope-compare-fast ROPE-1 ROPE-2

Compare ropes quickly.

The resulting order is not necessarily lexographic.

Package

sycamore

Source

rope.lisp (file)

Function: rope-compare-lexographic ROPE-1 ROPE-2

Compare ropes lexographically.

Package

sycamore

Source

rope.lisp (file)

Function: rope-length ROPE

Return the number of characters in rope

Package

sycamore

Source

rope.lisp (file)

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 (file)

Function: rope-parenthesize ROPE

Return the parenthesized ROPE.

Package

sycamore

Source

rope.lisp (file)

Function: rope-pathname ROPE

Convert the rope to a pathname.

Package

sycamore

Source

rope.lisp (file)

Function: rope-ref ROPE I

Return the character at position I.

Package

sycamore

Source

rope.lisp (file)

Function: rope-split SEPARATOR SEQUENCE &key START END
Package

sycamore

Source

rope.lisp (file)

Function: rope-string ROPE &key ELEMENT-TYPE

Convert the rope to a string.

Package

sycamore

Source

rope.lisp (file)

Function: rope-write ROPE &key ESCAPE STREAM

Write ROPE to STREAM.

Package

sycamore

Source

rope.lisp (file)

Function: rope/= ROPE-1 ROPE-2
Package

sycamore

Source

rope.lisp (file)

Function: rope< ROPE-1 ROPE-2
Package

sycamore

Source

rope.lisp (file)

Function: rope<= ROPE-1 ROPE-2
Package

sycamore

Source

rope.lisp (file)

Function: rope= ROPE-1 ROPE-2
Package

sycamore

Source

rope.lisp (file)

Function: rope> ROPE-1 ROPE-2
Package

sycamore

Source

rope.lisp (file)

Function: rope>= ROPE-1 ROPE-2
Package

sycamore

Source

rope.lisp (file)

Function: ropep OBJECT
Package

sycamore

Source

rope.lisp (file)

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 (file)

Function: string-compare A B
Package

sycamore-util

Source

util.lisp (file)

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 (file)

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 (file)

Function: tree-map-contains TREE-MAP KEY

Test if a key is present in tree-map

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-map-count MAP

Number of elements in MAP.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-map-find TREE-MAP KEY &optional DEFAULT

Find value indexed by KEY in TREE-MAP.

Package

sycamore

Source

interfaces.lisp (file)

Writer

(setf tree-map-find) (function)

Function: (setf tree-map-find) VALUE MAP KEY

Destructively insert value item into map.

Package

sycamore

Source

interfaces.lisp (file)

Reader

tree-map-find (function)

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 (file)

Function: tree-map-insert TREE-MAP KEY VALUE

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

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-map-insert-alist TREE-MAP ALIST

Insert all elements of ALIST into TREE-MAP

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-map-insert-hash-table TREE-MAP HASH-TABLE

Insert all elements of HASH-TABLE into TREE-MAP

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-map-insert-map TREE-MAP OTHER-MAP

Insert all elements of OTHER-MAP into TREE-MAP

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-map-keys TREE-MAP
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-map-remove TREE-MAP KEY

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

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-map-values TREE-MAP
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set COMPARE &rest ARGS

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

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-compare TREE-1 TREE-2

Order relation on sets.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-count SET

Number of elements in SET.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-difference SET-1 SET-2

Difference of SET-1 and SET-2.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-equal-p SET-1 SET-2

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

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-find SET ITEM

Find ITEM in SET

Package

sycamore

Source

interfaces.lisp (file)

Writer

(setf tree-set-find) (function)

Function: (setf tree-set-find) ITEM SET

Destructively insert item into set.

Package

sycamore

Source

interfaces.lisp (file)

Reader

tree-set-find (function)

Function: tree-set-insert SET ITEM

Insert ITEM into SET.

Package

sycamore

Source

interfaces.lisp (file)

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 (file)

Function: tree-set-intersection SET-1 SET-2

Intersection of SET-1 and SET-2.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-intersection-difference TREE-1 TREE-2

Simultanously compute intersection and difference.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-list SET

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

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-max SET

Return the greatest item in SET.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-member-p SET ITEM

Is ITEM a member of SET?

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-min SET

Return the lest item in SET.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-p OBJECT
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-position SET VALUE

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

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-ref SET SUBSCRIPT

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

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-remove SET ITEM

Remove ITEM from SET.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-remove-max SET

Remove maximum element of SET.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-remove-min SET

Remove minimum element of SET.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-remove-position SET I

Remove element of SET and position I.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-replace SET ITEM

Replace ITEM into SET.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-subset-p SET-1 SET-2

Is SET-1 as subset of SET-2?

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-union SET-1 SET-2

Union of SET-1 and SET-2.

Package

sycamore

Source

interfaces.lisp (file)


Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.5 Generic functions

Generic Function: object-rope OBJECT
Package

sycamore

Source

rope.lisp (file)

Methods
Method: object-rope (OBJECT cgen-subscript)
Source

cgen.lisp (file)

Method: object-rope (OBJECT cgen-binop)
Source

cgen.lisp (file)

Method: object-rope (OBJECT cgen-unop-post)
Source

cgen.lisp (file)

Method: object-rope (OBJECT cgen-unop-pre)
Source

cgen.lisp (file)

Method: object-rope (OBJECT cgen-block)
Source

cgen.lisp (file)

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)

Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.6 Structures

Structure: amortized-queue ()
Package

sycamore

Source

queue.lisp (file)

Direct superclasses

structure-object (structure)

Direct slots
Slot: forward
Type

list

Readers

amortized-queue-forward (function)

Writers

(setf amortized-queue-forward) (function)

Slot: reverse
Type

list

Readers

amortized-queue-reverse (function)

Writers

(setf amortized-queue-reverse) (function)

Structure: cgen-block ()
Package

sycamore-cgen

Source

cgen.lisp (file)

Direct superclasses

structure-object (structure)

Direct methods

object-rope (method)

Direct slots
Slot: header
Readers

cgen-block-header (function)

Writers

(setf cgen-block-header) (function)

Slot: stmts
Readers

cgen-block-stmts (function)

Writers

(setf cgen-block-stmts) (function)

Structure: cgen-subscript ()
Package

sycamore-cgen

Source

cgen.lisp (file)

Direct superclasses

cgen-binop (structure)

Direct methods

object-rope (method)

Structure: tree-map ()
Package

sycamore

Source

interfaces.lisp (file)

Direct superclasses

structure-object (structure)

Direct methods

print-object (method)

Direct slots
Slot: compare
Readers

tree-map-compare (function)

Writers

(setf tree-map-compare) (function)

Slot: root
Readers

tree-map-root (function)

Writers

(setf tree-map-root) (function)

Structure: tree-set ()
Package

sycamore

Source

interfaces.lisp (file)

Direct superclasses

structure-object (structure)

Direct methods

print-object (method)

Direct slots
Slot: %compare
Readers

tree-set-%compare (function)

Writers

(setf tree-set-%compare) (function)

Slot: %root
Readers

tree-set-%root (function)

Writers

(setf tree-set-%root) (function)


Previous: , Up: Exported definitions   [Contents][Index]

5.1.7 Types

Type: rope ()
Package

sycamore

Source

rope.lisp (file)

Type: unsigned-fixnum ()
Package

sycamore-util

Source

util.lisp (file)


Previous: , Up: Definitions   [Contents][Index]

5.2 Internal definitions


Next: , Previous: , Up: Internal definitions   [Contents][Index]

5.2.1 Constants

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

sycamore

Source

heap.lisp (file)

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

sycamore

Source

wb-tree.lisp (file)

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

sycamore

Source

wb-tree.lisp (file)


Next: , Previous: , Up: Internal definitions   [Contents][Index]

5.2.2 Special variables

Special Variable: *cgen-indent*
Package

sycamore-cgen

Source

cgen.lisp (file)

Special Variable: *cgen-indent-mark*
Package

sycamore-cgen

Source

cgen.lisp (file)

Special Variable: *cgen-newline-indent*
Package

sycamore-cgen

Source

cgen.lisp (file)

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

sycamore

Source

wb-tree.lisp (file)

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

sycamore

Source

wb-tree.lisp (file)

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

sycamore

Source

wb-tree.lisp (file)


Next: , Previous: , Up: Internal definitions   [Contents][Index]

5.2.3 Macros

Macro: check-wb-balance TREE
Package

sycamore

Source

wb-tree.lisp (file)

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 (file)

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 (file)

Macro: def-cgen-binop SYMBOL
Package

sycamore-cgen

Source

cgen.lisp (file)

Macro: def-tree-set-binop NAME IMPLEMENTATION-NAME DOC
Package

sycamore

Source

interfaces.lisp (file)

Macro: def-tree-set-item-op NAME IMPLEMENTATION-NAME DOC
Package

sycamore

Source

interfaces.lisp (file)

Macro: with-array-tree (LEFT VALUE RIGHT) TREE &body BODY
Package

sycamore

Source

array.lisp (file)

Macro: with-cgen-indent &body BODY
Package

sycamore-cgen

Source

cgen.lisp (file)

Macro: with-temp-wb-array (VAR &optional SIZE) &body BODY
Package

sycamore

Source

wb-tree.lisp (file)

Macro: with-wb-tree (LEFT VALUE RIGHT &optional COUNT) TREE &body BODY
Package

sycamore

Source

wb-tree.lisp (file)

Macro: with-wb-tree-split (LEFT PRESENT RIGHT) TREE X COMPARE &body BODY
Package

sycamore

Source

wb-tree.lisp (file)

Macro: with-wb-trees (LEFT1 VALUE1 RIGHT1 &optional COUNT1) TREE1 (LEFT2 VALUE2 RIGHT2 &optional COUNT2) TREE2 &body BODY
Package

sycamore

Source

wb-tree.lisp (file)


Next: , Previous: , Up: Internal definitions   [Contents][Index]

5.2.4 Functions

Function: %cgen-binop OP A B
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: %cgen-unop-post A OP
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: %cgen-unop-pre OP A
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: %make-amortized-queue FORWARD REVERSE
Package

sycamore

Source

queue.lisp (file)

Function: %make-aux-tree %COMPARE ROOT
Package

sycamore

Source

interfaces.lisp (file)

Function: %make-tree-bag %COMPARE ROOT
Package

sycamore

Source

interfaces.lisp (file)

Function: %make-tree-map COMPARE ROOT
Package

sycamore

Source

interfaces.lisp (file)

Function: %make-tree-set %COMPARE %ROOT
Package

sycamore

Source

interfaces.lisp (file)

Function: %make-wb-tree WEIGHT LEFT VALUE RIGHT
Package

sycamore

Source

wb-tree.lisp (file)

Function: %rope-helper ROPE
Package

sycamore

Source

rope.lisp (file)

Function: %tree-bag-insert TREE COMPARE X
Package

sycamore

Source

interfaces.lisp (file)

Function: %wb-tree &key WEIGHT LEFT VALUE RIGHT
Package

sycamore

Source

wb-tree.lisp (file)

Function: amortized-queue-forward INSTANCE
Function: (setf amortized-queue-forward) VALUE INSTANCE
Package

sycamore

Source

queue.lisp (file)

Function: amortized-queue-p OBJECT
Package

sycamore

Source

queue.lisp (file)

Function: amortized-queue-reverse INSTANCE
Function: (setf amortized-queue-reverse) VALUE INSTANCE
Package

sycamore

Source

queue.lisp (file)

Function: array-tree-builder COMPARE
Package

sycamore

Source

array.lisp (file)

Function: array-tree-compare VECTOR-1 VECTOR-2 COMPARE
Package

sycamore

Source

array.lisp (file)

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 (file)

Function: array-tree-insert VECTOR VALUE COMPARE

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

Package

sycamore

Source

array.lisp (file)

Function: array-tree-insert-at VECTOR VALUE I &optional START END
Package

sycamore

Source

array.lisp (file)

Function: array-tree-insert-position VECTOR VALUE COMPARE &optional START END
Package

sycamore

Source

array.lisp (file)

Function: array-tree-intersection TREE1 TREE2 COMPARE
Package

sycamore

Source

array.lisp (file)

Function: array-tree-position VECTOR VALUE COMPARE &optional START END
Package

sycamore

Source

array.lisp (file)

Function: array-tree-remove VECTOR VALUE COMPARE

Remove VALUE from VECTOR.

Package

sycamore

Source

array.lisp (file)

Function: array-tree-remove-position VECTOR I

Remove I’th element of VECTOR.

Package

sycamore

Source

array.lisp (file)

Function: array-tree-replace VECTOR VALUE COMPARE

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

Package

sycamore

Source

array.lisp (file)

Function: array-tree-search VECTOR VALUE COMPARE &optional START END
Package

sycamore

Source

array.lisp (file)

Function: array-tree-set VECTOR VALUE I
Package

sycamore

Source

array.lisp (file)

Function: array-tree-split TREE X COMPARE
Package

sycamore

Source

array.lisp (file)

Function: array-tree-split-at TREE POSITION &optional START END
Package

sycamore

Source

array.lisp (file)

Function: balance-wb-tree LEFT VALUE RIGHT
Package

sycamore

Source

wb-tree.lisp (file)

Function: balance-wb-tree-array-pair LEFT VALUE RIGHT
Package

sycamore

Source

wb-tree.lisp (file)

Function: balance-wb-tree-left OLD-TREE OLD-LEFT LEFT VALUE RIGHT
Package

sycamore

Source

wb-tree.lisp (file)

Function: balance-wb-tree-right OLD-TREE OLD-RIGHT LEFT VALUE RIGHT
Package

sycamore

Source

wb-tree.lisp (file)

Function: binary-tree-compare TREE-1 TREE-2 COMPARE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-count TREE

Number of elements in TREE.

Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-depth TREE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-dot TREE &key OUTPUT NODE-LABEL-FUNCTION
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-equal TREE-1 TREE-2 COMPARE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-every PREDICATE TREE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-find TREE VALUE COMPARE

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

Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-from-list LIST
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-half-leaf-p TREE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-leaf-p TREE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-left INSTANCE
Function: (setf binary-tree-left) VALUE INSTANCE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-left-left TREE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-left-right TREE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-max TREE

Return maximum (rightmost) value of TREE.

Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-member-p TREE VALUE COMPARE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-min TREE

Return minimum (leftmost) value of TREE.

Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-p OBJECT
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-right INSTANCE
Function: (setf binary-tree-right) VALUE INSTANCE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-right-left TREE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-right-right TREE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-search-node TREE VALUE COMPARE

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

Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-some PREDICATE TREE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-value INSTANCE
Function: (setf binary-tree-value) VALUE INSTANCE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-value-left TREE
Package

sycamore

Source

binary.lisp (file)

Function: binary-tree-value-right TREE
Package

sycamore

Source

binary.lisp (file)

Function: build-wb-tree COMPARE INITIAL-TREE ELEMENTS
Package

sycamore

Source

wb-tree.lisp (file)

Function: cgen-binop OP A B
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-binop-a INSTANCE
Function: (setf cgen-binop-a) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-binop-b INSTANCE
Function: (setf cgen-binop-b) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-binop-op INSTANCE
Function: (setf cgen-binop-op) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-binop-p OBJECT
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-block-header INSTANCE
Function: (setf cgen-block-header) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-block-p OBJECT
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-block-stmts INSTANCE
Function: (setf cgen-block-stmts) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-call-list FUNCTION ARGS
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-define-constant SYMBOL &optional VALUE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-op-op INSTANCE
Function: (setf cgen-op-op) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-op-p OBJECT
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-op-rope OP

Return the C rope of op

Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-op-symbol OP

Return the canonical symbol of op

Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-parenthesize PARENT CHILD
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-subscript-a INSTANCE
Function: (setf cgen-subscript-a) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-subscript-b INSTANCE
Function: (setf cgen-subscript-b) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-subscript-op INSTANCE
Function: (setf cgen-subscript-op) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-subscript-p OBJECT
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-unop-post A OP
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-unop-post-a INSTANCE
Function: (setf cgen-unop-post-a) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-unop-post-op INSTANCE
Function: (setf cgen-unop-post-op) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-unop-post-p OBJECT
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-unop-pre OP A
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-unop-pre-a INSTANCE
Function: (setf cgen-unop-pre-a) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-unop-pre-op INSTANCE
Function: (setf cgen-unop-pre-op) VALUE INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: cgen-unop-pre-p OBJECT
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: copy-amortized-queue INSTANCE
Package

sycamore

Source

queue.lisp (file)

Function: copy-binary-tree INSTANCE
Package

sycamore

Source

binary.lisp (file)

Function: copy-cgen-binop INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: copy-cgen-block INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: copy-cgen-op INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: copy-cgen-subscript INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: copy-cgen-unop-post INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: copy-cgen-unop-pre INSTANCE
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: copy-pairing-heap INSTANCE
Package

sycamore

Source

heap.lisp (file)

Function: copy-root-tree INSTANCE
Package

sycamore

Source

interfaces.lisp (file)

Function: copy-rope-iterator INSTANCE
Package

sycamore

Source

rope.lisp (file)

Function: copy-rope-node INSTANCE
Package

sycamore

Source

rope.lisp (file)

Function: copy-tree-bag INSTANCE
Package

sycamore

Source

interfaces.lisp (file)

Function: copy-tree-map INSTANCE
Package

sycamore

Source

interfaces.lisp (file)

Function: copy-tree-set INSTANCE
Package

sycamore

Source

interfaces.lisp (file)

Function: copy-wb-tree INSTANCE
Package

sycamore

Source

wb-tree.lisp (file)

Function: fold-1 FUNCTION INITIAL-VALUE SEQUENCE

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

Package

sycamore-util

Source

util.lisp (file)

Function: fold-binary-tree ORDER FUNCTION INITIAL-VALUE TREE
Package

sycamore

Source

binary.lisp (file)

Function: gsymbol-compare-atom A B
Package

sycamore-util

Source

util.lisp (file)

Function: join-wb-tree LEFT VALUE RIGHT COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: join-wb-tree-left TREE OLD-LEFT LEFT VALUE RIGHT COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: join-wb-tree-left-right TREE OLD-LEFT OLD-RIGHT LEFT VALUE RIGHT COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: join-wb-tree-right TREE OLD-RIGHT LEFT VALUE RIGHT COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: left-right-wb-tree LEFT VALUE RIGHT

Right rotation then left rotation

Package

sycamore

Source

wb-tree.lisp (file)

Function: left-wb-tree LEFT VALUE RIGHT

Left rotation

Package

sycamore

Source

wb-tree.lisp (file)

Function: make-aux-compare COMPARE
Package

sycamore

Source

interfaces.lisp (file)

Function: make-binary-tree LEFT VALUE RIGHT
Package

sycamore

Source

binary.lisp (file)

Function: make-cgen-block &key (HEADER HEADER) (STMTS STMTS)
Package

sycamore-cgen

Source

cgen.lisp (file)

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

sycamore-cgen

Source

cgen.lisp (file)

Function: make-cgen-subscript &key (OP OP) (A A) (B B)
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: make-pairing-heap &key (ROOT ROOT) (NEXT NEXT) (CHILDREN CHILDREN)
Package

sycamore

Source

heap.lisp (file)

Function: make-rope-iterator &key (I I) (STACK STACK)
Package

sycamore

Source

rope.lisp (file)

Function: make-rope-node &key (LENGTH LENGTH) (HEIGHT HEIGHT) (LEFT LEFT) (RIGHT RIGHT)
Package

sycamore

Source

rope.lisp (file)

Function: make-wb-tree LEFT VALUE RIGHT
Package

sycamore

Source

wb-tree.lisp (file)

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 (file)

Function: map-binary-tree-inorder FUNCTION TREE
Package

sycamore

Source

binary.lisp (file)

Function: map-binary-tree-list ORDER FUNCTION TREE
Package

sycamore

Source

binary.lisp (file)

Function: map-binary-tree-nil ORDER FUNCTION TREE
Package

sycamore

Source

binary.lisp (file)

Function: map-binary-tree-postorder FUNCTION TREE
Package

sycamore

Source

binary.lisp (file)

Function: map-binary-tree-preorder FUNCTION TREE
Package

sycamore

Source

binary.lisp (file)

Function: object-rope-check OBJECT

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

Package

sycamore

Source

rope.lisp (file)

Function: op-precedence OP
Package

sycamore-cgen

Source

cgen.lisp (file)

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 (file)

Function: pairing-heap-builder COMPARE
Package

sycamore

Source

heap.lisp (file)

Function: pairing-heap-children INSTANCE
Function: (setf pairing-heap-children) VALUE INSTANCE
Package

sycamore

Source

heap.lisp (file)

Function: pairing-heap-find-min HEAP
Package

sycamore

Source

heap.lisp (file)

Function: pairing-heap-insert HEAP ELEMENT COMPARE
Package

sycamore

Source

heap.lisp (file)

Function: pairing-heap-list HEAP COMPARE
Package

sycamore

Source

heap.lisp (file)

Function: pairing-heap-merge HEAP1 HEAP2 COMPARE &optional NEXT
Package

sycamore

Source

heap.lisp (file)

Function: pairing-heap-merge-pairs HEAPS COMPARE
Package

sycamore

Source

heap.lisp (file)

Function: pairing-heap-next INSTANCE
Function: (setf pairing-heap-next) VALUE INSTANCE
Package

sycamore

Source

heap.lisp (file)

Function: pairing-heap-p OBJECT
Package

sycamore

Source

heap.lisp (file)

Function: pairing-heap-remove-min HEAP COMPARE
Package

sycamore

Source

heap.lisp (file)

Function: pairing-heap-root INSTANCE
Function: (setf pairing-heap-root) VALUE INSTANCE
Package

sycamore

Source

heap.lisp (file)

Function: precedence E
Package

sycamore-cgen

Source

cgen.lisp (file)

Function: right-left-wb-tree LEFT VALUE RIGHT

Left rotation then right rotation

Package

sycamore

Source

wb-tree.lisp (file)

Function: right-wb-tree LEFT VALUE RIGHT

Right rotation

Package

sycamore

Source

wb-tree.lisp (file)

Function: root-pairing-heap ROOT CHILDREN
Package

sycamore

Source

heap.lisp (file)

Function: root-tree-%compare INSTANCE
Function: (setf root-tree-%compare) VALUE INSTANCE
Package

sycamore

Source

interfaces.lisp (file)

Function: root-tree-p OBJECT
Package

sycamore

Source

interfaces.lisp (file)

Function: root-tree-root INSTANCE
Function: (setf root-tree-root) VALUE INSTANCE
Package

sycamore

Source

interfaces.lisp (file)

Function: rope-1 ROPE
Package

sycamore

Source

rope.lisp (file)

Function: rope-2 A1 A2
Package

sycamore

Source

rope.lisp (file)

Function: rope-3 A1 A2 A3
Package

sycamore

Source

rope.lisp (file)

Function: rope-4 A1 A2 A3 A4
Package

sycamore

Source

rope.lisp (file)

Function: rope-5 A1 A2 A3 A4 A5
Package

sycamore

Source

rope.lisp (file)

Function: rope-6 A1 A2 A3 A4 A5 A6
Package

sycamore

Source

rope.lisp (file)

Function: rope-7 A1 A2 A3 A4 A5 A6 A7
Package

sycamore

Source

rope.lisp (file)

Function: rope-8 A1 A2 A3 A4 A5 A6 A7 A8
Package

sycamore

Source

rope.lisp (file)

Function: rope-array-cat ARRAY &key START END
Package

sycamore

Source

rope.lisp (file)

Function: rope-height ROPE

Return height of rope

Package

sycamore

Source

rope.lisp (file)

Function: rope-iterator ROPE
Package

sycamore

Source

rope.lisp (file)

Function: rope-iterator-i INSTANCE
Function: (setf rope-iterator-i) VALUE INSTANCE
Package

sycamore

Source

rope.lisp (file)

Function: rope-iterator-next ITR
Package

sycamore

Source

rope.lisp (file)

Function: rope-iterator-p OBJECT
Package

sycamore

Source

rope.lisp (file)

Function: rope-iterator-pop ITR
Package

sycamore

Source

rope.lisp (file)

Function: rope-iterator-push ITR ROPE
Package

sycamore

Source

rope.lisp (file)

Function: rope-iterator-stack INSTANCE
Function: (setf rope-iterator-stack) VALUE INSTANCE
Package

sycamore

Source

rope.lisp (file)

Function: rope-list-cat LIST
Package

sycamore

Source

rope.lisp (file)

Function: rope-node-height INSTANCE
Function: (setf rope-node-height) VALUE INSTANCE
Package

sycamore

Source

rope.lisp (file)

Function: rope-node-left INSTANCE
Function: (setf rope-node-left) VALUE INSTANCE
Package

sycamore

Source

rope.lisp (file)

Function: rope-node-length INSTANCE
Function: (setf rope-node-length) VALUE INSTANCE
Package

sycamore

Source

rope.lisp (file)

Function: rope-node-p OBJECT
Package

sycamore

Source

rope.lisp (file)

Function: rope-node-right INSTANCE
Function: (setf rope-node-right) VALUE INSTANCE
Package

sycamore

Source

rope.lisp (file)

Function: simple-string-compare A B
Package

sycamore-util

Source

util.lisp (file)

Function: strcat &rest ARGS
Package

sycamore-util

Source

util.lisp (file)

Function: string-compare-inline A B
Package

sycamore-util

Source

util.lisp (file)

Function: tree-bag COMPARE &rest ARGS
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-bag-%compare INSTANCE
Function: (setf tree-bag-%compare) VALUE INSTANCE
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-bag-count BAG KEY

Return count of ‘KEY’ in ‘BAG’.

Package

sycamore

Source

interfaces.lisp (file)

Function: tree-bag-decrement VALUE
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-bag-increment VALUE
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-bag-insert TB X
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-bag-p OBJECT
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-bag-root INSTANCE
Function: (setf tree-bag-root) VALUE INSTANCE
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-map-compare INSTANCE
Function: (setf tree-map-compare) VALUE INSTANCE
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-map-p OBJECT
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-map-root INSTANCE
Function: (setf tree-map-root) VALUE INSTANCE
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-%compare INSTANCE
Function: (setf tree-set-%compare) VALUE INSTANCE
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-%root INSTANCE
Function: (setf tree-set-%root) VALUE INSTANCE
Package

sycamore

Source

interfaces.lisp (file)

Function: tree-set-root SET
Package

sycamore

Source

interfaces.lisp (file)

Function: vector-range START END
Package

sycamore-util

Source

util.lisp (file)

Function: wb-tree COMPARE &rest ELEMENTS
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-array TREE

Convert TREE to an array.

Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-array-intersection TREE1 TREE2 COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-balanced-p X
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-builder COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-compare TREE-1 TREE-2 COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-concatenate TREE-1 TREE-2 COMPARE

Concatenate TREE-1 and TREE-2.

Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-concatenate-array LEFT RIGHT
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-count TREE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-difference TREE-1 TREE-2 COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-dot TREE &key OUTPUT
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-insert TREE VALUE COMPARE

Insert VALUE into TREE, returning new tree.

Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-insert-max TREE VALUE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-insert-max-array TREE VALUE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-insert-min TREE VALUE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-insert-min-array TREE VALUE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-insert-vector TREE VALUE COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-intersection TREE-1 TREE-2 COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-intersection-difference TREE-1 TREE-2 COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-intersection-tree-array TREE ARRAY COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-left INSTANCE
Function: (setf wb-tree-left) VALUE INSTANCE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-list TREE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-midpoint TREE COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-modify TREE VALUE COMPARE MODIFY &optional DEFAULT

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

Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-modify-vector TREE VALUE COMPARE MODIFY DEFAULT
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-p OBJECT
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-position TREE VALUE COMPARE

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

Package

sycamore

Source

wb-tree.lisp (file)

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 (file)

Function: wb-tree-reinsert TREE VALUE COMPARE

Insert VALUE into TREE, returning new tree.

Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-reinsert-vector TREE VALUE COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-remove TREE X COMPARE

Remove X from TREE, returning new tree.

Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-remove-max TREE

Remove minimum element of TREE, returning element and tree.

Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-remove-min TREE

Remove minimum element of TREE, returning element and tree.

Package

sycamore

Source

wb-tree.lisp (file)

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 (file)

Function: wb-tree-replace TREE VALUE COMPARE

Insert VALUE into TREE, returning new tree.

Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-replace-vector TREE VALUE COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-right INSTANCE
Function: (setf wb-tree-right) VALUE INSTANCE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-serialize X
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-smaller TREE-1 TREE-2

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

Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-split TREE X COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-subset TREE-1 TREE-2 COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-union TREE-1 TREE-2 COMPARE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-union-array TREE-1 TREE-2 COMPARE

Merge two arrays into and wb-tree

Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-union-tree-vector TREE VECTOR COMPARE &optional START END
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-value INSTANCE
Function: (setf wb-tree-value) VALUE INSTANCE
Package

sycamore

Source

wb-tree.lisp (file)

Function: wb-tree-weight INSTANCE
Function: (setf wb-tree-weight) VALUE INSTANCE
Package

sycamore

Source

wb-tree.lisp (file)


Next: , Previous: , Up: Internal definitions   [Contents][Index]

5.2.5 Structures

Structure: binary-tree ()
Package

sycamore

Source

binary.lisp (file)

Direct superclasses

structure-object (structure)

Direct subclasses

wb-tree (structure)

Direct slots
Slot: left
Readers

binary-tree-left (function)

Writers

(setf binary-tree-left) (function)

Slot: value
Readers

binary-tree-value (function)

Writers

(setf binary-tree-value) (function)

Slot: right
Readers

binary-tree-right (function)

Writers

(setf binary-tree-right) (function)

Structure: cgen-binop ()
Package

sycamore-cgen

Source

cgen.lisp (file)

Direct superclasses

cgen-op (structure)

Direct subclasses

cgen-subscript (structure)

Direct methods

object-rope (method)

Direct slots
Slot: a
Readers

cgen-binop-a (function)

Writers

(setf cgen-binop-a) (function)

Slot: b
Readers

cgen-binop-b (function)

Writers

(setf cgen-binop-b) (function)

Structure: cgen-op ()
Package

sycamore-cgen

Source

cgen.lisp (file)

Direct superclasses

structure-object (structure)

Direct subclasses
Direct slots
Slot: op
Readers

cgen-op-op (function)

Writers

(setf cgen-op-op) (function)

Structure: cgen-unop-post ()
Package

sycamore-cgen

Source

cgen.lisp (file)

Direct superclasses

cgen-op (structure)

Direct methods

object-rope (method)

Direct slots
Slot: a
Readers

cgen-unop-post-a (function)

Writers

(setf cgen-unop-post-a) (function)

Structure: cgen-unop-pre ()
Package

sycamore-cgen

Source

cgen.lisp (file)

Direct superclasses

cgen-op (structure)

Direct methods

object-rope (method)

Direct slots
Slot: a
Readers

cgen-unop-pre-a (function)

Writers

(setf cgen-unop-pre-a) (function)

Structure: pairing-heap ()
Package

sycamore

Source

heap.lisp (file)

Direct superclasses

structure-object (structure)

Direct slots
Slot: root
Readers

pairing-heap-root (function)

Writers

(setf pairing-heap-root) (function)

Slot: next
Readers

pairing-heap-next (function)

Writers

(setf pairing-heap-next) (function)

Slot: children
Readers

pairing-heap-children (function)

Writers

(setf pairing-heap-children) (function)

Structure: root-tree ()
Package

sycamore

Source

interfaces.lisp (file)

Direct superclasses

structure-object (structure)

Direct subclasses

tree-bag (structure)

Direct slots
Slot: %compare
Readers

root-tree-%compare (function)

Writers

(setf root-tree-%compare) (function)

Slot: root
Readers

root-tree-root (function)

Writers

(setf root-tree-root) (function)

Structure: rope-iterator ()
Package

sycamore

Source

rope.lisp (file)

Direct superclasses

structure-object (structure)

Direct slots
Slot: i
Type

alexandria.1.0.0:non-negative-fixnum

Initform

0

Readers

rope-iterator-i (function)

Writers

(setf rope-iterator-i) (function)

Slot: stack
Type

list

Readers

rope-iterator-stack (function)

Writers

(setf rope-iterator-stack) (function)

Structure: rope-node ()
Package

sycamore

Source

rope.lisp (file)

Direct superclasses

structure-object (structure)

Direct methods
Direct slots
Slot: length
Type

sycamore::rope-length-type

Initform

0

Readers

rope-node-length (function)

Writers

(setf rope-node-length) (function)

Slot: height
Type

sycamore::rope-height-type

Initform

1

Readers

rope-node-height (function)

Writers

(setf rope-node-height) (function)

Slot: left
Type

sycamore:rope

Readers

rope-node-left (function)

Writers

(setf rope-node-left) (function)

Slot: right
Type

sycamore:rope

Readers

rope-node-right (function)

Writers

(setf rope-node-right) (function)

Structure: tree-bag ()
Package

sycamore

Source

interfaces.lisp (file)

Direct superclasses

root-tree (structure)

Structure: wb-tree ()
Package

sycamore

Source

wb-tree.lisp (file)

Direct superclasses

binary-tree (structure)

Direct methods

print-object (method)

Direct slots
Slot: weight
Type

sycamore-util:unsigned-fixnum

Initform

0

Readers

wb-tree-weight (function)

Writers

(setf wb-tree-weight) (function)


Previous: , Up: Internal definitions   [Contents][Index]

5.2.6 Types

Type: rope-height-type ()
Package

sycamore

Source

rope.lisp (file)

Type: rope-length-type ()
Package

sycamore

Source

rope.lisp (file)


Previous: , Up: Top   [Contents][Index]

Appendix A Indexes


Next: , Previous: , Up: Indexes   [Contents][Index]

A.1 Concepts

Jump to:   F   L   S  
Index Entry  Section

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

L
Lisp File, sycamore.asd: The sycamore<dot>asd file
Lisp File, sycamore/array.lisp: The sycamore/array<dot>lisp file
Lisp File, sycamore/binary.lisp: The sycamore/binary<dot>lisp file
Lisp File, sycamore/cgen.lisp: The sycamore/cgen<dot>lisp file
Lisp File, sycamore/heap.lisp: The sycamore/heap<dot>lisp file
Lisp File, sycamore/interfaces.lisp: The sycamore/interfaces<dot>lisp file
Lisp File, sycamore/package.lisp: The sycamore/package<dot>lisp file
Lisp File, sycamore/queue.lisp: The sycamore/queue<dot>lisp file
Lisp File, sycamore/rope.lisp: The sycamore/rope<dot>lisp file
Lisp File, sycamore/util.lisp: The sycamore/util<dot>lisp file
Lisp File, sycamore/wb-tree.lisp: The sycamore/wb-tree<dot>lisp file

S
sycamore.asd: The sycamore<dot>asd file
sycamore/array.lisp: The sycamore/array<dot>lisp file
sycamore/binary.lisp: The sycamore/binary<dot>lisp file
sycamore/cgen.lisp: The sycamore/cgen<dot>lisp file
sycamore/heap.lisp: The sycamore/heap<dot>lisp file
sycamore/interfaces.lisp: The sycamore/interfaces<dot>lisp file
sycamore/package.lisp: The sycamore/package<dot>lisp file
sycamore/queue.lisp: The sycamore/queue<dot>lisp file
sycamore/rope.lisp: The sycamore/rope<dot>lisp file
sycamore/util.lisp: The sycamore/util<dot>lisp file
sycamore/wb-tree.lisp: The sycamore/wb-tree<dot>lisp file

Jump to:   F   L   S  

Next: , Previous: , Up: Indexes   [Contents][Index]

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: Internal functions
%cgen-unop-post: Internal functions
%cgen-unop-pre: Internal functions
%make-amortized-queue: Internal functions
%make-aux-tree: Internal functions
%make-tree-bag: Internal functions
%make-tree-map: Internal functions
%make-tree-set: Internal functions
%make-wb-tree: Internal functions
%rope: Exported functions
%rope-helper: Internal functions
%tree-bag-insert: Internal functions
%wb-tree: Internal functions

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

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

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

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

D
def-cgen-binop: Internal macros
def-tree-set-binop: Internal macros
def-tree-set-item-op: Internal macros
do-tree-map: Exported macros
do-tree-set: Exported macros
double-compare: Exported functions

E
empty-tree-map: Exported functions

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

G
Generic Function, object-rope: Exported generic functions
gsymbol-compare: Exported functions
gsymbol-compare-atom: Internal functions

H
hash-table-tree-map: Exported functions

I
if-less-eq-compare: Exported macros

J
join-wb-tree: Internal functions
join-wb-tree-left: Internal functions
join-wb-tree-left-right: Internal functions
join-wb-tree-right: Internal functions

L
left-right-wb-tree: Internal functions
left-wb-tree: Internal functions

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

O
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope: Exported generic functions
object-rope-check: Internal functions
op-precedence: Internal functions
or-compare: Exported macros
output-dot: Exported functions
output-dot-file: Internal functions
output-rope: Exported functions

P
pairing-heap-builder: Internal functions
pairing-heap-children: Internal functions
pairing-heap-find-min: Internal functions
pairing-heap-insert: Internal functions
pairing-heap-list: Internal functions
pairing-heap-merge: Internal functions
pairing-heap-merge-pairs: Internal functions
pairing-heap-next: Internal functions
pairing-heap-p: Internal functions
pairing-heap-remove-min: Internal functions
pairing-heap-root: Internal functions
precedence: Internal functions

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

S
sexp-rope: Exported functions
simple-string-compare: Internal functions
strcat: Internal functions
string-compare: Exported functions
string-compare-inline: Internal functions
subrope: Exported functions

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

V
vector-range: Internal functions

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

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

Next: , Previous: , Up: Indexes   [Contents][Index]

A.3 Variables

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

%
%compare: Exported structures
%compare: Internal structures
%root: Exported structures

*
*cgen-indent*: Internal special variables
*cgen-indent-mark*: Internal special variables
*cgen-newline-indent*: Internal special variables
*rope-print*: Exported special variables
*wb-tree-print-depth*: Internal special variables
*wb-tree-print-max*: Internal special variables

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

A
a: Internal structures
a: Internal structures
a: Internal structures

B
b: Internal structures

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

F
forward: Exported structures

H
header: Exported structures
height: Internal structures

I
i: Internal structures

L
left: Internal structures
left: Internal structures
length: Internal structures

N
next: Internal structures

O
op: Internal structures

R
reverse: Exported structures
right: Internal structures
right: Internal structures
root: Exported structures
root: Internal structures
root: Internal structures

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

V
value: Internal structures

W
weight: Internal structures

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

Previous: , Up: Indexes   [Contents][Index]

A.4 Data types

Jump to:   A   B   C   P   R   S   T   U   W  
Index Entry  Section

A
amortized-queue: Exported structures

B
binary-tree: Internal structures

C
cgen-binop: Internal structures
cgen-block: Exported structures
cgen-op: Internal structures
cgen-subscript: Exported structures
cgen-unop-post: Internal structures
cgen-unop-pre: Internal structures

P
Package, sycamore: The sycamore package
Package, sycamore-cgen: The sycamore-cgen package
Package, sycamore-util: The sycamore-util package
pairing-heap: Internal structures

R
root-tree: Internal structures
rope: Exported types
rope-height-type: Internal types
rope-iterator: Internal structures
rope-length-type: Internal types
rope-node: Internal structures

S
Structure, amortized-queue: Exported structures
Structure, binary-tree: Internal structures
Structure, cgen-binop: Internal structures
Structure, cgen-block: Exported structures
Structure, cgen-op: Internal structures
Structure, cgen-subscript: Exported structures
Structure, cgen-unop-post: Internal structures
Structure, cgen-unop-pre: Internal structures
Structure, pairing-heap: Internal structures
Structure, root-tree: Internal structures
Structure, rope-iterator: Internal structures
Structure, rope-node: Internal structures
Structure, tree-bag: Internal structures
Structure, tree-map: Exported structures
Structure, tree-set: Exported structures
Structure, wb-tree: Internal structures
sycamore: The sycamore system
sycamore: The sycamore package
sycamore-cgen: The sycamore-cgen package
sycamore-util: The sycamore-util package
System, sycamore: The sycamore system

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

U
unsigned-fixnum: Exported types

W
wb-tree: Internal structures

Jump to:   A   B   C   P   R   S   T   U   W