permutation_iterator 0.1.2

A Rust library for iterating over random permutations using O(1) (i.e. constant) space.
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

#[cfg(test)]
mod tests {
    use permutation_iterator::FeistelNetwork;

    #[test]
    fn test_new_ten_input_needs_four_bits() {
        // === given ==
        let permutor = FeistelNetwork::new(10);

        // === then ===
        assert_eq!(permutor.half_width, 2);
    }

    #[test]
    fn test_new_eight_input_needs_four_bits() {
        // === given ==
        let permutor = FeistelNetwork::new(8);

        // === then ===
        assert_eq!(permutor.half_width, 2);
    }

    #[test]
    fn test_new_ten_input_right_mask() {
        // === given ==
        let permutor = FeistelNetwork::new(10);

        // === then ===
        // Since we have 4 bits of output, the right two bits are 0011, i.e. 3, i.e. 0x3
        assert_eq!(permutor.right_mask, 0x3);
    }

    #[test]
    fn test_new_ten_input_left_mask() {
        // === given ==
        let permutor = FeistelNetwork::new(10);

        // === then ===
        // Since we have 4 bits of output, the first two bits are 1100, i.e. 12, i.e. 0xC
        assert_eq!(permutor.left_mask, 0xC);
    }
}