server/include/face.h

/*
 * CrossFire, A Multiplayer game for X-windows
 * 
 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
 * Copyright (C) 1994 Mark Wedel
 * Copyright (C) 1992 Frank Tore Johansen
 * 
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 * The author can be reached via e-mail to mark@pyramid.com
 */
#ifndef FACE_H__
#define FACE_H__

#include <string>
#include <tr1/unordered_map>

#define CHKSUM_SIZE (128 / 8)
#define MAX_FACES 10000 // stupid gcfclient artificially limits

typedef uint16 faceidx;

extern faceidx blank_face, empty_face;

struct facedata
{
  std::string data;
  uint8 chksum[CHKSUM_SIZE];
};

/* New face structure - this enforces the notion that data is face by
 * face only - you can not change the color of an item - you need to instead
 * create a new face with that color.
 */
struct faceinfo : zero_initialised
{
  shstr name;
  facedata data32, data64;
  faceidx number;               /* This is the image id.  It should be the */
                                /* same value as its position in the array */
  faceidx smooth;               /* the smooth face for this face, or 0 */
  uint8 visibility;
  uint8 magicmap;               /* Color to show this in magic map */
};

typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> facehash_t;

extern facehash_t facehash;
extern std::vector<faceinfo> faces;

/* This returns an the face number of face 'name'.  Number is constant
 * during an invocation, but not necessarily between versions (this
 * is because the faces are arranged in alphabetical order, so
 * if a face is removed or added, all faces after that will now
 * have a different number.
 *
 * If a face is not found, then defidx is returned.  This can be useful
 * if you want some default face used, or can be set to negative so that
 * it will be known that the face could not be found.
 */
faceidx face_find (const char *name, faceidx defidx = 0);
faceinfo *face_info (faceidx idx);
facedata *face_data (faceidx idx, int faceset);

struct MapLook
{
  faceinfo *face;
  uint8 flags;
};

struct animation
{
  shstr name;                   /* Name of the animation sequence */
  uint8 num_animations;         /* How many different faces to animate */
  uint8 facings;                /* How many facings (1,2,4,8) */
  faceidx *faces;               /* The different animations */
  uint16 num;                   /* Where we are in the array */
};

#endif

Revision:	1.10
Committed:	Wed Mar 14 00:04:58 2007 UTC (19 years, 6 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.9:	+12 -10 lines
Log Message:	- rewrote smooth face handling, as a side-effect, smoothing seems to work again and smooth faces can be reloaded. - the server now sends the full animation for an object the first time it is seen, this uses slightly more bandwidth initially, but avoids the flickering for objects change their face later.
#	User	Rev	Content
1	root	1.1	/*
2	pippijn	1.7	* 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	root	1.9	#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;
36	root	1.1
37	root	1.10	struct facedata
38			{
39			std::string data;
40			uint8 chksum[CHKSUM_SIZE];
41			};
42
43	root	1.1	/* New face structure - this enforces the notion that data is face by
44			* face only - you can not change the color of an item - you need to instead
45			* create a new face with that color.
46			*/
47	root	1.10	struct faceinfo : zero_initialised
48	root	1.3	{
49	root	1.9	shstr name;
50	root	1.10	facedata data32, data64;
51	root	1.9	faceidx number; /* This is the image id. It should be the */
52	root	1.2	/* same value as its position in the array */
53	root	1.10	faceidx smooth; /* the smooth face for this face, or 0 */
54	root	1.3	uint8 visibility;
55			uint8 magicmap; /* Color to show this in magic map */
56	root	1.4	};
57	root	1.3
58	root	1.9	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	root	1.10	faceidx face_find (const char *name, faceidx defidx = 0);
74			faceinfo *face_info (faceidx idx);
75			facedata *face_data (faceidx idx, int faceset);
76	root	1.9
77	root	1.4	struct MapLook
78	root	1.3	{
79	root	1.9	faceinfo *face;
80	root	1.3	uint8 flags;
81	root	1.4	};
82	root	1.1
83	root	1.8	struct animation
84	root	1.3	{
85			shstr name; /* Name of the animation sequence */
86			uint8 num_animations; /* How many different faces to animate */
87			uint8 facings; /* How many facings (1,2,4,8) */
88	root	1.9	faceidx faces; / The different animations */
89	root	1.3	uint16 num; /* Where we are in the array */
90	root	1.4	};
91	root	1.1
92	root	1.9	#endif
93