|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Traversal | |
---|---|
stresstests.algorithms | |
stresstests.datasets | |
stresstests.interfaces |
Uses of Traversal in stresstests.algorithms |
---|
Fields in stresstests.algorithms declared as Traversal | |
---|---|
Traversal<T> |
AListSortQuickSort.tr
the Traversal that supplies the data to sort |
Traversal<T> |
AListSortInsertion.tr
the Traversal that supplies the data to sort |
Methods in stresstests.algorithms that return Traversal | |
---|---|
abstract Traversal<T> |
ASortAlgo.sort()
sort the data set with respect to the given Comparator |
Traversal<T> |
ArrSortSelection.sort()
sort the data set with respect to the current Comparator |
Traversal<T> |
ArrSortQuick.sort()
sort the data set with respect to the current Comparator |
Traversal<T> |
ArrSortInsertion.sort()
sort the data set with respect to the current Comparator |
Traversal<T> |
AListSortQuickSort.sort()
wrapper for the sort method |
Traversal<T> |
AListSortInsertion.sort()
wrapper for the sort method |
Methods in stresstests.algorithms with parameters of type Traversal | |
---|---|
private AList<T> |
AListSortQuickSort.append(Traversal<T> lowerTr,
T pivot,
AList<T> upper)
Append two lists with the pivot in the middle |
abstract void |
ASortAlgo.initData(Traversal<T> tr)
initialize a data set with the data generated by the traversal |
void |
ArrSortSelection.initData(Traversal<T> tr)
Initialize the internal data set with the data generated by the Traversal |
void |
ArrSortQuick.initData(Traversal<T> tr)
Initialize the internal data set with the data generated by the Traversal |
void |
ArrSortInsertion.initData(Traversal<T> tr)
Initialize the internal data set with the data generated by the Traversal |
void |
AListSortQuickSort.initData(Traversal<T> tr)
Initialize the internal data set with the data generated by the Traversal |
void |
AListSortInsertion.initData(Traversal<T> tr)
Initialize the internal data set with the data generated by the Traversal |
AList<T> |
AListSortInsertion.insert(T city,
Traversal<T> tr)
Insert the given item into the given sorted list |
AList<T> |
AListSortInsertion.insertionSort(Traversal<T> tr)
sort the data set with respect to the current Comparator |
private AList<T> |
AListSortQuickSort.lower(Traversal<T> source,
T pivot)
Produce the lower partition - where all data <= pivot |
AList<T> |
AListSortInsertion.makeList(Traversal<T> tr)
Build the recursively defined list from the data generated by the given Traversal |
AList<T> |
AListSortQuickSort.quickSort(Traversal<T> tr)
Quicksort for a recursively defined list |
private AList<T> |
AListSortQuickSort.upper(Traversal<T> source,
T pivot)
Produce the upper partition - where all data > pivot |
Constructors in stresstests.algorithms with parameters of type Traversal | |
---|---|
AListSortInsertion(java.util.Comparator<T> comp,
Traversal<T> tr)
|
|
AListSortQuickSort(java.util.Comparator<T> comp,
Traversal<T> tr)
|
|
ArrSortInsertion(java.util.Comparator<T> comp,
Traversal<T> tr)
|
|
ArrSortQuick(java.util.Comparator<T> comp,
Traversal<T> tr)
|
|
ArrSortSelection(java.util.Comparator<T> comp,
Traversal<T> tr)
|
Uses of Traversal in stresstests.datasets |
---|
Classes in stresstests.datasets that implement Traversal | |
---|---|
class |
TraversalALC<T>
A non-mutable iterator wrapper for ArrayList
TraversalALC 22 March 2006 |
class |
TraversalInFile
Functional (External) Iterator Pattern: file reader iterator for a list of cities TraversalInFile 22 March 2006 |
class |
TraversalList<T>
A non-mutable iterator wrapper for a recursively built AList
TraversalCitiesList 22 March 2006 |
class |
TraversalOutFile
An output iterator for City objects for file output. |
Methods in stresstests.datasets that return Traversal | |
---|---|
Traversal<City> |
TraversalOutFile.getRest()
process next item, if available |
Traversal<T> |
TraversalList.getRest()
produce the Traversal for the rest of the data |
Traversal<City> |
TraversalInFile.getRest()
produce a traversal for the rest of this list |
Traversal<T> |
TraversalALC.getRest()
produce the Traversal for the rest of the data |
Uses of Traversal in stresstests.interfaces |
---|
Methods in stresstests.interfaces that return Traversal | |
---|---|
Traversal<T> |
Traversal.getRest()
Produce a
for the rest of the dataset |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |