A B C D E F G H I J K L M N P Q R S T V

A

array2heap(Comparable[]) - Static method in class asd_library.tree.heap.Heap
Build the heap from the specified array.
asd_library - package asd_library
 
asd_library.hash - package asd_library.hash
 
asd_library.queue - package asd_library.queue
 
asd_library.sorting - package asd_library.sorting
 
asd_library.stack - package asd_library.stack
 
asd_library.tree.avltree - package asd_library.tree.avltree
 
asd_library.tree.bstree - package asd_library.tree.bstree
 
asd_library.tree.heap - package asd_library.tree.heap
 
asd_library.tree.tree - package asd_library.tree.tree
 
AvlNode - class asd_library.tree.avltree.AvlNode.
Basic node stored in AVL trees
AvlNode(Comparable) - Constructor for class asd_library.tree.avltree.AvlNode
Creates a new node without children.
AvlNode(Comparable, AvlNode, AvlNode) - Constructor for class asd_library.tree.avltree.AvlNode
Creates a new node with children and heigth equals to zero
AvlTree - class asd_library.tree.avltree.AvlTree.
Implements an AVL tree.
AvlTree() - Constructor for class asd_library.tree.avltree.AvlTree
Construct the tree.
AvlTreeDemo - class asd_library.tree.avltree.AvlTreeDemo.
Test program.
AvlTreeDemo() - Constructor for class asd_library.tree.avltree.AvlTreeDemo
 

B

balance(Comparable[], int, int) - Method in class asd_library.tree.bstree.BSTree
Inserts the element from the specified array into this tree.
BaseObject - class asd_library.BaseObject.
Wrapper class for use with generic data structures.
BaseObject(int) - Constructor for class asd_library.BaseObject
Constructs the BaseObject.
breadthFirst() - Method in class asd_library.tree.bstree.BSTree
Implements a breadth-first traversal from the root towards the leafs and from left towards right.
BSTNode - class asd_library.tree.bstree.BSTNode.
Basic node stored in a binary search tree.
BSTNode() - Constructor for class asd_library.tree.bstree.BSTNode
Constructs a new node.
BSTNode(Comparable) - Constructor for class asd_library.tree.bstree.BSTNode
Constructs a new node.
BSTNode(Comparable, BSTNode, BSTNode) - Constructor for class asd_library.tree.bstree.BSTNode
 
BSTree - class asd_library.tree.bstree.BSTree.
The class BSTree implements a binary tree with the following property: for each node n, every left-subtree value is less then the key value v stored in n and every right-subtree value is greater then v.
BSTree() - Constructor for class asd_library.tree.bstree.BSTree
Creates an empty BSTree
BSTtreeDemo - class asd_library.tree.bstree.BSTtreeDemo.
Test Class of BSTree
BSTtreeDemo() - Constructor for class asd_library.tree.bstree.BSTtreeDemo
 

C

children(TreeNode) - Method in interface asd_library.tree.tree.Tree_adt
 
clear() - Method in class asd_library.tree.bstree.BSTree
Removes all of the elements from this BSTree
clone() - Method in class asd_library.queue.Queue
Returns a shallow copy of this Queue.
clone() - Method in class asd_library.stack.Stack
Returns a shallow copy of this Stack.
compareTo(Object) - Method in class asd_library.BaseObject
Implements the compareTo method.
ConsoleReader - class asd_library.tree.bstree.ConsoleReader.
This class reads strings and numbers from a generic input stream.
ConsoleReader(InputStream) - Constructor for class asd_library.tree.bstree.ConsoleReader
Creates a console reader on an input stream, as System.in
currentSize - Variable in class asd_library.hash.HashTable
 

D

DEFAULTCAPACITY - Static variable in class asd_library.tree.heap.Heap
 
