| /third_party/boost/libs/algorithm/test/ |
| D | copy_n_test1.cpp | 38 ba::copy_n ( c.begin (), 0, back_inserter ( v )); in test_sequence()
40 ba::copy_n ( c.begin (), 0U, back_inserter ( v )); in test_sequence()
46 ba::copy_n ( c.begin (), 1, back_inserter ( v )); in test_sequence()
51 ba::copy_n ( c.begin (), 1U, back_inserter ( v )); in test_sequence()
57 ba::copy_n ( c.begin (), c.size () / 2, back_inserter ( v )); in test_sequence()
63 ba::copy_n ( c.begin (), c.size () / 2 + 1, back_inserter ( v )); in test_sequence()
69 ba::copy_n ( c.begin (), c.size (), back_inserter ( v )); in test_sequence()
87 out = ba::copy_n ( from, 0, out ); // Copy none in test_constexpr()
90 out = ba::copy_n ( from, sz, out ); // Copy all in test_constexpr()
|
| /third_party/boost/libs/range/doc/reference/algorithm_ext/ |
| D | copy_n.qbk | 6 [section:copy_n copy_n]
12 OutputIterator copy_n(const SinglePassRange& rng, Size n, OutputIterator out);
17 `copy_n` is provided to completely replicate the standard algorithm header,
21 `copy_n` copies elements from `[boost::begin(rng), boost::begin(rng) + n)` to the range `[out, out …
25 Defined in the header file `boost/range/algorithm_ext/copy_n.hpp`
|
| /third_party/boost/libs/compute/test/ |
| D | test_functional_unpack.cpp | 34 compute::copy_n(data1, 4, input1.begin(), queue); in BOOST_AUTO_TEST_CASE()
35 compute::copy_n(data2, 4, input2.begin(), queue); in BOOST_AUTO_TEST_CASE()
62 compute::copy_n(data1, 4, input1.begin(), queue); in BOOST_AUTO_TEST_CASE()
63 compute::copy_n(data2, 4, input2.begin(), queue); in BOOST_AUTO_TEST_CASE()
64 compute::copy_n(data3, 4, input3.begin(), queue); in BOOST_AUTO_TEST_CASE()
86 compute::copy_n(reinterpret_cast<int2_ *>(data), 4, input.begin(), queue); in BOOST_AUTO_TEST_CASE()
|
| D | test_nth_element.cpp | 29 boost::compute::copy_n(data, 10, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
43 boost::compute::copy_n(data, 10, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
55 boost::compute::copy_n(data, 9, v.begin(), queue); in BOOST_AUTO_TEST_CASE()
72 boost::compute::copy_n(data, 9, v.begin(), queue); in BOOST_AUTO_TEST_CASE()
92 boost::compute::copy_n(data, 10, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
105 boost::compute::copy_n(data, 10, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
|
| D | test_rotate.cpp | 27 boost::compute::copy_n(data, 10, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
41 boost::compute::copy_n(data, 10, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
52 boost::compute::copy_n(data, 10, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
63 boost::compute::copy_n(data, 10, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
|
| D | test_rotate_copy.cpp | 28 boost::compute::copy_n(data, 10, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
43 boost::compute::copy_n(data, 10, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
55 boost::compute::copy_n(data, 10, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
67 boost::compute::copy_n(data, 10, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
|
| D | test_merge.cpp | 33 boost::compute::copy_n(data1, 4, v1.begin(), queue); in BOOST_AUTO_TEST_CASE()
34 boost::compute::copy_n(data2, 4, v2.begin(), queue); in BOOST_AUTO_TEST_CASE()
151 boost::compute::copy_n(data1, 8, v1.begin(), queue); in BOOST_AUTO_TEST_CASE()
152 boost::compute::copy_n(data2, 8, v2.begin(), queue); in BOOST_AUTO_TEST_CASE()
|
| D | test_sort_by_transform.cpp | 53 compute::copy_n( in BOOST_AUTO_TEST_CASE()
87 compute::copy_n( in BOOST_AUTO_TEST_CASE()
|
| D | test_functional_bind.cpp | 49 compute::copy_n(data, 4, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
64 compute::copy_n(data, 4, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
83 compute::copy_n(data, 4, vector.begin(), queue); in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/libs/compute/example/ |
| D | black_scholes.cpp | 66 compute::copy_n(stock_price_data.begin(), N, stock_price.begin(), queue); in main()
67 compute::copy_n(option_strike_data.begin(), N, option_strike.begin(), queue); in main()
68 compute::copy_n(option_years_data.begin(), N, option_years.begin(), queue); in main()
142 compute::copy_n(put_result.begin(), 1, &put0, queue); in main()
143 compute::copy_n(call_result.begin(), 1, &call0, queue); in main()
|
| /third_party/re2/re2/ |
| D | sparse_array.h | 273 std::copy_n(src.sparse_.data(), src.max_size(), sparse_.data()); in SparseArray()
274 std::copy_n(src.dense_.data(), src.max_size(), dense_.data()); in SparseArray()
294 std::copy_n(src.sparse_.data(), src.max_size(), sparse_.data());
295 std::copy_n(src.dense_.data(), src.max_size(), dense_.data());
334 std::copy_n(sparse_.data(), old_max_size, a.data()); in resize()
335 std::copy_n(dense_.data(), old_max_size, b.data()); in resize()
|
| /third_party/boost/libs/iterator/test/ |
| D | generator_iterator_test.cpp | 33 template<class InputIterator, class Size, class OutputIterator> OutputIterator copy_n( InputIterato… in copy_n() function
51 ::copy_n( in, 4, v ); in copy_test()
|
| /third_party/boost/boost/range/algorithm_ext/ |
| D | copy_n.hpp | 35 inline OutputIterator copy_n(const SinglePassRange& rng, Size n, OutputIterator out) in copy_n() function
50 using ::boost::range::copy_n;
|
| /third_party/boost/boost/compute/container/ |
| D | dynamic_bitset.hpp | 159 copy_n(m_bits.begin() + block, 1, &block_value, queue); in set()
170 copy_n(&block_value, 1, m_bits.begin() + block, queue); in set()
180 copy_n(m_bits.begin() + block, 1, &block_value, queue); in test()
|
| /third_party/boost/libs/compute/include/boost/compute/container/ |
| D | dynamic_bitset.hpp | 159 copy_n(m_bits.begin() + block, 1, &block_value, queue); in set()
170 copy_n(&block_value, 1, m_bits.begin() + block, queue); in set()
180 copy_n(m_bits.begin() + block, 1, &block_value, queue); in test()
|
| /third_party/boost/boost/multi_array/ |
| D | algorithm.hpp | 53 OutputIter copy_n(InputIter first, Size count, in copy_n() function
94 copy_n(InputIter first, Size count, OutputIter result) {
|
| D | storage_order.hpp | 39 boost::detail::multi_array::copy_n(ordering,NumDims,ordering_.begin()); in general_storage_order()
40 boost::detail::multi_array::copy_n(ascending,NumDims,ascending_.begin()); in general_storage_order()
|
| /third_party/skia/include/effects/ |
| D | SkColorMatrix.h | 46 void setRowMajor(const float src[20]) { std::copy_n(src, 20, fMat.begin()); } in setRowMajor()
47 void getRowMajor(float dst[20]) const { std::copy_n(fMat.begin(), 20, dst); } in getRowMajor()
|
| /third_party/boost/libs/compute/include/boost/compute/interop/eigen/ |
| D | core.hpp | 30 ::boost::compute::copy_n(matrix.data(), matrix.size(), buffer, queue); in eigen_copy_matrix_to_buffer()
39 ::boost::compute::copy_n(buffer, matrix.size(), matrix.data(), queue); in eigen_copy_buffer_to_matrix()
|
| /third_party/boost/boost/compute/interop/eigen/ |
| D | core.hpp | 30 ::boost::compute::copy_n(matrix.data(), matrix.size(), buffer, queue); in eigen_copy_matrix_to_buffer()
39 ::boost::compute::copy_n(buffer, matrix.size(), matrix.data(), queue); in eigen_copy_buffer_to_matrix()
|
| /third_party/boost/boost/compute/algorithm/detail/ |
| D | reduce_by_key.hpp | 84 boost::compute::copy_n(keys_first, count, keys_result, queue); in dispatch_reduce_by_key()
85 boost::compute::copy_n(values_first, count, values_result, queue); in dispatch_reduce_by_key()
|
| /third_party/boost/libs/compute/include/boost/compute/algorithm/detail/ |
| D | reduce_by_key.hpp | 84 boost::compute::copy_n(keys_first, count, keys_result, queue); in dispatch_reduce_by_key()
85 boost::compute::copy_n(values_first, count, values_result, queue); in dispatch_reduce_by_key()
|
| /third_party/boost/boost/gil/extension/numeric/ |
| D | kernel.hpp | 112 detail::copy_n(elements, size, this->begin()); in kernel_1d()
136 detail::copy_n(elements, Size, this->begin()); in kernel_1d_fixed()
286 detail::copy_n(elements, size, this->begin()); in kernel_2d()
320 detail::copy_n(elements, Size * Size, this->begin()); in kernel_2d_fixed()
|
| /third_party/skia/src/gpu/effects/ |
| D | GrConvexPolyEffect.cpp | 134 std::copy_n(cpe.fEdges.begin(), n, fPrevEdges.begin()); in onMakeProgramImpl()
156 std::copy_n(edges, 3*n, fEdges.begin()); in GrConvexPolyEffect()
170 std::copy_n(that.fEdges.begin(), 3*that.fEdgeCount, fEdges.begin()); in GrConvexPolyEffect()
|
| /third_party/nghttp2/src/ |
| D | asio_server_http2_handler.h | 119 std::copy_n(buf_, buflen_, std::begin(buffer)); in on_write()
145 std::copy_n(data, nread, std::begin(buffer) + len); in on_write()
|