位向量的实现

#include <iostream>i
using namespace std;

#define COUNT 100
#define WORDBITS 32

class Bit_log {
    public:
        void set(int i);    //set the iTH bit to be 1
        void clr(int i);    //set the iTH bit to be 0
        bool test(int i);   //test if the iTH bit is 1
        //int[] a=new int[1+COUNT/WORDBITS];
        int a[1+COUNT/WORDBITS];
        static const int mask=0x1F;
};


void Bit_log::set(int i) {
    a[i>>5] |= 1<<(i&mask);
}

void Bit_log::clr(int i) {
    a[i>>5] &= ~( 1<<(i&mask) );
}
bool Bit_log::test(int i) {
    return a[i>>5] & ( 1<<(i&mask) );
}

int main(int argc, char *argv[]) {
    Bit_log bit;
    int i;
    for(i=0; i<COUNT; i++)
        bit.clr(i);
    for(i=0; i< COUNT;i+=10)
        bit.set(i);
    for(i=0;i<COUNT;i++)
        if(bit.test(i))
            cout<<i<<", ";
    cout<<endl;
}

 

在实际写程序时，可以

inlcude <bitset>

bitset<>