std::bitset<N>::count
来自 cppreference.cn
std::size_t count() const; |
(noexcept since C++11) (自 C++11 起为 noexcept) (constexpr since C++23) (自 C++23 起为 constexpr) |
|
返回设置为 true 的位数。
[编辑] 返回值
设置为 true 的位数。
[编辑] 示例
运行此代码
#include <bitset> #include <iostream> constexpr auto popcount(unsigned x) noexcept { unsigned num{}; for (; x; ++num, x &= (x - 1)); return num; } static_assert(popcount(0b101010) == std::bitset<8>{0b101010}.count()); int main() { std::bitset<8> b("00010010"); std::cout << "Initial value: " << b << '\n'; // Find the first unset bit std::size_t idx = 0; while (idx < b.size() && b.test(idx)) ++idx; // Continue setting bits until half the bitset is filled while (idx < b.size() && b.count() < b.size() / 2) { b.set(idx); std::cout << "Setting bit " << idx << ": " << b << '\n'; while (idx < b.size() && b.test(idx)) ++idx; } }
输出
Initial value: 00010010 Setting bit 0: 00010011 Setting bit 2: 00010111
[编辑] 参见
返回 bitset 容纳的位数 (公共成员函数) | |
(C++20) |
计算无符号整数中 1 位的数量 (函数模板) |