X-Git-Url: http://dolda2000.com/gitweb/?a=blobdiff_plain;f=src%2Fcore%2Flevel%2Fmod.rs;h=488cae16885769960ae2996215a359eb137283b1;hb=afc2bb16b6f16b6e18cd756556a37a756dc5bae1;hp=3336b95993f3dd9a40f836a0e6bc2e12ac497d31;hpb=37f3e1edd969b4ede9dd033895ff806477f6e866;p=kaka%2Frust-sdl-test.git

diff --git a/src/core/level/mod.rs b/src/core/level/mod.rs
index 3336b95..488cae1 100644
--- a/src/core/level/mod.rs
+++ b/src/core/level/mod.rs
@@ -1,6 +1,8 @@
-use common::Point;
+use common::{Point, Dimension, Intersection, supercover_line};
 use core::render::Renderer;
 use sprites::SpriteManager;
+use std::rc::Rc;
+use {point, dimen};
 
 mod lvlgen;
 
@@ -12,45 +14,203 @@ pub use self::lvlgen::LevelGenerator;
 pub struct Level {
     pub gravity: Point<f64>,
     pub grid: Grid<bool>,
-    walls: Vec<Vec<Point<isize>>>,
+    walls: Vec<Rc<WallRegion>>,
+    wall_grid: Grid<Vec<Rc<WallEdge>>>,
 }
 
 impl Level {
-    // pub fn new(gravity: Point<f64>) -> Self {
-    // 	let seed = std::time::SystemTime::now().duration_since(std::time::UNIX_EPOCH).unwrap().as_secs() as u32;
-    // 	let mut lvl = Level { gravity, grid: Grid::generate(seed, 10), iterations: 10, walls: vec!() };
-    // 	lvl.filter_regions();
-    // 	lvl
-    // }
+    pub fn new(gravity: Point<f64>, grid: Grid<bool>, mut walls: Vec<Rc<WallRegion>>) -> Self {
+	let size = (2560, 1440); // TODO: get actual size from walls or something
+	let wall_grid = Level::build_wall_grid(&mut walls, &size.into());
+	dbg!(&wall_grid.cell_size);
+	Level {
+	    gravity,
+	    grid,
+	    walls,
+	    wall_grid,
+	}
+    }
+
+    /// Creates a grid of wall edges for fast lookup
+    fn build_wall_grid(walls: &mut Vec<Rc<WallRegion>>, lvlsize: &Dimension<usize>) -> Grid<Vec<Rc<WallEdge>>> {
+	let size = dimen!(lvlsize.width / 20, lvlsize.height / 20); // TODO: make sure all walls fit within the grid bounds
+	let cs = point!(lvlsize.width / size.width, lvlsize.height / size.height);
+	//let cs = point!(cell_size.width as f64, cell_size.height as f64);
+	let mut grid = Grid {
+	    cells: vec!(vec!(vec!(); size.height); size.width),
+	    size,
+	    cell_size: dimen!(cs.x, cs.y),
+	};
+
+	for wall in walls {
+	    for edge in &wall.edges {
+		for c in grid.grid_coordinates_on_line(edge.p1, edge.p2) {
+		    grid.cells[c.x][c.y].push(Rc::clone(edge));
+		}
+	    }
+	}
+
+	grid
+    }
 
     pub fn render(&mut self, renderer: &mut Renderer, _sprites: &SpriteManager) {
+	// original grid
 	renderer.canvas().set_draw_color((64, 64, 64));
-	let size = self.grid.cell_size;
-	for x in 0..self.grid.width {
-	    for y in 0..self.grid.height {
+	let size = &self.grid.cell_size;
+	for x in 0..self.grid.size.width {
+	    for y in 0..self.grid.size.height {
 		if self.grid.cells[x][y] {
-		    renderer.canvas().fill_rect(sdl2::rect::Rect::new(x as i32 * size as i32, y as i32 * size as i32, size as u32, size as u32)).unwrap();
+		    renderer.canvas().fill_rect(sdl2::rect::Rect::new(
+			x as i32 * size.width as i32,
+			y as i32 * size.height as i32,
+			size.width as u32,
+			size.height as u32)).unwrap();
+		}
+	    }
+	}
+
+	// wall grid
+	renderer.canvas().set_draw_color((0, 32, 0));
+	let size = &self.wall_grid.cell_size;
+	for x in 0..self.wall_grid.size.width {
+	    for y in 0..self.wall_grid.size.height {
+		if !self.wall_grid.cells[x][y].is_empty() {
+		    let num = self.wall_grid.cells[x][y].len();
+		    renderer.canvas().set_draw_color((0, 32*num as u8, 0));
+		    renderer.canvas().fill_rect(sdl2::rect::Rect::new(
+			x as i32 * size.width as i32,
+			y as i32 * size.height as i32,
+			size.width as u32,
+			size.height as u32)).unwrap();
 		}
 	    }
 	}
 
-	let off = (size / 2) as i32;
+	// walls
 	for wall in &self.walls {
-	    for w in wall.windows(2) {
-		renderer.draw_line((w[0].x as i32 + off, w[0].y as i32 + off), (w[1].x as i32 + off, w[1].y as i32 + off), (255, 255, 0));
+	    for e in &wall.edges {
+		renderer.draw_line(
+		    <(i32, i32)>::from(e.p1.to_i32()),
+		    <(i32, i32)>::from(e.p2.to_i32()),
+		    (255, 255, 0));
 	    }
-	    let last = wall.len() - 1;
-	    renderer.draw_line((wall[0].x as i32 + off, wall[0].y as i32 + off), (wall[last].x as i32 + off, wall[last].y as i32 + off), (255, 255, 0));
 	}
     }
+
+    pub fn intersect_walls(&self, p1: Point<f64>, p2: Point<f64>) -> IntersectResult {
+	for c in self.wall_grid.grid_coordinates_on_line(p1, p2) {
+	    if let walls = &self.wall_grid.cells[c.x][c.y] {
+		for w in walls {
+		    if let Intersection::Point(p) = Intersection::lines(p1, p2, w.p1, w.p2) {
+			let wall = Wall {
+			    region: &self.walls[w.region],
+			    edge: Rc::clone(&w),
+			};
+			return IntersectResult::Intersection(wall, p)
+		    }
+		}
+	    }
+	}
+	IntersectResult::None
+    }
+}
+
+pub enum IntersectResult {
+    Intersection(Wall, Point<f64>),
+    None
 }
 
 ////////// GRID ////////////////////////////////////////////////////////////////
 
-#[derive(Default)]
+#[derive(Debug, Default)]
 pub struct Grid<T> {
-    pub width: usize,
-    pub height: usize,
-    pub cell_size: usize,
+    pub size: Dimension<usize>,
+    pub cell_size: Dimension<usize>,
     pub cells: Vec<Vec<T>>,
 }
+
+impl<T> Grid<T> {
+    pub fn at<C>(&self, c: C) -> Option<&T>
+    where C: Into<(isize, isize)>
+    {
+	let c = c.into();
+	if c.0 >= 0 && c.0 < self.size.width as isize && c.1 >= 0 && c.1 < self.size.height as isize {
+	    Some(&self.cells[c.0 as usize][c.1 as usize])
+	} else {
+	    None
+	}
+    }
+
+    pub fn to_grid_coordinate<C>(&self, c: C) -> Option<Point<usize>>
+    where C: Into<(isize, isize)>
+    {
+	let c = c.into();
+	if c.0 >= 0 && c.0 < self.size.width as isize && c.1 >= 0 && c.1 < self.size.height as isize {
+	    Some(point!(c.0 as usize, c.1 as usize))
+	} else {
+	    None
+	}
+    }
+
+    /// Returns a list of grid coordinates that a line in world coordinates passes through.
+    pub fn grid_coordinates_on_line(&self, p1: Point<f64>, p2: Point<f64>) -> Vec<Point<usize>> {
+	let scale = (self.cell_size.width as f64, self.cell_size.height as f64);
+	supercover_line(p1 / scale, p2 / scale)
+	    .iter()
+	    .map(|c| self.to_grid_coordinate(*c))
+	    .flatten()
+	    .collect()
+    }
+}
+
+////////// WALL REGION /////////////////////////////////////////////////////////
+
+#[derive(Debug)]
+pub struct WallRegion {
+    edges: Vec<Rc<WallEdge>>,
+}
+
+impl WallRegion {
+    pub fn new(points: Vec<Point<f64>>) -> Rc<Self> {
+	let mut edges = Vec::with_capacity(points.len());
+
+	for i in 0..points.len() {
+	    let edge = Rc::new(WallEdge {
+		index: i,
+		p1: points[i],
+		p2: points[(i + 1) % points.len()],
+	    });
+	    edges.push(edge);
+	}
+
+	Rc::new(WallRegion { edges })
+    }
+
+    #[allow(dead_code)]
+    fn next(&self, index: usize) -> Rc<WallEdge> {
+	let index = (index + 1) % self.edges.len();
+	Rc::clone(&self.edges[index])
+    }
+
+    #[allow(dead_code)]
+    fn previous(&self, index: usize) -> Rc<WallEdge> {
+	let index = (index + self.edges.len() + 1) % self.edges.len();
+	Rc::clone(&self.edges[index])
+    }
+}
+
+////////// WALL EDGE ///////////////////////////////////////////////////////////
+
+#[derive(Debug, Default)]
+struct WallEdge {
+    index: usize,
+    pub p1: Point<f64>,
+    pub p2: Point<f64>,
+}
+
+////////// WALL ////////////////////////////////////////////////////////////////
+
+pub struct Wall {
+//    region: Rc<WallRegion>,
+    edge: Rc<WallEdge>,
+}