: Index

Package

Class

Tree

Deprecated

Index

Help

PREV NEXT

FRAMES NO FRAMES

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

A

AbstractContainer - class Opus5.AbstractContainer.: The AbstractContainer is the base class from which all concrete container classes are derived.
AbstractContainer() - Constructor for class Opus5.AbstractContainer
AbstractGraph - class Opus5.AbstractGraph.: The AbstractGraph class is the base class from which all concrete undirected and directed graph classes are derived.
AbstractGraph.Counter - class Opus5.AbstractGraph.Counter.: A counter object.
AbstractGraph.Counter() - Constructor for class Opus5.AbstractGraph.Counter
AbstractGraph.GraphEdge - class Opus5.AbstractGraph.GraphEdge.: Represents an edge in this graph.
AbstractGraph.GraphEdge(AbstractGraph, int, int, Object) - Constructor for class Opus5.AbstractGraph.GraphEdge: Constructs a GraphEdge that connects the specified vertices and with the specified weight.
AbstractGraph.GraphVertex - class Opus5.AbstractGraph.GraphVertex.: Represents a vertex in this graph.
AbstractGraph.GraphVertex(AbstractGraph, int, Object) - Constructor for class Opus5.AbstractGraph.GraphVertex: Constructs a GraphVertex with the specified number and weight.
AbstractGraph(int) - Constructor for class Opus5.AbstractGraph: Constructs an AbstractGraph with the specified size.
AbstractHashTable - class Opus5.AbstractHashTable.: The AbstractHashTable class is the base class from which all concrete hash and scatter table classes are derived.
AbstractHashTable() - Constructor for class Opus5.AbstractHashTable
AbstractObject - class Opus5.AbstractObject.: The AbstractObject class is the base class from which all concrete classes that implement the Comparable interface are derived.
AbstractObject() - Constructor for class Opus5.AbstractObject
AbstractPrePostVisitor - class Opus5.AbstractPrePostVisitor.: The AbstractPrePostVisitor class is the base class from which all concrete pre/post visitor classes are derived.
AbstractPrePostVisitor() - Constructor for class Opus5.AbstractPrePostVisitor
AbstractQuickSorter - class Opus5.AbstractQuickSorter.: The AbstractQuickSorter class is the base class from which all concrete quick sorter classes are derived.
AbstractQuickSorter() - Constructor for class Opus5.AbstractQuickSorter
AbstractSearchableContainer - class Opus5.AbstractSearchableContainer.: The AbstractSearchableContainer class is the base class from which all concrete searchable container classes are derived.
AbstractSearchableContainer() - Constructor for class Opus5.AbstractSearchableContainer
AbstractSet - class Opus5.AbstractSet.: The AbstractSet class is the base class from which all concrete set and multiset classes are derived.
AbstractSet(int) - Constructor for class Opus5.AbstractSet: Constructs an AbstractSet with the specified size of universal set.
AbstractSolver - class Opus5.AbstractSolver.: The AbstractSolver class is the base class from which all concrete solver classes are derived.
AbstractSolver() - Constructor for class Opus5.AbstractSolver
AbstractSorter - class Opus5.AbstractSorter.: The AbstractSorter class is the base class from which all concrete sorter classes are derived.
AbstractSorter() - Constructor for class Opus5.AbstractSorter
AbstractTree - class Opus5.AbstractTree.: The AbstractTree class is the base class from which all concrete tree classes are derived.
AbstractTree.TreeEnumeration - class Opus5.AbstractTree.TreeEnumeration.: Implements an enumeration that enumerates the keys in this tree.
AbstractTree.TreeEnumeration(AbstractTree) - Constructor for class Opus5.AbstractTree.TreeEnumeration: Constructs an TreeEnumeration that enumerates the keys in this tree.
AbstractTree() - Constructor for class Opus5.AbstractTree
AbstractVisitor - class Opus5.AbstractVisitor.: The AbstractVisitor class is the base class from which all concrete visitor classes are derived.
AbstractVisitor() - Constructor for class Opus5.AbstractVisitor
accept(Visitor) - Method in class Opus5.AbstractContainer: Accepts a visitor and as long is its isDone method returns false this method calls the visitor's visit method for each object in this container.
accept(Visitor) - Method in class Opus5.AbstractTree: Accepts a visitor and does a pre-order, depth-first traversal with the visitor.
accept(Visitor) - Method in class Opus5.OrderedListAsLinkedList: Accepts the specified visitor and makes it visit the objects in this ordered list in order.
accept(Visitor) - Method in class Opus5.QueueAsLinkedList: Accepts the specified visitor and makes it visit all the objects in this queue.
accept(Visitor) - Method in class Opus5.PartitionAsForest: Accepts a visitor and makes it visit the elements of this partition.
accept(Visitor) - Method in class Opus5.AbstractGraph: Accepts a visitor and makes it visit the vertices in this graph.
accept(Visitor) - Method in class Opus5.ChainedScatterTable: Accepts the specified visitor and makes it visit all the objects in this chained scatter table.
accept(Visitor) - Method in class Opus5.MultisetAsLinkedList: Accepts a visitor and makes it visit the elements of this multiset.
accept(Visitor) - Method in class Opus5.StackAsLinkedList: Accepts a visitor and makes it visit the objects in this stack.
accept(Visitor) - Method in interface Opus5.Container: Causes a visitor to visit the objects in this container.
accept(Visitor) - Method in class Opus5.QueueAsArray: Accepts the specified visitor and makes it visit all the objects in this queue.
accept(Visitor) - Method in class Opus5.OpenScatterTable: Accepts the specified visitor and makes it visit all the objects in this open scatter table.
accept(Visitor) - Method in class Opus5.StackAsArray: Accepts a visitor and makes it visit all the object in this stack.
accept(Visitor) - Method in class Opus5.ChainedHashTable: Accepts the specified visitor and makes it visit all the objects in this chained hash table.
accept(Visitor) - Method in class Opus5.OrderedListAsArray: Accepts the specified visitor and makes it visit the objects in this ordered list in order.
accept(Visitor) - Method in class Opus5.BinomialQueue: Accepts the specified visitor and makes it visit all the objects contained in this binomial queue.
accept(Visitor) - Method in class Opus5.SetAsArray: Accepts a visitor and makes it visit the elements of this set.
accept(Visitor) - Method in class Opus5.SetAsBitVector: Accepts a visitor and makes it visit the elements of this set.
accept(Visitor) - Method in class Opus5.Deap: Accepts the specified visitor and makes it visit all the objects in this deap.
accept(Visitor) - Method in class Opus5.MultisetAsArray: Accepts a visitor and makes it visit the elements of this multiset.
accept(Visitor) - Method in class Opus5.BinaryHeap: Accepts the specified visitor and makes it visit all the objects in this heap.
add(BinomialQueue.BinomialTree) - Method in class Opus5.BinomialQueue.BinomialTree: Adds the specified binomial tree to this binomial tree.
add(Term) - Method in interface Opus5.Polynomial: Adds the specified term to this polynomial.
add(Term) - Method in class Opus5.PolynomialAsOrderedList: Adds the specified term to this polynomial.
add(Term) - Method in class Opus5.PolynomialAsSortedList: Adds the specified term to this polynomial.
addEdge(Edge) - Method in class Opus5.AbstractGraph: Adds an edge to this graph.
addEdge(Edge) - Method in class Opus5.GraphAsMatrix: Adds the specified edge to this graph.
addEdge(Edge) - Method in class Opus5.DigraphAsMatrix: Adds the specified edge to this directed graph.
addEdge(Edge) - Method in class Opus5.GraphAsLists: Adds the specified edge to this graph.
addEdge(int, int) - Method in class Opus5.AbstractGraph: Adds an edge to this graph that connects the specified vertices.
addEdge(int, int) - Method in interface Opus5.Graph: Adds an unweighted edge to this graph that connects the two vertices specified by their vertex numbers.
addEdge(int, int, Object) - Method in class Opus5.AbstractGraph: Adds an edge to this graph that connects the specified vertices and has the specified weight.
addEdge(int, int, Object) - Method in interface Opus5.Graph: Adds a weighted edge to this graph that connects the two vertices specified by their vertex numbers.
addTree(BinomialQueue.BinomialTree) - Method in class Opus5.BinomialQueue: Adds the specified binomial tree to this binomial queue.
addVertex(int) - Method in class Opus5.AbstractGraph: Adds a vertex to this graph with the specified number.
addVertex(int) - Method in interface Opus5.Graph: Adds an unweighted vertex with a specified number to this graph.
addVertex(int, Object) - Method in class Opus5.AbstractGraph: Adds a vertex to this graph with the specified number and weight.
addVertex(int, Object) - Method in interface Opus5.Graph: Adds a weighted vertex with a specified number to this graph.
addVertex(Vertex) - Method in class Opus5.AbstractGraph: Adds the specified vertex to this graph.
adjacencyList - Variable in class Opus5.GraphAsLists: The adjacency lists.
adjustHeight() - Method in class Opus5.AVLTree: Recomputes the height of this node from the heights of the subtrees of this node.
Algorithms - class Opus5.Algorithms.: Various algorithms.
Algorithms() - Constructor for class Opus5.Algorithms
App - class Opus5.App.
App() - Constructor for class Opus5.App
App(String[]) - Constructor for class Opus5.App
append(Object) - Method in class Opus5.LinkedList: Appends to this list a list element that contains the specified object.
Application1 - class Opus5.Application1.: Application program that uses a stack to implement an RPN calculator.
Application1() - Constructor for class Opus5.Application1
Application11 - class Opus5.Application11.: Application program that demonstrates critical-path analysis.
Application11() - Constructor for class Opus5.Application11
Application12 - class Opus5.Application12.: Application program that demonstrates the use of various problem solvers to solve a scales-balancing problem and a 0/1-knapsack problem.
Application12() - Constructor for class Opus5.Application12
Application2 - class Opus5.Application2.: Application program that illustrates the use of a queue to implement breadth-first traversal.
Application2() - Constructor for class Opus5.Application2
Application3 - class Opus5.Application3.: Application program that illustrates the implemention of polynomials using ordered lists.
Application3() - Constructor for class Opus5.Application3
Application4 - class Opus5.Application4.: Application program that illustrates the implementation of polynomials as sorted lists.
Application4() - Constructor for class Opus5.Application4
Application5 - class Opus5.Application5.: Application program that illustrates the use of a hash table to count number of occurrences of each word in the input text.
Application5() - Constructor for class Opus5.Application5
Application6 - class Opus5.Application6.: Application program that illustrates the use of a binary tree to convert a postfix expression to an infix expression.
Application6() - Constructor for class Opus5.Application6
Application7 - class Opus5.Application7.: Application program the illustrates the use of a search tree to implement a word-by-word translation.
Application7() - Constructor for class Opus5.Application7
Application8 - class Opus5.Application8.: Application program that illustrates the use of a priority queue to implement a discrete-event simulation.
Application8() - Constructor for class Opus5.Application8
Application9 - class Opus5.Application9.: Application program that illustrates the use of a partition to compute equivalence classes.
Application9() - Constructor for class Opus5.Application9
array - Variable in class Opus5.AbstractSorter: The array to be sorted.
array - Variable in class Opus5.PartitionAsForest: Array of partition trees.
array - Variable in class Opus5.ChainedScatterTable: An array of entries.
array - Variable in class Opus5.QueueAsArray: The array.
array - Variable in class Opus5.OpenScatterTable: An array of entries.
array - Variable in class Opus5.StackAsArray: The array.
array - Variable in class Opus5.ChainedHashTable: An array of linked lists.
array - Variable in class Opus5.DenseMatrix: Two-dimensional array.
array - Variable in class Opus5.OrderedListAsArray: The array.
array - Variable in class Opus5.SparseMatrixAsVector: An array of triples (entries).
array - Variable in class Opus5.SetAsArray: The array.
array - Variable in class Opus5.Deap: The heap.
array - Variable in class Opus5.MultisetAsArray: The array.
array - Variable in class Opus5.BinaryHeap: The heap.
Array - class Opus5.Array.: An array of Objects.
Array() - Constructor for class Opus5.Array: Constructs an Array of length zero with base zero.
Array(int) - Constructor for class Opus5.Array: Constructs an Array with the specified length.
Array(int, int) - Constructor for class Opus5.Array: Constructs an Array with the specified length and base.
assign(Array) - Method in class Opus5.Array: Assigns the value of the specified array to this array.
assign(Complex) - Method in class Opus5.Complex: Assigns the value of the specified complex number to this complex number.
assign(LinkedList) - Method in class Opus5.LinkedList: Assigns to this linked list the value of the specified linked list.
Association - class Opus5.Association.: An association is a (key, value) pair that implements the Comparable interface.
Association(Comparable) - Constructor for class Opus5.Association: Constructs an Association with the specified key.
Association(Comparable, Object) - Constructor for class Opus5.Association: Constructs an Association with the specified key and value.
attachKey(Object) - Method in class Opus5.BinaryTree: Attaches the specified object as the key of this node.
attachKey(Object) - Method in class Opus5.NaryTree: Attaches the specified object as the key of this N-ary tree node.
attachKey(Object) - Method in class Opus5.BinarySearchTree: Attaches the specified object as the key of this node.
attachKey(Object) - Method in class Opus5.AVLTree: Attaches the specified object as the key of this node.
attachLeft(BinaryTree) - Method in class Opus5.BinaryTree: Attaches the specified binary tree as the left subtree of this node.
attachLeftHalfOf(BTree) - Method in class Opus5.BTree: Attaches the left half of the keys and subtrees of the specified B-tree to this B-tree node.
attachRight(BinaryTree) - Method in class Opus5.BinaryTree: Attaches the specified binary tree as the right subtree of this node.
attachRightHalfOf(BTree) - Method in class Opus5.BTree: Attaches the right half of the keys and subtrees of the specified B-tree to this B-tree node.
attachSubtree(GeneralTree) - Method in class Opus5.GeneralTree: Attches the specified subtree to this general tree node.
attachSubtree(int, MWayTree) - Method in class Opus5.BTree: Attaches the specified B-tree as the specified subtree of this B-tree.
attachSubtree(int, NaryTree) - Method in class Opus5.NaryTree: Attaches the specified tree as the specified subtree of this node.
AVLTree - class Opus5.AVLTree.: A node in an AVL tree.
AVLTree() - Constructor for class Opus5.AVLTree: Constructs an empty AVLTree

