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
|
/**
* @file
* @brief Level ID.
**/
#pragma once
#include "coord-def.h"
#include "tag-version.h"
#include "branch-type.h"
class reader;
class writer;
// Identifies a level. Should never include virtual methods or
// dynamically allocated memory (see code to push level_id onto Lua
// stack in l-dgn.cc)
class level_id
{
public:
branch_type branch; // The branch in which the level is.
int depth; // What depth (in this branch - starting from 1)
public:
// Returns the level_id of the current level.
static level_id current();
// Returns the level_id of the level that the stair/portal/whatever at
// 'pos' on the current level leads to.
static level_id get_next_level_id(const coord_def &pos);
// Important that if run after this, ::is_valid() is false.
level_id()
: branch(BRANCH_DUNGEON), depth(-1)
{
}
level_id(branch_type br, int dep = 1)
: branch(br), depth(dep)
{
}
/// @throws bad_level_id if s could not be parsed.
static level_id parse_level_id(const string &s);
#if TAG_MAJOR_VERSION == 34
static level_id from_packed_place(const unsigned short place);
#endif
string describe(bool long_name = false, bool with_number = true) const;
void clear()
{
branch = BRANCH_DUNGEON;
depth = -1;
}
// Returns the absolute depth in the dungeon for the level_id;
// non-dungeon branches (specifically Abyss and Pan) will return
// depths suitable for use in monster and item generation.
int absdepth() const;
bool is_valid() const
{
return branch < NUM_BRANCHES && depth > 0;
}
bool operator == (const level_id &id) const
{
return branch == id.branch && depth == id.depth;
}
bool operator != (const level_id &id) const
{
return !operator == (id);
}
bool operator <(const level_id &id) const
{
return branch < id.branch || (branch==id.branch && depth < id.depth);
}
void save(writer&) const;
void load(reader&);
};
// A position on a particular level.
struct level_pos
{
level_id id;
coord_def pos; // The grid coordinates on this level.
level_pos() : id(), pos()
{
pos.x = pos.y = -1;
}
level_pos(const level_id &lid, const coord_def &coord)
: id(lid), pos(coord)
{
}
level_pos(const level_id &lid)
: id(lid), pos()
{
pos.x = pos.y = -1;
}
// Returns the level_pos of where the player is standing.
static level_pos current();
bool operator == (const level_pos &lp) const
{
return id == lp.id && pos == lp.pos;
}
bool operator != (const level_pos &lp) const
{
return id != lp.id || pos != lp.pos;
}
bool operator < (const level_pos &lp) const
{
return id < lp.id || (id == lp.id && pos < lp.pos);
}
bool is_valid() const
{
return id.depth > -1 && pos.x != -1 && pos.y != -1;
}
bool is_on(const level_id _id)
{
return id == _id;
}
void clear()
{
id.clear();
pos = coord_def(-1, -1);
}
void save(writer&) const;
void load(reader&);
};
|
