Function Index

%
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
%
Back to top

%best-helper

%collect-key-value

%container-counts

%every-thing-p

%merge-helper

%search-for-match

%search-in-container

%some-thing-p

%unique-elements

a
Back to top

add-initial-contents-internal

associative-container-p

b
Back to top

bound-symbols-in-package

c
Back to top

collect-containers

collect-pairs

collect-using

collect-window-over-elements

collect-window-over-nodes

collector-internal

count-using

d
Back to top

descend-ht

determine-generator-class

determine-iterator-class

e
Back to top

element-counts

f
Back to top

find-or-create-ht

first-item

front-of-queue

front-of-queue!

i
Back to top

identity-2

l
Back to top

last-item

m
Back to top

make-array-container

make-generator

make-ring-buffer

map-containers

map-pairs

map-window-over-elements

map-window-over-elements-helper

map-window-over-nodes

maybe-set-initial-element

merge-elements

merge-nodes

move-forward-p

n
Back to top

node-counts

r
Back to top

reduce-internal

resize-vector

return-empty-initial-element

s
Back to top

sparse-array-row-major-index

sparse-array-value-to-index

t
Back to top

tail-of-queue

tail-of-queue!

tuple-index

%
Back to top

%operate-after-finding

a
Back to top

add-default-item

add-initial-contents

advance

append-item

append-new-item

b
Back to top

base-class-for-iteratee

best-element

best-node

biggest-item

bst-node-is-left-child

bst-node-is-right-child

bst-node-replace-child

bst-node-set-left-child

bst-node-set-right-child

c
Back to top

characterize-element

children

class-for-contents-as

clean-up

collect-elements

collect-elements-stably

collect-items

collect-key-value

collect-key-value-stably

collect-keys

collect-nodes

combine-elements

container->list

container-difference

container-dimension

count-elements

count-elements-if

count-items

current-element

current-element-p

current-item

d
Back to top

delete-biggest-item

delete-element

delete-first

delete-item

delete-item-after

delete-item-at

delete-item-before

delete-item-if

delete-last

delete-list

delete-node

dequeue

dimensions

e
Back to top

element-passes-p

element-position

empty!

empty-p

enqueue

ensure-sorted

error-if-queue-empty

every-element-p

every-item-p

every-key-value-p

exchange-heap-nodes

f
Back to top

find-child-node

find-element

find-item

find-node

find-set

find-value

finish

first-element

first-node

force-sort

g
Back to top

graft-nodes

h
Back to top

has-children-p

heap-node-parent

heapify

height

i
Back to top

increment-end

initialize-container

inorder-walk

inorder-walk-nodes

insert-initial-contents-p

insert-item

insert-item-after

insert-item-at

insert-item-before

insert-item-ordered

insert-item-ordered-about-node

insert-list

insert-new-item

insert-sequence

item-at

item-at!

item-at-1

item-at-1!

item-key

iteratable-p

iterate-children

iterate-container

iterate-elements

iterate-elements-stably

iterate-forward

iterate-key-value

iterate-key-value-stably

iterate-keys

iterate-left

iterate-left-nodes

iterate-nodes

iterate-nodes-about-node

iterate-right

iterate-right-nodes

k
Back to top

key-exists-p

key-value-iteratable-p

l
Back to top

l-child

l-child-index

last-element

left-and-right-nodes-for-item

left-node-for-item

link-nodes

m
Back to top

make-container

make-container-for-contents

make-initial-element

make-internal-iterator

make-iterator

make-node-for-container

make-set

move

move-forward

move-forward-to-next-element

move-internal

move-p

n
Back to top

next-item

node-empty-p

node-parent-index

notify-element-of-child-status

nth-element

o
Back to top

open-file-for-iterator

p
Back to top

pop-item

postorder-walk

postorder-walk-nodes

predecessor

preorder-walk

preorder-walk-nodes

print-container

print-container-summary

print-iterator

push-item

r
Back to top

r-child

r-child-index

rb-delete-fixup

reduce-container

reduce-elements

reduce-nodes

remove-items-if

replace-item

representative

representative-node

reset

reverse-container

reverse-find

right-most-child

right-node-for-item

rotate-left

rotate-right

s
Back to top

search-for-element

search-for-item

search-for-key

search-for-match

search-for-matching-node

search-for-node

search-for-node*

set-dirty-flag

setup-initial-container

some-element-p

some-item-p

some-key-value-p

sort-container

sort-elements

sort-keys

sort-update-left

sort-update-right

splay-tree-rotate

splay-tree-splay

successor

u
Back to top

unique-elements

unique-nodes

update-element

update-item

w
Back to top

walk-tree

walk-tree-nodes

weight