index-all.html

Data Structures and Algorithm Analysis in Java -- Source Code

<DD>Construct the queue.
<DT><A HREF="DataStructures/QueueAr.html#QueueAr(int)"><B>QueueAr(int)</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/QueueAr.html">QueueAr</A>
<DD>Construct the queue.
<DT><A HREF="DataStructures/Sort.html#quickSelect(DataStructures.Comparable[], int)"><B>quickSelect(Comparable[], int)</B></A> - 
Static method in class DataStructures.<A HREF="DataStructures/Sort.html">Sort</A>
<DD>Quick selection algorithm.
<DT><A HREF="DataStructures/Sort.html#quicksort(DataStructures.Comparable[])"><B>quicksort(Comparable[])</B></A> - 
Static method in class DataStructures.<A HREF="DataStructures/Sort.html">Sort</A>
<DD>Quicksort algorithm.
</DL>
<HR>
<A NAME="_R_"><!-- --></A><H2>
<B>R</B></H2>
<DL>
<DT><A HREF="DataStructures/Random.html"><B>Random</B></A> - class DataStructures.<A HREF="DataStructures/Random.html">Random</A>.<DD>Random number class, using a 31-bit
 linear congruential generator.<DT><A HREF="DataStructures/Random.html#Random()"><B>Random()</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/Random.html">Random</A>
<DD>Construct this Random object with
 initial state obtained from system clock.
<DT><A HREF="DataStructures/Random.html#Random(int)"><B>Random(int)</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/Random.html">Random</A>
<DD>Construct this Random object with
 specified initial state.
<DT><A HREF="DataStructures/Random.html#random0_1()"><B>random0_1()</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/Random.html">Random</A>
<DD>Return a pseudorandom double in the open range 0..1
 and change the internal state.
<DT><A HREF="DataStructures/Random.html#randomInt()"><B>randomInt()</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/Random.html">Random</A>
<DD>Return a pseudorandom int, and change the
 internal state.
<DT><A HREF="DataStructures/Random.html#randomInt(int, int)"><B>randomInt(int, int)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/Random.html">Random</A>
<DD>Return an int in the closed range [low,high], and
 change the internal state.
<DT><A HREF="DataStructures/Random.html#randomIntWRONG()"><B>randomIntWRONG()</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/Random.html">Random</A>
<DD>Return a pseudorandom int, and change the
 internal state.
<DT><A HREF="DataStructures/Random.html#randomLong(long, long)"><B>randomLong(long, long)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/Random.html">Random</A>
<DD>Return an long in the closed range [low,high], and
 change the internal state.
