summaryrefslogtreecommitdiffstats
path: root/crawl-ref/source/spells2.cc
diff options
context:
space:
mode:
Diffstat (limited to 'crawl-ref/source/spells2.cc')
-rw-r--r--crawl-ref/source/spells2.cc4
1 files changed, 2 insertions, 2 deletions
diff --git a/crawl-ref/source/spells2.cc b/crawl-ref/source/spells2.cc
index b0f2f38563..e91d251949 100644
--- a/crawl-ref/source/spells2.cc
+++ b/crawl-ref/source/spells2.cc
@@ -2106,7 +2106,7 @@ void point_point(std::vector<coord_def> & origins,
// to calculate the distances in question. In practice it should be called for
// at most 7 searches since 8 (all adjacent free, > 8 monsters in view) can be
// special cased easily.
-bool prioritise_adjacent(coord_def & target, std::vector<coord_def> & candidates)
+bool prioritise_adjacent(const coord_def &target, std::vector<coord_def> & candidates)
{
radius_iterator los_it(target, LOS_RADIUS, true, true, true);
@@ -2114,7 +2114,7 @@ bool prioritise_adjacent(coord_def & target, std::vector<coord_def> & candidates
// collect hostile monster positions in LOS
for ( ; los_it; ++los_it)
{
- monsters * hostile = monster_at(*los_it);
+ monsters *hostile = monster_at(*los_it);
if (hostile && hostile->attitude == ATT_HOSTILE)
mons_positions.push_back(hostile->pos());