A B C D E F G H I L M N O P Q R S T U W

A

afterLast(WindowLinked) - Method in interface CITS2200.List
put a window over after-last position
afterLast(WindowLinked) - Method in class CITS2200.ListLinked
put a window over after-last position
assign(Object, Object) - Method in interface CITS2200.Map
assign an image for a domain object.

B

beforeFirst(WindowLinked) - Method in interface CITS2200.List
put a window over before-first position
beforeFirst(WindowLinked) - Method in class CITS2200.ListLinked
put a window over before-first position
BinaryTree<E> - Class in CITS2200
A class to represent binary tree where each node contains an item E The class is immutable, so after a tree is created, it cannot be changed.
BinaryTree() - Constructor for class CITS2200.BinaryTree
Constructs an empty Binary Tree
BinaryTree(E, BinaryTree<E>, BinaryTree<E>) - Constructor for class CITS2200.BinaryTree
Constructs a binary tree containing the specified item at the root, and a left and right binary tree as children.

C

changeCombo(Combination, Combination) - Method in interface CITS2200.Lock
 
CITS2200 - package CITS2200
 
close() - Method in interface CITS2200.Lock
Close the lock.
Combination - Interface in CITS2200
Interface for a combination belonging to a combination lock.
compress(InputStream, OutputStream) - Method in interface CITS2200.Compressor
Reads a series of bytes from an inputstream and executes a compression algorithm over those bytes, writing the compressed data to the specified outputStream.
Compressor - Interface in CITS2200
This interface describes the operations to compress and decompress a file, using a variety of algorithms.

D

deassign(Object) - Method in interface CITS2200.Map
if an image is defined for the domain object deassign it (that is, remove the pair from the Map) and return the image, otherwise throw an exception.
decompress(InputStream, OutputStream) - Method in interface CITS2200.Compressor
Reads a series of bytes from compressed data and executes a decompression algorithm over those bytes, writing the decompressed data to the specified outputStream.
delete(WindowLinked) - Method in interface CITS2200.List
delete and return the object under a window, and place window over the next item
delete(WindowLinked) - Method in class CITS2200.ListLinked
delete and return the object under a window, and place window over the next item
Deque<E> - Interface in CITS2200
A Classs for basic operations of a double ended queue (DEQUE).
dequeue() - Method in interface CITS2200.PriorityQueue
remove the item at the front of the queue (the element with the highest priority that has been there the longest)
dequeue() - Method in interface CITS2200.Queue
remove the item at the front of the queue
DuplicateItem - Exception in CITS2200
Exception class for duplicate item errors in search tree insertions.
DuplicateItem(String) - Constructor for exception CITS2200.DuplicateItem
Construct this exception object.

E

