| /dports/misc/xgboost/xgboost-1.5.1/cub/test/ |
| H A D | test_device_select_unique.cu | 195 (void)num_items; in CnpDispatchKernel()
252 int num_items, in Initialize() argument
259 while (i < num_items) in Initialize()
310 if (num_items > 0) in Solve()
433 num_items, num_selected, float(num_items) / num_selected, in TestPointer()
476 num_items, num_selected, float(num_items) / num_selected, in TestIterator()
515 Test<CUB, T>(num_items); in TestOp()
517 Test<CDP, T>(num_items); in TestOp()
529 if (num_items < 0) in Test()
591 if (num_items < 0) num_items = 32000000; in main()
[all …]
|
| H A D | test_device_reduce_by_key.cu | 120 num_items, in Dispatch()
318 int num_items, in Initialize() argument
325 while (i < num_items) in Initialize()
523 int num_items, in TestPointer() argument
546 num_items, num_segments, float(num_items) / num_segments, in TestPointer()
583 int num_items, in TestIterator() argument
605 num_items, num_segments, float(num_items) / num_segments, in TestIterator()
637 int num_items, in Test() argument
708 if (num_items < 0) in TestSize()
784 if (num_items < 0) num_items = 32000000; in main()
[all …]
|
| H A D | test_device_scan.cu | 443 (void)num_items; in CnpDispatchKernel()
459 num_items, in CnpDispatchKernel()
501 num_items, in Dispatch()
651 num_items, in Test()
672 num_items, in Test()
698 num_items, in Test()
746 num_items, in TestPointer()
809 num_items, in TestIterator()
920 num_items = CUB_MAX(1, num_items); in TestSize()
972 if (num_items < 0) num_items = 32000000; in main()
[all …]
|
| H A D | test_device_run_length_encode.cu | 125 num_items, in Dispatch()
173 num_items, in Dispatch()
368 int num_items, in Initialize() argument
375 while (i < num_items) in Initialize()
432 if (num_items == 0) in Solve()
631 num_items, num_runs, float(num_items) / num_runs, in TestPointer()
684 num_items, num_runs, float(num_items) / num_runs, in TestIterator()
770 if (num_items < 0) in TestSize()
785 num_items = CUB_MAX(1, num_items); in TestSize()
846 if (num_items < 0) num_items = 32000000; in main()
[all …]
|
| H A D | test_device_select_if.cu | 514 (void)num_items; in CnpDispatchKernel()
575 int num_items) in Initialize() argument
609 int num_items) in Solve() argument
740 int num_items, in TestPointer() argument
801 int num_items, in TestIterator() argument
851 int num_items) in Test() argument
867 int num_items) in TestMethod() argument
901 if (num_items < 0) in Test()
911 TestOp<T>(num_items); in Test()
984 if (num_items < 0) num_items = 32000000; in main()
[all …]
|
| H A D | test_device_radix_sort.cu | 500 (void)num_items; in CnpDispatchKernel()
655 int num_items, in InitializeSolution() argument
893 int num_items, in TestBackend() argument
947 int num_items, in TestValueTypes() argument
987 int num_items, in TestDirection() argument
1004 int num_items, in TestBits() argument
1034 int num_items, in TestSegments() argument
1069 for (int num_items = max_items; num_items > 1; num_items = (num_items + 32 - 1) / 32) in TestSizes() local
1186 int num_items = -1; in main() local
1230 if (num_items < 0) num_items = 48000000; in main()
[all …]
|
| /dports/misc/xgboost/xgboost-1.5.1/cub/examples/device/ |
| H A D | example_device_partition_flagged.cu | 73 int num_items, in Initialize() argument
80 while (i < num_items) in Initialize()
89 while (j < CUB_MIN(i + repeat, num_items)) in Initialize()
104 DisplayResults(h_in, num_items); in Initialize()
106 DisplayResults(h_flags, num_items); in Initialize()
119 int num_items) in Solve() argument
122 for (int i = 0; i < num_items; ++i) in Solve()
148 int num_items = 150; in main() local
154 args.GetCmdLineArgument("n", num_items); in main()
173 int *h_in = new int[num_items]; in main()
[all …]
|
| H A D | example_device_select_flagged.cu | 73 int num_items, in Initialize() argument
80 while (i < num_items) in Initialize()
89 while (j < CUB_MIN(i + repeat, num_items)) in Initialize()
104 DisplayResults(h_in, num_items); in Initialize()
106 DisplayResults(h_flags, num_items); in Initialize()
119 int num_items) in Solve() argument
122 for (int i = 0; i < num_items; ++i) in Solve()
148 int num_items = 150; in main() local
154 args.GetCmdLineArgument("n", num_items); in main()
173 int *h_in = new int[num_items]; in main()
[all …]
|
| H A D | example_device_radix_sort.cu | 100 int num_items) in Initialize() argument
102 Pair *h_pairs = new Pair[num_items]; in Initialize()
104 for (int i = 0; i < num_items; ++i) in Initialize()
115 DisplayResults(h_keys, num_items); in Initialize()
119 DisplayResults(h_values, num_items); in Initialize()
123 std::stable_sort(h_pairs, h_pairs + num_items); in Initialize()
125 for (int i = 0; i < num_items; ++i) in Initialize()
144 int num_items = 150; in main() local
149 args.GetCmdLineArgument("n", num_items); in main()
172 int *h_values = new int[num_items]; in main()
[all …]
|
| H A D | example_device_scan.cu | 70 int num_items) in Initialize() argument
72 for (int i = 0; i < num_items; ++i) in Initialize()
78 DisplayResults(h_in, num_items); in Initialize()
89 int num_items) in Solve() argument
94 for (int i = 0; i < num_items; ++i) in Solve()
115 int num_items = 150; in main() local
137 num_items, (int) sizeof(int)); in main()
141 int* h_in = new int[num_items]; in main()
142 int* h_reference = new int[num_items]; in main()
145 Initialize(h_in, num_items); in main()
[all …]
|
| H A D | example_device_select_unique.cu | 71 int num_items, in Initialize() argument
76 while (i < num_items) in Initialize()
99 DisplayResults(h_in, num_items); in Initialize()
111 int num_items) in Solve() argument
114 if (num_items > 0) in Solve()
120 for (int i = 1; i < num_items; ++i) in Solve()
142 int num_items = 150; in main() local
148 args.GetCmdLineArgument("n", num_items); in main()
167 int* h_in = new int[num_items]; in main()
168 int* h_reference = new int[num_items]; in main()
[all …]
|
| H A D | example_device_partition_if.cu | 85 int num_items, in Initialize() argument
90 while (i < num_items) in Initialize()
113 DisplayResults(h_in, num_items); in Initialize()
127 int num_items) in Solve() argument
130 for (int i = 0; i < num_items; ++i) in Solve()
156 int num_items = 150; in main() local
162 args.GetCmdLineArgument("n", num_items); in main()
181 int *h_in = new int[num_items]; in main()
182 int *h_reference = new int[num_items]; in main()
192 Initialize(h_in, num_items, max_segment); in main()
[all …]
|
| /dports/devel/uthash/uthash-2.1.0/tests/ |
| H A D | test8.ans | 1 num_items in hash: 1
2 num_items in hash: 2
3 num_items in hash: 3
4 num_items in hash: 4
5 num_items in hash: 5
6 num_items in hash: 6
7 num_items in hash: 7
8 num_items in hash: 8
9 num_items in hash: 9
10 num_items in hash: 10
[all …]
|
| /dports/devel/z88dk/z88dk/ext/uthash/tests/ |
| H A D | test8.ans | 1 num_items in hash: 1
2 num_items in hash: 2
3 num_items in hash: 3
4 num_items in hash: 4
5 num_items in hash: 5
6 num_items in hash: 6
7 num_items in hash: 7
8 num_items in hash: 8
9 num_items in hash: 9
10 num_items in hash: 10
[all …]
|
| /dports/graphics/blender/blender-2.91.0/source/blender/blenkernel/intern/ |
| H A D | lattice_deform_test.cc | 67 for (int i = 0; i < num_items; i++) { in test_lattice_deform()
85 const int32_t num_items = 1; in TEST() local
89 test_lattice_deform(&ctx, num_items); in TEST()
94 const int32_t num_items = 1000; in TEST() local
98 test_lattice_deform(&ctx, num_items); in TEST()
103 const int32_t num_items = 10000; in TEST() local
107 test_lattice_deform(&ctx, num_items); in TEST()
112 const int32_t num_items = 100000; in TEST() local
116 test_lattice_deform(&ctx, num_items); in TEST()
121 const int32_t num_items = 1000000; in TEST() local
[all …]
|
| /dports/science/libctl/libctl-4.5.0/utils/ |
| H A D | geom-ctl-io.c | 55 o->vertices.num_items = o0->vertices.num_items; in prism_copy()
66 o->vertices_p.num_items = o0->vertices_p.num_items; in prism_copy()
90 o->vertices_top_p.num_items = o0->vertices_top_p.num_items; in prism_copy()
98 o->vertices_top.num_items = o0->vertices_top.num_items; in prism_copy()
107 o->workspace.num_items = o0->workspace.num_items; in prism_copy()
177 o->component_objects.num_items = o0->component_objects.num_items; in compound_geometric_object_copy()
257 if (o->vertices.num_items != o0->vertices.num_items) in prism_equal()
272 if (o->vertices_p.num_items != o0->vertices_p.num_items) in prism_equal()
299 if (o->vertices_top_p.num_items != o0->vertices_top_p.num_items) in prism_equal()
308 if (o->vertices_top.num_items != o0->vertices_top.num_items) in prism_equal()
[all …]
|
| /dports/sysutils/bareos-server/bareos-Release-20.0.3/core/src/lib/ |
| H A D | alist.cc | 47 } else if (num_items == max_items) { in GrowList()
56 if (num_items == 0) { in first()
65 if (num_items == 0) { in last()
68 cur_item = num_items; in last()
69 return items[num_items - 1]; in last()
75 if (cur_item >= num_items) { in next()
97 if (num_items == 0) { in prepend()
98 items[num_items++] = item; in prepend()
103 num_items++; in prepend()
113 items[num_items++] = item; in append()
[all …]
|
| /dports/sysutils/bareos18-client/bareos-Release-18.2.12/core/src/lib/ |
| H A D | alist.cc | 48 } else if (num_items == max_items) { in GrowList()
57 if (num_items == 0) { in first()
66 if (num_items == 0) { in last()
69 cur_item = num_items; in last()
70 return items[num_items-1]; in last()
76 if (cur_item >= num_items) { in next()
97 if (num_items == 0) { in prepend()
98 items[num_items++] = item; in prepend()
105 num_items++; in prepend()
114 items[num_items++] = item; in append()
[all …]
|
| /dports/sysutils/bareos19-server/bareos-Release-19.2.11/core/src/lib/ |
| H A D | alist.cc | 47 } else if (num_items == max_items) { in GrowList()
56 if (num_items == 0) { in first()
65 if (num_items == 0) { in last()
68 cur_item = num_items; in last()
69 return items[num_items - 1]; in last()
75 if (cur_item >= num_items) { in next()
97 if (num_items == 0) { in prepend()
98 items[num_items++] = item; in prepend()
103 num_items++; in prepend()
113 items[num_items++] = item; in append()
[all …]
|
| /dports/sysutils/bareos19-client/bareos-Release-19.2.11/core/src/lib/ |
| H A D | alist.cc | 47 } else if (num_items == max_items) { in GrowList()
56 if (num_items == 0) { in first()
65 if (num_items == 0) { in last()
68 cur_item = num_items; in last()
69 return items[num_items - 1]; in last()
75 if (cur_item >= num_items) { in next()
97 if (num_items == 0) { in prepend()
98 items[num_items++] = item; in prepend()
103 num_items++; in prepend()
113 items[num_items++] = item; in append()
[all …]
|
| /dports/sysutils/burp/burp-2.4.0/src/win32/burp/ |
| H A D | alist.c | 58 else if(num_items==max_items) in grow_list()
68 if(!num_items) return NULL; in first()
74 if(!num_items) return NULL; in last()
75 cur_item = num_items; in last()
76 return items[num_items-1]; in last()
81 if(cur_item>=num_items) return NULL; in next()
94 if(!num_items) in prepend()
96 items[num_items++]=item; in prepend()
101 num_items++; in prepend()
108 items[num_items++]=item; in append()
[all …]
|
| /dports/sysutils/burp-devel/burp-2.5.4/src/win32/utest/ |
| H A D | alist.c | 58 else if(num_items==max_items) in grow_list()
68 if(!num_items) return NULL; in first()
74 if(!num_items) return NULL; in last()
75 cur_item = num_items; in last()
76 return items[num_items-1]; in last()
81 if(cur_item>=num_items) return NULL; in next()
94 if(!num_items) in prepend()
96 items[num_items++]=item; in prepend()
101 num_items++; in prepend()
108 items[num_items++]=item; in append()
[all …]
|
| /dports/sysutils/burp/burp-2.4.0/src/win32/utest/ |
| H A D | alist.c | 58 else if(num_items==max_items) in grow_list()
68 if(!num_items) return NULL; in first()
74 if(!num_items) return NULL; in last()
75 cur_item = num_items; in last()
76 return items[num_items-1]; in last()
81 if(cur_item>=num_items) return NULL; in next()
94 if(!num_items) in prepend()
96 items[num_items++]=item; in prepend()
101 num_items++; in prepend()
108 items[num_items++]=item; in append()
[all …]
|
| /dports/sysutils/burp-devel/burp-2.5.4/src/win32/burp/ |
| H A D | alist.c | 58 else if(num_items==max_items) in grow_list()
68 if(!num_items) return NULL; in first()
74 if(!num_items) return NULL; in last()
75 cur_item = num_items; in last()
76 return items[num_items-1]; in last()
81 if(cur_item>=num_items) return NULL; in next()
94 if(!num_items) in prepend()
96 items[num_items++]=item; in prepend()
101 num_items++; in prepend()
108 items[num_items++]=item; in append()
[all …]
|
| /dports/sysutils/bareos-client/bareos-Release-20.0.3/core/src/lib/ |
| H A D | alist.cc | 47 } else if (num_items == max_items) { in GrowList()
56 if (num_items == 0) { in first()
65 if (num_items == 0) { in last()
68 cur_item = num_items; in last()
69 return items[num_items - 1]; in last()
75 if (cur_item >= num_items) { in next()
97 if (num_items == 0) { in prepend()
98 items[num_items++] = item; in prepend()
103 num_items++; in prepend()
113 items[num_items++] = item; in append()
[all …]
|