monster_ai_system.rs 2.1 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950
  1. extern crate specs;
  2. use specs::prelude::*;
  3. use super::{Viewshed, Monster, Map, Position, WantsToMelee, RunState};
  4. extern crate rltk;
  5. use rltk::{Point};
  6. pub struct MonsterAI {}
  7. impl<'a> System<'a> for MonsterAI {
  8. #[allow(clippy::type_complexity)]
  9. type SystemData = ( WriteExpect<'a, Map>,
  10. ReadExpect<'a, Point>,
  11. ReadExpect<'a, Entity>,
  12. ReadExpect<'a, RunState>,
  13. Entities<'a>,
  14. WriteStorage<'a, Viewshed>,
  15. ReadStorage<'a, Monster>,
  16. WriteStorage<'a, Position>,
  17. WriteStorage<'a, WantsToMelee>);
  18. fn run(&mut self, data : Self::SystemData) {
  19. let (mut map, player_pos, player_entity, runstate, entities, mut viewshed, monster, mut position, mut wants_to_melee) = data;
  20. if *runstate != RunState::MonsterTurn { return; }
  21. for (entity, mut viewshed,_monster,mut pos) in (&entities, &mut viewshed, &monster, &mut position).join() {
  22. let distance = rltk::DistanceAlg::Pythagoras.distance2d(Point::new(pos.x, pos.y), *player_pos);
  23. if distance < 1.5 {
  24. wants_to_melee.insert(entity, WantsToMelee{ target: *player_entity }).expect("Unable to insert attack");
  25. }
  26. else if viewshed.visible_tiles.contains(&*player_pos) {
  27. // Path to the player
  28. let path = rltk::a_star_search(
  29. map.xy_idx(pos.x, pos.y) as i32,
  30. map.xy_idx(player_pos.x, player_pos.y) as i32,
  31. &mut *map
  32. );
  33. if path.success && path.steps.len()>1 {
  34. let mut idx = map.xy_idx(pos.x, pos.y);
  35. map.blocked[idx] = false;
  36. pos.x = path.steps[1] % map.width;
  37. pos.y = path.steps[1] / map.width;
  38. idx = map.xy_idx(pos.x, pos.y);
  39. map.blocked[idx] = true;
  40. viewshed.dirty = true;
  41. }
  42. }
  43. }
  44. }
  45. }