Run DCE after a LoopFlatten test to reduce spurious output [nfc]
[llvm-project.git] / libcxx / test / std / numerics / numarray / template.valarray / valarray.unary / bit_not.pass.cpp
blobe59b571510793e61df0963bf624bd67c8fcaa2e9
1 //===----------------------------------------------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
9 // <valarray>
11 // template<class T> class valarray;
13 // valarray operator~() const;
15 #include <valarray>
16 #include <cassert>
17 #include <cstddef>
19 #include "test_macros.h"
21 int main(int, char**)
24 typedef int T;
25 T a[] = {1, 2, 3, 4, 5};
26 const unsigned N = sizeof(a)/sizeof(a[0]);
27 std::valarray<T> v(a, N);
28 std::valarray<T> v2 = ~v;
29 assert(v2.size() == v.size());
30 for (std::size_t i = 0; i < v2.size(); ++i)
31 assert(v2[i] == ~v[i]);
34 typedef std::valarray<int> T;
35 T a[] = {T(1), T(2), T(3), T(4), T(5)};
36 const unsigned N = sizeof(a)/sizeof(a[0]);
37 std::valarray<T> v(a, N);
38 std::valarray<T> v2 = ~v;
39 assert(v2.size() == v.size());
40 for (unsigned i = 0; i < N; ++i)
42 assert(v2[i].size() == v[i].size());
43 for (std::size_t j = 0; j < v[i].size(); ++j)
44 assert(v2[i][j] == ~v[i][j]);
48 typedef int T;
49 T a[] = {1, 2, 3, 4, 5};
50 const unsigned N = sizeof(a)/sizeof(a[0]);
51 std::valarray<T> v(a, N);
52 std::valarray<T> v2 = ~(v + v);
53 assert(v2.size() == v.size());
54 for (std::size_t i = 0; i < v2.size(); ++i)
55 assert(v2[i] == ~(2*v[i]));
58 // Make sure we don't have dangling reference problems with unary expressions
59 int array[] = {1, 2, 3};
60 std::valarray<int> a(array, 3);
61 std::valarray<int> b(array, 3);
62 auto c = ~a + b;
63 assert(c.size() == 3);
64 assert(c[0] == (~1 + 1) && c[1] == (~2 + 2) && c[2] == (~3 + 3));
67 return 0;