B

backgroundColor - Variable in class Opus5.GraphicalObject: The background color.
balance() - Method in class Opus5.BinarySearchTree: Balances this node.
balance() - Method in class Opus5.AVLTree: AVL balances this node.
base - Variable in class Opus5.Array: The index of the first array element.
base - Static variable in class Opus5.HeapSorter: The first element of a heap has the number 1 (not zero).
bestObjective - Variable in class Opus5.AbstractSolver: The value of the objective function for the current "best" solution.
bestSolution - Variable in class Opus5.AbstractSolver: The current "best" solution.
BinaryHeap - class Opus5.BinaryHeap.: A priority queue implemented as a binary heap.
BinaryHeap(int) - Constructor for class Opus5.BinaryHeap: Constructs a BinaryHeap with the specified length.
BinaryInsertionSorter - class Opus5.BinaryInsertionSorter.: Sorter for sorting an array of Comparable objects.
BinaryInsertionSorter() - Constructor for class Opus5.BinaryInsertionSorter
binarySearch(Comparable[], Comparable, int, int) - Static method in class Opus5.Example: Returns the position of an integer in a specified contiguous region in a sorted array of integers.
BinarySearchTree - class Opus5.BinarySearchTree.: A node in a binary search tree.
BinarySearchTree() - Constructor for class Opus5.BinarySearchTree
BinaryTree - class Opus5.BinaryTree.: A node in a binary tree.
BinaryTree() - Constructor for class Opus5.BinaryTree: Constructs an empty BinaryTree.
BinaryTree(Object) - Constructor for class Opus5.BinaryTree: Constructs a BinaryTree with the specified key.
BinaryTree(Object, BinaryTree, BinaryTree) - Constructor for class Opus5.BinaryTree: Constructs a BinaryTree with the specified key, and the specified left and right subtree.
binom(int, int) - Static method in class Opus5.Example: Returns the binomial coefficient, n choose m.
BinomialQueue - class Opus5.BinomialQueue.: A mergeable priority queue implemented as a forest of binomial trees.
BinomialQueue.BinomialTree - class Opus5.BinomialQueue.BinomialTree.: A node in a binomial tree.
BinomialQueue.BinomialTree(Object) - Constructor for class Opus5.BinomialQueue.BinomialTree: Constructs a BinomialTree of order zero that contains the specified key.
BinomialQueue() - Constructor for class Opus5.BinomialQueue: Constructs an empty BinomialQueue.
Bounds - class Opus5.Bounds.: Provides one static method to simplify array-bounds checking.
Bounds() - Constructor for class Opus5.Bounds
BreadthFirstBranchAndBoundSolver - class Opus5.BreadthFirstBranchAndBoundSolver.: Branch-and-bound, breadth-first problem solver for searching tree-structures solution spaces.
BreadthFirstBranchAndBoundSolver() - Constructor for class Opus5.BreadthFirstBranchAndBoundSolver
BreadthFirstSolver - class Opus5.BreadthFirstSolver.: Breadth-first problem solver for searching tree-structured solution spaces.
BreadthFirstSolver() - Constructor for class Opus5.BreadthFirstSolver
breadthFirstTraversal(Tree) - Static method in class Opus5.Algorithms: Traverses a tree breadth-first, printing each node as it is visited.
breadthFirstTraversal(Visitor) - Method in class Opus5.AbstractTree: Causes a visitor to visit the nodes of this tree in breadth-first traversal order starting from this node.
breadthFirstTraversal(Visitor) - Method in class Opus5.MWayTree: Causes a visitor to visit the nodes of this tree in breadth-first traversal order starting from this node.
breadthFirstTraversal(Visitor) - Method in class Opus5.PartitionAsForest.PartitionTree: Does a breadth-first traversal of this partition tree.
breadthFirstTraversal(Visitor) - Method in interface Opus5.Tree: Causes a visitor to visit the nodes of this tree in breadth-first traversal order starting from this node.
breadthFirstTraversal(Visitor, int) - Method in class Opus5.AbstractGraph: Causes a visitor to visit the vertices of this directed graph in breadth-first traversal order starting from a given vertex.
breadthFirstTraversal(Visitor, int) - Method in interface Opus5.Graph: Causes a visitor to visit the vertices of this directed graph in breadth-first traversal order starting from a given vertex.
BTree - class Opus5.BTree.: A node in a B-tree.
BTree(int) - Constructor for class Opus5.BTree: Construcs an empty BTree with the specified order.
BubbleSorter - class Opus5.BubbleSorter.: Sorter for sorting an array of Comparable objects.
BubbleSorter() - Constructor for class Opus5.BubbleSorter
bucketSort(int[], int) - Static method in class Opus5.Example: Sorts (in place) an array of integers which are known to fall in the interval [0,m-1].
BucketSorter - class Opus5.BucketSorter.: Sorter for sorting an array of Ints.
BucketSorter(int) - Constructor for class Opus5.BucketSorter: Constructs a BucketSorter with the specified number of buckets.
buildHeap() - Method in class Opus5.HeapSorter: Builds a heap from the unsorted array.

