neco-edge-routing 0.1.0

necosystems series 2D edge routing primitives for node graphs
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

use alloc::vec;

use crate::{PathData, PathKind, RouteRequest};

pub(crate) fn route(req: &RouteRequest) -> PathData {
    PathData {
        points: vec![req.from, req.to],
        kind: PathKind::Polyline,
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::RouteStyle;

    fn request(from: (f64, f64), to: (f64, f64)) -> RouteRequest {
        RouteRequest {
            from,
            to,
            from_tangent: (1.0, 2.0),
            to_tangent: (-3.0, 4.0),
            style: RouteStyle::Linear,
        }
    }

    #[test]
    fn keeps_endpoints_for_general_case() {
        let path = route(&request((-2.0, 1.5), (3.0, -4.0)));
        assert_eq!(path.kind, PathKind::Polyline);
        assert_eq!(path.points, vec![(-2.0, 1.5), (3.0, -4.0)]);
    }

    #[test]
    fn keeps_duplicate_points_for_degenerate_case() {
        let path = route(&request((1.0, 1.0), (1.0, 1.0)));
        assert_eq!(path.points, vec![(1.0, 1.0), (1.0, 1.0)]);
    }

    #[test]
    fn ignores_tangents() {
        let mut req = request((0.0, 0.0), (5.0, 7.0));
        let first = route(&req);
        req.from_tangent = (0.0, 0.0);
        req.to_tangent = (100.0, -100.0);
        let second = route(&req);
        assert_eq!(first, second);
    }
}