Bitmap & Bitset

class Bitmap {
public:
explicit Bitmap(const int size)
: size_(size), num_words_((size + 31) / 32) {
words_.resize(size);
Reset();
}

~Bitmap() {}

int size() const { return size_; }

void Reset() {
for (int i = 0; i < num_words_; i++)
words_[i] = 0;
}

bool Get(int k) const {
return words_[k >> kUint32LengthLog] & (1<<(k & 31));
}

void Set(int k) {
words_[k >> kUint32LengthLog] |= 1<<(k & 31);
}

void Clear(int k) {
words_[k >> kUint32LengthLog] &= ~(1<<(k & 31));
}

// Return the number of size_ that is set.
int NumberOfBitsSet() const {
int num_set_bits = 0;
for (auto it = words_.begin(); it != words_.end(); ++it) {
num_set_bits += NumberOfBitsSet(*it);
}
return num_set_bits;
}

private:
static const int kUint32LengthLog = 5;
static const uint32 m1 = 0x55555555; // binary: 0101 0101 0101 0101 …
static const uint32 m2 = 0x33333333; // binary: 0011 0011 0011 0011 …
static const uint32 m4 = 0x0F0F0F0F; // binary: 0000 1111 0000 1111 …
// the sum of 256 to the power of 0,1,2,3
static const uint32 h01 = 0x01010101;

int NumberOfBitsSet(uint32 i) const {
i -= ((i >> 1) & m1);
i = (i & m2) + ((i >> 2) & m2);
return (((i + (i >> 4)) & m4) * h01) >> 24;
}

const int size_;
const int num_words_;
std::vector words_;
};

/*
Bitset
A bitset stores bits (elements with only two possible values: 0 or 1, true or false, …).

The class emulates an array of bool elements, but optimized for space allocation: generally,

each element occupies only one bit (which, on most systems, is eight times less than the smallest elemental type: char).

Each bit position can be accessed individually: for example, for a given bitset named foo, the expression foo[3] accesses its fourth bit, just like a regular array accesses its elements. But because no elemental type is a single bit in most C++ environments, the individual elements are accessed as special references type (see bitset::reference).

Bitsets have the feature of being able to be constructed from and converted to both integer values and binary strings (see its constructor and members to_ulong and to_string). They can also be directly inserted and extracted from streams in binary format (see applicable operators).

The size of a bitset is fixed at compile-time (determined by its template parameter). For a class that also optimizes for space allocation and allows for dynamic resizing, see the bool specialization of vector (vector).
*/

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值