This is the binomial-heap Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 04:24:33 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
binomial-heapA compact binomial heap implementation.
Volkan YAZICI <volkan.yazici@gmail.com>
BSD
src (module).
Modules are listed depth-first from the system components tree.
binomial-heap/srcbinomial-heap (system).
packages.lisp (file).
specials.lisp (file).
utils.lisp (file).
operations.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
binomial-heap/binomial-heap.asdbinomial-heap/src/packages.lispbinomial-heap/src/specials.lispbinomial-heap/src/utils.lispbinomial-heap/src/operations.lispbinomial-heap/binomial-heap.asdbinomial-heap (system).
binomial-heap/src/specials.lisppackages.lisp (file).
src (module).
binomial-heap (class).
print-object (method).
test-of (reader method).
(setf test-of) (writer method).
binomial-tree (class).
child-of (reader method).
(setf child-of) (writer method).
degree-of (reader method).
(setf degree-of) (writer method).
head-of (reader method).
(setf head-of) (writer method).
key-of (reader method).
(setf key-of) (writer method).
parent-of (reader method).
(setf parent-of) (writer method).
sibling-of (reader method).
(setf sibling-of) (writer method).
binomial-heap/src/utils.lispspecials.lisp (file).
src (module).
binomial-heap/src/operations.lisputils.lisp (file).
src (module).
extract-extremum-key (function).
get-extremum-key (function).
insert-key (function).
unite-heaps (function).
get-prior-to-extremum (function).
link-siblings (function).
link-trees (function).
merge-siblings (function).
print-tree (function).
sexp->tree (function).
sibling-list (function).
tree->sexp (function).
unite-root-lists (function).
unsafe-unite-root-lists (function).
Packages are listed by definition order.
binomial-heapbh
common-lisp.
binomial-heap (class).
extract-extremum-key (function).
get-extremum-key (function).
insert-key (function).
test-of (generic reader).
(setf test-of) (generic writer).
unite-heaps (function).
binomial-tree (class).
child-of (generic reader).
(setf child-of) (generic writer).
degree-of (generic reader).
(setf degree-of) (generic writer).
get-prior-to-extremum (function).
head-of (generic reader).
(setf head-of) (generic writer).
key-of (generic reader).
(setf key-of) (generic writer).
link-siblings (function).
link-trees (function).
merge-siblings (function).
parent-of (generic reader).
(setf parent-of) (generic writer).
print-tree (function).
prog1-let (macro).
sexp->tree (function).
sibling-list (function).
sibling-of (generic reader).
(setf sibling-of) (generic writer).
tree->sexp (function).
unite-root-lists (function).
unsafe-unite-root-lists (function).
when-let (macro).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Extracts the extremum value from the ‘BINOMIAL-HEAP’ pointed by ‘HEAP’. Function returns the ‘KEY’ field of the extracted ‘BINOMIAL-TREE’ instance.
Finds the ‘BINOMIAL-TREE’ with the extremum value and its ‘KEY’ field. Function returns ‘NIL’ in case of no items found.
Creates a new ‘BINOMIAL-TREE’ for ‘KEY’ and inserts this node to the ‘BINOMIAL-HEAP’ pointed by ‘HEAP’. Function returns the ‘KEY’.
Unites given two heaps of type ‘BINOMIAL-HEAP’ into a single one. (Assuming ‘TEST’ functions of each heap are equivalent.)
binomial-heap)) ¶automatically generated reader method
test.
binomial-heap)) ¶automatically generated writer method
test.
Finds the ‘BINOMIAL-TREE’ prior to the extremum in the sibling list pointed by ‘HEAD’. Function returns ‘NIL’ in case of no extremum or extremum at the beginning.
Constructs ‘SIBLING’ slots of given list of ‘BINOMIAL-TREE’s to provide given order.
Makes ‘X’ the child of ‘Y’.
Merges given two ‘BINOMIAL-TREE’s and their related siblings into a single ‘BINOMIAL-TREE’ sibling list.
Utility function to print binomial tree in a human-readable(?) format.
Converts supplied ‘SEXP’ of ‘(KEY &KEY SIBLING CHILD)’ form into appropriate ‘BINOMIAL-TREE’ instance.
Returns reversed list of child and its consequent siblings of supplied ‘TREE’ of type ‘BINOMIAL-TREE’.
Converts supplied ‘BINOMIAL-TREE’ into ‘(KEY &KEY SIBLING CHILD)’ compound form.
Unites given ‘X’ and ‘Y’ ‘BINOMIAL-TREE’s and their related siblings into a single ‘BINOMIAL-TREE’.
Identical to ‘UNITE-ROOT-LISTS’ except that this function doesn’t handle Case 2 condition and break the loop in Case 1. (Case 1 & 2 are redundant while adding a single node to a root list.)
binomial-tree)) ¶automatically generated reader method
binomial-tree)) ¶automatically generated writer method
binomial-tree)) ¶automatically generated reader method
binomial-tree)) ¶automatically generated writer method
binomial-heap)) ¶automatically generated reader method
head.
binomial-heap)) ¶automatically generated writer method
head.
binomial-tree)) ¶automatically generated reader method
key.
binomial-tree)) ¶automatically generated writer method
key.
binomial-tree)) ¶automatically generated reader method
binomial-tree)) ¶automatically generated writer method
binomial-tree)) ¶automatically generated reader method
binomial-tree)) ¶automatically generated writer method
Binomial tree container.
binomial-heap::binomial-tree
:parent
(integer 0 *)
0
:degree
binomial-heap::binomial-tree
:child
binomial-heap::binomial-tree
:sibling
:key
| Jump to: | (
C D E F G H I K L M P S T U W |
|---|
| Jump to: | (
C D E F G H I K L M P S T U W |
|---|
| Jump to: | C D H K P S T |
|---|
| Jump to: | C D H K P S T |
|---|
| Jump to: | B C F M O P S U |
|---|
| Jump to: | B C F M O P S U |
|---|