The minheap Reference Manual

This is the minheap Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sat Dec 03 22:30:29 2022 GMT+0.

Table of Contents


1 Introduction


2 Systems

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


2.1 minheap

Various heap/priority queue data structures

Maintainer

Stephan Frank <>

License

BSD, see LICENSE

Source

minheap.asd.

Child Components

3 Files

Files are sorted by type and then listed depth-first from the systems components trees.


3.1 Lisp


3.1.1 minheap/minheap.asd

Source

minheap.asd.

Parent Component

minheap (system).

ASDF Systems

minheap.


3.1.2 minheap/binary-heap.lisp

Source

minheap.asd.

Parent Component

minheap (system).

Packages

binary-heap.

Public Interface
Internals

3.1.3 minheap/fib-heap.lisp

Source

minheap.asd.

Parent Component

minheap (system).

Packages

fib-heap.

Public Interface
Internals

3.1.4 minheap/pairing-heap-elmasri.lisp

Source

minheap.asd.

Parent Component

minheap (system).

Packages

pairing-elmasri.

Public Interface
Internals

3.1.5 minheap/pairing-heap.lisp

Source

minheap.asd.

Parent Component

minheap (system).

Packages

pairing-heap.

Public Interface
Internals

3.1.6 minheap/pairing-heap-listbased.lisp

Source

minheap.asd.

Parent Component

minheap (system).

Packages

pairing-heap-list.

Public Interface
Internals

3.1.7 minheap/rank-pairing-heap.lisp

Source

minheap.asd.

Parent Component

minheap (system).

Packages

rank-pairing-heap.

Public Interface
Internals

3.1.8 minheap/rank-pairing-heap-clist.lisp

Source

minheap.asd.

Parent Component

minheap (system).

Packages

rank-pairing-heap-clist.

Public Interface
Internals

3.1.9 minheap/splay-heap.lisp

Source

minheap.asd.

Parent Component

minheap (system).

Packages

splay-heap.

Public Interface
Internals

3.1.10 minheap/violation-heap.lisp

Source

minheap.asd.

Parent Component

minheap (system).

Packages

violation-heap.

Public Interface
Internals

4 Packages

Packages are listed by definition order.


4.1 splay-heap

Source

splay-heap.lisp.

Use List

common-lisp.

Public Interface
Internals

4.2 pairing-elmasri

Source

pairing-heap-elmasri.lisp.

Use List

common-lisp.

Public Interface
Internals

4.3 binary-heap

Source

binary-heap.lisp.

Use List

common-lisp.

Public Interface
Internals

4.4 rank-pairing-heap-clist

Source

rank-pairing-heap-clist.lisp.

Use List

common-lisp.

Public Interface
Internals

4.5 rank-pairing-heap

Source

rank-pairing-heap.lisp.

Use List

common-lisp.

Public Interface
Internals

4.6 fib-heap

Source

fib-heap.lisp.

Use List

common-lisp.

Public Interface
Internals

4.7 violation-heap

Source

violation-heap.lisp.

Use List

common-lisp.

Public Interface
Internals

4.8 pairing-heap-list

Source

pairing-heap-listbased.lisp.

Use List

common-lisp.

Public Interface
Internals

4.9 pairing-heap

Source

pairing-heap.lisp.

Use List

common-lisp.

Public Interface
Internals

5 Definitions

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


5.1 Public Interface


5.1.1 Ordinary functions

Function: alist-to-heap (alist)

Coerces an ALIST of (KEY . VALUE) conses into a heap.

Package

binary-heap.

Source

binary-heap.lisp.

Function: clear-heap (heap)
Package

splay-heap.

Source

splay-heap.lisp.

Function: clear-heap (heap)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: clear-heap (heap)
Package

binary-heap.

Source

binary-heap.lisp.

Function: clear-heap (heap)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: clear-heap (heap)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: clear-heap (heap)
Package

fib-heap.

Source

fib-heap.lisp.

Function: clear-heap (heap)
Package

violation-heap.

Source

violation-heap.lisp.

Function: clear-heap (heap)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: clear-heap (heap)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: decrease-key (heap node key)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: decrease-key (heap node key)
Package

binary-heap.

Source

binary-heap.lisp.

Function: decrease-key (heap node key)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: decrease-key (heap node key)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: decrease-key (heap node key)
Package

fib-heap.

Source

fib-heap.lisp.

Function: decrease-key (heap node key)
Package

violation-heap.

Source

violation-heap.lisp.

Function: decrease-key (heap node key)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: decrease-key (heap node key)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: empty-p (heap)
Package

splay-heap.

Source

splay-heap.lisp.

Function: empty-p (heap)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: empty-p (heap)
Package

binary-heap.

Source

binary-heap.lisp.

Function: empty-p (heap)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: empty-p (heap)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: empty-p (heap)

Return NIL if HEAP is empty, otherwise the minnimal node.

Package

fib-heap.

Source

fib-heap.lisp.

Function: empty-p (heap)
Package

violation-heap.

Source

violation-heap.lisp.

Function: empty-p (heap)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: empty-p (heap)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: extract-min (heap)
Package

splay-heap.

Source

splay-heap.lisp.

Function: extract-min (heap)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: extract-min (heap)
Package

binary-heap.

Source

binary-heap.lisp.

Function: extract-min (heap)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: extract-min (heap)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: extract-min (heap)
Package

fib-heap.

Source

fib-heap.lisp.

Function: extract-min (heap)
Package

violation-heap.

Source

violation-heap.lisp.

Function: extract-min (heap)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: extract-min (heap)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: extract-node (heap key)
Package

splay-heap.

Source

splay-heap.lisp.

Function: extract-node (heap node)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: extract-node (heap node)
Package

binary-heap.

Source

binary-heap.lisp.

Function: extract-node (heap node)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: extract-node (heap node)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: extract-node (heap node)
Package

fib-heap.

Source

fib-heap.lisp.

Function: extract-node (heap node)
Package

violation-heap.

Source

violation-heap.lisp.

Function: extract-node (heap node)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: extract-node (heap node)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: heap-size (heap)
Package

splay-heap.

Source

splay-heap.lisp.

Function: heap-size (heap)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: heap-size (heap)
Package

binary-heap.

Source

binary-heap.lisp.

Function: heap-size (heap)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: heap-size (heap)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: heap-size (heap)
Package

violation-heap.

Source

violation-heap.lisp.

Function: heap-size (heap)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: heap-size (heap)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: insert (heap key item)
Package

splay-heap.

Source

splay-heap.lisp.

Function: insert (heap key data)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: insert (heap key data)
Package

binary-heap.

Source

binary-heap.lisp.

Function: insert (heap key data)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: insert (heap key data)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: insert (heap key data)

Insert a new node with KEY and associated DATA item into the HEAP root-list. No consolidation is done at this time.

Package

fib-heap.

Source

fib-heap.lisp.

Function: insert (heap key data)
Package

violation-heap.

Source

violation-heap.lisp.

Function: insert (heap key data)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: insert (heap key data)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: meld (heap-a heap-b)

Melds HEAP-A and HEAP-B into HEAP-A and returns it. HEAP-A and HEAP-B may be modified and may have become empty after this operation.

Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: meld (heap-a heap-b)

Melds HEAP-A and HEAP-B into a new heap and returns it. HEAP-A is returned as new union of both heaps.

Package

binary-heap.

Source

binary-heap.lisp.

Function: meld (heap-a heap-b)

Melds HEAP-A and HEAP-B into HEAP-A and returns it. HEAP-B will be empty after this operation but may be used further.

Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: meld (heap-a heap-b)

Melds HEAP-A and HEAP-B into HEAP-A and returns it. HEAP-B will be empty after this operation but may be used further.

Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: meld (heap-a heap-b)

Melds HEAP-A and HEAP-B into a new heap and returns it. HEAP-A and HEAP-B will be empty after this operation but may be used further.

Package

fib-heap.

Source

fib-heap.lisp.

Function: meld (heap-a heap-b)
Package

violation-heap.

Source