C

c(int) - Static method in class Opus5.OpenScatterTable: Implements the linear-probing collision resolution strategy.
calculator(Reader, PrintWriter) - Static method in class Opus5.Algorithms: A reverse-polish calculator.
capacity - Variable in class Opus5.ZeroOneKnapsackProblem: The capacity of the knapsack.
carry(BinomialQueue.BinomialTree, BinomialQueue.BinomialTree, BinomialQueue.BinomialTree) - Method in class Opus5.BinomialQueue: Returns the "carry" which results when three binomial trees are "added".
center - Variable in class Opus5.GraphicalObject: The center point of this graphical object.
ChainedHashTable - class Opus5.ChainedHashTable.: A chained hash table implemented using an array of linked lists.
ChainedHashTable(int) - Constructor for class Opus5.ChainedHashTable: Constructs a ChainedHashTable with the specified length.
ChainedScatterTable - class Opus5.ChainedScatterTable.: A chained hash table implemented using an array.
ChainedScatterTable.Entry - class Opus5.ChainedScatterTable.Entry.: Entry data structure
ChainedScatterTable.Entry() - Constructor for class Opus5.ChainedScatterTable.Entry
ChainedScatterTable(int) - Constructor for class Opus5.ChainedScatterTable: Constructs a ChainedScatterTable with the specified length.
charValue() - Method in class Opus5.Chr: Returns the value of this Chr.
check(int, int, int) - Static method in class Opus5.Bounds: Checks whether the specified index falls in the specified range.
checkArguments(PartitionAsForest.PartitionTree, PartitionAsForest.PartitionTree) - Method in class Opus5.PartitionAsForest: Checks whether the specified partition trees are distinct, are both members of this partition, and are both roots of their respective trees.
children - Variable in class Opus5.Parent: The children of this parent.
Chr - class Opus5.Chr.: Wrapper class that wraps a char and implements the Comparable interface.
Chr(char) - Constructor for class Opus5.Chr: Constructs an Chr with the specified value.
Circle - class Opus5.Circle.: A circular graphical object.
Circle(Point, int) - Constructor for class Opus5.Circle: Constructs a Circle with the specified center point and radius.
clone() - Method in class Opus5.ScalesBalancingProblem.Node: Clones this object.
clone() - Method in class Opus5.ZeroOneKnapsackProblem.Node: Clones this object.
coefficient - Variable in class Opus5.Term: The coefficient of this term.
columns - Variable in class Opus5.SparseMatrixAsArray: The column numbers corresponding to the non-zero entries.
Comparable - interface Opus5.Comparable.: Encapsulates methods for comparing objects.
compare(Comparable) - Method in class Opus5.AbstractObject: Compares this comparable object to the specified comparable object.
compare(Comparable) - Method in interface Opus5.Comparable: Compares this object with the specified one.
compareTo(Comparable) - Method in class Opus5.AbstractObject: Compares this comparable object to the specified comparable object.
compareTo(Comparable) - Method in class Opus5.GeneralTree: Compares this general tree with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.BinaryTree: Compares this binary tree with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.NaryTree: Compares this N-ary tree with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.OrderedListAsLinkedList: Compares this ordered list with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.Int: Compares this Int with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.MWayTree: Compares this M-way tree with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.QueueAsLinkedList: Compares this queue with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.PartitionAsForest: Compares this partition with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.AbstractGraph.GraphVertex: Compares this vertex with a specified comparable object.
compareTo(Comparable) - Method in class Opus5.AbstractGraph.GraphEdge: Compares this edge with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.ChainedScatterTable: Compares this chained scatter table with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.MultisetAsLinkedList: Compares this multiset with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.StackAsLinkedList: Compares this object with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.QueueAsArray: Compares this object with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.OpenScatterTable: Compares this open scatter table with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.ScalesBalancingProblem.Node: Compares this node in the solution space with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.StackAsArray: Compares this stack with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.ChainedHashTable: Compares this chained hash table with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.OrderedListAsArray: Compares this ordered list with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.Str: Compares this Str with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.BinomialQueue: Compares this binomial queue with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.SetAsArray: Compares this set with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.GraphAsMatrix: Compares this graph with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.GraphAsLists: Compares this graph with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.PartitionAsForest.PartitionTree: Compares this partition tree node with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.Lng: Compares this Lng with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.SetAsBitVector: Compares this set with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.Association: Compares this association with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.Deap: Compares this deap with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.Term: Compares this term with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.ZeroOneKnapsackProblem.Node: Compares this node in the solution space with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.MultisetAsArray: Compares this multiset with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.Dbl: Compares this Dbl with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.BinaryHeap: Compares this heap with the specified comparable object.
compareTo(Comparable) - Method in class Opus5.Chr: Compares this Chr with the specified comparable object.
Complex - class Opus5.Complex.: A complex number.
Complex() - Constructor for class Opus5.Complex: Constructs a Complex with the the value zero.
Complex(double) - Constructor for class Opus5.Complex: Constructs a Complex with the specified real part.
Complex(double, double) - Constructor for class Opus5.Complex: Constructs a Complex with the specified real and imaginary parts.
Container - interface Opus5.Container.: Encapsulates methods common to all container classes.
ContainerEmptyException - exception Opus5.ContainerEmptyException.: Thrown when an attempting to get an object from an empty container.
ContainerEmptyException() - Constructor for class Opus5.ContainerEmptyException
ContainerFullException - exception Opus5.ContainerFullException.: Thrown when attempty to put an object into a full container.
ContainerFullException() - Constructor for class Opus5.ContainerFullException
copyright - Static variable in interface Opus5.SortedList
copyright - Static variable in interface Opus5.Polynomial
copyright - Static variable in interface Opus5.SearchableContainer
copyright - Static variable in interface Opus5.Solution
copyright - Static variable in interface Opus5.Queue
copyright - Static variable in interface Opus5.Solver
copyright - Static variable in interface Opus5.Matrix
copyright - Static variable in interface Opus5.DoubleEndedPriorityQueue
copyright - Static variable in interface Opus5.RandomVariable
copyright - Static variable in interface Opus5.HashTable
copyright - Static variable in interface Opus5.PrePostVisitor
copyright - Static variable in interface Opus5.SparseMatrix
copyright - Static variable in interface Opus5.Container
copyright - Static variable in interface Opus5.Deque
copyright - Static variable in interface Opus5.Set
copyright - Static variable in interface Opus5.Vertex
copyright - Static variable in interface Opus5.OrderedList
copyright - Static variable in interface Opus5.Visitor
copyright - Static variable in interface Opus5.Cursor
copyright - Static variable in interface Opus5.GraphicsPrimitives
copyright - Static variable in interface Opus5.MergeablePriorityQueue
copyright - Static variable in interface Opus5.Enumeration
copyright - Static variable in interface Opus5.Digraph
copyright - Static variable in interface Opus5.Sorter
copyright - Static variable in interface Opus5.Comparable
copyright - Static variable in interface Opus5.Multiset
copyright - Static variable in interface Opus5.Stack
copyright - Static variable in interface Opus5.Edge
copyright - Static variable in interface Opus5.SearchTree
copyright - Static variable in interface Opus5.Partition
copyright - Static variable in interface Opus5.Graph
copyright - Static variable in interface Opus5.PriorityQueue
copyright - Static variable in interface Opus5.Tree
count - Variable in class Opus5.AbstractContainer: The number of objects in this container.
count - Variable in class Opus5.RadixSorter: The array of counters (buckets).
count - Variable in class Opus5.BucketSorter: The counters (buckets).
criticalPathAnalysis(Digraph) - Static method in class Opus5.Algorithms: Computes the critical path in an event-node graph.
Cursor - interface Opus5.Cursor.: Used to represent a position in an ordered list or a sorted list.
cutOff - Static variable in class Opus5.AbstractQuickSorter: The length of the smallest array slice to quicksort.

