flat-zip 0.1.0

An iterator adaptor to help traverse two-level collections
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

use super::FlatZipExt;
use std::collections::BTreeMap;

#[test]
fn test_enumerated() {
    let jagged_vec = vec![
        vec!["zero", "", "0"],
        vec![],
        vec!["II", "two"],
        vec!["three", "three", "three"],
        vec![],
        vec!["55555"],
        vec!["6"],
        vec!["seven"; 2],
        vec![],
        vec![],
    ];

    let mut iter = jagged_vec.into_iter().enumerate().flat_zip();

    assert_eq!(iter.next(), Some((0, "zero")));
    assert_eq!(iter.next(), Some((0, "")));
    assert_eq!(iter.next(), Some((0, "0")));

    assert_eq!(iter.next(), Some((2, "II")));
    assert_eq!(iter.next(), Some((2, "two")));

    assert_eq!(iter.next(), Some((3, "three")));
    assert_eq!(iter.next(), Some((3, "three")));
    assert_eq!(iter.next(), Some((3, "three")));

    assert_eq!(iter.next(), Some((5, "55555")));

    assert_eq!(iter.next(), Some((6, "6")));

    assert_eq!(iter.next(), Some((7, "seven")));
    assert_eq!(iter.next(), Some((7, "seven")));

    assert_eq!(iter.next(), None);
}

#[test]
fn test_multimap() {
    let mut map = BTreeMap::new();
    map.insert(3, vec!["three", "3", "III"]);
    map.insert(7, vec!["7", "seven", "VII"]);
    map.insert(9, vec![]);
    map.insert(8, vec!["eight", "8"]);

    let mut iter = map.into_iter().flat_zip();

    assert_eq!(iter.next(), Some((3, "three")));
    assert_eq!(iter.next(), Some((3, "3")));
    assert_eq!(iter.next(), Some((3, "III")));

    assert_eq!(iter.next(), Some((7, "7")));
    assert_eq!(iter.next(), Some((7, "seven")));
    assert_eq!(iter.next(), Some((7, "VII")));

    assert_eq!(iter.next(), Some((8, "eight")));
    assert_eq!(iter.next(), Some((8, "8")));

    assert_eq!(iter.next(), None);
}