A C D E F G H I K L O P R S T U

A

AssignablePriorityQueue<E> - class fi.joensuu.cs.tra.AssignablePriorityQueue.

AssignablePriorityQueue is a wrapper for java.util.PriorityQueue that allows specifying an int priority for each element.

AssignablePriorityQueue() - Constructor for class fi.joensuu.cs.tra.AssignablePriorityQueue

Creates an AssignablePriorityQueue with the default initial capacity (11) that orders its elements according to the natural ordering of their assigned priorities.

AssignablePriorityQueue(int) - Constructor for class fi.joensuu.cs.tra.AssignablePriorityQueue

Creates an AssignablePriorityQueue with the specified initial capacity (11) that orders its elements according to the natural ordering of their assigned priorities.

add(int, E) - Method in class fi.joensuu.cs.tra.AssignablePriorityQueue

Inserts a specified element to the priority queue with the specified priority.

add(E) - Method in class fi.joensuu.cs.tra.PriorityQueue

add(E) - Method in class fi.joensuu.cs.tra.Set

addAll(Collection) - Method in class fi.joensuu.cs.tra.Set

addFirst(E) - Method in class fi.joensuu.cs.tra.LinkedDeque

Inserts the given element to the front of this deque.

addLast(E) - Method in class fi.joensuu.cs.tra.LinkedDeque

Inserts the given element to the rear of this deque.

C

clear() - Method in class fi.joensuu.cs.tra.AssignablePriorityQueue

Remove all elements from the priority queue.

clear() - Method in class fi.joensuu.cs.tra.LinkedDeque

Removes all the elements from this deque.

clear() - Method in class fi.joensuu.cs.tra.LinkedQueue

Removes all of the elements from this queue

clear() - Method in class fi.joensuu.cs.tra.LinkedStack

Removes all the elements from this stack.

clear() - Method in class fi.joensuu.cs.tra.PriorityQueue

clear() - Method in class fi.joensuu.cs.tra.Set

clone() - Method in class fi.joensuu.cs.tra.Set

comparator() - Method in class fi.joensuu.cs.tra.PriorityQueue

comparator() - Method in class fi.joensuu.cs.tra.Set

contains(Object) - Method in class fi.joensuu.cs.tra.Set

D

destroyNode(TreeNode) - Method in class fi.joensuu.cs.tra.Tree

Removes a single node.

difference(Collection) - Method in class fi.joensuu.cs.tra.Set

Returns the difference of this Set and the specified Collection.

E

EOL - Static variable in class fi.joensuu.cs.tra.TraLinkedList

Denotes the end of the list.

ElementTypeMismatchException - exception fi.joensuu.cs.tra.ElementTypeMismatchException.

ElementTypeMismatchException is a TreeException used to signal a mismatch in element classes.

ElementTypeMismatchException() - Constructor for class fi.joensuu.cs.tra.ElementTypeMismatchException

ElementTypeMismatchException(String) - Constructor for class fi.joensuu.cs.tra.ElementTypeMismatchException

ElementTypeMismatchException(Throwable) - Constructor for class fi.joensuu.cs.tra.ElementTypeMismatchException

element() - Method in class fi.joensuu.cs.tra.LinkedQueue

Retrieves, but does not remove, the head of this queue.

equals(Collection) - Method in class fi.joensuu.cs.tra.Set

Checks if this Set and the specified Collection contain the same elements.

F

fi.joensuu.cs.tra - package fi.joensuu.cs.tra

first() - Method in class fi.joensuu.cs.tra.Set

first() - Method in class fi.joensuu.cs.tra.TraLinkedList

Returns the first node of this list.

G

getBalance() - Method in class fi.joensuu.cs.tra.TreeNode

Returns this node's balance.

getElement() - Method in class fi.joensuu.cs.tra.ListNode

Returns this ListNode's element.

getElement() - Method in class fi.joensuu.cs.tra.TreeNode

Returns this node's element.

getFirst() - Method in class fi.joensuu.cs.tra.LinkedDeque

Returns but does not remove the element at the front of this deque.

getLast() - Method in class fi.joensuu.cs.tra.LinkedDeque

Returns but does not remove the element at the rear of this deque.

getLeftChild() - Method in class fi.joensuu.cs.tra.TreeNode

Returns this node's leftmost child.

getNext() - Method in class fi.joensuu.cs.tra.ListNode

Returns this ListNode's next node.

getNext(ListNode) - Method in class fi.joensuu.cs.tra.TraLinkedList

Returns the specified ListNodes next ListNode or null if none exists.

getParent() - Method in class fi.joensuu.cs.tra.TreeNode

Returns this node's parent node.

getPrevious() - Method in class fi.joensuu.cs.tra.ListNode

Returns this ListNode's previous node.

getPrevious(ListNode) - Method in class fi.joensuu.cs.tra.TraLinkedList

Returns the specified ListNodes previous ListNode or null if none exists.

getRightSibling() - Method in class fi.joensuu.cs.tra.TreeNode

Returns this node's right sibling.

