The trees Reference Manual

This is the trees Reference Manual, version 0.11, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sat Dec 03 23:31:12 2022 GMT+0.

Table of Contents


1 Introduction


2 Systems

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


2.1 trees

A library for binary trees in normal and balanced flavors

Maintainer

Nathan Froyd <>

Author

Nathan Froyd <>

License

BSD style

Version

0.11

Source

trees.asd.

Child Components

3 Files

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


3.1 Lisp


3.1.1 trees/trees.asd

Source

trees.asd.

Parent Component

trees (system).

ASDF Systems

trees.

Packages

3.1.2 trees/package.lisp

Source

trees.asd.

Parent Component

trees (system).

Packages

binary-trees.


3.1.3 trees/generics.lisp

Dependency

package.lisp (file).

Source

trees.asd.

Parent Component

trees (system).

Public Interface

make-binary-tree (function).

Internals

*binary-tree-info* (special variable).


3.1.4 trees/types.lisp

Dependency

package.lisp (file).

Source

trees.asd.

Parent Component

trees (system).

Public Interface
Internals

3.1.5 trees/print.lisp

Dependencies
Source

trees.asd.

Parent Component

trees (system).

Public Interface
Internals

indent-to-level (function).


3.1.6 trees/binary-trees.lisp

Dependencies
Source

trees.asd.

Parent Component

trees (system).

Public Interface
Internals

3.1.7 trees/red-black-trees.lisp

Dependencies
Source

trees.asd.

Parent Component

trees (system).

Internals

3.1.8 trees/avl-trees.lisp

Dependencies
Source

trees.asd.

Parent Component

trees (system).

Internals

3.1.9 trees/aa-trees.lisp

Dependencies
Source

trees.asd.

Parent Component

trees (system).

Internals

3.1.10 trees/iterator.lisp

Dependencies
Source

trees.asd.

Parent Component

trees (system).

Internals

3.1.11 trees/utils.lisp

Dependency

binary-trees.lisp (file).

Source

trees.asd.

Parent Component

trees (system).

Public Interface
Internals

3.2 Static


3.2.1 trees/LICENSE

Source

trees.asd.

Parent Component

trees (system).


3.2.2 trees/README

Source

trees.asd.

Parent Component

trees (system).


3.2.3 trees/NEWS

Source

trees.asd.

Parent Component

trees (system).


3.2.4 trees/TODO

Source

trees.asd.

Parent Component

trees (system).


4 Packages

Packages are listed by definition order.


4.1 binary-trees

Source

package.lisp.

Nickname

trees

Use List

common-lisp.

Public Interface
Internals

4.2 trees-tests

Source

trees.asd.

Use List

common-lisp.


4.3 trees-system

Source

trees.asd.

Use List
  • asdf/interface.
  • common-lisp.

5 Definitions

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


5.1 Public Interface


5.1.1 Macros

Macro: dotree ((obj-var tree-var &optional return-value) &body body)
Package

binary-trees.

Source

utils.lisp.


5.1.2 Ordinary functions

Function: delete (key tree)

Attempt to remove the item with KEY from TREE.
Returns the item and T as multiple values on success, NIL and NIL on failure.

Package

binary-trees.

Source

binary-trees.lisp.

Function: emptyp (tree)
Package

binary-trees.

Source

binary-trees.lisp.

Function: find (key tree)

Find the item in TREE whose key is KEY and returns the associated item and T as multiple values, or returns NIL and NIL if no such item exists.

Package

binary-trees.

Source

binary-trees.lisp.

Function: insert (item tree)

Attempt to insert ITEM into TREE. ITEM must be of a suitable type for TREE’s key function, and the key returned from calling said function must be of a suitable type for TREE’s comparison and equality functions. Returns two values; the first is the key of ITEM and the second indicates whether ITEM was inserted or not.

Package

binary-trees.

Source

binary-trees.lisp.

Function: lower-bound (key tree)

Return the item in TREE possessing a key which is equal to or less than KEY. Returns NIL if there is no such item.

Package

binary-trees.

Source

binary-trees.lisp.

Function: make-binary-tree (type pred &key key test)

Create a binary tree based on TYPE. Current acceptable values for TYPE are:

:NORMAL - a normal binary tree, with no rebalancing
:RED-BLACK - a red-black tree
:AVL - an AVL tree
:AA - an AA tree.