violation-heap.lisp.

Function: meld (heap-a heap-b)

Melds HEAP-A and HEAP-B into HEAP-A and returns it. HEAP-B will be empty after this operation but may be used further.

Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: meld (heap-a heap-b)

Melds HEAP-A and HEAP-B into HEAP-A and returns it. HEAP-B will be empty after this operation but may be used further.

Package

pairing-heap.

Source

pairing-heap.lisp.

Function: node-find (heap key)
Package

splay-heap.

Source

splay-heap.lisp.

Function: peek-min (heap)
Package

splay-heap.

Source

splay-heap.lisp.

Function: peek-min (heap)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: peek-min (heap)
Package

binary-heap.

Source

binary-heap.lisp.

Function: peek-min (heap)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: peek-min (heap)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: peek-min (heap)
Package

fib-heap.

Source

fib-heap.lisp.

Function: peek-min (heap)
Package

violation-heap.

Source

violation-heap.lisp.

Function: peek-min (heap)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: peek-min (heap)
Package

pairing-heap.

Source

pairing-heap.lisp.


5.1.2 Generic functions

Generic Reader: heap-size (object)
Package

fib-heap.

Methods
Reader Method: heap-size ((fib-heap fib-heap))

automatically generated reader method

Source

fib-heap.lisp.

Target Slot

nodes.

Generic Writer: (setf heap-size) (object)
Package

fib-heap.

Methods
Writer Method: (setf heap-size) ((fib-heap fib-heap))

automatically generated writer method

Source

fib-heap.lisp.

Target Slot

nodes.


5.1.3 Standalone methods

Method: print-object ((obj pairing-elmasri) stream)
Source

pairing-heap-elmasri.lisp.

Method: print-object ((obj binary-heap) stream)
Source

binary-heap.lisp.

Method: print-object ((obj rank-pairing-heap-clist) stream)
Source

rank-pairing-heap-clist.lisp.

Method: print-object ((obj rank-pairing-heap) stream)
Source

rank-pairing-heap.lisp.

Method: print-object ((obj fib-heap) stream)
Source

fib-heap.lisp.

Method: print-object ((obj node) stream)
Source

fib-heap.lisp.

Method: print-object ((obj violation-heap) stream)
Source

violation-heap.lisp.

Method: print-object ((obj pairing-heap) stream)
Source

pairing-heap-listbased.lisp.

Method: print-object ((obj pairing-heap) stream)
Source

pairing-heap.lisp.


5.1.4 Classes

Class: binary-heap
Package

binary-heap.

Source

binary-heap.lisp.

Direct methods
Direct slots
Slot: array
Package

common-lisp.

Type

(vector (or null binary-heap::node))

Initform

(make-array binary-heap::+initial-size+ :adjustable t :fill-pointer 0 :element-type (quote (or null binary-heap::node)) :initial-element nil)

Initargs

:array

Readers

bin-heap-array.

Writers

(setf bin-heap-array).

Class: fib-heap
Package

fib-heap.

Source

fib-heap.lisp.

Direct methods
Direct slots
Slot: min
Package

common-lisp.

Type

(or null fib-heap::node)

Readers

min-node.

Writers

(setf min-node).

Slot: nodes
Type

(integer 0 4611686018427387903)

Initform

0

Readers

heap-size.

Writers

(setf heap-size).

Class: pairing-elmasri
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Direct methods

print-object.

Direct slots
Slot: size
Type

(integer 0 *)

Initform

0

Initargs

:size

Slot: root
Type

(or null pairing-elmasri::node)

Initargs

:root

Slot: min
Package

common-lisp.

Type

(or null pairing-elmasri::node)

Initargs

:min

Slot: decreased
Type

list

Initargs

:decreased

Slot: pooled
Type

fixnum

Initform

0

Initargs

:pooled

Class: pairing-heap
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Direct methods

print-object.

Direct slots
Slot: size
Type

(integer 0 *)

Initform

0

Initargs

:size

Slot: root
Type

(or null pairing-heap-list::node)

Initargs

:root

Class: pairing-heap
Package

pairing-heap.

Source

pairing-heap.lisp.

Direct methods

print-object.

Direct slots
Slot: size
Type

(integer 0 *)

Initform

0

Initargs

:size

Slot: root
Type

(or null pairing-heap::node)

Initargs

:root

Class: rank-pairing-heap
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Direct methods
Direct slots
Slot: size
Type

(integer 0 *)

Initform

0

Initargs

:size

Readers

heap-size-access.

Writers

(setf heap-size-access).

Slot: root
Type

(or null rank-pairing-heap::node)

Initargs

:roots

Class: rank-pairing-heap-clist
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Direct methods

print-object.

Direct slots
Slot: size
Type

(integer 0 *)

Initform

0

Initargs

:size

Slot: roots
Type

list

Initargs

:roots

Class: violation-heap
Package

violation-heap.

Source

violation-heap.lisp.

Direct methods

print-object.

Direct slots
Slot: size
Type

(integer 0 *)

Initform

0

Initargs

:size

Slot: rootlist
Type

(or null violation-heap::node)

Initargs

:rootlist


5.2 Internals


5.2.1 Constants

Constant: +initial-size+

initial queue vector size

Package

binary-heap.

Source

binary-heap.lisp.


5.2.2 Ordinary functions

Function: %make-node (key data)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: %make-node (key data index)
Package

binary-heap.

Source

binary-heap.lisp.

Function: %make-node (key data)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: %make-node (key data)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: %make-node (key data)
Package

fib-heap.

Source

fib-heap.lisp.

Function: %make-node (key data)
Package

violation-heap.

Source

violation-heap.lisp.

Function: %make-node (key data)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: %make-node (key data)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: 1st/2nd-child-p (node)

Returns the parent of NODE if NODE is a first or second child, NIL otherwise.

Package

violation-heap.

Source

violation-heap.lisp.

Function: attach-child (parent child)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: attach-child (parent child)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: attach-child (parent child)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: attach-child (parent child)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: attach-child (parent child)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: attach-next (node next-node)
Package

violation-heap.

Source

violation-heap.lisp.

Function: cascading-cut (heap cnode)
Package

fib-heap.

Source

fib-heap.lisp.

Function: clean-p (node)
Package

violation-heap.

Source

violation-heap.lisp.

Function: clean-up (heap)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: cleaning (heap)
Package

violation-heap.

Source

violation-heap.lisp.

Function: combine-siblings (parent)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: combine-siblings (parent)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: combine-siblings (parent)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: consolidate (heap)
Package

fib-heap.

Source

fib-heap.lisp.

Function: copy-node (instance)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: copy-node (instance)
Package

binary-heap.

Source

binary-heap.lisp.

Function: copy-node (instance)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: copy-node (instance)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: copy-node (instance)
Package

fib-heap.

Source

fib-heap.lisp.

Function: copy-node (instance)
Package

violation-heap.

Source

violation-heap.lisp.

Function: copy-node (instance)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: copy-node (instance)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: copy-splay-node (instance)
Package

splay-heap.

Source

splay-heap.lisp.

Function: cut (heap x y)

Remove X from the child list of Y.

Package

fib-heap.

Source

fib-heap.lisp.

Function: cut-child (parent node)
Package

violation-heap.

Source

violation-heap.lisp.

Function: cut-parent (node)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: cut-parent (node)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: cut-parent (node)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: cut-parent (node)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: cut-parent (node)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: d-rank (node)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: d-rank (node)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: delete-node-from-childseq (node first-child &optional replace)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: delete-node-from-childseq (node first-child)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: goodness (node)

Calculate new goodness value for NODE.

Package

violation-heap.

Source

violation-heap.lisp.

Function: insert-circular (list node)

Insert NODE into circular LIST rooted at the minimum key. Return the expanded list, again rooted at the minimum key.

Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: join-lists (list-a list-b)

Destructively joins two circular node lists LIST-A and LIST-B returning the smaller of the two entry points as result.

Package

violation-heap.

Source

violation-heap.lisp.

Function: left (k)
Package

binary-heap.