D

data - Variable in class Opus5.Array: The array elements.
Dbl - class Opus5.Dbl.: Wrapper class that wraps a double and implements the Comparable interface.
Dbl(double) - Constructor for class Opus5.Dbl: Constructs a Dbl with the specified value.
Deap - class Opus5.Deap.: A double-ended priority queue implemented as a binary heap.
Deap(int) - Constructor for class Opus5.Deap: Constructs a Deap with the specified length.
degree - Variable in class Opus5.GeneralTree: The degree of this node.
degree - Variable in class Opus5.NaryTree: The degree of this node.
Demo1 - class Opus5.Demo1.: Demonstration program that tests the following classes: DenseMatrix, SparseMatrixAsArray, SparseMatrixAsVector, and SparseMatrixAsLinkedList.
Demo1() - Constructor for class Opus5.Demo1
Demo10 - class Opus5.Demo10.: Demonstration program that tests the following classes: GraphAsMatrix, GraphAsLists, DigraphAsMatrix, and DigraphAsLists.
Demo10() - Constructor for class Opus5.Demo10
Demo2 - class Opus5.Demo2.: Demonstration program that tests the following classes: StackAsArray, StackAsLinkedList, QueueAsArray, QueueAsLinkedList, DequeAsArray, and DequeAsLinkedList.
Demo2() - Constructor for class Opus5.Demo2
Demo3 - class Opus5.Demo3.: Demonstration program that tests the following classes: OrderedListAsArray, OrderedListAsLinkedList, SortedListAsArray, and SortedListAsLinkedList.
Demo3() - Constructor for class Opus5.Demo3
Demo4 - class Opus5.Demo4.: Demonstration program that tests the following classes: ChainedHashTable, ChainedScatterTable, and OpenScatterTable.
Demo4() - Constructor for class Opus5.Demo4
Demo5 - class Opus5.Demo5.: Demonstration program that tests the following classes: GeneralTree, BinaryTree, NaryTree, BinarySearchTree, AVLTree, MWayTree, and BTree.
Demo5() - Constructor for class Opus5.Demo5
Demo6 - class Opus5.Demo6.: Demonstration program that tests the following classes: BinaryHeap, LeftistHeap, BinomialQueue, and Deap.
Demo6() - Constructor for class Opus5.Demo6
Demo7 - class Opus5.Demo7.: Demonstration program that tests the following classes: SetAsArray, SetAsBitVector, MultisetAsArray, MultisetAsLinkedList, PartitionAsForest, PartitionAsForestV2, and PartitionAsForestV3.
Demo7() - Constructor for class Opus5.Demo7
Demo9 - class Opus5.Demo9.: Demonstration program that tests the following classes: StraightInsertionSorter, BinaryInsertionSorter, StraightSelectionSorter, BubbleSorter, HeapSorter, MedianOfThreeQuickSorter, TwoWayMergeSorter, BucketSorter, and RadixSorter.
Demo9() - Constructor for class Opus5.Demo9
DenseMatrix - class Opus5.DenseMatrix.: Dense matrix implemented using a two-dimensional array.
DenseMatrix(int, int) - Constructor for class Opus5.DenseMatrix: Constructs a DenseMatrixAsArray with the specified dimensions.
DepthFirstBranchAndBoundSolver - class Opus5.DepthFirstBranchAndBoundSolver.: Depth-first, branch-and-bound problem solver for searching tree-structured solution spaces.
DepthFirstBranchAndBoundSolver() - Constructor for class Opus5.DepthFirstBranchAndBoundSolver
DepthFirstSolver - class Opus5.DepthFirstSolver.: Depth-first problem solver for searching tree-structured solution spaces.
DepthFirstSolver() - Constructor for class Opus5.DepthFirstSolver
depthFirstTraversal(PrePostVisitor) - Method in class Opus5.AbstractTree: Causes a visitor to visit the nodes of this tree in depth-first traversal order starting from this node.
depthFirstTraversal(PrePostVisitor) - Method in class Opus5.BinaryTree: Causes a visitor to visit the nodes of this tree in depth-first traversal order starting from this node.
depthFirstTraversal(PrePostVisitor) - Method in class Opus5.MWayTree: Causes a visitor to visit the nodes of this tree in depth-first traversal order starting from this node.
depthFirstTraversal(PrePostVisitor) - Method in class Opus5.PartitionAsForest.PartitionTree: Does a depth-first traversal of this partition tree.
depthFirstTraversal(PrePostVisitor) - Method in interface Opus5.Tree: Causes a visitor to visit the nodes of this tree in depth-first traversal order starting from this node.
depthFirstTraversal(PrePostVisitor, int) - Method in class Opus5.AbstractGraph: Causes a visitor to visit the vertices of this graph in depth-first traversal order starting from a given vertex.
depthFirstTraversal(PrePostVisitor, int) - Method in interface Opus5.Graph: Causes a visitor to visit the vertices of this directed graph in depth-first traversal order starting from a given vertex.
Deque - interface Opus5.Deque.: Encapsulates methods common to all deques (double-ended queues).
DequeAsArray - class Opus5.DequeAsArray.: A deque (double-ended queue) implemented using an array.
DequeAsArray(int) - Constructor for class Opus5.DequeAsArray: Constructs a Deque with the specified array length.
DequeAsLinkedList - class Opus5.DequeAsLinkedList.: A deque (double-ended queue) implemented using a linked list.
DequeAsLinkedList() - Constructor for class Opus5.DequeAsLinkedList
dequeue() - Method in interface Opus5.Queue: Dequeues and returns the object at the head of the queue.
dequeue() - Method in class Opus5.QueueAsLinkedList: Dequeues and returns the object at the head of this queue.
dequeue() - Method in class Opus5.QueueAsArray: Dequeus and returns the object at the head of this queue.
dequeueHead() - Method in class Opus5.DequeAsLinkedList: Dequeues and returns the object at the head of this queue.
dequeueHead() - Method in interface Opus5.Deque: Dequeues and returns the object at the head of this deque.
dequeueHead() - Method in class Opus5.DequeAsArray: Dequeues and returns the object at the head of this queue.
dequeueMax() - Method in interface Opus5.DoubleEndedPriorityQueue: Dequeues and returns the "largest" object contained in the priority queue.
dequeueMax() - Method in class Opus5.Deap: Dequeues and returns the "largest" object in this deap.
dequeueMin() - Method in class Opus5.LeftistHeap: Dequeues and returns the "smallest" object in this leftist heap.
dequeueMin() - Method in class Opus5.BinomialQueue: Dequeues and returns the "smallest" object in this binomial queue.
dequeueMin() - Method in class Opus5.Deap: Dequeues and returns the "smallest" object in this deap.
dequeueMin() - Method in interface Opus5.PriorityQueue: Dequeues and returns the "smallest" object in this priority queue.
dequeueMin() - Method in class Opus5.BinaryHeap: Dequeues and returns the "smallest" object in this heap.
dequeueTail() - Method in class Opus5.DequeAsLinkedList: Dequeues and returns the object at the tail of this queue.
dequeueTail() - Method in interface Opus5.Deque: Dequeues and returns the object at the tail of this deque.
dequeueTail() - Method in class Opus5.DequeAsArray: Dequeues and returns the object at the tail of this queue.
detachKey() - Method in class Opus5.BinaryTree: Detaches the key from this node; making it the empty node.
detachKey() - Method in class Opus5.NaryTree: Detaches the key from this node; making it the empty node.
detachKey() - Method in class Opus5.AVLTree: Detaches the key from this node; making it the empty node.
detachLeft() - Method in class Opus5.BinaryTree: Detaches and returns the left subtree of this node.
detachRight() - Method in class Opus5.BinaryTree: Detaches and returns the right subtree of this node.
detachSubtree(GeneralTree) - Method in class Opus5.GeneralTree: Detaches and returns the specified subtree of this general tree node.
diff - Variable in class Opus5.ScalesBalancingProblem.Node: The current weight difference between the pans.
difference(Multiset) - Method in class Opus5.MultisetAsLinkedList: Returns a multiset which is the difference between this multiset and the specified multiset.
difference(Multiset) - Method in interface Opus5.Multiset: Returns the difference between this set and the specified set.
difference(Multiset) - Method in class Opus5.MultisetAsArray: Returns a multiset which is the difference between this multiset and the specified multiset.
difference(Set) - Method in class Opus5.PartitionAsForest: Undefined for partitions.
difference(Set) - Method in interface Opus5.Set: Returns the difference between this set and the specified set.
difference(Set) - Method in class Opus5.SetAsArray: Returns a set which is the difference between this set and the specified set.
difference(Set) - Method in class Opus5.PartitionAsForest.PartitionTree: Returns the difference between the set represented by this partition tree and the specified set.
difference(Set) - Method in class Opus5.SetAsBitVector: Returns a set which is the difference between this set and the specified set.
differentiate() - Method in interface Opus5.Polynomial: Differentiates this polynomial.
differentiate() - Method in class Opus5.PolynomialAsOrderedList: Differentiates this polynomial.
differentiate() - Method in class Opus5.PolynomialAsSortedList: Differentiates this polynomial.
differentiate() - Method in class Opus5.Term: Differentiates this term.
Digraph - interface Opus5.Digraph.: Encapsulates methods common to all directed graph.
DigraphAsLists - class Opus5.DigraphAsLists.: A directed graph implemented using adjacency lists.
DigraphAsLists(int) - Constructor for class Opus5.DigraphAsLists: Constructs a DigraphAsLists with the specified size.
DigraphAsMatrix - class Opus5.DigraphAsMatrix.: A directed graph implemented using an adjacency matrix.
DigraphAsMatrix(int) - Constructor for class Opus5.DigraphAsMatrix: Constructs a DigraphAsMatrix with the specified size.
DijkstrasAlgorithm(Digraph, int) - Static method in class Opus5.Algorithms: Dijkstra's algorithm to solve the single-source, shortest path problem for the given edge-weighted, directed graph.
doLLRotation() - Method in class Opus5.AVLTree: Performs an LL (single) rotation.
doLRRotation() - Method in class Opus5.AVLTree: Performs an LR (double) rotation.
DomainException - exception Opus5.DomainException.: Thrown by a method when it is called with an argument value (or values) for which it is not defined.
DomainException() - Constructor for class Opus5.DomainException: Constructs a DomainException with no detail message.
DomainException(String) - Constructor for class Opus5.DomainException: Constructs a DomainException with the specified detail message.
doRLRotation() - Method in class Opus5.AVLTree: Performs an RL (double) rotation.
doRRRotation() - Method in class Opus5.AVLTree: Performs an RR (single) rotation.
DoubleEndedPriorityQueue - interface Opus5.DoubleEndedPriorityQueue.: Encapsulates methods common to all double-ended priority queues.
doubleValue() - Method in class Opus5.Dbl: Returns the value of this Dbl.
draw() - Method in class Opus5.GraphicalObject: Draws this graphical object.
draw() - Method in class Opus5.Circle: Draws this circle.
draw() - Method in class Opus5.Rectangle: Draws this rectangle.
draw() - Method in interface Opus5.GraphicsPrimitives: Draws this graphical object on the screen.
dual(int) - Method in class Opus5.Deap: Returns the position in this deap of the dual of the object at the specified position.