deleteFirst() - Method in interface asd_library.PriorityQueue_adt
Deletes the key stored into the first position of this queue.
deleteFirst() - Method in class asd_library.tree.heap.Heap
Deletes the first element stored in this heap.
dequeue() - Method in interface asd_library.queue.Queue_adt
Retrieves the item from the queue head and removes it.
dequeue() - Method in class asd_library.queue.Queue
Retrieves the item from the queue head and removes it.
Dictionary_adt - interface asd_library.Dictionary_adt.
The abstract data type of a dictionary

E

element - Variable in class asd_library.tree.avltree.AvlNode
The data in the node
element(BSTNode) - Method in class asd_library.tree.bstree.BSTree
Method to get element field.
element(TreeNode) - Method in interface asd_library.tree.tree.Tree_adt
method to get element field.
enqueue(Object) - Method in interface asd_library.queue.Queue_adt
Stores an item at the queue end.
enqueue(Object) - Method in class asd_library.queue.Queue
Stores an item at the queue end.
equals(BaseObject) - Method in class asd_library.BaseObject
Implements the equals method.
equals(Object) - Method in class asd_library.queue.Queue
Compares the specified object with this queue for equality.
equals(Stack) - Method in class asd_library.stack.Stack
Compares the specified object with this stack for equality.
exchange(int, int) - Method in class asd_library.tree.heap.Heap
Exchanges the value stored in the position index e parent in this heap.

F

find(Comparable) - Method in interface asd_library.Dictionary_adt
Returns the value to which this map maps the specified key.
find(Comparable) - Method in class asd_library.tree.bstree.BSTree
Finds the specified element el.
find(Comparable) - Method in class asd_library.tree.avltree.AvlTree
Find an item in the tree.
find(Comparable) - Method in class asd_library.hash.HashTable
Returns the value to which this map maps the specified key.
findMax() - Method in class asd_library.tree.avltree.AvlTree
Find the largest item in the tree.
findMin() - Method in class asd_library.tree.avltree.AvlTree
Find the smallest item in the tree.
firstChild - Variable in class asd_library.tree.tree.TreeNode
The first child node of current node.
firstEl() - Method in interface asd_library.queue.Queue_adt
Retrieves the item from the queue head but doesn't remove it.
firstEl() - Method in class asd_library.queue.Queue
Retrieves the item from the queue head but doesn't remove it.

G

getElement() - Method in class asd_library.tree.avltree.AvlNode
Returns the element of the node.
getFirst() - Method in interface asd_library.PriorityQueue_adt
Returns the key stored into the first position of this queue.
getFirst() - Method in class asd_library.tree.heap.Heap
Returns the first element in this heap.
getFirstChild() - Method in class asd_library.tree.tree.TreeNode
Returns the first child of the node.
getKey() - Method in class asd_library.tree.bstree.BSTNode
Returns the key of the node.
getKey() - Method in class asd_library.tree.tree.TreeNode
Returns the key of the node.
getLeftChild() - Method in class asd_library.tree.bstree.BSTNode
Returns the left child of the node.
getLeftChild() - Method in class asd_library.tree.avltree.AvlNode
Returns the left child of the node.
getMaxChildIndex(int) - Method in class asd_library.tree.heap.Heap
Returns the child with the greatest value of the specified parent.
getNextSibling() - Method in class asd_library.tree.tree.TreeNode
Returns the next sibling of the node.
getParent() - Method in class asd_library.tree.tree.TreeNode
Returns the parent of the node.
getRightChild() - Method in class asd_library.tree.bstree.BSTNode
Returns the right child of the node.
getRightChild() - Method in class asd_library.tree.avltree.AvlNode
Returns the right child of the node.
getSize() - Method in class asd_library.tree.bstree.BSTree
Returns the number of nodes in this BSTree.
getSize() - Method in class asd_library.tree.heap.Heap
Returns the number of elements in this heap.

H

