| … | |
… | |
| 19 | * along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
| 20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 21 | * |
21 | * |
| 22 | * The author can be reached via e-mail to mark@pyramid.com |
22 | * The author can be reached via e-mail to mark@pyramid.com |
| 23 | */ |
23 | */ |
|
|
24 | #ifndef FACE_H__ |
|
|
25 | #define FACE_H__ |
|
|
26 | |
|
|
27 | #include <string> |
|
|
28 | #include <tr1/unordered_map> |
|
|
29 | |
|
|
30 | #define CHKSUM_SIZE (128 / 8) |
|
|
31 | #define MAX_FACES 10000 // stupid gcfclient artificially limits |
|
|
32 | |
|
|
33 | typedef uint16 faceidx; |
|
|
34 | |
|
|
35 | extern faceidx blank_face, empty_face; |
| 24 | |
36 | |
| 25 | /* New face structure - this enforces the notion that data is face by |
37 | /* New face structure - this enforces the notion that data is face by |
| 26 | * face only - you can not change the color of an item - you need to instead |
38 | * face only - you can not change the color of an item - you need to instead |
| 27 | * create a new face with that color. |
39 | * create a new face with that color. |
| 28 | */ |
40 | */ |
| 29 | struct facetile |
41 | struct faceinfo |
| 30 | { |
42 | { |
|
|
43 | shstr name; |
| 31 | uint16 number; /* This is the image id. It should be the */ |
44 | faceidx number; /* This is the image id. It should be the */ |
| 32 | /* same value as its position in the array */ |
45 | /* same value as its position in the array */ |
| 33 | shstr name; |
|
|
| 34 | uint8 visibility; |
46 | uint8 visibility; |
| 35 | uint8 magicmap; /* Color to show this in magic map */ |
47 | uint8 magicmap; /* Color to show this in magic map */ |
| 36 | }; |
48 | }; |
| 37 | |
49 | |
|
|
50 | struct facedata |
|
|
51 | { |
|
|
52 | std::string data; |
|
|
53 | uint8 chksum[CHKSUM_SIZE]; |
|
|
54 | }; |
|
|
55 | |
|
|
56 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> facehash_t; |
|
|
57 | |
|
|
58 | extern facehash_t facehash; |
|
|
59 | extern std::vector<faceinfo> faces; |
|
|
60 | extern std::vector<facedata> face32, face64; |
|
|
61 | |
|
|
62 | /* This returns an the face number of face 'name'. Number is constant |
|
|
63 | * during an invocation, but not necessarily between versions (this |
|
|
64 | * is because the faces are arranged in alphabetical order, so |
|
|
65 | * if a face is removed or added, all faces after that will now |
|
|
66 | * have a different number. |
|
|
67 | * |
|
|
68 | * If a face is not found, then defidx is returned. This can be useful |
|
|
69 | * if you want some default face used, or can be set to negative so that |
|
|
70 | * it will be known that the face could not be found. |
|
|
71 | */ |
|
|
72 | int face_find (const char *name, int defidx = 0); |
|
|
73 | facedata *face_data (int idx, int faceset); |
|
|
74 | |
| 38 | struct MapLook |
75 | struct MapLook |
| 39 | { |
76 | { |
| 40 | facetile *face; |
77 | faceinfo *face; |
| 41 | uint8 flags; |
78 | uint8 flags; |
| 42 | }; |
79 | }; |
| 43 | |
80 | |
| 44 | struct animation |
81 | struct animation |
| 45 | { |
82 | { |
| 46 | shstr name; /* Name of the animation sequence */ |
83 | shstr name; /* Name of the animation sequence */ |
| 47 | uint8 num_animations; /* How many different faces to animate */ |
84 | uint8 num_animations; /* How many different faces to animate */ |
| 48 | uint8 facings; /* How many facings (1,2,4,8) */ |
85 | uint8 facings; /* How many facings (1,2,4,8) */ |
| 49 | uint16 *faces; /* The different animations */ |
86 | faceidx *faces; /* The different animations */ |
| 50 | uint16 num; /* Where we are in the array */ |
87 | uint16 num; /* Where we are in the array */ |
| 51 | }; |
88 | }; |
| 52 | |
89 | |
|
|
90 | #endif |
|
|
91 | |