E

Edge - interface Opus5.Edge.: Encapsulates methods common to all graph edges.
enqueue(Comparable) - Method in class Opus5.LeftistHeap: Enqueues the specified object in this leftist heap.
enqueue(Comparable) - Method in class Opus5.BinomialQueue: Enqueues the specified object in this binomial queue.
enqueue(Comparable) - Method in class Opus5.Deap: Inserts the specified object into this deap.
enqueue(Comparable) - Method in interface Opus5.PriorityQueue: Enqueues the specified object in this priority queue.
enqueue(Comparable) - Method in class Opus5.BinaryHeap: Enqueues the specified object.
enqueue(Object) - Method in interface Opus5.Queue: Enqueues the object at the tail of the queue.
enqueue(Object) - Method in class Opus5.QueueAsLinkedList: Enqueues the specified object at the tail of this queue.
enqueue(Object) - Method in class Opus5.QueueAsArray: Enqueues the specified object at the tail of this queue.
enqueueHead(Object) - Method in class Opus5.DequeAsLinkedList: Enqueues the specified object at the head of this queue.
enqueueHead(Object) - Method in interface Opus5.Deque: Enqueues the specified object at the head of this deque.
enqueueHead(Object) - Method in class Opus5.DequeAsArray: Enqueues the specified object at the head of this queue.
enqueueTail(Object) - Method in class Opus5.DequeAsLinkedList: Enqueues the specified object at the tail of this queue.
enqueueTail(Object) - Method in interface Opus5.Deque: Enqueues the specified object at the tail of this deque.
enqueueTail(Object) - Method in class Opus5.DequeAsArray: Enqueues the specified object at the tail of this queue.
Enumeration - interface Opus5.Enumeration.: Encapsulates methods common to all enumerations.
equals(Object) - Method in class Opus5.AbstractObject: Tests whether this comparable object equals the specified object.
equivalenceClasses(Reader, PrintWriter) - Static method in class Opus5.Algorithms: Computes equivalence classes using a partition.
erase() - Method in class Opus5.GraphicalObject: Erases this graphical object.
erase() - Method in interface Opus5.GraphicsPrimitives: Erases this graphical object from the screen.
err - Static variable in class Opus5.Terminal
Example - class Opus5.Example.: Various example methods.
Example() - Constructor for class Opus5.Example
Experiment2 - class Opus5.Experiment2.: Measures the running times of various sorters.
Experiment2() - Constructor for class Opus5.Experiment2
exponent - Variable in class Opus5.Term: The exponent of this term.
ExponentialRV - class Opus5.ExponentialRV.: Exponentially distributed random variable.
ExponentialRV(double) - Constructor for class Opus5.ExponentialRV: Constructs a ExponentialRV with the specified mean.
ExpressionTree - class Opus5.ExpressionTree.: Represents a binary expression as a binary tree.
ExpressionTree(char) - Constructor for class Opus5.ExpressionTree: Constructs a ExpressionTree that consists of a single (leaf) node with the specified label.
extract() - Method in class Opus5.LinkedList.Element: Extracts this list element fromt the linked list.
extract(Object) - Method in class Opus5.LinkedList: Extracts from this linked list the list element that contains the specified object.

