The funds Reference Manual

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

The funds Reference Manual

This is the funds Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Thu Sep 15 04:47:07 2022 GMT+0.

Table of Contents


1 Systems

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


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

1.1 funds

Source

funds.asd.

Child Components

Next: , Previous: , Up: The funds Reference Manual   [Contents][Index]

2 Modules

Modules are listed depth-first from the system components tree.


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

2.1 funds/trees

Dependency

stack.lisp (file).

Source

funds.asd.

Parent Component

funds (system).

Child Components

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

2.2 funds/heap

Dependency

trees (module).

Source

funds.asd.

Parent Component

funds (system).

Child Components

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   [Contents][Index]

3.1.1 funds/funds.asd

Source

funds.asd.

Parent Component

funds (system).

ASDF Systems

funds.


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

3.1.2 funds/package.lisp

Source

funds.asd.

Parent Component

funds (system).

Packages

funds.


3.1.3 funds/stack.lisp

Dependency

package.lisp (file).

Source

funds.asd.

Parent Component

funds (system).

Public Interface

3.1.4 funds/trees/classes.lisp

Source

funds.asd.

Parent Component

trees (module).

Public Interface
Internals

3.1.5 funds/trees/constructors.lisp

Dependency

classes.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Public Interface
Internals

3.1.6 funds/trees/bt.lisp

Dependency

constructors.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Internals

3.1.7 funds/trees/avl.lisp

Dependency

bt.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Internals

3.1.8 funds/trees/stitch-tree.lisp

Dependency

avl.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Internals

3.1.9 funds/trees/tree-as-alist.lisp

Dependency

stitch-tree.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Public Interface

tree-as-alist (generic function).

Internals

3.1.10 funds/trees/tree-empty-p.lisp

Dependency

tree-as-alist.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Public Interface

tree-empty-p (generic function).


3.1.11 funds/trees/tree-insert.lisp

Dependency

tree-empty-p.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Public Interface

tree-insert (generic function).


3.1.12 funds/trees/tree-remove.lisp

Dependency

tree-insert.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Public Interface

tree-remove (generic function).

Internals

3.1.13 funds/trees/tree-find.lisp

Dependency

tree-remove.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Public Interface

tree-find (generic function).


3.1.14 funds/trees/tree-weight.lisp

Dependency

tree-find.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Public Interface

tree-weight (generic function).


3.1.15 funds/trees/tree-height.lisp

Dependency

tree-weight.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Public Interface

tree-height (generic function).


3.1.16 funds/trees/utilities.lisp

Dependency

tree-height.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Public Interface

3.1.17 funds/heap/heap.lisp

Source

funds.asd.

Parent Component

heap (module).

Public Interface
Internals

3.1.18 funds/heap/heap-empty-p.lisp

Dependency

heap.lisp (file).

Source

funds.asd.

Parent Component

heap (module).

Public Interface

heap-empty-p (function).


3.1.19 funds/heap/heap-insert.lisp

Dependency

heap-empty-p.lisp (file).

Source

funds.asd.

Parent Component

heap (module).

Public Interface

heap-insert (generic function).

Internals

3.1.20 funds/heap/heap-remove.lisp

Dependency

heap-insert.lisp (file).

Source

funds.asd.

Parent Component

heap (module).

Public Interface

heap-remove (generic function).

Internals

3.1.21 funds/heap/heap-first.lisp

Dependency

heap-remove.lisp (file).

Source

funds.asd.

Parent Component

heap (module).

Public Interface

heap-first (function).


3.1.22 funds/vector.lisp

Dependency

heap (module).

Source

funds.asd.

Parent Component

funds (system).

Public Interface

3.1.23 funds/hash.lisp

Dependency

vector.lisp (file).

Source

funds.asd.

Parent Component

funds (system).

Public Interface
Internals

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

3.1.24 funds/hash-set.lisp

Dependency

hash.lisp (file).

Source

funds.asd.

Parent Component

funds (system).

Public Interface

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

3.1.25 funds/queue.lisp

Dependency

hash-set.lisp (file).

Source

funds.asd.

Parent Component

funds (system).

Public Interface
Internals

4 Packages

Packages are listed by definition order.


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

4.1 funds

Source

package.lisp.

Use List

common-lisp.

Public Interface
Internals

5 Definitions

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


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

5.1 Public Interface


5.1.1 Ordinary functions

Function: dequeue (q)

The queue that results when the first item is removed from the given queue.

Package

funds.

Source

queue.lisp.

Function: enqueue (q item)

The queue that results when the given item is equeued on the given queue.

Package

funds.

Source

queue.lisp.

Function: hash-as-alist (hash)

An alist containing the same key-value pairs as the given hash.

Package

funds.

Source

hash.lisp.

Function: hash-as-list (hash)
Package

funds.

Source

hash-set.lisp.

Function: hash-difference (hash &rest hashes)

