#bits #set-bit #bit-manipulation #iterator #flags #bit-set #bit

no-std bit-iter

Iterate forward or backwards over the positions of set bits in a word

6 releases (stable)

1.2.0 Aug 24, 2023
1.1.1 May 18, 2022
1.1.0 Nov 12, 2021
0.1.6 Sep 29, 2021
0.1.4 Jun 23, 2021

#216 in Algorithms

Download history 922/week @ 2023-12-10 2396/week @ 2023-12-17 739/week @ 2023-12-24 1026/week @ 2023-12-31 1354/week @ 2024-01-07 965/week @ 2024-01-14 1750/week @ 2024-01-21 1936/week @ 2024-01-28 2878/week @ 2024-02-04 1794/week @ 2024-02-11 2422/week @ 2024-02-18 2490/week @ 2024-02-25 1217/week @ 2024-03-03 1242/week @ 2024-03-10 1393/week @ 2024-03-17 1411/week @ 2024-03-24

5,353 downloads per month
Used in 3 crates

MIT license

13KB
258 lines

bit-iter

Test results Crates.io Documentation

Iterate forwards or backwards over the positions of bits set in a word.

A BitIter may be constructed from any integral value, and returns the positions of the 1 bits in ascending order.

BitIter implements DoubleEndedIterator, so you can iterate over the positions of the set bits in descending order too.

Example

fn main() {
    use bit_iter::*;

    let x : u32 = 0x10001;

    for b in BitIter::from(x) {
        println!("Bit {} is set.", b);
    }

    println!("In reverse order:");

    for b in BitIter::from(x).rev() {
        println!("Bit {} is set.", b);
    }
}

Output:

Bit 0 is set.
Bit 16 is set.
In reverse order:
Bit 16 is set.
Bit 0 is set.

Minimum supported Rust version (MSRV) policy

bit-iter's current minimum supported Rust version (MSRV) is 1.53.0.

bit-iter is guaranteed to compile with that version. It might also compile with older versions, but that could change in a future patch release.

If the MSRV of bit-iter changes, that will be done in a minor version release (e.g. 1.2.x -> 1.3.0).

No runtime deps