e60c0b26eb
This is the proper data structure to use. No more of this regularly resorting a vector rubbish.
64 lines
1.2 KiB
Rust
64 lines
1.2 KiB
Rust
use std::ops::Add;
|
|
|
|
use crate::vec2d::Vec2d;
|
|
|
|
#[derive(Clone, Copy, Debug, Eq, PartialEq)]
|
|
pub struct Point2d {
|
|
pub x: i32,
|
|
pub y: i32,
|
|
}
|
|
|
|
impl Point2d {
|
|
pub fn new(x: i32, y: i32) -> Point2d {
|
|
Point2d { x, y }
|
|
}
|
|
|
|
pub fn neighbours(&self) -> Vec<Point2d> {
|
|
Vec2d::directions().iter().map(|v| self + v).collect()
|
|
}
|
|
}
|
|
|
|
pub fn p2d(x: i32, y: i32) -> Point2d {
|
|
Point2d::new(x, y)
|
|
}
|
|
|
|
impl Add<Vec2d> for Point2d {
|
|
type Output = Point2d;
|
|
|
|
fn add(self, other: Vec2d) -> Point2d {
|
|
let x = self.x + other.x;
|
|
let y = self.y + other.y;
|
|
Point2d { x, y }
|
|
}
|
|
}
|
|
|
|
impl<'a> Add<&'a Vec2d> for Point2d {
|
|
type Output = Point2d;
|
|
|
|
fn add(self, other: &'a Vec2d) -> Point2d {
|
|
let x = self.x + other.x;
|
|
let y = self.y + other.y;
|
|
Point2d { x, y }
|
|
}
|
|
}
|
|
|
|
impl<'a> Add<Vec2d> for &'a Point2d {
|
|
type Output = Point2d;
|
|
|
|
fn add(self, other: Vec2d) -> Point2d {
|
|
let x = self.x + other.x;
|
|
let y = self.y + other.y;
|
|
Point2d { x, y }
|
|
}
|
|
}
|
|
|
|
impl<'a> Add<&'a Vec2d> for &'a Point2d {
|
|
type Output = Point2d;
|
|
|
|
fn add(self, other: &'a Vec2d) -> Point2d {
|
|
let x = self.x + other.x;
|
|
let y = self.y + other.y;
|
|
Point2d { x, y }
|
|
}
|
|
}
|