hash(String, int) - Static method in class asd_library.hash.HashTable
A hash routine for String objects.
HashTable - class asd_library.hash.HashTable.
Implementation of hash table
HashTable() - Constructor for class asd_library.hash.HashTable
Costructs the hash table.
HashTable(int) - Constructor for class asd_library.hash.HashTable
Costructs the hash table.
HashTable(int, boolean) - Constructor for class asd_library.hash.HashTable
Costructs the hash table.
HashTableDemo - class asd_library.hash.HashTableDemo.
Simple Test Program
HashTableDemo() - Constructor for class asd_library.hash.HashTableDemo
 
Heap - class asd_library.tree.heap.Heap.
The class Heap implements a max-heap
Heap() - Constructor for class asd_library.tree.heap.Heap
 
Heap(int) - Constructor for class asd_library.tree.heap.Heap
 
HeapDemo - class asd_library.tree.heap.HeapDemo.
Test class for the Heap
HeapDemo() - Constructor for class asd_library.tree.heap.HeapDemo
 
heapify(int) - Method in class asd_library.tree.heap.Heap
Trickles down the node i until it reaches the position that reestablishes the heap order.
heapSort(Comparable[]) - Static method in class asd_library.tree.heap.Heap
Sorting algorithm
height - Variable in class asd_library.tree.avltree.AvlNode
Height

I

inorder() - Method in class asd_library.tree.bstree.BSTree
Implements a inorder traversal of this BSTree, beginning from the root.
inorder(BSTNode) - Method in class asd_library.tree.bstree.BSTree
Recorsive method to implement the inorder traversal, beginning from the specified node p.
insert(BSTNode) - Method in class asd_library.tree.bstree.BSTree
Inserts the specified node in this BSTree.
insert(Comparable) - Method in interface asd_library.PriorityQueue_adt
Inserts a new key into this queue
insert(Comparable) - Method in interface asd_library.Dictionary_adt
Inserts the key x in this dictionary.
insert(Comparable) - Method in class asd_library.tree.bstree.BSTree
Inserts the specified element in this BSTree.
insert(Comparable) - Method in class asd_library.tree.avltree.AvlTree
Insert into the tree; duplicates are ignored.
insert(Comparable) - Method in class asd_library.tree.heap.Heap
Inserts the specified element key in this heap.
insert(Comparable) - Method in class asd_library.hash.HashTable
Inserts the key x in this dictionary.
insertionsort(Comparable[]) - Static method in class asd_library.sorting.SortingAlgorithms
Scans successive elements for out of order item, then insert the item in the proper place.
insertionsort(Comparable[], int, int) - Static method in class asd_library.sorting.SortingAlgorithms
Scans successive elements for out of order item, then insert the item in the proper place of the segment between the index first and last.
intValue() - Method in class asd_library.BaseObject
Gets the stored int value.
isActive - Variable in class asd_library.hash.HashTable
 
isEmpty() - Method in interface asd_library.queue.Queue_adt
Verifies if the queue is empty.
isEmpty() - Method in class asd_library.queue.Queue
Verifies if the queue is empty.
isEmpty() - Method in class asd_library.stack.Stack
Verifies if the stack is empty.
isEmpty() - Method in interface asd_library.stack.Stack_adt
Verifies if the stack is empty.
isEmpty() - Method in class asd_library.tree.bstree.BSTree
Tests if this BSTree has no components.
isEmpty() - Method in class asd_library.tree.avltree.AvlTree
Test if the tree is logically empty.
isEmpty() - Method in class asd_library.tree.heap.Heap
Verifies if this heap is empty
isFull() - Method in class asd_library.tree.heap.Heap
Verifies if this heap is full
isInTree(Comparable) - Method in class asd_library.tree.bstree.BSTree
Tests if the specified object is in this BSTree.
isLeaf() - Method in class asd_library.tree.bstree.BSTNode
Verifies if this BSTNode is a leaf.
isLeaf() - Method in class asd_library.tree.tree.TreeNode
Verifies if this TreeNode is a leaf.
isLeaf(BSTNode) - Method in class asd_library.tree.bstree.BSTree
Verifies if the node v is a leaf.
isLeaf(int) - Method in class asd_library.tree.heap.Heap
Verifies if the specified node i is a leaf.
isLeaf(TreeNode) - Method in interface asd_library.tree.tree.Tree_adt
Verifies if the node v is a leaf.
isRehashable - Variable in class asd_library.hash.HashTable
 
