B C D E G I K L P R S T

B

BSTnode<K> - Class in <Unnamed>

BSTnode implements a node for a binary search tree (BST).

BSTnode(K) - Constructor for class BSTnode

Constructs a BST node with the given key and whose left and right children are null.

BSTnode(K, BSTnode<K>, BSTnode<K>) - Constructor for class BSTnode

Constructs a BST node with the given key, left child, and right child.

C

compareTo(KeyWord) - Method in class KeyWord

Compares the KeyWord with the one given.

D

delete(K) - Method in interface DictionaryADT

Deletes the given key from the Dictionary.

DictionaryADT<K extends java.lang.Comparable<K>> - Interface in <Unnamed>

The Dictionary ADT stores unique keys.

DuplicateException - Exception in <Unnamed>

A DuplicateException is an exception that occurs when there is an attempt to insert a duplicate key value into a Dictionary.

DuplicateException() - Constructor for exception DuplicateException

E

equals(Object) - Method in class KeyWord

Compares this KeyWord to the specified object.

G

getKey() - Method in class BSTnode

Returns the key for this BST node.

getLeft() - Method in class BSTnode

Returns the left child for this BST node.

getMax() - Method in interface PriorityQueueADT

Returns the item with the highest priority.

getOccurrences() - Method in class KeyWord

Returns the number of occurrences for this KeyWord.

getPriority() - Method in class KeyWord

Returns the priority for this KeyWord.

getPriority() - Method in interface Prioritizable

Return the priority for this item.

getRight() - Method in class BSTnode

Returns the right child for this BST node.

getWord() - Method in class KeyWord

Returns the word for this KeyWord.

I

increment() - Method in class KeyWord

Adds one to the number of occurrences for this KeyWord.

insert(K) - Method in interface DictionaryADT

Inserts the given key into the Dictionary if the key is not already in the Dictionary.

insert(E) - Method in interface PriorityQueueADT

Adds the given item to the priority queue.

isEmpty() - Method in interface DictionaryADT

Returns true if and only if the Dictionary is empty.

isEmpty() - Method in interface PriorityQueueADT

Returns true if this priority queue contains no items.

iterator() - Method in interface DictionaryADT

Returns an iterator over the Dictionary that iterates over the keys in the Dictionary in order from smallest to largest.

K

KeyWord - Class in <Unnamed>

A KeyWord consists of a word and an integer (representing the number of occurrences of the word).

KeyWord(String) - Constructor for class KeyWord

Constructs a KeyWord with the given word (converted to lower-case) and zero occurences.

L

lookup(K) - Method in interface DictionaryADT

Searches for the given key in the Dictionary and returns the key stored in the Dictionary.

P

Prioritizable - Interface in <Unnamed>

The Prioritizable interface is implemented by classes whose instances are going to be inserted into a PriorityQueueADT.

PriorityQueueADT<E extends Prioritizable> - Interface in <Unnamed>

The PriorityQueue ADT stores a collection of Prioritizable items.

R

removeMax() - Method in interface PriorityQueueADT

Removes and returns the item with the highest priority.

S

setKey(K) - Method in class BSTnode

Changes the key for this node to the one given.

setLeft(BSTnode<K>) - Method in class BSTnode

Changes the left child for this node to the one given.

setRight(BSTnode<K>) - Method in class BSTnode

Changes the right child for this node to the one given.

size() - Method in interface DictionaryADT

Returns the number of keys in the Dictionary.

size() - Method in interface PriorityQueueADT

Returns the number of items in this priority queue.

T

totalPathLength() - Method in interface DictionaryADT

Returns the total path length.

B C D E G I K L P R S T