Index

A B C D E F G H I J K L M N O P Q R S T U V W Y
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form

A

A234Tree<Key extends Comparable<Key>> - Class in aud

Simple implementation of 2-3-4-trees based on KTreeNode.

A234Tree() - Constructor for class aud.A234Tree

create an empty 2-3-4-tree

A234Tree(boolean) - Constructor for class aud.A234Tree

create an empty 2-3-4-tree and select insertion strategy

A234TreeExample - Class in aud.example

example: insert entries

A234TreeExample(boolean) - Constructor for class aud.example.A234TreeExample

create application instance

A234TreeTest - Class in aud.test

A234TreeTest() - Constructor for class aud.test.A234TreeTest

AbstractEdge - Class in aud.graph

Interface to edges of a graph.

AbstractEdge() - Constructor for class aud.graph.AbstractEdge

AbstractGraph<Node extends AbstractNode,Edge extends AbstractEdge> - Class in aud.graph

Interface to a graph.

AbstractGraph(Node, Edge) - Constructor for class aud.graph.AbstractGraph

Constructor.

AbstractGraph.Edges - Class in aud.graph

Defines iterator over all edges of an @{link AbstractGraph}.

AbstractNode - Class in aud.graph

Interface to nodes of a graph.

AbstractNode() - Constructor for class aud.graph.AbstractNode

AbstractPriorityQueue<T> - Class in aud.adt

Interface for an ADT priority queue.

AbstractPriorityQueue() - Constructor for class aud.adt.AbstractPriorityQueue

create empty PQ

AbstractPriorityQueue(Comparator<T>) - Constructor for class aud.adt.AbstractPriorityQueue

create empty PQ and use cmp_ for comparison of priorities

AbstractQueue<T> - Class in aud.adt

Interface for an ADT queue.

AbstractQueue() - Constructor for class aud.adt.AbstractQueue

create empty queue

AbstractStack<T> - Class in aud.adt

Interface for an ADT stack.

AbstractStack() - Constructor for class aud.adt.AbstractStack

create empty stack

addEdge(Node, Node) - Method in class aud.graph.AbstractGraph

Create and add new edge from source to destination.

addEdge(Node, Node) - Method in class aud.graph.GraphAM

addNode() - Method in class aud.graph.AbstractGraph

create and add new node

addNode() - Method in class aud.graph.GraphAM

AdjacencyMatrix<Edge> - Class in aud.graph

Sparse adjacency matrix.

AdjacencyMatrix(boolean) - Constructor for class aud.graph.AdjacencyMatrix

create empty matrix

AdjacencyMatrixTest - Class in aud.test

AdjacencyMatrixTest() - Constructor for class aud.test.AdjacencyMatrixTest

all_edges_style - Variable in class aud.util.CommonGraphvizDecorator

all_nodes_style - Variable in class aud.util.CommonGraphvizDecorator

astar(int, int) - Method in class aud.example.grid.Grid

A*

AStarShortestPath - Class in aud.example.graph

implementation of the A* algorithm

AStarShortestPath(MyGraph) - Constructor for class aud.example.graph.AStarShortestPath

AStarShortestPath(MyGraph, MyNode) - Constructor for class aud.example.graph.AStarShortestPath

create instance with destination s1

at(int) - Method in class aud.DList

retrieve i-th entry [O(n)]

at(int) - Method in class aud.SList

retrieve i-th entry [O(n)]

at(int) - Method in class aud.Vector

get i-th entry [O(1)]

AT - Static variable in class aud.example.graph.Tokenizer

AtomicExpression - Class in aud.example.expr

Superclass for data associated with a tree node.

AtomicExpression() - Constructor for class aud.example.expr.AtomicExpression

AtomicExpression.Type - Enum Class in aud.example.expr

type identifiers returned by AtomicExpression.getType()

aud - package aud

AuD lecture: Data structures, algorithms, examples

aud.adt - package aud.adt

abstract data types

aud.example - package aud.example

examples and demos

aud.example.expr - package aud.example.expr

example: parse and evaluate arithmetic expressions

aud.example.graph - package aud.example.graph

demos of graph algorithms

aud.example.grid - package aud.example.grid

graph traversal on a uniform gird

aud.example.hash - package aud.example.hash

simple hash for experimenting and visualization

aud.graph - package aud.graph

Graph data structures and algorithms.

aud.graph.matrix - package aud.graph.matrix

sparse matrices for encoding adjacency

aud.test - package aud.test

unit tests based on JUnit 4

aud.util - package aud.util

utilities (not related to AuD lecture)

AVLTree<Key extends Comparable<Key>,Value> - Class in aud

Simple implementation of an AVL tree.

AVLTree() - Constructor for class aud.AVLTree

create empty tree

AVLTree.AVLNode - Class in aud

Node in an AVLTree.

AVLTreeExample - Class in aud.example

example: insert entries and maintain balance

AVLTreeExample() - Constructor for class aud.example.AVLTreeExample

create application instance

AVLTreeTest - Class in aud.test

AVLTreeTest() - Constructor for class aud.test.AVLTreeTest

B

back() - Method in class aud.DList

retrieve last entry (must exist) [O(1)]

back() - Method in class aud.SList

retrieve last entry (must exist) [O(n)]

back() - Method in class aud.Vector

get last entry [O(1)]

backtrack(int) - Method in class aud.example.grid.Grid

backtrack and Grid.display() path to source

backwards() - Method in class aud.DList

Get instance that provides a DList<T>.BackwardIterator.

beginRecording() - Method in class aud.example.hash.SimpleHashtable

start recording of history

bfs(int) - Method in class aud.example.grid.Grid

BFS

bg(int) - Method in class aud.util.Terminal

set background color

BGCOLOR - Static variable in class aud.util.Terminal

set background color

BinarySearchTree<Key extends Comparable<Key>,Value> - Class in aud

Base class for a binary search tree.

BinarySearchTree() - Constructor for class aud.BinarySearchTree

create empty tree

BinarySearchTree.Cursor - Class in aud

Reference to a key-value pair in a BinarySearchTree.

BinarySearchTree.Decorator - Class in aud

enables decoration "by key"

BinarySearchTree.Entry - Class in aud

Key-value pair as entry (= node data) in a search tree.

BinarySearchTree.Iterator - Class in aud

inorder iterator

BinarySearchTree.LowerBound - Class in aud

result of BinarySearchTree.findLowerBound(Key)

BinarySearchTree.Node - Class in aud

Node in a BinarySearchTree.

BinarySearchTree.Range - Class in aud

iterable range (subsequence)

BinarySearchTree.RangeIterator - Class in aud

Iterator over BinarySearchTree<Key extends Comparable<Key>,Value>.Range.

BinarySearchTree.Visitor - Class in aud

visitor for traversing the tree in preorder

BinarySearchTreeExample - Class in aud.example

example: insert, remove, and restructure entries

BinarySearchTreeExample(BinarySearchTree<String, String>) - Constructor for class aud.example.BinarySearchTreeExample

create application instance

BinarySearchTreeTest - Class in aud.test

BinarySearchTreeTest() - Constructor for class aud.test.BinarySearchTreeTest

BinaryTree<T> - Class in aud

Simple binary tree.

BinaryTree(T) - Constructor for class aud.BinaryTree

create new root node without children

BinaryTree(T, BinaryTree<T>, BinaryTree<T>) - Constructor for class aud.BinaryTree

create new root node with children

BinaryTreeTest - Class in aud.test

BinaryTreeTest() - Constructor for class aud.test.BinaryTreeTest

BinaryTreeTraversal<T> - Class in aud

Provide traversals of binary trees.

BinaryTreeTraversal - Class in aud.example

example: visualize binary tree traversal

BinaryTreeTraversal() - Constructor for class aud.BinaryTreeTraversal

BinaryTreeTraversal(BinaryTreeTraversal.MyTree) - Constructor for class aud.example.BinaryTreeTraversal

create traversal application for tree

BinaryTreeTraversal.Inorder - Class in aud

helper: generates BinaryTreeTraversal<T>.InorderIterator

BinaryTreeTraversal.InorderIterator - Class in aud

inorder iterator for BinaryTree

BinaryTreeTraversal.Levelorder - Class in aud

helper: generates BinaryTreeTraversal<T>.LevelorderIterator

BinaryTreeTraversal.LevelorderIterator - Class in aud

level-order iterator for BinaryTree

BinaryTreeTraversal.Postorder - Class in aud

helper: generates BinaryTreeTraversal<T>.PostorderIterator

BinaryTreeTraversal.PostorderIterator - Class in aud

postorder iterator for BinaryTree

BinaryTreeTraversal.Preorder - Class in aud

helper: generates BinaryTreeTraversal<T>.PreorderIterator

BinaryTreeTraversal.PreorderIterator - Class in aud

preorder iterator for BinaryTree

BinaryTreeTraversal.RecursiveTraversalIterator - Class in aud

base class for stack-based pre-/in-/postorder traversal

BinaryTreeTraversal.Traversal - Class in aud

Base class for traversal.

BLACK - Static variable in class aud.util.Terminal

BLUE - Static variable in class aud.util.Terminal

bold(boolean) - Method in class aud.util.Terminal

switch use of bold font

BOLD - Static variable in class aud.util.Terminal

set normal text

BreadthFirstSearch - Class in aud.example.graph

implements BFS

BreadthFirstSearch(MyGraph) - Constructor for class aud.example.graph.BreadthFirstSearch

BTree<Key extends Comparable<Key>> - Class in aud

Simple implementation of B-trees based on KTreeNode.

BTree(int) - Constructor for class aud.BTree

create an empty tree of order 2*m+1

BTreeExample - Class in aud.example

example: insert entries

BTreeExample(int) - Constructor for class aud.example.BTreeExample

create application instance

BTreeTest - Class in aud.test

BTreeTest() - Constructor for class aud.test.BTreeTest

C

capacity() - Method in class aud.Vector

Get Capacity, i.e., the maximum size the vector can grow without allocating new storage.

cell(int, int) - Method in class aud.example.grid.Grid

get cell (i,j)

Cell() - Constructor for class aud.example.grid.Grid.Cell

cell_index(int, int) - Method in class aud.example.grid.Grid

get cell index from coordinates

check(Edge) - Method in class aud.graph.AbstractGraph

helper: check if edge is valid

check(Edge) - Method in class aud.graph.GraphAM

check(Node) - Method in class aud.graph.AbstractGraph

helper: check if node is valid

check(Node) - Method in class aud.graph.GraphAM

checkConsistency() - Method in class aud.A234Tree

few consistency checkschild.entries_.at(i).child

checkConsistency() - Method in class aud.BinarySearchTree

consistency checks

checkConsistency() - Method in class aud.BTree

few consistency checkschild.entries_.at(i).child

checkConsistency() - Method in class aud.KTreeNode

few consistency checks

checkConsistency() - Method in class aud.PriorityQueue

check consistency

checkConsistency(BinarySearchTree.Node) - Method in class aud.AVLTree

additionally check heights and balancing

checkConsistency(BinarySearchTree.Node) - Method in class aud.BinarySearchTree

checkConsistency(BinarySearchTree.Node) - Method in class aud.RedBlackTree

additionally check red-node property

clear() - Method in class aud.DList

Erase all entries.

clear() - Method in class aud.SList

Erase all entries.

clear() - Method in class aud.util.CommonGraphvizDecorator

Clear all decorations.

clear() - Method in class aud.Vector

remove all entries (capacity remains) [O(1)]

CLEAR_SCREEN - Static variable in class aud.util.Terminal

clear screen and reset cursor position to upper left corner

clearColumnAndRow(int) - Method in class aud.graph.AdjacencyMatrix

Set all entries in row idx and column idx to null.

clone() - Method in class aud.example.expr.AtomicExpression

Get a copy: a new AtomicExpression of same type/content.

clone() - Method in class aud.example.expr.Divide

clone() - Method in class aud.example.expr.Minus

clone() - Method in class aud.example.expr.Number

clone() - Method in class aud.example.expr.Plus

clone() - Method in class aud.example.expr.Power

clone() - Method in class aud.example.expr.Symbol

clone() - Method in class aud.example.expr.Times

clone() - Method in class aud.example.expr.UnaryMinus

close() - Method in class aud.util.SVGViewer

close viewer

cls() - Method in class aud.util.Terminal

clear screen (cls(true))

cls(boolean) - Method in class aud.util.Terminal

clear screen (for clear=false, move only cursor)

cmp - Variable in class aud.BinarySearchTree.LowerBound

result of the last call to BinarySearchTree.compareKeys(Key, Key)

cmp_ - Variable in class aud.adt.AbstractPriorityQueue

CollisionHandler<T> - Class in aud.example.hash

Collision handling strategy in SimpleHashtable.

