/dports/devel/thrust/thrust-1.9.5/testing/ |
H A D | stable_sort_by_key_large.cu | 28 h_keys[i] = FixedVector<T,N>(rand()); in _TestStableSortByKeyWithLargeKeys() 35 thrust::stable_sort_by_key(h_keys.begin(), h_keys.end(), h_vals.begin()); in _TestStableSortByKeyWithLargeKeys() 38 ASSERT_EQUAL_QUIET(h_keys, d_keys); in _TestStableSortByKeyWithLargeKeys() 72 h_keys[i] = rand(); in _TestStableSortByKeyWithLargeValues() 79 thrust::stable_sort_by_key(h_keys.begin(), h_keys.end(), h_vals.begin()); in _TestStableSortByKeyWithLargeValues() 82 ASSERT_EQUAL_QUIET(h_keys, d_keys); in _TestStableSortByKeyWithLargeValues() 86 …thrust::stable_sort_by_key(h_keys.begin(), h_keys.end(), h_vals.begin(), greater_div_10<unsigned i… in _TestStableSortByKeyWithLargeValues() 89 ASSERT_EQUAL_QUIET(h_keys, d_keys); in _TestStableSortByKeyWithLargeValues() 123 h_keys[i] = FixedVector<T,N>(rand()); in _TestStableSortByKeyWithLargeKeysAndValues() 130 thrust::stable_sort_by_key(h_keys.begin(), h_keys.end(), h_vals.begin()); in _TestStableSortByKeyWithLargeKeysAndValues() [all …]
|
H A D | sort_by_key.cu | 92 thrust::device_vector<T> d_keys = h_keys; in TestSortAscendingKeyValue() 94 thrust::host_vector<T> h_values = h_keys; in TestSortAscendingKeyValue() 97 thrust::sort_by_key(h_keys.begin(), h_keys.end(), h_values.begin(), thrust::less<T>()); in TestSortAscendingKeyValue() 100 ASSERT_EQUAL(h_keys, d_keys); in TestSortAscendingKeyValue() 110 thrust::device_vector<int> d_keys = h_keys; in TestSortDescendingKeyValue() 115 thrust::sort_by_key(h_keys.begin(), h_keys.end(), h_values.begin(), thrust::greater<int>()); in TestSortDescendingKeyValue() 118 ASSERT_EQUAL(h_keys, d_keys); in TestSortDescendingKeyValue() 134 thrust::sort_by_key(h_keys.begin(), h_keys.end(), h_values.begin()); in TestSortByKeyBool() 137 ASSERT_EQUAL(h_keys, d_keys); in TestSortByKeyBool() 153 thrust::sort_by_key(h_keys.begin(), h_keys.end(), h_values.begin(), thrust::greater<bool>()); in TestSortByKeyBoolDescending() [all …]
|
H A D | scan_by_key.cu | 377 h_keys[i] = k; in TestInclusiveScanByKey() 391 thrust::inclusive_scan_by_key(h_keys.begin(), h_keys.end(), h_vals.begin(), h_output.begin()); in TestInclusiveScanByKey() 404 h_keys[i] = k; in TestExclusiveScanByKey() 419 thrust::exclusive_scan_by_key(h_keys.begin(), h_keys.end(), h_vals.begin(), h_output.begin()); in TestExclusiveScanByKey() 446 h_keys[i] = k; in TestInclusiveScanByKeyInPlace() 463 thrust::inclusive_scan_by_key(h_keys.begin(), h_keys.end(), h_output.begin(), h_output.begin()); in TestInclusiveScanByKeyInPlace() 476 h_keys[i] = k; in TestExclusiveScanByKeyInPlace() 503 h_keys[i] = k; in TestScanByKeyMixedTypes() 563 h_keys[i] = k; in TestScanByKeyLargeInput() 594 h_keys[i] = k; in _TestScanByKeyWithLargeTypes() [all …]
|
H A D | sort_by_key_variable_bits.cu | 25 thrust::host_vector<T> h_keys = unittest::random_integers<T>(n); in operator ()() local 29 h_keys[i] &= mask; in operator ()() 31 thrust::host_vector<T> reference = h_keys; in operator ()() 32 thrust::device_vector<T> d_keys = h_keys; in operator ()() 34 thrust::host_vector<T> h_values = h_keys; in operator ()() 39 thrust::sort_by_key(h_keys.begin(), h_keys.end(), h_values.begin()); in operator ()() 42 ASSERT_EQUAL(reference, h_keys); in operator ()() 45 ASSERT_EQUAL(h_keys, d_keys); in operator ()()
|
H A D | sort_variable_bits.cu | 24 thrust::host_vector<T> h_keys = unittest::random_integers<T>(n); in operator ()() local 28 h_keys[i] &= mask; in operator ()() 30 thrust::host_vector<T> reference = h_keys; in operator ()() 31 thrust::device_vector<T> d_keys = h_keys; in operator ()() 35 thrust::sort(h_keys.begin(), h_keys.end()); in operator ()() 38 ASSERT_EQUAL(reference, h_keys); in operator ()() 39 ASSERT_EQUAL(h_keys, d_keys); in operator ()()
|
H A D | stable_sort_large.cu | 11 thrust::host_vector< FixedVector<T,N> > h_keys(n); in _TestStableSortWithLargeKeys() local 15 h_keys[i] = FixedVector<T,N>(rand()); in _TestStableSortWithLargeKeys() 17 thrust::device_vector< FixedVector<T,N> > d_keys = h_keys; in _TestStableSortWithLargeKeys() 19 thrust::stable_sort(h_keys.begin(), h_keys.end()); in _TestStableSortWithLargeKeys() 22 ASSERT_EQUAL_QUIET(h_keys, d_keys); in _TestStableSortWithLargeKeys()
|
H A D | stable_sort_by_key.cu | 103 thrust::host_vector<T> h_keys = unittest::random_integers<T>(n); in operator ()() local 104 thrust::device_vector<T> d_keys = h_keys; in operator ()() 109 thrust::stable_sort_by_key(h_keys.begin(), h_keys.end(), h_values.begin()); in operator ()() 112 ASSERT_EQUAL(h_keys, d_keys); in operator ()() 124 thrust::host_vector<T> h_keys = unittest::random_integers<T>(n); in operator ()() local 125 thrust::device_vector<T> d_keys = h_keys; in operator ()() 130 … thrust::stable_sort_by_key(h_keys.begin(), h_keys.end(), h_values.begin(), less_div_10<T>()); in operator ()() 133 ASSERT_EQUAL(h_keys, d_keys); in operator ()()
|
H A D | unique_by_key.cu | 265 thrust::device_vector<K> d_keys = h_keys; in operator ()() 276 … HostIteratorPair h_last = thrust::unique_by_key(h_keys.begin(), h_keys.end(), h_vals.begin()); in operator ()() 282 size_t N = h_last.first - h_keys.begin(); in operator ()() 284 h_keys.resize(N); in operator ()() 289 ASSERT_EQUAL(h_keys, d_keys); in operator ()() 305 thrust::device_vector<K> d_keys = h_keys; in operator ()() 349 thrust::device_vector<K> d_keys = h_keys; in operator ()() 358 thrust::host_vector<K> h_unique_keys = h_keys; in operator ()() 366 thrust::unique_by_key_copy(h_keys.begin(), h_keys.end(), in operator ()() 387 thrust::unique_by_key_copy(h_keys.begin(), h_keys.end(), in operator ()() [all …]
|
H A D | tuple_sort.cu | 39 host_vector<T> h_keys = random_integers<T>(n); in operator ()() local 44 transform(h_keys.begin(), h_keys.end(), in operator ()() 60 transform(h_tuples.begin(), h_tuples.end(), h_keys.begin(), GetFunctor<0>()); in operator ()() 62 device_vector<T> d_keys(h_keys.size()); in operator ()() 71 ASSERT_ALMOST_EQUAL(h_keys, d_keys); in operator ()()
|
/dports/devel/thrust/thrust-1.9.5/performance/ |
H A D | host_sort.test | 9 thrust::host_vector<$KeyType> h_keys = unittest::random_integers<$KeyType>($InputSize); 10 thrust::host_vector<$KeyType> h_keys_copy(h_keys); 13 $Sort(h_keys.begin(), h_keys.end()); 15 ASSERT_EQUAL(thrust::is_sorted(h_keys.begin(), h_keys.end()), true); 20 thrust::copy(h_keys_copy.begin(), h_keys_copy.end(), h_keys.begin()); 21 $Sort(h_keys.begin(), h_keys.end());
|
H A D | host_sort_by_key.test | 8 thrust::host_vector<$KeyType> h_keys = unittest::random_integers<$KeyType>($InputSize); 9 thrust::host_vector<$KeyType> h_keys_copy(h_keys); 13 $Sort(h_keys.begin(), h_keys.end(), h_values.begin()); 15 ASSERT_EQUAL(thrust::is_sorted(h_keys.begin(), h_keys.end()), true); 20 thrust::copy(h_keys_copy.begin(), h_keys_copy.end(), h_keys.begin()); 21 $Sort(h_keys.begin(), h_keys.end(), h_values.begin());
|
H A D | binary_search.test | 9 thrust::host_vector<$KeyType> h_keys = unittest::random_integers<$KeyType>($InputSize); 10 thrust::device_vector<$KeyType> d_keys = h_keys; 12 thrust::sort(h_keys.begin(), h_keys.end()); 15 ASSERT_EQUAL(d_keys, h_keys); 23 …thrust::binary_search(h_keys.begin(), h_keys.end(), h_search.begin(), h_search.end(), h_output.beg…
|
H A D | radix_sort_bits.test | 9 thrust::host_vector<$KeyType> h_keys = unittest::random_integers<$KeyType>(InputSize); 13 h_keys[i] >>= (32 - $KeyBits); 15 thrust::device_vector<$KeyType> d_keys = h_keys; 19 thrust::stable_sort(h_keys.begin(), h_keys.end()); 22 ASSERT_EQUAL(d_keys, h_keys);
|
H A D | stl_sort.test | 8 thrust::host_vector<$KeyType> h_keys = unittest::random_integers<$KeyType>($InputSize); 9 thrust::host_vector<$KeyType> h_keys_copy = h_keys; 14 std::copy(h_keys_copy.begin(), h_keys_copy.end(), h_keys.begin()); 15 std::sort(h_keys.begin(), h_keys.end());
|
H A D | sort.test | 8 thrust::host_vector<$KeyType> h_keys = unittest::random_integers<$KeyType>($InputSize); 9 thrust::device_vector<$KeyType> d_keys = h_keys; 13 thrust::sort(h_keys.begin(), h_keys.end()); 16 ASSERT_EQUAL(d_keys, h_keys);
|
H A D | indirect_sort.test | 49 thrust::host_vector<KeyType> h_keys(N); 51 for(size_t i = 0; i < h_keys.size(); i++) 52 h_keys[i] = KeyType(rand()); 54 thrust::device_vector<KeyType> d_keys = h_keys; 60 thrust::stable_sort(h_keys.begin(), h_keys.end()); 63 ASSERT_EQUAL_QUIET(h_keys, d_keys);
|
H A D | radix_sort.test | 8 thrust::host_vector<$KeyType> h_keys = unittest::random_integers<$KeyType>($InputSize); 9 thrust::device_vector<$KeyType> d_keys = h_keys; 13 thrust::stable_sort(h_keys.begin(), h_keys.end()); 16 ASSERT_EQUAL(d_keys, h_keys);
|
/dports/misc/xgboost/xgboost-1.5.1/cub/test/ |
H A D | test_device_radix_sort.cu | 654 KeyT *h_keys, in InitializeSolution() argument 725 KeyT *h_keys, in Test() argument 892 KeyT *h_keys, in TestBackend() argument 946 KeyT *h_keys, in TestValueTypes() argument 986 KeyT *h_keys, in TestDirection() argument 1003 KeyT *h_keys, in TestBits() argument 1033 KeyT *h_keys, in TestSegments() argument 1065 KeyT *h_keys, in TestSizes() argument 1109 if (h_keys) delete[] h_keys; in TestGen() 1163 h_keys, h_values, in Test() [all …]
|
/dports/devel/bullet/bullet3-3.21/test/OpenCL/RadixSortBenchmark/ |
H A D | main.cpp | 105 K *h_keys, in TimedSort() argument 115 hostData[i] = h_keys[i]; in TimedSort() 180 h_keys[i] = hostData[i]; in TimedSort() 203 K *h_keys, in TimedSort() argument 214 hostData[i].m_key = h_keys[i]; in TimedSort() 286 h_keys[i] = hostData[i].m_key; in TimedSort() 471 K *h_keys = NULL; in TestSort() local 481 RandomBits<K>(h_keys[i], 0); in TestSort() 487 h_reference_keys[i] = h_keys[i]; in TestSort() 508 PrintValue<K>(h_keys[i]); in TestSort() [all …]
|
/dports/devel/py-bullet3/bullet3-3.21/test/OpenCL/RadixSortBenchmark/ |
H A D | main.cpp | 105 K *h_keys, in TimedSort() argument 115 hostData[i] = h_keys[i]; in TimedSort() 180 h_keys[i] = hostData[i]; in TimedSort() 203 K *h_keys, in TimedSort() argument 214 hostData[i].m_key = h_keys[i]; in TimedSort() 286 h_keys[i] = hostData[i].m_key; in TimedSort() 471 K *h_keys = NULL; in TestSort() local 481 RandomBits<K>(h_keys[i], 0); in TestSort() 487 h_reference_keys[i] = h_keys[i]; in TestSort() 508 PrintValue<K>(h_keys[i]); in TestSort() [all …]
|
/dports/misc/xgboost/xgboost-1.5.1/cub/examples/device/ |
H A D | example_device_radix_sort.cu | 96 float *h_keys, in Initialize() argument 106 RandomBits(h_keys[i]); in Initialize() 108 h_pairs[i].key = h_keys[i]; in Initialize() 115 DisplayResults(h_keys, num_items); in Initialize() 170 float *h_keys = new float[num_items]; in main() local 176 Initialize(h_keys, h_values, h_reference_keys, h_reference_values, num_items); in main() 194 …CubDebugExit(cudaMemcpy(d_keys.d_buffers[d_keys.selector], h_keys, sizeof(float) * num_items, cuda… in main() 209 if (h_keys) delete[] h_keys; in main()
|
H A D | example_device_sort_find_non_trivial_runs.cu | 98 Key *h_keys, in Initialize() argument 108 h_keys[i] = (max_key == -1) ? i : (Key) (scale * sample); in Initialize() 115 DisplayResults(h_keys, num_items); in Initialize() 131 Key *h_keys, in Solve() argument 142 h_pairs[i].key = h_keys[i]; in Solve() 236 Key *h_keys = new Key[num_items]; in main() local 245 Initialize(h_keys, h_values, num_items, max_key); in main() 246 int num_runs = Solve(h_keys, h_values, num_items, h_offsets_reference, h_lengths_reference); in main() 267 …CubDebugExit(cudaMemcpy(d_keys.d_buffers[d_keys.selector], h_keys, sizeof(float) * num_items, cuda… in main() 365 if (h_keys) delete[] h_keys; in main()
|
/dports/devel/thrust/thrust-1.9.5/testing/backend/cuda/ |
H A D | merge_sort.cu | 182 thrust::host_vector<T> h_keys = unittest::random_integers<T>(n); in TestMergeSortAscendingKeyValue() 183 thrust::device_vector<T> d_keys = h_keys; in TestMergeSortAscendingKeyValue() 188 thrust::sort_by_key(h_keys.begin(), h_keys.end(), h_values.begin(), thrust::less<T>()); in TestMergeSortAscendingKeyValue() 193 ASSERT_EQUAL(h_keys, d_keys); in TestMergeSortAscendingKeyValue() 208 thrust::host_vector<int> h_keys = unittest::random_integers<int>(n); in TestMergeSortDescendingKeyValue() 209 thrust::device_vector<int> d_keys = h_keys; in TestMergeSortDescendingKeyValue() 214 thrust::sort_by_key(h_keys.begin(), h_keys.end(), h_values.begin(), thrust::greater<int>()); in TestMergeSortDescendingKeyValue() 219 ASSERT_EQUAL(h_keys, d_keys); in TestMergeSortDescendingKeyValue() 234 thrust::host_vector<U> h_keys = unittest::random_integers<U>(n); in TestMergeSortKeyValue() 240 h_data[i] = T(h_keys[i], h_values[i]); in TestMergeSortKeyValue()
|
H A D | scan_by_key.cu | 36 thrust::host_vector<int> h_keys(n); in TestScanByKeyDevice() local 39 h_keys[i] = static_cast<int>(k); in TestScanByKeyDevice() 45 thrust::device_vector<int> d_keys = h_keys; in TestScanByKeyDevice() 57 thrust::inclusive_scan_by_key(h_keys.begin(), h_keys.end(), h_vals.begin(), h_output.begin()); in TestScanByKeyDevice() 65 thrust::exclusive_scan_by_key(h_keys.begin(), h_keys.end(), h_vals.begin(), h_output.begin()); in TestScanByKeyDevice() 73 thrust::exclusive_scan_by_key(h_keys.begin(), h_keys.end(), h_vals.begin(), h_output.begin(), 11); in TestScanByKeyDevice() 84 thrust::inclusive_scan_by_key(h_keys.begin(), h_keys.end(), h_output.begin(), h_output.begin()); in TestScanByKeyDevice() 94 …thrust::exclusive_scan_by_key(h_keys.begin(), h_keys.end(), h_output.begin(), h_output.begin(), 11… in TestScanByKeyDevice()
|
/dports/mail/mailagent/mailagent-9a14a15/agent/filter/ |
H A D | hash.c | 83 ht->h_keys = array; /* Where array of keys is stored */ 87 free(ht->h_keys); /* Free keys array */ 115 hkeys = ht->h_keys; 157 hkeys = ht->h_keys; 204 hkeys = ht->h_keys; 248 key = ht->h_keys; /* Start of array of keys */ 258 free(new_ht.h_keys); 265 free(ht->h_keys); /* To make free happy (coalescing) */ 282 hkeys = ht->h_keys; 307 hkeys = ht->h_keys + hpos; [all …]
|