ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/face.h
(Generate patch)

Comparing deliantra/server/include/face.h (file contents):
Revision 1.3 by root, Thu Aug 31 17:54:14 2006 UTC vs.
Revision 1.22 by root, Mon Oct 1 00:44:44 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (©) 1994,2007 Mark Wedel
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 *
8 * Crossfire TRT 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 3 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, see <http://www.gnu.org/licenses/>.
20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
22 */
3 23
4 Copyright (C) 1994 Mark Wedel 24#ifndef FACE_H__
5 Copyright (C) 1992 Frank Tore Johansen 25#define FACE_H__
6 26
7 This program is free software; you can redistribute it and/or modify 27#include <string>
8 it under the terms of the GNU General Public License as published by 28#include <tr1/unordered_map>
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
11 29
12 This program is distributed in the hope that it will be useful, 30#define CHKSUM_SIZE 6
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 31#define MAX_FACES 10000 // stupid gcfclient artificially limits
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16 32
17 You should have received a copy of the GNU General Public License 33typedef uint16 faceidx;
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 34
21 The author can be reached via e-mail to mark@pyramid.com 35extern faceidx blank_face, empty_face;
22*/
23 36
37struct facedata
38{
39 std::string data;
40 uint8 chksum[CHKSUM_SIZE];
41};
24 42
25/* 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
26 * 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
27 * create a new face with that color. 45 * create a new face with that color.
28 */ 46 */
29typedef struct new_face_struct 47struct faceinfo : zero_initialised
30{ 48{
49 shstr name;
50 std::string meta;
51 facedata data32, data64; // either 32/64 face or data32 == generic resource
31 uint16 number; /* This is the image id. It should be the */ 52 faceidx number; /* This is the image id. It should be the */
32 /* same value as its position in the array */ 53 /* same value as its position in the array */
33 shstr name; 54 faceidx smooth; /* the smooth face for this face, or 0 */
55 uint8 type; // 0 normal face, otherwise other resource
56 uint8 smoothlevel; // smoothlevel is per-face in 2.x servers
34 uint8 visibility; 57 uint8 visibility;
35 uint8 magicmap; /* Color to show this in magic map */ 58 uint8 magicmap; /* Color to show this in magic map */
59
60 facedata *data (int faceset) const;
61};
62
63inline void
64object_freezer::put (keyword k, faceinfo *v)
65{
66 put (k, v ? &v->name : (const char *)0);
36} 67}
37New_Face;
38 68
39typedef struct map_look_struct 69typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> facehash_t;
70
71extern facehash_t facehash;
72extern std::vector<faceinfo> faces;
73
74/* This returns an the face number of face 'name'. Number is constant
75 * during an invocation, but not necessarily between versions (this
76 * is because the faces are arranged in alphabetical order, so
77 * if a face is removed or added, all faces after that will now
78 * have a different number.
79 *
80 * If a face is not found, then defidx is returned. This can be useful
81 * if you want some default face used, or can be set to negative so that
82 * it will be known that the face could not be found.
83 */
84faceidx face_find (const char *name, faceidx defidx = 0);
85faceinfo *face_info (faceidx idx);
86facedata *face_data (faceidx idx, int faceset);
87
88struct MapLook
40{ 89{
41 New_Face *face; 90 faceinfo *face;
42 uint8 flags; 91 uint8 flags;
43} MapLook; 92};
44 93
45typedef struct 94typedef uint16 animidx;
95
96struct animation
46{ 97{
98 faceidx *faces; /* The different animations */
99 int num_animations; /* How many different faces to animate */
100 sint8 facings; /* How many facings (1,2,4,8) */
101 animidx number;
47 shstr name; /* Name of the animation sequence */ 102 shstr name; /* Name of the animation sequence */
48 uint8 num_animations; /* How many different faces to animate */
49 uint8 facings; /* How many facings (1,2,4,8) */
50 Fontindex *faces; /* The different animations */
51 uint16 num; /* Where we are in the array */
52} Animations;
53 103
104 static animation &create (const char *name, uint8 frames, uint8 facings = 1);
105 static animation &find (const char *name);
54 106
107 void resize (int new_size);
108};
109
110typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> animhash_t;
111
112extern animhash_t animhash;
113extern std::vector<animation> animations;
114
115#endif
116

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines