加1到C++位集

Question

我有一個給定長度的C++位集。我想生成這個bitset的所有可能的組合，爲此我想添加1 2^bitset.length時間。這個怎麼做？ Boost庫解決方案也可以接受

Answer 1

所有可能的組合？只需使用64位無符號整數，讓您的生活更輕鬆。

Answer 2

試試這個：

/* 
* This function adds 1 to the bitset. 
* 
* Since the bitset does not natively support addition we do it manually. 
* If XOR a bit with 1 leaves it as one then we did not overflow so we can break out 
* otherwise the bit is zero meaning it was previously one which means we have a bit 
* overflow which must be added 1 to the next bit etc. 
*/ 
void increment(boost::dynamic_bitset<>& bitset) 
{ 
    for(int loop = 0;loop < bitset.count(); ++loop) 
    { 
     if ((bitset[loop] ^= 0x1) == 0x1) 
     { break; 
     } 
    } 
} 

Answer 3

使用boost庫，你可以嘗試以下方法：

例如，長度的位集4

boost::dynamic_bitset<> bitset; 
for (int i = 0; i < pow(2.0, 4); i++) { 
    bitset = boost::dynamic_bitset<>(4, i); 

    std::cout << bitset << std::endl; 

}