| /external/replicaisland/src/com/replica/replicaisland/ |
| QuickSorter.java | 23 quicksort(array, 0, count - 1, comparator); method
26 // Quicksort implementation based on the one here:
27 // http://www.cs.princeton.edu/introcs/42sort/QuickSort.java.html
30 * Generate N random real numbers between 0 and 1 and quicksort them.
32 * On average, this quicksort algorithm runs in time proportional to
41 * Quicksort code from Sedgewick 7.1, 7.2.
44 // quicksort a[left] to a[right]
45 public void quicksort(Type[] a, int left, int right, Comparator<Type> comparator) { method in class:QuickSorter
48 quicksort(a, left, i - 1, comparator); method
49 quicksort(a, i + 1, right, comparator) method
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| quicksort.h | 25 /** @file parallel/quicksort.h
26 * @brief Implementation of a unbalanced parallel quicksort (in-place).
40 /** @brief Unbalanced quicksort divide step.
92 /** @brief Unbalanced quicksort conquer step.
148 /** @brief Unbalanced quicksort main call.
|
| features.h | 46 * @brief Include parallel unbalanced quicksort.
53 * @brief Include parallel dynamically load-balanced quicksort.
|
| types.h | 73 // multi-way mergesort, quicksort, load-balanced quicksort.
|
| sort.h | 48 #include <parallel/quicksort.h>
126 * @brief Choose quicksort for parallel sorting.
145 * @brief Choose balanced quicksort for parallel sorting.
|
| balanced_quicksort.h | 26 * @brief Implementation of a dynamically load-balanced parallel quicksort.
32 * A simple, fast parallel implementation of quicksort and
60 /** @brief Information local to one thread in the parallel quicksort run. */
91 /** @brief Balanced quicksort divide step.
153 /** @brief Quicksort conquer step.
232 * @brief Quicksort step doing load-balanced local sort.
409 /** @brief Top-level quicksort routine.
|
| tags.h | 159 /** @brief Forces parallel sorting using unbalanced quicksort
168 /** @brief Forces parallel sorting using balanced quicksort
|
| settings.h | 231 /// Such many samples to take to find a good pivot (quicksort).
235 /// Applies to std::sort with dynamically load-balanced quicksort.
264 /// The number of stolen ranges in load-balanced quicksort.
|
| /external/icu4c/common/ |
| uarrsort.c | 105 /* QuickSort ---------------------------------------------------------------- */
112 * Loosely after QuickSort algorithms in
186 quickSort(char *array, int32_t length, int32_t itemSize,
234 quickSort((char *)array, length, itemSize, cmp, context, pErrorCode);
|
| /external/v8/test/mjsunit/ |
| stack-traces-2.js | 80 // QuickSort has builtins object as receiver, and is non-native
84 }, "QuickSort");
|
| stack-traces.js | 270 // Omitted because QuickSort has builtins object as receiver, and is non-native
274 }, "QuickSort");
|
| /sdk/emulator/qtools/ |
| bbprof.cpp | 20 // This function is called from quicksort to compare addresses of basic
34 // This function is called from quicksort to compare the elapsed time
48 // This function is called from quicksort to compare frequencies of
|
| profile_pid.cpp | 13 // This function is called from quicksort to compare the cpu time
|
| bb2sym.cpp | 28 // This function is called from quicksort to compare addresses of basic
|
| /external/llvm/test/CodeGen/X86/ |
| 2011-06-19-QuicksortCoalescerBug.ll | 5 define void @Quicksort(i32* %a, i32 %l, i32 %r) nounwind ssp {
|
| /external/icu4c/test/perf/collationperf/ |
| readme.html | 56 -qsort Quicksort timing test</TT></PRE>
|
| CollPerf.pl | 76 #quicksort
|
| /libcore/luni/src/main/java/java/util/ |
| DualPivotQuicksort.java | 21 * This class implements the Dual-Pivot Quicksort algorithm by
25 * faster than traditional (one-pivot) Quicksort implementations.
46 * constant, insertion sort is used in preference to Quicksort.
52 * this constant, counting sort is used in preference to Quicksort.
58 * than this constant, counting sort is used in preference to Quicksort.
114 } else { // Use Dual-Pivot Quicksort on large arrays
121 * Dual-Pivot Quicksort algorithm.
392 } else { // Use Dual-Pivot Quicksort on large arrays
399 * Dual-Pivot Quicksort algorithm.
687 } else { // Use Dual-Pivot Quicksort on large array
[all...] |
| /external/v8/src/ |
| array.js | 743 // In-place QuickSort algorithm.
776 var QuickSort = function QuickSort(a, from, to) {
846 QuickSort(a, from, low_end);
847 QuickSort(a, high_start, to);
992 QuickSort(this, 0, num_non_undefined);
[all...] |
| list.h | 138 // Sort all list entries (using QuickSort)
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| NodeVector.java | 632 * Sort an array using a quicksort algorithm.
731 * Sort an array using a quicksort algorithm.
|
| /external/skia/third_party/glu/libtess/ |
| priorityq.c | 126 * using randomized Quicksort
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| NodeSorter.java | 283 * sort for our purpose than the Quicksort because it
|
| /external/libxml2/ |
| list.c | 652 /* I think that the real answer is to implement quicksort, the
|
| /external/opencv/cv/src/ |
| _cvkdtree.hpp | 115 // implemented as partial quicksort; expected linear perf.
|