Source

binary-heap.lisp.

Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Make node Y a child of node X.

Package

fib-heap.

Source

fib-heap.lisp.

Package

violation-heap.

Source

violation-heap.lisp.

Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Package

pairing-heap.

Source

pairing-heap.lisp.

Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Package

pairing-heap.

Source

pairing-heap.lisp.

Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: make-circular (node)

Create a singleton circular list.

Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: make-node (key data)

Return a new heap node with KEY and DATA as key/data items and set the cycle list accordingly.

Package

fib-heap.

Source

fib-heap.lisp.

Function: make-singular-list (node)
Package

violation-heap.

Source

violation-heap.lisp.

Function: make-splay-node (&key segment element left right)
Package

splay-heap.

Source

splay-heap.lisp.

Function: meld-circular (list-a list-b)

Destructively melds two circular non-NIL lists. Each list must be rooted by the node element with minimum key.

Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: no-violation-p (node)
Package

violation-heap.

Source

violation-heap.lisp.

Reader: node-child (instance)
Writer: (setf node-child) (instance)
Package

fib-heap.

Source

fib-heap.lisp.

Target Slot

child.

Reader: node-child (instance)
Writer: (setf node-child) (instance)
Package

violation-heap.

Source

violation-heap.lisp.

Target Slot

child.

Reader: node-children (instance)
Writer: (setf node-children) (instance)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Target Slot

children.

Reader: node-data (instance)
Writer: (setf node-data) (instance)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Target Slot

data.

Reader: node-data (instance)
Writer: (setf node-data) (instance)
Package

binary-heap.

Source

binary-heap.lisp.

Target Slot

data.

Reader: node-data (instance)
Writer: (setf node-data) (instance)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Target Slot

data.

Reader: node-data (instance)
Writer: (setf node-data) (instance)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Target Slot

data.

Reader: node-data (instance)
Writer: (setf node-data) (instance)
Package

fib-heap.

Source

fib-heap.lisp.

Target Slot

data.

Reader: node-data (instance)
Writer: (setf node-data) (instance)
Package

violation-heap.

Source

violation-heap.lisp.

Target Slot

data.

Reader: node-data (instance)
Writer: (setf node-data) (instance)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Target Slot

data.

Reader: node-data (instance)
Writer: (setf node-data) (instance)
Package

pairing-heap.

Source

pairing-heap.lisp.

Target Slot

data.

Reader: node-degree (instance)
Writer: (setf node-degree) (instance)
Package

fib-heap.

Source

fib-heap.lisp.

Target Slot

degree.

Reader: node-goodness (instance)
Writer: (setf node-goodness) (instance)
Package

violation-heap.

Source

violation-heap.lisp.

Target Slot

goodness.

Reader: node-index (instance)
Writer: (setf node-index) (instance)
Package

binary-heap.

Source

binary-heap.lisp.

Target Slot

index.

Reader: node-key (instance)
Writer: (setf node-key) (instance)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Target Slot

key.

Reader: node-key (instance)
Writer: (setf node-key) (instance)
Package

binary-heap.

Source

binary-heap.lisp.

Target Slot

key.

Reader: node-key (instance)
Writer: (setf node-key) (instance)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Target Slot

key.

Reader: node-key (instance)
Writer: (setf node-key) (instance)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Target Slot

key.

Reader: node-key (instance)
Writer: (setf node-key) (instance)
Package

fib-heap.

Source

fib-heap.lisp.

Target Slot

key.

Reader: node-key (instance)
Writer: (setf node-key) (instance)
Package

violation-heap.

Source

violation-heap.lisp.

Target Slot

key.

Reader: node-key (instance)
Writer: (setf node-key) (instance)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Target Slot

key.

Reader: node-key (instance)
Writer: (setf node-key) (instance)
Package

pairing-heap.

Source

pairing-heap.lisp.

Target Slot

key.

Reader: node-lchild (instance)
Writer: (setf node-lchild) (instance)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Target Slot

lchild.

Reader: node-lchild (instance)
Writer: (setf node-lchild) (instance)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Target Slot

lchild.

Reader: node-lchild (instance)
Writer: (setf node-lchild) (instance)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Target Slot

lchild.

Reader: node-lchild (instance)
Writer: (setf node-lchild) (instance)
Package

pairing-heap.

Source

pairing-heap.lisp.

Target Slot

lchild.

Reader: node-left (instance)
Writer: (setf node-left) (instance)
Package

fib-heap.

Source

fib-heap.lisp.

Target Slot

left.

Reader: node-mark (instance)
Writer: (setf node-mark) (instance)
Package

fib-heap.

Source

fib-heap.lisp.

Target Slot

mark.

Reader: node-next (instance)
Writer: (setf node-next) (instance)
Package

violation-heap.

Source

violation-heap.lisp.

Target Slot

next.

Function: node-p (object)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: node-p (object)
Package

binary-heap.

Source

binary-heap.lisp.

Function: node-p (object)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: node-p (object)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Function: node-p (object)
Package

fib-heap.

Source

fib-heap.lisp.

Function: node-p (object)
Package

violation-heap.

Source

violation-heap.lisp.

Function: node-p (object)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: node-p (object)
Package

pairing-heap.

Source

pairing-heap.lisp.

Reader: node-parent (instance)
Writer: (setf node-parent) (instance)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Target Slot

parent.

Reader: node-parent (instance)
Writer: (setf node-parent) (instance)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Target Slot

parent.

Reader: node-parent (instance)
Writer: (setf node-parent) (instance)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Target Slot

parent.

Reader: node-parent (instance)
Writer: (setf node-parent) (instance)
Package

fib-heap.

Source

fib-heap.lisp.

Target Slot

parent.

Reader: node-parent (instance)
Writer: (setf node-parent) (instance)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Target Slot

parent.

Reader: node-parent (instance)
Writer: (setf node-parent) (instance)
Package

pairing-heap.

Source

pairing-heap.lisp.

Target Slot

parent.

Reader: node-pooled (instance)
Writer: (setf node-pooled) (instance)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Target Slot

pooled.

Reader: node-prev (instance)
Writer: (setf node-prev) (instance)
Package

violation-heap.

Source

violation-heap.lisp.

Target Slot

prev.

Reader: node-rank (instance)
Writer: (setf node-rank) (instance)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Target Slot

rank.

Reader: node-rank (instance)
Writer: (setf node-rank) (instance)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Target Slot

rank.

Reader: node-rank (instance)
Writer: (setf node-rank) (instance)
Package

violation-heap.

Source

violation-heap.lisp.

Target Slot

rank.

Reader: node-rchild (instance)
Writer: (setf node-rchild) (instance)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Target Slot

rchild.

Reader: node-rchild (instance)
Writer: (setf node-rchild) (instance)
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Target Slot

rchild.

Reader: node-right (instance)
Writer: (setf node-right) (instance)
Package

fib-heap.

Source

fib-heap.lisp.

Target Slot

right.

Reader: node-sibling (instance)
Writer: (setf node-sibling) (instance)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Target Slot

sibling.

Reader: node-sibling (instance)
Writer: (setf node-sibling) (instance)
Package

pairing-heap.

Source

pairing-heap.lisp.

Target Slot

sibling.

Function: pair-children (parent)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: pair-children (parent)
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Function: pair-children (parent)
Package

pairing-heap.

Source

pairing-heap.lisp.

Function: parent (k)
Package

binary-heap.

Source

binary-heap.lisp.

Function: perlocate-up (array vindex)
Package

binary-heap.

Source

binary-heap.lisp.

Function: right (k)
Package

binary-heap.

Source

binary-heap.lisp.

Function: root-p (min node)
Package

violation-heap.

Source

violation-heap.lisp.

Function: rootp (node)
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Function: segment< (a b)
Package

splay-heap.

Source

splay-heap.lisp.

Function: segment> (a b)
Package

splay-heap.

Source

splay-heap.lisp.

Function: sink (array index)
Package

binary-heap.

Source

binary-heap.lisp.

