rust_bresenham 0.1.7

A crate for determining Bresenham lines
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
69
70
71

// https://rosettacode.org/wiki/Bitmap/Bresenham%27s_line_algorithm#Rust
mod tests;

pub type Point = (isize, isize);

pub struct Bresenham {
    end: Point,
    current_x: isize,
    current_y: isize,
    dx: isize,
    dy: isize,
    error: isize,
    sx: isize,
    sy: isize,
}

impl Bresenham {
    pub fn new(start: Point, end: Point) -> Self {
        let dx = isize::abs(end.0 - start.0);
        let dy = isize::abs(end.1 - start.1);
        let error = (if dx > dy { dx } else { -dy }) / 2;
        let sx = {
            if start.0 < end.0 {
                1
            } else {
                -1
            }
        };
        let sy = {
            if start.1 < end.1 {
                1
            } else {
                -1
            }
        };

        Self {
            end: end.clone(),
            current_x: start.0,
            current_y: start.1,
            dx,
            dy,
            error,
            sx,
            sy,
        }
    }
}

impl Iterator for Bresenham {
    type Item = Point;

    fn next(&mut self) -> Option<Self::Item> {
        let error2 = self.error;

        if error2 > -self.dx {
            self.error -= self.dy;
            self.current_x += self.sx;
        }
        if error2 < self.dy {
            self.error += self.dx;
            self.current_y += self.sy;
        }

        if self.current_x == self.end.0 && self.current_y == self.end.1 {
            return None;
        }

        Some((self.current_x, self.current_y))
    }
}