|
||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
Graph<V,E> | The interface describing all Graph objects. |
Linear<ELTTYPE> | An interface describing the behavior of linear data structures, structures that that have completely determined add and remove methods. |
List<ELTTYPE> | Interface describing lists. |
Map<K,V> | Associations establish a link between a key and a value. |
MergeableHeap<ELTTYPE extends Comparable<ELTTYPE>> | Interface describing mergeable min heaps. |
OrderedMap<K,V> | An interface the supports a Map whose values are kept in increasing order. |
OrderedStructure<K> | An interface that supports a Collection whose values are kept in increasing order. |
PriorityQueue<ELTTYPE extends Comparable<ELTTYPE>> | Interface describing an queue of prioritized values. |
Queue<ELTTYPE> | Interface describing a first-in, first-out structure. |
Set<ELTTYPE> | Implementation of a set of elements. |
Stack<ELTTYPE> | An interface describing a Last-In, First-Out structure. |
Structure<ELTTYPE> | The interface of a basic, mutable data structure. |
Class Summary | |
---|---|
AbstractIterator<ELTTYPE> | Abstract base class for portable iterator and enumeration implementation. |
AbstractLinear<ELTTYPE> | An abstract implemtation of linear data structures. |
AbstractList<ELTTYPE> | An abstract structure implementing features common to all list-like structures in this package. |
AbstractListIterator<ELTTYPE> | Base class for the implementation of a list Iterator. |
AbstractMap<K,V> | Associations establish a link between a key and a value. |
AbstractQueue<ELTTYPE> | An abstract structure implementing features common to all first-in, first-out structures in this package. |
AbstractSet<ELTTYPE> | Methods common to an Implementation of a set of elements irrespective of the underlying storage mechanism. |
AbstractStack<ELTTYPE> | An abstract structure implementing features common to all Last-In, First-Out structures in this package. |
AbstractStructure<ELTTYPE> | An abstract implementation of a basic, mutable data structure. |
ArrayIterator<ELTTYPE> | 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<K,V> | A class implementing a key-value pair. |
BinarySearchTree<ELTTYPE extends Comparable<ELTTYPE>> | A binary search tree structure. |
BinaryTree<ELTTYPE> | This class implements a single node of a binary tree. |
BitSet | Implementation of a set of numbered bits. |
ChainedHashtable<K,V> | This class implements a hash table whose collisions are resolved through external chaining. |
CharSet | Implementation of a set of characters whose ASCII values are between 0 and 255, inclusive. |
CircularList<ELTTYPE> | An implementation of lists using circularly linked elements,
similar to that of java.util.LinkedList . |
Clock | A simple object for measuring time. |
ComparableAssociation<K extends Comparable<K>,V> | A class implementing a comparable key-value pair. |
ComparableEdge<V,E extends Comparable<E>> | A class implementing common edge type among graphs. |
DoublyLinkedList<ELTTYPE> | An implementation of lists using doubly linked elements, similar to that of java.util.LinkedList . |
DoublyLinkedListElement<ELTTYPE> | A class supporting a doubly linked list element. |
DoublyLinkedListIterator<ELTTYPE> | An iterator for traversing the elements of a doubly linked list. |
Edge<V,E> | A class implementing common edge type among graphs. |
Entry<K,V> | 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<V,E> | Implementation of graph using adjacency lists. |
GraphListDirected<V,E> | A GraphListDirected is a list-based graph representation that consists of a collection of vertices and directed edges. |
GraphListUndirected<V,E> | A GraphListUndirected is a list-based graph representation that consists of a collection of vertices and undirected edges. |
GraphMatrix<V,E> | Implementation of graph using adjacency matrices. |
GraphMatrixDirected<V,E> | A GraphMatrixDirected is a matrix-based graph representation that consists of a collection of vertices and directed edges. |
GraphMatrixUndirected<V,E> | A GraphMatrixUndirected is a matrix-based graph representation that consists of a collection of vertices and undirected edges. |
Hashtable<K,V> | Implements a dictionary as a table of hashed key-value pairs. |
MapList<K,V> | Associations establish a link between a key and a value. |
Matrix<ELTTYPE> | An implementation of rectangular vectors. |
NaturalComparator<ELTTYPE extends Comparable<ELTTYPE>> | Implementation of the Comparator interface that
provides a NaturalComparator.compare(ELTTYPE, ELTTYPE) method that compares two objects using those
objects default compareTo methods. |
OrderedList<ELTTYPE extends Comparable<ELTTYPE>> | A class that implements a collection of values that are kept in order. |
OrderedVector<ELTTYPE extends Comparable<ELTTYPE>> | Implementation of an ordered structure implemented using a vector. |
PriorityVector<ELTTYPE extends Comparable<ELTTYPE>> | A vector-based implementation of a priority queue. |
QueueArray<ELTTYPE> | An implementation of queues based on arrays. |
QueueList<ELTTYPE> | An implementation of queues based on circular lists. |
QueueVector<ELTTYPE> | An implementation of queues based on vectors. |
ReadStream | A ReadStream provides reasonable access to the typewritten data on an input stream. |
RedBlackSearchTree<ELTTYPE extends Comparable<ELTTYPE>> | Red black trees, are binary trees that guarantee the following three properties. |
RedBlackTree<ELTTYPE extends Comparable<ELTTYPE>> | This class implements a single node of a red-black tree. |
ReverseComparator<ELTTYPE extends Comparable<ELTTYPE>> | Implementation of the Comparator interface that
provides a Comparator.compare(Object,Object) method that compares
two objects using those objects default compareTo methods. |
SetList<ELTTYPE> | Implementation of a set of elements using a list as the underlying storage mechanism. |
SetVector<ELTTYPE> | Implementation of a set of elements using a vector as the underlying storage mechanism. |
SinglyLinkedList<ELTTYPE> | An implementation of lists using singly linked elements, similar to that of java.util.LinkedList . |
SinglyLinkedListElement<ELTTYPE> | A class supporting a singly linked list element. |
SkewHeap<ELTTYPE extends Comparable<ELTTYPE>> | An implementation of a priority queue using skew heaps. |
SplayTree<ELTTYPE extends Comparable<ELTTYPE>> | An implementation of binary search trees, based on a splay operation by Tarjan et al. |
StackArray<ELTTYPE> | An implementation of a stack, based on array. |
StackList<ELTTYPE> | An implementation of a stack, based on lists. |
StackVector<ELTTYPE> | An implementation of a stack, based on extensible arrays. |
StructCollection<ELTTYPE> | This utility class converts a Structure to a Collection. |
Table<K extends Comparable<K>,V> | An implementation of an ordered dictionary. |
Vector<ELTTYPE> | An implementation of extensible arrays, similar to that of java.util.Vector . |
VectorHeap<ELTTYPE extends Comparable<ELTTYPE>> | This class implements a priority queue based on a traditional array-based heap. |
Version | A utility class that can be used to determine the version of software currently being used. |
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.
|
||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |