BitMap实现

2023-06-28,,

#pragma once

#include<vector>

using namespace std;

class BitMap

{

public:

BitMap()

:_size(0)

{}

BitMap(size_t size)

:_size(0)

{

_arrays.resize((size >> 5) + 1);//BitMap的大小

}

bool Set(size_t num)//在对应的index下的(1<<n)位设置为一

{

size_t index = num >> 5;

size_t n = num % 32;

if (_arrays[index] & (1 << n))

{

return false;

}

else

{

_arrays[index] |= (1 << n);

++_size;

return true;

}

}

bool ReSet(size_t num)//去掉标志位

{

size_t index = num >> 5;

size_t n = num % 32;

if (_arrays[index] & (1 << n))

{

_arrays[index] &= (~(1 << n));

--_size;

return true;

}

return false;

}

bool Test(size_t num)

{

size_t index = num >> 5;

size_t n = num % 32;

return _arrays[index] & (1 << n);

}

void Clear()

{

_arrays.assign(_arrays.size(), 0);

}

protected:

vector<size_t> _arrays;

size_t _size;

};

void Test1()

{

BitMap bm(65);

bm.Set(1);

bm.Set(4);

bm.Set(33);

cout << "1?" << bm.Test(1) << endl;

cout << "2?" << bm.Test(2) << endl;

cout << "4?" << bm.Test(4) << endl;

cout << "33?" << bm.Test(33) << endl;

bm.ReSet(33);

bm.ReSet(4);

cout << "1?" << bm.Test(1) << endl;

cout << "2?" << bm.Test(2) << endl;

cout << "4?" << bm.Test(4) << endl;

cout << "33?" << bm.Test(33) << endl;

}