isRoot(BSTNode) - Method in class asd_library.tree.bstree.BSTree
Verifies if the node v is the root of this tree
isRoot(int) - Method in class asd_library.tree.heap.Heap
Verifies if the specified node i is the root.
isRoot(TreeNode) - Method in interface asd_library.tree.tree.Tree_adt
Verifies if the node v is the root.
iterativeInorder() - Method in class asd_library.tree.bstree.BSTree
Iterative method to implement the inorder traversal.
iterativePostorder() - Method in class asd_library.tree.bstree.BSTree
Iterative method to implement the postorder traversal.
iterativePreorder() - Method in class asd_library.tree.bstree.BSTree
Iterative method to implement the preorder traversal.
iterativeSearch(BSTNode, Comparable) - Method in class asd_library.tree.bstree.BSTree
Iterative method to find the element el, starting from the specified node p
iterativeSearch(Comparable) - Method in class asd_library.tree.bstree.BSTree
Searches for the element el in this BSTree.

J

JBSTreeDemo - class asd_library.tree.bstree.JBSTreeDemo.
 
JBSTreeDemo(String) - Constructor for class asd_library.tree.bstree.JBSTreeDemo
 

K

k - Variable in class asd_library.hash.HashTable
 
key - Variable in class asd_library.tree.bstree.BSTNode
The key of the node.
key - Variable in class asd_library.tree.tree.TreeNode
The key of the node.

L

left - Variable in class asd_library.tree.avltree.AvlNode
Left child
leftChild - Variable in class asd_library.tree.bstree.BSTNode
The left child node of current node.
leftChild(BSTNode) - Method in class asd_library.tree.bstree.BSTree
Returns the left child node of v
listIterator() - Method in class asd_library.queue.Queue
Returns a list-iterator of the elements in this queue (in proper sequence)
listIterator() - Method in class asd_library.stack.Stack
Returns a list-iterator of the elements in this stack (in proper sequence)

M

main(String[]) - Static method in class asd_library.queue.QueueDemo
Calls the constructor and some methods.
main(String[]) - Static method in class asd_library.stack.StackDemo
Calls the constructor and some methods
main(String[]) - Static method in class asd_library.tree.bstree.JBSTreeDemo
 
main(String[]) - Static method in class asd_library.tree.bstree.BSTtreeDemo
 
main(String[]) - Static method in class asd_library.tree.avltree.AvlTreeDemo
 
main(String[]) - Static method in class asd_library.tree.heap.HeapDemo
 
main(String[]) - Static method in class asd_library.hash.HashTableDemo
 
makeEmpty() - Method in class asd_library.tree.avltree.AvlTree
Make the tree logically empty.
makeEmpty() - Method in class asd_library.hash.HashTable
Make the hash table logically empty.
MAXVAL - Static variable in class asd_library.tree.bstree.JBSTreeDemo
 
MAXVAL - Static variable in class asd_library.tree.bstree.BSTtreeDemo
 
merge(Comparable[], int, int) - Static method in class asd_library.sorting.SortingAlgorithms
Merges the two sorted halves of a segment into a only one ordered segment.
mergesort(Comparable[]) - Static method in class asd_library.sorting.SortingAlgorithms
Calls the recursive method mergesort(Comparable[] data, int first, int last)
mergesort(Comparable[], int, int) - Static method in class asd_library.sorting.SortingAlgorithms
Divides recursively the array to order in two half up to find segments of length 1.

N

nextSibling - Variable in class asd_library.tree.tree.TreeNode
The next sibling of current node

