| /dports/devel/thrust/thrust-1.9.5/testing/backend/cuda/ |
| H A D | unique.cu | 49 Vector::iterator new_last; in TestUniqueDevice() local
57 new_last = new_last_vec[0]; in TestUniqueDevice()
59 ASSERT_EQUAL(new_last - data.begin(), 7); in TestUniqueDevice()
74 new_last = new_last_vec[0]; in TestUniqueDevice()
76 ASSERT_EQUAL(new_last - data.begin(), 3); in TestUniqueDevice()
115 Vector::iterator new_last; in TestUniqueCudaStreams() local
132 …new_last = thrust::unique(thrust::cuda::par.on(s), data.begin(), new_last, is_equal_div_10_unique<… in TestUniqueCudaStreams()
182 Vector::iterator new_last; in TestUniqueCopyDevice() local
190 new_last = new_last_vec[0]; in TestUniqueCopyDevice()
207 new_last = new_last_vec[0]; in TestUniqueCopyDevice()
[all …]
|
| H A D | unique_by_key.cu | 74 iter_pair new_last; in TestUniqueByKeyDevice() local
85 new_last = new_last_vec[0]; in TestUniqueByKeyDevice()
87 ASSERT_EQUAL(new_last.first - keys.begin(), 5); in TestUniqueByKeyDevice()
88 ASSERT_EQUAL(new_last.second - values.begin(), 5); in TestUniqueByKeyDevice()
110 new_last = new_last_vec[0]; in TestUniqueByKeyDevice()
112 ASSERT_EQUAL(new_last.first - keys.begin(), 3); in TestUniqueByKeyDevice()
146 iter_pair new_last; in TestUniqueByKeyCudaStreams() local
218 iter_pair new_last; in TestUniqueCopyByKeyDevice() local
232 new_last = new_last_vec[0]; in TestUniqueCopyByKeyDevice()
257 new_last = new_last_vec[0]; in TestUniqueCopyByKeyDevice()
[all …]
|
| H A D | reduce_by_key.cu | 102 iterator_pair new_last; in TestReduceByKeyDevice() local
116 new_last = new_last_vec[0]; in TestReduceByKeyDevice()
118 ASSERT_EQUAL(new_last.first - output_keys.begin(), 5); in TestReduceByKeyDevice()
119 ASSERT_EQUAL(new_last.second - output_values.begin(), 5); in TestReduceByKeyDevice()
141 new_last = new_last_vec[0]; in TestReduceByKeyDevice()
143 ASSERT_EQUAL(new_last.first - output_keys.begin(), 3); in TestReduceByKeyDevice()
144 ASSERT_EQUAL(new_last.second - output_values.begin(), 3); in TestReduceByKeyDevice()
162 new_last = new_last_vec[0]; in TestReduceByKeyDevice()
164 ASSERT_EQUAL(new_last.first - output_keys.begin(), 5); in TestReduceByKeyDevice()
165 ASSERT_EQUAL(new_last.second - output_values.begin(), 5); in TestReduceByKeyDevice()
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 230 node_ptr new_last(0); in move_first_n_backwards() local
238 new_last = first; in move_first_n_backwards()
244 old_last = new_last; in move_first_n_backwards()
261 NodeTraits::set_next(new_last, node_ptr(0)); in move_first_n_backwards()
263 ret.second = new_last; in move_first_n_backwards()
287 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
291 new_last = node_traits::get_next(new_last); in move_first_n_forward()
304 for( new_last = p in move_first_n_forward()
306 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
315 NodeTraits::set_next(new_last, node_ptr(0)); in move_first_n_forward()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 242 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
250 new_last = first; in move_first_n_backwards()
256 old_last = new_last; in move_first_n_backwards()
273 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
275 ret.second = new_last; in move_first_n_backwards()
299 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
303 new_last = node_traits::get_next(new_last); in move_first_n_forward()
316 for( new_last = p in move_first_n_forward()
318 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
327 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 235 node_ptr new_last = node_ptr(); in move_first_n_backwards() local
243 new_last = first; in move_first_n_backwards()
249 old_last = new_last; in move_first_n_backwards()
266 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_backwards()
268 ret.second = new_last; in move_first_n_backwards()
292 node_ptr old_last(first), next_to_it, new_last(p); in move_first_n_forward() local
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
309 for( new_last = p in move_first_n_forward()
311 ; new_last = node_traits::get_next(new_last)){ in move_first_n_forward()
320 NodeTraits::set_next(new_last, node_ptr()); in move_first_n_forward()
[all …]
|