Elements of the first hash that are not in hashes.

Package

funds.

Source

hash-set.lisp.

Function: hash-from-alist (alist &key test hash)
Package

funds.

Source

hash.lisp.

Function: hash-from-list (list &key test hash)
Package

funds.

Source

hash-set.lisp.

Function: hash-intersection (&rest hashes)

Elements that all hashes share.

Package

funds.

Source

hash-set.lisp.

Function: hash-keys (hash)
Package

funds.

Source

hash.lisp.

Function: hash-ref (hash key &optional default)

The value associated with the given key in the given hash. A second value is returned to indicate whether the key is associated with any value or is not found.

Package

funds.

Source

hash.lisp.

Function: hash-remove (hash key)

A hash similar to the given hash, except that key does not map to any value in the returned hash.

Package

funds.

Source

hash.lisp.

Function: hash-set (hash key &optional value)

A hash similar to the given hash except that key maps to value in the returned hash.

Package

funds.

Source

hash.lisp.

Function: hash-size (hash)
Package

funds.

Source

hash.lisp.

Function: hash-union (&rest hashes)

Elements of all hashes combine into one hash.

Package

funds.

Source

hash-set.lisp.

Function: heap-empty-p (heap)

Whether the given heap has any elements.

Package

funds.

Source

heap-empty-p.lisp.

Function: heap-first (heap)

The first value on the given heap.

Package

funds.

Source

heap-first.lisp.

Function: make-avl-tree ()

An empty AVL tree.

Package

funds.

Source

constructors.lisp.

Function: make-binary-tree ()

An empty binary tree.

Package

funds.

Source

constructors.lisp.

Function: make-hash (&key hash test)

An empty hash that hashes occording to the given hash function, which defaults to #’sxhash and and tests according to the given test function, which defaults to #’eql.

Package

funds.

Source

hash.lisp.

Function: make-heap (&key priority value left right)

An empty binary heap.

Package

funds.

Source

heap.lisp.

Function: make-queue (&key initial-contents)
Package

funds.

Source

queue.lisp.

Function: make-stack ()

An empty stack.

Package

funds.

Source

stack.lisp.

Function: make-vector (size &key initial-contents initial-element)

A functional vector of the given size with the given initial contents.

Package

funds.

Source

vector.lisp.

Function: map-hash (function hash)

A new hash where function has been applied to each key-value and the result of the each function call is the new value.

Package

funds.

Source

hash.lisp.

Function: map-queue (function q)

A queue containing items that are the result of applying function to the items in the given queue.

Package

funds.

Source

queue.lisp.

Function: map-stack (function stack)

A stack whose elements are those of the given stack when function is applied to them.

Package

funds.

Source

stack.lisp.

Function: map-tree (function tree)

A tree each node of which corresponds to the application of function to one node of the given tree.

Package

funds.

Source

utilities.lisp.

Function: map-vector (function vector)

A new vector whose elements are the results of the application of the given function to the elements of the given vector.

Package

funds.

Source

vector.lisp.

Function: queue-as-list (q)

The elements in the given queue, returned as a list, in the order they would be dequeued from the given queue.

Package

funds.

Source

queue.lisp.

Function: queue-count (item q &key key test)

The number of elements in the given queue that satisfy the test.

Package

funds.

Source

queue.lisp.

Function: queue-count-if (predicate q &key key)

The number of elements in the given queue that satisfy the test.

Package

funds.

Source

queue.lisp.

Function: queue-empty-p (q)

Whether the given queue does not contain any items.

Package

funds.

Source

queue.lisp.

Function: queue-first (q)

The value at the head of the given queue.

Package

funds.

Source

queue.lisp.

Function: queue-size (q)

The number of items in the given queue.

Package

funds.

Source

queue.lisp.

Function: stack-as-list (stack)

This function is here in case the implementation of stack changes from what it is now, a list.

Package

funds.

Source

stack.lisp.

Function: stack-count (item stack &key key test)
Package

funds.

Source

stack.lisp.

Function: stack-count-if (predicate stack &key key)
Package

funds.

Source

stack.lisp.

Function: stack-empty-p (stack)

Whether the given stack is empty.

Package

funds.

Source

stack.lisp.

Function: stack-from-list (list)

This function is here in case the implementation of stack changes from what it is now, a list.

Package

funds.

Source

stack.lisp.

Function: stack-pop (stack)

The stack that results when the top item is popped off the given stack.

Package

funds.

Source

stack.lisp.

Function: stack-push (stack item)

The stack that results when the given item is pushed onto the given stack.

Package

funds.

Source

stack.lisp.

Function: stack-size (stack)

The number of items on this stack; note that this is an O(n) operation.

Package

funds.

Source

stack.lisp.

Function: stack-top (stack)

The top item on the given stack.

Package

funds.

Source

stack.lisp.

Function: tree-count (item tree &key key test)

The number of sub-trees in the tree that satisfy the test.

