3.1.1 funds/funds.asd

Source

funds.asd.

Parent Component

funds (system).

ASDF Systems

funds.

---

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

• make-stack (function).
• map-stack (function).
• stack-as-list (function).
• stack-count (function).
• stack-count-if (function).
• stack-empty-p (function).
• stack-from-list (function).
• stack-pop (function).
• stack-push (function).
• stack-size (function).
• stack-top (function).

---

3.1.4 funds/trees/classes.lisp

Source

funds.asd.

Parent Component

trees (module).

Public Interface

• bt-key (reader method).
• bt-value (reader method).

Internals

• avl-height (reader method).
• avl-leaf (class).
• avl-tree (class).
• binary-tree (class).
• bt-leaf (class).
• bt-left (reader method).
• bt-right (reader method).
• leaf (class).
• tree (class).

---

3.1.5 funds/trees/constructors.lisp

Dependency

classes.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Public Interface

• make-avl-tree (function).
• make-binary-tree (function).

Internals

• +avl-leaf+ (special variable).
• +bt-leaf+ (special variable).
• make-avl-leaf (function).
• make-bt-leaf (function).

---

3.1.6 funds/trees/bt.lisp

Dependency

constructors.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Internals

• left-p (function).
• next-in-order (function).
• other-side (function).
• side-to-insert (function).
• tree-child (function).

---

3.1.7 funds/trees/avl.lisp

Dependency

bt.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Internals

• balance (function).
• balanced-p (function).
• heavier-p (function).
• height-difference (function).
• parent-height (function).
• rotate (function).

---

3.1.8 funds/trees/stitch-tree.lisp

Dependency

avl.lisp (file).

Source

funds.asd.

Parent Component

trees (module).

Internals

• stitch-avl-tree (function).
• stitch-binary-tree (function).
• stitch-tree (method).
• stitch-tree (method).

---

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

• tree-as-pre-order-alist (method).
• tree-as-pre-order-alist (method).

---

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

• remove-root (function).
• remove-root-with-children (function).

---

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

• map-tree (function).
• tree-count (function).
• tree-count-if (function).

---

3.1.17 funds/heap/heap.lisp

Source

funds.asd.

Parent Component

heap (module).

Public Interface

• make-heap (function).
• tree-weight (method).

Internals

• +heap-leaf+ (special variable).
• attach-heap (function).
• heap (class).
• heap-leaf (class).
• heap-priority (reader method).
• heap-weight (reader method).
• make-heap-leaf (function).
• stitch-tree (method).

---

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

• last-direction (function).
• next-direction (function).
• path-direction (function).

---

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

• bubble-down (function).
• clip-last (function).
• in-order-p (function).
• last-node (function).
• no-children-p (function).

---

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

• make-vector (function).
• map-vector (function).
• vector-as-list (function).
• vector-copy (function).
• vector-count (function).
• vector-count-if (function).
• vector-from-list (function).
• vector-ref (function).
• vector-set (function).
• vector-size (function).

---

3.1.23 funds/hash.lisp

Dependency

vector.lisp (file).

Source

funds.asd.

Parent Component

funds (system).

Public Interface

• hash-as-alist (function).
• hash-from-alist (function).
• hash-keys (function).
• hash-ref (function).
• hash-remove (function).
• hash-set (function).
• hash-size (function).
• make-hash (function).
• map-hash (function).

Internals

• copy-dict (function).
• dict (structure).
• dict-hash (reader).
• (setf dict-hash) (writer).
• dict-p (function).
• dict-test (reader).
• (setf dict-test) (writer).
• dict-tree (reader).
• (setf dict-tree) (writer).
• hash-values (function).
• make-dict (function).

---

3.1.24 funds/hash-set.lisp

Dependency

hash.lisp (file).

Source

funds.asd.

Parent Component

funds (system).

Public Interface

• hash-as-list (function).
• hash-difference (function).
• hash-from-list (function).
• hash-intersection (function).
• hash-union (function).

---

3.1.25 funds/queue.lisp

Dependency

hash-set.lisp (file).

Source

funds.asd.

Parent Component

funds (system).

Public Interface

• dequeue (function).
• enqueue (function).
• make-queue (function).
• map-queue (function).
• queue-as-list (function).
• queue-count (function).
• queue-count-if (function).
• queue-empty-p (function).
• queue-first (function).
• queue-size (function).

Internals

• queue (class).
• queue-heap (reader method).
• queue-next-priority (reader method).

---

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

---

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.

---

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

---

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

• avl-height.
• stitch-tree.
• tree-height.

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

• avl-tree.
• heap.

Direct methods

• bt-key.
• bt-left.
• bt-right.
• bt-value.
• stitch-tree.
• tree-as-alist.
• tree-as-pre-order-alist.
• tree-height.
• tree-remove.
• tree-weight.

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

• heap-priority.
• heap-weight.
• stitch-tree.
• tree-weight.

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

• heap-insert.
• heap-remove.

Class: leaf ¶

A leaf with no data or children.

Package

funds.

Source

classes.lisp.

Direct superclasses

tree.

Direct subclasses

• avl-leaf.
• bt-leaf.
• heap-leaf.

Direct methods

• tree-as-alist.
• tree-as-pre-order-alist.
• tree-empty-p.
• tree-find.
• tree-height.
• tree-remove.
• tree-weight.

Class: queue ¶

Package

funds.

Source

queue.lisp.

Direct methods

• queue-heap.
• queue-next-priority.

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

• binary-tree.
• leaf.

---