enqueue(E, int) - Method in interface CITS2200.PriorityQueue
insert an item at the back into the queue with a given priority
enqueue(Object) - Method in interface CITS2200.Queue
insert an item at the back of the queue
equals(Object) - Method in class CITS2200.BinaryTree
Tests whether the tree is equal to an Object, where two trees are equal if either both trees are empty, or both trees contain equal items at the root (tested using the equals method of E), and have equal left subtrees and equal right subtrees (recursively calling the equals method of BinaryTree.
equals(Combination) - Method in interface CITS2200.Combination
tests whether two combinations are the same
equals(Object) - Method in class CITS2200.Pair
determine whether this pair is the same as the object passed checks that both items are the same using the items' equals methods
examine(WindowLinked) - Method in interface CITS2200.List
examine the object under a window
examine(WindowLinked) - Method in class CITS2200.ListLinked
examine the object under a window
examine() - Method in interface CITS2200.PriorityQueue
examine the item at the front of the queue (the element with the highest priority that has been in the queue the longest)
examine() - Method in interface CITS2200.Queue
examine the item at the front of the queue
examine() - Method in interface CITS2200.Stack
examine the item on the top of the stack

F

Flow - Interface in CITS2200
Flow.java This interface is used to implement Max Flow and matching algorithms algorithms over Graphs.

G

getConnectedTree(Graph, int) - Method in interface CITS2200.Search
Runs a BFS on a given directed, unweighted graph.
getCount() - Method in interface CITS2200.Sort
Returns the number of array assignment operations performed by this class since the count variable was rest.
getDistances(Graph, int) - Method in interface CITS2200.Search
Runs a BFS on a given directed, unweighted graph to find the distances of vertices from the start vertex.
getEdgeMatrix() - Method in class CITS2200.Graph
 
getInt() - Method in interface CITS2200.Combination
get the combination as an integer
getItem() - Method in class CITS2200.BinaryTree
Returns the item stored at the root
getLeft() - Method in class CITS2200.BinaryTree
Returns the left subtree
getMaxFlow(Graph, int, int) - Method in interface CITS2200.Flow
Finds the maximum flow in a flow network
getMaximumMatching(Graph) - Method in interface CITS2200.Flow
Finds the maximum matching in a Bipartite graph.
getMinSpanningTree(Graph) - Method in interface CITS2200.Path
Finds the minimum weight of a spoanning tree for the given graph.
getNumberOfVertices() - Method in class CITS2200.Graph
 
getRight() - Method in class CITS2200.BinaryTree
Returns the right subtree
getShortestPaths(Graph, int) - Method in interface CITS2200.Path
Runs Dijkstra's algorithm on a given undirected, non-negative weighted graph to find the distances to all vertices from the specified source vertex
getString() - Method in interface CITS2200.Combination
get the combination as a String
getTimes(Graph, int) - Method in interface CITS2200.Search
Runs a DFS on a given directed, unweighted graph to find the start time and finish time for each vertex
getWeight(int, int) - Method in class CITS2200.Graph
 
Graph - Class in CITS2200
Graph.java is a class to assist with graph and network algorithms for CITS3210.

H

hasNext() - Method in interface CITS2200.Iterator
tests if there is a next item to return

I

IllegalValue - Exception in CITS2200
Exception class for illegal decrease key operations in pairing heaps.
IllegalValue(String) - Constructor for exception CITS2200.IllegalValue
Construct this exception object.
image(Object) - Method in interface CITS2200.Map
return the image of a domain object if defined, otherwise throw an exception.
insertAfter(Object, WindowLinked) - Method in interface CITS2200.List
insert an item after a window
insertAfter(Object, WindowLinked) - Method in class CITS2200.ListLinked
insert an item after a window
insertBefore(Object, WindowLinked) - Method in interface CITS2200.List
insert an item before a window
insertBefore(Object, WindowLinked) - Method in class CITS2200.ListLinked
insert an item before a window
insertionSort(long[]) - Method in interface CITS2200.Sort
Executes the insertion sort algorithm sorting the argument array.
isAfterLast(WindowLinked) - Method in interface CITS2200.List
check if the window is over the after-last position
isAfterLast(WindowLinked) - Method in class CITS2200.ListLinked
check if the window is over the after-last position
isBeforeFirst(WindowLinked) - Method in interface CITS2200.List
check if the window is over the before-first position
isBeforeFirst(WindowLinked) - Method in class CITS2200.ListLinked
check if the window is over the before-first position
isDefined(Object) - Method in interface CITS2200.Map
check if a codomain image is defined for a domain object
isDirected() - Method in class CITS2200.Graph
 
isEmpty() - Method in class CITS2200.BinaryTree
 
isEmpty() - Method in interface CITS2200.Deque
 
isEmpty() - Method in interface CITS2200.List
check if the list is empty
isEmpty() - Method in class CITS2200.ListLinked
check if the list is empty
isEmpty() - Method in interface CITS2200.Map
check if the map is empty
isEmpty() - Method in interface CITS2200.PriorityQueue
test whether the queue is empty
isEmpty() - Method in interface CITS2200.Queue
test whether the queue is empty
isEmpty() - Method in interface CITS2200.Stack
test whether the stack is empty
isFull() - Method in interface CITS2200.Deque
 
isWeighted() - Method in class CITS2200.Graph
 
item - Variable in class CITS2200.Link
Item stored in this link.
item1 - Variable in class CITS2200.Pair
the first item (or domain item)
item2 - Variable in class CITS2200.Pair
the second item (or codomain item)
ItemNotFound - Exception in CITS2200
Exception class for failed finds/removes in search trees, hash tables, and list and tree iterators.
ItemNotFound(String) - Constructor for exception CITS2200.ItemNotFound
Construct this exception object.
iterator() - Method in class CITS2200.BinaryTree
Returns an iterator that will traverse through every element in the tree, exactly once.
Iterator<E> - Interface in CITS2200
A class for sequentially accessing collections The Iterator should initially be pointing before the first element of the collection, so the first call to next() returns the first element.
iterator() - Method in interface CITS2200.PriorityQueue
return a DAT.Iterator to examine all the elements in the PriorityQueue

L

Link - Class in CITS2200
A link used to (recursively) construct a linked list.
Link(Object, Link) - Constructor for class CITS2200.Link
Create a new link.
link - Variable in class CITS2200.WindowLinked
the Link the window refers too
List - Interface in CITS2200
Interface for List ADTs that use a window for Links
ListLinked - Class in CITS2200
Singly linked implementation of a List ADT
ListLinked() - Constructor for class CITS2200.ListLinked
create a new list
Lock - Interface in CITS2200
Interface for a combination lock.

M

Map - Interface in CITS2200
Interface for a Map ADT
mergeSort(long[]) - Method in interface CITS2200.Sort
Executes the merge sort algorithm sorting the argument array.

N

next() - Method in interface CITS2200.Iterator
Returns the next element a moves the iterator to the next position.
next(WindowLinked) - Method in interface CITS2200.List
move a window to the next position
next(WindowLinked) - Method in class CITS2200.ListLinked
move a window to the next position

O

open(Combination) - Method in interface CITS2200.Lock
If the combination is correct, open the lock.
OutOfBounds - Exception in CITS2200
Indicates an attempt to access an object outside the bounds of a container class such as a list.
OutOfBounds(String) - Constructor for exception CITS2200.OutOfBounds
Construct this exception object.
Overflow - Exception in CITS2200
Indicates an attempt to add to a full container class such as a stack or queue.
Overflow(String) - Constructor for exception CITS2200.Overflow
Construct this exception object.

P

Pair - Class in CITS2200
A pair (2-tuple) of information.
Pair(Object, Object) - Constructor for class CITS2200.Pair
create a new pair
Path - Interface in CITS2200
Path.java This interface is used to implement Prim's and Djikstra's algorithms over a weighted, undirected Graph.
peekLeft() - Method in interface CITS2200.Deque
Returns the element on the left end of the queue.
peekRight() - Method in interface CITS2200.Deque
Returns the element on the right end of the queue.
pop() - Method in interface CITS2200.Stack
remove the item at the top of the stack
popLeft() - Method in interface CITS2200.Deque
Removes and returns the element on the left end of the queue.
popRight() - Method in interface CITS2200.Deque
Removes and returns the element on the right end of the queue.
previous(WindowLinked) - Method in interface CITS2200.List
move a window to the previous position
previous(WindowLinked) - Method in class CITS2200.ListLinked
move a window to the previous position
PriorityQueue<E> - Interface in CITS2200
PriorityQueue interface.
push(Object) - Method in interface CITS2200.Stack
insert an item on the top of the stack
pushLeft(E) - Method in interface CITS2200.Deque
Adds an element to the left end of the queue.
pushRight(E) - Method in interface CITS2200.Deque
Adds an element to the right end of the queue.

Q

Queue - Interface in CITS2200
Queue interface.
quickSort(long[]) - Method in interface CITS2200.Sort
Executes the quicksort algorithm sorting the argument array.

R

randomBipartiteGraph(int, boolean, double) - Static method in class CITS2200.Graph
Creates a random unweighted bipartite graph
randomGraph(int, boolean, double) - Static method in class CITS2200.Graph
Creates a random unweighted graph
randomGraph(int, double) - Static method in class CITS2200.Graph
Creates a random unweighted, undirected graph
randomWeightedBipartiteGraph(int, boolean, double, int) - Static method in class CITS2200.Graph
Creates a random weighted bipartite graph.
randomWeightedGraph(int, boolean, double, int) - Static method in class CITS2200.Graph
Creates a random weighted graph.
readFile(String, boolean, boolean) - Static method in class CITS2200.Graph
reads an adjacency matrix from a file and returns it.
replace(Object, WindowLinked) - Method in interface CITS2200.List
replace the object under a window
replace(Object, WindowLinked) - Method in class CITS2200.ListLinked
replace the object under a window
reset() - Method in interface CITS2200.Sort
Resets the counter variable to 0

S

Search - Interface in CITS2200
Search.java This interface specifies methods based on a Breadth First Search and Depth First Search over a directed Graph.
setInt(int) - Method in interface CITS2200.Combination
set the combination using an integer
setString(String) - Method in interface CITS2200.Combination
set the combination using a string
Sort - Interface in CITS2200
A class to give a comaprative view of common sorting algorithms.
Stack - Interface in CITS2200
Stack interface.
successor - Variable in class CITS2200.Link
Reference to the rest of the list.

T

toString() - Method in class CITS2200.BinaryTree
Returns a string representation of the tree, calling the toString method of E.
toString() - Method in interface CITS2200.Combination
provide a string representation of this object
toString() - Method in class CITS2200.Graph
This method produces a representation of the graph that corresponds to the adjacency matrix used by the readFile method.
toString() - Method in class CITS2200.Pair
generate a string representation of the pair of the form < item1 , item2 >

U

Underflow - Exception in CITS2200
Exception class for access in empty containers such as stacks, queues, and priority queues.
Underflow(String) - Constructor for exception CITS2200.Underflow
Construct this exception object.

W

WindowLinked - Class in CITS2200
Window for linked representations of lists
WindowLinked() - Constructor for class CITS2200.WindowLinked
create a new empty window
WindowLinked(Link) - Constructor for class CITS2200.WindowLinked
create a new window

A B C D E F G H I L M N O P Q R S T U W