Package

funds.

Source

utilities.lisp.

Function: tree-count-if (predicate tree &key key)

The number of sub-trees in the given tree that satisfy the test.

Package

funds.

Source

utilities.lisp.

Function: vector-as-list (vector)
Package

funds.

Source

vector.lisp.

Function: vector-copy (vector &optional start end)
Package

funds.

Source

vector.lisp.

Function: vector-count (item vector &key key test)

The number of elements in the given vector that satisfy the test.

Package

funds.

Source

vector.lisp.

Function: vector-count-if (pred vector &key key)

The number of elements in the given vector that satisfy the test.

Package

funds.

Source

vector.lisp.

Function: vector-from-list (list)
Package

funds.

Source

vector.lisp.

Function: vector-ref (vector index)

The element at the given index of the given vector.

Package

funds.

Source

vector.lisp.

Function: vector-set (vector index element)

An vector similar to the given vector except that index and element are associated in the returned vector.

Package

funds.

Source

vector.lisp.

Function: vector-size (vector)

The number of elements in the given vector.

Package

funds.

Source

vector.lisp.


5.1.2 Generic functions

Generic Reader: bt-key (object)
Package

funds.

Methods
Reader Method: bt-key ((binary-tree binary-tree))

automatically generated reader method

Source

classes.lisp.

Target Slot

key.

Generic Reader: bt-value (object)
Package

funds.

Methods
Reader Method: bt-value ((binary-tree binary-tree))

automatically generated reader method

Source

classes.lisp.

Target Slot

value.

Generic Function: heap-insert (heap value priority &key order)
Package

funds.

Source

heap-insert.lisp.

Methods
Method: heap-insert (heap value priority &key order)

A new heap, similar to the given heap, except that the priority-value pair is inserted into the retured heap according to the standard heap insertion algorithm.

Method: heap-insert ((heap heap-leaf) value priority &key order)
Generic Function: heap-remove (heap &key order)

The heap that results when first value is removed from the given heap.

Package

funds.

Source

heap-remove.lisp.

Methods
Method: heap-remove (heap &key order)
Method: heap-remove ((heap heap-leaf) &key order)
Generic Function: tree-as-alist (tree)

An association list containing the key-value pairs in the given tree.

Package

funds.

Source

tree-as-alist.lisp.

Methods
Method: tree-as-alist ((tree binary-tree))
Method: tree-as-alist ((tree leaf))
Generic Function: tree-empty-p (tree)

Whether the given tree does not contain key-value pairs.

Package

funds.

Source

tree-empty-p.lisp.

Methods
Method: tree-empty-p ((tree leaf))
Method: tree-empty-p (tree)
Generic Function: tree-find (tree key &key test order)

The value to which the given key is mapped, or nil if this tree contains no such key. The second value returned indicates whether the tree contained the key. So

(find t k) -> nil t

if k maps to nil. But

(find t k) -> nil nil
if there is no mapping for k in the tree.

Package

funds.

Source

tree-find.lisp.

Methods
Method: tree-find (tree key &key test order)
Method: tree-find ((tree leaf) key &key test order)
Generic Function: tree-height (tree)

The height of the given tree.

Package

funds.

Source

tree-height.lisp.

Methods
Method: tree-height ((tree avl-tree))
Method: tree-height ((tree binary-tree))
Method: tree-height ((tree leaf))
Generic Function: tree-insert (tree key value &key test order)

A new tree similar to the given tree except that the given key and
value are now associated with one another. If the given key is already contained in the tree, according to the test function, then the old value is replaced by the specified value in the returned tree. The order function specifies whether the given key-value pair should be inserted to the left or right of the given tree. The given tree is not modified.

Package

funds.

Source

tree-insert.lisp.

Methods
Method: tree-insert (tree key value &key test order)
Method: tree-insert ((tree avl-leaf) key value &key test order)
Method: tree-insert ((tree bt-leaf) key value &key test order)
Generic Function: tree-remove (tree key &key test order)

A new tree with the given key removed. The test function is used to compare the tree’s key to the given key. The order function is used to determine whether the key can be found to the left or right if it is not found at the root.

Package

funds.

Source

tree-remove.lisp.

Methods
Method: tree-remove ((tree binary-tree) key &key test order)
Method: tree-remove ((tree leaf) key &key test order)
Generic Function: tree-weight (tree)

The number of nodes in the given tree.

Package

funds.

Source

tree-weight.lisp.

Methods
Method: tree-weight ((tree heap))
Source

heap.lisp.

Method: tree-weight ((tree binary-tree))
Method: tree-weight ((tree leaf))

5.2 Internals


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

5.2.1 Special variables

Special Variable: +avl-leaf+
Package

funds.

Source

constructors.lisp.

Special Variable: +bt-leaf+
Package

funds.

Source

constructors.lisp.

Special Variable: +heap-leaf+
Package

funds.

Source

heap.lisp.


5.2.2 Ordinary functions

Function: attach-heap (root &key left right)
Package

funds.

Source

heap.lisp.

Function: balance (key value left right)
Package

funds.

Source

avl.lisp.

Function: balanced-p (t1 t2)
Package

funds.

Source

avl.lisp.

Function: bubble-down (root &key left right order)
Package

funds.

Source

heap-remove.lisp.

Function: clip-last (heap)

The heap that results when the last node is removed.

Package

funds.

Source

heap-remove.lisp.

Function: copy-dict (instance)
Package

funds.

Source

hash.lisp.

Reader: dict-hash (instance)
Writer: (setf dict-hash) (instance)
Package

funds.

Source

hash.lisp.

Target Slot

hash.

Function: dict-p (object)
Package

funds.

Source

hash.lisp.

Reader: dict-test (instance)
Writer: (setf dict-test) (instance)
Package

funds.

Source

hash.lisp.

Target Slot

test.

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

funds.

Source

hash.lisp.

Target Slot

tree.

Function: hash-values (hash)
Package

funds.

Source

hash.lisp.

Function: heavier-p (tree &key side)
Package

funds.

Source

avl.lisp.

Function: height-difference (t1 t2)
Package

funds.

Source

avl.lisp.

Function: in-order-p (h1 h2 &key order)
Package

funds.

Source

heap-remove.lisp.

Function: last-direction (heap)
Package

funds.

Source

heap-insert.lisp.

Function: last-node (heap)
Package

funds.

Source

heap-remove.lisp.

Function: left-p (side)
Package

funds.

Source

bt.lisp.

Function: make-avl-leaf ()
Package

funds.

Source

constructors.lisp.

Function: make-bt-leaf ()
Package

funds.

Source

constructors.lisp.

Function: make-dict (&key hash test tree)
Package

funds.

Source

hash.lisp.

Function: make-heap-leaf ()
Package

funds.

Source

heap.lisp.

Function: next-direction (heap)
Package

funds.

Source

heap-insert.lisp.

Function: next-in-order (tree)
Package

funds.

Source

bt.lisp.

Function: no-children-p (heap)
Package

funds.

Source

heap-remove.lisp.

Function: other-side (side)
Package

funds.

Source

bt.lisp.

Function: parent-height (t1 t2)
Package

funds.

Source

avl.lisp.

Function: path-direction (n)
Package

funds.

Source

heap-insert.lisp.

Function: remove-root (tree &key test order)
Package

funds.

Source

tree-remove.lisp.

Function: remove-root-with-children (tree &key test order)
Package

funds.

Source

tree-remove.lisp.

Function: rotate (inside root-key root-value outside &key side)
Package

funds.

Source

avl.lisp.

Function: side-to-insert (tree key &key order)
Package

funds.

Source

bt.lisp.

Function: stitch-avl-tree (&key root key value left right)
Package

funds.

Source

stitch-tree.lisp.

Function: stitch-binary-tree (&key root key value left right)
Package

funds.

Source

stitch-tree.lisp.

Function: tree-child (tree &key side)
Package

funds.

Source

bt.lisp.


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

5.2.3 Generic functions

Generic Reader: avl-height (object)
Package

funds.

Methods
Reader Method: avl-height ((avl-tree avl-tree))

automatically generated reader method

Source

classes.lisp.

Target Slot

height.

Generic Reader: bt-left (object)
Package

funds.

Methods
Reader Method: bt-left ((binary-tree binary-tree))

automatically generated reader method

Source

classes.lisp.

Target Slot

left.

Generic Reader: bt-right (object)
Package

funds.

Methods
Reader Method: bt-right ((binary-tree binary-tree))

automatically generated reader method

Source

classes.lisp.

Target Slot

right.

Generic Reader: heap-priority (object)
Package

funds.

Methods
Reader Method: heap-priority ((heap heap))

automatically generated reader method

Source

heap.lisp.

Target Slot

key.

Generic Reader: heap-weight (object)
Package

funds.

Methods
Reader Method: heap-weight ((heap heap))

automatically generated reader method

Source

heap.lisp.

Target Slot

weight.

Generic Reader: queue-heap (object)
Package

funds.

Methods
Reader Method: queue-heap ((queue queue))

automatically generated reader method

Source

queue.lisp.

Target Slot

heap.

Generic Reader: queue-next-priority (object)
Package

funds.

Methods
Reader Method: queue-next-priority ((queue queue))

automatically generated reader method

Source

queue.lisp.

Target Slot

next-priority.

Generic Function: stitch-tree (tree &key key value left right)
Package

funds.

Methods
Method: stitch-tree ((tree heap) &key key value left right)
Source

heap.lisp.

Method: stitch-tree ((tree avl-tree) &key key value left right)
Source

stitch-tree.lisp.

Method: stitch-tree ((tree binary-tree) &key key value left right)
Source

