index-all.html

学习JAVA的很好的JAVA包和文档包

<DT><A HREF="structure/Structure.html#clear()"><B>clear()</B></A> - 
Method in interface structure.<A HREF="structure/Structure.html">Structure</A>
<DD>Removes all elements from the structure.
<DT><A HREF="structure/StructCollection.html#clear()"><B>clear()</B></A> - 
Method in class structure.<A HREF="structure/StructCollection.html">StructCollection</A>
<DD>Remove all elements from the Structure.
<DT><A HREF="structure/List.html#clear()"><B>clear()</B></A> - 
Method in interface structure.<A HREF="structure/List.html">List</A>
<DD>Remove all elements of list.
<DT><A HREF="structure/SinglyLinkedList.html#clear()"><B>clear()</B></A> - 
Method in class structure.<A HREF="structure/SinglyLinkedList.html">SinglyLinkedList</A>
<DD>Remove all values from list.
<DT><A HREF="structure/StackArray.html#clear()"><B>clear()</B></A> - 
Method in class structure.<A HREF="structure/StackArray.html">StackArray</A>
<DD>Remove all elements from the stack.
<DT><A HREF="structure/SetVector.html#clear()"><B>clear()</B></A> - 
Method in class structure.<A HREF="structure/SetVector.html">SetVector</A>
<DD>Remove all the elements from the set.
<DT><A HREF="structure/Graph.html#clear()"><B>clear()</B></A> - 
Method in interface structure.<A HREF="structure/Graph.html">Graph</A>
<DD>Remove all vertices (and thus, edges) of the graph.
<DT><A HREF="structure/BitSet.html#clear(int)"><B>clear(int)</B></A> - 
Method in class structure.<A HREF="structure/BitSet.html">BitSet</A>
<DD>Remove bits from set; set size to count.
<DT><A HREF="structure/Clock.html"><B>Clock</B></A> - class structure.<A HREF="structure/Clock.html">Clock</A>.<DD>A simple object for measuring time.<DT><A HREF="structure/Clock.html#Clock()"><B>Clock()</B></A> - 
Constructor for class structure.<A HREF="structure/Clock.html">Clock</A>
<DD>Constructs a stopwatch for timing events to the milliseconds.
<DT><A HREF="structure/SetList.html#clone()"><B>clone()</B></A> - 
Method in class structure.<A HREF="structure/SetList.html">SetList</A>
<DD>Returns a shallow clone of this set.
<DT><A HREF="structure/BitSet.html#clone()"><B>clone()</B></A> - 
Method in class structure.<A HREF="structure/BitSet.html">BitSet</A>
<DD>Returns a copy of the set.
<DT><A HREF="structure/Vector.html#clone()"><B>clone()</B></A> - 
Method in class structure.<A HREF="structure/Vector.html">Vector</A>
<DD>Construct a shallow copy of the vector.
<DT><A HREF="structure/CharSet.html#clone()"><B>clone()</B></A> - 
Method in class structure.<A HREF="structure/CharSet.html">CharSet</A>
<DD>Construct a duplicate of the character set.
<DT><A HREF="structure/SetVector.html#clone()"><B>clone()</B></A> - 
Method in class structure.<A HREF="structure/SetVector.html">SetVector</A>
<DD>Returns a shallow clone of this set.
<DT><A HREF="structure/ComparableAssociation.html"><B>ComparableAssociation</B></A> - class structure.<A HREF="structure/ComparableAssociation.html">ComparableAssociation</A>.<DD>A class implementing a comparable key-value pair.<DT><A HREF="structure/ComparableAssociation.html#ComparableAssociation(java.lang.Comparable)"><B>ComparableAssociation(Comparable)</B></A> - 
Constructor for class structure.<A HREF="structure/ComparableAssociation.html">ComparableAssociation</A>
<DD>Construct an association that can be ordered, from only a key.
<DT><A HREF="structure/ComparableAssociation.html#ComparableAssociation(java.lang.Comparable, java.lang.Object)"><B>ComparableAssociation(Comparable, Object)</B></A> - 
Constructor for class structure.<A HREF="structure/ComparableAssociation.html">ComparableAssociation</A>
<DD>Construct a key-value association that can be ordered.
<DT><A HREF="structure/ComparableEdge.html"><B>ComparableEdge</B></A> - class structure.<A HREF="structure/ComparableEdge.html">ComparableEdge</A>.<DD>A class implementing common edge type among graphs.<DT><A HREF="structure/ComparableEdge.html#ComparableEdge(structure.Edge)"><B>ComparableEdge(Edge)</B></A> - 
Constructor for class structure.<A HREF="structure/ComparableEdge.html">ComparableEdge</A>
<DD>Construct a (possibly directed) edge between two labeled
 vertices.
