//===----------------------------------------------------------------------===// // // 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::reference operator[](size_t pos); #include #include #include #include #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::bitset make_bitset() { std::bitset v; for (std::size_t i = 0; i < N; ++i) v[i] = static_cast(std::rand() & 1); return v; } template void test_index_const() { std::bitset v1 = make_bitset(); const bool greater_than_0 = std::integral_constant 0)>::value; // avoid compiler warnings if (greater_than_0) { assert(v1[N/2] == v1.test(N/2)); typename std::bitset::reference r = v1[N/2]; assert(r == v1.test(N/2)); typename std::bitset::reference r2 = v1[N/2]; r = r2; assert(r == v1.test(N/2)); r = false; assert(r == false); assert(v1.test(N/2) == false); r = true; assert(r == true); assert(v1.test(N/2) == true); bool b = ~r; assert(r == true); assert(v1.test(N/2) == true); assert(b == false); r.flip(); assert(r == false); assert(v1.test(N/2) == false); } } int main() { test_index_const<0>(); test_index_const<1>(); test_index_const<31>(); test_index_const<32>(); test_index_const<33>(); test_index_const<63>(); test_index_const<64>(); test_index_const<65>(); test_index_const<1000>(); }