<DT><A HREF="DataStructures/RedBlackTree.html"><B>RedBlackTree</B></A> - class DataStructures.<A HREF="DataStructures/RedBlackTree.html">RedBlackTree</A>.<DD>Implements a red-black tree.<DT><A HREF="DataStructures/RedBlackTree.html#RedBlackTree(DataStructures.Comparable)"><B>RedBlackTree(Comparable)</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/RedBlackTree.html">RedBlackTree</A>
<DD>Construct the tree.
<DT><A HREF="DataStructures/BinarySearchTree.html#remove(DataStructures.Comparable)"><B>remove(Comparable)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/BinarySearchTree.html">BinarySearchTree</A>
<DD>Remove from the tree.
<DT><A HREF="DataStructures/SplayTree.html#remove(DataStructures.Comparable)"><B>remove(Comparable)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/SplayTree.html">SplayTree</A>
<DD>Remove from the tree.
<DT><A HREF="DataStructures/AATree.html#remove(DataStructures.Comparable)"><B>remove(Comparable)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/AATree.html">AATree</A>
<DD>Remove from the tree.
<DT><A HREF="DataStructures/DSL.html#remove(DataStructures.Comparable)"><B>remove(Comparable)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/DSL.html">DSL</A>
<DD>Remove from the DSL.
<DT><A HREF="DataStructures/RedBlackTree.html#remove(DataStructures.Comparable)"><B>remove(Comparable)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/RedBlackTree.html">RedBlackTree</A>
<DD>Remove from the tree.
<DT><A HREF="DataStructures/AvlTree.html#remove(DataStructures.Comparable)"><B>remove(Comparable)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/AvlTree.html">AvlTree</A>
<DD>Remove from the tree.
<DT><A HREF="DataStructures/Treap.html#remove(DataStructures.Comparable)"><B>remove(Comparable)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/Treap.html">Treap</A>
<DD>Remove from the tree.
<DT><A HREF="DataStructures/SeparateChainingHashTable.html#remove(DataStructures.Hashable)"><B>remove(Hashable)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/SeparateChainingHashTable.html">SeparateChainingHashTable</A>
<DD>Remove from the hash table.
<DT><A HREF="DataStructures/QuadraticProbingHashTable.html#remove(DataStructures.Hashable)"><B>remove(Hashable)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/QuadraticProbingHashTable.html">QuadraticProbingHashTable</A>
<DD>Remove from the hash table.
<DT><A HREF="DataStructures/CursorList.html#remove(java.lang.Object)"><B>remove(Object)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/CursorList.html">CursorList</A>
<DD>Remove the first occurrence of an item.
<DT><A HREF="DataStructures/LinkedList.html#remove(java.lang.Object)"><B>remove(Object)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/LinkedList.html">LinkedList</A>
<DD>Remove the first occurrence of an item.
<DT><A HREF="DataStructures/LinkedListItr.html#retrieve()"><B>retrieve()</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/LinkedListItr.html">LinkedListItr</A>
<DD>Return the item stored in the current position.
<DT><A HREF="DataStructures/CursorListItr.html#retrieve()"><B>retrieve()</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/CursorListItr.html">CursorListItr</A>
<DD>Return the item stored in the current position.
</DL>
<HR>
<A NAME="_S_"><!-- --></A><H2>
<B>S</B></H2>
<DL>
<DT><A HREF="DataStructures/SeparateChainingHashTable.html"><B>SeparateChainingHashTable</B></A> - class DataStructures.<A HREF="DataStructures/SeparateChainingHashTable.html">SeparateChainingHashTable</A>.<DD>Separate chaining table implementation of hash tables.<DT><A HREF="DataStructures/SeparateChainingHashTable.html#SeparateChainingHashTable()"><B>SeparateChainingHashTable()</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/SeparateChainingHashTable.html">SeparateChainingHashTable</A>
<DD>Construct the hash table.
<DT><A HREF="DataStructures/SeparateChainingHashTable.html#SeparateChainingHashTable(int)"><B>SeparateChainingHashTable(int)</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/SeparateChainingHashTable.html">SeparateChainingHashTable</A>
<DD>Construct the hash table.
<DT><A HREF="DataStructures/Sort.html#shellsort(DataStructures.Comparable[])"><B>shellsort(Comparable[])</B></A> - 
Static method in class DataStructures.<A HREF="DataStructures/Sort.html">Sort</A>
<DD>Shellsort, using Shell's (poor) increments.
<DT><A HREF="DataStructures/Sort.html"><B>Sort</B></A> - class DataStructures.<A HREF="DataStructures/Sort.html">Sort</A>.<DD>A class that contains several sorting routines,
 implemented as static methods.<DT><A HREF="DataStructures/Sort.html#Sort()"><B>Sort()</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/Sort.html">Sort</A>