<DT><A HREF="structure/ComparableEdge.html#ComparableEdge(java.lang.Object, java.lang.Object, java.lang.Object, boolean)"><B>ComparableEdge(Object, Object, Object, boolean)</B></A> - 
Constructor for class structure.<A HREF="structure/ComparableEdge.html">ComparableEdge</A>
<DD>Construct a (possibly directed) edge between two labeled
 vertices.
<DT><A HREF="structure/ReverseComparator.html#compare(java.lang.Object, java.lang.Object)"><B>compare(Object, Object)</B></A> - 
Method in class structure.<A HREF="structure/ReverseComparator.html">ReverseComparator</A>
<DD>Compare two values, a and b.
<DT><A HREF="structure/NaturalComparator.html#compare(java.lang.Object, java.lang.Object)"><B>compare(Object, Object)</B></A> - 
Method in class structure.<A HREF="structure/NaturalComparator.html">NaturalComparator</A>
<DD>Compare two values, a and b.
<DT><A HREF="structure/ComparableEdge.html#compareTo(java.lang.Object)"><B>compareTo(Object)</B></A> - 
Method in class structure.<A HREF="structure/ComparableEdge.html">ComparableEdge</A>
<DD>Compare edge, based on labels.
<DT><A HREF="structure/ComparableAssociation.html#compareTo(java.lang.Object)"><B>compareTo(Object)</B></A> - 
Method in class structure.<A HREF="structure/ComparableAssociation.html">ComparableAssociation</A>
<DD>Determine the order of two comparable associations, based on key.
<DT><A HREF="structure/Assert.html#condition(boolean, java.lang.String)"><B>condition(boolean, String)</B></A> - 
Static method in class structure.<A HREF="structure/Assert.html">Assert</A>
<DD>Test a general condition.
<DT><A HREF="structure/RedBlackTree.html#consistency()"><B>consistency()</B></A> - 
Method in class structure.<A HREF="structure/RedBlackTree.html">RedBlackTree</A>
<DD>Returns true if this node is consistently structured
<DT><A HREF="structure/RedBlackTree.html#consistentlyBlackHeight(int)"><B>consistentlyBlackHeight(int)</B></A> - 
Method in class structure.<A HREF="structure/RedBlackTree.html">RedBlackTree</A>
<DD>Checks to make sure that the black height of tree is height
<DT><A HREF="structure/CharSet.html#contains(char)"><B>contains(char)</B></A> - 
Method in class structure.<A HREF="structure/CharSet.html">CharSet</A>
<DD>Detects whether c is a member of this set.
<DT><A HREF="structure/RedBlackTree.html#contains(java.lang.Comparable)"><B>contains(Comparable)</B></A> - 
Method in class structure.<A HREF="structure/RedBlackTree.html">RedBlackTree</A>
<DD>Determines if the red black search tree contains a value
<DT><A HREF="structure/BitSet.html#contains(int)"><B>contains(int)</B></A> - 
Method in class structure.<A HREF="structure/BitSet.html">BitSet</A>
<DD>Determine if a bit is a member of the set.
<DT><A HREF="structure/AbstractStructure.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/AbstractStructure.html">AbstractStructure</A>
<DD>Determines if the structure contains a value.
<DT><A HREF="structure/GraphMatrix.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/GraphMatrix.html">GraphMatrix</A>
<DD>Test for vertex membership.
<DT><A HREF="structure/OrderedList.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/OrderedList.html">OrderedList</A>
<DD>Determine if the ordered list contains a value
<DT><A HREF="structure/AbstractList.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/AbstractList.html">AbstractList</A>
<DD>Check to see if a value is in list.
<DT><A HREF="structure/CircularList.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/CircularList.html">CircularList</A>
<DD>Check if a list contains an element.
<DT><A HREF="structure/BinarySearchTree.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/BinarySearchTree.html">BinarySearchTree</A>
<DD>Determines if the binary search tree contains a value
<DT><A HREF="structure/SplayTree.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/SplayTree.html">SplayTree</A>
<DD>Determine if a particular value is within the search tree.
<DT><A HREF="structure/GraphList.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/GraphList.html">GraphList</A>
<DD>Test for vertex membership.
<DT><A HREF="structure/SetList.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/SetList.html">SetList</A>
<DD>Returns true if value is an element of the set.
<DT><A HREF="structure/RedBlackSearchTree.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/RedBlackSearchTree.html">RedBlackSearchTree</A>
<DD>Determines if the red-black search tree contains a value
<DT><A HREF="structure/DoublyLinkedList.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/DoublyLinkedList.html">DoublyLinkedList</A>
<DD>Check to see if a value is within list.
<DT><A HREF="structure/Vector.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/Vector.html">Vector</A>
<DD>Determine if a value appears in a vector.
<DT><A HREF="structure/OrderedVector.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/OrderedVector.html">OrderedVector</A>
<DD>Determine if a comparable value is a member of the ordered vector
<DT><A HREF="structure/Structure.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in interface structure.<A HREF="structure/Structure.html">Structure</A>
<DD>Determines if the structure contains a value.
<DT><A HREF="structure/StructCollection.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/StructCollection.html">StructCollection</A>
<DD>Returns true iff object o is contained within the subordinate
 structure.
