| /dports/science/ergo/ergo-3.8/source/matrix/ |
| H A D | sort.h | 42 void quicksort(const Treal* value, int* index, int low, int high) in quicksort() function
61 if(low < j) quicksort(value, index, low, j); /* Sort the two groups */ in quicksort()
62 if(i < high) quicksort(value, index, i, high); in quicksort()
70 void quicksort(Tfun const & fun, int* index, int low, int high)
88 if(low < j) quicksort<Treal>(fun, index, low, j);
89 if(i < high) quicksort<Treal>(fun, index, i, high);
93 void quicksort(const Treal* value, int* index, int low, int high) {
109 if(low < j) quicksort(value, index, low, j); /* Sort the two groups */
110 if(i < high) quicksort(value, index, i, high);
|
| /dports/math/gecode/gecode-0916a1a/gecode/int/task/ |
| H A D | sort.hpp | 137 StoEst<TaskView,inc> o; Support::quicksort(&t[0], t.size(), o); in sort()
142 StoEct<TaskView,inc> o; Support::quicksort(&t[0], t.size(), o); in sort()
147 StoLst<TaskView,inc> o; Support::quicksort(&t[0], t.size(), o); in sort()
169 Support::quicksort(map, t.size(), o); in sort()
175 Support::quicksort(map, t.size(), o); in sort()
181 Support::quicksort(map, t.size(), o); in sort()
187 Support::quicksort(map, t.size(), o); in sort()
202 Support::quicksort(map, n, o); in sort()
208 Support::quicksort(map, n, o); in sort()
214 Support::quicksort(map, n, o); in sort()
[all …]
|
| /dports/math/plman/plman/src/ |
| H A D | Sort.java | 19 public static void quicksort(Object arr[], int left, int right, Compare comp) { in quicksort() method in Sort
33 quicksort(arr, left, last-1, comp); in quicksort()
34 quicksort(arr, last+1, right, comp); in quicksort()
37 public static void quicksort(Object arr[], Compare comp) { in quicksort() method in Sort
38 quicksort(arr, 0, arr.length-1, comp); in quicksort()
|
| /dports/textproc/py-pygments/Pygments-2.7.2/tests/examplefiles/ |
| H A D | qsort.prolog | 10 quicksort([]) --> [].
11 quicksort([X|Xs]) -->
13 quicksort(Smaller), [X], quicksort(Bigger).
|
| /dports/textproc/py-pygments-25/Pygments-2.5.2/tests/examplefiles/ |
| H A D | qsort.prolog | 10 quicksort([]) --> [].
11 quicksort([X|Xs]) -->
13 quicksort(Smaller), [X], quicksort(Bigger).
|
| /dports/java/bouncycastle15/crypto-169/core/src/main/java/org/bouncycastle/pqc/math/linearalgebra/ |
| H A D | IntUtils.java | 73 public static void quicksort(int[] source) in quicksort() method in IntUtils
75 quicksort(source, 0, source.length - 1); in quicksort()
86 public static void quicksort(int[] source, int left, int right) in quicksort() method in IntUtils
91 quicksort(source, left, index - 1); in quicksort()
92 quicksort(source, index + 1, right); in quicksort()
|
| /dports/benchmarks/hyperfine/hyperfine-1.12.0/cargo-crates/statistical-1.0.0/src/ |
| H A D | stats_.rs | 66 quicksort(&mut scratch); in median()
172 pub fn quicksort<T>(v: &mut [T]) in quicksort() function
179 quicksort(&mut v[..pivot]); in quicksort()
180 quicksort(&mut v[(pivot+1)..]); in quicksort()
268 quicksort(&mut vec); in test_qsort_empty()
277 quicksort(&mut vec); in test_qsort_small()
288 quicksort(&mut vec); in test_qsort_large()
299 quicksort(&mut vec); in test_qsort_sorted()
310 quicksort(&mut vec); in test_qsort_reverse_sorted()
|
| /dports/java/javahelp/javahelp-3ca862d/jhMaster/JSearch/client/com/sun/java/help/search/ |
| H A D | ConceptLocation.java | 67 public void quicksort(ConceptLocation[] array, int p, int r) in quicksort() method in ConceptLocation.ConceptLocationSorter
72 quicksort(array, p, q); in quicksort()
73 quicksort(array, q + 1, r); in quicksort()
136 _cComp.quicksort(array, i1, i2 - 1); in sortByConcept()
140 _pComp.quicksort(array, i1, i2 - 1); in sortByPosition()
|
| /dports/games/0ad/0ad-0.0.23b-alpha/libraries/source/fcollada/include/FMath/ |
| H A D | FMSort.h | 52 quicksort(data, 0, count); in sort()
56 void quicksort(T* data, intptr_t beg, intptr_t end) in quicksort() function
70 quicksort(data, beg, l); in quicksort()
71 quicksort(data, r, end); in quicksort()
|
| /dports/games/0ad/0ad-0.0.23b-alpha/libraries/source/fcollada/src/FCollada/FMath/ |
| H A D | FMSort.h | 52 quicksort(data, 0, count); in sort()
56 void quicksort(T* data, intptr_t beg, intptr_t end) in quicksort() function
70 quicksort(data, beg, l); in quicksort()
71 quicksort(data, r, end); in quicksort()
|
| /dports/security/steghide/steghide-0.5.1/tests/ |
| H A D | SampleValueAdjacencyListTest.cc | 72 DummySVAL.quicksort (SVEmpty, d, 0, 1) ; in testQuicksort()
81 DummySVAL.quicksort (SVEmpty, d, 0, 1) ; in testQuicksort()
91 DummySVAL.quicksort (SVEmpty, d, 0, 2) ; in testQuicksort()
100 DummySVAL.quicksort (SVEmpty, d, 0, 9) ; in testQuicksort()
|
| /dports/finance/chiapos/chiapos-1.0.3/src/ |
| H A D | b17sort_manager.hpp | 102 inline uint8_t *ReadEntry(uint64_t position, int quicksort = 0) in ReadEntry() argument
112 SortBucket(quicksort); in ReadEntry()
133 inline void TriggerNewBucket(uint64_t position, bool quicksort) in TriggerNewBucket() argument
149 SortBucket(quicksort); in TriggerNewBucket()
232 inline void SortBucket(int quicksort) in SortBucket() argument
257 bool force_quicksort = (quicksort == 1) || (quicksort == 2 && last_bucket); in SortBucket()
|
| /dports/math/gecode/gecode-0916a1a/gecode/kernel/data/ |
| H A D | array.cpp | 41 Support::quicksort<void*>(p,n); in duplicates()
51 Support::quicksort<void*>(p,n); in duplicates()
52 Support::quicksort<void*>(q,m); in duplicates()
|
| /dports/lang/gawk/gawk-5.1.1/test/ |
| H A D | indirectcall.awk | 60 quicksort(data, 1, i-1, compare)
108 function quicksort(data, left, right, less_than, i, last) function
119 quicksort(data, left, last - 1, less_than)
120 quicksort(data, last + 1, right, less_than)
|
| /dports/graphics/libGLU/glu-9.0.2/src/libnurbs/nurbtess/ |
| H A D | quicksort.cc | 62 void quicksort(void *v[], int left, int right, in quicksort() function
75 quicksort(v, left, last-1, comp); in quicksort()
76 quicksort(v, last+1, right, comp); in quicksort()
|
| /dports/lang/gawk/gawk-5.1.1/awklib/eg/lib/ |
| H A D | quicksort.awk | 13 function quicksort(data, left, right, less_than, i, last) function
24 quicksort(data, left, last - 1, less_than)
25 quicksort(data, last + 1, right, less_than)
|
| /dports/textproc/bat/bat-0.18.3/tests/syntax-tests/source/AWK/ |
| H A D | quicksort.awk | 13 function quicksort(data, left, right, less_than, i, last) function
24 quicksort(data, left, last - 1, less_than)
25 quicksort(data, last + 1, right, less_than)
|
| /dports/lang/ocaml/ocaml-4.05.0/testsuite/tests/asmcomp/ |
| H A D | Makefile | 67 CASES=fib tak quicksort quicksort2 soli \
68 arith checkbound tagged-fib tagged-integr tagged-quicksort tagged-tak \
72 ARGS_quicksort=-DSORT -DFUN=quicksort main.c
73 ARGS_quicksort2=-DSORT -DFUN=quicksort main.c
80 ARGS_tagged-quicksort=-DSORT -DFUN=quicksort main.c
|
| H A D | Makefile.bak | 67 CASES=fib tak quicksort quicksort2 soli \
68 arith checkbound tagged-fib tagged-integr tagged-quicksort tagged-tak \
72 ARGS_quicksort=-DSORT -DFUN=quicksort main.c
73 ARGS_quicksort2=-DSORT -DFUN=quicksort main.c
80 ARGS_tagged-quicksort=-DSORT -DFUN=quicksort main.c
|
| /dports/lang/ocaml-nox11/ocaml-4.05.0/testsuite/tests/asmcomp/ |
| H A D | Makefile | 67 CASES=fib tak quicksort quicksort2 soli \
68 arith checkbound tagged-fib tagged-integr tagged-quicksort tagged-tak \
72 ARGS_quicksort=-DSORT -DFUN=quicksort main.c
73 ARGS_quicksort2=-DSORT -DFUN=quicksort main.c
80 ARGS_tagged-quicksort=-DSORT -DFUN=quicksort main.c
|
| /dports/databases/timescaledb/timescaledb-2.5.1/tsl/test/expected/ |
| H A D | transparent_decompression-14.out | 388 Sort Method: quicksort
413 Sort Method: quicksort
464 Sort Method: quicksort
1533 Sort Method: quicksort
1597 Sort Method: quicksort
1693 Sort Method: quicksort
1715 Sort Method: quicksort
1741 Sort Method: quicksort
3436 Sort Method: quicksort
3458 Sort Method: quicksort
[all …]
|
| H A D | transparent_decompression-13.out | 388 Sort Method: quicksort
413 Sort Method: quicksort
464 Sort Method: quicksort
1533 Sort Method: quicksort
1597 Sort Method: quicksort
1693 Sort Method: quicksort
1715 Sort Method: quicksort
1741 Sort Method: quicksort
3436 Sort Method: quicksort
3458 Sort Method: quicksort
[all …]
|
| H A D | transparent_decompression_queries.out | 101 Sort Method: quicksort
105 Sort Method: quicksort
110 Sort Method: quicksort
115 Sort Method: quicksort
120 Sort Method: quicksort
145 Sort Method: quicksort
150 Sort Method: quicksort
155 Sort Method: quicksort
160 Sort Method: quicksort
195 Sort Method: quicksort
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libc/src/stdlib/ |
| H A D | qsort.cpp | 96 static void quicksort(const Array &array) { in quicksort() function
105 quicksort(array.make_array(0, split_index)); in quicksort()
106 quicksort(array.make_array(split_index, array.size() - split_index)); in quicksort()
116 internal::quicksort(internal::Array(reinterpret_cast<uint8_t *>(array),
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Heuristics/ |
| H A D | qsort.c | 60 void quicksort(sweep_data *data, int len) in quicksort() function
68 quicksort(data, pivot); in quicksort()
70 quicksort(data+pivot+1, len-pivot-1); in quicksort()
|