The structure Package Source
Press on the desired source file to view the code.
- Assert.java
-
Routines used for testing assertions. Used in structure package.
- Association.java
-
A class for binding key/value pairs.
- BTInorderIterator.java
-
In-order iterator for binary trees.
- BTLevelorderIterator.java
-
Level-order iterator for binary trees.
- BTPostorderIterator.java
-
Post-order iterator for binary trees.
- BTPreorderIterator.java
-
Pre-order iterator for binary trees.
- BinarySearchTree.java
-
This is an implementation of binary search trees.
- BinaryTree.java
-
An interface for Binary Trees.
- BinaryTreeNode.java
-
An implementation of nodes for use in binary trees.
- BitSet.java
-
A simple bitset class.
- ChainedHashtable.java
-
An implementation of hashtables, using external chaining
- CharSet.java
-
A simple CharSet class.
- CircularList.java
-
Implementation of circular lists, using singly linked elements.
- Clock.java
-
A simple clock for use in timing things.
- Collection.java
-
An interface for the basic store operations.
- ComparableAssociation.java
-
A class for structuring associations that may be compared.
- ComparableEdge.java
-
Generic base class for describing edges in graphs.
- ComparableSet.java
-
A set implemented using an ordered structure.
- Dictionary.java
-
An interface for Dictionaries, much like java.util.Dictionary.
- DoublyLinkedList.java
-
Implementation of lists, using doubly linked elements.
- DoublyLinkedListElement.java
-
Elements used in implementation of doubly linked lists.
- Edge.java
-
Generic base class for describing edges in graphs.
- Graph.java
-
The interface for Graphs.
- GraphList.java
-
Graph, implemented with an Adjacency List
- GraphListDirected.java
-
Graph, implemented with an adjacency list
- GraphListUndirected.java
-
Graph, implemented with an adjacency list
- GraphMatrix.java
-
Graph, implemented with an adjacency matrix
- GraphMatrixDirected.java
-
Graph, implemented with an adjacency matrix
- GraphMatrixUndirected.java
-
Graph, implemented with an adjacency matrix
- Hashtable.java
-
An implementation of Dictionaries, using hash tables.
- Iterator.java
-
Abstract iteration class. Like enumerable, but values are ordered.
- KeyIterator.java
-
Implementation of key- iterators for driving Association iterators.
- Linear.java
-
An interface for LIFO/FIFO structures.
- List.java
-
Interface for lists.
- Matrix.java
-
An implementation of a rectangular vector.
- OrderedDictionary.java
-
An interface for Dictionaries whose keys are ordered.
- OrderedList.java
-
An implementation of an ordered structure, using lists.
- OrderedStructure.java
-
Interface for container classes that manipulated ordered structures.
- OrderedVector.java
-
An implementation of and ordered structure, based on vectors.
- PriorityQueue.java
-
An interface for an ordered structure that allows you to remove min elts
- PriorityVector.java
-
An implementation of priority queues that makes use of ordering vectors.
- Queue.java
-
Interface for queues.
- QueueArray.java
-
An implementation of queues, based on arrays.
- QueueList.java
-
Implementation of queues using doubly linked lists.
- QueueVector.java
-
An implementation of queues, based on vectors.
- ReadStream.java
-
A stream for reading basic types from input.
- Set.java
-
A simple Set interface.
- SetList.java
-
A set implemented using lists. Fairly slow, but works on non-Comparables.
- SinglyLinkedList.java
-
Implementation of lists, using singly linked elements.
- SinglyLinkedListElement.java
-
Implementation of a node of a singly linked list.
- SinglyLinkedListIterator.java
-
Implementation of an iterator for elements of a singly linked list.
- SkewHeap.java
-
Implementation of priority queues/heaps using binary trees.
- SplayTree.java
-
This is a implementation of splay trees, in Java.
- Stack.java
-
The interface for stacks.
- StackArray.java
-
An implementation of stacks, using vectors.
- StackList.java
-
An implementation of stacks using lists.
- StackVector.java
-
An implementation of stacks, using vectors.
- Store.java
-
Interface for classes that store multiple values.
- Table.java
-
An implementation of an OrderedDictionary.
- UnionFind.java
-
A forest implementation of the Union-Find structure.
- ValueIterator.java
-
Implementation of value- iterators for driving Association iterators.
- Vector.java
-
An implementation of Vectors, similar to that defined in java.utils
- VectorHeap.java
-
An implementation of a priority queue in a vector.
- Vertex.java
-
Vertex base class, to be extended as needed.
Send comments to Duane
A. Bailey.