byte_set 0.1.3

Efficient sets of bytes.
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

use crate::ByteSet;

#[test]
fn collect_full() {
    let set = ByteSet::full();

    let bytes: Vec<u8> = set.into_iter().collect();
    assert_eq!(bytes.len(), 256);

    for b in 0..=u8::max_value() {
        let i = b as usize;

        assert_eq!(bytes.get(i), Some(&b), "{:?} at {} is not {}", bytes, i, b);
    }
}

#[test]
fn collect_full_rev() {
    let set = ByteSet::full();

    let bytes: Vec<u8> = set.into_iter().rev().collect();
    assert_eq!(bytes.len(), 256);

    for b in 0..=u8::max_value() {
        // Iterating in reverse, so flip the index.
        let i = 255 - b as usize;

        assert_eq!(bytes.get(i), Some(&b), "{:?} at {} is not {}", bytes, i, b);
    }
}

#[test]
fn contains_full() {
    let iter = &mut ByteSet::full().into_iter();

    while let Some(byte) = iter.next() {
        assert_not_contains!(iter.byte_set, byte);
    }
}

#[test]
fn contains_full_rev() {
    let iter = &mut ByteSet::full().into_iter();

    while let Some(byte) = iter.next_back() {
        assert_not_contains!(iter.byte_set, byte);
    }
}

#[test]
fn ord() {
    let full = ByteSet::full().into_iter();
    assert_eq!(
        full.collect::<Vec<u8>>(),
        (0..=u8::max_value()).collect::<Vec<u8>>(),
    );
}

#[test]
fn ord_rev() {
    let full = ByteSet::full().into_iter();
    assert_eq!(
        full.rev().collect::<Vec<u8>>(),
        (0..=u8::max_value()).rev().collect::<Vec<u8>>(),
    );
}