80 lines
2.5 KiB
Rust
80 lines
2.5 KiB
Rust
use ::rltk::Point;
|
|
use ::specs::prelude::*;
|
|
|
|
use crate::components::{EntityMoved, Monster, MyTurn, Position, Viewshed, WantsToMelee};
|
|
use crate::Map;
|
|
|
|
pub struct MonsterAI {}
|
|
|
|
impl<'a> System<'a> for MonsterAI {
|
|
#[allow(clippy::type_complexity)]
|
|
type SystemData = (
|
|
WriteExpect<'a, Map>,
|
|
ReadExpect<'a, Point>,
|
|
ReadExpect<'a, Entity>,
|
|
Entities<'a>,
|
|
WriteStorage<'a, Viewshed>,
|
|
ReadStorage<'a, Monster>,
|
|
WriteStorage<'a, Position>,
|
|
WriteStorage<'a, WantsToMelee>,
|
|
WriteStorage<'a, EntityMoved>,
|
|
ReadStorage<'a, MyTurn>,
|
|
);
|
|
|
|
fn run(&mut self, data: Self::SystemData) {
|
|
let (
|
|
mut map,
|
|
player_pos,
|
|
player_entity,
|
|
entities,
|
|
mut viewshed,
|
|
monster,
|
|
mut position,
|
|
mut wants_to_melee,
|
|
mut entity_moved,
|
|
turns,
|
|
) = data;
|
|
|
|
for (entity, mut viewshed, _monster, mut pos, _turn) in
|
|
(&entities, &mut viewshed, &monster, &mut position, &turns).join()
|
|
{
|
|
let distance =
|
|
rltk::DistanceAlg::Pythagoras.distance2d(Point::new(pos.x, pos.y), *player_pos);
|
|
if distance < 1.5 {
|
|
// Attack goes here
|
|
wants_to_melee
|
|
.insert(
|
|
entity,
|
|
WantsToMelee {
|
|
target: *player_entity,
|
|
},
|
|
)
|
|
.expect("Unable to insert attack");
|
|
} else if viewshed.visible_tiles.contains(&*player_pos) {
|
|
// The path to the player
|
|
let path = rltk::a_star_search(
|
|
map.xy_idx(pos.x, pos.y) as i32,
|
|
map.xy_idx(player_pos.x, player_pos.y) as i32,
|
|
&*map,
|
|
);
|
|
|
|
if path.success && path.steps.len() > 1 {
|
|
let mut idx = map.xy_idx(pos.x, pos.y);
|
|
|
|
map.blocked[idx] = false;
|
|
pos.x = path.steps[1] as i32 % map.width;
|
|
pos.y = path.steps[1] as i32 / map.width;
|
|
|
|
entity_moved
|
|
.insert(entity, EntityMoved {})
|
|
.expect("Unable to add EntityMoved flag to monster");
|
|
|
|
idx = map.xy_idx(pos.x, pos.y);
|
|
map.blocked[idx] = true;
|
|
viewshed.dirty = true;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|