-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
abf54be
commit a44e1ca
Showing
4 changed files
with
1,847 additions
and
1,837 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,159 +1,162 @@ | ||
| use core::iter::FusedIterator; | ||
|
|
||
| pub use crate::prelude::*; | ||
|
|
||
| impl<T, const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> TileMap<T, WIDTH, HEIGHT, SIZE> { | ||
| /// Find lines in the grid which meet particular conditions | ||
| pub const fn get_lines<'a, F: Fn(&T) -> bool>( | ||
| &'a self, | ||
| directions: &'a [Vector], | ||
| check_item: F, | ||
| min_length: usize, | ||
| ) -> impl Iterator<Item = Line<'a, T, WIDTH, HEIGHT>> { | ||
| LineFinder { | ||
| grid: self, | ||
| directions, | ||
| position: Tile::NORTH_WEST, | ||
| direction_index: 0, | ||
| check_item, | ||
| min_length, | ||
| } | ||
| } | ||
| } | ||
|
|
||
| #[derive(Clone, Debug)] | ||
| struct LineFinder<'a, T, const WIDTH: u8, const HEIGHT: u8, const SIZE: usize, F: Fn(&T) -> bool> { | ||
| pub grid: &'a TileMap<T, WIDTH, HEIGHT, SIZE>, | ||
| pub directions: &'a [Vector], | ||
| pub check_item: F, | ||
| pub position: Tile<WIDTH, HEIGHT>, | ||
| pub direction_index: usize, | ||
| pub min_length: usize, | ||
| } | ||
|
|
||
| /// A line in a grid | ||
| #[derive(Clone, Debug, PartialEq, Eq)] | ||
| pub struct Line<'a, T, const WIDTH: u8, const HEIGHT: u8> { | ||
| /// The value at the first tile | ||
| pub first_item: &'a T, | ||
| /// The first tile | ||
| pub origin: Tile<WIDTH, HEIGHT>, | ||
| /// The direction of the line | ||
| pub direction: Vector, | ||
| /// The number of tiles, including the origin | ||
| pub length: usize, | ||
| } | ||
|
|
||
| impl<'a, T, const WIDTH: u8, const HEIGHT: u8> Line<'a, T, WIDTH, HEIGHT> { | ||
| #[must_use] | ||
| /// # Panics | ||
| /// If the line is invalid | ||
| pub fn positions( | ||
| & self, | ||
| ) -> impl FusedIterator<Item = Tile<WIDTH, HEIGHT>> + ExactSizeIterator + Clone + use<'_, T, WIDTH, HEIGHT> { | ||
| (0..self.length).map(|x| (self.origin + (self.direction * x)).unwrap()) | ||
| } | ||
| } | ||
|
|
||
| impl<'a, T, const WIDTH: u8, const HEIGHT: u8, const SIZE: usize, F: Fn(&T) -> bool> Iterator | ||
| for LineFinder<'a, T, WIDTH, HEIGHT, SIZE, F> | ||
| { | ||
| type Item = Line<'a, T, WIDTH, HEIGHT>; | ||
|
|
||
| fn next(&mut self) -> Option<Self::Item> { | ||
| 'items: loop { | ||
| let item = &self.grid[self.position]; | ||
| if (self.check_item)(item) { | ||
| while self.direction_index < self.directions.len() { | ||
| let direction = self.directions[self.direction_index]; | ||
| self.direction_index += 1; | ||
| let mut length = 1; | ||
| let mut current = self.position; | ||
| 'len: loop { | ||
| let Some(next) = current + direction else { | ||
| break 'len; | ||
| }; | ||
| current = next; | ||
| let item2 = &self.grid[next]; | ||
|
|
||
| if (self.check_item)(item2) { | ||
| length += 1; | ||
| } else { | ||
| break 'len; | ||
| } | ||
| } | ||
| if length >= self.min_length { | ||
| let line = Line { | ||
| first_item: item, | ||
| origin: self.position, | ||
| direction, | ||
| length, | ||
| }; | ||
| return Some(line); | ||
| } | ||
| } | ||
| self.direction_index = 0; | ||
| } | ||
| let Some(new_position) = self.position.try_next() else { | ||
| break 'items; | ||
| }; | ||
| self.position = new_position; | ||
| } | ||
|
|
||
| None | ||
| } | ||
| } | ||
|
|
||
| #[cfg(test)] | ||
| mod tests { | ||
| use super::*; | ||
| use crate::tile::*; | ||
| use itertools::Itertools; | ||
|
|
||
| #[test] | ||
| pub fn test_line_finder_none() { | ||
| let mut map: TileMap<bool, 4, 4, 16> = Default::default(); | ||
|
|
||
| map[Tile::new_const::<0, 1>()] = true; | ||
| map[Tile::new_const::<1, 1>()] = true; | ||
| map[Tile::new_const::<2, 0>()] = true; | ||
| map[Tile::new_const::<3, 0>()] = true; | ||
|
|
||
| let lines = map | ||
| .get_lines(&[Vector::EAST, Vector::WEST], |x| *x, 4) | ||
| .collect_vec(); | ||
|
|
||
| assert_eq!(lines.len(), 0); | ||
| } | ||
|
|
||
| #[test] | ||
| pub fn test_line_finder_4() { | ||
| let mut map: TileMap<bool, 4, 4, 16> = Default::default(); | ||
| map[Tile::new_const::<0, 0>()] = true; | ||
| map[Tile::new_const::<1, 1>()] = true; | ||
| map[Tile::new_const::<2, 2>()] = true; | ||
| map[Tile::new_const::<3, 3>()] = true; | ||
|
|
||
| let lines = map | ||
| .get_lines( | ||
| &[ | ||
| Vector::SOUTH, | ||
| Vector::EAST, | ||
| Vector::SOUTH_EAST, | ||
| Vector::NORTH_EAST, | ||
| ], | ||
| |x| *x, | ||
| 4, | ||
| ) | ||
| .collect_vec(); | ||
|
|
||
| assert_eq!(lines.len(), 1); | ||
|
|
||
| let line = lines[0].clone(); | ||
|
|
||
| assert_eq!(line.first_item, &true); | ||
| assert_eq!(line.length, 4); | ||
| assert_eq!(line.origin, Tile::new_const::<0, 0>()); | ||
| assert_eq!(line.direction, Vector::SOUTH_EAST); | ||
| } | ||
| } | ||
| use core::iter::FusedIterator; | ||
|
|
||
| pub use crate::prelude::*; | ||
|
|
||
| impl<T, const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> TileMap<T, WIDTH, HEIGHT, SIZE> { | ||
| /// Find lines in the grid which meet particular conditions | ||
| pub const fn get_lines<'a, F: Fn(&T) -> bool>( | ||
| &'a self, | ||
| directions: &'a [Vector], | ||
| check_item: F, | ||
| min_length: usize, | ||
| ) -> impl Iterator<Item = Line<'a, T, WIDTH, HEIGHT>> { | ||
| LineFinder { | ||
| grid: self, | ||
| directions, | ||
| position: Tile::NORTH_WEST, | ||
| direction_index: 0, | ||
| check_item, | ||
| min_length, | ||
| } | ||
| } | ||
| } | ||
|
|
||
| #[derive(Clone, Debug)] | ||
| struct LineFinder<'a, T, const WIDTH: u8, const HEIGHT: u8, const SIZE: usize, F: Fn(&T) -> bool> { | ||
| pub grid: &'a TileMap<T, WIDTH, HEIGHT, SIZE>, | ||
| pub directions: &'a [Vector], | ||
| pub check_item: F, | ||
| pub position: Tile<WIDTH, HEIGHT>, | ||
| pub direction_index: usize, | ||
| pub min_length: usize, | ||
| } | ||
|
|
||
| /// A line in a grid | ||
| #[derive(Clone, Debug, PartialEq, Eq)] | ||
| pub struct Line<'a, T, const WIDTH: u8, const HEIGHT: u8> { | ||
| /// The value at the first tile | ||
| pub first_item: &'a T, | ||
| /// The first tile | ||
| pub origin: Tile<WIDTH, HEIGHT>, | ||
| /// The direction of the line | ||
| pub direction: Vector, | ||
| /// The number of tiles, including the origin | ||
| pub length: usize, | ||
| } | ||
|
|
||
| impl<T, const WIDTH: u8, const HEIGHT: u8> Line<'_, T, WIDTH, HEIGHT> { | ||
| #[must_use] | ||
| /// # Panics | ||
| /// If the line is invalid | ||
| pub fn positions( | ||
| &self, | ||
| ) -> impl FusedIterator<Item = Tile<WIDTH, HEIGHT>> | ||
| + ExactSizeIterator | ||
| + Clone | ||
| + use<'_, T, WIDTH, HEIGHT> { | ||
| (0..self.length).map(|x| (self.origin + (self.direction * x)).unwrap()) | ||
| } | ||
| } | ||
|
|
||
| impl<'a, T, const WIDTH: u8, const HEIGHT: u8, const SIZE: usize, F: Fn(&T) -> bool> Iterator | ||
| for LineFinder<'a, T, WIDTH, HEIGHT, SIZE, F> | ||
| { | ||
| type Item = Line<'a, T, WIDTH, HEIGHT>; | ||
|
|
||
| fn next(&mut self) -> Option<Self::Item> { | ||
| 'items: loop { | ||
| let item = &self.grid[self.position]; | ||
| if (self.check_item)(item) { | ||
| while self.direction_index < self.directions.len() { | ||
| let direction = self.directions[self.direction_index]; | ||
| self.direction_index += 1; | ||
| let mut length = 1; | ||
| let mut current = self.position; | ||
| 'len: loop { | ||
| let Some(next) = current + direction else { | ||
| break 'len; | ||
| }; | ||
| current = next; | ||
| let item2 = &self.grid[next]; | ||
|
|
||
| if (self.check_item)(item2) { | ||
| length += 1; | ||
| } else { | ||
| break 'len; | ||
| } | ||
| } | ||
| if length >= self.min_length { | ||
| let line = Line { | ||
| first_item: item, | ||
| origin: self.position, | ||
| direction, | ||
| length, | ||
| }; | ||
| return Some(line); | ||
| } | ||
| } | ||
| self.direction_index = 0; | ||
| } | ||
| let Some(new_position) = self.position.try_next() else { | ||
| break 'items; | ||
| }; | ||
| self.position = new_position; | ||
| } | ||
|
|
||
| None | ||
| } | ||
| } | ||
|
|
||
| #[cfg(test)] | ||
| mod tests { | ||
| use super::*; | ||
| use crate::tile::*; | ||
| use itertools::Itertools; | ||
|
|
||
| #[test] | ||
| pub fn test_line_finder_none() { | ||
| let mut map: TileMap<bool, 4, 4, 16> = Default::default(); | ||
|
|
||
| map[Tile::new_const::<0, 1>()] = true; | ||
| map[Tile::new_const::<1, 1>()] = true; | ||
| map[Tile::new_const::<2, 0>()] = true; | ||
| map[Tile::new_const::<3, 0>()] = true; | ||
|
|
||
| let lines = map | ||
| .get_lines(&[Vector::EAST, Vector::WEST], |x| *x, 4) | ||
| .collect_vec(); | ||
|
|
||
| assert_eq!(lines.len(), 0); | ||
| } | ||
|
|
||
| #[test] | ||
| pub fn test_line_finder_4() { | ||
| let mut map: TileMap<bool, 4, 4, 16> = Default::default(); | ||
| map[Tile::new_const::<0, 0>()] = true; | ||
| map[Tile::new_const::<1, 1>()] = true; | ||
| map[Tile::new_const::<2, 2>()] = true; | ||
| map[Tile::new_const::<3, 3>()] = true; | ||
|
|
||
| let lines = map | ||
| .get_lines( | ||
| &[ | ||
| Vector::SOUTH, | ||
| Vector::EAST, | ||
| Vector::SOUTH_EAST, | ||
| Vector::NORTH_EAST, | ||
| ], | ||
| |x| *x, | ||
| 4, | ||
| ) | ||
| .collect_vec(); | ||
|
|
||
| assert_eq!(lines.len(), 1); | ||
|
|
||
| let line = lines[0].clone(); | ||
|
|
||
| assert_eq!(line.first_item, &true); | ||
| assert_eq!(line.length, 4); | ||
| assert_eq!(line.origin, Tile::new_const::<0, 0>()); | ||
| assert_eq!(line.direction, Vector::SOUTH_EAST); | ||
| } | ||
| } |
Oops, something went wrong.