|
UC Berkeley Group for User Interface Research Updated November 17, 2000 |
|||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Comparison | |
edu.berkeley.guir.lib.graphs | Some simple graph utilities. |
edu.berkeley.guir.lib.util | Hodgepodge of miscellaneous utilities. |
Uses of Comparison in edu.berkeley.guir.lib.graphs |
Methods in edu.berkeley.guir.lib.graphs with parameters of type Comparison | |
static void |
BinarySearchTree.setComparison(Comparison aCompare)
Set the object that will be used to compare objects in this BinarySearchTree. |
Uses of Comparison in edu.berkeley.guir.lib.util |
Classes in edu.berkeley.guir.lib.util that implement Comparison | |
class |
NumComparison
Allows comparisons between arbitrary number objects. |
Methods in edu.berkeley.guir.lib.util with parameters of type Comparison | |
static long |
Sort.bubbleSort(Object[] theArray,
Comparison compare)
Performs a "bubble" sort on theArray passed in. |
static long |
Sort.bidirBubbleSort(Object[] theArray,
Comparison compare)
Performs a bidirectional "bubble" sort on theArray passed in. |
static long |
Sort.heapSort(Object[] theArray,
Comparison compare)
Performs a "heap" sort on theArray passed in. |
static long |
Sort.insertionSort(Object[] theArray,
Comparison compare)
Performs an "insertion" sort on theArray passed in. |
static long |
Sort.mergeSort(Object[] theArray,
Comparison compare)
Performs a "merge" sort on theArray passed in. |
static long |
Sort.quickSort(Object[] theArray,
Comparison compare)
Performs a "quick" sort on theArray passed in. |
static long |
Sort.selectionSort(Object[] theArray,
Comparison compare)
Performs a "selection" sort on theArray passed in. |
|
Copyright Information | |||||||||
PREV NEXT | FRAMES NO FRAMES |