Calculates the position of the Nth set bit in the bit set
Calculates the position of the Nth set bit in the bit set
Bits
Lowest set bit to search for, 0 indexed
Position of the Nth set bit or widthOf(bits) if not found
Generates all possible permutations of N bits which fit within the width
Generates all possible permutations of N bits which fit within the width
For example: walkLowBits(4, 2) would generate: 11 101 110 1001 1010 1100
Maximum bit width
Number of set bits
A sequence of BigInts representing each permutation
(Since version ) see corresponding Javadoc for more information.