//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // template // requires HasMultiply // && HasPlus::result_type> // && HasAssign::result_type>::result_type> // T // inner_product(Iter1 first1, Iter1 last1, Iter2 first2, T init); #include #include #include "test_iterators.h" template void test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) { assert(std::inner_product(first1, last1, first2, init) == x); } template 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 >(); test, forward_iterator >(); test, bidirectional_iterator >(); test, random_access_iterator >(); test, const int*>(); test, input_iterator >(); test, forward_iterator >(); test, bidirectional_iterator >(); test, random_access_iterator >(); test, const int*>(); test, input_iterator >(); test, forward_iterator >(); test, bidirectional_iterator >(); test, random_access_iterator >(); test, const int*>(); test, input_iterator >(); test, forward_iterator >(); test, bidirectional_iterator >(); test, random_access_iterator >(); test, const int*>(); test >(); test >(); test >(); test >(); test(); }