getRoot() - Method in class fi.joensuu.cs.tra.Tree

Returns the root of this Tree.

H

headSet(E) - Method in class fi.joensuu.cs.tra.Set

I

insert(ListNode, ListNode) - Method in class fi.joensuu.cs.tra.TraLinkedList

Inserts a ListNode in front of the specified ListNode.

insert(ListNode, E) - Method in class fi.joensuu.cs.tra.TraLinkedList

Inserts a new ListNode with the specified elementin front of the specified ListNode.

intersection(Collection) - Method in class fi.joensuu.cs.tra.Set

Returns the intersection of this Set and the specified Collection.

isEmpty() - Method in class fi.joensuu.cs.tra.Set

isEmpty() - Method in class fi.joensuu.cs.tra.TraLinkedList

Returns true if this list is empty.

isEmpty() - Method in class fi.joensuu.cs.tra.Tree

Returns true if this Tree is empty.

iterator() - Method in class fi.joensuu.cs.tra.AssignablePriorityQueue

Returns an iterator over the elements in this queue.

iterator() - Method in class fi.joensuu.cs.tra.PriorityQueue

iterator() - Method in class fi.joensuu.cs.tra.Set

K

killNode(TreeNode) - Method in class fi.joensuu.cs.tra.Tree

Kills a node.

L

LinkedDeque<E> - class fi.joensuu.cs.tra.LinkedDeque.

LinkedDeque extends java.util.LinkedList to highlight Deque behaviour.

LinkedDeque() - Constructor for class fi.joensuu.cs.tra.LinkedDeque

Creates an empty list.

LinkedDeque(Collection) - Constructor for class fi.joensuu.cs.tra.LinkedDeque

Constructs a deque containing the elements of the specified collection, in the order they are returned by the collection's iterator.

LinkedQueue<E> - class fi.joensuu.cs.tra.LinkedQueue.

LinkedQueue extends java.util.LinkedList to highlight java.util.Queue-defined behaviour.

LinkedQueue() - Constructor for class fi.joensuu.cs.tra.LinkedQueue

Creates an empty queue.

LinkedQueue(Collection) - Constructor for class fi.joensuu.cs.tra.LinkedQueue

Constructs a queue containing the elements of the specified collection, in the order they are returned by the collection's iterator.

LinkedStack<E> - class fi.joensuu.cs.tra.LinkedStack.

LinkedStack extends java.util.LinkedList with behaviour expected of a Stack.

LinkedStack() - Constructor for class fi.joensuu.cs.tra.LinkedStack

Creates an empty Stack.

LinkedStack(Collection) - Constructor for class fi.joensuu.cs.tra.LinkedStack

Constructs a stack containing the elements of the specified collection, in the order they are returned by the collection's iterator.

ListNode<E> - class fi.joensuu.cs.tra.ListNode.

ListNode() - Constructor for class fi.joensuu.cs.tra.ListNode

Creates an empty, unlinked ListNode.

ListNode(E) - Constructor for class fi.joensuu.cs.tra.ListNode

Creates an unlinked ListNode with the specified element.

last() - Method in class fi.joensuu.cs.tra.Set

last() - Method in class fi.joensuu.cs.tra.TraLinkedList

Returns the last node of this list.

O

offer(E) - Method in class fi.joensuu.cs.tra.LinkedQueue

Inserts the specified element into the rear of this queue.

P

PriorityQueue<E> - class fi.joensuu.cs.tra.PriorityQueue.

PriorityQueue is a convenience extension of java.util.PriorityQueue for relocation.

PriorityQueue() - Constructor for class fi.joensuu.cs.tra.PriorityQueue

Creates a PriorityQueue with the default initial capacity (11) that orders its elements according to their natural ordering (using Comparable).

PriorityQueue(int) - Constructor for class fi.joensuu.cs.tra.PriorityQueue

Creates a PriorityQueue with the specified initial capacity that orders its elements according to their natural ordering (using Comparable).

PriorityQueue(int, Comparator) - Constructor for class fi.joensuu.cs.tra.PriorityQueue

Creates a PriorityQueue with the specified initial capacity that orders its elements according to the specified comparator.

PriorityQueue(Collection) - Constructor for class fi.joensuu.cs.tra.PriorityQueue

Creates a PriorityQueue containing the elements in the specified collection.

PriorityQueue(PriorityQueue) - Constructor for class fi.joensuu.cs.tra.PriorityQueue

Creates a PriorityQueue containing the elements in the specified collection.

PriorityQueue(SortedSet) - Constructor for class fi.joensuu.cs.tra.PriorityQueue

Creates a PriorityQueue containing the elements in the specified collection.

peek() - Method in class fi.joensuu.cs.tra.AssignablePriorityQueue

Retrieves, but does not remove, the head of this queue, returning null if this queue is empty.

peek() - Method in class fi.joensuu.cs.tra.LinkedQueue

Retrieves, but does not remove, the head of this queue, returning null if this queue is empty.

peek() - Method in class fi.joensuu.cs.tra.LinkedStack

