pointer_size.pass.cpp 1.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152
  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(const value_type* p, size_t n);
  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. assert(v.size() == N);
  22. for (int i = 0; i < N; ++i)
  23. assert(v[i] == a[i]);
  24. }
  25. {
  26. typedef double T;
  27. T a[] = {1, 2.5, 3, 4.25, 5};
  28. const unsigned N = sizeof(a)/sizeof(a[0]);
  29. std::valarray<T> v(a, N);
  30. assert(v.size() == N);
  31. for (int i = 0; i < N; ++i)
  32. assert(v[i] == a[i]);
  33. }
  34. {
  35. typedef std::valarray<double> T;
  36. T a[] = {T(1), T(2), T(3), T(4), T(5)};
  37. const unsigned N = sizeof(a)/sizeof(a[0]);
  38. std::valarray<T> v(a, N);
  39. assert(v.size() == N);
  40. for (int i = 0; i < N; ++i)
  41. {
  42. assert(v[i].size() == a[i].size());
  43. for (int j = 0; j < v[i].size(); ++j)
  44. assert(v[i][j] == a[i][j]);
  45. }
  46. }
  47. }