F

f(Object) - Method in class Opus5.AbstractHashTable: Returns the hashcode for the specified object.
factorial(int) - Static method in class Opus5.Example: Returns the factorial of n.
female - Variable in class Opus5.Person: Sex: female
fibonacci(int) - Static method in class Opus5.Example: Returns the nth Fibonacci number.
fibonacci(int, int) - Static method in class Opus5.Example: Returns the nth Fibonacci number of order k.
fibonacci2(int) - Static method in class Opus5.Example: Returns the nth Fibonacci number.
fibonacci3(int) - Static method in class Opus5.Example: Returns the nth Fibonacci number.
fill - Variable in class Opus5.SparseMatrixAsArray: The maximum number of non-zero entries in any row of the sparse matrix.
find(Comparable) - Method in class Opus5.BinarySearchTree: Returns the object in this binary search tree that matches the specified object.
find(Comparable) - Method in interface Opus5.SearchableContainer: Finds an object in this container that equals the specified object.
find(Comparable) - Method in class Opus5.OrderedListAsLinkedList: Finds an object in this ordered list that matches the specified object.
find(Comparable) - Method in class Opus5.MWayTree: Finds an object in this M-way tree that matches the specified object.
find(Comparable) - Method in class Opus5.AbstractSet: Not a valid operation on sets or multisets.
find(Comparable) - Method in class Opus5.PartitionAsForest: Finds the element of this partition that contains the specified element of the universal set.
find(Comparable) - Method in class Opus5.ChainedScatterTable: Finds an object in this chained scatter table that matches the specified object.
find(Comparable) - Method in class Opus5.OpenScatterTable: Finds an object in this open scatter table that matches the specified object.
find(Comparable) - Method in class Opus5.ChainedHashTable: Returns an object in this chained hash table that matches the specified comparable object.
find(Comparable) - Method in class Opus5.OrderedListAsArray: Finds an object in this ordered list that matches the specified object.
find(Comparable) - Method in class Opus5.SortedListAsArray: Finds an object in this sorted list that matches the specified object.
find(int) - Method in class Opus5.PartitionAsForest: Finds the element of this partition that contains the specified element of the universal set.
find(int) - Method in class Opus5.PartitionAsForestV2: Finds the element of this partition that contains the specified element of the universal set.
find(int) - Method in interface Opus5.Partition: Returns the element of this partition that contains the specified item.
findElement(Comparable) - Method in class Opus5.SortedListAsLinkedList: Finds the linked list element in this sorted list of a comparable object that matches the specified comparable object.
findIndex(Comparable) - Method in class Opus5.MWayTree: Finds the position of the specified object in the array of keys contained in this M-way tree node.
findInstance(Comparable) - Method in class Opus5.OpenScatterTable: Finds the position of the specified object in this open scatter table.
findMatch(Comparable) - Method in class Opus5.OpenScatterTable: Finds the position of an object in this open scatter table that matches the given object.
findMax() - Method in class Opus5.BinarySearchTree: Returns the "largest" object in this binary search tree.
findMax() - Method in class Opus5.MWayTree: Finds the "largest" key in this M-way tree.
findMax() - Method in interface Opus5.DoubleEndedPriorityQueue: Returns the "largest" object contained in the priority queue.
findMax() - Method in class Opus5.Deap: Returns the "largest" object in this deap.
findMax() - Method in interface Opus5.SearchTree: Returns the "largest" object in this tree.
findMaximum(int[]) - Static method in class Opus5.Example: Returns the largest integer in an array of nfindMin() - Method in class Opus5.LeftistHeap; Returns the "smallest" object in this leftist heap.
findMin() - Method in class Opus5.BinarySearchTree: Returns the "smallest" object in this binary search tree.
findMin() - Method in class Opus5.MWayTree: Finds the "smallest" key in this M-way tree.
findMin() - Method in class Opus5.BinomialQueue: Returns the "smallest" object in this binomial queue.
findMin() - Method in class Opus5.Deap: Returns the "smallest" object in this deap.
findMin() - Method in interface Opus5.SearchTree: Returns the "smallest" object in this tree.
findMin() - Method in interface Opus5.PriorityQueue: Returns the "smallest" object in this priority queue.
findMin() - Method in class Opus5.BinaryHeap: Returns the "smallest" object in this heap.
findMinTree() - Method in class Opus5.BinomialQueue: Returns the binomial tree in this binomial queue that has the "smallest" root.
findOffset(Comparable) - Method in class Opus5.SortedListAsArray: Finds the position in this sorted list of a comparable object that matches the specified comparable object.
findPosition(Comparable) - Method in interface Opus5.SortedList: Returns the position in this list of the specified object.
findPosition(Comparable) - Method in class Opus5.OrderedListAsLinkedList: Returns the position of an object in this ordered list that matches the specified object.
findPosition(Comparable) - Method in class Opus5.SortedListAsLinkedList: Returns the position of an object in this sorted list that matches the specified object.
findPosition(Comparable) - Method in interface Opus5.OrderedList: Returns the position in this list of the specified object.
findPosition(Comparable) - Method in class Opus5.OrderedListAsArray: Returns the position of an object in this ordered list that matches the specified object.
findPosition(Comparable) - Method in class Opus5.SortedListAsArray: Returns the position of an object in this sorted list that matches the specified object.
findPosition(int, int) - Method in class Opus5.SparseMatrixAsVector: Finds the position of the (i,j)th matrix entry.
findPosition(int, int) - Method in class Opus5.SparseMatrixAsArray: Finds the position of the (i,j)th matrix entry.
findUnoccupied(Object) - Method in class Opus5.OpenScatterTable: Finds the position of an unoccupied entry into which the specified object can be stored.
findV2(Comparable) - Method in class Opus5.MWayTree: Finds an object in this M-way tree that matches the specified object.
FloydsAlgorithm(Digraph) - Static method in class Opus5.Algorithms: Floyd's algorithm to solve the all-pairs, shortest path problem for the given edge-weighted, directed graph.
foregroundColor - Variable in class Opus5.GraphicalObject: The foreground color.

