forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
83 lines
3.4 KiB
C++
83 lines
3.4 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <numeric>
|
|
|
|
// template <InputIterator Iter1, InputIterator Iter2, MoveConstructible T>
|
|
// requires HasMultiply<Iter1::reference, Iter2::reference>
|
|
// && HasPlus<T, HasMultiply<Iter1::reference, Iter2::reference>::result_type>
|
|
// && HasAssign<T,
|
|
// HasPlus<T,
|
|
// HasMultiply<Iter1::reference,
|
|
// Iter2::reference>::result_type>::result_type>
|
|
// T
|
|
// inner_product(Iter1 first1, Iter1 last1, Iter2 first2, T init);
|
|
|
|
#include <numeric>
|
|
#include <cassert>
|
|
|
|
#include "test_iterators.h"
|
|
|
|
template <class Iter1, class Iter2, class T>
|
|
void
|
|
test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x)
|
|
{
|
|
assert(std::inner_product(first1, last1, first2, init) == x);
|
|
}
|
|
|
|
template <class Iter1, class Iter2>
|
|
void
|
|
test()
|
|
{
|
|
int a[] = {1, 2, 3, 4, 5, 6};
|
|
int b[] = {6, 5, 4, 3, 2, 1};
|
|
unsigned sa = sizeof(a) / sizeof(a[0]);
|
|
test(Iter1(a), Iter1(a), Iter2(b), 0, 0);
|
|
test(Iter1(a), Iter1(a), Iter2(b), 10, 10);
|
|
test(Iter1(a), Iter1(a+1), Iter2(b), 0, 6);
|
|
test(Iter1(a), Iter1(a+1), Iter2(b), 10, 16);
|
|
test(Iter1(a), Iter1(a+2), Iter2(b), 0, 16);
|
|
test(Iter1(a), Iter1(a+2), Iter2(b), 10, 26);
|
|
test(Iter1(a), Iter1(a+sa), Iter2(b), 0, 56);
|
|
test(Iter1(a), Iter1(a+sa), Iter2(b), 10, 66);
|
|
}
|
|
|
|
int main()
|
|
{
|
|
test<input_iterator<const int*>, input_iterator<const int*> >();
|
|
test<input_iterator<const int*>, forward_iterator<const int*> >();
|
|
test<input_iterator<const int*>, bidirectional_iterator<const int*> >();
|
|
test<input_iterator<const int*>, random_access_iterator<const int*> >();
|
|
test<input_iterator<const int*>, const int*>();
|
|
|
|
test<forward_iterator<const int*>, input_iterator<const int*> >();
|
|
test<forward_iterator<const int*>, forward_iterator<const int*> >();
|
|
test<forward_iterator<const int*>, bidirectional_iterator<const int*> >();
|
|
test<forward_iterator<const int*>, random_access_iterator<const int*> >();
|
|
test<forward_iterator<const int*>, const int*>();
|
|
|
|
test<bidirectional_iterator<const int*>, input_iterator<const int*> >();
|
|
test<bidirectional_iterator<const int*>, forward_iterator<const int*> >();
|
|
test<bidirectional_iterator<const int*>, bidirectional_iterator<const int*> >();
|
|
test<bidirectional_iterator<const int*>, random_access_iterator<const int*> >();
|
|
test<bidirectional_iterator<const int*>, const int*>();
|
|
|
|
test<random_access_iterator<const int*>, input_iterator<const int*> >();
|
|
test<random_access_iterator<const int*>, forward_iterator<const int*> >();
|
|
test<random_access_iterator<const int*>, bidirectional_iterator<const int*> >();
|
|
test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
|
|
test<random_access_iterator<const int*>, const int*>();
|
|
|
|
test<const int*, input_iterator<const int*> >();
|
|
test<const int*, forward_iterator<const int*> >();
|
|
test<const int*, bidirectional_iterator<const int*> >();
|
|
test<const int*, random_access_iterator<const int*> >();
|
|
test<const int*, const int*>();
|
|
}
|