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
|
/*
* File: mon-transit.h
* Summary: Tracking monsters in transit between levels.
* Written by: Darshan Shaligram
*/
#ifndef MON_TRANSIT_H
#define MON_TRANSIT_H
#include "monster.h"
#include <map>
#include <list>
struct follower
{
monsters mons;
FixedVector<item_def, NUM_MONSTER_SLOTS> items;
follower() : mons(), items() { }
follower(const monsters &m);
bool place(bool near_player = false);
void load_mons_items();
void restore_mons_items(monsters &m);
};
typedef std::list<follower> m_transit_list;
typedef std::map<level_id, m_transit_list> monsters_in_transit;
typedef std::list<item_def> i_transit_list;
typedef std::map<level_id, i_transit_list> items_in_transit;
extern monsters_in_transit the_lost_ones;
extern items_in_transit transiting_items;
void transit_lists_clear();
m_transit_list *get_transit_list(const level_id &where);
void add_monster_to_transit(const level_id &dest, const monsters &m);
void add_item_to_transit(const level_id &dest, const item_def &i);
// Places (some of the) monsters eligible to be placed on this level.
void place_transiting_monsters();
void place_followers();
void place_transiting_items();
#endif
|