G

g(int) - Method in class Opus5.AbstractHashTable: Hashes an integer using the division method of hashing.
gamma() - Static method in class Opus5.Example: Approximates Euler's constant.
GeneralTree - class Opus5.GeneralTree.: A node in a general tree.
GeneralTree(Object) - Constructor for class Opus5.GeneralTree: Constructs a GeneralTree with the specified key.
geometricSeriesSum(int, int) - Static method in class Opus5.Example: Computes the sum the first n terms of a geometric series in x.
geometricSeriesSum2(int, int) - Static method in class Opus5.Example: Computes the sum the first n terms of a geometric series in x.
geometricSeriesSum3(int, int) - Static method in class Opus5.Example: Computes the sum the first n terms of a geometric series in x.
get(int) - Method in interface Opus5.SortedList: Returns the object found at the specified position in this list.
get(int) - Method in class Opus5.OrderedListAsLinkedList: Returns the object in this ordered list found at the specified offset.
get(int) - Method in class Opus5.Array: Returns the array element at the specified position.
get(int) - Method in interface Opus5.OrderedList: Returns the object found at the specified position in this list.
get(int) - Method in class Opus5.OrderedListAsArray: Returns the object in this ordered lists found at the specified offset.
get(int[]) - Method in class Opus5.MultiDimensionalArray: Returns the object in this multi-dimensional array at the position specified by the specified indices.
get(int, int) - Method in interface Opus5.Matrix: Returns the element of this matrix at position (i,j).
get(int, int) - Method in class Opus5.SparseMatrixAsLinkedList: Returns the value in this matrix at the specified position.
get(int, int) - Method in class Opus5.DenseMatrix: Returns the value in this matrix at the specified position.
get(int, int) - Method in class Opus5.SparseMatrixAsVector: Returns the value in this matrix at the specified position.
get(int, int) - Method in class Opus5.SparseMatrixAsArray: Returns the value in this matrix at the specified position.
getBalanceFactor() - Method in class Opus5.AVLTree: Returns the balance factor for this node.
getBase() - Method in class Opus5.Array: Returns the base of this array.
getBound() - Method in interface Opus5.Solution: Returns a lower-bound on the value of the objective function for this solution and all other solutions in the solution space that can be derived from this solution.
getBound() - Method in class Opus5.ScalesBalancingProblem.Node: Returns a lower bound on the objective function for this node and all possible descendants of this node in the solution space.
getBound() - Method in class Opus5.ZeroOneKnapsackProblem.Node: Returns a lower bound on the objective function for this node and all possible descendants of this node in the solution space.
getChild(int) - Method in class Opus5.Parent: Returns the specified child of this parent.
getCoefficient() - Method in class Opus5.Term: Returns the coefficient of this term.
getCount() - Method in class Opus5.AbstractContainer: Returns the number of objects in this container.
getCount() - Method in class Opus5.AbstractTree: Returns the number of internal nodes in this tree.
getCount() - Method in class Opus5.MWayTree: Returns the number of keys in this M-way tree.
getCount() - Method in class Opus5.MultisetAsLinkedList: Returns the number of elements in this multiset.
getCount() - Method in interface Opus5.Container: Returns the number of objects in this container.
getCount() - Method in class Opus5.BinomialQueue.BinomialTree: Returns the number of objects contained in this binomial tree.
getCount() - Method in class Opus5.SetAsArray: Returns the number of elements in this set.
getCount() - Method in class Opus5.SetAsBitVector: Returns the number of elements in this set.
getCount() - Method in class Opus5.MultisetAsArray: Returns the number of elements in this multiset.
getData() - Method in class Opus5.Array: Returns the data field.
getDatum() - Method in class Opus5.OrderedListAsLinkedList.MyCursor: Returns the object in the ordered list at this position.
getDatum() - Method in class Opus5.LinkedList.Element: Returns the object in this list element.
getDatum() - Method in interface Opus5.Cursor: Returns the object found at the position of this cursor in the list.
getDatum() - Method in class Opus5.OrderedListAsArray.MyCursor: Returns the object in the ordered list at this position.
getDegree() - Method in class Opus5.GeneralTree: Returns the degree of this node.
getDegree() - Method in class Opus5.BinaryTree: Returns the degree of this node.
getDegree() - Method in class Opus5.NaryTree: Returns the degree of this N-ary tree node.
getDegree() - Method in class Opus5.MWayTree: Returns the degree of this M-way tree node.
getDegree() - Method in class Opus5.PartitionAsForest.PartitionTree: Returns the degree of this partition tree node.
getDegree() - Method in interface Opus5.Tree: Returns the degree of this tree node.
getEdge(int, int) - Method in class Opus5.GraphAsMatrix: Returns the edge that connects the specified vertices.
getEdge(int, int) - Method in class Opus5.GraphAsLists: Returns the edge in this graph that connects the specified vertices.
getEdge(int, int) - Method in interface Opus5.Graph: Returns the edge that connects the two vertices specified by their vertex numbers.
getEdges() - Method in class Opus5.GraphAsMatrix: Returns an enumeration that enumerates the edges in this graph.
getEdges() - Method in class Opus5.DigraphAsMatrix: Returns an enumeration that enumerates the edges in this graph.
getEdges() - Method in class Opus5.GraphAsLists: Returns an enumeration that enumerates the edges of this graph.
getEdges() - Method in interface Opus5.Graph: Returns an enumeration that enumerates the edges in this graph.
getEmanatingEdges() - Method in class Opus5.AbstractGraph.GraphVertex: Returns an enumeration that enumerates the edges in this graph that emanate from this vertex.
getEmanatingEdges() - Method in interface Opus5.Vertex: Returns an enumeration that enumerates the edges emanating from this vertex.
getEmanatingEdges(int) - Method in class Opus5.AbstractGraph: Returns an enumeration that enumerates the edges that emanate from the specified vertex.
getEmanatingEdges(int) - Method in class Opus5.GraphAsMatrix: Returns an enumeration that enumerates the edges that emanate from the specified vertex.
getEmanatingEdges(int) - Method in class Opus5.GraphAsLists: Returns an enumeration that enumerates the edges that emanate from the specified vertex in this graph.
getEnumeration() - Method in class Opus5.AbstractTree: Returns an enumeration that enumerates the keys in this tree.
getEnumeration() - Method in class Opus5.OrderedListAsLinkedList: Returns an enumeration that enumerates the objects in this ordered list in order.
getEnumeration() - Method in class Opus5.MWayTree: Returns an enumeration that enumerates the keys in this M-way tree.
getEnumeration() - Method in class Opus5.QueueAsLinkedList: Returns an enumeration that enumerates the objects in this queue.
getEnumeration() - Method in class Opus5.PartitionAsForest: Returns an enumeration that enumerates the elements of this partition.
getEnumeration() - Method in class Opus5.AbstractGraph: Returns an enumeration that enumerates the vertices in this graph.
getEnumeration() - Method in class Opus5.ChainedScatterTable: Returns an enumeration that enumerates the objects in this chained scatter table.
getEnumeration() - Method in class Opus5.MultisetAsLinkedList: Returns an enumeration that enumerates the elements of this multiset.
getEnumeration() - Method in class Opus5.StackAsLinkedList: Returns an enumeration that enumerates the objects in this stack.
getEnumeration() - Method in interface Opus5.Container: Returns an enumeration that enumerates the objects in this container.
getEnumeration() - Method in class Opus5.QueueAsArray: Returns an enumeration that enumerates the objects in this queue.
getEnumeration() - Method in class Opus5.OpenScatterTable: Returns an enumeration that enumerates the objects in this open scatter table.
getEnumeration() - Method in class Opus5.StackAsArray: Returns an enumberation that enumerates the objects in this stack.
getEnumeration() - Method in class Opus5.ChainedHashTable: Returns an enumeration that enumerates all the object contained in this chained hash table.
getEnumeration() - Method in class Opus5.OrderedListAsArray: Returns an enumeration that enumerates the objects in this ordered list in order.
getEnumeration() - Method in class Opus5.BinomialQueue: Returns an enumeration that enumerates the objects contained in this binomial queue.
getEnumeration() - Method in class Opus5.SetAsArray: Returns an enumeration that enumerates the elements of this set.
getEnumeration() - Method in class Opus5.PartitionAsForest.PartitionTree: Returns an enumeration that enumerates the elements of this partition tree.
getEnumeration() - Method in class Opus5.SetAsBitVector: Returns an enumeration that enumerates the elements of this set.
getEnumeration() - Method in class Opus5.Deap: Returns an enumeration that enumerates all the objects in this deap.
getEnumeration() - Method in class Opus5.MultisetAsArray: Returns an enumeration that enumerates the elements of this multiset.
getEnumeration() - Method in class Opus5.BinaryHeap: Returns an enumeration that enumerates all the objects in this heap.
getExponent() - Method in class Opus5.Term: Returns the exponent of this term.
getFirst() - Method in class Opus5.LinkedList: Returns the object contained in the first list element.
getHead() - Method in interface Opus5.Queue: Returns the object at the head of the queue.
getHead() - Method in class Opus5.QueueAsLinkedList: Returns the object at the head of this queue.
getHead() - Method in interface Opus5.Deque: Returns the object at the head of the deque.
getHead() - Method in class Opus5.QueueAsArray: Returns the object at the head of this queue.
getHead() - Method in class Opus5.LinkedList: Returns the head of this linked list.
getHeight() - Method in class Opus5.AbstractTree: Returns the height in the tree of this tree node.
getHeight() - Method in class Opus5.AVLTree: Returns the height of this AVL tree node.
getHeight() - Method in class Opus5.PartitionAsForest.PartitionTree: Returns the height (rank) of this partition tree.
getHeight() - Method in interface Opus5.Tree: Returns the height in the tree of this tree node.
getImag() - Method in class Opus5.Complex: Returns the imaginary part of this complex number.
getIncidentEdges() - Method in class Opus5.AbstractGraph.GraphVertex: Returns an enumeration that enumerates the edges in this graph that are incident upon this vertex.
getIncidentEdges() - Method in interface Opus5.Vertex: Returns an enumeration that enumerates the edges incident on this vertex.
getIncidentEdges(int) - Method in class Opus5.AbstractGraph: Returns an enumeration that enumerates the edges incident upon the specified vertex.
getIncidentEdges(int) - Method in class Opus5.GraphAsMatrix: Returns an enumeration that enumerates the edges that are incident upon the specified vertex.
getIncidentEdges(int) - Method in class Opus5.GraphAsLists: Returns an enumeration that enumerates the edges incident upon the specified vertex in this graph.
getKey() - Method in class Opus5.GeneralTree: Returns the key of this general tree node.
getKey() - Method in class Opus5.BinaryTree: Returns the key in this node.
getKey() - Method in class Opus5.NaryTree: Returns the key of this N-ary tree node.