CollisionHandler() - Constructor for class aud.example.hash.CollisionHandler

color - Variable in class aud.example.graph.MyEdge

color as string

color - Variable in class aud.example.graph.MyNode

color as string

color - Variable in class aud.example.grid.Grid.Cell

indexed color, see Terminal

Colormap<T> - Class in aud.util

simple interface for color map

Colormap() - Constructor for class aud.util.Colormap

ColormapCount - Class in aud.util

color map for (small) positive integer counts

ColormapCount() - Constructor for class aud.util.ColormapCount

ColormapJet - Class in aud.util

map values in [minValue,maxValue] to color

ColormapJet() - Constructor for class aud.util.ColormapJet

ColormapJet(double, double) - Constructor for class aud.util.ColormapJet

columnDegree(int) - Method in class aud.graph.matrix.SparseMatrixCS

get number of nonzero entries in column j

COMMA - Static variable in class aud.example.graph.Tokenizer

CommonGraphvizDecorator - Class in aud.util

Interface for simple decorator with preset properties

CommonGraphvizDecorator() - Constructor for class aud.util.CommonGraphvizDecorator

compareKeys(Key, Key) - Method in class aud.BinarySearchTree

Compares keys where null keys refer to smallest key.

compareKeys(Key, Key) - Method in class aud.KTreeNode

Compares keys where null keys refer to smallest key.

compareNodes - Variable in class aud.example.graph.AStarShortestPath

