Searched refs:idempotent (Results 1 - 6 of 6) sorted by relevance
| /openjdk7/hotspot/src/share/vm/utilities/ |
| H A D | quickSort.hpp | 69 template<class T, class C, bool idempotent>
84 if (!idempotent || comparator(array[left_index], array[right_index]) != 0) {
96 template<class T, class C, bool idempotent>
106 int split = partition<T, C, idempotent>(array, pivot, length, comparator);
108 inner_sort<T, C, idempotent>(array, first_part_length, comparator);
109 inner_sort<T, C, idempotent>(&array[first_part_length], length - first_part_length, comparator);
113 // The idempotent parameter prevents the sort from
119 static void sort(T* array, int length, C comparator, bool idempotent) { argument
120 // Switch "idempotent" from function paramter to template parameter
121 if (idempotent) {
[all...] |
| H A D | quickSort.cpp | 91 bool QuickSort::sort_and_compare(int* arrayToSort, int* expectedResult, int length, C comparator, bool idempotent) { argument
92 sort<int, C>(arrayToSort, length, comparator, idempotent);
148 { // Some idempotent tests
150 // An array of lenght 3 is only sorted by find_pivot. Make sure that it is idempotent.
153 assert(sort_and_compare(test_array, expected_array, 3, test_even_odd_comparator, true), "Even/odd not idempotent");
158 assert(sort_and_compare(test_array, expected_array, 6, test_even_odd_comparator, true), "Even/odd not idempotent");
163 assert(sort_and_compare(test_array, expected_array, 6, test_even_odd_comparator, true), "Even/odd not idempotent");
168 assert(sort_and_compare(test_array, expected_array, 6, test_even_odd_comparator, true), "Even/odd not idempotent");
173 assert(sort_and_compare(test_array, expected_array, 6, test_even_odd_comparator, true), "Even/odd not idempotent");
178 assert(sort_and_compare(test_array, expected_array, 6, test_even_odd_comparator, true), "Even/odd not idempotent");
[all...] |
| /openjdk7/hotspot/src/share/vm/memory/ |
| H A D | iterator.hpp | 94 virtual bool idempotent() { return false; } function in class:OopClosure
|
| H A D | space.cpp | 132 _cl->idempotent() || _last_bottom == NULL ||
171 // An idempotent closure might be applied in any order, so we don't
173 if (!_cl->idempotent()) {
177 "Don't update _min_done for idempotent cl");
|
| /openjdk7/hotspot/src/share/vm/oops/ |
| H A D | methodOop.cpp | 1287 bool idempotent) {
1306 QuickSort::sort<narrowOop>((narrowOop*)(methods->base()), length, method_comparator_narrowOop, idempotent);
1308 QuickSort::sort<oop>((oop*)(methods->base()), length, method_comparator_oop, idempotent);
1283 sort_methods(objArrayOop methods, objArrayOop methods_annotations, objArrayOop methods_parameter_annotations, objArrayOop methods_default_annotations, bool idempotent) argument
|
| H A D | methodOop.hpp | 725 bool idempotent = false);
|
Completed in 63 milliseconds