<DT><A HREF="structure/List.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in interface structure.<A HREF="structure/List.html">List</A>
<DD>Check to see if a value is in list.
<DT><A HREF="structure/SinglyLinkedList.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/SinglyLinkedList.html">SinglyLinkedList</A>
<DD>Check to see if a value is in list.
<DT><A HREF="structure/SetVector.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in class structure.<A HREF="structure/SetVector.html">SetVector</A>
<DD>Returns true if value is an element of the set.
<DT><A HREF="structure/Graph.html#contains(java.lang.Object)"><B>contains(Object)</B></A> - 
Method in interface structure.<A HREF="structure/Graph.html">Graph</A>
<DD>Test for vertex membership.
<DT><A HREF="structure/StructCollection.html#containsAll(java.util.Collection)"><B>containsAll(Collection)</B></A> - 
Method in class structure.<A HREF="structure/StructCollection.html">StructCollection</A>
<DD>Returns true if all of the elements of c are contained within
 the subordinate structure.
<DT><A HREF="structure/Set.html#containsAll(structure.Structure)"><B>containsAll(Structure)</B></A> - 
Method in interface structure.<A HREF="structure/Set.html">Set</A>
<DD>Check to see if this set is contained in the other structure.
<DT><A HREF="structure/AbstractSet.html#containsAll(structure.Structure)"><B>containsAll(Structure)</B></A> - 
Method in class structure.<A HREF="structure/AbstractSet.html">AbstractSet</A>
<DD>Check to see if this set is contained in the other structure.
<DT><A HREF="structure/SetList.html#containsAll(structure.Structure)"><B>containsAll(Structure)</B></A> - 
Method in class structure.<A HREF="structure/SetList.html">SetList</A>
<DD>Determine if this set is a subset of other.
<DT><A HREF="structure/SetVector.html#containsAll(structure.Structure)"><B>containsAll(Structure)</B></A> - 
Method in class structure.<A HREF="structure/SetVector.html">SetVector</A>
<DD>Determine if this set is a subset of other.
<DT><A HREF="structure/GraphListVertex.html#containsEdge(structure.Edge)"><B>containsEdge(Edge)</B></A> - 
Method in class structure.<A HREF="structure/GraphListVertex.html">GraphListVertex</A>
<DD>&nbsp;
<DT><A HREF="structure/GraphMatrix.html#containsEdge(java.lang.Object, java.lang.Object)"><B>containsEdge(Object, Object)</B></A> - 
Method in class structure.<A HREF="structure/GraphMatrix.html">GraphMatrix</A>
<DD>Test for edge membership.
<DT><A HREF="structure/GraphList.html#containsEdge(java.lang.Object, java.lang.Object)"><B>containsEdge(Object, Object)</B></A> - 
Method in class structure.<A HREF="structure/GraphList.html">GraphList</A>
<DD>Test for edge membership.
<DT><A HREF="structure/Graph.html#containsEdge(java.lang.Object, java.lang.Object)"><B>containsEdge(Object, Object)</B></A> - 
Method in interface structure.<A HREF="structure/Graph.html">Graph</A>
<DD>Test for edge membership.
<DT><A HREF="structure/ChainedHashtable.html#containsKey(java.lang.Object)"><B>containsKey(Object)</B></A> - 
Method in class structure.<A HREF="structure/ChainedHashtable.html">ChainedHashtable</A>
<DD>Returns true iff a specific key appears within the table.
<DT><A HREF="structure/MapList.html#containsKey(java.lang.Object)"><B>containsKey(Object)</B></A> -