| 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 | //===----------------------------------------------------------------------===// |
| 8 | |
| 9 | // bitset<N> operator^(const bitset<N>& lhs, const bitset<N>& rhs); // constexpr since C++23 |
| 10 | |
| 11 | #include <bitset> |
| 12 | #include <cassert> |
| 13 | #include <cstddef> |
| 14 | #include <vector> |
| 15 | |
| 16 | #include "../bitset_test_cases.h" |
| 17 | #include "test_macros.h" |
| 18 | |
| 19 | template <std::size_t N> |
| 20 | TEST_CONSTEXPR_CXX23 void test_op_not() { |
| 21 | std::vector<std::bitset<N> > const cases = get_test_cases<N>(); |
| 22 | for (std::size_t c1 = 0; c1 != cases.size(); ++c1) { |
| 23 | for (std::size_t c2 = 0; c2 != cases.size(); ++c2) { |
| 24 | std::bitset<N> v1 = cases[c1]; |
| 25 | std::bitset<N> v2 = cases[c2]; |
| 26 | std::bitset<N> v3 = v1; |
| 27 | assert((v1 ^ v2) == (v3 ^= v2)); |
| 28 | } |
| 29 | } |
| 30 | } |
| 31 | |
| 32 | TEST_CONSTEXPR_CXX23 bool test() { |
| 33 | test_op_not<0>(); |
| 34 | test_op_not<1>(); |
| 35 | test_op_not<31>(); |
| 36 | test_op_not<32>(); |
| 37 | test_op_not<33>(); |
| 38 | test_op_not<63>(); |
| 39 | test_op_not<64>(); |
| 40 | test_op_not<65>(); |
| 41 | |
| 42 | return true; |
| 43 | } |
| 44 | |
| 45 | int main(int, char**) { |
| 46 | test(); |
| 47 | test_op_not<1000>(); // not in constexpr because of constexpr evaluation step limits |
| 48 | #if TEST_STD_VER > 20 |
| 49 | static_assert(test()); |
| 50 | #endif |
| 51 | |
| 52 | return 0; |
| 53 | } |
| 54 | |