jds
Interface FindMin

All Known Implementing Classes:

AVLTree, BinarySearchTree, Heap, SkewHeap, SortedList, SortedVector

public abstract interface FindMin

extends Collection

FindMin - find smallest element in collection (priority queue); for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.

See Also:

Collection

Fields inherited from class java.io.Serializable

serialVersionUID

Method Summary

void	addElement(java.lang.Object value) add a new value to the collection
java.lang.Object	getFirst() yields the smallest element in collection
void	removeFirst() removes the smallest element in collection

Methods inherited from interface jds.Collection

elements, isEmpty, size

Method Detail

addElement

public void addElement(java.lang.Object value)

add a new value to the collection

Parameters:

value - element to be inserted into collection

getFirst

public java.lang.Object getFirst()

yields the smallest element in collection

Returns:

the first (smallest) value in collection

removeFirst

public void removeFirst()

removes the smallest element in collection