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.5 by root, Wed Dec 13 21:27:09 2006 UTC vs.
Revision 1.9 by root, Sun Mar 11 02:12:44 2007 UTC

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, 33typedef 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 35extern 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
21 The author can be reached via e-mail to mark@pyramid.com
22*/
23 36
24/* 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
25 * 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
26 * create a new face with that color. 39 * create a new face with that color.
27 */ 40 */
28struct New_Face 41struct faceinfo
29{ 42{
43 shstr name;
30 uint16 number; /* This is the image id. It should be the */ 44 faceidx number; /* This is the image id. It should be the */
31 /* same value as its position in the array */ 45 /* same value as its position in the array */
32 shstr name;
33 uint8 visibility; 46 uint8 visibility;
34 uint8 magicmap; /* Color to show this in magic map */ 47 uint8 magicmap; /* Color to show this in magic map */
35}; 48};
36 49
50struct facedata
51{
52 std::string data;
53 uint8 chksum[CHKSUM_SIZE];
54};
55
56typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> facehash_t;
57
58extern facehash_t facehash;
59extern std::vector<faceinfo> faces;
60extern 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 */
72int face_find (const char *name, int defidx = 0);
73facedata *face_data (int idx, int faceset);
74
37struct MapLook 75struct MapLook
38{ 76{
39 New_Face *face; 77 faceinfo *face;
40 uint8 flags; 78 uint8 flags;
41}; 79};
42 80
43struct Animations 81struct animation
44{ 82{
45 shstr name; /* Name of the animation sequence */ 83 shstr name; /* Name of the animation sequence */
46 uint8 num_animations; /* How many different faces to animate */ 84 uint8 num_animations; /* How many different faces to animate */
47 uint8 facings; /* How many facings (1,2,4,8) */ 85 uint8 facings; /* How many facings (1,2,4,8) */
48 uint16 *faces; /* The different animations */ 86 faceidx *faces; /* The different animations */
49 uint16 num; /* Where we are in the array */ 87 uint16 num; /* Where we are in the array */
50}; 88};
51 89
90#endif
91

Diff Legend

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