PRED specifies the ordering relation. KEY specifies how to access the data for comparison. TEST is optional and, if given, specifies how to compare two keys for equality.

Package

binary-trees.

Source

generics.lisp.

Function: maximum (tree)

Return the item with the maximum key in TREE. It is an error to ask for the maximum item of an empty tree.

Package

binary-trees.

Source

binary-trees.lisp.

Function: minimum (tree)

Return the item with the minimum key in TREE. It is an error to ask for the minimum item of an empty tree.

Package

binary-trees.

Source

binary-trees.lisp.

Function: position (key tree &key from-end)
Package

binary-trees.

Source

utils.lisp.

Function: pprint-tree (tree &optional stream)
Package

binary-trees.

Source

print.lisp.

Function: reduce (tree function &key key initial-value from-end)
Package

binary-trees.

Source

utils.lisp.

Function: select (tree k)

Return the Kth item (zero-based) in TREE.

Package

binary-trees.

Source

binary-trees.lisp.

Reader: size (instance)
Writer: (setf size) (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

size.

Function: upper-bound (key tree)

Return the item in TREE possessing a key which is equal to or greater than KEY. Returns NIL if there is no such item.

Package

binary-trees.

Source

binary-trees.lisp.


5.1.3 Standalone methods

Method: print-object ((node red-black-tree-node) stream)
Source

print.lisp.

Method: print-object ((node aa-tree-node) stream)
Source

print.lisp.

Method: print-object ((node avl-tree-node) stream)
Source

print.lisp.

Method: print-object ((node tree-node) stream)
Source

print.lisp.


5.1.4 Structures

Structure: binary-tree
Package

binary-trees.

Source

types.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: test
Type

function

Initform

(error "missing arg")

Readers

test.

Writers

This slot is read-only.

Slot: key
Type

function

Initform

(error "missing arg")

Readers

key.

Writers

This slot is read-only.

Slot: pred
Type

function

Initform

(error "missing arg")

Readers

pred.

Writers

This slot is read-only.

Slot: size
Type

fixnum

Initform

0

Readers

size.

Writers

(setf size).

Slot: root
Type

(or null binary-trees::tree-node)

Readers

root.

Writers

(setf root).

Slot: modcount
Type

fixnum

Initform

0

Readers

modcount.

Writers

(setf modcount).

Slot: nodegen
Type

function

Initform

(error "missing arg")

Readers

nodegen.

Writers

This slot is read-only.

Slot: rebalance/insert
Type

(or null function)

Readers

rebalance/insert.

Writers

This slot is read-only.

Slot: rebalance/delete
Type

(or null function)

Readers

rebalance/delete.

Writers

This slot is read-only.


5.2 Internals


5.2.1 Constants

Constant: +avl-equal+
Package

binary-trees.

Source

types.lisp.

Constant: +avl-falls-left+
Package

binary-trees.

Source

types.lisp.

Constant: +avl-falls-right+
Package

binary-trees.

Source

types.lisp.

Constant: +avl-leans-left+
Package

binary-trees.

Source

types.lisp.

Constant: +avl-leans-right+
Package

binary-trees.

Source

types.lisp.


5.2.2 Special variables

Special Variable: *binary-tree-info*
Package

binary-trees.

Source

generics.lisp.


5.2.3 Ordinary functions

Function: %make-binary-tree (pred key test nodegen rebalance/insert rebalance/delete)
Package

binary-trees.

Source

types.lisp.

Function: aa-rebalance/delete (tree node replacement stack)
Package

binary-trees.

Source

aa-trees.lisp.

Function: aa-rebalance/insert (tree direction-stack)
Package

binary-trees.

Source

aa-trees.lisp.

Function: aa-tree-node-p (object)
Package

binary-trees.

Source

types.lisp.

Function: avl-rebalance/delete (tree node replacement stack)
Package

binary-trees.

Source

avl-trees.lisp.

Function: avl-rebalance/insert (tree direction-stack)
Package

binary-trees.

Source

avl-trees.lisp.

Function: avl-tree-node-p (object)
Package

binary-trees.

Source

types.lisp.

Reader: balance-info (instance)
Writer: (setf balance-info) (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

balance-info.

Function: binary-tree-p (object)
Package

binary-trees.

Source

types.lisp.

Function: blacken (node)
Package

binary-trees.

Source

red-black-trees.lisp.

Function: blackp (node)
Package

binary-trees.

Source

red-black-trees.lisp.

Reader: color (instance)
Writer: (setf color) (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

color.

Reader: datum (instance)
Writer: (setf datum) (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

datum.

Function: delete-node (tree node direction-stack)
Package

binary-trees.

Source

binary-trees.lisp.

Function: extreme-node-with-path (root direction &optional path)
Package

binary-trees.

Source

iterator.lisp.

Function: find-insertion-point (tree item-key)
Package

binary-trees.

Source

binary-trees.lisp.

Function: find-node-with-key (tree key)

Find the node in TREE with key KEY. Might return the null node if no such node can be found.

Package

binary-trees.

Source

binary-trees.lisp.

Function: for-each (func tree forwardp)
Package

binary-trees.

Source

utils.lisp.

Function: indent-to-level (n &optional stream)
Package

binary-trees.

Source

print.lisp.

Function: insert-child-for-stack-entry (entry child)
Package

binary-trees.

Source

binary-trees.lisp.

Reader: key (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

key.

Reader: left (instance)
Writer: (setf left) (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

left.

Reader: level (instance)
Writer: (setf level) (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

level.

Function: level* (x)
Package

binary-trees.

Source

aa-trees.lisp.

Function: lower-bound-node (key tree)

Return the node in TREE possessing a key which is equal to or less than KEY.

Package

binary-trees.

Source

binary-trees.lisp.

Function: lower-bound-node-with-path (key tree pathp)
Package

binary-trees.

Source

binary-trees.lisp.

Function: make-aa-node (datum)
Package

binary-trees.

Source

types.lisp.

Function: make-avl-node (datum)
Package

binary-trees.

Source

types.lisp.

Function: make-iterator (tree &key forwardp current stack)
Package

binary-trees.

Source

iterator.lisp.

Function: make-red-black-node (datum)
Package

binary-trees.

Source

types.lisp.

Function: make-tree-node (datum)
Package

binary-trees.

Source

types.lisp.

Function: maximum-node (root)
Package

binary-trees.

Source

binary-trees.lisp.

Function: minimum-node (root)
Package

binary-trees.

Source

binary-trees.lisp.

Reader: modcount (instance)
Writer: (setf modcount) (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

modcount.

Reader: nodegen (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

nodegen.

Reader: pred (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

pred.

Reader: rank (instance)
Writer: (setf rank) (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

rank.

Reader: rebalance/delete (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

rebalance/delete.

Reader: rebalance/insert (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

rebalance/insert.

Function: red-black-rebalance/delete (tree node replacement new-stack)
Package

binary-trees.

Source

red-black-trees.lisp.

Function: red-black-rebalance/insert (tree direction-stack)
Package

binary-trees.

Source

red-black-trees.lisp.

Function: red-black-tree-node-p (object)
Package

binary-trees.

Source

types.lisp.

Function: redden (node)
Package

binary-trees.

Source

red-black-trees.lisp.

Function: redp (node)
Package

binary-trees.

Source

red-black-trees.lisp.

Function: reverse-tree-for-each (func tree)
Package

binary-trees.

Source

utils.lisp.

Reader: right (instance)
Writer: (setf right) (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

right.

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

binary-trees.

Source

types.lisp.

Target Slot

root.

Function: rotate-left (node)
Package

binary-trees.

Source

binary-trees.lisp.

Function: rotate-right (node)
Package

binary-trees.

Source

binary-trees.lisp.

Function: select-node (tree k)
Package

binary-trees.

Source

binary-trees.lisp.

Function: select-node-with-path (tree k pathp)
Package

binary-trees.

Source

binary-trees.lisp.

Function: set-root-or-entry-child (tree entry child)
Package

binary-trees.

Source

binary-trees.lisp.

Function: skew (node)
Package

binary-trees.

Source

aa-trees.lisp.

Function: split (node)
Package

binary-trees.

Source

aa-trees.lisp.

Reader: test (instance)
Package

binary-trees.

Source

types.lisp.

Target Slot

test.

Function: tree-for-each (func tree)
Package

binary-trees.

Source

utils.lisp.

Function: tree-node-p (object)
Package

binary-trees.

Source

types.lisp.

Function: update-balance-factors (tree direction-stack)
Package

binary-trees.

Source

avl-trees.lisp.

Function: update-ranks (direction-stack insertedp)
Package

binary-trees.

Source

binary-trees.lisp.

Function: upper-bound-node (key tree)

Return the node in TREE possessing a key which is equal to or greater than KEY.

Package

binary-trees.

Source

binary-trees.lisp.

Function: upper-bound-node-with-path (key tree pathp)
Package

binary-trees.

Source

binary-trees.lisp.


5.2.4 Structures

Structure: aa-tree-node
Package

binary-trees.

Source

types.lisp.

Direct superclasses

tree-node.

Direct methods

print-object.

Direct slots
Slot: level
Type

fixnum

Initform

1

Readers

level.

Writers

(setf level).

Structure: avl-tree-node
Package

binary-trees.

Source

types.lisp.

Direct superclasses

tree-node.

Direct methods

print-object.

Direct slots
Slot: balance-info
Type

(integer -2 2)

Initform

0

Readers

balance-info.

Writers

(setf balance-info).

Structure: red-black-tree-node
Package

binary-trees.

Source

types.lisp.

Direct superclasses

tree-node.

Direct methods

print-object.

Direct slots
Slot: color
Type

binary-trees::red-black-color

Initform

:red

Readers

color.

Writers

(setf color).

Structure: tree-node
Package

binary-trees.

Source

types.lisp.

Direct superclasses

structure-object.

Direct subclasses
Direct methods

print-object.

Direct slots
Slot: left
Type

(or null binary-trees::tree-node)

Readers

left.

Writers

(setf left).

Slot: right
Type

(or null binary-trees::tree-node)

Readers

right.

Writers

(setf right).

Slot: rank
Type

fixnum

Initform

1

Readers

rank.

Writers

(setf rank).

Slot: datum
Readers

datum.

Writers

(setf datum).


5.2.5 Types

Type: red-black-color ()

Keywords denoting red-black tree colors.

Package

binary-trees.

Source

types.lisp.


Appendix A Indexes


A.1 Concepts


A.2 Functions

Jump to:   %   (  
A   B   C   D   E   F   I   K   L   M   N   P   R   S   T   U  
Index Entry  Section

%
%make-binary-tree: Private ordinary functions

(
(setf balance-info): Private ordinary functions
(setf color): Private ordinary functions
(setf datum): Private ordinary functions
(setf left): Private ordinary functions
(setf level): Private ordinary functions
(setf modcount): Private ordinary functions
(setf rank): Private ordinary functions
(setf right): Private ordinary functions
(setf root): Private ordinary functions
(setf size): Public ordinary functions

A
aa-rebalance/delete: Private ordinary functions
aa-rebalance/insert: Private ordinary functions
aa-tree-node-p: Private ordinary functions
avl-rebalance/delete: Private ordinary functions
avl-rebalance/insert: Private ordinary functions
avl-tree-node-p: Private ordinary functions

B
balance-info: Private ordinary functions
binary-tree-p: Private ordinary functions
blacken: Private ordinary functions
blackp: Private ordinary functions

C
color: Private ordinary functions

D
datum: Private ordinary functions
delete: Public ordinary functions
delete-node: Private ordinary functions
dotree: Public macros

E
emptyp: Public ordinary functions
extreme-node-with-path: Private ordinary functions

F
find: Public ordinary functions
find-insertion-point: Private ordinary functions
find-node-with-key: Private ordinary functions
for-each: Private ordinary functions
Function, %make-binary-tree: Private ordinary functions
Function, (setf balance-info): Private ordinary functions
Function, (setf color): Private ordinary functions
Function, (setf datum): Private ordinary functions
Function, (setf left): Private ordinary functions
Function, (setf level): Private ordinary functions
Function, (setf modcount): Private ordinary functions
Function, (setf rank): Private ordinary functions
Function, (setf right): Private ordinary functions
Function, (setf root): Private ordinary functions
Function, (setf size): Public ordinary functions
Function, aa-rebalance/delete: Private ordinary functions
Function, aa-rebalance/insert: Private ordinary functions
Function, aa-tree-node-p: Private ordinary functions
Function, avl-rebalance/delete: Private ordinary functions
Function, avl-rebalance/insert: Private ordinary functions
Function, avl-tree-node-p: Private ordinary functions
Function, balance-info: Private ordinary functions
Function, binary-tree-p: Private ordinary functions
Function, blacken: Private ordinary functions
Function, blackp: Private ordinary functions
Function, color: Private ordinary functions
Function, datum: Private ordinary functions
Function, delete: Public ordinary functions
Function, delete-node: Private ordinary functions
Function, emptyp: Public ordinary functions
Function, extreme-node-with-path: Private ordinary functions
Function, find: Public ordinary functions
Function, find-insertion-point: Private ordinary functions
Function, find-node-with-key: Private ordinary functions
Function, for-each: Private ordinary functions
Function, indent-to-level: Private ordinary functions
Function, insert: Public ordinary functions
Function, insert-child-for-stack-entry: Private ordinary functions
Function, key: Private ordinary functions
Function, left: Private ordinary functions
Function, level: Private ordinary functions
Function, level*: Private ordinary functions
Function, lower-bound: Public ordinary functions
Function, lower-bound-node: Private ordinary functions
Function, lower-bound-node-with-path: Private ordinary functions
Function, make-aa-node: Private ordinary functions
Function, make-avl-node: Private ordinary functions
Function, make-binary-tree: Public ordinary functions
Function, make-iterator: Private ordinary functions
Function, make-red-black-node: Private ordinary functions
Function, make-tree-node: Private ordinary functions
Function, maximum: Public ordinary functions
Function, maximum-node: Private ordinary functions
Function, minimum: Public ordinary functions
Function, minimum-node: Private ordinary functions
Function, modcount: Private ordinary functions
Function, nodegen: Private ordinary functions
Function, position: Public ordinary functions
Function, pprint-tree: Public ordinary functions
Function, pred: Private ordinary functions
Function, rank: Private ordinary functions
Function, rebalance/delete: Private ordinary functions
Function, rebalance/insert: Private ordinary functions
Function, red-black-rebalance/delete: Private ordinary functions
Function, red-black-rebalance/insert: Private ordinary functions
Function, red-black-tree-node-p: Private ordinary functions
Function, redden: Private ordinary functions
Function, redp: Private ordinary functions
Function, reduce: Public ordinary functions
Function, reverse-tree-for-each: Private ordinary functions
Function, right: Private ordinary functions
Function, root: Private ordinary functions
Function, rotate-left: Private ordinary functions
Function, rotate-right: Private ordinary functions
Function, select: Public ordinary functions
Function, select-node: Private ordinary functions
Function, select-node-with-path: Private ordinary functions
Function, set-root-or-entry-child: Private ordinary functions
Function, size: Public ordinary functions
Function, skew: Private ordinary functions
Function, split: Private ordinary functions
Function, test: Private ordinary functions
Function, tree-for-each: Private ordinary functions
Function, tree-node-p: Private ordinary functions
Function, update-balance-factors: Private ordinary functions
Function, update-ranks: Private ordinary functions
Function, upper-bound: Public ordinary functions
Function, upper-bound-node: Private ordinary functions
Function, upper-bound-node-with-path: Private ordinary functions

I
indent-to-level: Private ordinary functions
insert: Public ordinary functions
insert-child-for-stack-entry: Private ordinary functions

K
key: Private ordinary functions

L
left: Private ordinary functions
level: Private ordinary functions
level*: Private ordinary functions
lower-bound: Public ordinary functions
lower-bound-node: Private ordinary functions
lower-bound-node-with-path: Private ordinary functions

M
Macro, dotree: Public macros
make-aa-node: Private ordinary functions
make-avl-node: Private ordinary functions
make-binary-tree: Public ordinary functions
make-iterator: Private ordinary functions
make-red-black-node: Private ordinary functions
make-tree-node: Private ordinary functions
maximum: Public ordinary functions
maximum-node: Private ordinary functions
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
minimum: Public ordinary functions
minimum-node: Private ordinary functions
modcount: Private ordinary functions

N
nodegen: Private ordinary functions

P
position: Public ordinary functions
pprint-tree: Public ordinary functions
pred: Private ordinary functions
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods

R
rank: Private ordinary functions
rebalance/delete: Private ordinary functions
rebalance/insert: Private ordinary functions
red-black-rebalance/delete: Private ordinary functions
red-black-rebalance/insert: Private ordinary functions
red-black-tree-node-p: Private ordinary functions
redden: Private ordinary functions
redp: Private ordinary functions
reduce: Public ordinary functions
reverse-tree-for-each: Private ordinary functions
right: Private ordinary functions
root: Private ordinary functions
rotate-left: Private ordinary functions
rotate-right: Private ordinary functions

S
select: Public ordinary functions
select-node: Private ordinary functions
select-node-with-path: Private ordinary functions
set-root-or-entry-child: Private ordinary functions
size: Public ordinary functions
skew: Private ordinary functions
split: Private ordinary functions

T
test: Private ordinary functions
tree-for-each: Private ordinary functions
tree-node-p: Private ordinary functions

U
update-balance-factors: Private ordinary functions
update-ranks: Private ordinary functions
upper-bound: Public ordinary functions
upper-bound-node: Private ordinary functions
upper-bound-node-with-path: Private ordinary functions


A.3 Variables

Jump to:   *   +  
B   C   D   K   L   M   N   P   R   S   T  
Index Entry  Section

*
*binary-tree-info*: Private special variables

+
+avl-equal+: Private constants
+avl-falls-left+: Private constants
+avl-falls-right+: Private constants
+avl-leans-left+: Private constants
+avl-leans-right+: Private constants

B
balance-info: Private structures

C
color: Private structures
Constant, +avl-equal+: Private constants
Constant, +avl-falls-left+: Private constants
Constant, +avl-falls-right+: Private constants
Constant, +avl-leans-left+: Private constants
Constant, +avl-leans-right+: Private constants

D
datum: Private structures

K
key: Public structures

L
left: Private structures
level: Private structures

M
modcount: Public structures

N
nodegen: Public structures

P
pred: Public structures

R
rank: Private structures
rebalance/delete: Public structures
rebalance/insert: Public structures
right: Private structures
root: Public structures

S
size: Public structures
Slot, balance-info: Private structures
Slot, color: Private structures
Slot, datum: Private structures
Slot, key: Public structures
Slot, left: Private structures
Slot, level: Private structures
Slot, modcount: Public structures
Slot, nodegen: Public structures
Slot, pred: Public structures
Slot, rank: Private structures
Slot, rebalance/delete: Public structures
Slot, rebalance/insert: Public structures
Slot, right: Private structures
Slot, root: Public structures
Slot, size: Public structures
Slot, test: Public structures
Special Variable, *binary-tree-info*: Private special variables

T
test: Public structures


A.4 Data types

Jump to:   A   B   F   G   I   L   N   P   R   S   T   U  
Index Entry  Section

A
aa-tree-node: Private structures
aa-trees.lisp: The trees/aa-trees․lisp file
avl-tree-node: Private structures
avl-trees.lisp: The trees/avl-trees․lisp file

B
binary-tree: Public structures
binary-trees: The binary-trees package
binary-trees.lisp: The trees/binary-trees․lisp file

F
File, aa-trees.lisp: The trees/aa-trees․lisp file
File, avl-trees.lisp: The trees/avl-trees․lisp file
File, binary-trees.lisp: The trees/binary-trees․lisp file
File, generics.lisp: The trees/generics․lisp file
File, iterator.lisp: The trees/iterator․lisp file
File, license: The trees/license file
File, news: The trees/news file
File, package.lisp: The trees/package․lisp file
File, print.lisp: The trees/print․lisp file
File, readme: The trees/readme file
File, red-black-trees.lisp: The trees/red-black-trees․lisp file
File, todo: The trees/todo file
File, trees.asd: The trees/trees․asd file
File, types.lisp: The trees/types․lisp file
File, utils.lisp: The trees/utils․lisp file

G
generics.lisp: The trees/generics․lisp file

I
iterator.lisp: The trees/iterator․lisp file

L
license: The trees/license file

N
news: The trees/news file

P
Package, binary-trees: The binary-trees package
Package, trees-system: The trees-system package
Package, trees-tests: The trees-tests package
package.lisp: The trees/package․lisp file
print.lisp: The trees/print․lisp file

R
readme: The trees/readme file
red-black-color: Private types
red-black-tree-node: Private structures
red-black-trees.lisp: The trees/red-black-trees․lisp file

S
Structure, aa-tree-node: Private structures
Structure, avl-tree-node: Private structures
Structure, binary-tree: Public structures
Structure, red-black-tree-node: Private structures
Structure, tree-node: Private structures
System, trees: The trees system

T
todo: The trees/todo file
tree-node: Private structures
trees: The trees system
trees-system: The trees-system package
trees-tests: The trees-tests package
trees.asd: The trees/trees․asd file
Type, red-black-color: Private types
types.lisp: The trees/types․lisp file

U
utils.lisp: The trees/utils․lisp file