#bit-flags #bit-manipulation #iterator

no-std bit-iter

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

8 releases (stable)

1.3.1 Mar 4, 2025
1.2.0 Aug 24, 2023
1.1.1 May 18, 2022
1.1.0 Nov 12, 2021
0.1.4 Jun 23, 2021

#1305 in Algorithms

Download history 830/week @ 2026-02-15 624/week @ 2026-02-22 1689/week @ 2026-03-01 1788/week @ 2026-03-08 1041/week @ 2026-03-15 873/week @ 2026-03-22 831/week @ 2026-03-29 1590/week @ 2026-04-05 680/week @ 2026-04-12 623/week @ 2026-04-19 337/week @ 2026-04-26 353/week @ 2026-05-03 928/week @ 2026-05-10 979/week @ 2026-05-17 796/week @ 2026-05-24 4926/week @ 2026-05-31

7,741 downloads per month
Used in 8 crates (6 directly)

MIT license

14KB
274 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.82.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.3.x -> 1.4.0).

No runtime deps