c++如何实现一个简单的BitSet_c++位集数据结构与操作【源码】

#include <cstdint><br>#include <vector><br>#include <stdexcept><br><br>class BitSet {<br>private:<br>    std::vector<uint32_t> data;<br>    size_t num_bits;<br><br>    static constexpr size_t BITS_PER_WORD = 32;<br>    size_t word_index(size_t pos) const { return pos / BITS_PER_WORD; }<br>    size_t bit_offset(size_t pos) const { return pos % BITS_PER_WORD; }<br><br>public:<br>    explicit BitSet(size_t n) : num_bits(n),<br>        data((n + BITS_PER_WORD - 1) / BITS_PER_WORD, 0) {}<br><br>    void set(size_t pos) {<br>        if (pos >= num_bits) throw std::out_of_range("BitSet::set: index out of range");<br>        data[word_index(pos)] |= (1U << bit_offset(pos));<br>    }<br><br>    void reset(size_t pos) {<br>        if (pos >= num_bits) throw std::out_of_range("BitSet::reset: index out of range");<br>        data[word_index(pos)] &= ~(1U << bit_offset(pos));<br>    }<br><br>    bool test(size_t pos) const {<br>        if (pos >= num_bits) throw std::out_of_range("BitSet::test: index out of range");<br>        return data[word_index(pos)] & (1U << bit_offset(pos));<br>    }<br><br>    void flip(size_t pos) {<br>        if (pos >= num_bits) throw std::out_of_range("BitSet::flip: index out of range");<br>        data[word_index(pos)] ^= (1U << bit_offset(pos));<br>    }<br><br>    size_t size() const { return num_bits; }<br>    size_t num_words() const { return data.size(); }<br><br>    // 可选：批量设置/清空全部<br>    void set_all() {<br>        for (auto& w : data) w = ~0U;<br>        // 最后一个字可能越界，需掩码处理（略，可按需扩展）<br>    }<br><br>    void reset_all() {<br>        data.assign(data.size(), 0);<br>    }<br>};

int main() {<br>    BitSet bs(100);  // 支持 0~99 共 100 个 bit<br><br>    bs.set(5);<br>    bs.set(10);<br>    bs.flip(5);     // 5 变成 0<br><br>    std::cout << bs.test(5) << " ";   // 输出 0<br>    std::cout << bs.test(10) << "\n"; // 输出 1<br><br>    return 0;<br>}