📄 index.html
字号:
<html><head><title>The structure Package Source</title></head><body bgcolor="#ffffff"><h1 align=center>The <code>structure</code> Package Source</h1>Press on the desired filename to view the code. To download the filepress and hold mouse down on link and select "download to disk" frompopup menu.<dl> <dt><a href="AbstractIterator.java">AbstractIterator.java</a><dd> Abstract base class for portable iterator and enumeration implementation. <dt><a href="AbstractLinear.java">AbstractLinear.java</a><dd> An abstract implementation of LIFO/FIFO structures. <dt><a href="AbstractList.java">AbstractList.java</a><dd> <dt><a href="AbstractListIterator.java">AbstractListIterator.java</a><dd> <dt><a href="AbstractMap.java">AbstractMap.java</a><dd> <dt><a href="AbstractQueue.java">AbstractQueue.java</a><dd> The interface for stacks. <dt><a href="AbstractSet.java">AbstractSet.java</a><dd> A start at the implementation of a Set. <dt><a href="AbstractStack.java">AbstractStack.java</a><dd> An abstract implementation of stacks. <dt><a href="AbstractStructure.java">AbstractStructure.java</a><dd> A basic, abstract implementation of a Structure. <dt><a href="AppendableList.java">AppendableList.java</a><dd> <dt><a href="ArrayIterator.java">ArrayIterator.java</a><dd> <dt><a href="Assert.java">Assert.java</a><dd> Routines used for testing assertions. <dt><a href="Association.java">Association.java</a><dd> A class for binding key/value pairs. <dt><a href="BTInorderIterator.java">BTInorderIterator.java</a><dd> In-order iterator for binary trees. <dt><a href="BTLevelorderIterator.java">BTLevelorderIterator.java</a><dd> Level-order iterator for binary trees. <dt><a href="BTPostorderIterator.java">BTPostorderIterator.java</a><dd> Post-order iterator for binary trees. <dt><a href="BTPreorderIterator.java">BTPreorderIterator.java</a><dd> Pre-order iterator for binary trees. <dt><a href="BinarySearchTree.java">BinarySearchTree.java</a><dd> This is an implementation of binary search trees. <dt><a href="BinaryTree.java">BinaryTree.java</a><dd> An implementation of nodes for use in binary trees. <dt><a href="BitSet.java">BitSet.java</a><dd> A simple bitset class. <dt><a href="ChainedHashtable.java">ChainedHashtable.java</a><dd> An implementation of hashtables, using external chaining <dt><a href="ChainedHashtableIterator.java">ChainedHashtableIterator.java</a><dd> <dt><a href="CharSet.java">CharSet.java</a><dd> A simple CharSet class. <dt><a href="CircularList.java">CircularList.java</a><dd> Implementation of circular lists, using singly linked elements. <dt><a href="CircularListIterator.java">CircularListIterator.java</a><dd> A private iterator for circular lists. <dt><a href="Clock.java">Clock.java</a><dd> A simple clock for use in timing things. <dt><a href="ComparableAssociation.java">ComparableAssociation.java</a><dd> A class for structuring associations that may be compared. <dt><a href="ComparableEdge.java">ComparableEdge.java</a><dd> Generic base class for describing edges in graphs. <dt><a href="DoublyLinkedList.java">DoublyLinkedList.java</a><dd> Implementation of lists, using doubly linked elements. <dt><a href="DoublyLinkedListElement.java">DoublyLinkedListElement.java</a><dd> Elements used in implementation of doubly linked lists. <dt><a href="DoublyLinkedListIterator.java">DoublyLinkedListIterator.java</a><dd> <dt><a href="Edge.java">Edge.java</a><dd> Generic base class for describing edges in graphs. <dt><a href="Entry.java">Entry.java</a><dd> <dt><a href="FailedAssertion.java">FailedAssertion.java</a><dd> <dt><a href="FailedInvariant.java">FailedInvariant.java</a><dd> <dt><a href="FailedPostcondition.java">FailedPostcondition.java</a><dd> <dt><a href="FailedPrecondition.java">FailedPrecondition.java</a><dd> <dt><a href="Graph.java">Graph.java</a><dd> The interface for Graphs. <dt><a href="GraphList.java">GraphList.java</a><dd> Graph, implemented with an Adjacency List <dt><a href="GraphListAIterator.java">GraphListAIterator.java</a><dd> <dt><a href="GraphListDirected.java">GraphListDirected.java</a><dd> Graph, implemented with an adjacency list <dt><a href="GraphListEIterator.java">GraphListEIterator.java</a><dd> <dt><a href="GraphListUndirected.java">GraphListUndirected.java</a><dd> Graph, implemented with an adjacency list <dt><a href="GraphListVertex.java">GraphListVertex.java</a><dd> <dt><a href="GraphMatrix.java">GraphMatrix.java</a><dd> Graph, implemented with an adjacency matrix <dt><a href="GraphMatrixDirected.java">GraphMatrixDirected.java</a><dd> Graph, implemented with an adjacency matrix <dt><a href="GraphMatrixUndirected.java">GraphMatrixUndirected.java</a><dd> Graph, implemented with an adjacency matrix <dt><a href="GraphMatrixVertex.java">GraphMatrixVertex.java</a><dd> <dt><a href="Hashtable.java">Hashtable.java</a><dd> An implementation of Dictionaries, using hash tables. <dt><a href="HashtableIterator.java">HashtableIterator.java</a><dd> <dt><a href="KeyIterator.java">KeyIterator.java</a><dd> Implementation of key- iterators for driving Association iterators. <dt><a href="Linear.java">Linear.java</a><dd> An interface for LIFO/FIFO structures. <dt><a href="List.java">List.java</a><dd> Interface for lists. <dt><a href="Map.java">Map.java</a><dd> <dt><a href="MapList.java">MapList.java</a><dd> <dt><a href="Matrix.java">Matrix.java</a><dd> An implementation of a rectangular vector. <dt><a href="MergeableHeap.java">MergeableHeap.java</a><dd> <dt><a href="NaturalComparator.java">NaturalComparator.java</a><dd> A comparator that implements the natural ordering. <dt><a href="OrderedList.java">OrderedList.java</a><dd> An implementation of an ordered structure, using lists <dt><a href="OrderedMap.java">OrderedMap.java</a><dd> <dt><a href="OrderedStructure.java">OrderedStructure.java</a><dd> Interface for container classes that manipulated ordered structures. <dt><a href="OrderedVector.java">OrderedVector.java</a><dd> An implementation of and ordered structure, based on vectors. <dt><a href="PriorityQueue.java">PriorityQueue.java</a><dd> An interface for an ordered structure that allows you to remove min elts <dt><a href="PriorityVector.java">PriorityVector.java</a><dd> An implementation of priority queues that makes use of ordering vectors. <dt><a href="Queue.java">Queue.java</a><dd> Interface for queues. <dt><a href="QueueArray.java">QueueArray.java</a><dd> An implementation of queues, based on arrays. <dt><a href="QueueList.java">QueueList.java</a><dd> Implementation of queues using linked lists. <dt><a href="QueueVector.java">QueueVector.java</a><dd> An implementation of queues, based on vectors. <dt><a href="ReadStream.java">ReadStream.java</a><dd> A stream for reading basic types from input. <dt><a href="RedBlackIterator.java">RedBlackIterator.java</a><dd> In-order iterator for RedBlack trees. <dt><a href="RedBlackSearchTree.java">RedBlackSearchTree.java</a><dd> This is an implementation of binary search trees. <dt><a href="RedBlackTree.java">RedBlackTree.java</a><dd> An implementation of red-black trees. <dt><a href="ReverseComparator.java">ReverseComparator.java</a><dd> A comparator that implements the reverse of another Comparator. <dt><a href="Set.java">Set.java</a><dd> A simple Set interface. <dt><a href="SetList.java">SetList.java</a><dd> A set implemented using lists. Fairly slow, but works on non-Comparables. <dt><a href="SetVector.java">SetVector.java</a><dd> A set implemented using vectors. Slow, but works on non-Comparables. <dt><a href="SinglyLinkedList.java">SinglyLinkedList.java</a><dd> Implementation of lists, using singly linked elements. <dt><a href="SinglyLinkedListElement.java">SinglyLinkedListElement.java</a><dd> Implementation of a node of a singly linked list. <dt><a href="SinglyLinkedListIterator.java">SinglyLinkedListIterator.java</a><dd> Implementation of an iterator for elements of a singly linked list. <dt><a href="SkewHeap.java">SkewHeap.java</a><dd> Implementation of priority queues/heaps using binary trees. <dt><a href="SplayTree.java">SplayTree.java</a><dd> This is a implementation of splay trees, in Java. <dt><a href="SplayTreeIterator.java">SplayTreeIterator.java</a><dd> An implementation of an iterator for SplayTrees <dt><a href="Stack.java">Stack.java</a><dd> The interface for stacks. <dt><a href="StackArray.java">StackArray.java</a><dd> An implementation of stacks, using vectors. <dt><a href="StackList.java">StackList.java</a><dd> An implementation of stacks using lists. <dt><a href="StackVector.java">StackVector.java</a><dd> An implementation of stacks, using vectors. <dt><a href="StructCollection.java">StructCollection.java</a><dd> A class that converts a Structure to a Collection <dt><a href="Structure.java">Structure.java</a><dd> Interface of a basic, mutable data structure. <dt><a href="Table.java">Table.java</a><dd> An implementation of an OrderedDictionary. <dt><a href="ValueIterator.java">ValueIterator.java</a><dd> Implementation of value- iterators for driving Association iterators. <dt><a href="Vector.java">Vector.java</a><dd> An implementation of extensible arrays. <dt><a href="VectorHeap.java">VectorHeap.java</a><dd> An implementation of a priority queue in a vector. <dt><a href="VectorIterator.java">VectorIterator.java</a><dd> A private class implementing an iterator over a Vector. <dt><a href="Version.java">Version.java</a><dd> The version of this release. <dt><a href="Vertex.java">Vertex.java</a><dd> Vertex base class, to be extended as needed. <dt><a href="copyright.html">copyright.html</a><dd> <dt><a href="package.html">package.html</a><dd></dl><hr><center>Send comments to <a href="mailto:bailey@cs.williams.edu">DuaneA. Bailey</a>.</center></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -