forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
57 lines
1.4 KiB
C++
57 lines
1.4 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// test bitset<N>& operator^=(const bitset<N>& rhs);
|
|
|
|
#include <bitset>
|
|
#include <cstdlib>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
|
|
#if defined(TEST_COMPILER_CLANG)
|
|
#pragma clang diagnostic ignored "-Wtautological-compare"
|
|
#elif defined(TEST_COMPILER_C1XX)
|
|
#pragma warning(disable: 6294) // Ill-defined for-loop: initial condition does not satisfy test. Loop body not executed.
|
|
#endif
|
|
|
|
template <std::size_t N>
|
|
std::bitset<N>
|
|
make_bitset()
|
|
{
|
|
std::bitset<N> v;
|
|
for (std::size_t i = 0; i < N; ++i)
|
|
v[i] = static_cast<bool>(std::rand() & 1);
|
|
return v;
|
|
}
|
|
|
|
template <std::size_t N>
|
|
void test_op_xor_eq()
|
|
{
|
|
std::bitset<N> v1 = make_bitset<N>();
|
|
std::bitset<N> v2 = make_bitset<N>();
|
|
std::bitset<N> v3 = v1;
|
|
v1 ^= v2;
|
|
for (std::size_t i = 0; i < N; ++i)
|
|
assert(v1[i] == (v3[i] != v2[i]));
|
|
}
|
|
|
|
int main()
|
|
{
|
|
test_op_xor_eq<0>();
|
|
test_op_xor_eq<1>();
|
|
test_op_xor_eq<31>();
|
|
test_op_xor_eq<32>();
|
|
test_op_xor_eq<33>();
|
|
test_op_xor_eq<63>();
|
|
test_op_xor_eq<64>();
|
|
test_op_xor_eq<65>();
|
|
test_op_xor_eq<1000>();
|
|
}
|