2010-05-11 21:42:16 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2010-05-11 23:36:01 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
2010-11-16 23:09:02 +01:00
|
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
|
|
// Source Licenses. See LICENSE.TXT for details.
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <valarray>
|
|
|
|
|
|
|
|
// template<class T> class valarray;
|
|
|
|
|
|
|
|
// template<class T> valarray<T> operator-(const valarray<T>& x, const T& y);
|
|
|
|
|
|
|
|
#include <valarray>
|
|
|
|
#include <cassert>
|
|
|
|
|
|
|
|
int main()
|
|
|
|
{
|
|
|
|
{
|
|
|
|
typedef int T;
|
|
|
|
T a1[] = { 1, 2, 3, 4, 5};
|
|
|
|
T a2[] = {-2, -1, 0, 1, 2};
|
|
|
|
const unsigned N = sizeof(a1)/sizeof(a1[0]);
|
|
|
|
std::valarray<T> v1(a1, N);
|
|
|
|
std::valarray<T> v2 = v1 - 3;
|
|
|
|
assert(v1.size() == v2.size());
|
|
|
|
for (int i = 0; i < v2.size(); ++i)
|
|
|
|
assert(v2[i] == a2[i]);
|
|
|
|
}
|
|
|
|
}
|