util.queue

Class SoftHeap.BinaryHeapNode

java.lang.Object

util.queue.SoftHeap.BinaryHeapNode

Enclosing class:

SoftHeap<T>

protected class SoftHeap.BinaryHeapNode
extends java.lang.Object

Constructor Summary

Constructors

Constructor and Description
BinaryHeapNode()
BinaryHeapNode(SoftHeap.BinaryHeapNode leftChild, SoftHeap.BinaryHeapNode rightChild, T key, int rank)

Method Summary

Modifier and Type	Method and Description
void	insert(T element) Inserts the given element into the selected node.
boolean	isLeaf() Returns whether a node is a leaf, which is the case if both of its children don't exist.
int	sift() Replenishes the elements associated with the given key if the amount of elements in the list has dropped below size / 2.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

BinaryHeapNode

public BinaryHeapNode(SoftHeap.BinaryHeapNode leftChild,
                      SoftHeap.BinaryHeapNode rightChild,
                      T key,
                      int rank)

BinaryHeapNode

public BinaryHeapNode()

Method Detail

insert

public void insert(T element)

Inserts the given element into the selected node.

Parameters:

element - the element to be inserted

Throws:

java.lang.IllegalArgumentException - in case the key is too large

isLeaf

public boolean isLeaf()

Returns whether a node is a leaf, which is the case if both of its children don't exist.

Returns:

whether the node is a leaf

sift

public int sift()

Replenishes the elements associated with the given key if the amount of elements in the list has dropped below size / 2.

Returns:

the number of elements now contained in the list