Package structure

This package is for use with Duane Bailey's Java Structures text, from McGraw-Hill.

See:
Description

Interface Summary

Graph	The interface describing all Graph objects.
Linear	An interface describing the behavior of linear data structures, structures that that have completely determined add and remove methods.
List	Interface describing lists.
Map	Associations establish a link between a key and a value.
MergeableHeap	Interface describing mergeable min heaps.
OrderedMap	An interface the supports a Map whose values are kept in increasing order.
OrderedStructure	An interface that supports a Collection whose values are kept in increasing order.
PriorityQueue	Interface describing an queue of prioritized values.
Queue	Interface describing a first-in, first-out structure.
Set	Implementation of a set of elements.
Stack	An interface describing a Last-In, First-Out structure.
Structure	The interface of a basic, mutable data structure.

Class Summary

AbstractIterator	Abstract base class for portable iterator and enumeration implementation.
AbstractLinear	An abstract implemtation of linear data structures.
AbstractList	An abstract structure implementing features common to all list-like structures in this package.
AbstractListIterator	Base class for the implementation of a list Iterator.
AbstractMap	Associations establish a link between a key and a value.
AbstractQueue	An abstract structure implementing features common to all first-in, first-out structures in this package.
AbstractSet	Methods common to an Implementation of a set of elements irrespective of the underlying storage mechanism.
AbstractStack	An abstract structure implementing features common to all Last-In, First-Out structures in this package.
AbstractStructure	An abstract implementation of a basic, mutable data structure.
AppendableList	An extension of the circular list class that provides an operation for merging an object of this type with a CircularList in constant time.
ArrayIterator	A conveniece class that provies a mechanism to iterate over arrays that is analogous to the iteration techniques employed by the structures in this package.
Assert	A library of assertion testing and debugging procedures.
Association	A class implementing a key-value pair.
BinarySearchTree	A binary search tree structure.
BinaryTree	This class implements a single node of a binary tree.
BitSet	Implementation of a set of numbered bits.
BTInorderIterator	An iterator for traversing binary trees constructed from BinaryTrees.
BTLevelorderIterator	An iterator for traversing binary trees constructed from BinaryTrees.
BTPostorderIterator	This class implements a post-order traversal of a binary tree.
BTPreorderIterator	This class implements an iterator that traverses a tree in pre-order.
ChainedHashtable	This class implements a hash table whose collisions are resolved through external chaining.
ChainedHashtableIterator	A traversal of all the elements as they appear in a chained hashtable.
CharSet	Implementation of a set of characters whose ASCII values are between 0 and 255, inclusive.
CircularList	An implementation of lists using circularly linked elements, similar to that of java.util.LinkedList.
CircularListIterator	An iterator for traversing the elements of a circular list.
Clock	A simple object for measuring time.
ComparableAssociation	A class implementing a comparable key-value pair.
ComparableEdge	A class implementing common edge type among graphs.
DoublyLinkedList	An implementation of lists using doubly linked elements, similar to that of java.util.LinkedList.
DoublyLinkedListElement	A class supporting a doubly linked list element.
DoublyLinkedListIterator	An iterator for traversing the elements of a doubly linked list.
Edge	A class implementing common edge type among graphs.
Entry	An implementation of the the java.util.Map.Entry interface, Entry is a simple key value pair, from which both the key and the value can be accessed.
GraphList	Implementation of graph using adjacency lists.
GraphListAIterator	An adjacent vertex iterator.
GraphListDirected	A GraphListDirected is a list-based graph representation that consists of a collection of vertices and directed edges.
GraphListEIterator	An iterator over all edges.
GraphListUndirected	A GraphListUndirected is a list-based graph representation that consists of a collection of vertices and undirected edges.
GraphListVertex	A private implementation of a vertex for use in graphs that are internally represented as a list.
GraphMatrix	Implementation of graph using adjacency matrices.
GraphMatrixDirected	A GraphMatrixDirected is a matrix-based graph representation that consists of a collection of vertices and directed edges.
GraphMatrixUndirected	A GraphMatrixUndirected is a matrix-based graph representation that consists of a collection of vertices and undirected edges.
GraphMatrixVertex	A private implementation of a vertex for use in graphs that are internally represented as a Matrix.
Hashtable	Implements a dictionary as a table of hashed key-value pairs.
HashtableIterator	A traversal of all the elements as they appear in a hashtable.
KeyIterator	A private master iterator for filtering the key fields from an Association-returning iterator.
MapList	Associations establish a link between a key and a value.
Matrix	An implementation of rectangular vectors.
NaturalComparator	Implementation of the Comparator interface that provides a NaturalComparator.compare(java.lang.Object, java.lang.Object) method that compares two objects using those objects default compareTo methods.
OrderedList	A class that implements a collection of values that are kept in order.
OrderedVector	Implementation of an ordered structure implemented using a vector.
PriorityVector	A vector-based implementation of a priority queue.
QueueArray	An implementation of queues based on arrays.
QueueList	An implementation of queues based on circular lists.
QueueVector	An implementation of queues based on vectors.
ReadStream	A ReadStream provides reasonable access to the typewritten data on an input stream.
RedBlackIterator	An iterator for traversing RedBlackSearchTrees constructed from RedBlackTrees.
RedBlackSearchTree	Red black trees, are binary trees that guarantee the following three properties.
RedBlackTree	This class implements a single node of a red-black tree.
ReverseComparator	Implementation of the Comparator interface that provides a ReverseComparator.compare(Object,Object) method that compares two objects using those objects default compareTo methods.
SetList	Implementation of a set of elements using a list as the underlying storage mechanism.
SetVector	Implementation of a set of elements using a vector as the underlying storage mechanism.
SinglyLinkedList	An implementation of lists using singly linked elements, similar to that of java.util.LinkedList.
SinglyLinkedListElement	A class supporting a singly linked list element.
SinglyLinkedListIterator	An iterator for traversing the elements of a singly linked list.
SkewHeap	An implementation of a priority queue using skew heaps.
SplayTree	An implementation of binary search trees, based on a splay operation by Tarjan et al.
SplayTreeIterator	An iterator for traversing splay trees constructed from BinaryTrees.
StackArray	An implementation of a stack, based on array.
StackList	An implementation of a stack, based on lists.
StackVector	An implementation of a stack, based on extensible arrays.
StructCollection	This utility class converts a Structure to a Collection.
Table	An implementation of an ordered dictionary.
ValueIterator	A private master iterator for filtering the value fields from an Association-returning iterator.This iterator returns objects of the Object type, and is publically available throught the Hashtable.iterator() method.
Vector	An implementation of extensible arrays, similar to that of java.util.Vector.
VectorHeap	This class implements a priority queue based on a traditional array-based heap.
VectorIterator	A private class for implementing an iterator over a Vector.
Version	A utility class that can be used to determine the version of software currently being used.
Vertex	A private implementation of a vertex for use in graphs.

Error Summary

FailedAssertion	This error is thrown by the Assert class in the event of any failed assertion test.
FailedInvariant	This error is thrown by the Assert class in the event of a failed invariant test.
FailedPostcondition	This error is thrown by the Assert class in the event of a failed postcondition.
FailedPrecondition	This error is thrown by the Assert class in the event of a failed precondition.

Package structure Description

This package is for use with Duane Bailey's Java Structures text, from McGraw-Hill.

The structures developed within this package are for non-commercial use. They are implementations of common and classic data structures often studied in a data structures course.

This source, its documentation may be freely distributed according to its copyright agreement.