bevy_northstar 0.1.0

A Bevy plugin for Hierarchical Pathfinding
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109

#![doc = include_str!("../README.md")]

use std::cmp::Ordering;
use std::hash::BuildHasherDefault;

use bevy::math::UVec3;
use dir::Dir;
use indexmap::IndexMap;
use rustc_hash::FxHasher;

mod astar;
mod chunk;
pub mod components;
pub mod debug;
mod dijkstra;
mod dir;
mod graph;
pub mod grid;
pub mod raycast;
mod neighbor;
mod node;
pub mod path;
pub mod plugin;
mod theta;

pub mod prelude {
    pub use crate::components::*;
    pub use crate::debug::{MapType, NorthstarDebugPlugin};
    pub use crate::dir::Dir;
    pub use crate::grid::{Grid, GridSettings};
    pub use crate::neighbor::*;
    pub use crate::path::Path;
    pub use crate::plugin::NorthstarPlugin;
    pub use crate::plugin::NorthstarSettings;
    pub use crate::plugin::PathingSet;
    pub use crate::plugin::Stats;
    pub use crate::Point;
}

pub type NodeId = usize;

type FxIndexMap<K, V> = IndexMap<K, V, BuildHasherDefault<FxHasher>>;

#[derive(Debug, Default, Clone, Copy)]
pub struct Point {
    pub cost: u32,
    pub wall: bool,
    pub ramp: bool,
}

impl Point {
    pub fn new(cost: u32, wall: bool) -> Self {
        Point {
            cost,
            wall,
            ramp: false,
        }
    }
}

#[derive(Debug, Clone)]
pub struct Edge {
    pub start: UVec3,
    pub end: UVec3,
    pub dir: Dir,
    pub cost: u32,
    pub walkable: bool,
}

impl Edge {
    pub fn new(start: UVec3, end: UVec3, dir: Dir, cost: u32, walkable: bool) -> Self {
        Edge {
            start,
            end,
            dir,
            cost,
            walkable,
        }
    }
}

pub(crate) struct SmallestCostHolder<Id> {
    estimated_cost: Id,
    cost: Id,
    index: usize,
}

impl<Id: PartialEq> PartialEq for SmallestCostHolder<Id> {
    fn eq(&self, other: &Self) -> bool {
        self.estimated_cost.eq(&other.estimated_cost) && self.cost.eq(&other.cost)
    }
}

impl<Id: Eq> Eq for SmallestCostHolder<Id> {}

impl<Id: Ord> PartialOrd for SmallestCostHolder<Id> {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl<Id: Ord> Ord for SmallestCostHolder<Id> {
    fn cmp(&self, other: &Self) -> Ordering {
        match other.estimated_cost.cmp(&self.estimated_cost) {
            Ordering::Equal => self.cost.cmp(&other.cost),
            s => s,
        }
    }
}