Reader: splay-node-element (instance)
Writer: (setf splay-node-element) (instance)
Package

splay-heap.

Source

splay-heap.lisp.

Target Slot

element.

Reader: splay-node-left (instance)
Writer: (setf splay-node-left) (instance)
Package

splay-heap.

Source

splay-heap.lisp.

Target Slot

left.

Function: splay-node-p (object)
Package

splay-heap.

Source

splay-heap.lisp.

Reader: splay-node-right (instance)
Writer: (setf splay-node-right) (instance)
Package

splay-heap.

Source

splay-heap.lisp.

Target Slot

right.

Reader: splay-node-segment (instance)
Writer: (setf splay-node-segment) (instance)
Package

splay-heap.

Source

splay-heap.lisp.

Target Slot

segment.

Function: splay-tree-delete (tree segment)
Package

splay-heap.

Source

splay-heap.lisp.

Function: splay-tree-insert (tree segment element &optional overwrite)
Package

splay-heap.

Source

splay-heap.lisp.

Function: splay-tree-splay (tree segment)
Package

splay-heap.

Source

splay-heap.lisp.

Function: splice-lists (list-a list-b)

Splice two circular lists together

Package

fib-heap.

Source

fib-heap.lisp.

Function: swap-nodes (array i j)
Package

binary-heap.

Source

binary-heap.lisp.

Function: to-front (min node)

Puts NODE to the front of the circular list which has MIN as front element. Return NODE as new front element.

Package

violation-heap.

Source

violation-heap.lisp.

Package

violation-heap.

Source

violation-heap.lisp.

Function: update-decrease (heap node key)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: update-min (heap node key)
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Function: vector-to-heapvector (vector)
Package

binary-heap.

Source

binary-heap.lisp.


5.2.3 Generic functions

Generic Reader: bin-heap-array (object)
Package

binary-heap.

Methods
Reader Method: bin-heap-array ((binary-heap binary-heap))

automatically generated reader method

Source

binary-heap.lisp.

Target Slot

array.

Generic Writer: (setf bin-heap-array) (object)
Package

binary-heap.

Methods
Writer Method: (setf bin-heap-array) ((binary-heap binary-heap))

automatically generated writer method

Source

binary-heap.lisp.

Target Slot

array.

Generic Reader: heap-size-access (object)
Package

rank-pairing-heap.

Methods
Reader Method: heap-size-access ((rank-pairing-heap rank-pairing-heap))

automatically generated reader method

Source

rank-pairing-heap.lisp.

Target Slot

size.

Generic Writer: (setf heap-size-access) (object)
Package

rank-pairing-heap.

Methods
Writer Method: (setf heap-size-access) ((rank-pairing-heap rank-pairing-heap))

automatically generated writer method

Source

rank-pairing-heap.lisp.

Target Slot

size.

Generic Reader: min-node (object)
Package

fib-heap.

Methods
Reader Method: min-node ((fib-heap fib-heap))

automatically generated reader method

Source

fib-heap.lisp.

Target Slot

min.

Generic Writer: (setf min-node) (object)
Package

fib-heap.

Methods
Writer Method: (setf min-node) ((fib-heap fib-heap))

automatically generated writer method

Source

fib-heap.lisp.

Target Slot

min.


5.2.4 Structures

Structure: node
Package

pairing-elmasri.

Source

pairing-heap-elmasri.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: key
Type

fixnum

Initform

0

Readers

node-key.

Writers

(setf node-key).

Slot: data
Readers

node-data.

Writers

(setf node-data).

Slot: pooled
Type

boolean

Readers

node-pooled.

Writers

(setf node-pooled).

Slot: lchild
Type

(or null pairing-elmasri::node)

Readers

node-lchild.

Writers

(setf node-lchild).

Slot: sibling
Type

(or null pairing-elmasri::node)

Readers

node-sibling.

Writers

(setf node-sibling).

Slot: parent
Type

(or null pairing-elmasri::node)

Readers

node-parent.

Writers

(setf node-parent).

Structure: node
Package

binary-heap.

Source

binary-heap.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: key
Type

fixnum

Initform

0

Readers

node-key.

Writers

(setf node-key).

Slot: index
Type

binary-heap::array-index

Initform

0

Readers

node-index.

Writers

(setf node-index).

Slot: data
Readers

node-data.

Writers

(setf node-data).

Structure: node
Package

rank-pairing-heap-clist.

Source

rank-pairing-heap-clist.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: key
Type

fixnum

Initform

0

Readers

node-key.

Writers

(setf node-key).

Slot: data
Readers

node-data.

Writers

(setf node-data).

Slot: lchild
Type

(or null rank-pairing-heap-clist::node)

Readers

node-lchild.

Writers

(setf node-lchild).

Slot: rchild
Type

(or null rank-pairing-heap-clist::node)

Readers

node-rchild.

Writers

(setf node-rchild).

Slot: parent
Type

(or null rank-pairing-heap-clist::node)

Readers

node-parent.

Writers

(setf node-parent).

Slot: rank
Type

(integer 0 89)

Initform

0

Readers

node-rank.

Writers

(setf node-rank).

Structure: node
Package

rank-pairing-heap.

Source

rank-pairing-heap.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: key
Type

fixnum

Initform

0

Readers

node-key.

Writers

(setf node-key).

Slot: data
Readers

node-data.

Writers

(setf node-data).

Slot: lchild
Type

(or null rank-pairing-heap::node)

Readers

node-lchild.

Writers

(setf node-lchild).

Slot: rchild
Type

(or null rank-pairing-heap::node)

Readers

node-rchild.

Writers

(setf node-rchild).

Slot: parent
Type

(or null rank-pairing-heap::node)

Readers

node-parent.

Writers

(setf node-parent).

Slot: rank
Type

(integer 0 62)

Initform

0

Readers

node-rank.

Writers

(setf node-rank).

Structure: node
Package

fib-heap.

Source

fib-heap.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots
Slot: key
Type

fixnum

Initform

0

Readers

node-key.

Writers

(setf node-key).

Slot: data
Readers

node-data.

Writers

(setf node-data).

Slot: parent
Type

(or null fib-heap::node)

Readers

node-parent.

Writers

(setf node-parent).

Slot: child
Type

(or null fib-heap::node)

Readers

node-child.

Writers

(setf node-child).

Slot: left
Type

(or null fib-heap::node)

Readers

node-left.

Writers

(setf node-left).

Slot: right
Type

(or null fib-heap::node)

Readers

node-right.

Writers

(setf node-right).

Slot: degree
Type

(integer 0 90)

Initform

0

Readers

node-degree.

Writers

(setf node-degree).

Slot: mark
Type

boolean

Readers

node-mark.

Writers

(setf node-mark).

Structure: node
Package

violation-heap.

Source

violation-heap.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: key
Type

fixnum

Initform

0

Readers

node-key.

Writers

(setf node-key).

Slot: data
Readers

node-data.

Writers

(setf node-data).

Slot: prev
Type

(or null violation-heap::node)

Readers

node-prev.

Writers

(setf node-prev).

Slot: next
Type

(or null violation-heap::node)

Readers

node-next.

Writers

(setf node-next).

Slot: child
Type

(or null violation-heap::node)

Readers

node-child.

Writers

(setf node-child).

Slot: rank
Type

(integer 0 4611686018427387903)

Initform

0

Readers

node-rank.

Writers

(setf node-rank).

Slot: goodness
Type

(integer 0 4611686018427387903)

Initform

0

Readers

node-goodness.

Writers

(setf node-goodness).

Structure: node
Package

pairing-heap-list.

Source

pairing-heap-listbased.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: key
Type

fixnum

Initform

0

Readers

node-key.

Writers

(setf node-key).

Slot: data
Readers

node-data.

Writers

(setf node-data).

Slot: children
Type

list

Readers

node-children.

Writers

(setf node-children).

Slot: parent
Type

(or null pairing-heap-list::node)

Readers

node-parent.

Writers

(setf node-parent).

Structure: node
Package

pairing-heap.

Source

pairing-heap.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: key
Type

