| //===----------------------------------------------------------------------===// | |
| // | |
| // 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. | |
| // | |
| //===----------------------------------------------------------------------===// | |
| // <valarray> | |
| // template<class T> class valarray; | |
| // valarray shift(int i) const; | |
| #include <valarray> | |
| #include <cassert> | |
| int main() | |
| { | |
| { | |
| typedef int T; | |
| T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; | |
| T a2[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; | |
| const unsigned N1 = sizeof(a1)/sizeof(a1[0]); | |
| std::valarray<T> v1(a1, N1); | |
| std::valarray<T> v2 = v1.shift(0); | |
| assert(v2.size() == N1); | |
| for (unsigned i = 0; i < N1; ++i) | |
| assert(v2[i] == a2[i]); | |
| } | |
| { | |
| typedef int T; | |
| T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; | |
| T a2[] = {2, 3, 4, 5, 6, 7, 8, 9, 10, 0}; | |
| const unsigned N1 = sizeof(a1)/sizeof(a1[0]); | |
| std::valarray<T> v1(a1, N1); | |
| std::valarray<T> v2 = v1.shift(1); | |
| assert(v2.size() == N1); | |
| for (unsigned i = 0; i < N1; ++i) | |
| assert(v2[i] == a2[i]); | |
| } | |
| { | |
| typedef int T; | |
| T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; | |
| T a2[] = {10, 0, 0, 0, 0, 0, 0, 0, 0, 0}; | |
| const unsigned N1 = sizeof(a1)/sizeof(a1[0]); | |
| std::valarray<T> v1(a1, N1); | |
| std::valarray<T> v2 = v1.shift(9); | |
| assert(v2.size() == N1); | |
| for (unsigned i = 0; i < N1; ++i) | |
| assert(v2[i] == a2[i]); | |
| } | |
| { | |
| typedef int T; | |
| T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; | |
| T a2[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; | |
| const unsigned N1 = sizeof(a1)/sizeof(a1[0]); | |
| std::valarray<T> v1(a1, N1); | |
| std::valarray<T> v2 = v1.shift(90); | |
| assert(v2.size() == N1); | |
| for (unsigned i = 0; i < N1; ++i) | |
| assert(v2[i] == a2[i]); | |
| } | |
| { | |
| typedef int T; | |
| T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; | |
| T a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; | |
| const unsigned N1 = sizeof(a1)/sizeof(a1[0]); | |
| std::valarray<T> v1(a1, N1); | |
| std::valarray<T> v2 = v1.shift(-1); | |
| assert(v2.size() == N1); | |
| for (unsigned i = 0; i < N1; ++i) | |
| assert(v2[i] == a2[i]); | |
| } | |
| { | |
| typedef int T; | |
| T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; | |
| T a2[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 1}; | |
| const unsigned N1 = sizeof(a1)/sizeof(a1[0]); | |
| std::valarray<T> v1(a1, N1); | |
| std::valarray<T> v2 = v1.shift(-9); | |
| assert(v2.size() == N1); | |
| for (unsigned i = 0; i < N1; ++i) | |
| assert(v2[i] == a2[i]); | |
| } | |
| { | |
| typedef int T; | |
| T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; | |
| T a2[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; | |
| const unsigned N1 = sizeof(a1)/sizeof(a1[0]); | |
| std::valarray<T> v1(a1, N1); | |
| std::valarray<T> v2 = v1.shift(-90); | |
| assert(v2.size() == N1); | |
| for (unsigned i = 0; i < N1; ++i) | |
| assert(v2[i] == a2[i]); | |
| } | |
| { | |
| typedef int T; | |
| const unsigned N1 = 0; | |
| std::valarray<T> v1; | |
| std::valarray<T> v2 = v1.shift(-90); | |
| assert(v2.size() == N1); | |
| } | |
| { | |
| typedef int T; | |
| T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; | |
| T a2[] = {8, 10, 12, 14, 16, 18, 20, 0, 0, 0}; | |
| const unsigned N1 = sizeof(a1)/sizeof(a1[0]); | |
| std::valarray<T> v1(a1, N1); | |
| std::valarray<T> v2 = (v1 + v1).shift(3); | |
| assert(v2.size() == N1); | |
| for (unsigned i = 0; i < N1; ++i) | |
| assert(v2[i] == a2[i]); | |
| } | |
| { | |
| typedef int T; | |
| T a1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; | |
| T a2[] = {0, 0, 0, 2, 4, 6, 8, 10, 12, 14}; | |
| const unsigned N1 = sizeof(a1)/sizeof(a1[0]); | |
| std::valarray<T> v1(a1, N1); | |
| std::valarray<T> v2 = (v1 + v1).shift(-3); | |
| assert(v2.size() == N1); | |
| for (unsigned i = 0; i < N1; ++i) | |
| assert(v2[i] == a2[i]); | |
| } | |
| } |