blob: 42a574e85ad2a5341d4efca740b040c783d7ab8b (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
|
/*
* File: mtransit.cc
* Summary: Tracks monsters that are in suspended animation between levels.
* Written by: Darshan Shaligram
*
* Modified for Crawl Reference by $Author: dshaligram $ on $Date: 2007-03-15T20:10:20.648083Z $
*/
#include "AppHdr.h"
#include "mtransit.h"
#include "items.h"
#include "mon-util.h"
#include "stuff.h"
#define MAX_LOST 100
monsters_in_transit the_lost_ones;
static void place_lost_monsters(m_transit_list &m);
static void cull_lost(m_transit_list &mlist, int how_many)
{
// First pass, drop non-uniques.
for (m_transit_list::iterator i = mlist.begin(); i != mlist.end(); )
{
m_transit_list::iterator finger = i++;
if (!mons_is_unique(finger->mons.type))
{
mlist.erase(finger);
if (--how_many <= MAX_LOST)
return;
}
}
// If we're still over the limit (unlikely), just lose
// the old ones.
while (how_many-- > MAX_LOST && !mlist.empty())
mlist.erase( mlist.begin() );
}
void add_monster_to_transit(const level_id &lid, const monsters &m)
{
m_transit_list &mlist = the_lost_ones[lid];
mlist.push_back(m);
#ifdef DEBUG_DIAGNOSTICS
mprf(MSGCH_DIAGNOSTICS, "Monster in transit: %s",
m.name(DESC_PLAIN).c_str());
#endif
const int how_many = mlist.size();
if (how_many > MAX_LOST)
cull_lost(mlist, how_many);
}
void place_transiting_monsters()
{
level_id c = level_id::current();
monsters_in_transit::iterator i = the_lost_ones.find(c);
if (i == the_lost_ones.end())
return;
place_lost_monsters(i->second);
if (i->second.empty())
the_lost_ones.erase(i);
}
static bool place_lost_monster(follower &f)
{
return (f.place(false));
}
static void place_lost_monsters(m_transit_list &m)
{
for (m_transit_list::iterator i = m.begin();
i != m.end(); )
{
m_transit_list::iterator mon = i++;
// Transiting monsters have a 50% chance of being placed.
if (coinflip())
continue;
if (place_lost_monster(*mon))
m.erase(mon);
}
}
//////////////////////////////////////////////////////////////////////////
// follower
follower::follower(const monsters &m) : mons(m), items()
{
load_mons_items();
}
void follower::load_mons_items()
{
for (int i = 0; i < NUM_MONSTER_SLOTS; ++i)
if (mons.inv[i] != NON_ITEM)
items[i] = mitm[ mons.inv[i] ];
else
items[i].clear();
}
bool follower::place(bool near_player)
{
for (int i = 0; i < MAX_MONSTERS - 5; ++i)
{
monsters &m = menv[i];
if (m.alive())
continue;
m = mons;
if (m.find_place_to_live(near_player))
{
#ifdef DEBUG_DIAGNOSTICS
mprf(MSGCH_DIAGNOSTICS, "Placed follower: %s",
m.name(DESC_PLAIN).c_str());
#endif
m.target_x = m.target_y = 0;
m.flags |= MF_JUST_SUMMONED;
restore_mons_items(m);
return (true);
}
m.reset();
break;
}
return (false);
}
void follower::restore_mons_items(monsters &m)
{
for (int i = 0; i < NUM_MONSTER_SLOTS; ++i)
{
if (items[i].base_type == OBJ_UNASSIGNED)
m.inv[i] = NON_ITEM;
else
{
const int islot = get_item_slot(0);
m.inv[i] = islot;
if (islot == NON_ITEM)
continue;
item_def &it = mitm[islot];
it = items[i];
it.x = it.y = 0;
it.link = NON_ITEM;
}
}
}
|