P

parent - Variable in class asd_library.tree.tree.TreeNode
The parent of this node
parent(TreeNode) - Method in interface asd_library.tree.tree.Tree_adt
Return the parent node of node v
pop() - Method in class asd_library.stack.Stack
Retrieves an item and deletes it from the stack.
pop() - Method in interface asd_library.stack.Stack_adt
Retrieves an item and deletes it from the stack.
postorder() - Method in class asd_library.tree.bstree.BSTree
Implements a postorder traversal of this BSTree, beginning from the root.
postorder(BSTNode) - Method in class asd_library.tree.bstree.BSTree
Recorsive method to implement the postorder traversal, beginning from the specified node p.
predecessor(BSTNode, Comparable) - Method in class asd_library.tree.bstree.BSTree
Searches the predecessor of the node with key equals to el, starting from the node p
predecessor(Comparable) - Method in class asd_library.tree.bstree.BSTree
Searches the predecessor of the node with key equals to el.
preorder() - Method in class asd_library.tree.bstree.BSTree
Implements a preorder traversal of this BSTree, beginning from the root.
preorder(BSTNode) - Method in class asd_library.tree.bstree.BSTree
Recorsive method to implement the preorder traversal, beginning from the specified node p.
printTree() - Method in class asd_library.tree.avltree.AvlTree
Print the tree contents in sorted order.
PriorityQueue_adt - interface asd_library.PriorityQueue_adt.
The abstract data type of a priority queue
push(Object) - Method in class asd_library.stack.Stack
Stores an item on the stack.
push(Object) - Method in interface asd_library.stack.Stack_adt
Stores an item on the stack.

Q

Queue - class asd_library.queue.Queue.
Implementation of the abstract data type Queue
Queue_adt - interface asd_library.queue.Queue_adt.
The abstract data type queue.
Queue() - Constructor for class asd_library.queue.Queue
 
QueueDemo - class asd_library.queue.QueueDemo.
Main class to show queue use.
QueueDemo() - Constructor for class asd_library.queue.QueueDemo
 
quicksort(Comparable[]) - Static method in class asd_library.sorting.SortingAlgorithms
Finds the largest element and put it at the end of data then calls the recursive method quicksort(Comparable[] data, int first, int last)
quicksort(Comparable[], int, int) - Static method in class asd_library.sorting.SortingAlgorithms
Partitions array into two segments: the first segment all elements are less than or equal to the pivot value (bound), the second segment all elements are greater or equal to the pivot value.
quicksort2(Comparable[]) - Static method in class asd_library.sorting.SortingAlgorithms
Finds the largest element and puts it at the end of data then calls the method quicksort2(Comparable[] data, int first, int last).
quicksort2(Comparable[], int, int) - Static method in class asd_library.sorting.SortingAlgorithms
quicksort2 uses insertionsort in recursion when size of sub-array < 30.

R

readDouble() - Method in class asd_library.tree.bstree.ConsoleReader
Legge una riga di input e la converte in un numero in virgola Mobile.
readInt() - Method in class asd_library.tree.bstree.ConsoleReader
Reads an input line and converts it in a e la converte in un integer.
readLine() - Method in class asd_library.tree.bstree.ConsoleReader
Legge una riga di input.
remove(Comparable) - Method in interface asd_library.Dictionary_adt
Removes the mapping for this key from this dictionary if it is present
remove(Comparable) - Method in class asd_library.tree.bstree.BSTree
Removes the element el from this tree
remove(Comparable) - Method in class asd_library.tree.avltree.AvlTree
Remove from the tree.
remove(Comparable) - Method in class asd_library.hash.HashTable
Removes the mapping for this key from this dictionary if it is present
right - Variable in class asd_library.tree.avltree.AvlNode
Right child
rightChild - Variable in class asd_library.tree.bstree.BSTNode
The right child node of current node.
rightChild(BSTNode) - Method in class asd_library.tree.bstree.BSTree
Returns the right child node of v
root - Variable in class asd_library.tree.bstree.BSTree
 