fixnum

Initform

0

Readers

node-key.

Writers

(setf node-key).

Slot: data
Readers

node-data.

Writers

(setf node-data).

Slot: lchild
Type

(or null pairing-heap::node)

Readers

node-lchild.

Writers

(setf node-lchild).

Slot: sibling
Type

(or null pairing-heap::node)

Readers

node-sibling.

Writers

(setf node-sibling).

Slot: parent
Type

(or null pairing-heap::node)

Readers

node-parent.

Writers

(setf node-parent).

Structure: splay-node
Package

splay-heap.

Source

splay-heap.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: segment
Type

(or fixnum null)

Readers

splay-node-segment.

Writers

(setf splay-node-segment).

Slot: element
Readers

splay-node-element.

Writers

(setf splay-node-element).

Slot: left
Type

(or null splay-heap::splay-node)

Readers

splay-node-left.

Writers

(setf splay-node-left).

Slot: right
Type

(or null splay-heap::splay-node)

Readers

splay-node-right.

Writers

(setf splay-node-right).


5.2.5 Classes

Class: splay-heap
Package

splay-heap.

Source

splay-heap.lisp.

Direct slots
Slot: tree
Type

(or splay-heap::splay-node null)

Slot: size
Type

fixnum

Initform

0


5.2.6 Types

Type: array-index ()
Package

binary-heap.

Source

binary-heap.lisp.


Appendix A Indexes


A.1 Concepts


A.2 Functions

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

%
%make-node: Private ordinary functions
%make-node: Private ordinary functions
%make-node: Private ordinary functions
%make-node: Private ordinary functions
%make-node: Private ordinary functions
%make-node: Private ordinary functions
%make-node: Private ordinary functions
%make-node: Private ordinary functions

