Uses of Class
stresstests.datasets.AList

Packages that use AList
stresstests.algorithms   
stresstests.datasets   
 

Uses of AList in stresstests.algorithms
 

Methods in stresstests.algorithms that return AList
private  AList<T> AListSortQuickSort.append(Traversal<T> lowerTr, T pivot, AList<T> upper)
          Append two lists with the pivot in the middle
private  AList<T> AListSortQuickSort.appendLists(AList<T> lower, T pivot, AList<T> upper)
          Wrapper to append two lists with the pivot in the middle: invokes the real method by converting the first AList to a 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(AList<T> source)
          A wrapper for a quicksort for a recursively defined list: it invokes the actual algorithm with the input converted to a 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
 

Methods in stresstests.algorithms with parameters of type AList
private  AList<T> AListSortQuickSort.append(Traversal<T> lowerTr, T pivot, AList<T> upper)
          Append two lists with the pivot in the middle
private  AList<T> AListSortQuickSort.appendLists(AList<T> lower, T pivot, AList<T> upper)
          Wrapper to append two lists with the pivot in the middle: invokes the real method by converting the first AList to a Traversal
private  AList<T> AListSortQuickSort.appendLists(AList<T> lower, T pivot, AList<T> upper)
          Wrapper to append two lists with the pivot in the middle: invokes the real method by converting the first AList to a Traversal
 AList<T> AListSortQuickSort.quickSort(AList<T> source)
          A wrapper for a quicksort for a recursively defined list: it invokes the actual algorithm with the input converted to a Traversal
 

Uses of AList in stresstests.datasets
 

Subclasses of AList in stresstests.datasets
 class ConsList<T>
          Nonempty list of T class ConsList 20 November 2007
 class MTList<T>
          Empty list of T class MTList 20 November 2007
 

Fields in stresstests.datasets declared as AList
(package private)  AList<T> TraversalList.cities
           
 AList<T> ConsList.rest
          the rest of the list
 

Constructors in stresstests.datasets with parameters of type AList
ConsList(T s, AList<T> r)
          The full constructor
TraversalList(AList<T> cities)
          Constructor - save the data to traverse