1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
|
|
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
|
|
5 | * Copyright (C) 1994 Mark Wedel |
|
|
6 | * Copyright (C) 1992 Frank Tore Johansen |
|
|
7 | * |
|
|
8 | * This program is free software; you can redistribute it and/or modify |
|
|
9 | * it under the terms of the GNU General Public License as published by |
|
|
10 | * the Free Software Foundation; either version 2 of the License, or |
|
|
11 | * (at your option) any later version. |
|
|
12 | * |
|
|
13 | * This program is distributed in the hope that it will be useful, |
|
|
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
16 | * GNU General Public License for more details. |
|
|
17 | * |
|
|
18 | * You should have received a copy of the GNU General Public License |
|
|
19 | * along with this program; if not, write to the Free Software |
|
|
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
|
|
22 | * The author can be reached via e-mail to mark@pyramid.com |
|
|
23 | */ |
|
|
24 | #ifndef FACE_H__ |
|
|
25 | #define FACE_H__ |
3 | |
26 | |
4 | Copyright (C) 1994 Mark Wedel |
27 | #include <string> |
5 | Copyright (C) 1992 Frank Tore Johansen |
28 | #include <tr1/unordered_map> |
6 | |
29 | |
7 | This program is free software; you can redistribute it and/or modify |
30 | #define CHKSUM_SIZE (128 / 8) |
8 | it under the terms of the GNU General Public License as published by |
31 | #define MAX_FACES 10000 // stupid gcfclient artificially limits |
9 | the Free Software Foundation; either version 2 of the License, or |
|
|
10 | (at your option) any later version. |
|
|
11 | |
32 | |
12 | This program is distributed in the hope that it will be useful, |
33 | typedef uint16 faceidx; |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
15 | GNU General Public License for more details. |
|
|
16 | |
34 | |
17 | You should have received a copy of the GNU General Public License |
35 | extern faceidx blank_face, empty_face; |
18 | along with this program; if not, write to the Free Software |
|
|
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
20 | |
36 | |
21 | The author can be reached via e-mail to mark@pyramid.com |
37 | struct facedata |
22 | */ |
38 | { |
|
|
39 | std::string data; |
|
|
40 | uint8 chksum[CHKSUM_SIZE]; |
|
|
41 | }; |
23 | |
42 | |
24 | /* New face structure - this enforces the notion that data is face by |
43 | /* New face structure - this enforces the notion that data is face by |
25 | * face only - you can not change the color of an item - you need to instead |
44 | * face only - you can not change the color of an item - you need to instead |
26 | * create a new face with that color. |
45 | * create a new face with that color. |
27 | */ |
46 | */ |
28 | struct New_Face |
47 | struct faceinfo : zero_initialised |
29 | { |
48 | { |
|
|
49 | shstr name; |
|
|
50 | facedata data32, data64; |
30 | uint16 number; /* This is the image id. It should be the */ |
51 | faceidx number; /* This is the image id. It should be the */ |
31 | /* same value as its position in the array */ |
52 | /* same value as its position in the array */ |
32 | shstr name; |
53 | faceidx smooth; /* the smooth face for this face, or 0 */ |
33 | uint8 visibility; |
54 | uint8 visibility; |
34 | uint8 magicmap; /* Color to show this in magic map */ |
55 | uint8 magicmap; /* Color to show this in magic map */ |
35 | }; |
56 | }; |
36 | |
57 | |
|
|
58 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> facehash_t; |
|
|
59 | |
|
|
60 | extern facehash_t facehash; |
|
|
61 | extern std::vector<faceinfo> faces; |
|
|
62 | |
|
|
63 | /* This returns an the face number of face 'name'. Number is constant |
|
|
64 | * during an invocation, but not necessarily between versions (this |
|
|
65 | * is because the faces are arranged in alphabetical order, so |
|
|
66 | * if a face is removed or added, all faces after that will now |
|
|
67 | * have a different number. |
|
|
68 | * |
|
|
69 | * If a face is not found, then defidx is returned. This can be useful |
|
|
70 | * if you want some default face used, or can be set to negative so that |
|
|
71 | * it will be known that the face could not be found. |
|
|
72 | */ |
|
|
73 | faceidx face_find (const char *name, faceidx defidx = 0); |
|
|
74 | faceinfo *face_info (faceidx idx); |
|
|
75 | facedata *face_data (faceidx idx, int faceset); |
|
|
76 | |
37 | struct MapLook |
77 | struct MapLook |
38 | { |
78 | { |
39 | New_Face *face; |
79 | faceinfo *face; |
40 | uint8 flags; |
80 | uint8 flags; |
41 | }; |
81 | }; |
42 | |
82 | |
43 | struct Animations |
83 | struct animation |
44 | { |
84 | { |
45 | shstr name; /* Name of the animation sequence */ |
85 | shstr name; /* Name of the animation sequence */ |
46 | uint8 num_animations; /* How many different faces to animate */ |
86 | uint8 num_animations; /* How many different faces to animate */ |
47 | uint8 facings; /* How many facings (1,2,4,8) */ |
87 | uint8 facings; /* How many facings (1,2,4,8) */ |
48 | uint16 *faces; /* The different animations */ |
88 | faceidx *faces; /* The different animations */ |
49 | uint16 num; /* Where we are in the array */ |
89 | uint16 num; /* Where we are in the array */ |
50 | }; |
90 | }; |
51 | |
91 | |
|
|
92 | #endif |
|
|
93 | |