You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
58 lines
1.3 KiB
58 lines
1.3 KiB
4 months ago
|
//===----------------------------------------------------------------------===//
|
||
|
|
//
|
||
|
|
// 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 size_t count() const;
|
||
|
|
|
||
|
|
#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_count()
|
||
|
|
{
|
||
|
|
const std::bitset<N> v = make_bitset<N>();
|
||
|
|
std::size_t c1 = v.count();
|
||
|
|
std::size_t c2 = 0;
|
||
|
|
for (std::size_t i = 0; i < N; ++i)
|
||
|
|
if (v[i])
|
||
|
|
++c2;
|
||
|
|
assert(c1 == c2);
|
||
|
|
}
|
||
|
|
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
test_count<0>();
|
||
|
|
test_count<1>();
|
||
|
|
test_count<31>();
|
||
|
|
test_count<32>();
|
||
|
|
test_count<33>();
|
||
|
|
test_count<63>();
|
||
|
|
test_count<64>();
|
||
|
|
test_count<65>();
|
||
|
|
test_count<1000>();
|
||
|
|
}
|