seastar 0.3.1

Dependency-free implementation of the A* pathfinding algorithm for uniform-cost, 2D grids in cardinal directions.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

/// Represents an (x, y) coordinate on a `Grid`.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct Point {
    pub x: isize,
    pub y: isize,
}

impl Point {
    #[must_use]
    pub fn new(x: isize, y: isize) -> Self {
        Self { x, y }
    }
}

impl std::fmt::Display for Point {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "({}, {})", self.x, self.y)
    }
}