bit-string 0.2.0

A compact owned bit string type with editing, matching, and bitwise operations.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68

use super::Bits;
use crate::WORD_BITS;

#[test]
fn returns_zero_for_empty_bit_len() {
    assert_eq!(Bits::word_len(0), 0);
}

#[test]
fn returns_one_for_non_empty_lengths_within_one_word() {
    assert_eq!(Bits::word_len(1), 1);
    assert_eq!(Bits::word_len(WORD_BITS / 2), 1);
    assert_eq!(Bits::word_len(WORD_BITS - 1), 1);
    assert_eq!(Bits::word_len(WORD_BITS), 1);
}

#[test]
fn rounds_up_for_partial_trailing_words() {
    let cases = [
        (WORD_BITS + 1, 2),
        (WORD_BITS * 2 - 1, 2),
        (WORD_BITS * 2, 2),
        (WORD_BITS * 2 + 1, 3),
    ];

    for (bit_len, expected) in cases {
        assert_eq!(Bits::word_len(bit_len), expected, "bit_len={bit_len}");
    }
}

#[test]
fn handles_usize_max_without_addition_overflow() {
    let expected = usize::MAX / WORD_BITS + usize::from(usize::MAX % WORD_BITS != 0);

    assert_eq!(Bits::word_len(usize::MAX), expected);
}

#[test]
fn covers_bit_len_with_minimal_number_of_words() {
    let cases = [
        0,
        1,
        7,
        WORD_BITS - 1,
        WORD_BITS,
        WORD_BITS + 1,
        WORD_BITS * 2 - 1,
        WORD_BITS * 2,
        WORD_BITS * 2 + 1,
        usize::MAX,
    ];

    for bit_len in cases {
        let words = Bits::word_len(bit_len);

        assert!(
            words.saturating_mul(WORD_BITS) >= bit_len,
            "Bits::word_len({bit_len})={words} does not cover all bits"
        );

        if words > 0 {
            assert!(
                (words - 1).saturating_mul(WORD_BITS) < bit_len,
                "Bits::word_len({bit_len})={words} is not minimal"
            );
        }
    }
}