(
(setf bin-heap-array): Private generic functions
(setf bin-heap-array): Private generic functions
(setf heap-size): Public generic functions
(setf heap-size): Public generic functions
(setf heap-size-access): Private generic functions
(setf heap-size-access): Private generic functions
(setf min-node): Private generic functions
(setf min-node): Private generic functions
(setf node-child): Private ordinary functions
(setf node-child): Private ordinary functions
(setf node-children): Private ordinary functions
(setf node-data): Private ordinary functions
(setf node-data): Private ordinary functions
(setf node-data): Private ordinary functions
(setf node-data): Private ordinary functions
(setf node-data): Private ordinary functions
(setf node-data): Private ordinary functions
(setf node-data): Private ordinary functions
(setf node-data): Private ordinary functions
(setf node-degree): Private ordinary functions
(setf node-goodness): Private ordinary functions
(setf node-index): Private ordinary functions
(setf node-key): Private ordinary functions
(setf node-key): Private ordinary functions
(setf node-key): Private ordinary functions
(setf node-key): Private ordinary functions
(setf node-key): Private ordinary functions
(setf node-key): Private ordinary functions
(setf node-key): Private ordinary functions
(setf node-key): Private ordinary functions
(setf node-lchild): Private ordinary functions
(setf node-lchild): Private ordinary functions
(setf node-lchild): Private ordinary functions
(setf node-lchild): Private ordinary functions
(setf node-left): Private ordinary functions
(setf node-mark): Private ordinary functions
(setf node-next): Private ordinary functions
(setf node-parent): Private ordinary functions
(setf node-parent): Private ordinary functions
(setf node-parent): Private ordinary functions
(setf node-parent): Private ordinary functions
(setf node-parent): Private ordinary functions
(setf node-parent): Private ordinary functions
(setf node-pooled): Private ordinary functions
(setf node-prev): Private ordinary functions
(setf node-rank): Private ordinary functions
(setf node-rank): Private ordinary functions
(setf node-rank): Private ordinary functions
(setf node-rchild): Private ordinary functions
(setf node-rchild): Private ordinary functions
(setf node-right): Private ordinary functions
(setf node-sibling): Private ordinary functions
(setf node-sibling): Private ordinary functions
(setf splay-node-element): Private ordinary functions
(setf splay-node-left): Private ordinary functions
(setf splay-node-right): Private ordinary functions
(setf splay-node-segment): Private ordinary functions

1
1st/2nd-child-p: Private ordinary functions

A
alist-to-heap: Public ordinary functions
attach-child: Private ordinary functions
attach-child: Private ordinary functions
attach-child: Private ordinary functions
attach-child: Private ordinary functions
attach-child: Private ordinary functions
attach-next: Private ordinary functions

B
bin-heap-array: Private generic functions
bin-heap-array: Private generic functions

C
cascading-cut: Private ordinary functions
clean-p: Private ordinary functions
clean-up: Private ordinary functions
cleaning: Private ordinary functions
clear-heap: Public ordinary functions
clear-heap: Public ordinary functions
clear-heap: Public ordinary functions
clear-heap: Public ordinary functions
clear-heap: Public ordinary functions
clear-heap: Public ordinary functions
clear-heap: Public ordinary functions
clear-heap: Public ordinary functions
clear-heap: Public ordinary functions
combine-siblings: Private ordinary functions
combine-siblings: Private ordinary functions
combine-siblings: Private ordinary functions
consolidate: Private ordinary functions
copy-node: Private ordinary functions
copy-node: Private ordinary functions
copy-node: Private ordinary functions
copy-node: Private ordinary functions
copy-node: Private ordinary functions
copy-node: Private ordinary functions
copy-node: Private ordinary functions
copy-node: Private ordinary functions
copy-splay-node: Private ordinary functions
cut: Private ordinary functions
cut-child: Private ordinary functions
cut-parent: Private ordinary functions
cut-parent: Private ordinary functions
cut-parent: Private ordinary functions
cut-parent: Private ordinary functions
cut-parent: Private ordinary functions

D
d-rank: Private ordinary functions
d-rank: Private ordinary functions
decrease-key: Public ordinary functions
decrease-key: Public ordinary functions
decrease-key: Public ordinary functions
decrease-key: Public ordinary functions
decrease-key: Public ordinary functions
decrease-key: Public ordinary functions
decrease-key: Public ordinary functions
decrease-key: Public ordinary functions
delete-node-from-childseq: Private ordinary functions
delete-node-from-childseq: Private ordinary functions

E
empty-p: Public ordinary functions
empty-p: Public ordinary functions
empty-p: Public ordinary functions
empty-p: Public ordinary functions
empty-p: Public ordinary functions
empty-p: Public ordinary functions
empty-p: Public ordinary functions
empty-p: Public ordinary functions
empty-p: Public ordinary functions
extract-min: Public ordinary functions
extract-min: Public ordinary functions
extract-min: Public ordinary functions
extract-min: Public ordinary functions
extract-min: Public ordinary functions
extract-min: Public ordinary functions
extract-min: Public ordinary functions
extract-min: Public ordinary functions
extract-min: Public ordinary functions
extract-node: Public ordinary functions
extract-node: Public ordinary functions
extract-node: Public ordinary functions
extract-node: Public ordinary functions
extract-node: Public ordinary functions
extract-node: Public ordinary functions
extract-node: Public ordinary functions
extract-node: Public ordinary functions
extract-node: Public ordinary functions

F
Function, %make-node: Private ordinary functions
Function, %make-node: Private ordinary functions
Function, %make-node: Private ordinary functions
Function, %make-node: Private ordinary functions
Function, %make-node: Private ordinary functions
Function, %make-node: Private ordinary functions
Function, %make-node: Private ordinary functions
Function, %make-node: Private ordinary functions
Function, (setf node-child): Private ordinary functions
Function, (setf node-child): Private ordinary functions
Function, (setf node-children): Private ordinary functions
Function, (setf node-data): Private ordinary functions
Function, (setf node-data): Private ordinary functions
Function, (setf node-data): Private ordinary functions
Function, (setf node-data): Private ordinary functions
Function, (setf node-data): Private ordinary functions
Function, (setf node-data): Private ordinary functions
Function, (setf node-data): Private ordinary functions
Function, (setf node-data): Private ordinary functions
Function, (setf node-degree): Private ordinary functions
Function, (setf node-goodness): Private ordinary functions
Function, (setf node-index): Private ordinary functions
Function, (setf node-key): Private ordinary functions
Function, (setf node-key): Private ordinary functions
Function, (setf node-key): Private ordinary functions
Function, (setf node-key): Private ordinary functions
Function, (setf node-key): Private ordinary functions
Function, (setf node-key): Private ordinary functions
Function, (setf node-key): Private ordinary functions
Function, (setf node-key): Private ordinary functions
Function, (setf node-lchild): Private ordinary functions
Function, (setf node-lchild): Private ordinary functions
Function, (setf node-lchild): Private ordinary functions
Function, (setf node-lchild): Private ordinary functions
Function, (setf node-left): Private ordinary functions
Function, (setf node-mark): Private ordinary functions
Function, (setf node-next): Private ordinary functions
Function, (setf node-parent): Private ordinary functions
Function, (setf node-parent): Private ordinary functions
Function, (setf node-parent): Private ordinary functions
Function, (setf node-parent): Private ordinary functions
Function, (setf node-parent): Private ordinary functions
Function, (setf node-parent): Private ordinary functions
Function, (setf node-pooled): Private ordinary functions
Function, (setf node-prev): Private ordinary functions
Function, (setf node-rank): Private ordinary functions
Function, (setf node-rank): Private ordinary functions
Function, (setf node-rank): Private ordinary functions
Function, (setf node-rchild): Private ordinary functions
Function, (setf node-rchild): Private ordinary functions
Function, (setf node-right): Private ordinary functions
Function, (setf node-sibling): Private ordinary functions
Function, (setf node-sibling): Private ordinary functions
Function, (setf splay-node-element): Private ordinary functions
Function, (setf splay-node-left): Private ordinary functions
Function, (setf splay-node-right): Private ordinary functions
Function, (setf splay-node-segment): Private ordinary functions
Function, 1st/2nd-child-p: Private ordinary functions
Function, alist-to-heap: Public ordinary functions
Function, attach-child: Private ordinary functions
Function, attach-child: Private ordinary functions
Function, attach-child: Private ordinary functions
Function, attach-child: Private ordinary functions
Function, attach-child: Private ordinary functions
Function, attach-next: Private ordinary functions
Function, cascading-cut: Private ordinary functions
Function, clean-p: Private ordinary functions
Function, clean-up: Private ordinary functions
Function, cleaning: Private ordinary functions
Function, clear-heap: Public ordinary functions
Function, clear-heap: Public ordinary functions
Function, clear-heap: Public ordinary functions
Function, clear-heap: Public ordinary functions
Function, clear-heap: Public ordinary functions
Function, clear-heap: Public ordinary functions
Function, clear-heap: Public ordinary functions
Function, clear-heap: Public ordinary functions
Function, clear-heap: Public ordinary functions
Function, combine-siblings: Private ordinary functions
Function, combine-siblings: Private ordinary functions
Function, combine-siblings: Private ordinary functions
Function, consolidate: Private ordinary functions
Function, copy-node: Private ordinary functions
Function, copy-node: Private ordinary functions
Function, copy-node: Private ordinary functions
Function, copy-node: Private ordinary functions
Function, copy-node: Private ordinary functions
Function, copy-node: Private ordinary functions
Function, copy-node: Private ordinary functions
Function, copy-node: Private ordinary functions
Function, copy-splay-node: Private ordinary functions
Function, cut: Private ordinary functions
Function, cut-child: Private ordinary functions
Function, cut-parent: Private ordinary functions
Function, cut-parent: Private ordinary functions
Function, cut-parent: Private ordinary functions
Function, cut-parent: Private ordinary functions
Function, cut-parent: Private ordinary functions
Function, d-rank: Private ordinary functions
Function, d-rank: Private ordinary functions
Function, decrease-key: Public ordinary functions
Function, decrease-key: Public ordinary functions
Function, decrease-key: Public ordinary functions
Function, decrease-key: Public ordinary functions
Function, decrease-key: Public ordinary functions
Function, decrease-key: Public ordinary functions
Function, decrease-key: Public ordinary functions
Function, decrease-key: Public ordinary functions
Function, delete-node-from-childseq: Private ordinary functions
Function, delete-node-from-childseq: Private ordinary functions
Function, empty-p: Public ordinary functions
Function, empty-p: Public ordinary functions
Function, empty-p: Public ordinary functions
Function, empty-p: Public ordinary functions
Function, empty-p: Public ordinary functions
Function, empty-p: Public ordinary functions
Function, empty-p: Public ordinary functions
Function, empty-p: Public ordinary functions
Function, empty-p: Public ordinary functions
Function, extract-min: Public ordinary functions
Function, extract-min: Public ordinary functions
Function, extract-min: Public ordinary functions
Function, extract-min: Public ordinary functions
Function, extract-min: Public ordinary functions
Function, extract-min: Public ordinary functions
Function, extract-min: Public ordinary functions
Function, extract-min: Public ordinary functions
Function, extract-min: Public ordinary functions
Function, extract-node: Public ordinary functions
Function, extract-node: Public ordinary functions
Function, extract-node: Public ordinary functions
Function, extract-node: Public ordinary functions
Function, extract-node: Public ordinary functions
Function, extract-node: Public ordinary functions
Function, extract-node: Public ordinary functions
Function, extract-node: Public ordinary functions
Function, extract-node: Public ordinary functions
Function, goodness: Private ordinary functions
Function, heap-size: Public ordinary functions
Function, heap-size: Public ordinary functions
Function, heap-size: Public ordinary functions
Function, heap-size: Public ordinary functions
Function, heap-size: Public ordinary functions
Function, heap-size: Public ordinary functions
Function, heap-size: Public ordinary functions
Function, heap-size: Public ordinary functions
Function, insert: Public ordinary functions
Function, insert: Public ordinary functions
Function, insert: Public ordinary functions
Function, insert: Public ordinary functions
Function, insert: Public ordinary functions
Function, insert: Public ordinary functions
Function, insert: Public ordinary functions
Function, insert: Public ordinary functions
Function, insert: Public ordinary functions
Function, insert-circular: Private ordinary functions
Function, join-lists: Private ordinary functions
Function, left: Private ordinary functions
Function, link: Private ordinary functions
Function, link: Private ordinary functions
Function, link: Private ordinary functions
Function, link: Private ordinary functions
Function, link: Private ordinary functions
Function, link: Private ordinary functions
Function, link-children: Private ordinary functions
Function, link-children: Private ordinary functions
Function, link-children: Private ordinary functions
Function, link-fair: Private ordinary functions
Function, link-fair: Private ordinary functions
Function, link-unfair: Private ordinary functions
Function, make-circular: Private ordinary functions
Function, make-node: Private ordinary functions
Function, make-singular-list: Private ordinary functions
Function, make-splay-node: Private ordinary functions
Function, meld: Public ordinary functions
Function, meld: Public ordinary functions
Function, meld: Public ordinary functions
Function, meld: Public ordinary functions
Function, meld: Public ordinary functions
Function, meld: Public ordinary functions
Function, meld: Public ordinary functions
Function, meld: Public ordinary functions
Function, meld-circular: Private ordinary functions
Function, no-violation-p: Private ordinary functions
Function, node-child: Private ordinary functions
Function, node-child: Private ordinary functions
Function, node-children: Private ordinary functions
Function, node-data: Private ordinary functions
Function, node-data: Private ordinary functions
Function, node-data: Private ordinary functions
Function, node-data: Private ordinary functions
Function, node-data: Private ordinary functions
Function, node-data: Private ordinary functions
Function, node-data: Private ordinary functions
Function, node-data: Private ordinary functions
Function, node-degree: Private ordinary functions
Function, node-find: Public ordinary functions
Function, node-goodness: Private ordinary functions
Function, node-index: Private ordinary functions
Function, node-key: Private ordinary functions
Function, node-key: Private ordinary functions
Function, node-key: Private ordinary functions
Function, node-key: Private ordinary functions
Function, node-key: Private ordinary functions
Function, node-key: Private ordinary functions
Function, node-key: Private ordinary functions
Function, node-key: Private ordinary functions
Function, node-lchild: Private ordinary functions
Function, node-lchild: Private ordinary functions
Function, node-lchild: Private ordinary functions
Function, node-lchild: Private ordinary functions
Function, node-left: Private ordinary functions
Function, node-mark: Private ordinary functions
Function, node-next: Private ordinary functions
Function, node-p: Private ordinary functions
Function, node-p: Private ordinary functions
Function, node-p: Private ordinary functions
Function, node-p: Private ordinary functions
Function, node-p: Private ordinary functions
Function, node-p: Private ordinary functions
Function, node-p: Private ordinary functions
Function, node-p: Private ordinary functions
Function, node-parent: Private ordinary functions
Function, node-parent: Private ordinary functions
Function, node-parent: Private ordinary functions
Function, node-parent: Private ordinary functions
Function, node-parent: Private ordinary functions
Function, node-parent: Private ordinary functions
Function, node-pooled: Private ordinary functions
Function, node-prev: Private ordinary functions
Function, node-rank: Private ordinary functions
Function, node-rank: Private ordinary functions
Function, node-rank: Private ordinary functions
Function, node-rchild: Private ordinary functions
Function, node-rchild: Private ordinary functions
Function, node-right: Private ordinary functions
Function, node-sibling: Private ordinary functions
Function, node-sibling: Private ordinary functions
Function, pair-children: Private ordinary functions
Function, pair-children: Private ordinary functions
Function, pair-children: Private ordinary functions
Function, parent: Private ordinary functions
Function, peek-min: Public ordinary functions
Function, peek-min: Public ordinary functions
Function, peek-min: Public ordinary functions
Function, peek-min: Public ordinary functions
Function, peek-min: Public ordinary functions
Function, peek-min: Public ordinary functions
Function, peek-min: Public ordinary functions
Function, peek-min: Public ordinary functions
Function, peek-min: Public ordinary functions
Function, perlocate-up: Private ordinary functions
Function, right: Private ordinary functions
Function, root-p: Private ordinary functions
Function, rootp: Private ordinary functions
Function, segment<: Private ordinary functions
Function, segment>: Private ordinary functions
Function, sink: Private ordinary functions
Function, splay-node-element: Private ordinary functions
Function, splay-node-left: Private ordinary functions
Function, splay-node-p: Private ordinary functions
Function, splay-node-right: Private ordinary functions
Function, splay-node-segment: Private ordinary functions
Function, splay-tree-delete: Private ordinary functions
Function, splay-tree-insert: Private ordinary functions
Function, splay-tree-splay: Private ordinary functions
Function, splice-lists: Private ordinary functions
Function, swap-nodes: Private ordinary functions
Function, to-front: Private ordinary functions
Function, unlink: Private ordinary functions
Function, update-decrease: Private ordinary functions
Function, update-min: Private ordinary functions
Function, vector-to-heapvector: Private ordinary functions

G
Generic Function, (setf bin-heap-array): Private generic functions
Generic Function, (setf heap-size): Public generic functions
Generic Function, (setf heap-size-access): Private generic functions
Generic Function, (setf min-node): Private generic functions
Generic Function, bin-heap-array: Private generic functions
Generic Function, heap-size: Public generic functions
Generic Function, heap-size-access: Private generic functions
Generic Function, min-node: Private generic functions
goodness: Private ordinary functions

H
heap-size: Public ordinary functions
heap-size: Public ordinary functions
heap-size: Public ordinary functions
heap-size: Public ordinary functions
heap-size: Public ordinary functions
heap-size: Public ordinary functions
heap-size: Public ordinary functions
heap-size: Public ordinary functions
heap-size: Public generic functions
heap-size: Public generic functions
heap-size-access: Private generic functions
heap-size-access: Private generic functions

I
insert: Public ordinary functions
insert: Public ordinary functions
insert: Public ordinary functions
insert: Public ordinary functions
insert: Public ordinary functions
insert: Public ordinary functions
insert: Public ordinary functions
insert: Public ordinary functions
insert: Public ordinary functions
insert-circular: Private ordinary functions

J
join-lists: Private ordinary functions

L
left: Private ordinary functions
link: Private ordinary functions
link: Private ordinary functions
link: Private ordinary functions
link: Private ordinary functions
link: Private ordinary functions
link: Private ordinary functions
link-children: Private ordinary functions
link-children: Private ordinary functions
link-children: Private ordinary functions
link-fair: Private ordinary functions
link-fair: Private ordinary functions
link-unfair: Private ordinary functions

M
make-circular: Private ordinary functions
make-node: Private ordinary functions
make-singular-list: Private ordinary functions
make-splay-node: Private ordinary functions
meld: Public ordinary functions
meld: Public ordinary functions
meld: Public ordinary functions
meld: Public ordinary functions
meld: Public ordinary functions
meld: Public ordinary functions
meld: Public ordinary functions
meld: Public ordinary functions
meld-circular: Private ordinary functions
Method, (setf bin-heap-array): Private generic functions
Method, (setf heap-size): Public generic functions
Method, (setf heap-size-access): Private generic functions
Method, (setf min-node): Private generic functions
Method, bin-heap-array: Private generic functions
Method, heap-size: Public generic functions
Method, heap-size-access: Private generic functions
Method, min-node: Private generic functions
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
min-node: Private generic functions
min-node: Private generic functions

N
no-violation-p: Private ordinary functions
node-child: Private ordinary functions
node-child: Private ordinary functions
node-children: Private ordinary functions
node-data: Private ordinary functions
node-data: Private ordinary functions
node-data: Private ordinary functions
node-data: Private ordinary functions
node-data: Private ordinary functions
node-data: Private ordinary functions
node-data: Private ordinary functions
node-data: Private ordinary functions
node-degree: Private ordinary functions
node-find: Public ordinary functions
node-goodness: Private ordinary functions
node-index: Private ordinary functions
node-key: Private ordinary functions
node-key: Private ordinary functions
node-key: Private ordinary functions
node-key: Private ordinary functions
node-key: Private ordinary functions
node-key: Private ordinary functions
node-key: Private ordinary functions
node-key: Private ordinary functions
node-lchild: Private ordinary functions
node-lchild: Private ordinary functions
node-lchild: Private ordinary functions
node-lchild: Private ordinary functions
node-left: Private ordinary functions
node-mark: Private ordinary functions
node-next: Private ordinary functions
node-p: Private ordinary functions
node-p: Private ordinary functions
node-p: Private ordinary functions
node-p: Private ordinary functions
node-p: Private ordinary functions
node-p: Private ordinary functions
node-p: Private ordinary functions
node-p: Private ordinary functions
node-parent: Private ordinary functions
node-parent: Private ordinary functions
node-parent: Private ordinary functions
node-parent: Private ordinary functions
node-parent: Private ordinary functions
node-parent: Private ordinary functions
node-pooled: Private ordinary functions
node-prev: Private ordinary functions
node-rank: Private ordinary functions
node-rank: Private ordinary functions
node-rank: Private ordinary functions
node-rchild: Private ordinary functions
node-rchild: Private ordinary functions
node-right: Private ordinary functions
node-sibling: Private ordinary functions
node-sibling: Private ordinary functions

P
pair-children: Private ordinary functions
pair-children: Private ordinary functions
pair-children: Private ordinary functions
parent: Private ordinary functions
peek-min: Public ordinary functions
peek-min: Public ordinary functions
peek-min: Public ordinary functions
peek-min: Public ordinary functions
peek-min: Public ordinary functions
peek-min: Public ordinary functions
peek-min: Public ordinary functions
peek-min: Public ordinary functions
peek-min: Public ordinary functions
perlocate-up: Private ordinary functions
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods

R
right: Private ordinary functions
root-p: Private ordinary functions
rootp: Private ordinary functions

S
segment<: Private ordinary functions
segment>: Private ordinary functions
sink: Private ordinary functions
splay-node-element: Private ordinary functions
splay-node-left: Private ordinary functions
splay-node-p: Private ordinary functions
splay-node-right: Private ordinary functions
splay-node-segment: Private ordinary functions
splay-tree-delete: Private ordinary functions
splay-tree-insert: Private ordinary functions
splay-tree-splay: Private ordinary functions
splice-lists: Private ordinary functions
swap-nodes: Private ordinary functions

T
to-front: Private ordinary functions

U
unlink: Private ordinary functions
update-decrease: Private ordinary functions
update-min: Private ordinary functions

V
vector-to-heapvector: Private ordinary functions


A.3 Variables

Jump to:   +  
A   C   D   E   G   I   K   L   M   N   P   R   S   T  
Index Entry  Section

+
+initial-size+: Private constants

A
array: Public classes

C
child: Private structures
child: Private structures
children: Private structures
Constant, +initial-size+: Private constants

D
data: Private structures
data: Private structures
data: Private structures
data: Private structures
data: Private structures
data: Private structures
data: Private structures
data: Private structures
decreased: Public classes
degree: Private structures

E
element: Private structures

G
goodness: Private structures

I
index: Private structures

K
key: Private structures
key: Private structures
key: Private structures
key: Private structures
key: Private structures
key: Private structures
key: Private structures
key: Private structures

L
lchild: Private structures
lchild: Private structures
lchild: Private structures
lchild: Private structures
left: Private structures
left: Private structures

M
mark: Private structures
min: Public classes
min: Public classes

N
next: Private structures
nodes: Public classes

P
parent: Private structures
parent: Private structures
parent: Private structures
parent: Private structures
parent: Private structures
parent: Private structures
pooled: Public classes
pooled: Private structures
prev: Private structures

R
rank: Private structures
rank: Private structures
rank: Private structures
rchild: Private structures
rchild: Private structures
right: Private structures
right: Private structures
root: Public classes
root: Public classes
root: Public classes
root: Public classes
rootlist: Public classes
roots: Public classes

S
segment: Private structures
sibling: Private structures
sibling: Private structures
size: Public classes
size: Public classes
size: Public classes
size: Public classes
size: Public classes
size: Public classes
size: Private classes
Slot, array: Public classes
Slot, child: Private structures
Slot, child: Private structures
Slot, children: Private structures
Slot, data: Private structures
Slot, data: Private structures
Slot, data: Private structures
Slot, data: Private structures
Slot, data: Private structures
Slot, data: Private structures
Slot, data: Private structures
Slot, data: Private structures
Slot, decreased: Public classes
Slot, degree: Private structures
Slot, element: Private structures
Slot, goodness: Private structures
Slot, index: Private structures
Slot, key: Private structures
Slot, key: Private structures
Slot, key: Private structures
Slot, key: Private structures
Slot, key: Private structures
Slot, key: Private structures
Slot, key: Private structures
Slot, key: Private structures
Slot, lchild: Private structures
Slot, lchild: Private structures
Slot, lchild: Private structures
Slot, lchild: Private structures
Slot, left: Private structures
Slot, left: Private structures
Slot, mark: Private structures
Slot, min: Public classes
Slot, min: Public classes
Slot, next: Private structures
Slot, nodes: Public classes
Slot, parent: Private structures
Slot, parent: Private structures
Slot, parent: Private structures
Slot, parent: Private structures
Slot, parent: Private structures
Slot, parent: Private structures
Slot, pooled: Public classes
Slot, pooled: Private structures
Slot, prev: Private structures
Slot, rank: Private structures
Slot, rank: Private structures
Slot, rank: Private structures
Slot, rchild: Private structures
Slot, rchild: Private structures
Slot, right: Private structures
Slot, right: Private structures
Slot, root: Public classes
Slot, root: Public classes
Slot, root: Public classes
Slot, root: Public classes
Slot, rootlist: Public classes
Slot, roots: Public classes
Slot, segment: Private structures
Slot, sibling: Private structures
Slot, sibling: Private structures
Slot, size: Public classes
Slot, size: Public classes
Slot, size: Public classes
Slot, size: Public classes
Slot, size: Public classes
Slot, size: Public classes
Slot, size: Private classes
Slot, tree: Private classes

T
tree: Private classes


A.4 Data types

Jump to:   A   B   C   F   M   N   P   R   S   T   V  
Index Entry  Section

A
array-index: Private types

B
binary-heap: The binary-heap package
binary-heap: Public classes
binary-heap.lisp: The minheap/binary-heap․lisp file

C
Class, binary-heap: Public classes
Class, fib-heap: Public classes
Class, pairing-elmasri: Public classes
Class, pairing-heap: Public classes
Class, pairing-heap: Public classes
Class, rank-pairing-heap: Public classes
Class, rank-pairing-heap-clist: Public classes
Class, splay-heap: Private classes
Class, violation-heap: Public classes

F
fib-heap: The fib-heap package
fib-heap: Public classes
fib-heap.lisp: The minheap/fib-heap․lisp file
File, binary-heap.lisp: The minheap/binary-heap․lisp file
File, fib-heap.lisp: The minheap/fib-heap․lisp file
File, minheap.asd: The minheap/minheap․asd file
File, pairing-heap-elmasri.lisp: The minheap/pairing-heap-elmasri․lisp file
File, pairing-heap-listbased.lisp: The minheap/pairing-heap-listbased․lisp file
File, pairing-heap.lisp: The minheap/pairing-heap․lisp file
File, rank-pairing-heap-clist.lisp: The minheap/rank-pairing-heap-clist․lisp file
File, rank-pairing-heap.lisp: The minheap/rank-pairing-heap․lisp file
File, splay-heap.lisp: The minheap/splay-heap․lisp file
File, violation-heap.lisp: The minheap/violation-heap․lisp file

M
minheap: The minheap system
minheap.asd: The minheap/minheap․asd file

N
node: Private structures
node: Private structures
node: Private structures
node: Private structures
node: Private structures
node: Private structures
node: Private structures
node: Private structures

P
Package, binary-heap: The binary-heap package
Package, fib-heap: The fib-heap package
Package, pairing-elmasri: The pairing-elmasri package
Package, pairing-heap: The pairing-heap package
Package, pairing-heap-list: The pairing-heap-list package
Package, rank-pairing-heap: The rank-pairing-heap package
Package, rank-pairing-heap-clist: The rank-pairing-heap-clist package
Package, splay-heap: The splay-heap package
Package, violation-heap: The violation-heap package
pairing-elmasri: The pairing-elmasri package
pairing-elmasri: Public classes
pairing-heap: The pairing-heap package
pairing-heap: Public classes
pairing-heap: Public classes
pairing-heap-elmasri.lisp: The minheap/pairing-heap-elmasri․lisp file
pairing-heap-list: The pairing-heap-list package
pairing-heap-listbased.lisp: The minheap/pairing-heap-listbased․lisp file
pairing-heap.lisp: The minheap/pairing-heap․lisp file

R
rank-pairing-heap: The rank-pairing-heap package
rank-pairing-heap: Public classes
rank-pairing-heap-clist: The rank-pairing-heap-clist package
rank-pairing-heap-clist: Public classes
rank-pairing-heap-clist.lisp: The minheap/rank-pairing-heap-clist․lisp file
rank-pairing-heap.lisp: The minheap/rank-pairing-heap․lisp file

S
splay-heap: The splay-heap package
splay-heap: Private classes
splay-heap.lisp: The minheap/splay-heap․lisp file
splay-node: Private structures
Structure, node: Private structures
Structure, node: Private structures
Structure, node: Private structures
Structure, node: Private structures
Structure, node: Private structures
Structure, node: Private structures
Structure, node: Private structures
Structure, node: Private structures
Structure, splay-node: Private structures
System, minheap: The minheap system

T
Type, array-index: Private types

V
violation-heap: The violation-heap package
violation-heap: Public classes
violation-heap.lisp: The minheap/violation-heap․lisp file