一个简单的 BitSet


public class BitSet {

    
    
    /*private final static int BITS_PER_WORD = 1 << ADDRESS_BITS_PER_WORD;

    public BitSet() {
        initWords(BITS_PER_WORD);
    }

    public BitSet(int nbits) {
        initWords(nbits);
    }

    private void initWords(int nbits) {
        a = new long[wordIndex(nbits - 1) + 1];
    }*/
    private static long[] a =new long[640];
    private final static int ADDRESS_BITS_PER_WORD = 6;
    public static void main(String[] args) {
        //test();
      /* System.out.println(wordIndex(63));
       System.out.println(wordIndex(64));
       System.out.println(wordIndex(127));
       System.out.println(wordIndex(128));
       
       System.out.println("---------------");
       
       System.out.println(63 / 64);
       System.out.println(64 /64);
       System.out.println(127 / 64);
       System.out.println(128 / 64); */
       
        BitSet bitSet = new BitSet();
        bitSet.set(4);
       // bitSet.clear(4);
       System.out.println(bitSet.get(4));
        
    }
    
     public void clear(int bitIndex) {
         //取反后在取并
         //假如bitIndex =2  0010 取反=1101,并=0
         a[wordIndex(bitIndex)] &= ~(1L << bitIndex);
     }
    
    public static void test(){
        // BitSet
        BitSet a = new BitSet();
        a.set(1);
        
        System.out.println(a.get(1));
        System.out.println(a.get(2));

        System.out.println("---------------------");

        for (int i = 1; i < 320; i++) {
            if (i < 150) {
                a.set(i);
            }
            if (i == 150) {
                System.out.println("---150-");
            }
            System.out.println(a.get(i));
        }

        
    }

    private static int wordIndex(int bitIndex) {
        return bitIndex >> ADDRESS_BITS_PER_WORD;
    }

    public boolean get(int bitIndex) {
        //假如bitIndex=2 ; 0010 & 0010
        return ((a[wordIndex(bitIndex)] & (1L << bitIndex)) != 0);
    }

    public void set(int bit) {
        a[wordIndex(bit)] |= (1L << bit);
        /*
         * //0000 |= 0010 a[0] |= (1 << 1);
         * System.out.println(a[0]);
         * //0010 |=0100 a[0] |= (1 << 2);
         * System.out.println(a[0]);
         * //0010 |= 1000 a[0] |= (1 << 3);
         *  System.out.println(a[0]);
         */
    }

}

 

bitset的求一位数可以通过bitset中的count()函数来实现。count()函数返回bitset中值为1的位数。下面是一个使用bitset求一位数的示例代码: ```cpp #include <iostream> #include <bitset> int main() { std::bitset<8> b(0b11011011); // 假设bitset中的二进制数为11011011 int count = b.count(); std::cout << "bitset中值为1的位数为:" << count << std::endl; return 0; } ``` 输出结果为: ``` bitset中值为1的位数为:6 ``` 因此,上述示例代码中bitset的求一位数为6。<span class="em">1</span><span class="em">2</span><span class="em">3</span> #### 引用[.reference_title] - *1* [C++标准库bitset类型的简单使用方法介绍](https://download.csdn.net/download/weixin_38663169/13784671)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 33.333333333333336%"] - *2* [bitset:Go包实现位集](https://download.csdn.net/download/weixin_42128393/18638576)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 33.333333333333336%"] - *3* [bitset](https://blog.csdn.net/weixin_51333606/article/details/124567618)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 33.333333333333336%"] [ .reference_list ]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值