本文整理汇总了C++中ranges::partial_sum方法的典型用法代码示例。如果您正苦于以下问题：C++ ranges::partial_sum方法的具体用法？C++ ranges::partial_sum怎么用？C++ ranges::partial_sum使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类ranges的用法示例。
在下文中一共展示了ranges::partial_sum方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: test
template<class InIter, class OutIter, class InSent = InIter> void test()
{
using ranges::partial_sum;
using ranges::make_subrange;
{ // iterator
int ir[] = {1, 3, 6, 10, 15};
const unsigned s = sizeof(ir) / sizeof(ir[0]);
int ia[] = {1, 2, 3, 4, 5};
int ib[s] = {0};
auto r = partial_sum(InIter(ia), InSent(ia + s), OutIter(ib));
CHECK(base(r.in) == ia + s);
CHECK(base(r.out) == ib + s);
for(unsigned i = 0; i < s; ++i)
{
CHECK(ib[i] == ir[i]);
}
}
{ // range + output iterator
int ir[] = {1, 3, 6, 10, 15};
const unsigned s = sizeof(ir) / sizeof(ir[0]);
int ia[] = {1, 2, 3, 4, 5};
int ib[s] = {0};
auto rng = make_subrange(InIter(ia), InSent(ia + s));
auto r = partial_sum(rng, OutIter(ib));
CHECK(base(r.in) == ia + s);
CHECK(base(r.out) == ib + s);
for(unsigned i = 0; i < s; ++i)
{
CHECK(ib[i] == ir[i]);
}
}
{ // range + output range
int ir[] = {1, 3, 6, 10, 15};
const unsigned s = sizeof(ir) / sizeof(ir[0]);
int ia[] = {1, 2, 3, 4, 5};
int ib[s] = {0};
auto rng = make_subrange(InIter(ia), InSent(ia + s));
auto orng = make_subrange(OutIter(ib), OutIter(ib + s));
auto r = partial_sum(rng, orng);
CHECK(base(r.in) == ia + s);
CHECK(base(r.out) == ib + s);
for(unsigned i = 0; i < s; ++i)
{
CHECK(ib[i] == ir[i]);
}
}
{
int ia[] = {1, 2, 3, 4, 5};
int ir[] = {1, -1, -4, -8, -13};
const unsigned s = sizeof(ia) / sizeof(ia[0]);
int ib[s] = {0};
auto rng = make_subrange(InIter(ia), InSent(ia + s));
auto orng = make_subrange(OutIter(ib), OutIter(ib + s));
auto r = partial_sum(rng, orng, std::minus<int>());
CHECK(base(r.in) == ia + s);
CHECK(base(r.out) == ib + s);
for(unsigned i = 0; i < s; ++i)
{
CHECK(ib[i] == ir[i]);
}
}
}示例2: main
int main()
{
test<input_iterator<const int *>, input_iterator<int *>>();
test<input_iterator<const int *>, forward_iterator<int *>>();
test<input_iterator<const int *>, bidirectional_iterator<int *>>();
test<input_iterator<const int *>, random_access_iterator<int *>>();
test<input_iterator<const int *>, int *>();
test<forward_iterator<const int *>, input_iterator<int *>>();
test<forward_iterator<const int *>, forward_iterator<int *>>();
test<forward_iterator<const int *>, bidirectional_iterator<int *>>();
test<forward_iterator<const int *>, random_access_iterator<int *>>();
test<forward_iterator<const int *>, int *>();
test<bidirectional_iterator<const int *>, input_iterator<int *>>();
test<bidirectional_iterator<const int *>, forward_iterator<int *>>();
test<bidirectional_iterator<const int *>, bidirectional_iterator<int *>>();
test<bidirectional_iterator<const int *>, random_access_iterator<int *>>();
test<bidirectional_iterator<const int *>, int *>();
test<random_access_iterator<const int *>, input_iterator<int *>>();
test<random_access_iterator<const int *>, forward_iterator<int *>>();
test<random_access_iterator<const int *>, bidirectional_iterator<int *>>();
test<random_access_iterator<const int *>, random_access_iterator<int *>>();
test<random_access_iterator<const int *>, int *>();
test<const int *, input_iterator<int *>>();
test<const int *, forward_iterator<int *>>();
test<const int *, bidirectional_iterator<int *>>();
test<const int *, random_access_iterator<int *>>();
test<const int *, int *>();
using ranges::partial_sum;
{ // Test projections
S ia[] = {{1}, {2}, {3}, {4}, {5}};
int ir[] = {1, 3, 6, 10, 15};
const unsigned s = sizeof(ir) / sizeof(ir[0]);
int ib[s] = {0};
auto r = partial_sum(ranges::begin(ia), ranges::begin(ia) + s, ranges::begin(ib),
std::plus<int>(), &S::i);
CHECK(base(r.in) == ia + s);
CHECK(base(r.out) == ib + s);
for(unsigned i = 0; i < s; ++i)
{
CHECK(ib[i] == ir[i]);
}
}
{ // Test BinaryOp
int ia[] = {1, 2, 3, 4, 5};
int ir[] = {1, 2, 6, 24, 120};
const unsigned s = sizeof(ir) / sizeof(ir[0]);
int ib[s] = {0};
auto r = partial_sum(ia, ranges::begin(ib), std::multiplies<int>());
CHECK(base(r.in) == ia + s);
CHECK(base(r.out) == ib + s);
for(unsigned i = 0; i < s; ++i)
{
CHECK(ib[i] == ir[i]);
}
}
{ // Test calling it with an array
int ia[] = {1, 2, 3, 4, 5};
int ir[] = {1, 2, 6, 24, 120};
const unsigned s = sizeof(ir) / sizeof(ir[0]);
int ib[s] = {0};
auto r = partial_sum(ia, ib, std::multiplies<int>());
CHECK(base(r.in) == ia + s);
CHECK(base(r.out) == ib + s);
for(unsigned i = 0; i < s; ++i)
{
CHECK(ib[i] == ir[i]);
}
}
{ // Test calling it with proxy iterators
using namespace ranges;
int ia[] = {1, 2, 3, 4, 5};
int ib[] = {99, 99, 99, 99, 99};
int ir[] = {1, 2, 6, 24, 120};
const unsigned s = sizeof(ir) / sizeof(ir[0]);
int ic[s] = {0};
auto rng = view::zip(ia, ib);
using CR = iter_common_reference_t<iterator_t<decltype(rng)>>;
auto r = partial_sum(rng, ic, std::multiplies<int>(), [](CR p) {return p.first;});
CHECK(base(r.in) == ranges::begin(rng) + s);
CHECK(base(r.out) == ic + s);
for(unsigned i = 0; i < s; ++i)
{
CHECK(ic[i] == ir[i]);
}
}
return ::test_result();
}