hierarchical_pathfinding 0.5.0

Quickly approximate Paths on a Grid
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
72
73
74
75

use super::{Cost, Path};
use crate::Point;

#[derive(Clone, Debug)]
pub enum PathSegment {
    Known(Path<Point>),
    Unknown {
        start: Point,
        end: Point,
        cost: Cost,
        len: usize,
    },
}

use self::PathSegment::*;

impl PathSegment {
    pub fn new(path: Path<Point>, known: bool) -> PathSegment {
        if known {
            Known(path)
        } else {
            Unknown {
                start: path[0],
                end: path[path.len() - 1],
                cost: path.cost(),
                len: path.len(),
            }
        }
    }

    pub fn cost(&self) -> Cost {
        match *self {
            Known(ref path) => path.cost(),
            Unknown { cost, .. } => cost,
        }
    }

    pub fn len(&self) -> usize {
        match *self {
            Known(ref path) => path.len(),
            Unknown { len, .. } => len,
        }
    }

    pub fn start(&self) -> Point {
        match *self {
            Known(ref path) => path[0],
            Unknown { start, .. } => start,
        }
    }

    pub fn end(&self) -> Point {
        match *self {
            Known(ref path) => path[path.len() - 1],
            Unknown { end, .. } => end,
        }
    }

    pub fn reversed(&self, start_cost: Cost, end_cost: Cost) -> PathSegment {
        match *self {
            Known(ref path) => Known(path.reversed(start_cost, end_cost)),
            Unknown {
                start,
                end,
                len,
                cost,
            } => Unknown {
                start: end,
                end: start,
                cost: cost + end_cost - start_cost,
                len,
            },
        }
    }
}