Returns but does not remove the element at the top of this stack.

poll() - Method in class fi.joensuu.cs.tra.AssignablePriorityQueue

Removes and returns the head of this queue, or null if this queue is empty.

poll() - Method in class fi.joensuu.cs.tra.LinkedQueue

Retrieves and removes the head of this queue, or null if this queue is empty.

poll() - Method in class fi.joensuu.cs.tra.PriorityQueue

pop() - Method in class fi.joensuu.cs.tra.LinkedStack

Removes and returns the element at the top of this stack.

push(E) - Method in class fi.joensuu.cs.tra.LinkedStack

Pushes an element onto the top of this stack.

R

remove() - Method in class fi.joensuu.cs.tra.LinkedQueue

Retrieves and removes the head of this queue.

remove(Object) - Method in class fi.joensuu.cs.tra.PriorityQueue

remove(Object) - Method in class fi.joensuu.cs.tra.Set

remove(ListNode) - Method in class fi.joensuu.cs.tra.TraLinkedList

Removes a ListNode from this TraLinkedList.

removeFirst() - Method in class fi.joensuu.cs.tra.LinkedDeque

Removes and returns the element at the front of this deque.

removeLast() - Method in class fi.joensuu.cs.tra.LinkedDeque

Removes and returns the element at the rear of this deque.

removeLeftChild() - Method in class fi.joensuu.cs.tra.TreeNode

Removes this node's left child.

removeRightSibling() - Method in class fi.joensuu.cs.tra.TreeNode

Removes this node's right sibling.

S

Set<E> - class fi.joensuu.cs.tra.Set.

fi.joensuu.cs.tra.Set extends java.util.TreeSet with comparison methods.

Set() - Constructor for class fi.joensuu.cs.tra.Set

Constructs a new, empty set, sorted according to the elements' natural order.

Set(Collection) - Constructor for class fi.joensuu.cs.tra.Set

Constructs a new set containing the elements in the specified collection, sorted according to the elements' natural order.

Set(Comparator) - Constructor for class fi.joensuu.cs.tra.Set

Constructs a new, empty set, sorted according to the specified comparator.

Set(SortedSet) - Constructor for class fi.joensuu.cs.tra.Set

Constructs a new set containing the same elements as the specified sorted set, sorted according to the same ordering.

setBalance(int) - Method in class fi.joensuu.cs.tra.TreeNode

Sets this node's balance.

setElement(E) - Method in class fi.joensuu.cs.tra.ListNode

Sets this ListNode's element.

setElement(E) - Method in class fi.joensuu.cs.tra.TreeNode

Sets this node's element.

setLeftChild(TreeNode) - Method in class fi.joensuu.cs.tra.TreeNode

Sets this node's left child.

setLeftChild(Tree) - Method in class fi.joensuu.cs.tra.TreeNode

Sets this node's left child to be the root node of the specified Tree.

setRightSibling(TreeNode) - Method in class fi.joensuu.cs.tra.TreeNode

Sets this node's right sibling.

setRightSibling(Tree) - Method in class fi.joensuu.cs.tra.TreeNode

Sets this node's right sibling to be the root node of the specified Tree.

setRoot(TreeNode) - Method in class fi.joensuu.cs.tra.Tree

Sets the root of this Tree.

size() - Method in class fi.joensuu.cs.tra.AssignablePriorityQueue

Returns the number of elements in this queue.

size() - Method in class fi.joensuu.cs.tra.PriorityQueue

size() - Method in class fi.joensuu.cs.tra.Set

subSet(E, E) - Method in class fi.joensuu.cs.tra.Set

T

TraLinkedList<E> - class fi.joensuu.cs.tra.TraLinkedList.

TraLinkedList() - Constructor for class fi.joensuu.cs.tra.TraLinkedList

Creates an empty list.

Tree<E> - class fi.joensuu.cs.tra.Tree.

Tree is a wrapper class for a root TreeNode.

Tree() - Constructor for class fi.joensuu.cs.tra.Tree

Creates an empty Tree.

Tree(TreeNode) - Constructor for class fi.joensuu.cs.tra.Tree

Creates a Tree with the specified TreeNode as the root node.

TreeException - exception fi.joensuu.cs.tra.TreeException.

TreeException is a generic RuntimeException for Tree -related problems.

TreeException() - Constructor for class fi.joensuu.cs.tra.TreeException

TreeException(String) - Constructor for class fi.joensuu.cs.tra.TreeException

TreeException(Throwable) - Constructor for class fi.joensuu.cs.tra.TreeException

TreeNode<E> - class fi.joensuu.cs.tra.TreeNode.

TreeNode is a building block for basic Trees.

TreeNode(E) - Constructor for class fi.joensuu.cs.tra.TreeNode

Creates a new TreeNode with the specified element.

tailSet(E) - Method in class fi.joensuu.cs.tra.Set

U

union(Collection) - Method in class fi.joensuu.cs.tra.Set

Returns the union of this Set and the specified Collection.

A C D E F G H I K L O P R S T U