comparator for {#link aud.PriorityQueue}: compares f-values (in contrast to {#link DijkstraShortestPath}

compareNodes - Variable in class aud.example.graph.PriorityFirstSearch

comparator for {#link aud.PriorityQueue}

compareTo(AbstractEdge) - Method in class aud.graph.AbstractEdge

compareTo(AbstractNode) - Method in class aud.graph.AbstractNode

compareTo(Coordinate) - Method in class aud.graph.matrix.Coordinate

computeHeight() - Method in class aud.AVLTree.AVLNode

compute height of subtree recursively (for testing only)

computeMaxFlow(MyGraph) - Method in class aud.example.graph.MaxFlowExample

main algorithm (calls MaxFlowExample.findAugmentingPath() and MaxFlowExample.addPath(double)

contains(Key) - Method in class aud.HashMap

Is key contained in map?

contains(T) - Method in class aud.PriorityQueue

Is x contained in PQ?

Coordinate - Class in aud.graph.matrix

Row/column coordinates (i,j).

Coordinate(int, int) - Constructor for class aud.graph.matrix.Coordinate

create coordinate (i,j)

create() - Method in class aud.example.graph.MyEdge

create() - Method in class aud.example.graph.MyNode

create() - Method in class aud.graph.AbstractEdge

Create new edge instance.

create() - Method in class aud.graph.AbstractNode

Create new node instance.

create() - Method in class aud.graph.SimpleEdge

create() - Method in class aud.graph.SimpleNode

create_tunnels_for(Grid.Cell) - Method in class aud.example.grid.Grid

create tunnels for specified entry at cell

createComponents() - Method in class aud.util.DotViewer

createComponents() - Method in class aud.util.SingleStepper

createComponents() - Method in class aud.util.SVGViewer

createGraph() - Static method in class aud.example.graph.MaxFlowExample

create a small example graph

createNode(Key, Value) - Method in class aud.AVLTree

override: create new AVLNode

createNode(Key, Value) - Method in class aud.BinarySearchTree

createNode(Key, Value) - Method in class aud.RedBlackTree

override: create new RBNode

CYAN - Static variable in class aud.util.Terminal

D

d - Variable in class aud.example.graph.MyNode

distance to start node (sum of weighs or edge count if no weights defined)

d - Variable in class aud.example.grid.Grid.Cell

distance to source

decorator - Variable in class aud.example.BinaryTreeTraversal

decorator - Variable in class aud.example.expr.ExpressionTreeTraversal

Decorator() - Constructor for class aud.BinarySearchTree.Decorator

decorator_ - Variable in class aud.example.BinarySearchTreeExample

DEDGE - Static variable in class aud.example.graph.Tokenizer

delay - Variable in class aud.example.grid.Grid

delay in Grid.display() in milliseconds

DepthFirstSearch - Class in aud.example.graph

Standard recursive implementation of depth first search.

DepthFirstSearch(MyGraph) - Constructor for class aud.example.graph.DepthFirstSearch

dequeue() - Method in class aud.adt.AbstractQueue

Remove front element from queue.

dequeue() - Method in class aud.example.VerboseQueue

dequeue() - Method in class aud.Queue

dequeue() - Method in class aud.QueueDL

destination() - Method in class aud.graph.AbstractEdge

get destination node

dfs(MyNode) - Method in class aud.example.graph.DepthFirstSearch

dfs_iterative(int) - Method in class aud.example.grid.Grid

iterative DFS

dfs_recursive(int) - Method in class aud.example.grid.Grid

recusive DFS

dijkstra(int, int) - Method in class aud.example.grid.Grid

Dijkstra

DijkstraShortestPaths - Class in aud.example.graph

implements Dijkstra's algorithm by defining DijkstraShortestPaths.priority(aud.example.graph.MyNode, aud.example.graph.MyEdge)

DijkstraShortestPaths(MyGraph) - Constructor for class aud.example.graph.DijkstraShortestPaths

display() - Method in class aud.example.grid.Grid

display current grid

display() - Method in class aud.util.SVGViewer

display current svg file

display(Graphvizable) - Method in class aud.util.DotViewer

display object

display(Graphvizable) - Method in class aud.util.Graphviz

Display object.

display(File) - Method in class aud.util.SVGViewer

display svg file

display(String) - Method in class aud.util.DotViewer

display dot code

display(String) - Method in class aud.util.Graphviz

Render and display dotCode.

displayAsPDF(Graphvizable) - Method in class aud.util.Graphviz

Display object.

displayAsPDF(String) - Method in class aud.util.Graphviz

Render and display dotCode.

displayWindow(Graphvizable, String) - Static method in class aud.util.DotViewer

create new DotViewer (toplevel window) and display object

displayWindow(File, String) - Static method in class aud.util.SVGViewer

create new SVGViewer (toplevel window) and display file

displayWindow(String, String) - Static method in class aud.util.DotViewer

create new DotViewer (toplevel window) and display code

Divide - Class in aud.example.expr

binary / operator: A/B

Divide() - Constructor for class aud.example.expr.Divide

create operation

DIVIDE - Static variable in class aud.example.expr.Tokenizer

DList<T> - Class in aud

Implementation of a doubly linked list.

DList() - Constructor for class aud.DList

create empty list

DList.BackwardIterator - Class in aud

Backward iterator.

DList.Backwards - Class in aud

Utility class to obtain a DList<T>.BackwardIterator.

DList.ForwardIterator - Class in aud

Forward iterator

DList.Node - Class in aud

DListTest - Class in aud.test

DListTest() - Constructor for class aud.test.DListTest

dotfile - Variable in class aud.util.DotViewer

dotLabel() - Method in class aud.BinaryTree

dotLabel() - Method in class aud.KTreeNode

DotViewer - Class in aud.util

Simple viewer for Graphvizable.

DotViewer(JFrame) - Constructor for class aud.util.DotViewer

create new instance

DoubleHashing(HashFunction<T>) - Constructor for class aud.example.hash.HashtableExample.DoubleHashing

dumb() - Method in class aud.util.Terminal

Is this a dumb terminal without colors?

E

eatWhiteSpace() - Method in class aud.util.LexicalScanner

ignore white space (called by LexicalScanner.match(java.util.regex.Pattern)

edge(int) - Method in class aud.example.graph.GraphParser

parse edge

EDGE - Static variable in class aud.example.graph.Tokenizer

edges() - Method in class aud.graph.AbstractGraph

Get Edges instance to obtain iterator.

emacsclient(String, int, int) - Static method in class aud.util.Sys

open emacs client (Un*x only) (or no action otherwise)

empty() - Method in class aud.DList

determine if list is empty [O(1)]

empty() - Method in class aud.SList

determine if list is empty [O(1)]

empty() - Method in class aud.Vector

Is vector empty? [O(1)]

END_OF_INPUT - Static variable in class aud.util.LexicalScanner

no more input

endOfInput() - Method in class aud.util.LexicalScanner

reached end of input?

enqueue(T) - Method in class aud.adt.AbstractQueue

Enqueue element at end of queue.

enqueue(T) - Method in class aud.example.VerboseQueue

enqueue(T) - Method in class aud.Queue

enqueue(T) - Method in class aud.QueueDL

ensureEdge(Node, Node) - Method in class aud.graph.AbstractGraph

Same as AbstractGraph.getEdge(Node, Node) but throw if there is no such edge.

entries() - Method in class aud.HashMap

get iterable instance
for (HashMap<K,T>.Entry entry : map.entries()) { ... }

Entry(Key, Value) - Constructor for class aud.BinarySearchTree.Entry

construct node

env(String) - Static method in class aud.util.Sys

Get environment variable varname.

equals(Object) - Method in class aud.DList.ForwardIterator

equals(Object) - Method in class aud.graph.AbstractEdge

equals(Object) - Method in class aud.graph.AbstractNode

equals(Object) - Method in class aud.graph.matrix.Coordinate

equals(Object) - Method in class aud.SList.Iterator

erase(int) - Method in class aud.DList

erase entry at position i [O(n)]

erase(int) - Method in class aud.SList

erase entry at position i [O(n)]

erase(int) - Method in class aud.Vector

remove entry at position i [O(n)]

errorNear() - Method in class aud.example.expr.ExpressionParser

helper: generate a simple error message

errorNear() - Method in class aud.example.graph.GraphParser

helper: generate a simple error message

EXAMPLE - Static variable in class aud.example.grid.Grid

example grid (argument to Grid.setup(java.lang.String[])

exampleTree() - Static method in class aud.example.BinaryTreeTraversal

generate some tree

exampleTree() - Static method in class aud.example.IterativePreorderTraversal

generate some tree

execAndDetach(String) - Static method in class aud.util.Sys

Execute command in a new process and detach.

expect(int, String) - Method in class aud.example.expr.ExpressionParser

helper: check token (without calling ExpressionParser.nextToken()!)

expect(int, String) - Method in class aud.example.graph.GraphParser

helper: check token (without calling GraphParser.nextToken()!)

expression(int) - Method in class aud.example.expr.ExpressionParser

parse expression

ExpressionParser - Class in aud.example.expr

Simple expression parser.

ExpressionParser() - Constructor for class aud.example.expr.ExpressionParser

ExpressionParser2 - Class in aud.example.expr

Same as ExpressionParser but using modified grammar to provide the usual left-associative expressions.

ExpressionParser2() - Constructor for class aud.example.expr.ExpressionParser2

ExpressionTree - Class in aud.example.expr

Tree representation of arithmetic expression.

ExpressionTree(AtomicExpression) - Constructor for class aud.example.expr.ExpressionTree

create tree node

ExpressionTree(AtomicExpression, ExpressionTree, ExpressionTree) - Constructor for class aud.example.expr.ExpressionTree

creare and link tree node

ExpressionTreeExample - Class in aud.example.expr

ExpressionTree: minimal example

ExpressionTreeExample() - Constructor for class aud.example.expr.ExpressionTreeExample

ExpressionTreeTraversal - Class in aud.example.expr

example: visualize expression tree traversal

ExpressionTreeTraversal(ExpressionTree) - Constructor for class aud.example.expr.ExpressionTreeTraversal

create traversal application for tree

F

f - Variable in class aud.example.graph.MyNode

priority for A*-algorithm

f - Variable in class aud.example.grid.Grid.Cell

priority used by A* (distance + estimated distance to destination

factor(int) - Method in class aud.example.expr.ExpressionParser

parse factor

fg(int) - Method in class aud.util.Terminal

set foreground color

FGCOLOR - Static variable in class aud.util.Terminal

set foreground color

find(Key) - Method in class aud.A234Tree

find key in tree

find(Key) - Method in class aud.BinarySearchTree

find node with given key

find(Key) - Method in class aud.BTree

find key in tree

find(Key) - Method in class aud.HashMap

find value for key

find(Key) - Method in class aud.KTreeNode

find key

find_first(char) - Method in class aud.example.grid.Grid

find first cell in grid with value

findEntry(Key) - Method in class aud.BinarySearchTree

same as BinarySearchTree.find(Key) but return Cursor or null

findLowerBound(Key) - Method in class aud.BinarySearchTree

Find node or insertion position.

frame - Variable in class aud.util.DotViewer

frame - Variable in class aud.util.SingleStepper

frame - Variable in class aud.util.SVGViewer

front() - Method in class aud.adt.AbstractPriorityQueue

Get minimal element.

front() - Method in class aud.adt.AbstractQueue

Get front element of queue.

front() - Method in class aud.DList

retrieve first entry (must exist) [O(1)]

front() - Method in class aud.PriorityQueue

front() - Method in class aud.Queue

front() - Method in class aud.QueueDL

front() - Method in class aud.SList

retrieve first entry (must exist) [O(1)]

front() - Method in class aud.Vector

get first entry [O(1)]

G

g - Variable in class aud.util.GraphDemo

g_ - Variable in class aud.example.graph.Traversal

get(int, int) - Method in class aud.graph.matrix.SparseMatrixCS

get entry (i,j) [O(log(nnz))]

get_column(int) - Method in class aud.example.grid.Grid

get columns from cell index

get_row(int) - Method in class aud.example.grid.Grid

get row from cell index

getAbstractGraph() - Method in class aud.example.graph.MyGraph

view this graph as an AbstractGraph

getAllEdgesDecoration() - Method in class aud.util.CommonGraphvizDecorator

getAllEdgesDecoration() - Method in class aud.util.GraphvizDecorator

get standard decoration for all edges (list head)

getAllNodesDecoration() - Method in class aud.util.CommonGraphvizDecorator

getAllNodesDecoration() - Method in class aud.util.GraphvizDecorator

get standard decoration for all nodes (list head)

getBalance() - Method in class aud.AVLTree.AVLNode

get height difference between left and right subtree

getChild(int) - Method in class aud.KTreeNode

get k-th child node

getColumnEntries(int) - Method in class aud.graph.matrix.SparseMatrixCS

get entries in column j as array

getColumnIndices() - Method in class aud.graph.matrix.SparseMatrixCS

Get array of column indices in same order as for SparseMatrixCS.getRowIndices().

getColumnRowIndices(int) - Method in class aud.graph.matrix.SparseMatrixCS

get row indices in column j as array

getData() - Method in class aud.BinaryTree

get node data

getDecorator() - Method in class aud.BinarySearchTree

getDecorator() - Method in class aud.BinarySearchTree.Node

getDecorator() - Method in class aud.BinaryTree

getDecorator() - Method in class aud.example.expr.ExpressionTree

getDecorator() - Method in class aud.example.graph.MyGraph

getDecorator() - Method in class aud.graph.AbstractEdge

getDecorator() - Method in class aud.graph.AbstractGraph

getDecorator() - Method in class aud.graph.AbstractNode

getDecorator() - Method in class aud.KTreeNode

getDecorator() - Method in interface aud.util.GraphvizDecorable

get decoration or null

getDegree(Node) - Method in class aud.graph.AbstractGraph

Get total degree.

getEdge(Node, Node) - Method in class aud.graph.AbstractGraph

Get edge from source to destination.

getEdge(Node, Node) - Method in class aud.graph.GraphAM

getEdgeDecoration(GraphvizDecorable) - Method in class aud.example.graph.MyDecorator

getEdgeDecoration(GraphvizDecorable) - Method in class aud.util.GraphvizDecorator

get node decoration

getEdgeDecoration(GraphvizDecorable) - Method in class aud.util.SimpleDecorator

getEdgeIterator() - Method in class aud.graph.AbstractGraph

Get iterator over all edges.

getEdgeIterator() - Method in class aud.graph.GraphAM

getFullEdgeDecoration(GraphvizDecorable) - Method in class aud.util.GraphvizDecorator

concatenates GraphvizDecorator.getAllEdgesDecoration() and GraphvizDecorator.getEdgeDecoration(aud.util.GraphvizDecorable)

getFullNodeDecoration(GraphvizDecorable) - Method in class aud.util.GraphvizDecorator

concatenates GraphvizDecorator.getAllNodesDecoration() and GraphvizDecorator.getNodeDecoration(aud.util.GraphvizDecorable)

getGlobalStyle() - Method in class aud.util.CommonGraphvizDecorator

getGlobalStyle() - Method in class aud.util.GraphvizDecorator

get global style (returns same for all nodes/edges)

getGraphDecoration(GraphvizDecorable) - Method in class aud.util.CommonGraphvizDecorator

getGraphDecoration(GraphvizDecorable) - Method in class aud.util.GraphvizDecorator

get graph decoration (returns same for all nodes/edges)

getGraphLabel() - Method in class aud.util.CommonGraphvizDecorator

get label

getHashtableSize() - Method in class aud.HashMap

get current size of hash table (will be prime)

getHeight() - Method in class aud.AVLTree

get height of tree

getHeight(AVLTree.AVLNode) - Method in class aud.AVLTree.AVLNode

get height of subtree

getInDegree(Node) - Method in class aud.graph.AbstractGraph

get number of edges incident to node

getInEdges(Node) - Method in class aud.graph.AbstractGraph

Get incident edges of node.

getInEdges(Node) - Method in class aud.graph.GraphAM

getK() - Method in class aud.KTreeNode

get the number of subtrees/children (including null subtrees)

getKey() - Method in class aud.BinarySearchTree.Cursor

getKey() - Method in class aud.BinarySearchTree.Entry

get key

getKey() - Method in class aud.BinarySearchTree.Node

get key (short for getData().getKey())

getKey(int) - Method in class aud.KTreeNode

Get the k-th key.

getLabel() - Method in class aud.graph.AbstractEdge

get text description or null if there is none

getLabel() - Method in class aud.graph.AbstractNode

get text description

getLabel() - Method in class aud.graph.SimpleEdge

getLabel() - Method in class aud.graph.SimpleNode

getLeft() - Method in class aud.BinaryTree

get left child or null

getLoadFactor() - Method in class aud.example.hash.SimpleHashtable

get load factor

getLoadFactor() - Method in class aud.HashMap

get current load factor

getMaximum() - Method in class aud.BinarySearchTree

get maximum value (greater than null)

getMinColumnIndex() - Method in class aud.graph.matrix.SparseMatrixCS

get minimum row index [O(1)]

getMinimum() - Method in class aud.BinarySearchTree

get minimum entry (greater than null)

getMinRowIndex() - Method in class aud.graph.matrix.SparseMatrix

get minimum column index [O(1)]

getMinRowIndex() - Method in class aud.graph.matrix.SparseMatrixCS

get minimum row index [O(SparseMatrixCS.nnz())]

getName() - Method in class aud.example.expr.Symbol

get symbol's name

getNodeDecoration(GraphvizDecorable) - Method in class aud.BinarySearchTree.Decorator

getNodeDecoration(GraphvizDecorable) - Method in class aud.example.graph.MyDecorator

getNodeDecoration(GraphvizDecorable) - Method in class aud.RedBlackTree.RedBlackDecorator

getNodeDecoration(GraphvizDecorable) - Method in class aud.util.GraphvizDecorator

get node decoration

getNodeDecoration(GraphvizDecorable) - Method in class aud.util.SimpleDecorator

getNumColumns() - Method in class aud.graph.matrix.SparseMatrixCS

computed from maximum column index [O(1)]

getNumEntries() - Method in class aud.example.hash.SimpleHashtable

get number of entries

getNumNodes() - Method in class aud.graph.AbstractGraph

get number of nodes

getNumNodes() - Method in class aud.graph.GraphAM

getNumRows() - Method in class aud.graph.matrix.SparseMatrix

computed from maximum column index [O(1)]

getNumRows() - Method in class aud.graph.matrix.SparseMatrixCS

computes from maximium row index [O(SparseMatrixCS.nnz())]

getOrder() - Method in class aud.BTree

get order of tree (maximum number of children)

getOutDegree(Node) - Method in class aud.graph.AbstractGraph

get number of edges emanating from node

getOutEdges(Node) - Method in class aud.graph.AbstractGraph

Get incident edges of node.

getOutEdges(Node) - Method in class aud.graph.GraphAM

getParent() - Method in class aud.BinaryTree

get node's parent or null for root

getPosition() - Method in class aud.graph.AbstractNode

helper for drawing the graph: return {x,y} as array or null

getPosition() - Method in class aud.graph.SimpleNode

helper for drawing the graph: return {x,y} as array or null

getRGB(Double) - Method in class aud.util.ColormapJet

getRGB(Integer) - Method in class aud.util.ColormapCount

getRGB(T) - Method in class aud.util.Colormap

Map data to rgb color.

getRight() - Method in class aud.BinaryTree

get right child or null)

getRoot() - Method in class aud.BinaryTree

traverse upwards to find root node

getRowColumnIndices(int) - Method in class aud.graph.matrix.SparseMatrix

get column indices in row i as array

getRowEntries(int) - Method in class aud.graph.matrix.SparseMatrix

get entries in row i as array

getRowIndices() - Method in class aud.graph.matrix.SparseMatrixCS

Get array of row indices.

getSomeNode() - Method in class aud.graph.AbstractGraph

Get some node.

getSomeNode() - Method in class aud.graph.GraphAM

getString(T) - Method in class aud.util.Colormap

get string representation from Colormap.getRGB(T)

getTableSize() - Method in class aud.example.hash.SimpleHashtable

get size of hash table

getTransposed() - Method in class aud.graph.matrix.SparseMatrix

getTransposed() - Method in class aud.graph.matrix.SparseMatrixCS

get transposed matrix

getTree() - Method in class aud.example.A234TreeExample

getTree() - Method in class aud.example.AVLTreeExample

getTree() - Method in class aud.example.BTreeExample

getTree() - Method in class aud.example.RedBlackTreeExample

getType() - Method in class aud.example.expr.AtomicExpression

Get type identifier.

getType() - Method in class aud.example.expr.Divide

getType() - Method in class aud.example.expr.Minus

getType() - Method in class aud.example.expr.Number

getType() - Method in class aud.example.expr.Plus

getType() - Method in class aud.example.expr.Power

getType() - Method in class aud.example.expr.Symbol

getType() - Method in class aud.example.expr.Times

getType() - Method in class aud.example.expr.UnaryMinus

getValue() - Method in class aud.BinarySearchTree.Cursor

getValue() - Method in class aud.BinarySearchTree.Entry

get value

getValue() - Method in class aud.BinarySearchTree.Node

get value (short for getData().getValue())

getValue() - Method in class aud.example.expr.AtomicExpression

get value

getValue() - Method in class aud.example.expr.Divide

getValue() - Method in class aud.example.expr.ExpressionTree

compute value of expression

getValue() - Method in class aud.example.expr.Minus

getValue() - Method in class aud.example.expr.Number

getValue() - Method in class aud.example.expr.Plus

getValue() - Method in class aud.example.expr.Power

getValue() - Method in class aud.example.expr.Symbol

getValue() - Method in class aud.example.expr.Times

getValue() - Method in class aud.example.expr.UnaryMinus

getValues() - Method in class aud.graph.matrix.SparseMatrixCS

Get array of values in same order as for SparseMatrixCS.getRowIndices().

getWeight() - Method in class aud.graph.AbstractEdge

set edge weight

getWeight() - Method in class aud.graph.SimpleEdge

global_style - Variable in class aud.util.CommonGraphvizDecorator

graph() - Method in class aud.example.graph.TraversalExample

get graph (associated with traversal )

graph() - Method in class aud.graph.AbstractEdge

get graph

graph() - Method in class aud.graph.AbstractNode

get graph

graph(int) - Method in class aud.example.graph.GraphParser

parse list of nodes/edges

graph_label - Variable in class aud.util.CommonGraphvizDecorator

graph_style - Variable in class aud.util.CommonGraphvizDecorator

GraphAM<Node extends AbstractNode,Edge extends AbstractEdge> - Class in aud.graph

Graph implementation based on adjacency matrix.

GraphAM(Node, Edge, boolean) - Constructor for class aud.graph.GraphAM

Create graph.

GraphDemo - Class in aud.util

Demonstrate visualization of graph algorithms

GraphP88 - Class in aud.example.graph

undirected (weighted or unweighted )example graph (Sedgewick, Algorithms in Java.

GraphP88() - Constructor for class aud.example.graph.GraphP88

GraphP88(boolean) - Constructor for class aud.example.graph.GraphP88

GraphParser - Class in aud.example.graph

Parse text to build graph.

GraphParser(AbstractGraph<AbstractNode, AbstractEdge>) - Constructor for class aud.example.graph.GraphParser

create new parser for graph g

GraphTest - Class in aud.test

GraphTest() - Constructor for class aud.test.GraphTest

graphviz - Variable in class aud.util.DotViewer

Graphviz - Class in aud.util

Use GraphViz to render graph structures.

Graphviz() - Constructor for class aud.util.Graphviz

Graphvizable - Interface in aud.util

Interface for GraphViz rendering.

GraphvizDecorable - Interface in aud.util

Interface for decorating items of Graphvizable objects.

GraphvizDecorator - Class in aud.util

Decorator for items of Graphvizable objects.

GraphvizDecorator() - Constructor for class aud.util.GraphvizDecorator

GREEN - Static variable in class aud.util.Terminal

Grid - Class in aud.example.grid

Undirected graph that is defined implicitly by a regular 2d grid.

Grid() - Constructor for class aud.example.grid.Grid

construct an empty grid, use Grid.read_file(java.lang.String) or Grid.setup(java.lang.String[])

Grid(String) - Constructor for class aud.example.grid.Grid

construct grid by calling Grid.read_file(java.lang.String)

Grid.Cell - Class in aud.example.grid

Cell in a Grid.

H

h(MyNode) - Method in class aud.example.graph.AStarShortestPath

heuristic that guides search

halt() - Method in class aud.util.SingleStepper

wait for user

halt(String) - Method in class aud.util.SingleStepper

display text and wait for user (or global timeout)

halt(String, int) - Method in class aud.util.SingleStepper

display text and wait for user or timeout

hash(Integer) - Method in class aud.example.hash.HashtableExample.IdentityHash

hash(Integer) - Method in class aud.example.hash.HashtableExample.UniversalHash

hash(String) - Method in class aud.example.hash.HashtableExample.HashString

hash(T) - Method in class aud.example.hash.HashFunction

get hash value of data

HashFunction<T> - Class in aud.example.hash

interface for a hash function

HashFunction() - Constructor for class aud.example.hash.HashFunction

HashMap<Key,Value> - Class in aud

Implementation of an unordered map based on a hash table.

HashMap() - Constructor for class aud.HashMap

create empty map

HashMap(int) - Constructor for class aud.HashMap

create empty map

HashMap.Entries - Class in aud

provide HashMap iterator over key-value pairs (HashMap<Key,Value>.Entry)

HashMap.Entry - Class in aud

entry (key,value) in HashMap (iterator)

HashString() - Constructor for class aud.example.hash.HashtableExample.HashString

HashString(long) - Constructor for class aud.example.hash.HashtableExample.HashString

HashtableExample - Class in aud.example.hash

Simple framework for experiments with hash tables.

HashtableExample(String[]) - Constructor for class aud.example.hash.HashtableExample

constructor takes arguments of main

HashtableExample.DoubleHashing<T> - Class in aud.example.hash

Collision handling by double hashing using h2

HashtableExample.HashString - Class in aud.example.hash

Compute integer hash value from string.

HashtableExample.IdentityHash - Class in aud.example.hash

Identity hash function.

HashtableExample.LinearProbing<T> - Class in aud.example.hash

Collision handling by linear probing h(x,i)=h(x)+i*b

HashtableExample.QuadraticProbing<T> - Class in aud.example.hash

Collision handling by quadratic probing h(x,i)=h(x)+i*b+i*i*c

HashtableExample.UniversalHash - Class in aud.example.hash

Universal hash function parameterized as described in Goodrich and Tamassia. (Read the book chapter!)

hasNext() - Method in class aud.BinarySearchTree.Iterator

hasNext() - Method in class aud.BinarySearchTree.RangeIterator

hasNext() - Method in class aud.BinaryTreeTraversal.LevelorderIterator

hasNext() - Method in class aud.BinaryTreeTraversal.PostorderIterator

hasNext() - Method in class aud.BinaryTreeTraversal.RecursiveTraversalIterator

hasNext() - Method in class aud.DList.ForwardIterator

return true unless "advanced" over tail

hasNext() - Method in class aud.SList.Iterator

return true unless "advanced" over tail

hasNext() - Method in class aud.util.PermutationIterator

hasNext() - Method in class aud.Vector.Iterator

return true unless "advanced" over tail

hasWeight() - Method in class aud.graph.AbstractEdge

determine if edge weight is defined

head_ - Variable in class aud.BinarySearchTree

head_ - Variable in class aud.DList

head_ - Variable in class aud.SList

help() - Static method in class aud.util.DotViewer

print help (mouse/key bindings) to stdout

help() - Static method in class aud.util.SVGViewer

print help (mouse/key bindings) to stdout

HI_BLACK - Static variable in class aud.util.Terminal

HI_BLUE - Static variable in class aud.util.Terminal

HI_CYAN - Static variable in class aud.util.Terminal

HI_GREEN - Static variable in class aud.util.Terminal

HI_MAGENTA - Static variable in class aud.util.Terminal

HI_RED - Static variable in class aud.util.Terminal

HI_WHITE - Static variable in class aud.util.Terminal

HI_YELLOW - Static variable in class aud.util.Terminal

HIDE_CURSOR - Static variable in class aud.util.Terminal

hide cursor

hideCursor() - Method in class aud.util.Terminal

hide cursor

highlight(Key) - Method in class aud.BinarySearchTree.Decorator

HIGHLIGHT - Static variable in class aud.util.Terminal

highlightEdge(GraphvizDecorable) - Method in class aud.util.CommonGraphvizDecorator

Set highlighted edge.

highlightEdge(GraphvizDecorable) - Method in class aud.util.SimpleDecorator

highlightNode(GraphvizDecorable) - Method in class aud.util.CommonGraphvizDecorator

Set highlighted node.

highlightNode(GraphvizDecorable) - Method in class aud.util.SimpleDecorator

hilit_edge - Variable in class aud.util.SimpleDecorator

hilit_edge_style - Variable in class aud.util.CommonGraphvizDecorator

hilit_node - Variable in class aud.util.SimpleDecorator

hilit_node_style - Variable in class aud.util.CommonGraphvizDecorator

history - Variable in class aud.util.SingleStepper

HOME - Static variable in class aud.util.Terminal

reset cursor position to upper left corner

I

i - Variable in class aud.graph.matrix.Coordinate

row index

IDENTIFIER - Static variable in class aud.example.expr.Tokenizer

IDENTIFIER - Static variable in class aud.example.graph.Tokenizer

IdentityHash() - Constructor for class aud.example.hash.HashtableExample.IdentityHash

indent(int) - Static method in class aud.example.IterativePreorderTraversal

indent output on System.err

indent(int) - Static method in class aud.util.Sys

get indentation string filled with spaces

index() - Method in class aud.graph.AbstractNode

get index, i.e., unique integer id within AbstractNode.graph()

initialize() - Method in class aud.example.graph.Traversal

initialize graph for traversal (reset all attributes), provided for convenience to be called by Traversal.start(aud.example.graph.MyNode)

inorder() - Method in class aud.BinaryTree

Get inorder iterator over nodes in tree .

inorder(BinaryTree<T>) - Method in class aud.BinaryTreeTraversal

return instance of generator

inorder(BinaryTreeTraversal.MyTree) - Method in class aud.example.BinaryTreeTraversal

recursive inorder traversal

inorder(ExpressionTree) - Method in class aud.example.expr.ExpressionTreeTraversal

recursive inorder traversal

insert(int, T) - Method in class aud.DList

insert new entry obj at position i [O(n)]

insert(int, T) - Method in class aud.SList

insert new entry obj at position i [O(n)]

insert(int, T) - Method in class aud.Vector

Insert new entry obj at position i [O(n)].

insert(KTreeNode<Key>, Key) - Method in class aud.BTree

recursive find/insert (similar to KTreeNode.find(Key))

insert(Key) - Method in class aud.A234Tree

insert entry

insert(Key) - Method in class aud.BTree

insert entry

insert(Key, Value) - Method in class aud.BinarySearchTree

Insert new key-value pair (new node).

insert(Key, Value) - Method in class aud.HashMap

insert key-value pair

insert_after(DList.ForwardIterator, T) - Method in class aud.DList

insert entry after iterator position

insert_after(SList.Iterator, T) - Method in class aud.SList

insert entry after iterator position

insert_before(DList.ForwardIterator, T) - Method in class aud.DList

insert entry before iterator position

insert_bottom_up(KTreeNode<Key>, Key) - Method in class aud.A234Tree

insert_top_down(KTreeNode<Key>, Key) - Method in class aud.A234Tree

instance - Static variable in class aud.util.Terminal

singleton instance

invert_color - Variable in class aud.util.Terminal

invert colors

invert_foreground_background - Variable in class aud.util.Terminal

swap foreground and background

is_empty() - Method in class aud.adt.AbstractPriorityQueue

Is PQ empty?

is_empty() - Method in class aud.adt.AbstractQueue

Is queue empty?

is_empty() - Method in class aud.adt.AbstractStack

Is stack empty?

is_empty() - Method in class aud.HashMap

is map empty?

is_empty() - Method in class aud.PriorityQueue

is_empty() - Method in class aud.Queue

is_empty() - Method in class aud.QueueDL

is_empty() - Method in class aud.Stack

is_free() - Method in class aud.example.grid.Grid.Cell

Can we enter this cell?

is_tunnel() - Method in class aud.example.grid.Grid.Cell

letters a-z denote entries to tunnels: e.g., all 'a' are connected

isBalanced() - Method in class aud.AVLTree.AVLNode

|getBalance()|<=1 ?

isDirected() - Method in class aud.graph.AbstractGraph

Is graph directed?

isDirected() - Method in class aud.graph.GraphAM

isEmpty() - Method in class aud.BinarySearchTree

Is tree empty?

isLeaf() - Method in class aud.BinaryTree

Is this a leaf?

isOperator() - Method in class aud.example.expr.AtomicExpression

node represents operator

isRed() - Method in class aud.RedBlackTree.RBNode

Is node red?

isRoot() - Method in class aud.BinaryTree

Is @{code this} root?

isSymmetricMatrix() - Method in class aud.graph.matrix.SparseMatrix

Was matrix created explicitly as symmetric matrix?

isTerminal() - Method in class aud.example.expr.AtomicExpression

node represents number or symbol

iterative_traversal(BinaryTree<String>) - Static method in class aud.example.IterativePreorderTraversal

iterative algorithm

IterativeDFS1 - Class in aud.example.graph

Iterative implementation of DFS.

IterativeDFS1(MyGraph) - Constructor for class aud.example.graph.IterativeDFS1

IterativeDFS2 - Class in aud.example.graph

iterative implementation of DFS Traversal like DepthFirstSearch but as for IterativeDFS1 the order of processed edges differs and nodes are marked before being pushed.

IterativeDFS2(MyGraph) - Constructor for class aud.example.graph.IterativeDFS2

IterativePreorderTraversal - Class in aud.example

example: transform recursive preoder traversal to iterative algorithm

IterativePreorderTraversal() - Constructor for class aud.example.IterativePreorderTraversal

iterator() - Method in class aud.BinarySearchTree

get iterator for inorder traversal

iterator() - Method in class aud.BinarySearchTree.Range

iterator() - Method in class aud.BinaryTreeTraversal.Inorder

iterator() - Method in class aud.BinaryTreeTraversal.Levelorder

iterator() - Method in class aud.BinaryTreeTraversal.Postorder

iterator() - Method in class aud.BinaryTreeTraversal.Preorder

iterator() - Method in class aud.DList.Backwards

get backward iterator for list_

iterator() - Method in class aud.DList

get forward iterator

iterator() - Method in class aud.graph.AbstractGraph.Edges

iterator() - Method in class aud.graph.AdjacencyMatrix

Get iterator over all edges.

iterator() - Method in class aud.graph.GraphAM

iterator() - Method in class aud.HashMap.Entries

iterator() - Method in class aud.SList

get forward iterator

iterator() - Method in class aud.util.Permutations

iterator() - Method in class aud.Vector

get forward iterator

J

j - Variable in class aud.graph.matrix.Coordinate

column index

K

key - Variable in class aud.HashMap.Entry

KTreeNode<Key extends Comparable<Key>> - Class in aud

Node in a k-ary search tree.

KTreeNode() - Constructor for class aud.KTreeNode

Create new 1-node without key or children.

KTreeNode(Key) - Constructor for class aud.KTreeNode

create new 2-node with key and no children

KTreeNode.Entry - Class in aud

Entry in a KTreeNode with reference to key and left child.

L

label - Variable in class aud.util.DotViewer

label - Variable in class aud.util.SVGViewer

LEFT_BRACE - Static variable in class aud.example.graph.Tokenizer

LEFT_PAREN - Static variable in class aud.example.expr.Tokenizer

LEFT_PAREN - Static variable in class aud.example.graph.Tokenizer

less(T, T) - Method in class aud.adt.AbstractPriorityQueue

test for a<b, uses Comparator if one was provided or Comparable else.

level_order_traversal(BinaryTree<String>) - Static method in class aud.example.IterativePreorderTraversal

implement level-order traversal

levelorder() - Method in class aud.BinaryTree

Get level-order iterator over nodes in tree .

levelorder(BinaryTree<T>) - Method in class aud.BinaryTreeTraversal

return instance of generator

levelorder(BinaryTreeTraversal.MyTree) - Method in class aud.example.BinaryTreeTraversal

level order traversdal

levelorder(ExpressionTree) - Method in class aud.example.expr.ExpressionTreeTraversal

level order traversdal

LexicalScanner - Class in aud.util

Base class for a simple lexical scanner.

LexicalScanner(LexicalScanner.Rule[], String) - Constructor for class aud.util.LexicalScanner

create new scanner processing input

LexicalScanner.Rule - Class in aud.util

a rule for lexical scanner

LinearProbing() - Constructor for class aud.example.hash.HashtableExample.LinearProbing

LinearProbing(int) - Constructor for class aud.example.hash.HashtableExample.LinearProbing

list - Variable in class aud.util.SingleStepperDemo

lookahead() - Method in class aud.example.expr.ExpressionParser

helper: "lookahead" is the usual phrasing

lookahead() - Method in class aud.example.graph.GraphParser

helper: "lookahead" is the usual phrasing

lower(T) - Method in class aud.PriorityQueue

update heap after lowering priority of x

M

MAGENTA - Static variable in class aud.util.Terminal

main(String[]) - Static method in class aud.A234Tree

example and test

main(String[]) - Static method in class aud.AVLTree

example and test

main(String[]) - Static method in class aud.BinarySearchTree

test and example

main(String[]) - Static method in class aud.BinaryTree

main(String[]) - Static method in class aud.BTree

example and test

main(String[]) - Static method in class aud.example.A234TreeExample

start interactive example

main(String[]) - Static method in class aud.example.AVLTreeExample

start interactive example

main(String[]) - Static method in class aud.example.BinarySearchTreeExample

Start interactive example.

main(String[]) - Static method in class aud.example.BinaryTreeTraversal

main(String[]) - Static method in class aud.example.BTreeExample

start interactive example

main(String[]) - Static method in class aud.example.expr.ExpressionParser

test and example for usage

main(String[]) - Static method in class aud.example.expr.ExpressionParser2

test and example for usage

main(String[]) - Static method in class aud.example.expr.ExpressionTree

test and example for usage

main(String[]) - Static method in class aud.example.expr.ExpressionTreeExample

main(String[]) - Static method in class aud.example.expr.ExpressionTreeTraversal

main(String[]) - Static method in class aud.example.expr.Tokenizer

testing and example for usage

main(String[]) - Static method in class aud.example.graph.GraphP88

main(String[]) - Static method in class aud.example.graph.GraphParser

test and example for usage

main(String[]) - Static method in class aud.example.graph.MaxFlowExample

example (see also MaxFlowExample.usage())

main(String[]) - Static method in class aud.example.graph.RetroMaze

main(String[]) - Static method in class aud.example.graph.TraversalExample

example (see also TraversalExample.usage())

main(String[]) - Static method in class aud.example.grid.Grid

main(String[]) - Static method in class aud.example.hash.HashtableExample

start the program

main(String[]) - Static method in class aud.example.hash.SimpleHashtable

main(String[]) - Static method in class aud.example.IterativePreorderTraversal

main(String[]) - Static method in class aud.example.RedBlackTreeExample

start interactive example

main(String[]) - Static method in class aud.example.RenderTree

main(String[]) - Static method in class aud.graph.matrix.SparseMatrix

Example and test: show ColormapCount color map

main(String[]) - Static method in class aud.HashMap

main(String[]) - Static method in class aud.KTreeNode

main(String[]) - Static method in class aud.PriorityQueue

example and test

main(String[]) - Static method in class aud.RedBlackTree

exmaple and test

main(String[]) - Static method in class aud.test.A234TreeTest

main(String[]) - Static method in class aud.test.AdjacencyMatrixTest

main(String[]) - Static method in class aud.test.AVLTreeTest

main(String[]) - Static method in class aud.test.BinarySearchTreeTest

main(String[]) - Static method in class aud.test.BinaryTreeTest

main(String[]) - Static method in class aud.test.BTreeTest

main(String[]) - Static method in class aud.test.DListTest

main(String[]) - Static method in class aud.test.GraphTest

main(String[]) - Static method in class aud.test.QueueTest

main(String[]) - Static method in class aud.test.RedBlackTreeTest

main(String[]) - Static method in class aud.test.SListTest

main(String[]) - Static method in class aud.test.SparseMatrixCSTest

main(String[]) - Static method in class aud.test.SparseMatrixTest

main(String[]) - Static method in class aud.test.StackTest

main(String[]) - Static method in class aud.test.VectorTest

main(String[]) - Static method in class aud.util.ColormapJet

main(String[]) - Static method in class aud.util.DotViewer

visualize given dot files (file names as command line arguments)

main(String[]) - Static method in class aud.util.GraphDemo

main(String[]) - Static method in class aud.util.LexicalScanner

testing and example for usage

main(String[]) - Static method in class aud.util.PermutationIterator

demonstration and test

main(String[]) - Static method in class aud.util.Permutations

demonstration and test

main(String[]) - Static method in class aud.util.SingleStepper

main(String[]) - Static method in class aud.util.SingleStepperDemo

main(String[]) - Static method in class aud.util.SVGViewer

visualize given dot files (file names as command line arguments)

mark(Key) - Method in class aud.BinarySearchTree.Decorator

marked_edge_style - Variable in class aud.util.CommonGraphvizDecorator

marked_edges - Variable in class aud.util.SimpleDecorator

marked_node_style - Variable in class aud.util.CommonGraphvizDecorator

marked_nodes - Variable in class aud.util.SimpleDecorator

markEdge(GraphvizDecorable) - Method in class aud.util.CommonGraphvizDecorator

markEdge(GraphvizDecorable) - Method in class aud.util.SimpleDecorator

markNode(GraphvizDecorable) - Method in class aud.util.CommonGraphvizDecorator

markNode(GraphvizDecorable) - Method in class aud.util.SimpleDecorator

mat_ - Variable in class aud.graph.matrix.SparseMatrixCS

match(Pattern) - Method in class aud.util.LexicalScanner

Match LexicalScanner.remainder() against pattern p.

matchedText() - Method in class aud.example.expr.ExpressionParser

helper: get match corresponding to ExpressionParser.lookahead()

matchedText() - Method in class aud.util.LexicalScanner

get text of last LexicalScanner.match(java.util.regex.Pattern) or call to LexicalScanner.next(aud.util.LexicalScanner.Rule[])

matchedTokenId() - Method in class aud.util.LexicalScanner

get result of last call to LexicalScanner.next()

MaxFlowExample - Class in aud.example.graph

Example for computing the maximum flow using a Ford-Fulkerson type algorithm.

MaxFlowExample() - Constructor for class aud.example.graph.MaxFlowExample

create application

maxValue - Variable in class aud.util.ColormapJet

Minus - Class in aud.example.expr

binary - operator: A-B

Minus() - Constructor for class aud.example.expr.Minus

create operation

MINUS - Static variable in class aud.example.expr.Tokenizer

minValue - Variable in class aud.util.ColormapJet

monitor - Variable in class aud.util.SingleStepper

MyDecorator - Class in aud.example.graph

MyDecorator(MyGraph) - Constructor for class aud.example.graph.MyDecorator

MyEdge - Class in aud.example.graph

edge with all possible attributes that we require ;-)

MyEdge() - Constructor for class aud.example.graph.MyEdge

MyGraph - Class in aud.example.graph

graph based on GraphAM

MyGraph(boolean) - Constructor for class aud.example.graph.MyGraph

create empty graph

MyGraph(boolean, File) - Constructor for class aud.example.graph.MyGraph

read graph from file using GraphParser

MyNode - Class in aud.example.graph

node with all possible attributes that we require ;-)

MyNode() - Constructor for class aud.example.graph.MyNode

N

name() - Method in class aud.example.graph.AStarShortestPath

name() - Method in class aud.example.graph.BreadthFirstSearch

name() - Method in class aud.example.graph.DepthFirstSearch

name() - Method in class aud.example.graph.DijkstraShortestPaths

name() - Method in class aud.example.graph.IterativeDFS1

name() - Method in class aud.example.graph.IterativeDFS2

name() - Method in class aud.example.graph.PrimMinimumSpanningTree

name() - Method in class aud.example.graph.Traversal

get traversal name

neighbors(int) - Method in class aud.example.grid.Grid

get neighbors of cell index (4-neighborhood)

neighbors_from_tunnels(int) - Method in class aud.example.grid.Grid

get neighbors of index from tunnels

newHash(SimpleHashtable<T>, T, long, int) - Method in class aud.example.hash.CollisionHandler

Handle collision by computing a new hash value.

newHash(SimpleHashtable<T>, T, long, int) - Method in class aud.example.hash.HashtableExample.DoubleHashing

newHash(SimpleHashtable<T>, T, long, int) - Method in class aud.example.hash.HashtableExample.LinearProbing

newHash(SimpleHashtable<T>, T, long, int) - Method in class aud.example.hash.HashtableExample.QuadraticProbing

next - Variable in class aud.util.SingleStepper

next() - Method in class aud.BinarySearchTree.Iterator

next() - Method in class aud.BinarySearchTree.RangeIterator

next() - Method in class aud.BinaryTreeTraversal.InorderIterator

next() - Method in class aud.BinaryTreeTraversal.LevelorderIterator

next() - Method in class aud.BinaryTreeTraversal.PostorderIterator

next() - Method in class aud.BinaryTreeTraversal.PreorderIterator

next() - Method in class aud.DList.BackwardIterator

next() - Method in class aud.DList.ForwardIterator

return current entry and advance forward

next() - Method in class aud.SList.Iterator

return current entry and advance

next() - Method in class aud.util.LexicalScanner

match LexicalScanner.remainder() to rules provided to constructor

next() - Method in class aud.util.PermutationIterator

next() - Method in class aud.Vector.Iterator

return current entry and advance

next(LexicalScanner.Rule[]) - Method in class aud.util.LexicalScanner

match LexicalScanner.remainder() to table of rules

nextTimeStep() - Method in class aud.example.hash.SimpleHashtable

advance one time step in history, e.g., after every insert

nextToken() - Method in class aud.example.expr.ExpressionParser

helper: consume current token and advance to next token

nextToken() - Method in class aud.example.graph.GraphParser

helper: consume current token and advance to next token

nnz() - Method in class aud.graph.matrix.SparseMatrixCS

get number of nonzero entries

NO_MATCH - Static variable in class aud.util.LexicalScanner

no match (usually implies a syntax error)

node - Variable in class aud.BinarySearchTree.LowerBound

the node found or null for failed search

node(int) - Method in class aud.example.graph.GraphParser

parse node

Node(T, DList.Node, DList.Node) - Constructor for class aud.DList.Node

Node(T, SList.Node) - Constructor for class aud.SList.Node

node_ - Variable in class aud.example.expr.AtomicExpression

uplink reference to node: node_.getData()==this

NORMAL - Static variable in class aud.util.Terminal

set bold text

nsteps - Variable in class aud.example.graph.Traversal

halt every nsteps steps in time_

num_columns() - Method in class aud.example.grid.Grid

get number of columns

num_rows() - Method in class aud.example.grid.Grid

get number of rows

Number - Class in aud.example.expr

Node representing constant number.

Number(double) - Constructor for class aud.example.expr.Number

create number

NUMBER - Static variable in class aud.example.expr.Tokenizer

NUMBER - Static variable in class aud.example.graph.Tokenizer

O

onHalt() - Method in class aud.example.A234TreeExample

onHalt() - Method in class aud.example.AVLTreeExample

onHalt() - Method in class aud.example.BinarySearchTreeExample

onHalt() - Method in class aud.example.BinaryTreeTraversal

onHalt() - Method in class aud.example.BTreeExample

onHalt() - Method in class aud.example.expr.ExpressionTreeTraversal

onHalt() - Method in class aud.example.graph.MaxFlowExample

onHalt() - Method in class aud.example.graph.TraversalExample

onHalt() - Method in class aud.example.RedBlackTreeExample

onHalt() - Method in class aud.util.GraphDemo

onHalt() - Method in class aud.util.SingleStepper

onHalt() - Method in class aud.util.SingleStepperDemo

onInsert(BinarySearchTree.Node) - Method in class aud.AVLTree

onInsert(BinarySearchTree.Node) - Method in class aud.BinarySearchTree

Called whenever a new node is inserted.

onInsert(BinarySearchTree.Node) - Method in class aud.RedBlackTree

onNext() - Method in class aud.util.SingleStepper

call on button pressed

onRecoloring() - Method in class aud.RedBlackTree

callback after one step of recoloring in RedBlackTree.remedyDoubleRed(aud.RedBlackTree.RBNode)

onRemove() - Method in class aud.BinarySearchTree

Called whenever a node is removed.

onRestructuring() - Method in class aud.RedBlackTree

callback after restructuring in RedBlackTree.remedyDoubleRed(aud.RedBlackTree.RBNode)

onSplit(KTreeNode<Key>) - Method in class aud.A234Tree

callback invoked by A234Tree.split_bottom_up(aud.KTreeNode<Key>,int) or A234Tree.split_top_down(aud.KTreeNode<Key>), default implementation is empty

onSplit(KTreeNode<Key>) - Method in class aud.BTree

callback invoked by BTree.split(aud.KTreeNode<Key>), default implementation is empty

OpDivide - Enum constant in enum class aud.example.expr.AtomicExpression.Type

openCallersSourceInEmacs(int) - Static method in class aud.util.Sys

open emacs Sys.whereAmI(int) (Un*x only)

Operator - Class in aud.example.expr

Node representing operator in an expression tree.

Operator() - Constructor for class aud.example.expr.Operator

OpMinus - Enum constant in enum class aud.example.expr.AtomicExpression.Type

OpPlus - Enum constant in enum class aud.example.expr.AtomicExpression.Type

OpPower - Enum constant in enum class aud.example.expr.AtomicExpression.Type

OpTimes - Enum constant in enum class aud.example.expr.AtomicExpression.Type

OpUnaryMinus - Enum constant in enum class aud.example.expr.AtomicExpression.Type

ord - Variable in class aud.example.graph.MyNode

time when node is (first marked/put into front)

out - Variable in class aud.util.Terminal

output stream, user is responsible for flush

output(BinaryTreeTraversal.MyTree) - Method in class aud.example.BinaryTreeTraversal

output node during traversal

output(ExpressionTree) - Method in class aud.example.expr.ExpressionTreeTraversal

output node during traversal

P

p - Variable in class aud.example.graph.MyNode

node from which node was reached (defines spanning tree)

p - Variable in class aud.example.grid.Grid.Cell

index of parent cell

P_AT - Static variable in class aud.example.graph.Tokenizer

P_COMMA - Static variable in class aud.example.graph.Tokenizer

P_DEDGE - Static variable in class aud.example.graph.Tokenizer

P_DIVIDE - Static variable in class aud.example.expr.Tokenizer

P_EDGE - Static variable in class aud.example.graph.Tokenizer

P_FLOAT - Static variable in class aud.util.LexicalScanner

floating point number

P_IDENTIFIER - Static variable in class aud.util.LexicalScanner

identifiers

P_LEFTBRACE - Static variable in class aud.example.graph.Tokenizer

P_LEFTPAREN - Static variable in class aud.example.expr.Tokenizer

P_LEFTPAREN - Static variable in class aud.example.graph.Tokenizer

P_MINUS - Static variable in class aud.example.expr.Tokenizer

P_PLUS - Static variable in class aud.example.expr.Tokenizer

P_POWER - Static variable in class aud.example.expr.Tokenizer

P_RIGHTBRACE - Static variable in class aud.example.graph.Tokenizer

P_RIGHTPAREN - Static variable in class aud.example.expr.Tokenizer

P_RIGHTPAREN - Static variable in class aud.example.graph.Tokenizer

P_TIMES - Static variable in class aud.example.expr.Tokenizer

P_WHITESPACE - Static variable in class aud.util.LexicalScanner

white space

parent - Variable in class aud.BinarySearchTree.LowerBound

node's parent (always !=null)

parent() - Method in class aud.util.DotViewer

get parent widget

parent() - Method in class aud.util.SingleStepper

get parent widget

parent() - Method in class aud.util.SVGViewer

get parent widget

parse(File) - Method in class aud.example.graph.GraphParser

GraphParser.parse(String) contents of file

parse(String) - Method in class aud.example.expr.ExpressionParser

parse input

parse(String) - Method in class aud.example.graph.GraphParser

parse input

penwidth - Variable in class aud.example.graph.MyEdge

width for visualization (ignored if <0)

PermutationIterator - Class in aud.util

Iterator over all permutations of length n.

PermutationIterator(int) - Constructor for class aud.util.PermutationIterator

create new iterator

Permutations - Class in aud.util

Generate permutations.

Permutations(int) - Constructor for class aud.util.Permutations

Plus - Class in aud.example.expr

binary + operator: A+B

Plus() - Constructor for class aud.example.expr.Plus

create operation

PLUS - Static variable in class aud.example.expr.Tokenizer

pop() - Method in class aud.adt.AbstractPriorityQueue

Pop minimal element from PQ.

pop() - Method in class aud.adt.AbstractStack

Pop element from stack.

pop() - Method in class aud.example.VerboseStack

pop() - Method in class aud.PriorityQueue

pop() - Method in class aud.Stack

pop_back() - Method in class aud.DList

erase last entry (must exist) [O(1)]

pop_back() - Method in class aud.SList

erase last entry (must exist) [O(n)]

pop_back() - Method in class aud.Vector

remove last enytry [O(1)]

pop_front() - Method in class aud.DList

erase first entry (must exist) [O(1)]

pop_front() - Method in class aud.SList

erase first entry (must exist) [O(1)]

pos(int) - Method in class aud.example.graph.GraphParser

parse position

postorder() - Method in class aud.BinaryTree

Get postorder iterator over nodes in tree .

postorder(BinaryTree<T>) - Method in class aud.BinaryTreeTraversal

return instance of generator

postorder(BinaryTreeTraversal.MyTree) - Method in class aud.example.BinaryTreeTraversal

recursive postorder traversal

postorder(ExpressionTree) - Method in class aud.example.expr.ExpressionTreeTraversal

recursive postorder traversal

Power - Class in aud.example.expr

binary power operator: A^B (also A**B)

Power() - Constructor for class aud.example.expr.Power

create operation

POWER - Static variable in class aud.example.expr.Tokenizer

preorder() - Method in class aud.BinaryTree

Get preorder iterator over nodes in tree .

preorder(BinaryTree<T>) - Method in class aud.BinaryTreeTraversal

return instance of generator

preorder(BinaryTreeTraversal.MyTree) - Method in class aud.example.BinaryTreeTraversal

recursive preorder traversal

preorder(ExpressionTree) - Method in class aud.example.expr.ExpressionTreeTraversal

recursive preorder traversal

previous() - Method in class aud.DList.BackwardIterator

previous() - Method in class aud.DList.ForwardIterator

return current entry and step backwards

PrimMinimumSpanningTree - Class in aud.example.graph

implements Prim's algorithm by defining PrimMinimumSpanningTree.priority(aud.example.graph.MyNode, aud.example.graph.MyEdge)

PrimMinimumSpanningTree(MyGraph) - Constructor for class aud.example.graph.PrimMinimumSpanningTree

println(String) - Method in class aud.util.SingleStepper

print to both, text area and stdout

priority(MyNode, MyEdge) - Method in class aud.example.graph.DijkstraShortestPaths

priority(MyNode, MyEdge) - Method in class aud.example.graph.PrimMinimumSpanningTree

priority(MyNode, MyEdge) - Method in class aud.example.graph.PriorityFirstSearch

Compute priority of a node: node.d+e.getWeight() for Dijkstra's algorithm to find shortest paths (and the shortest path tree) e.getWeight() for Prim's algorithm to find the minimum spanning tree

PriorityFirstSearch - Class in aud.example.graph

Priority first search implementation.

PriorityFirstSearch(MyGraph) - Constructor for class aud.example.graph.PriorityFirstSearch

PriorityQueue<T> - Class in aud

Priority queue based on binary min-heap.

PriorityQueue() - Constructor for class aud.PriorityQueue

PriorityQueue(int) - Constructor for class aud.PriorityQueue

PriorityQueue(int, Comparator<T>) - Constructor for class aud.PriorityQueue

Create empty priority queue

PriorityQueue(Comparator<T>) - Constructor for class aud.PriorityQueue

product(int) - Method in class aud.example.expr.ExpressionParser

parse product

product(int) - Method in class aud.example.expr.ExpressionParser2

parse product

push(T) - Method in class aud.adt.AbstractPriorityQueue

Push x into PQ.

push(T) - Method in class aud.adt.AbstractStack

Push x onto stack.

push(T) - Method in class aud.example.VerboseStack

push(T) - Method in class aud.PriorityQueue

Add entry to PQ.

push(T) - Method in class aud.Stack

push_back(T) - Method in class aud.DList

append entry obj at end of list [O(1)]

push_back(T) - Method in class aud.SList

append entry obj at end of list [O(n)]

push_back(T) - Method in class aud.Vector

insert new entry obj at the end [O(1) for sufficient Vector.capacity()]

push_front(T) - Method in class aud.DList

insert entry at front of list [O(1)]

push_front(T) - Method in class aud.SList

insert entry at front of list [O(1)]

Q

QuadraticProbing() - Constructor for class aud.example.hash.HashtableExample.QuadraticProbing

QuadraticProbing(int, int) - Constructor for class aud.example.hash.HashtableExample.QuadraticProbing

Queue<T> - Class in aud

Implementation of AbstractQueue as a (dynamically resized) circular buffer based on array.

Queue() - Constructor for class aud.Queue

create empty queue

Queue(int) - Constructor for class aud.Queue

create empty queue and reserve storage

QueueDL<T> - Class in aud

Impementation of AbstractQueue based on doubly linked list DList.

QueueDL() - Constructor for class aud.QueueDL

QueueTest - Class in aud.test

QueueTest() - Constructor for class aud.test.QueueTest

R

raise(T) - Method in class aud.PriorityQueue

update heap after raising priority of x

range(Key, Key) - Method in class aud.BinarySearchTree

Get iterable range [begin,end[.

read_file(String) - Method in class aud.example.grid.Grid

read file and treat contents as cells, calls Grid.setup(java.lang.String[])

readFile(File) - Static method in class aud.util.Sys

read entire file and return contents as String

rebalance(AVLTree.AVLNode, AVLTree.AVLNode, AVLTree.AVLNode) - Method in class aud.AVLTree

recursive_traversal(BinaryTree<String>, int) - Static method in class aud.example.IterativePreorderTraversal

recursive algorithm

RED - Static variable in class aud.util.Terminal

RedBlackDecorator() - Constructor for class aud.RedBlackTree.RedBlackDecorator

RedBlackTree<Key extends Comparable<Key>,Value> - Class in aud

Simple implementation of a red-black tree.

RedBlackTree() - Constructor for class aud.RedBlackTree

create empty tree

RedBlackTree.RBNode - Class in aud

node in a RedBlackTree

RedBlackTree.RedBlackDecorator - Class in aud

RedBlackTreeExample - Class in aud.example

example: insert entries and maintain balance

RedBlackTreeExample() - Constructor for class aud.example.RedBlackTreeExample

create application instance

RedBlackTreeTest - Class in aud.test

RedBlackTreeTest() - Constructor for class aud.test.RedBlackTreeTest

remainder() - Method in class aud.util.LexicalScanner

get remaining text

remedyDoubleRed(RedBlackTree.RBNode) - Method in class aud.RedBlackTree

remove() - Method in class aud.BinarySearchTree.Iterator

not implemented

remove() - Method in class aud.BinarySearchTree.RangeIterator

not implemented

remove() - Method in class aud.BinaryTreeTraversal.LevelorderIterator

remove() - Method in class aud.BinaryTreeTraversal.RecursiveTraversalIterator

remove() - Method in class aud.DList.ForwardIterator

not implemented

remove() - Method in class aud.SList.Iterator

not implemented

remove() - Method in class aud.util.PermutationIterator

remove() - Method in class aud.Vector.Iterator

not implemented

remove(Key) - Method in class aud.AVLTree

not implemented!

remove(Key) - Method in class aud.BinarySearchTree

Remove node with key.

remove(Key) - Method in class aud.HashMap

remove entry (equivalent to insert(key,null))

remove(Key) - Method in class aud.RedBlackTree

not implemented!

removeEdge(Edge) - Method in class aud.graph.AbstractGraph

Remove edge.

removeEdge(Edge) - Method in class aud.graph.GraphAM

removeNode(BinarySearchTree.Node) - Method in class aud.BinarySearchTree

Remove node from tree.

removeNode(Node) - Method in class aud.graph.AbstractGraph

Remove node and all its incident and excident edges.

removeNode(Node) - Method in class aud.graph.GraphAM

renderDotFileToFile(File, String) - Method in class aud.util.Graphviz

Render dot file.

renderSpySVG(File, Colormap<T>) - Method in class aud.graph.matrix.SparseMatrixCS

RenderTree - Class in aud.example

Utility for rendering various trees.

RenderTree() - Constructor for class aud.example.RenderTree

reserve(int) - Method in class aud.HashMap

Reserve buckets for expected size.

reserve(int) - Method in class aud.Vector

Ensure Vector.capacity() for n entries.

reset() - Method in class aud.util.Terminal

reset to black on white, normal font

reset_cells() - Method in class aud.example.grid.Grid

reset all cells to default state but keep their values

resize(int) - Method in class aud.Vector

Set Vector.size() of vector.

restructure(char, Key) - Method in class aud.BinarySearchTree

Interactive restructuring for testing.

restructure(BinarySearchTree.Node) - Method in class aud.BinarySearchTree

Restructure subtree following Goodrich and Tamassia (2nd ed, p.

RetroMaze - Class in aud.example.graph

a really simple game, which lets you explore a maze...

RetroMaze(MyGraph, MyNode, MyNode) - Constructor for class aud.example.graph.RetroMaze

reverse_iterator() - Method in class aud.DList

get backward iterator iterator

RIGHT_BRACE - Static variable in class aud.example.graph.Tokenizer

RIGHT_PAREN - Static variable in class aud.example.expr.Tokenizer

RIGHT_PAREN - Static variable in class aud.example.graph.Tokenizer

rmat_ - Variable in class aud.graph.matrix.SparseMatrix

Store transposed.

root() - Method in class aud.BTree

get root node (required for assignment)

rotateLeft(BinarySearchTree.Node) - Method in class aud.BinarySearchTree

Apply single left rotation (right-right case).

rotateLeftRight(BinarySearchTree.Node) - Method in class aud.BinarySearchTree

Apply double rotation (left-right case).

rotateRight(BinarySearchTree.Node) - Method in class aud.BinarySearchTree

Apply single right rotation (left-left case).

rotateRightLeft(BinarySearchTree.Node) - Method in class aud.BinarySearchTree

Apply double rotation (right-left case).

rowDegree(int) - Method in class aud.graph.matrix.SparseMatrix

get number of nonzero entries in row i

Rule(int, String) - Constructor for class aud.util.LexicalScanner.Rule

create rule (pattern is compiled)

Rule(int, Pattern) - Constructor for class aud.util.LexicalScanner.Rule

create rule

RULES - Static variable in class aud.example.expr.Tokenizer

RULES - Static variable in class aud.example.graph.Tokenizer

RunTests - Class in aud.test

RunTests() - Constructor for class aud.test.RunTests

S

see(BinaryTreeTraversal.MyTree) - Method in class aud.example.BinaryTreeTraversal

arrived node for first time (for visualization)

see(ExpressionTree) - Method in class aud.example.expr.ExpressionTreeTraversal

arrived node for first time (for visualization)

set(int, int, T) - Method in class aud.graph.matrix.SparseMatrix

set(int, int, T) - Method in class aud.graph.matrix.SparseMatrixCS

Set entry (i,j) to data [O(log(nnz))].

set(T, int) - Method in class aud.Vector

set i-th entry [O(1)]

setData(AtomicExpression) - Method in class aud.example.expr.ExpressionTree

Set AtomicExpression for this node.

setData(T) - Method in class aud.BinaryTree

set node data

setExitOnClose() - Method in class aud.util.DotViewer

exit application if viewer is closed

setExitOnClose() - Method in class aud.util.SVGViewer

exit application if viewer is closed

setGraphLabel(String) - Method in class aud.util.CommonGraphvizDecorator

set label

setInput(String) - Method in class aud.util.LexicalScanner

set input (resets scanner state)

setLabel(String) - Method in class aud.graph.AbstractNode

set label (if supported)

setLabel(String) - Method in class aud.graph.SimpleEdge

set label (default label if label==null)

setLabel(String) - Method in class aud.graph.SimpleNode

set label (default label if label==null)

setLeft(BinaryTree<T>) - Method in class aud.BinaryTree

set left subtree

setPosition(double, double) - Method in class aud.graph.AbstractNode

helper for drawing the graph (if supported)

setPosition(double, double) - Method in class aud.graph.SimpleNode

setRight(BinaryTree<T>) - Method in class aud.BinaryTree

set right subtree

setTimeout(int) - Method in class aud.util.SingleStepper

Set global timeout.

setup(String) - Method in class aud.example.grid.Grid

setup from multi-line string, e.g., Grid.EXAMPLE

setup(String[]) - Method in class aud.example.grid.Grid

setup grid from string: create contents as grid cells

setupBalancedSubtree(BinarySearchTree.Node, BinarySearchTree.Node, BinarySearchTree.Node, BinarySearchTree.Node, BinarySearchTree.Node, BinarySearchTree.Node, BinarySearchTree.Node, BinarySearchTree.Node) - Method in class aud.BinarySearchTree

Setup balanced subtree.

setValue(Value) - Method in class aud.BinarySearchTree.Cursor

set value

setValue(Value) - Method in class aud.BinarySearchTree.Entry

set value

setValue(Value) - Method in class aud.BinarySearchTree.Node

set value (short for getData().setValue(value))

setVerbose(boolean) - Method in class aud.example.expr.ExpressionParser

set verbose mode (report state to System.err)

setVerbose(boolean) - Method in class aud.example.graph.GraphParser

set verbose mode (report state to System.err)

setWeight(double) - Method in class aud.graph.AbstractEdge

set weight

setWeight(double) - Method in class aud.graph.SimpleEdge

SHOW_CURSOR - Static variable in class aud.util.Terminal

show cursor

showCursor() - Method in class aud.util.Terminal

show cursor

showHistory() - Method in class aud.example.hash.SimpleHashtable

show history

showMark(MyNode) - Method in class aud.example.graph.Traversal

callback to give visual feedback on marking a node

showSource() - Method in class aud.util.SingleStepper

jmp to caller's location in editor (emacs only)

SimpleDecorator - Class in aud.util

Example for a simple decorator.

SimpleDecorator() - Constructor for class aud.util.SimpleDecorator

SimpleEdge - Class in aud.graph

plain simple edge

SimpleEdge() - Constructor for class aud.graph.SimpleEdge

SimpleHashtable<T> - Class in aud.example.hash

Base class for simple hash tables (mainly for demonstration).

SimpleHashtable(int, HashFunction<T>, CollisionHandler<T>) - Constructor for class aud.example.hash.SimpleHashtable

create new hash table

SimpleNode - Class in aud.graph

plain simple node

SimpleNode() - Constructor for class aud.graph.SimpleNode

singlestepper - Variable in class aud.example.graph.Traversal

may halt if single stepper was set

SingleStepper - Class in aud.util

Simple framework for single stepping code.

SingleStepper(String) - Constructor for class aud.util.SingleStepper

create new instance

SingleStepper(JFrame) - Constructor for class aud.util.SingleStepper

create new instance

SingleStepperDemo - Class in aud.util

Demonstrate use of SingleStepper

size() - Method in class aud.DList

determine number of entries [O(n)]

size() - Method in class aud.example.grid.Grid

get total number of cells

size() - Method in class aud.HashMap

get current number of entries

size() - Method in class aud.PriorityQueue

get number of entries

size() - Method in class aud.SList

determine number of entries [O(n)]

size() - Method in class aud.Vector

get number of entries [O(1)]

SList<T> - Class in aud

Implementation of a singly linked list.

SList() - Constructor for class aud.SList

create empty list

SList.Iterator - Class in aud

Forward iterator

SList.Node - Class in aud

SListTest - Class in aud.test

SListTest() - Constructor for class aud.test.SListTest

source() - Method in class aud.graph.AbstractEdge

Get source node.

SparseMatrix<T> - Class in aud.graph.matrix

Simple sparse matrix data structure.

SparseMatrix() - Constructor for class aud.graph.matrix.SparseMatrix

create empty matrix

SparseMatrix(boolean) - Constructor for class aud.graph.matrix.SparseMatrix

create empty matrix (see SparseMatrix.isSymmetricMatrix())

SparseMatrix(SparseMatrix<T>) - Constructor for class aud.graph.matrix.SparseMatrix

copy constructor

SparseMatrix(SparseMatrix<T>, boolean) - Constructor for class aud.graph.matrix.SparseMatrix

copy constructor

SparseMatrixCS<T> - Class in aud.graph.matrix

Simple sparse matrix data structure.

SparseMatrixCS() - Constructor for class aud.graph.matrix.SparseMatrixCS

create empty matrix with "arbitrarily growing" dimensions

SparseMatrixCS(SparseMatrixCS<T>) - Constructor for class aud.graph.matrix.SparseMatrixCS

copy constructor

SparseMatrixCSTest - Class in aud.test

SparseMatrixCSTest() - Constructor for class aud.test.SparseMatrixCSTest

SparseMatrixTest - Class in aud.test

SparseMatrixTest() - Constructor for class aud.test.SparseMatrixTest

split(KTreeNode<Key>) - Method in class aud.BTree

Split node on overflow and merge with parent.

split_bottom_up(KTreeNode<Key>, int) - Method in class aud.A234Tree

Split 5-node and merges with parent.

split_top_down(KTreeNode<Key>) - Method in class aud.A234Tree

Split 4-node and merges with parent.

spones() - Method in class aud.graph.matrix.SparseMatrixCS

Get nonzero pattern.

spy(String, Colormap<T>) - Method in class aud.graph.matrix.SparseMatrixCS

render spy plot in new window

spyTikZ(boolean, Colormap<T>) - Method in class aud.graph.matrix.SparseMatrixCS

Stack<T> - Class in aud

Implementation of a stack based on Vector.

Stack() - Constructor for class aud.Stack

StackTest - Class in aud.test

StackTest() - Constructor for class aud.test.StackTest

start() - Method in class aud.example.hash.HashtableExample

start inserting data

start(MyNode) - Method in class aud.example.graph.AStarShortestPath

find shortest path to destination

start(MyNode) - Method in class aud.example.graph.BreadthFirstSearch

start(MyNode) - Method in class aud.example.graph.DepthFirstSearch

start(MyNode) - Method in class aud.example.graph.IterativeDFS1

start(MyNode) - Method in class aud.example.graph.IterativeDFS2

start(MyNode) - Method in class aud.example.graph.PriorityFirstSearch

start(MyNode) - Method in class aud.example.graph.Traversal

start traversal at node s0

start(MyNode, MyNode) - Method in class aud.example.graph.AStarShortestPath

find shortest path from s0 to s1

statusbar() - Method in class aud.util.DotViewer

get status bar

statusbar() - Method in class aud.util.SVGViewer

get status bar

sum(int) - Method in class aud.example.expr.ExpressionParser

parse sum

sum(int) - Method in class aud.example.expr.ExpressionParser2

parse sum

svgCanvas - Variable in class aud.util.DotViewer

svgCanvas - Variable in class aud.util.SVGViewer

svgfile - Variable in class aud.util.SVGViewer

SVGViewer - Class in aud.util

Simple SVG viewer based on Batik's SVGCanvas.

SVGViewer(JFrame, File) - Constructor for class aud.util.SVGViewer

create new instance

Symbol - Class in aud.example.expr

Node representing a symbolic parameter, e.g., a variable.

Symbol(String) - Constructor for class aud.example.expr.Symbol

create number

SyntaxError - Exception in aud.example.expr

signals syntax error during parsing a term

SyntaxError(String) - Constructor for exception aud.example.expr.SyntaxError

Sys - Class in aud.util

System related utilities.

Sys() - Constructor for class aud.util.Sys

T

tail_ - Variable in class aud.DList

Terminal - Class in aud.example.expr

Node represents a terminal AtomicExpression.

Terminal - Class in aud.util

Terminal() - Constructor for class aud.example.expr.Terminal

Terminal() - Constructor for class aud.util.Terminal

Constructor: guess availability of terminal emulation.

Terminal(boolean) - Constructor for class aud.util.Terminal

Constructor.

testA234Tree() - Method in class aud.test.A234TreeTest

testAVLTree() - Method in class aud.test.AVLTreeTest

testBinarySearchTree() - Method in class aud.test.BinarySearchTreeTest

testBinaryTree() - Method in class aud.test.BinaryTreeTest

testBTree() - Method in class aud.test.BTreeTest

testCtor() - Method in class aud.test.DListTest

testCtor() - Method in class aud.test.SListTest

testCtor() - Method in class aud.test.VectorTest

testDirectedGraph(AbstractGraph<SimpleNode, SimpleEdge>) - Method in class aud.test.GraphTest

testDouble() - Method in class aud.test.GraphTest

testDouble2() - Method in class aud.test.GraphTest

testEntries() - Method in class aud.test.DListTest

testEntries() - Method in class aud.test.SListTest

testGraph() - Method in class aud.test.GraphTest

testInvalid_at() - Method in class aud.test.DListTest

testInvalid_at() - Method in class aud.test.SListTest

testInvalid_at() - Method in class aud.test.VectorTest

testInvalid_back() - Method in class aud.test.DListTest

testInvalid_back() - Method in class aud.test.SListTest

testInvalid_back() - Method in class aud.test.VectorTest

testInvalid_dequeue() - Method in class aud.test.QueueTest

testInvalid_dequeueDL() - Method in class aud.test.QueueTest

testInvalid_erase() - Method in class aud.test.DListTest

testInvalid_erase() - Method in class aud.test.SListTest

testInvalid_erase() - Method in class aud.test.VectorTest

testInvalid_front() - Method in class aud.test.DListTest

testInvalid_front() - Method in class aud.test.QueueTest

testInvalid_front() - Method in class aud.test.SListTest

testInvalid_front() - Method in class aud.test.VectorTest

testInvalid_frontDL() - Method in class aud.test.QueueTest

testInvalid_pop() - Method in class aud.test.StackTest

testInvalid_pop_back() - Method in class aud.test.DListTest

testInvalid_pop_back() - Method in class aud.test.SListTest

testInvalid_pop_back() - Method in class aud.test.VectorTest

testInvalid_pop_front() - Method in class aud.test.DListTest

testInvalid_pop_front() - Method in class aud.test.SListTest

testInvalid_top() - Method in class aud.test.StackTest

testIterators() - Method in class aud.test.DListTest

testIterators() - Method in class aud.test.SListTest

testList() - Method in class aud.test.DListTest

testList() - Method in class aud.test.SListTest

testMatrix() - Method in class aud.test.AdjacencyMatrixTest

testMatrix() - Method in class aud.test.SparseMatrixCSTest

testMatrix() - Method in class aud.test.SparseMatrixTest

testOther() - Method in class aud.test.GraphTest

testQueue() - Method in class aud.test.QueueTest

testQueueDL() - Method in class aud.test.QueueTest

testRedBlackTree() - Method in class aud.test.RedBlackTreeTest

testSize() - Method in class aud.test.DListTest

testSize() - Method in class aud.test.SListTest

testSize() - Method in class aud.test.VectorTest

testStack() - Method in class aud.test.StackTest

testSymmatrixMatrix() - Method in class aud.test.AdjacencyMatrixTest

testSymmatrixMatrix() - Method in class aud.test.SparseMatrixTest

testUndirectedGraph(AbstractGraph<SimpleNode, SimpleEdge>) - Method in class aud.test.GraphTest

testVec() - Method in class aud.test.VectorTest

testVecIterator() - Method in class aud.test.VectorTest

textLabel() - Method in class aud.AVLTree.AVLNode

textLabel() - Method in class aud.BinaryTree

Get string representation of data in BinaryTree.toText()

textLabel() - Method in class aud.RedBlackTree.RBNode

tikzNodeStyle() - Method in class aud.BinaryTree

tikzNodeStyle() - Method in class aud.KTreeNode

tikzNodeStyle() - Method in class aud.RedBlackTree.RBNode

time_ - Variable in class aud.example.graph.Traversal

timeout - Variable in class aud.util.SingleStepper

Times - Class in aud.example.expr

binary * operator: A*B

Times() - Constructor for class aud.example.expr.Times

create operation

TIMES - Static variable in class aud.example.expr.Tokenizer

TNumber - Enum constant in enum class aud.example.expr.AtomicExpression.Type

toDot() - Method in class aud.A234Tree

toDot() - Method in class aud.BinarySearchTree

toDot() - Method in class aud.BinaryTree

toDot() - Method in class aud.BTree

toDot() - Method in class aud.DList

toDot() - Method in class aud.graph.AbstractGraph

toDot() - Method in class aud.KTreeNode

toDot() - Method in class aud.SList

toDot() - Method in interface aud.util.Graphvizable

Get dot representation.

Tokenizer - Class in aud.example.expr

Breaks input string into pieces ("tokens").

Tokenizer - Class in aud.example.graph

Breaks input string into pieces ("tokens").

Tokenizer(String) - Constructor for class aud.example.expr.Tokenizer

create new tokenizer for input

Tokenizer(String) - Constructor for class aud.example.graph.Tokenizer

create new tokenizer for input

toLaTeX(String) - Method in class aud.graph.matrix.SparseMatrixCS

get LaTeX code for displaying (TikZ) matrix

top() - Method in class aud.adt.AbstractStack

Get stack top.

top() - Method in class aud.Stack

toString() - Method in class aud.A234Tree

toString() - Method in class aud.adt.AbstractQueue

toString() - Method in class aud.adt.AbstractStack

Get string representation "|a|b|c".

toString() - Method in class aud.BinarySearchTree.Entry

toString() - Method in class aud.BinarySearchTree

toString() - Method in class aud.BinaryTree

Get string presentation of node data.

toString() - Method in class aud.BinaryTreeTraversal.Traversal

toString() - Method in class aud.BTree

toString() - Method in class aud.DList

toString() - Method in class aud.example.expr.Divide

toString() - Method in class aud.example.expr.ExpressionTree

toString() - Method in class aud.example.expr.Minus

toString() - Method in class aud.example.expr.Number

toString() - Method in class aud.example.expr.Plus

toString() - Method in class aud.example.expr.Power

toString() - Method in class aud.example.expr.Symbol

toString() - Method in class aud.example.expr.Times

toString() - Method in class aud.example.expr.UnaryMinus

toString() - Method in class aud.example.graph.MyNode

toString() - Method in class aud.example.hash.HashtableExample.DoubleHashing

toString() - Method in class aud.example.hash.HashtableExample.HashString

toString() - Method in class aud.example.hash.HashtableExample.IdentityHash

toString() - Method in class aud.example.hash.HashtableExample.LinearProbing

toString() - Method in class aud.example.hash.HashtableExample.QuadraticProbing

toString() - Method in class aud.example.hash.HashtableExample.UniversalHash

toString() - Method in class aud.example.hash.SimpleHashtable

toString() - Method in class aud.example.VerboseStack

toString() - Method in class aud.graph.AbstractEdge

toString() - Method in class aud.graph.AbstractGraph

toString() - Method in class aud.graph.AbstractNode

toString() - Method in class aud.graph.matrix.Coordinate

toString() - Method in class aud.graph.matrix.SparseMatrixCS

toString() - Method in class aud.HashMap

toString() - Method in class aud.KTreeNode.Entry

toString() - Method in class aud.KTreeNode

toString() - Method in class aud.PriorityQueue

toString() - Method in class aud.Queue

Get string representation.

toString() - Method in class aud.QueueDL

toString() - Method in class aud.SList

toString() - Method in class aud.Vector

toText() - Method in class aud.BinarySearchTree

same as BinaryTree.toText()

toText() - Method in class aud.BinaryTree

get multiline text visualization

toTikZ() - Method in class aud.A234Tree

get TikZ code for LaTeX export (calls KTreeNode.toTikZ())

toTikZ() - Method in class aud.BinarySearchTree

same as BinaryTree.toTikZ()

toTikZ() - Method in class aud.BinaryTree

get TikZ code for LaTeX export

toTikZ() - Method in class aud.BTree

get TikZ code for LaTeX export (calls KTreeNode.toTikZ())

toTikZ() - Method in class aud.KTreeNode

get TikZ code for LaTeX export

toTikZ(int) - Method in class aud.BinaryTree

toTikZ(int) - Method in class aud.KTreeNode

traversal - Variable in class aud.example.graph.TraversalExample

the particular traversal algorithm

Traversal - Class in aud.example.graph

interface for traversals of MyGraph

Traversal(MyGraph) - Constructor for class aud.example.graph.Traversal

initiate traversal of g

TraversalExample - Class in aud.example.graph

graph traversal example

TraversalExample() - Constructor for class aud.example.graph.TraversalExample

create instance

traverse(String) - Method in class aud.example.BinaryTreeTraversal

start traversal

traverse(String) - Method in class aud.example.expr.ExpressionTreeTraversal

start traversal

tree_ - Variable in class aud.example.A234TreeExample

tree_ - Variable in class aud.example.AVLTreeExample

tree_ - Variable in class aud.example.BinarySearchTreeExample

tree_ - Variable in class aud.example.BinaryTreeTraversal

tree_ - Variable in class aud.example.BTreeExample

tree_ - Variable in class aud.example.expr.ExpressionTreeTraversal

tree_ - Variable in class aud.example.RedBlackTreeExample

TSymbol - Enum constant in enum class aud.example.expr.AtomicExpression.Type

U

UnaryMinus - Class in aud.example.expr

unary - operator: -A ("sign")

UnaryMinus() - Constructor for class aud.example.expr.UnaryMinus

create operation

UniversalHash() - Constructor for class aud.example.hash.HashtableExample.UniversalHash

UniversalHash(long, long, long) - Constructor for class aud.example.hash.HashtableExample.UniversalHash

unmark(Key) - Method in class aud.BinarySearchTree.Decorator

unmarkAllEdges() - Method in class aud.util.CommonGraphvizDecorator

unmark all edges

unmarkAllEdges() - Method in class aud.util.SimpleDecorator

unmarkAllNodes() - Method in class aud.util.CommonGraphvizDecorator

unmark all nodes

unmarkAllNodes() - Method in class aud.util.SimpleDecorator

unmarkEdge(GraphvizDecorable) - Method in class aud.util.CommonGraphvizDecorator

unmark edge object

unmarkEdge(GraphvizDecorable) - Method in class aud.util.SimpleDecorator

unmarkNode(GraphvizDecorable) - Method in class aud.util.CommonGraphvizDecorator

unmark node object

unmarkNode(GraphvizDecorable) - Method in class aud.util.SimpleDecorator

usage() - Static method in class aud.example.graph.MaxFlowExample

usage() - Static method in class aud.example.graph.TraversalExample

usage() - Static method in class aud.example.grid.Grid

print help message and exit

V

v - Variable in class aud.util.GraphDemo

v - Variable in class aud.util.SingleStepperDemo

value - Variable in class aud.example.grid.Grid.Cell

the value that is displayed

value - Variable in class aud.HashMap.Entry

valueOf(String) - Static method in enum class aud.example.expr.AtomicExpression.Type

Returns the enum constant of this class with the specified name.

values() - Static method in enum class aud.example.expr.AtomicExpression.Type

Returns an array containing the constants of this enum class, in the order they are declared.

Vector<T> - Class in aud

Implementation of an array-based vector.

Vector() - Constructor for class aud.Vector

create empty vector

Vector.Iterator - Class in aud

Forward iterator

VectorTest - Class in aud.test

VectorTest() - Constructor for class aud.test.VectorTest

verbose - Variable in class aud.example.graph.Traversal

set verbosity (extra output if >0)

verbose(int, String) - Method in class aud.example.expr.ExpressionParser

helper: print out information

verbose(int, String) - Method in class aud.example.graph.GraphParser

helper: print out information

VerboseQueue<T> - Class in aud.example

A queue that outputs messages on VerboseQueue.enqueue(T) and VerboseQueue.dequeue().

VerboseQueue() - Constructor for class aud.example.VerboseQueue

VerboseStack<T> - Class in aud.example

A stack that outputs messages on push(T) and pop().

VerboseStack() - Constructor for class aud.example.VerboseStack

viewer_ - Variable in class aud.example.A234TreeExample

viewer_ - Variable in class aud.example.AVLTreeExample

viewer_ - Variable in class aud.example.BinarySearchTreeExample

viewer_ - Variable in class aud.example.BinaryTreeTraversal

viewer_ - Variable in class aud.example.BTreeExample

viewer_ - Variable in class aud.example.expr.ExpressionTreeTraversal

viewer_ - Variable in class aud.example.graph.MaxFlowExample

viewer_ - Variable in class aud.example.graph.TraversalExample

viewer_ - Variable in class aud.example.RedBlackTreeExample

viewPDFFile(String) - Static method in class aud.util.Sys

open PDF viewer

visit(String, String, String, String) - Method in class aud.BinarySearchTree.Visitor

Visitor() - Constructor for class aud.BinarySearchTree.Visitor

visitPreorder(BinarySearchTree.Visitor) - Method in class aud.BinarySearchTree

visit all nodes in preorder

W

weight(int) - Method in class aud.example.graph.GraphParser

parse weight

whereAmI() - Method in class aud.util.SingleStepper

print location of calling code

whereAmI() - Static method in class aud.util.Sys

get code location (like __FILE__,__LINE__

whereAmI(int) - Static method in class aud.util.Sys

get code location (like __FILE__,__LINE__

WHITE - Static variable in class aud.util.Terminal

writeToFile(File, String) - Static method in class aud.util.Sys

write text to file

writeToTempFile(String, String) - Static method in class aud.util.Sys

write text to temporary file

Y

YELLOW - Static variable in class aud.util.Terminal

A B C D E F G H I J K L M N O P Q R S T U V W Y
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form