negate.pass.cpp 1.9 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
  1. //===----------------------------------------------------------------------===//
  2. //
  3. // The LLVM Compiler Infrastructure
  4. //
  5. // This file is dual licensed under the MIT and the University of Illinois Open
  6. // Source Licenses. See LICENSE.TXT for details.
  7. //
  8. //===----------------------------------------------------------------------===//
  9. // <valarray>
  10. // template<class T> class valarray;
  11. // valarray operator-() const;
  12. #include <valarray>
  13. #include <cassert>
  14. int main()
  15. {
  16. {
  17. typedef int T;
  18. T a[] = {1, 2, 3, 4, 5};
  19. const unsigned N = sizeof(a)/sizeof(a[0]);
  20. std::valarray<T> v(a, N);
  21. std::valarray<T> v2 = -v;
  22. assert(v2.size() == v.size());
  23. for (int i = 0; i < v2.size(); ++i)
  24. assert(v2[i] == -v[i]);
  25. }
  26. {
  27. typedef double T;
  28. T a[] = {1, 2.5, 3, 4.25, 5};
  29. const unsigned N = sizeof(a)/sizeof(a[0]);
  30. std::valarray<T> v(a, N);
  31. std::valarray<T> v2 = -v;
  32. assert(v2.size() == v.size());
  33. for (int i = 0; i < v2.size(); ++i)
  34. assert(v2[i] == -v[i]);
  35. }
  36. {
  37. typedef std::valarray<double> T;
  38. T a[] = {T(1), T(2), T(3), T(4), T(5)};
  39. const unsigned N = sizeof(a)/sizeof(a[0]);
  40. std::valarray<T> v(a, N);
  41. std::valarray<T> v2 = -v;
  42. assert(v2.size() == v.size());
  43. for (int i = 0; i < N; ++i)
  44. {
  45. assert(v2[i].size() == v[i].size());
  46. for (int j = 0; j < v[i].size(); ++j)
  47. assert(v2[i][j] == -v[i][j]);
  48. }
  49. }
  50. {
  51. typedef double T;
  52. T a[] = {1, 2.5, 3, 4.25, 5};
  53. const unsigned N = sizeof(a)/sizeof(a[0]);
  54. std::valarray<T> v(a, N);
  55. std::valarray<T> v2 = -(v + v);
  56. assert(v2.size() == v.size());
  57. for (int i = 0; i < v2.size(); ++i)
  58. assert(v2[i] == -2*v[i]);
  59. }
  60. }