| /dports/comms/wsjtz/wsjtx/lib/ |
| H A D | sort.f90 | 1 subroutine sort(n,arr) subroutine
3 integer n,m,nstack
4 real arr(n)
6 integer i,ir,j,jstack,k,l,istack(nstack)
7 real a,temp
14 1 if(ir-l.lt.m) then
22 2 arr(i+1)=a
65 stop 'Bounds error in sort.f90' argument
81 if(jstack.gt.nstack) stop 'nstack too small in sort' argument
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/jdk/java/util/Arrays/largeMemory/ |
| H A D | ParallelPrefix.java | 43 import static org.testng.Assert.*; in sort()
64 public static void setup() { in sort()
85 arraySizeCollection = new int[]{ in sort()
98 Integer::min}); in sort()
141 } in sort()
145 @Test(dataProvider="intSet") in sort()
195 String[] sequentialResult = data.clone(); in sort()
200 String[] parallelResult = data.clone(); in sort()
210 public void testNPEs() { in sort()
229 // null op w/ range in sort()
[all …]
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/jdk/java/util/Arrays/java.base/java/util/ |
| H A D | SortingHelper.java | 43 public void sort(Object a) { in sort() method
85 public void sort(Object[] a) { in sort() method
98 public void sort(Object a) { in sort() method
140 public void sort(Object[] a) { in sort() method
153 public void sort(Object a) { in sort() method
195 public void sort(Object[] a) { in sort() method
208 public void sort(Object a) { in sort() method
250 public void sort(Object[] a) { in sort() method
264 public void sort(Object a) { in sort() method
307 public void sort(Object[] a) { in sort() method
[all …]
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/jdk/java/util/Arrays/java.base/java/util/ |
| H A D | SortingHelper.java | 43 public void sort(Object a) { in sort() method
85 public void sort(Object[] a) { in sort() method
98 public void sort(Object a) { in sort() method
140 public void sort(Object[] a) { in sort() method
153 public void sort(Object a) { in sort() method
195 public void sort(Object[] a) { in sort() method
208 public void sort(Object a) { in sort() method
250 public void sort(Object[] a) { in sort() method
264 public void sort(Object a) { in sort() method
307 public void sort(Object[] a) { in sort() method
[all …]
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/jdk/java/util/Arrays/java.base/java/util/ |
| H A D | SortingHelper.java | 43 public void sort(Object a) { in sort() method
85 public void sort(Object[] a) { in sort() method
98 public void sort(Object a) { in sort() method
140 public void sort(Object[] a) { in sort() method
153 public void sort(Object a) { in sort() method
195 public void sort(Object[] a) { in sort() method
208 public void sort(Object a) { in sort() method
250 public void sort(Object[] a) { in sort() method
264 public void sort(Object a) { in sort() method
307 public void sort(Object[] a) { in sort() method
[all …]
|
| /dports/math/py-pandas/pandas-1.2.5/pandas/tests/indexes/datetimes/ |
| H A D | test_setops.py | 36 def test_union2(self, sort): argument
44 def test_union3(self, sort, box): argument
56 def test_union(self, tz, sort): argument
87 def test_union_coverage(self, sort): argument
97 def test_union_bug_1730(self, sort): argument
109 def test_union_bug_1745(self, sort): argument
132 def test_union_bug_4564(self, sort): argument
308 def test_difference(self, tz, sort): argument
333 def test_difference_freq(self, sort): argument
394 def test_union(self, sort): argument
[all …]
|
| /dports/math/vampire/vampire-4.5.1/Test/ |
| H A D | SyntaxSugar.hpp | 64 #define __REPEAT_1(sort) sort argument
65 #define __REPEAT_2(sort) sort, __REPEAT_1(sort) argument
66 #define __REPEAT_3(sort) sort, __REPEAT_2(sort) argument
67 #define __REPEAT_4(sort) sort, __REPEAT_3(sort) argument
68 #define __REPEAT_5(sort) sort, __REPEAT_4(sort) argument
69 #define __REPEAT_6(sort) sort, __REPEAT_5(sort) argument
70 #define __REPEAT_7(sort) sort, __REPEAT_6(sort) argument
71 #define __REPEAT_8(sort) sort, __REPEAT_7(sort) argument
72 #define __REPEAT_9(sort) sort, __REPEAT_8(sort) argument
98 #define __CLSR_CONS_UNINTERPRETED(name, sort) \ argument
[all …]
|
| /dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/observer/src/ |
| H A D | multitrace.erl | 151 sort(GC) -> function
153 sort([{mbuf_size,M}|Rest],{_,R,S,O,H,OB,B}) -> function
155 sort([{recent_size,R}|Rest],{M,_,S,O,H,OB,B}) -> function
157 sort([{stack_size,S}|Rest],{M,R,_,O,H,OB,B}) -> function
159 sort([{old_heap_size,O}|Rest],{M,R,S,_,H,OB,B}) -> function
161 sort([{heap_size,H}|Rest],{M,R,S,O,_,OB,B}) -> function
163 sort([{old_heap_block_size,OB}|Rest],{M,R,S,O,H,_,B}) -> function
165 sort([{heap_block_size,B}|Rest],{M,R,S,O,H,OB,_}) -> function
167 sort([],GC) -> function
|
| /dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/observer/src/ |
| H A D | multitrace.erl | 151 sort(GC) -> function
153 sort([{mbuf_size,M}|Rest],{_,R,S,O,H,OB,B}) -> function
155 sort([{recent_size,R}|Rest],{M,_,S,O,H,OB,B}) -> function
157 sort([{stack_size,S}|Rest],{M,R,_,O,H,OB,B}) -> function
159 sort([{old_heap_size,O}|Rest],{M,R,S,_,H,OB,B}) -> function
161 sort([{heap_size,H}|Rest],{M,R,S,O,_,OB,B}) -> function
163 sort([{old_heap_block_size,OB}|Rest],{M,R,S,O,H,_,B}) -> function
165 sort([{heap_block_size,B}|Rest],{M,R,S,O,H,OB,_}) -> function
167 sort([],GC) -> function
|
| /dports/lang/erlang-runtime24/otp-OTP-24.1.7/lib/observer/src/ |
| H A D | multitrace.erl | 151 sort(GC) -> function
153 sort([{mbuf_size,M}|Rest],{_,R,S,O,H,OB,B}) -> function
155 sort([{recent_size,R}|Rest],{M,_,S,O,H,OB,B}) -> function
157 sort([{stack_size,S}|Rest],{M,R,_,O,H,OB,B}) -> function
159 sort([{old_heap_size,O}|Rest],{M,R,S,_,H,OB,B}) -> function
161 sort([{heap_size,H}|Rest],{M,R,S,O,_,OB,B}) -> function
163 sort([{old_heap_block_size,OB}|Rest],{M,R,S,O,H,_,B}) -> function
165 sort([{heap_block_size,B}|Rest],{M,R,S,O,H,OB,_}) -> function
167 sort([],GC) -> function
|
| /dports/lang/erlang-wx/otp-OTP-24.1.7/lib/observer/src/ |
| H A D | multitrace.erl | 151 sort(GC) -> function
153 sort([{mbuf_size,M}|Rest],{_,R,S,O,H,OB,B}) -> function
155 sort([{recent_size,R}|Rest],{M,_,S,O,H,OB,B}) -> function
157 sort([{stack_size,S}|Rest],{M,R,_,O,H,OB,B}) -> function
159 sort([{old_heap_size,O}|Rest],{M,R,S,_,H,OB,B}) -> function
161 sort([{heap_size,H}|Rest],{M,R,S,O,_,OB,B}) -> function
163 sort([{old_heap_block_size,OB}|Rest],{M,R,S,O,H,_,B}) -> function
165 sort([{heap_block_size,B}|Rest],{M,R,S,O,H,OB,_}) -> function
167 sort([],GC) -> function
|
| /dports/lang/erlang/otp-OTP-24.1.7/lib/observer/src/ |
| H A D | multitrace.erl | 151 sort(GC) -> function
153 sort([{mbuf_size,M}|Rest],{_,R,S,O,H,OB,B}) -> function
155 sort([{recent_size,R}|Rest],{M,_,S,O,H,OB,B}) -> function
157 sort([{stack_size,S}|Rest],{M,R,_,O,H,OB,B}) -> function
159 sort([{old_heap_size,O}|Rest],{M,R,S,_,H,OB,B}) -> function
161 sort([{heap_size,H}|Rest],{M,R,S,O,_,OB,B}) -> function
163 sort([{old_heap_block_size,OB}|Rest],{M,R,S,O,H,_,B}) -> function
165 sort([{heap_block_size,B}|Rest],{M,R,S,O,H,OB,_}) -> function
167 sort([],GC) -> function
|
| /dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/observer/src/ |
| H A D | multitrace.erl | 151 sort(GC) -> function
153 sort([{mbuf_size,M}|Rest],{_,R,S,O,H,OB,B}) -> function
155 sort([{recent_size,R}|Rest],{M,_,S,O,H,OB,B}) -> function
157 sort([{stack_size,S}|Rest],{M,R,_,O,H,OB,B}) -> function
159 sort([{old_heap_size,O}|Rest],{M,R,S,_,H,OB,B}) -> function
161 sort([{heap_size,H}|Rest],{M,R,S,O,_,OB,B}) -> function
163 sort([{old_heap_block_size,OB}|Rest],{M,R,S,O,H,_,B}) -> function
165 sort([{heap_block_size,B}|Rest],{M,R,S,O,H,OB,_}) -> function
167 sort([],GC) -> function
|
| /dports/lang/erlang-java/otp-OTP-24.1.7/lib/observer/src/ |
| H A D | multitrace.erl | 151 sort(GC) -> function
153 sort([{mbuf_size,M}|Rest],{_,R,S,O,H,OB,B}) -> function
155 sort([{recent_size,R}|Rest],{M,_,S,O,H,OB,B}) -> function
157 sort([{stack_size,S}|Rest],{M,R,_,O,H,OB,B}) -> function
159 sort([{old_heap_size,O}|Rest],{M,R,S,_,H,OB,B}) -> function
161 sort([{heap_size,H}|Rest],{M,R,S,O,_,OB,B}) -> function
163 sort([{old_heap_block_size,OB}|Rest],{M,R,S,O,H,_,B}) -> function
165 sort([{heap_block_size,B}|Rest],{M,R,S,O,H,OB,_}) -> function
167 sort([],GC) -> function
|
| /dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/util/ |
| H A D | sort.h | 47 struct sort { struct
52 * Effect: Sort n elements of type sortdata_t in the array a. argument
57 mergesort_r(sortdata_t *a, const int n, sortextra_t &extra) in mergesort_r() argument
78 mergesort_internal(sortdata_t *as[2], const int which, const int n, sortextra_t &extra) in mergesort_internal() argument
100 …merge_c(sortdata_t *dest, const sortdata_t *a, const int an, const sortdata_t *b, const int bn, so… in merge_c() argument
120 …binsearch(const sortdata_t &key, const sortdata_t *a, const int n, const int abefore, sortextra_t … in binsearch() argument
146 …merge(sortdata_t *dest, const sortdata_t *a_, const int an_, const sortdata_t *b_, const int bn_, … in merge() argument
166 quicksort_r(sortdata_t *a, const int n, sortextra_t &extra) in quicksort_r() argument
|
| /dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/util/ |
| H A D | sort.h | 47 struct sort { struct
52 * Effect: Sort n elements of type sortdata_t in the array a. argument
57 mergesort_r(sortdata_t *a, const int n, sortextra_t &extra) in mergesort_r() argument
78 mergesort_internal(sortdata_t *as[2], const int which, const int n, sortextra_t &extra) in mergesort_internal() argument
100 …merge_c(sortdata_t *dest, const sortdata_t *a, const int an, const sortdata_t *b, const int bn, so… in merge_c() argument
120 …binsearch(const sortdata_t &key, const sortdata_t *a, const int n, const int abefore, sortextra_t … in binsearch() argument
146 …merge(sortdata_t *dest, const sortdata_t *a_, const int an_, const sortdata_t *b_, const int bn_, … in merge() argument
166 quicksort_r(sortdata_t *a, const int n, sortextra_t &extra) in quicksort_r() argument
|
| /dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/util/ |
| H A D | sort.h | 47 struct sort { struct
52 * Effect: Sort n elements of type sortdata_t in the array a. argument
57 mergesort_r(sortdata_t *a, const int n, sortextra_t &extra) in mergesort_r() argument
78 mergesort_internal(sortdata_t *as[2], const int which, const int n, sortextra_t &extra) in mergesort_internal() argument
100 …merge_c(sortdata_t *dest, const sortdata_t *a, const int an, const sortdata_t *b, const int bn, so… in merge_c() argument
120 …binsearch(const sortdata_t &key, const sortdata_t *a, const int n, const int abefore, sortextra_t … in binsearch() argument
146 …merge(sortdata_t *dest, const sortdata_t *a_, const int an_, const sortdata_t *b_, const int bn_, … in merge() argument
166 quicksort_r(sortdata_t *a, const int n, sortextra_t &extra) in quicksort_r() argument
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/storage/tokudb/PerconaFT/util/ |
| H A D | sort.h | 47 struct sort { struct
52 * Effect: Sort n elements of type sortdata_t in the array a. argument
57 mergesort_r(sortdata_t *a, const int n, sortextra_t &extra) in mergesort_r() argument
78 mergesort_internal(sortdata_t *as[2], const int which, const int n, sortextra_t &extra) in mergesort_internal() argument
100 …merge_c(sortdata_t *dest, const sortdata_t *a, const int an, const sortdata_t *b, const int bn, so… in merge_c() argument
120 …binsearch(const sortdata_t &key, const sortdata_t *a, const int n, const int abefore, sortextra_t … in binsearch() argument
146 …merge(sortdata_t *dest, const sortdata_t *a_, const int an_, const sortdata_t *b_, const int bn_, … in merge() argument
166 quicksort_r(sortdata_t *a, const int n, sortextra_t &extra) in quicksort_r() argument
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/tokudb/PerconaFT/util/ |
| H A D | sort.h | 47 struct sort { struct
52 * Effect: Sort n elements of type sortdata_t in the array a. argument
57 mergesort_r(sortdata_t *a, const int n, sortextra_t &extra) in mergesort_r() argument
78 mergesort_internal(sortdata_t *as[2], const int which, const int n, sortextra_t &extra) in mergesort_internal() argument
100 …merge_c(sortdata_t *dest, const sortdata_t *a, const int an, const sortdata_t *b, const int bn, so… in merge_c() argument
120 …binsearch(const sortdata_t &key, const sortdata_t *a, const int n, const int abefore, sortextra_t … in binsearch() argument
146 …merge(sortdata_t *dest, const sortdata_t *a_, const int an_, const sortdata_t *b_, const int bn_, … in merge() argument
166 quicksort_r(sortdata_t *a, const int n, sortextra_t &extra) in quicksort_r() argument
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/storage/tokudb/PerconaFT/util/ |
| H A D | sort.h | 47 struct sort { struct
52 * Effect: Sort n elements of type sortdata_t in the array a. argument
57 mergesort_r(sortdata_t *a, const int n, sortextra_t &extra) in mergesort_r() argument
78 mergesort_internal(sortdata_t *as[2], const int which, const int n, sortextra_t &extra) in mergesort_internal() argument
100 …merge_c(sortdata_t *dest, const sortdata_t *a, const int an, const sortdata_t *b, const int bn, so… in merge_c() argument
120 …binsearch(const sortdata_t &key, const sortdata_t *a, const int n, const int abefore, sortextra_t … in binsearch() argument
146 …merge(sortdata_t *dest, const sortdata_t *a_, const int an_, const sortdata_t *b_, const int bn_, … in merge() argument
166 quicksort_r(sortdata_t *a, const int n, sortextra_t &extra) in quicksort_r() argument
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/storage/tokudb/PerconaFT/util/ |
| H A D | sort.h | 47 struct sort { struct
52 * Effect: Sort n elements of type sortdata_t in the array a. argument
57 mergesort_r(sortdata_t *a, const int n, sortextra_t &extra) in mergesort_r() argument
78 mergesort_internal(sortdata_t *as[2], const int which, const int n, sortextra_t &extra) in mergesort_internal() argument
100 …merge_c(sortdata_t *dest, const sortdata_t *a, const int an, const sortdata_t *b, const int bn, so… in merge_c() argument
120 …binsearch(const sortdata_t &key, const sortdata_t *a, const int n, const int abefore, sortextra_t … in binsearch() argument
146 …merge(sortdata_t *dest, const sortdata_t *a_, const int an_, const sortdata_t *b_, const int bn_, … in merge() argument
166 quicksort_r(sortdata_t *a, const int n, sortextra_t &extra) in quicksort_r() argument
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/storage/tokudb/PerconaFT/util/ |
| H A D | sort.h | 47 struct sort { struct
52 * Effect: Sort n elements of type sortdata_t in the array a. argument
57 mergesort_r(sortdata_t *a, const int n, sortextra_t &extra) in mergesort_r() argument
78 mergesort_internal(sortdata_t *as[2], const int which, const int n, sortextra_t &extra) in mergesort_internal() argument
100 …merge_c(sortdata_t *dest, const sortdata_t *a, const int an, const sortdata_t *b, const int bn, so… in merge_c() argument
120 …binsearch(const sortdata_t &key, const sortdata_t *a, const int n, const int abefore, sortextra_t … in binsearch() argument
146 …merge(sortdata_t *dest, const sortdata_t *a_, const int an_, const sortdata_t *b_, const int bn_, … in merge() argument
166 quicksort_r(sortdata_t *a, const int n, sortextra_t &extra) in quicksort_r() argument
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/storage/tokudb/PerconaFT/util/ |
| H A D | sort.h | 47 struct sort { struct
52 * Effect: Sort n elements of type sortdata_t in the array a. argument
57 mergesort_r(sortdata_t *a, const int n, sortextra_t &extra) in mergesort_r() argument
78 mergesort_internal(sortdata_t *as[2], const int which, const int n, sortextra_t &extra) in mergesort_internal() argument
100 …merge_c(sortdata_t *dest, const sortdata_t *a, const int an, const sortdata_t *b, const int bn, so… in merge_c() argument
120 …binsearch(const sortdata_t &key, const sortdata_t *a, const int n, const int abefore, sortextra_t … in binsearch() argument
146 …merge(sortdata_t *dest, const sortdata_t *a_, const int an_, const sortdata_t *b_, const int bn_, … in merge() argument
166 quicksort_r(sortdata_t *a, const int n, sortextra_t &extra) in quicksort_r() argument
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/storage/tokudb/PerconaFT/util/ |
| H A D | sort.h | 47 struct sort { struct
52 * Effect: Sort n elements of type sortdata_t in the array a. argument
57 mergesort_r(sortdata_t *a, const int n, sortextra_t &extra) in mergesort_r() argument
78 mergesort_internal(sortdata_t *as[2], const int which, const int n, sortextra_t &extra) in mergesort_internal() argument
100 …merge_c(sortdata_t *dest, const sortdata_t *a, const int an, const sortdata_t *b, const int bn, so… in merge_c() argument
120 …binsearch(const sortdata_t &key, const sortdata_t *a, const int n, const int abefore, sortextra_t … in binsearch() argument
146 …merge(sortdata_t *dest, const sortdata_t *a_, const int an_, const sortdata_t *b_, const int bn_, … in merge() argument
166 quicksort_r(sortdata_t *a, const int n, sortextra_t &extra) in quicksort_r() argument
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/storage/tokudb/PerconaFT/util/ |
| H A D | sort.h | 47 struct sort { struct
52 * Effect: Sort n elements of type sortdata_t in the array a. argument
57 mergesort_r(sortdata_t *a, const int n, sortextra_t &extra) in mergesort_r() argument
78 mergesort_internal(sortdata_t *as[2], const int which, const int n, sortextra_t &extra) in mergesort_internal() argument
100 …merge_c(sortdata_t *dest, const sortdata_t *a, const int an, const sortdata_t *b, const int bn, so… in merge_c() argument
120 …binsearch(const sortdata_t &key, const sortdata_t *a, const int n, const int abefore, sortextra_t … in binsearch() argument
146 …merge(sortdata_t *dest, const sortdata_t *a_, const int an_, const sortdata_t *b_, const int bn_, … in merge() argument
166 quicksort_r(sortdata_t *a, const int n, sortextra_t &extra) in quicksort_r() argument
|