<DD>&nbsp;
<DT><A HREF="DataStructures/SplayTree.html"><B>SplayTree</B></A> - class DataStructures.<A HREF="DataStructures/SplayTree.html">SplayTree</A>.<DD>Implements a top-down splay tree.<DT><A HREF="DataStructures/SplayTree.html#SplayTree()"><B>SplayTree()</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/SplayTree.html">SplayTree</A>
<DD>Construct the tree.
<DT><A HREF="DataStructures/StackAr.html"><B>StackAr</B></A> - class DataStructures.<A HREF="DataStructures/StackAr.html">StackAr</A>.<DD>Array-based implementation of the stack.<DT><A HREF="DataStructures/StackAr.html#StackAr()"><B>StackAr()</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/StackAr.html">StackAr</A>
<DD>Construct the stack.
<DT><A HREF="DataStructures/StackAr.html#StackAr(int)"><B>StackAr(int)</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/StackAr.html">StackAr</A>
<DD>Construct the stack.
<DT><A HREF="DataStructures/StackLi.html"><B>StackLi</B></A> - class DataStructures.<A HREF="DataStructures/StackLi.html">StackLi</A>.<DD>List-based implementation of the stack.<DT><A HREF="DataStructures/StackLi.html#StackLi()"><B>StackLi()</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/StackLi.html">StackLi</A>
<DD>Construct the stack.
<DT><A HREF="DataStructures/Sort.html#swapReferences(java.lang.Object[], int, int)"><B>swapReferences(Object[], int, int)</B></A> - 
Static method in class DataStructures.<A HREF="DataStructures/Sort.html">Sort</A>
<DD>Method to swap to elements in an array.
</DL>
<HR>
<A NAME="_T_"><!-- --></A><H2>
<B>T</B></H2>
<DL>
<DT><A HREF="DataStructures/StackLi.html#top()"><B>top()</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/StackLi.html">StackLi</A>
<DD>Get the most recently inserted item in the stack.
<DT><A HREF="DataStructures/StackAr.html#top()"><B>top()</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/StackAr.html">StackAr</A>
<DD>Get the most recently inserted item in the stack.
<DT><A HREF="DataStructures/StackLi.html#topAndPop()"><B>topAndPop()</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/StackLi.html">StackLi</A>
<DD>Return and remove the most recently inserted item from the stack.
<DT><A HREF="DataStructures/StackAr.html#topAndPop()"><B>topAndPop()</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/StackAr.html">StackAr</A>
<DD>Return and remove most recently inserted item from the stack.
<DT><A HREF="DataStructures/MyInteger.html#toString()"><B>toString()</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/MyInteger.html">MyInteger</A>
<DD>Implements the toString method.
<DT><A HREF="DataStructures/Treap.html"><B>Treap</B></A> - class DataStructures.<A HREF="DataStructures/Treap.html">Treap</A>.<DD>Implements a treap.<DT><A HREF="DataStructures/Treap.html#Treap()"><B>Treap()</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/Treap.html">Treap</A>
<DD>Construct the treap.
</DL>
<HR>
<A NAME="_U_"><!-- --></A><H2>
<B>U</B></H2>
<DL>
<DT><A HREF="DataStructures/Underflow.html"><B>Underflow</B></A> - exception DataStructures.<A HREF="DataStructures/Underflow.html">Underflow</A>.<DD>Exception class for access in empty containers
 such as stacks, queues, and priority queues.<DT><A HREF="DataStructures/Underflow.html#Underflow()"><B>Underflow()</B></A> - 
Constructor for class DataStructures.<A HREF="DataStructures/Underflow.html">Underflow</A>
<DD>&nbsp;
<DT><A HREF="DataStructures/DisjSetsFast.html#union(int, int)"><B>union(int, int)</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/DisjSetsFast.html">DisjSetsFast</A>
<DD>Union two disjoint sets using the height heuristic.
</DL>
<HR>
<A NAME="_Z_"><!-- --></A><H2>
<B>Z</B></H2>
<DL>
<DT><A HREF="DataStructures/CursorList.html#zeroth()"><B>zeroth()</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/CursorList.html">CursorList</A>
<DD>Return an iterator representing the header node.
<DT><A HREF="DataStructures/LinkedList.html#zeroth()"><B>zeroth()</B></A> - 
Method in class DataStructures.<A HREF="DataStructures/LinkedList.html">LinkedList</A>
<DD>Return an iterator representing the header node.
</DL>
<HR>
<A HREF="#_A_">A</A> <A HREF="#_B_">B</A> <A HREF="#_C_">C</A> <A HREF="#_D_">D</A> <A HREF="#_E_">E</A> <A HREF="#_F_">F</A> <A HREF="#_G_">G</A> <A HREF="#_H_">H</A> <A HREF="#_I_">I</A> <A HREF="#_L_">L</A> <A HREF="#_M_">M</A> <A HREF="#_O_">O</A> <A HREF="#_P_">P</A> <A HREF="#_Q_">Q</A> <A HREF="#_R_">R</A> <A HREF="#_S_">S</A> <A HREF="#_T_">T</A> <A HREF="#_U_">U</A> <A HREF="#_Z_">Z</A> 
<!-- ========== START OF NAVBAR ========== -->
<A NAME="navbar_bottom"><!-- --></A>
<TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0">
<TR>
<TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1">
<A NAME="navbar_bottom_firstrow"><!-- --></A>
<TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3">
  <TR ALIGN="center" VALIGN="top">
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <FONT CLASS="NavBarFont1">Package</FONT>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <FONT CLASS="NavBarFont1">Class</FONT>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="DataStructures/package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> &nbsp;<FONT CLASS="NavBarFont1Rev"><B>Index</B></FONT>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A>&nbsp;</TD>
  </TR>
</TABLE>
</TD>
<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM>
</EM>
</TD>
</TR>

<TR>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
&nbsp;PREV&nbsp;
&nbsp;NEXT</FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
  <A HREF="index.html" TARGET="_top"><B>FRAMES</B></A>  &nbsp;
&nbsp;<A HREF="index-all.html" TARGET="_top"><B>NO FRAMES</B></A></FONT></TD>
</TR>
</TABLE>
<!-- =========== END OF NAVBAR =========== -->

<HR>

</BODY>
</HTML>