The trees Reference Manual

Table of Contents

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

The trees Reference Manual

This is the trees Reference Manual, version 0.11, generated automatically by Declt version 2.3 "Robert April" on Tue Feb 20 09:26:08 2018 GMT+0.


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

1 Introduction

This package implements binary trees of various kinds, presenting a
uniform interface to them all.  Reading package.lisp should give you an
idea of what sorts of things you can do to trees and reading
binary-trees.lisp and generics.lisp provides a slightly more in-depth
look at the functions you would want to use.

There is a moderately extensive test suite which one can run with
(ASDF:OOS 'ASDF:TEST-OP :TREES).  Please be aware that it does take a
bit of time to run.  If any tests fail, you have found a bug; please
report it.

Report any bugs, comments, or improvements to .

Nathan Froyd
18 March 2008


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 trees

Maintainer

Nathan Froyd <froydnj@gmail.com>

Author

Nathan Froyd <froydnj@gmail.com>

License

BSD style

Description

A library for binary trees in normal and balanced flavors

Version

0.11

Source

trees.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.


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

3.1 Lisp


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

3.1.1 trees.asd

Location

trees.asd

Systems

trees (system)

Packages

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

3.1.2 trees/package.lisp

Parent

trees (system)

Location

package.lisp

Packages

binary-trees


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

3.1.3 trees/generics.lisp

Dependency

package.lisp (file)

Parent

trees (system)

Location

generics.lisp

Exported Definitions

make-binary-tree (function)

Internal Definitions

*binary-tree-info* (special variable)


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

3.1.4 trees/types.lisp

Dependency

package.lisp (file)

Parent

trees (system)

Location

types.lisp

Exported Definitions
Internal Definitions

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

3.1.5 trees/print.lisp

Dependencies
Parent

trees (system)

Location

print.lisp

Exported Definitions

pprint-tree (function)

Internal Definitions

indent-to-level (function)


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

3.1.6 trees/binary-trees.lisp

Dependencies
Parent

trees (system)

Location

binary-trees.lisp

Exported Definitions
Internal Definitions

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

3.1.7 trees/red-black-trees.lisp

Dependencies
Parent

trees (system)

Location

red-black-trees.lisp

Internal Definitions

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

3.1.8 trees/avl-trees.lisp

Dependencies
Parent

trees (system)

Location

avl-trees.lisp

Internal Definitions

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

3.1.9 trees/aa-trees.lisp

Dependencies
Parent

trees (system)

Location

aa-trees.lisp

Internal Definitions

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

3.1.10 trees/iterator.lisp

Dependencies
Parent

trees (system)

Location

iterator.lisp

Internal Definitions

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

3.1.11 trees/utils.lisp

Dependency

binary-trees.lisp (file)

Parent

trees (system)

Location

utils.lisp

Exported Definitions
Internal Definitions

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

3.2 Other


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

3.2.1 trees/LICENSE

Parent

trees (system)

Location

LICENSE


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

3.2.2 trees/README

Parent

trees (system)

Location

README


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

3.2.3 trees/NEWS

Parent

trees (system)

Location

NEWS


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

3.2.4 trees/TODO

Parent

trees (system)

Location

TODO


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

4 Packages

Packages are listed by definition order.


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

4.1 trees-tests

Source

trees.asd

Use List

common-lisp


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

4.2 trees-system

Source

trees.asd

Use List

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

4.3 binary-trees

Source

package.lisp (file)

Nickname

trees

Use List

common-lisp

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 Macros

Macro: dotree (OBJ-VAR TREE-VAR &optional RETURN-VALUE) &body BODY
Package

binary-trees

Source

utils.lisp (file)


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

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

Function: emptyp TREE
Package

binary-trees

Source

binary-trees.lisp (file)

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

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

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

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

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

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

Function: position KEY TREE &key FROM-END
Package

binary-trees

Source

utils.lisp (file)

Function: pprint-tree TREE &optional STREAM
Package

binary-trees

Source

print.lisp (file)

Function: reduce TREE FUNCTION &key KEY INITIAL-VALUE FROM-END
Package

binary-trees

Source

utils.lisp (file)

Function: select TREE K

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

Package

binary-trees

Source

binary-trees.lisp (file)

Function: size INSTANCE
Function: (setf size) VALUE INSTANCE
Package

binary-trees

Source

types.lisp (file)

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


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

5.1.3 Structures

Structure: binary-tree ()
Package

binary-trees

Source

types.lisp (file)

Direct superclasses

structure-object (structure)

Direct slots
Slot: test
Type

function

Initform

(error "missing arg")

Readers

test (function)

Writers

(setf test) (function)

Slot: key
Type

function

Initform

(error "missing arg")

Readers

key (function)

Writers

(setf key) (function)

Slot: pred
Type

function

Initform

(error "missing arg")

Readers

pred (function)

Writers

(setf pred) (function)

Slot: size
Type

fixnum

Initform

0

Readers

size (function)

Writers

(setf size) (function)

Slot: root
Type

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

Readers

root (function)

Writers

(setf root) (function)

Slot: modcount
Type

fixnum

Initform

0

Readers

modcount (function)

Writers

(setf modcount) (function)

Slot: nodegen
Type

function

Initform

(error "missing arg")

Readers

nodegen (function)

Writers

(setf nodegen) (function)

Slot: rebalance/insert
Type

(or null function)

Readers

rebalance/insert (function)

Writers

(setf rebalance/insert) (function)

Slot: rebalance/delete
Type

(or null function)

Readers

rebalance/delete (function)

Writers

(setf rebalance/delete) (function)


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

5.2 Internal definitions


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

5.2.1 Constants

Constant: +avl-equal+
Package

binary-trees

Source

types.lisp (file)

Constant: +avl-falls-left+
Package

binary-trees

Source

types.lisp (file)

Constant: +avl-falls-right+
Package

binary-trees

Source

types.lisp (file)

Constant: +avl-leans-left+
Package

binary-trees

Source

types.lisp (file)

Constant: +avl-leans-right+
Package

binary-trees

Source

types.lisp (file)


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

5.2.2 Special variables

Special Variable: *binary-tree-info*
Package

binary-trees

Source

generics.lisp (file)


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

5.2.3 Functions

Function: %make-binary-tree PRED KEY TEST NODEGEN REBALANCE/INSERT REBALANCE/DELETE
Package

binary-trees

Source

types.lisp (file)

Function: aa-rebalance/delete TREE NODE REPLACEMENT STACK
Package

binary-trees

Source

aa-trees.lisp (file)

Function: aa-rebalance/insert TREE DIRECTION-STACK
Package

binary-trees

Source

aa-trees.lisp (file)

Function: aa-tree-node-p OBJECT
Package

binary-trees

Source

types.lisp (file)

Function: avl-rebalance/delete TREE NODE REPLACEMENT STACK
Package

binary-trees

Source

avl-trees.lisp (file)

Function: avl-rebalance/insert TREE DIRECTION-STACK
Package

binary-trees

Source

avl-trees.lisp (file)

Function: avl-tree-node-p OBJECT
Package

binary-trees

Source

types.lisp (file)

Function: balance-info INSTANCE
Function: (setf balance-info) VALUE INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: binary-tree-p OBJECT
Package

binary-trees

Source

types.lisp (file)

Function: blacken NODE
Package

binary-trees

Source

red-black-trees.lisp (file)

Function: blackp NODE
Package

binary-trees

Source

red-black-trees.lisp (file)

Function: color INSTANCE
Function: (setf color) VALUE INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: datum INSTANCE
Function: (setf datum) VALUE INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: delete-node TREE NODE DIRECTION-STACK
Package

binary-trees

Source

binary-trees.lisp (file)

Function: extreme-node-with-path ROOT DIRECTION &optional PATH
Package

binary-trees

Source

iterator.lisp (file)

Function: find-insertion-point TREE ITEM-KEY
Package

binary-trees

Source

binary-trees.lisp (file)

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

Function: for-each FUNC TREE FORWARDP
Package

binary-trees

Source

utils.lisp (file)

Function: indent-to-level N &optional STREAM
Package

binary-trees

Source

print.lisp (file)

Function: insert-child-for-stack-entry ENTRY CHILD
Package

binary-trees

Source

binary-trees.lisp (file)

Function: key INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: left INSTANCE
Function: (setf left) VALUE INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: level INSTANCE
Function: (setf level) VALUE INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: level* X
Package

binary-trees

Source

aa-trees.lisp (file)

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

Function: lower-bound-node-with-path KEY TREE PATHP
Package

binary-trees

Source

binary-trees.lisp (file)

Function: make-aa-node DATUM
Package

binary-trees

Source

types.lisp (file)

Function: make-avl-node DATUM
Package

binary-trees

Source

types.lisp (file)

Function: make-iterator TREE &key FORWARDP CURRENT STACK
Package

binary-trees

Source

iterator.lisp (file)

Function: make-red-black-node DATUM
Package

binary-trees

Source

types.lisp (file)

Function: make-tree-node DATUM
Package

binary-trees

Source

types.lisp (file)

Function: maximum-node ROOT
Package

binary-trees

Source

binary-trees.lisp (file)

Function: minimum-node ROOT
Package

binary-trees

Source

binary-trees.lisp (file)

Function: modcount INSTANCE
Function: (setf modcount) VALUE INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: nodegen INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: pred INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: rank INSTANCE
Function: (setf rank) VALUE INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: rebalance/delete INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: rebalance/insert INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: red-black-rebalance/delete TREE NODE REPLACEMENT NEW-STACK
Package

binary-trees

Source

red-black-trees.lisp (file)

Function: red-black-rebalance/insert TREE DIRECTION-STACK
Package

binary-trees

Source

red-black-trees.lisp (file)

Function: red-black-tree-node-p OBJECT
Package

binary-trees

Source

types.lisp (file)

Function: redden NODE
Package

binary-trees

Source

red-black-trees.lisp (file)

Function: redp NODE
Package

binary-trees

Source

red-black-trees.lisp (file)

Function: reverse-tree-for-each FUNC TREE
Package

binary-trees

Source

utils.lisp (file)

Function: right INSTANCE
Function: (setf right) VALUE INSTANCE
Package

binary-trees

Source

types.lisp (file)

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

binary-trees

Source

types.lisp (file)

Function: rotate-left NODE
Package

binary-trees

Source

binary-trees.lisp (file)

Function: rotate-right NODE
Package

binary-trees

Source

binary-trees.lisp (file)

Function: select-node TREE K
Package

binary-trees

Source

binary-trees.lisp (file)

Function: select-node-with-path TREE K PATHP
Package

binary-trees

Source

binary-trees.lisp (file)

Function: set-root-or-entry-child TREE ENTRY CHILD
Package

binary-trees

Source

binary-trees.lisp (file)

Function: skew NODE
Package

binary-trees

Source

aa-trees.lisp (file)

Function: split NODE
Package

binary-trees

Source

aa-trees.lisp (file)

Function: test INSTANCE
Package

binary-trees

Source

types.lisp (file)

Function: tree-for-each FUNC TREE
Package

binary-trees

Source

utils.lisp (file)

Function: tree-node-p OBJECT
Package

binary-trees

Source

types.lisp (file)

Function: update-balance-factors TREE DIRECTION-STACK
Package

binary-trees

Source

avl-trees.lisp (file)

Function: update-ranks DIRECTION-STACK INSERTEDP
Package

binary-trees

Source

binary-trees.lisp (file)

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

Function: upper-bound-node-with-path KEY TREE PATHP
Package

binary-trees

Source

binary-trees.lisp (file)


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

5.2.4 Structures

Structure: aa-tree-node ()
Package

binary-trees

Source

types.lisp (file)

Direct superclasses

tree-node (structure)

Direct methods

print-object (method)

Direct slots
Slot: level
Type

fixnum

Initform

1

Readers

level (function)

Writers

(setf level) (function)

Structure: avl-tree-node ()
Package

binary-trees

Source

types.lisp (file)

Direct superclasses

tree-node (structure)

Direct methods

print-object (method)

Direct slots
Slot: balance-info
Type

(integer -2 2)

Initform

0

Readers

balance-info (function)

Writers

(setf balance-info) (function)

Structure: red-black-tree-node ()
Package

binary-trees

Source

types.lisp (file)

Direct superclasses

tree-node (structure)

Direct methods

print-object (method)

Direct slots
Slot: color
Type

binary-trees::red-black-color

Initform

:red

Readers

color (function)

Writers

(setf color) (function)

Structure: tree-node ()
Package

binary-trees

Source

types.lisp (file)

Direct superclasses

structure-object (structure)

Direct subclasses
Direct methods

print-object (method)

Direct slots
Slot: left
Type

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

Readers

left (function)

Writers

(setf left) (function)

Slot: right
Type

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

Readers

right (function)

Writers

(setf right) (function)

Slot: rank
Type

fixnum

Initform

1

Readers

rank (function)

Writers

(setf rank) (function)

Slot: datum
Readers

datum (function)

Writers

(setf datum) (function)


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

5.2.5 Types

Type: red-black-color ()

Keywords denoting red-black tree colors.

Package

binary-trees

Source

types.lisp (file)


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

Appendix A Indexes


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

A.1 Concepts

Jump to:   F   L   O   T  
Index Entry  Section

F
File, Lisp, trees.asd: The trees<dot>asd file
File, Lisp, trees/aa-trees.lisp: The trees/aa-trees<dot>lisp file
File, Lisp, trees/avl-trees.lisp: The trees/avl-trees<dot>lisp file
File, Lisp, trees/binary-trees.lisp: The trees/binary-trees<dot>lisp file
File, Lisp, trees/generics.lisp: The trees/generics<dot>lisp file
File, Lisp, trees/iterator.lisp: The trees/iterator<dot>lisp file
File, Lisp, trees/package.lisp: The trees/package<dot>lisp file
File, Lisp, trees/print.lisp: The trees/print<dot>lisp file
File, Lisp, trees/red-black-trees.lisp: The trees/red-black-trees<dot>lisp file
File, Lisp, trees/types.lisp: The trees/types<dot>lisp file
File, Lisp, trees/utils.lisp: The trees/utils<dot>lisp file
File, other, trees/LICENSE: The trees/license file
File, other, trees/NEWS: The trees/news file
File, other, trees/README: The trees/readme file
File, other, trees/TODO: The trees/todo file

L
Lisp File, trees.asd: The trees<dot>asd file
Lisp File, trees/aa-trees.lisp: The trees/aa-trees<dot>lisp file
Lisp File, trees/avl-trees.lisp: The trees/avl-trees<dot>lisp file
Lisp File, trees/binary-trees.lisp: The trees/binary-trees<dot>lisp file
Lisp File, trees/generics.lisp: The trees/generics<dot>lisp file
Lisp File, trees/iterator.lisp: The trees/iterator<dot>lisp file
Lisp File, trees/package.lisp: The trees/package<dot>lisp file
Lisp File, trees/print.lisp: The trees/print<dot>lisp file
Lisp File, trees/red-black-trees.lisp: The trees/red-black-trees<dot>lisp file
Lisp File, trees/types.lisp: The trees/types<dot>lisp file
Lisp File, trees/utils.lisp: The trees/utils<dot>lisp file

O
Other File, trees/LICENSE: The trees/license file
Other File, trees/NEWS: The trees/news file
Other File, trees/README: The trees/readme file
Other File, trees/TODO: The trees/todo file

T
trees.asd: The trees<dot>asd file
trees/aa-trees.lisp: The trees/aa-trees<dot>lisp file
trees/avl-trees.lisp: The trees/avl-trees<dot>lisp file
trees/binary-trees.lisp: The trees/binary-trees<dot>lisp file
trees/generics.lisp: The trees/generics<dot>lisp file
trees/iterator.lisp: The trees/iterator<dot>lisp file
trees/LICENSE: The trees/license file
trees/NEWS: The trees/news file
trees/package.lisp: The trees/package<dot>lisp file
trees/print.lisp: The trees/print<dot>lisp file
trees/README: The trees/readme file
trees/red-black-trees.lisp: The trees/red-black-trees<dot>lisp file
trees/TODO: The trees/todo file
trees/types.lisp: The trees/types<dot>lisp file
trees/utils.lisp: The trees/utils<dot>lisp file

Jump to:   F   L   O   T  

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

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: Internal functions

(
(setf balance-info): Internal functions
(setf color): Internal functions
(setf datum): Internal functions
(setf left): Internal functions
(setf level): Internal functions
(setf modcount): Internal functions
(setf rank): Internal functions
(setf right): Internal functions
(setf root): Internal functions
(setf size): Exported functions

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

B
balance-info: Internal functions
binary-tree-p: Internal functions
blacken: Internal functions
blackp: Internal functions

C
color: Internal functions

D
datum: Internal functions
delete: Exported functions
delete-node: Internal functions
dotree: Exported macros

E
emptyp: Exported functions
extreme-node-with-path: Internal functions

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

I
indent-to-level: Internal functions
insert: Exported functions
insert-child-for-stack-entry: Internal functions

K
key: Internal functions

L
left: Internal functions
level: Internal functions
level*: Internal functions
lower-bound: Exported functions
lower-bound-node: Internal functions
lower-bound-node-with-path: Internal functions

M
Macro, dotree: Exported macros
make-aa-node: Internal functions
make-avl-node: Internal functions
make-binary-tree: Exported functions
make-iterator: Internal functions
make-red-black-node: Internal functions
make-tree-node: Internal functions
maximum: Exported functions
maximum-node: Internal functions
minimum: Exported functions
minimum-node: Internal functions
modcount: Internal functions

N
nodegen: Internal functions

P
position: Exported functions
pprint-tree: Exported functions
pred: Internal functions

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

S
select: Exported functions
select-node: Internal functions
select-node-with-path: Internal functions
set-root-or-entry-child: Internal functions
size: Exported functions
skew: Internal functions
split: Internal functions

T
test: Internal functions
tree-for-each: Internal functions
tree-node-p: Internal functions

U
update-balance-factors: Internal functions
update-ranks: Internal functions
upper-bound: Exported functions
upper-bound-node: Internal functions
upper-bound-node-with-path: Internal functions

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

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

A.3 Variables

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

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

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

B
balance-info: Internal structures

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

D
datum: Internal structures

K
key: Exported structures

L
left: Internal structures
level: Internal structures

M
modcount: Exported structures

N
nodegen: Exported structures

P
pred: Exported structures

R
rank: Internal structures
rebalance/delete: Exported structures
rebalance/insert: Exported structures
right: Internal structures
root: Exported structures

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

T
test: Exported structures

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

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

A.4 Data types

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

A
aa-tree-node: Internal structures
avl-tree-node: Internal structures

B
binary-tree: Exported structures
binary-trees: The binary-trees package

P
Package, binary-trees: The binary-trees package
Package, trees-system: The trees-system package
Package, trees-tests: The trees-tests package

R
red-black-color: Internal types
red-black-tree-node: Internal structures

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

T
tree-node: Internal structures
trees: The trees system
trees-system: The trees-system package
trees-tests: The trees-tests package
Type, red-black-color: Internal types

Jump to:   A   B   P   R   S   T