Searched refs:sort_and_compare (Results 1 - 2 of 2) sorted by relevance
/openjdk7/hotspot/src/share/vm/utilities/ |
H A D | quickSort.cpp | 91 bool QuickSort::sort_and_compare(int* arrayToSort, int* expectedResult, int length, C comparator, bool idempotent) { function in class:QuickSort 100 assert(sort_and_compare(test_array, expected_array, 0, test_comparator), "Empty array not handled"); 105 assert(sort_and_compare(test_array, expected_array, 1, test_comparator), "Single value array not handled"); 110 assert(sort_and_compare(test_array, expected_array, 2, test_comparator), "Array with 2 values not correctly sorted"); 115 assert(sort_and_compare(test_array, expected_array, 3, test_comparator), "Array with 3 values not correctly sorted"); 120 assert(sort_and_compare(test_array, expected_array, 4, test_comparator), "Array with 4 values not correctly sorted"); 125 assert(sort_and_compare(test_array, expected_array, 10, test_comparator), "Array with 10 values not correctly sorted"); 130 assert(sort_and_compare(test_array, expected_array, 4, test_comparator), "3 duplicates not sorted correctly"); 135 assert(sort_and_compare(test_array, expected_array, 10, test_comparator), "Already sorted array not correctly sorted"); 141 assert(sort_and_compare(test_arra [all...] |
H A D | quickSort.hpp | 132 template <class C> static bool sort_and_compare(int* arrayToSort, int* expectedResult, int length, C comparator, bool idempotent = false);
|
Completed in 29 milliseconds