stitch-tree.lisp.

Generic Function: tree-as-pre-order-alist (tree)
Package

funds.

Methods
Method: tree-as-pre-order-alist ((tree binary-tree))
Source

tree-as-alist.lisp.

Method: tree-as-pre-order-alist ((tree leaf))
Source

tree-as-alist.lisp.


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

5.2.4 Structures

Structure: dict
Package

funds.

Source

hash.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: hash
Readers

dict-hash.

Writers

(setf dict-hash).

Slot: test
Readers

dict-test.

Writers

(setf dict-test).

Slot: tree
Readers

dict-tree.

Writers

(setf dict-tree).


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

5.2.5 Classes

Class: avl-leaf

A leaf node of an AVL tree.

Package

funds.

Source

classes.lisp.

Direct superclasses

leaf.

Direct methods

tree-insert.

Class: avl-tree

A height-balanced binary tree.

Package

funds.

Source

classes.lisp.

Direct superclasses

binary-tree.

Direct methods
Direct slots
Slot: height
Initargs

:height

Readers

avl-height.

Writers

This slot is read-only.

Slot: left
Initform

(funds:make-avl-tree)

Slot: right
Initform

(funds:make-avl-tree)

Class: binary-tree

A binary tree that holds a key-value pair in its root.

Package

funds.

Source

classes.lisp.

Direct superclasses

tree.

Direct subclasses
Direct methods
Direct slots
Slot: key
Initargs

:key

Readers

bt-key.

Writers

This slot is read-only.

Slot: value
Initargs

:value

Readers

bt-value.

Writers

This slot is read-only.

Slot: left
Initform

(funds:make-binary-tree)

Initargs

:left

Readers

bt-left.

Writers

This slot is read-only.

Slot: right
Initform

(funds:make-binary-tree)

Initargs

:right

Readers

bt-right.

Writers

This slot is read-only.

Class: bt-leaf

A leaf node of an AVL tree.

Package

funds.

Source

classes.lisp.

Direct superclasses

leaf.

Direct methods

tree-insert.

Class: heap
Package

funds.

Source

heap.lisp.

Direct superclasses

binary-tree.

Direct methods
Direct slots
Slot: key
Initargs

:priority

Readers

heap-priority.

Writers

This slot is read-only.

Slot: left
Initform

(funds:make-heap)

Slot: right
Initform

(funds:make-heap)

Slot: weight
Initform

1

Initargs

:weight

Readers

heap-weight.

Writers

This slot is read-only.

Class: heap-leaf

A leaf node of a heap.

Package

funds.

Source

heap.lisp.

Direct superclasses

leaf.

Direct methods
Class: leaf

A leaf with no data or children.

Package

funds.

Source

classes.lisp.

Direct superclasses

tree.

Direct subclasses
Direct methods
Class: queue
Package

funds.

Source

queue.lisp.

Direct methods
Direct slots
Slot: next-priority
Initform

0

Initargs

:next-priority

Readers

queue-next-priority.

Writers

This slot is read-only.

Slot: heap
Initform

(funds:make-heap)

Initargs

:heap

Readers

queue-heap.

Writers

This slot is read-only.

Class: tree

The foundation of all trees.

Package

funds.

Source

classes.lisp.

Direct subclasses

Appendix A Indexes


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

A.1 Concepts


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

A.2 Functions

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

(
(setf dict-hash): Private ordinary functions
(setf dict-test): Private ordinary functions
(setf dict-tree): Private ordinary functions

A
attach-heap: Private ordinary functions
avl-height: Private generic functions
avl-height: Private generic functions

B
balance: Private ordinary functions
balanced-p: Private ordinary functions
bt-key: Public generic functions
bt-key: Public generic functions
bt-left: Private generic functions
bt-left: Private generic functions
bt-right: Private generic functions
bt-right: Private generic functions
bt-value: Public generic functions
bt-value: Public generic functions
bubble-down: Private ordinary functions

C
clip-last: Private ordinary functions
copy-dict: Private ordinary functions

D
dequeue: Public ordinary functions
dict-hash: Private ordinary functions
dict-p: Private ordinary functions
dict-test: Private ordinary functions
dict-tree: Private ordinary functions

E
enqueue: Public ordinary functions

F
Function, (setf dict-hash): Private ordinary functions
Function, (setf dict-test): Private ordinary functions
Function, (setf dict-tree): Private ordinary functions
Function, attach-heap: Private ordinary functions
Function, balance: Private ordinary functions
Function, balanced-p: Private ordinary functions
Function, bubble-down: Private ordinary functions
Function, clip-last: Private ordinary functions
Function, copy-dict: Private ordinary functions
Function, dequeue: Public ordinary functions
Function, dict-hash: Private ordinary functions
Function, dict-p: Private ordinary functions
Function, dict-test: Private ordinary functions
Function, dict-tree: Private ordinary functions
Function, enqueue: Public ordinary functions
Function, hash-as-alist: Public ordinary functions
Function, hash-as-list: Public ordinary functions
Function, hash-difference: Public ordinary functions
Function, hash-from-alist: Public ordinary functions
Function, hash-from-list: Public ordinary functions
Function, hash-intersection: Public ordinary functions
Function, hash-keys: Public ordinary functions
Function, hash-ref: Public ordinary functions
Function, hash-remove: Public ordinary functions
Function, hash-set: Public ordinary functions
Function, hash-size: Public ordinary functions
Function, hash-union: Public ordinary functions
Function, hash-values: Private ordinary functions
Function, heap-empty-p: Public ordinary functions
Function, heap-first: Public ordinary functions
Function, heavier-p: Private ordinary functions
Function, height-difference: Private ordinary functions
Function, in-order-p: Private ordinary functions
Function, last-direction: Private ordinary functions
Function, last-node: Private ordinary functions
Function, left-p: Private ordinary functions
Function, make-avl-leaf: Private ordinary functions
Function, make-avl-tree: Public ordinary functions
Function, make-binary-tree: Public ordinary functions
Function, make-bt-leaf: Private ordinary functions
Function, make-dict: Private ordinary functions
Function, make-hash: Public ordinary functions
Function, make-heap: Public ordinary functions
Function, make-heap-leaf: Private ordinary functions
Function, make-queue: Public ordinary functions
Function, make-stack: Public ordinary functions
Function, make-vector: Public ordinary functions
Function, map-hash: Public ordinary functions
Function, map-queue: Public ordinary functions
Function, map-stack: Public ordinary functions
Function, map-tree: Public ordinary functions
Function, map-vector: Public ordinary functions
Function, next-direction: Private ordinary functions
Function, next-in-order: Private ordinary functions
Function, no-children-p: Private ordinary functions
Function, other-side: Private ordinary functions
Function, parent-height: Private ordinary functions
Function, path-direction: Private ordinary functions
Function, queue-as-list: Public ordinary functions
Function, queue-count: Public ordinary functions
Function, queue-count-if: Public ordinary functions
Function, queue-empty-p: Public ordinary functions
Function, queue-first: Public ordinary functions
Function, queue-size: Public ordinary functions
Function, remove-root: Private ordinary functions
Function, remove-root-with-children: Private ordinary functions
Function, rotate: Private ordinary functions
Function, side-to-insert: Private ordinary functions
Function, stack-as-list: Public ordinary functions
Function, stack-count: Public ordinary functions
Function, stack-count-if: Public ordinary functions
Function, stack-empty-p: Public ordinary functions
Function, stack-from-list: Public ordinary functions
Function, stack-pop: Public ordinary functions
Function, stack-push: Public ordinary functions
Function, stack-size: Public ordinary functions
Function, stack-top: Public ordinary functions
Function, stitch-avl-tree: Private ordinary functions
Function, stitch-binary-tree: Private ordinary functions
Function, tree-child: Private ordinary functions
Function, tree-count: Public ordinary functions
Function, tree-count-if: Public ordinary functions
Function, vector-as-list: Public ordinary functions
Function, vector-copy: Public ordinary functions
Function, vector-count: Public ordinary functions
Function, vector-count-if: Public ordinary functions
Function, vector-from-list: Public ordinary functions
Function, vector-ref: Public ordinary functions
Function, vector-set: Public ordinary functions
Function, vector-size: Public ordinary functions

G
Generic Function, avl-height: Private generic functions
Generic Function, bt-key: Public generic functions
Generic Function, bt-left: Private generic functions
Generic Function, bt-right: Private generic functions
Generic Function, bt-value: Public generic functions
Generic Function, heap-insert: Public generic functions
Generic Function, heap-priority: Private generic functions
Generic Function, heap-remove: Public generic functions
Generic Function, heap-weight: Private generic functions
Generic Function, queue-heap: Private generic functions
Generic Function, queue-next-priority: Private generic functions
Generic Function, stitch-tree: Private generic functions
Generic Function, tree-as-alist: Public generic functions
Generic Function, tree-as-pre-order-alist: Private generic functions
Generic Function, tree-empty-p: Public generic functions
Generic Function, tree-find: Public generic functions
Generic Function, tree-height: Public generic functions
Generic Function, tree-insert: Public generic functions
Generic Function, tree-remove: Public generic functions
Generic Function, tree-weight: Public generic functions

H
hash-as-alist: Public ordinary functions
hash-as-list: Public ordinary functions
hash-difference: Public ordinary functions
hash-from-alist: Public ordinary functions
hash-from-list: Public ordinary functions
hash-intersection: Public ordinary functions
hash-keys: Public ordinary functions
hash-ref: Public ordinary functions
hash-remove: Public ordinary functions
hash-set: Public ordinary functions
hash-size: Public ordinary functions
hash-union: Public ordinary functions
hash-values: Private ordinary functions
heap-empty-p: Public ordinary functions
heap-first: Public ordinary functions
heap-insert: Public generic functions
heap-insert: Public generic functions
heap-insert: Public generic functions
heap-priority: Private generic functions
heap-priority: Private generic functions
heap-remove: Public generic functions
heap-remove: Public generic functions
heap-remove: Public generic functions
heap-weight: Private generic functions
heap-weight: Private generic functions
heavier-p: Private ordinary functions
height-difference: Private ordinary functions

I
in-order-p: Private ordinary functions

L
last-direction: Private ordinary functions
last-node: Private ordinary functions
left-p: Private ordinary functions

M
make-avl-leaf: Private ordinary functions
make-avl-tree: Public ordinary functions
make-binary-tree: Public ordinary functions
make-bt-leaf: Private ordinary functions
make-dict: Private ordinary functions
make-hash: Public ordinary functions
make-heap: Public ordinary functions
make-heap-leaf: Private ordinary functions
make-queue: Public ordinary functions
make-stack: Public ordinary functions
make-vector: Public ordinary functions
map-hash: Public ordinary functions
map-queue: Public ordinary functions
map-stack: Public ordinary functions
map-tree: Public ordinary functions
map-vector: Public ordinary functions
Method, avl-height: Private generic functions
Method, bt-key: Public generic functions
Method, bt-left: Private generic functions
Method, bt-right: Private generic functions
Method, bt-value: Public generic functions
Method, heap-insert: Public generic functions
Method, heap-insert: Public generic functions
Method, heap-priority: Private generic functions
Method, heap-remove: Public generic functions
Method, heap-remove: Public generic functions
Method, heap-weight: Private generic functions
Method, queue-heap: Private generic functions
Method, queue-next-priority: Private generic functions
Method, stitch-tree: Private generic functions
Method, stitch-tree: Private generic functions
Method, stitch-tree: Private generic functions
Method, tree-as-alist: Public generic functions
Method, tree-as-alist: Public generic functions
Method, tree-as-pre-order-alist: Private generic functions
Method, tree-as-pre-order-alist: Private generic functions
Method, tree-empty-p: Public generic functions
Method, tree-empty-p: Public generic functions
Method, tree-find: Public generic functions
Method, tree-find: Public generic functions
Method, tree-height: Public generic functions
Method, tree-height: Public generic functions
Method, tree-height: Public generic functions
Method, tree-insert: Public generic functions
Method, tree-insert: Public generic functions
Method, tree-insert: Public generic functions
Method, tree-remove: Public generic functions
Method, tree-remove: Public generic functions
Method, tree-weight: Public generic functions
Method, tree-weight: Public generic functions
Method, tree-weight: Public generic functions

N
next-direction: Private ordinary functions
next-in-order: Private ordinary functions
no-children-p: Private ordinary functions

O
other-side: Private ordinary functions

P
parent-height: Private ordinary functions
path-direction: Private ordinary functions

Q
queue-as-list: Public ordinary functions
queue-count: Public ordinary functions
queue-count-if: Public ordinary functions
queue-empty-p: Public ordinary functions
queue-first: Public ordinary functions
queue-heap: Private generic functions
queue-heap: Private generic functions
queue-next-priority: Private generic functions
queue-next-priority: Private generic functions
queue-size: Public ordinary functions

R
remove-root: Private ordinary functions
remove-root-with-children: Private ordinary functions
rotate: Private ordinary functions

S
side-to-insert: Private ordinary functions
stack-as-list: Public ordinary functions
stack-count: Public ordinary functions
stack-count-if: Public ordinary functions
stack-empty-p: Public ordinary functions
stack-from-list: Public ordinary functions
stack-pop: Public ordinary functions
stack-push: Public ordinary functions
stack-size: Public ordinary functions
stack-top: Public ordinary functions
stitch-avl-tree: Private ordinary functions
stitch-binary-tree: Private ordinary functions
stitch-tree: Private generic functions
stitch-tree: Private generic functions
stitch-tree: Private generic functions
stitch-tree: Private generic functions

T
tree-as-alist: Public generic functions
tree-as-alist: Public generic functions
tree-as-alist: Public generic functions
tree-as-pre-order-alist: Private generic functions
tree-as-pre-order-alist: Private generic functions
tree-as-pre-order-alist: Private generic functions
tree-child: Private ordinary functions
tree-count: Public ordinary functions
tree-count-if: Public ordinary functions
tree-empty-p: Public generic functions
tree-empty-p: Public generic functions
tree-empty-p: Public generic functions
tree-find: Public generic functions
tree-find: Public generic functions
tree-find: Public generic functions
tree-height: Public generic functions
tree-height: Public generic functions
tree-height: Public generic functions
tree-height: Public generic functions
tree-insert: Public generic functions
tree-insert: Public generic functions
tree-insert: Public generic functions
tree-insert: Public generic functions
tree-remove: Public generic functions
tree-remove: Public generic functions
tree-remove: Public generic functions
tree-weight: Public generic functions
tree-weight: Public generic functions
tree-weight: Public generic functions
tree-weight: Public generic functions

V
vector-as-list: Public ordinary functions
vector-copy: Public ordinary functions
vector-count: Public ordinary functions
vector-count-if: Public ordinary functions
vector-from-list: Public ordinary functions
vector-ref: Public ordinary functions
vector-set: Public ordinary functions
vector-size: Public ordinary functions

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

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

A.4 Data types

Jump to:   A   B   C   D   F   H   L   M   P   Q   S   T   U   V  
Index Entry  Section

A
avl-leaf: Private classes
avl-tree: Private classes
avl.lisp: The funds/trees/avl․lisp file

B
binary-tree: Private classes
bt-leaf: Private classes
bt.lisp: The funds/trees/bt․lisp file

C
Class, avl-leaf: Private classes
Class, avl-tree: Private classes
Class, binary-tree: Private classes
Class, bt-leaf: Private classes
Class, heap: Private classes
Class, heap-leaf: Private classes
Class, leaf: Private classes
Class, queue: Private classes
Class, tree: Private classes
classes.lisp: The funds/trees/classes․lisp file
constructors.lisp: The funds/trees/constructors․lisp file

D
dict: Private structures

F
File, avl.lisp: The funds/trees/avl․lisp file
File, bt.lisp: The funds/trees/bt․lisp file
File, classes.lisp: The funds/trees/classes․lisp file
File, constructors.lisp: The funds/trees/constructors․lisp file
File, funds.asd: The funds/funds․asd file
File, hash-set.lisp: The funds/hash-set․lisp file
File, hash.lisp: The funds/hash․lisp file
File, heap-empty-p.lisp: The funds/heap/heap-empty-p․lisp file
File, heap-first.lisp: The funds/heap/heap-first․lisp file
File, heap-insert.lisp: The funds/heap/heap-insert․lisp file
File, heap-remove.lisp: The funds/heap/heap-remove․lisp file
File, heap.lisp: The funds/heap/heap․lisp file
File, package.lisp: The funds/package․lisp file
File, queue.lisp: The funds/queue․lisp file
File, stack.lisp: The funds/stack․lisp file
File, stitch-tree.lisp: The funds/trees/stitch-tree․lisp file
File, tree-as-alist.lisp: The funds/trees/tree-as-alist․lisp file
File, tree-empty-p.lisp: The funds/trees/tree-empty-p․lisp file
File, tree-find.lisp: The funds/trees/tree-find․lisp file
File, tree-height.lisp: The funds/trees/tree-height․lisp file
File, tree-insert.lisp: The funds/trees/tree-insert․lisp file
File, tree-remove.lisp: The funds/trees/tree-remove․lisp file
File, tree-weight.lisp: The funds/trees/tree-weight․lisp file
File, utilities.lisp: The funds/trees/utilities․lisp file
File, vector.lisp: The funds/vector․lisp file
funds: The funds system
funds: The funds package
funds.asd: The funds/funds․asd file

H
hash-set.lisp: The funds/hash-set․lisp file
hash.lisp: The funds/hash․lisp file
heap: The funds/heap module
heap: Private classes
heap-empty-p.lisp: The funds/heap/heap-empty-p․lisp file
heap-first.lisp: The funds/heap/heap-first․lisp file
heap-insert.lisp: The funds/heap/heap-insert․lisp file
heap-leaf: Private classes
heap-remove.lisp: The funds/heap/heap-remove․lisp file
heap.lisp: The funds/heap/heap․lisp file

L
leaf: Private classes

M
Module, heap: The funds/heap module
Module, trees: The funds/trees module

P
Package, funds: The funds package
package.lisp: The funds/package․lisp file

Q
queue: Private classes
queue.lisp: The funds/queue․lisp file

S
stack.lisp: The funds/stack․lisp file
stitch-tree.lisp: The funds/trees/stitch-tree․lisp file
Structure, dict: Private structures
System, funds: The funds system

T
tree: Private classes
tree-as-alist.lisp: The funds/trees/tree-as-alist․lisp file
tree-empty-p.lisp: The funds/trees/tree-empty-p․lisp file
tree-find.lisp: The funds/trees/tree-find․lisp file
tree-height.lisp: The funds/trees/tree-height․lisp file
tree-insert.lisp: The funds/trees/tree-insert․lisp file
tree-remove.lisp: The funds/trees/tree-remove․lisp file
tree-weight.lisp: The funds/trees/tree-weight․lisp file
trees: The funds/trees module

U
utilities.lisp: The funds/trees/utilities․lisp file

V
vector.lisp: The funds/vector․lisp file

Jump to:   A   B   C   D   F   H   L   M   P   Q   S   T   U   V