1 |
root |
1.1 |
/* |
2 |
root |
1.24 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
pippijn |
1.7 |
* |
4 |
root |
1.33 |
* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 |
pippijn |
1.7 |
* |
6 |
root |
1.27 |
* Deliantra is free software: you can redistribute it and/or modify it under |
7 |
|
|
* the terms of the Affero GNU General Public License as published by the |
8 |
|
|
* Free Software Foundation, either version 3 of the License, or (at your |
9 |
|
|
* option) any later version. |
10 |
pippijn |
1.7 |
* |
11 |
root |
1.18 |
* This program is distributed in the hope that it will be useful, |
12 |
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 |
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 |
|
|
* GNU General Public License for more details. |
15 |
pippijn |
1.7 |
* |
16 |
root |
1.27 |
* You should have received a copy of the Affero GNU General Public License |
17 |
|
|
* and the GNU General Public License along with this program. If not, see |
18 |
|
|
* <http://www.gnu.org/licenses/>. |
19 |
root |
1.15 |
* |
20 |
root |
1.24 |
* The authors can be reached via e-mail to <support@deliantra.net> |
21 |
pippijn |
1.7 |
*/ |
22 |
root |
1.15 |
|
23 |
root |
1.9 |
#ifndef FACE_H__ |
24 |
|
|
#define FACE_H__ |
25 |
|
|
|
26 |
|
|
#include <string> |
27 |
|
|
#include <tr1/unordered_map> |
28 |
|
|
|
29 |
root |
1.31 |
#define CHKSUM_MAXLEN 15 |
30 |
root |
1.9 |
#define MAX_FACES 10000 // stupid gcfclient artificially limits |
31 |
|
|
|
32 |
|
|
typedef uint16 faceidx; |
33 |
|
|
|
34 |
root |
1.34 |
extern faceidx blank_face, empty_face, magicmouth_face; |
35 |
root |
1.1 |
|
36 |
root |
1.10 |
struct facedata |
37 |
|
|
{ |
38 |
|
|
std::string data; |
39 |
root |
1.31 |
uint8 chksum[CHKSUM_MAXLEN]; |
40 |
|
|
uint8 chksum_len; |
41 |
root |
1.32 |
|
42 |
|
|
facedata () |
43 |
|
|
: chksum_len (0) |
44 |
|
|
{ } |
45 |
root |
1.10 |
}; |
46 |
|
|
|
47 |
root |
1.1 |
/* New face structure - this enforces the notion that data is face by |
48 |
|
|
* face only - you can not change the color of an item - you need to instead |
49 |
|
|
* create a new face with that color. |
50 |
|
|
*/ |
51 |
elmex |
1.23 |
struct faceinfo |
52 |
root |
1.3 |
{ |
53 |
elmex |
1.23 |
faceinfo () |
54 |
|
|
: number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0) |
55 |
|
|
{ |
56 |
|
|
} |
57 |
|
|
|
58 |
root |
1.9 |
shstr name; |
59 |
root |
1.17 |
std::string meta; |
60 |
root |
1.35 |
facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text |
61 |
root |
1.9 |
faceidx number; /* This is the image id. It should be the */ |
62 |
root |
1.2 |
/* same value as its position in the array */ |
63 |
root |
1.10 |
faceidx smooth; /* the smooth face for this face, or 0 */ |
64 |
root |
1.19 |
uint8 type; // 0 normal face, otherwise other resource |
65 |
root |
1.13 |
uint8 smoothlevel; // smoothlevel is per-face in 2.x servers |
66 |
root |
1.3 |
uint8 visibility; |
67 |
|
|
uint8 magicmap; /* Color to show this in magic map */ |
68 |
root |
1.11 |
|
69 |
root |
1.20 |
facedata *data (int faceset) const; |
70 |
root |
1.4 |
}; |
71 |
root |
1.3 |
|
72 |
root |
1.16 |
inline void |
73 |
root |
1.30 |
object_freezer::put (const keyword_string k, faceinfo *v) |
74 |
root |
1.16 |
{ |
75 |
root |
1.30 |
if (expect_true (v)) |
76 |
|
|
put (k, v->name); |
77 |
|
|
else |
78 |
|
|
put (k); |
79 |
root |
1.16 |
} |
80 |
|
|
|
81 |
root |
1.26 |
typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > facehash_t; |
82 |
root |
1.9 |
|
83 |
|
|
extern facehash_t facehash; |
84 |
|
|
extern std::vector<faceinfo> faces; |
85 |
|
|
|
86 |
|
|
/* This returns an the face number of face 'name'. Number is constant |
87 |
|
|
* during an invocation, but not necessarily between versions (this |
88 |
|
|
* is because the faces are arranged in alphabetical order, so |
89 |
|
|
* if a face is removed or added, all faces after that will now |
90 |
|
|
* have a different number. |
91 |
|
|
* |
92 |
|
|
* If a face is not found, then defidx is returned. This can be useful |
93 |
|
|
* if you want some default face used, or can be set to negative so that |
94 |
|
|
* it will be known that the face could not be found. |
95 |
|
|
*/ |
96 |
root |
1.10 |
faceidx face_find (const char *name, faceidx defidx = 0); |
97 |
|
|
faceinfo *face_info (faceidx idx); |
98 |
|
|
facedata *face_data (faceidx idx, int faceset); |
99 |
root |
1.9 |
|
100 |
root |
1.4 |
struct MapLook |
101 |
root |
1.3 |
{ |
102 |
root |
1.9 |
faceinfo *face; |
103 |
root |
1.3 |
uint8 flags; |
104 |
root |
1.4 |
}; |
105 |
root |
1.1 |
|
106 |
root |
1.14 |
typedef uint16 animidx; |
107 |
|
|
|
108 |
root |
1.8 |
struct animation |
109 |
root |
1.3 |
{ |
110 |
root |
1.21 |
faceidx *faces; /* The different animations */ |
111 |
|
|
int num_animations; /* How many different faces to animate */ |
112 |
|
|
sint8 facings; /* How many facings (1,2,4,8) */ |
113 |
|
|
animidx number; |
114 |
root |
1.3 |
shstr name; /* Name of the animation sequence */ |
115 |
root |
1.14 |
|
116 |
|
|
static animation &create (const char *name, uint8 frames, uint8 facings = 1); |
117 |
|
|
static animation &find (const char *name); |
118 |
|
|
|
119 |
|
|
void resize (int new_size); |
120 |
root |
1.4 |
}; |
121 |
root |
1.1 |
|
122 |
root |
1.26 |
typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > animhash_t; |
123 |
root |
1.14 |
|
124 |
|
|
extern std::vector<animation> animations; |
125 |
|
|
|
126 |
root |
1.9 |
#endif |
127 |
|
|
|