root - Variable in class asd_library.tree.avltree.AvlTree
The tree root.
root() - Method in class asd_library.tree.bstree.BSTree
Return the BSTree root node
root() - Method in interface asd_library.tree.tree.Tree_adt
Returns the root of this tree.

S

search(BSTNode, Comparable) - Method in class asd_library.tree.bstree.BSTree
Recorsive method to find the element el, starting from the specified node p
search(Comparable) - Method in class asd_library.tree.bstree.BSTree
Searches for the element el in this BSTree.
selectionsort(Comparable[]) - Static method in class asd_library.sorting.SortingAlgorithms
Finds the least element in the array, and put it in the proper place.
setKey(int) - Method in class asd_library.BaseObject
Sets key to k
setParent(TreeNode) - Method in class asd_library.tree.tree.TreeNode
Sets the parent of this node to be the specified node.
size - Variable in class asd_library.tree.bstree.BSTree
 
SortingAlgorithms - class asd_library.sorting.SortingAlgorithms.
A collection of static methods implementing a wide variety of sorting algorithms.
SortingAlgorithms() - Constructor for class asd_library.sorting.SortingAlgorithms
 
Stack - class asd_library.stack.Stack.
Implementation of the abstract data type stack
Stack_adt - interface asd_library.stack.Stack_adt.
The abstract data type stack.
Stack() - Constructor for class asd_library.stack.Stack
 
StackDemo - class asd_library.stack.StackDemo.
Main class to show queue use.
StackDemo() - Constructor for class asd_library.stack.StackDemo
 
successor(BSTNode, Comparable) - Method in class asd_library.tree.bstree.BSTree
Searches the successor of the node with key equals to el, starting from the node p
successor(Comparable) - Method in class asd_library.tree.bstree.BSTree
Searches the successor of the node with key equals to el.
swap(Object[], int, int) - Static method in class asd_library.sorting.SortingAlgorithms
Swaps element in position e1 with that in position e2

T

table - Variable in class asd_library.hash.HashTable
The array of elements.
temp - Static variable in class asd_library.sorting.SortingAlgorithms
static variable used by merge();
top() - Method in class asd_library.stack.Stack
Retrieves the item from the stack head but doesn't remove it.
top() - Method in interface asd_library.stack.Stack_adt
Retrieves the item from the stack head but doesn't remove it.
toString() - Method in class asd_library.BaseObject
Implements the toString method.
toString() - Method in class asd_library.queue.Queue
Returns a string representation of the queue.
toString() - Method in class asd_library.stack.Stack
Returns a string representation of the stack.
toString() - Method in class asd_library.tree.heap.Heap
Returns a string representation of the heap.
Tree_adt - interface asd_library.tree.tree.Tree_adt.
The abstract data type of a generic tree.
treeHeight() - Method in class asd_library.tree.bstree.BSTree
Returns the height of this BSTree.
treeHeight(BSTNode) - Method in class asd_library.tree.bstree.BSTree
Returns the height of the subtree with root in node.
TreeNode - class asd_library.tree.tree.TreeNode.
Basic node stored in a binary search tree.
TreeNode() - Constructor for class asd_library.tree.tree.TreeNode
Constructs a new node.
TreeNode(Comparable) - Constructor for class asd_library.tree.tree.TreeNode
Constructs a new node.
TreeNode(Comparable, TreeNode, TreeNode, TreeNode) - Constructor for class asd_library.tree.tree.TreeNode
Constructs a new node.

V

visit() - Method in class asd_library.BaseObject
 
visit() - Method in class asd_library.tree.bstree.BSTNode
Prints the String that represents the key of the node.
visit() - Method in class asd_library.tree.tree.TreeNode
Prints the String that represents the key of hte node.

A B C D E F G H I J K L M N P Q R S T V