A B C E G H I M P R S T U

A

add(Item) - Method in class u6.Heap
Adds the given item in the heap and updates the size and the height values.
add(Item) - Method in class u6.ArrayHeap
Adds the given item in the heap and updates the size and the height values.
add(Object, Object) - Method in class u6.Heap
Adds a node with the given key and value in the heap and updates the size and the height values.
ArrayHeap - class u6.ArrayHeap.
Array based implementation of Heap Data Structure.
ArrayHeap(Comparator) - Constructor for class u6.ArrayHeap
Constructs an empty heap with the specified comparator
ArrayHeap(Comparator, Item[]) - Constructor for class u6.ArrayHeap
Constructs a heap from the elements of 'aitem' using the bottom-up method.

B

bottomUp(int) - Method in class u6.ArrayHeap
Constructs a heap with root the element with index 'i', using the bottom-up method.

C

clone() - Method in class utils.Item
 
cmp - Variable in class u6.Heap
Comparator, defining a total relation on the keys
compare(Object, Object) - Method in class utils.IntegerComparator
 
computeHeight(int) - Static method in class u6.Heap
Computes the height of a heap with a given size.

E

equals(Object) - Method in class utils.IntegerComparator
 
equals(Object) - Method in class utils.Item
 
ExternalSort - class u7.ExternalSort.
 
ExternalSort() - Constructor for class u7.ExternalSort
 
ExternalSort(int) - Constructor for class u7.ExternalSort
 
extract() - Method in interface u6.PriorityQueue
Extracts the element with greater priority, i.e. with minimal key.
extract() - Method in class u6.HeapPriorityQueue
Extracts the element with greater priority, i.e. with minimal key.
extractItem() - Method in class u6.Heap
Extracts the root of the Heap and updates the size and the height values.
extractItem() - Method in class u6.ArrayHeap
Extracts the root of the Heap and updates the size and the height values.

G

getHeight() - Method in class u6.Heap
Reads the height of the heap.
getKey() - Method in class utils.Item
 
getValue() - Method in class utils.Item
 

H

hashCode() - Method in class utils.Item
 
Heap - class u6.Heap.
Abstract Heap class.
Heap(Comparator) - Constructor for class u6.Heap
Constructs an empty heap with the given comparator.
HeapPriorityQueue - class u6.HeapPriorityQueue.
Heap implementation of the PriorityQueue.
HeapPriorityQueue(Comparator) - Constructor for class u6.HeapPriorityQueue
 
HeapPriorityQueue(Heap) - Constructor for class u6.HeapPriorityQueue
 
height - Variable in class u6.Heap
The height of the heap; a heap with one element has height = 1.

I

insert(Object, Object) - Method in interface u6.PriorityQueue
Inserts an element with priority key in this priority queue.
insert(Object, Object) - Method in class u6.HeapPriorityQueue
Inserts an element with priority key in this priority queue.
IntegerComparator - class utils.IntegerComparator.
Comparator Implementation for keys of type Integer.
IntegerComparator() - Constructor for class utils.IntegerComparator
 
isComparable(Object) - Method in class utils.IntegerComparator
 
isEmpty() - Method in interface u6.PriorityQueue
Checks whether this priority queue is empty.
isEmpty() - Method in class u6.Heap
Checks whether the heap is empty.
isEmpty() - Method in class u6.HeapPriorityQueue
Checks whether this priority queue is empty.
Item - class utils.Item.
Composition of key-value data.
Item(Object, Object) - Constructor for class utils.Item
 

M

MergeSort - class u7.MergeSort.
 
MergeSort() - Constructor for class u7.MergeSort
 
minKey() - Method in interface u6.PriorityQueue
Reads the minimal key in this priority queue, without removing the element.
minKey() - Method in class u6.HeapPriorityQueue
Reads the minimal key in this priority queue, without removing the element.
minKeyElement() - Method in interface u6.PriorityQueue
Reads the element with minimal key.
minKeyElement() - Method in class u6.HeapPriorityQueue
Reads the element with minimal key.

P

printFile(String) - Method in class u7.ExternalSort
 
PriorityQueue - interface u6.PriorityQueue.
Priority Queue.

R

readMinElement() - Method in class u6.Heap
Reads the element value of the item, stored in the root of the heap without removing the root.
readMinElement() - Method in class u6.ArrayHeap
Reads the element value of the item, stored in the root of the heap without removing the root.
readMinKey() - Method in class u6.Heap
Reads the key, stored in the root of the heap, without extracting the root.
readMinKey() - Method in class u6.ArrayHeap
Reads the key, stored in the root of the heap, without extracting the root.

S

setValue(Object) - Method in class utils.Item
 
size - Variable in class u6.Heap
The number of elements in this heap
size() - Method in interface u6.PriorityQueue
Gets the number of entries in this priority queue.
size() - Method in class u6.Heap
Reads the number of items stored in the heap.
size() - Method in class u6.HeapPriorityQueue
Gets the number of entries in this priority queue.
sort(Item[], Comparator) - Method in interface utils.SortObject
 
sort(Item[], Comparator) - Method in class u7.MergeSort
 
sort(Item[], int, Comparator) - Static method in class u7.MergeSort
BubbleSort
sort(String, Comparator) - Method in interface utils.SortFile
Sort the file named 'fname' that contains objects of type Item
sort(String, Comparator) - Method in class u7.ExternalSort
 
SortFile - interface utils.SortFile.
 
SortObject - interface utils.SortObject.
 

T

toArray(Object[]) - Method in class u6.ArrayHeap
 
toString() - Method in class utils.Item
 

U

u6 - package u6
 
u7 - package u7
 
utils - package utils
 

A B C E G H I M P R S T U