libcxx/test/std/utilities/template.bitset/bitset.members/index.pass.cpp

//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//

// test bitset<N>::reference operator[](size_t pos);

#include <bitset>
#include <cassert>
#include <cstddef>
#include <vector>

#include "../bitset_test_cases.h"
#include "test_macros.h"

template <std::size_t N>
void test_index() {
    std::vector<std::bitset<N> > const cases = get_test_cases<N>();
    for (std::size_t c = 0; c != cases.size(); ++c) {
        std::bitset<N> v1 = cases[c];
        if (v1.size() > 0) {
            assert(v1[N/2] == v1.test(N/2));
            typename std::bitset<N>::reference r = v1[N/2];
            assert(r == v1.test(N/2));
            typename std::bitset<N>::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(int, char**) {
    test_index<0>();
    test_index<1>();
    test_index<31>();
    test_index<32>();
    test_index<33>();
    test_index<63>();
    test_index<64>();
    test_index<65>();
    test_index<1000>();

    return 0;
}