Home
last modified time | relevance | path

Searched refs:NELEM (Results 1 – 25 of 376) sorted by relevance

12345678910>>...16

/dports/devel/ga/ga-5.8/global/testing/
H A Dpatch_enumf.F63 dims(1) = NELEM
71 do i = 1, NELEM
74 do i = 1, NELEM
92 real buf(NELEM)
93 real get(NELEM)
99 dims(1) = NELEM
107 do i = 1, NELEM
110 do i = 1, NELEM
135 dims(1) = NELEM
143 do i = 1, NELEM
[all …]
H A Dscan_addc.c11 #define NELEM 200000 macro
33 for (i=0; i<NELEM; i++) { \
71 int dims[] = {NELEM}; \
75 int ahi[] = {NELEM-1}; \
100 for (i=0; i<NELEM; i++) { \
142 for (i=0; i<NELEM; i++) { \
219 printf("NELEM=%d\n", NELEM); in test_scan_add()
232 case 6: lo=NELEM/4; hi=NELEM/2; excl=0; break; in test_scan_add()
233 case 7: lo=NELEM/4; hi=NELEM/2; excl=1; break; in test_scan_add()
234 case 8: lo=NELEM/3; hi=NELEM/3+10; excl=0; break; in test_scan_add()
[all …]
H A Dpatch_enumc.c12 #define NELEM 200000 macro
22 hi[0] = NELEM-1; \
23 dims[0] = NELEM; \
25 buf = (T*)malloc(sizeof(T) * NELEM); \
26 get = (T*)malloc(sizeof(T) * NELEM); \
32 for (i=0; i<NELEM; i++) { \
35 for (i=0; i<NELEM; i++) { \
63 hi[0] = NELEM-1; \
64 dims[0] = NELEM; \
71 for (i=0; i<NELEM; i++) { \
[all …]
H A Dscan_copyc.c11 #define NELEM 200000 macro
40 int dims[] = {NELEM}; \
44 int ahi[] = {NELEM-1}; \
55 local_src = malloc(sizeof(T)*NELEM); \
56 local_dst = malloc(sizeof(T)*NELEM); \
58 buf_dst = malloc(sizeof(T)*NELEM); \
68 for (i=0; i<NELEM; i++) { \
96 for (i=0; i<NELEM; i++) { \
173 printf("NELEM=%d\n", NELEM); in test_scan_copy()
183 case 3: lo=NELEM/4; hi=NELEM/2; break; in test_scan_copy()
[all …]
H A Dunpackc.c11 #define NELEM 200000 macro
48 for (i=0; i<NELEM; i++) { \
71 int dims[] = {NELEM}; \
73 int ahi[] = {NELEM-1}; \
81 buf_dst = malloc(sizeof(T)*NELEM); \
206 printf("NELEM=%d\n", NELEM); in test_unpack()
213 case 0: lo=0; hi=NELEM-1; break; in test_unpack()
214 case 1: lo=1; hi=NELEM-1; break; in test_unpack()
215 case 2: lo=0; hi=NELEM-2; break; in test_unpack()
216 case 3: lo=NELEM/4; hi=NELEM/2; break; in test_unpack()
[all …]
H A Dpackc.c11 #define NELEM 200000 macro
49 for (i=0; i<NELEM; i++) { \
72 int dims[] = {NELEM}; \
74 int ahi[] = {NELEM-1}; \
82 buf_dst = malloc(sizeof(T)*NELEM); \
207 printf("NELEM=%d\n", NELEM); in test_pack()
214 case 0: lo=0; hi=NELEM-1; break; in test_pack()
215 case 1: lo=1; hi=NELEM-1; break; in test_pack()
216 case 2: lo=0; hi=NELEM-2; break; in test_pack()
217 case 3: lo=NELEM/4; hi=NELEM/2; break; in test_pack()
[all …]
/dports/devel/boost-docs/boost_1_72_0/libs/sort/benchmark/parallel/
H A Dbenchmark_numbers.cpp32 #define NELEM 100000000 macro
89 Generator_sorted_end (NELEM / 10); in main()
131 A.reserve (NELEM); in Generator_random()
146 A.reserve (NELEM); in Generator_sorted()
157 A.reserve (NELEM); in Generator_sorted_end()
173 A.reserve (NELEM); in Generator_sorted_middle()
182 A.resize ( NELEM); in Generator_sorted_middle()
206 A.reserve (NELEM); in Generator_reverse_sorted()
215 A.reserve (NELEM); in Generator_reverse_sorted_end()
231 A.reserve (NELEM); in Generator_reverse_sorted_middle()
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/libs/sort/benchmark/parallel/
H A Dbenchmark_numbers.cpp32 #define NELEM 100000000 macro
89 Generator_sorted_end (NELEM / 10); in main()
131 A.reserve (NELEM); in Generator_random()
146 A.reserve (NELEM); in Generator_sorted()
157 A.reserve (NELEM); in Generator_sorted_end()
173 A.reserve (NELEM); in Generator_sorted_middle()
182 A.resize ( NELEM); in Generator_sorted_middle()
206 A.reserve (NELEM); in Generator_reverse_sorted()
215 A.reserve (NELEM); in Generator_reverse_sorted_end()
231 A.reserve (NELEM); in Generator_reverse_sorted_middle()
[all …]
/dports/devel/boost-libs/boost_1_72_0/libs/sort/benchmark/parallel/
H A Dbenchmark_numbers.cpp32 #define NELEM 100000000 macro
89 Generator_sorted_end (NELEM / 10); in main()
131 A.reserve (NELEM); in Generator_random()
146 A.reserve (NELEM); in Generator_sorted()
157 A.reserve (NELEM); in Generator_sorted_end()
173 A.reserve (NELEM); in Generator_sorted_middle()
182 A.resize ( NELEM); in Generator_sorted_middle()
206 A.reserve (NELEM); in Generator_reverse_sorted()
215 A.reserve (NELEM); in Generator_reverse_sorted_end()
231 A.reserve (NELEM); in Generator_reverse_sorted_middle()
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/libs/sort/benchmark/parallel/
H A Dbenchmark_numbers.cpp32 #define NELEM 100000000 macro
89 Generator_sorted_end (NELEM / 10); in main()
131 A.reserve (NELEM); in Generator_random()
146 A.reserve (NELEM); in Generator_sorted()
157 A.reserve (NELEM); in Generator_sorted_end()
173 A.reserve (NELEM); in Generator_sorted_middle()
182 A.resize ( NELEM); in Generator_sorted_middle()
206 A.reserve (NELEM); in Generator_reverse_sorted()
215 A.reserve (NELEM); in Generator_reverse_sorted_end()
231 A.reserve (NELEM); in Generator_reverse_sorted_middle()
[all …]
/dports/devel/hyperscan/boost_1_75_0/libs/sort/benchmark/parallel/
H A Dbenchmark_numbers.cpp32 #define NELEM 100000000 macro
89 Generator_sorted_end (NELEM / 10); in main()
131 A.reserve (NELEM); in Generator_random()
146 A.reserve (NELEM); in Generator_sorted()
157 A.reserve (NELEM); in Generator_sorted_end()
173 A.reserve (NELEM); in Generator_sorted_middle()
182 A.resize ( NELEM); in Generator_sorted_middle()
206 A.reserve (NELEM); in Generator_reverse_sorted()
215 A.reserve (NELEM); in Generator_reverse_sorted_end()
231 A.reserve (NELEM); in Generator_reverse_sorted_middle()
[all …]
/dports/devel/boost-docs/boost_1_72_0/libs/sort/benchmark/single/
H A Dbenchmark_numbers.cpp32 #define NELEM 100000000 macro
94 Generator_sorted_end (NELEM / 10); in main()
136 A.reserve (NELEM); in Generator_random()
151 A.reserve (NELEM); in Generator_sorted()
162 A.reserve (NELEM); in Generator_sorted_end()
178 A.reserve (NELEM); in Generator_sorted_middle()
187 A.resize ( NELEM); in Generator_sorted_middle()
211 A.reserve (NELEM); in Generator_reverse_sorted()
220 A.reserve (NELEM); in Generator_reverse_sorted_end()
236 A.reserve (NELEM); in Generator_reverse_sorted_middle()
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/libs/sort/benchmark/single/
H A Dbenchmark_numbers.cpp32 #define NELEM 100000000 macro
94 Generator_sorted_end (NELEM / 10); in main()
136 A.reserve (NELEM); in Generator_random()
151 A.reserve (NELEM); in Generator_sorted()
162 A.reserve (NELEM); in Generator_sorted_end()
178 A.reserve (NELEM); in Generator_sorted_middle()
187 A.resize ( NELEM); in Generator_sorted_middle()
211 A.reserve (NELEM); in Generator_reverse_sorted()
220 A.reserve (NELEM); in Generator_reverse_sorted_end()
236 A.reserve (NELEM); in Generator_reverse_sorted_middle()
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/libs/sort/benchmark/single/
H A Dbenchmark_numbers.cpp32 #define NELEM 100000000 macro
94 Generator_sorted_end (NELEM / 10); in main()
136 A.reserve (NELEM); in Generator_random()
151 A.reserve (NELEM); in Generator_sorted()
162 A.reserve (NELEM); in Generator_sorted_end()
178 A.reserve (NELEM); in Generator_sorted_middle()
187 A.resize ( NELEM); in Generator_sorted_middle()
211 A.reserve (NELEM); in Generator_reverse_sorted()
220 A.reserve (NELEM); in Generator_reverse_sorted_end()
236 A.reserve (NELEM); in Generator_reverse_sorted_middle()
[all …]
/dports/devel/boost-libs/boost_1_72_0/libs/sort/benchmark/single/
H A Dbenchmark_numbers.cpp32 #define NELEM 100000000 macro
94 Generator_sorted_end (NELEM / 10); in main()
136 A.reserve (NELEM); in Generator_random()
151 A.reserve (NELEM); in Generator_sorted()
162 A.reserve (NELEM); in Generator_sorted_end()
178 A.reserve (NELEM); in Generator_sorted_middle()
187 A.resize ( NELEM); in Generator_sorted_middle()
211 A.reserve (NELEM); in Generator_reverse_sorted()
220 A.reserve (NELEM); in Generator_reverse_sorted_end()
236 A.reserve (NELEM); in Generator_reverse_sorted_middle()
[all …]
/dports/devel/hyperscan/boost_1_75_0/libs/sort/benchmark/single/
H A Dbenchmark_numbers.cpp32 #define NELEM 100000000 macro
94 Generator_sorted_end (NELEM / 10); in main()
136 A.reserve (NELEM); in Generator_random()
151 A.reserve (NELEM); in Generator_sorted()
162 A.reserve (NELEM); in Generator_sorted_end()
178 A.reserve (NELEM); in Generator_sorted_middle()
187 A.resize ( NELEM); in Generator_sorted_middle()
211 A.reserve (NELEM); in Generator_reverse_sorted()
220 A.reserve (NELEM); in Generator_reverse_sorted_end()
236 A.reserve (NELEM); in Generator_reverse_sorted_middle()
[all …]
/dports/devel/boost-docs/boost_1_72_0/libs/sort/test/
H A Dtest_insert_sort.cpp84 const uint32_t NELEM = 6667; in test02() local
89 for (uint32_t i = 0; i < NELEM; ++i) A.push_back (NELEM - i); in test02()
92 insert_sort (A.begin ( ) + 1000, A.begin ( ) + (1000 + NELEM), comp); in test02()
94 for (iter_t it = A.begin ( ) + 1000; it != A.begin ( ) + (1000 + NELEM); in test02()
99 BOOST_CHECK (A[ 998 ] == 0 and A[ 999 ] == 0 and A[ 1000 + NELEM ] == 0 and in test02()
100 A[ 1001 + NELEM ] == 0); in test02()
105 for (uint32_t i = 0; i < NELEM; ++i) A.push_back (NELEM - i); in test02()
108 insert_sort (A.begin ( ) + 1000, A.begin ( ) + (1000 + NELEM), comp); in test02()
110 for (iter_t it = A.begin ( ) + 1001; it != A.begin ( ) + (1000 + NELEM); in test02()
116 A[ 1000 + NELEM ] == 999999999 and in test02()
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/libs/sort/test/
H A Dtest_insert_sort.cpp84 const uint32_t NELEM = 6667; in test02() local
89 for (uint32_t i = 0; i < NELEM; ++i) A.push_back (NELEM - i); in test02()
92 insert_sort (A.begin ( ) + 1000, A.begin ( ) + (1000 + NELEM), comp); in test02()
94 for (iter_t it = A.begin ( ) + 1000; it != A.begin ( ) + (1000 + NELEM); in test02()
99 BOOST_CHECK (A[ 998 ] == 0 and A[ 999 ] == 0 and A[ 1000 + NELEM ] == 0 and in test02()
100 A[ 1001 + NELEM ] == 0); in test02()
105 for (uint32_t i = 0; i < NELEM; ++i) A.push_back (NELEM - i); in test02()
108 insert_sort (A.begin ( ) + 1000, A.begin ( ) + (1000 + NELEM), comp); in test02()
110 for (iter_t it = A.begin ( ) + 1001; it != A.begin ( ) + (1000 + NELEM); in test02()
116 A[ 1000 + NELEM ] == 999999999 and in test02()
[all …]
/dports/devel/boost-libs/boost_1_72_0/libs/sort/test/
H A Dtest_insert_sort.cpp84 const uint32_t NELEM = 6667; in test02() local
89 for (uint32_t i = 0; i < NELEM; ++i) A.push_back (NELEM - i); in test02()
92 insert_sort (A.begin ( ) + 1000, A.begin ( ) + (1000 + NELEM), comp); in test02()
94 for (iter_t it = A.begin ( ) + 1000; it != A.begin ( ) + (1000 + NELEM); in test02()
99 BOOST_CHECK (A[ 998 ] == 0 and A[ 999 ] == 0 and A[ 1000 + NELEM ] == 0 and in test02()
100 A[ 1001 + NELEM ] == 0); in test02()
105 for (uint32_t i = 0; i < NELEM; ++i) A.push_back (NELEM - i); in test02()
108 insert_sort (A.begin ( ) + 1000, A.begin ( ) + (1000 + NELEM), comp); in test02()
110 for (iter_t it = A.begin ( ) + 1001; it != A.begin ( ) + (1000 + NELEM); in test02()
116 A[ 1000 + NELEM ] == 999999999 and in test02()
[all …]
/dports/devel/hyperscan/boost_1_75_0/libs/sort/test/
H A Dtest_insert_sort.cpp84 const uint32_t NELEM = 6667; in test02() local
89 for (uint32_t i = 0; i < NELEM; ++i) A.push_back (NELEM - i); in test02()
92 insert_sort (A.begin ( ) + 1000, A.begin ( ) + (1000 + NELEM), comp); in test02()
94 for (iter_t it = A.begin ( ) + 1000; it != A.begin ( ) + (1000 + NELEM); in test02()
99 BOOST_CHECK (A[ 998 ] == 0 and A[ 999 ] == 0 and A[ 1000 + NELEM ] == 0 and in test02()
100 A[ 1001 + NELEM ] == 0); in test02()
105 for (uint32_t i = 0; i < NELEM; ++i) A.push_back (NELEM - i); in test02()
108 insert_sort (A.begin ( ) + 1000, A.begin ( ) + (1000 + NELEM), comp); in test02()
110 for (iter_t it = A.begin ( ) + 1001; it != A.begin ( ) + (1000 + NELEM); in test02()
116 A[ 1000 + NELEM ] == 999999999 and in test02()
[all …]
/dports/net/mpich/mpich-3.4.3/test/mpi/coll/
H A Dbcastzerotype.c27 #define NELEM (10) in main() macro
28 buf = malloc(NELEM * sizeof(int)); in main()
31 for (i = 0; i < NELEM; i++) { in main()
32 buf[i] = wrank * NELEM + i; in main()
42 MPI_Bcast(buf, NELEM, type, 0, MPI_COMM_WORLD); in main()
45 for (i = 0; i < NELEM; i++) { in main()
46 assert(buf[i] == wrank * NELEM + i); in main()
/dports/net/mpich2/mpich2-1.5/test/mpi/coll/
H A Dbcastzerotype.c21 #define NELEM (10) in main() macro
22 buf = malloc(NELEM*sizeof(int)); in main()
25 for (i = 0; i < NELEM; i++) { in main()
26 buf[i] = wrank * NELEM + i; in main()
36 MPI_Bcast(buf, NELEM, type, 0, MPI_COMM_WORLD); in main()
39 for (i = 0; i < NELEM; i++) { in main()
40 assert(buf[i] == wrank * NELEM + i); in main()
/dports/lang/eisl/eisl-2.35/
H A Dsyn_highlight.c5 #define NELEM(X) (sizeof(X) / sizeof((X)[0])) macro
96 for (i = 0; i < (int) NELEM(syntax); i++) { in in_syntax_table()
109 for (i = 0; i < (int) NELEM(builtin); i++) { in in_builtin_table()
122 for (i = 0; i < (int) NELEM(extended); i++) { in in_extended_table()
135 for (i = 0; i < (int) NELEM(special); i++) { in in_special_table()
164 for (i = 0; i < (int) NELEM(syntax); i++) { in gather_fuzzy_matches()
170 for (i = 0; i < (int) NELEM(builtin); i++) { in gather_fuzzy_matches()
176 for (i = 0; i < (int) NELEM(extended); i++) { in gather_fuzzy_matches()
/dports/astro/wcslib/wcslib-7.7/Fortran/test/
H A Dtlin.f35 INTEGER NAXIS, NCOORD, NELEM
36 PARAMETER (NAXIS = 5, NCOORD = 2, NELEM = 9)
39 DOUBLE PRECISION CDELT(NAXIS), CRPIX(NAXIS), IMG(NELEM,2),
40 : PC(NAXIS,NAXIS), PIX0(NELEM,2), PIX(NELEM,2), RESID,
89 STATUS = LINP2X (LIN, NCOORD, NELEM, PIX0, IMG)
102 STATUS = LINX2P (LIN, NCOORD, NELEM, IMG, PIX)
/dports/astro/wcslib/wcslib-7.7/C/test/
H A Dtwcsmix.c457 #define NELEM 9 macro
462 double freq, img[361][NELEM], lat, lng, phi[361], pix[361][NELEM], step,
561 worldlng += NELEM;
586 pixlng += NELEM;
587 pixlat += NELEM;
632 pixlng += NELEM;
633 pixlat += NELEM;
686 pixlng += NELEM;
687 pixlat += NELEM;
735 pixlng += NELEM;
[all …]

12345678910>>...16