griditer 0.1.0

Contains a couple of iterators for implementing 2D grid based algoritms.
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

pub mod bresenham;
pub mod perimeter;

#[cfg(test)]
mod test_utils {
    use std::fmt::Debug;

    //
    // Test interface
    //

    pub fn assert_expected_sequence<It, C>(it: &mut It, expected_coords: &[(C, C)])
        where It: Iterator<Item = (C, C)>,
              C:  Copy + Debug + PartialEq<C>
    {
        for &coords in expected_coords {
            assert!(
                is_some_with_coords(it.next(), coords),
                "iterator must yield expected points in correct order"
            );
        }

        assert_eq!(it.next(), None, "iterator must not yield any extraneous points");
    }

    //
    // Test service
    //

    fn is_some_with_coords<C>(actual_point: Option<(C, C)>, expected_point: (C, C)) -> bool
        where C: Debug + PartialEq<C>
    {
        if let Some(actual_point) = actual_point {
            println!("expected Some({:?}), got Some({:?})", expected_point, actual_point);

            actual_point.0 == expected_point.0 && actual_point.1 == expected_point.1
        } else {
            println!("expected Some({:?}), got None", expected_point);

            false
        }
    }
}