b64f8b07c1
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@119395 91177308-0d34-0410-b5e6-96231b3b80d8
128 lines
4.0 KiB
C++
128 lines
4.0 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <valarray>
|
|
|
|
// template<class T> class valarray;
|
|
|
|
// valarray cshift(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.cshift(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[] = {4, 5, 6, 7, 8, 9, 10, 1, 2, 3};
|
|
const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
|
|
std::valarray<T> v1(a1, N1);
|
|
std::valarray<T> v2 = v1.cshift(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[] = {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.cshift(10);
|
|
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[] = {8, 9, 10, 1, 2, 3, 4, 5, 6, 7};
|
|
const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
|
|
std::valarray<T> v1(a1, N1);
|
|
std::valarray<T> v2 = v1.cshift(17);
|
|
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[] = {8, 9, 10, 1, 2, 3, 4, 5, 6, 7};
|
|
const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
|
|
std::valarray<T> v1(a1, N1);
|
|
std::valarray<T> v2 = v1.cshift(-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[] = {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.cshift(-10);
|
|
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[] = {4, 5, 6, 7, 8, 9, 10, 1, 2, 3};
|
|
const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
|
|
std::valarray<T> v1(a1, N1);
|
|
std::valarray<T> v2 = v1.cshift(-17);
|
|
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.cshift(-17);
|
|
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, 2, 4, 6};
|
|
const unsigned N1 = sizeof(a1)/sizeof(a1[0]);
|
|
std::valarray<T> v1(a1, N1);
|
|
std::valarray<T> v2 = (v1 + v1).cshift(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[] = {16, 18, 20, 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).cshift(-3);
|
|
assert(v2.size() == N1);
|
|
for (unsigned i = 0; i < N1; ++i)
|
|
assert(v2[i] == a2[i]);
|
|
}
|
|
}
|