server/include/face.h

/*
 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
 * 
 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
 * Copyright (©) 1994,2007 Mark Wedel
 * Copyright (©) 1992,2007 Frank Tore Johansen
 * 
 * Crossfire TRT 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 Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 * 
 * The authors can be reached via e-mail to <crossfire@schmorp.de>
 */

#ifndef FACE_H__
#define FACE_H__

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

#define CHKSUM_SIZE 6
#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
{
  shstr name;
  std::string meta;
  facedata data32, data64;      // either 32/64 face or data32 == generic resource
  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 type;                   // 0 normal face, 1 generic resource
  uint8 smoothlevel;            // smoothlevel is per-face in 2.x servers
  uint8 visibility;
  uint8 magicmap;               /* Color to show this in magic map */

  faceinfo ()
  : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0)
  { }
};

inline void
object_freezer::put (keyword k, faceinfo *v)
{
  put (k, v ? &v->name : (const char *)0);
}

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;
};

typedef uint16 animidx;

struct animation
{
  shstr name;                   /* Name of the animation sequence */
  animidx number;
  uint8 num_animations;         /* How many different faces to animate */
  uint8 facings;                /* How many facings (1,2,4,8) */
  faceidx *faces;               /* The different animations */

  static animation &create (const char *name, uint8 frames, uint8 facings = 1);
  static animation &find (const char *name);

  void resize (int new_size);
};

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

extern animhash_t animhash;
extern std::vector<animation> animations;

#endif

Revision:	1.17
Committed:	Sun Jul 1 04:08:14 2007 UTC (16 years, 10 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.16:	+4 -2 lines
Log Message:	- support priority as second argument of askface - send images of same priority in fifo order, but higher priorities first.
#	Content
1	/*
2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
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 it
9	* under the terms of the GNU General Public License as published by the Free
10	* Software Foundation; either version 2 of the License, or (at your option)
11	* any later version.
12	*
13	* This program is distributed in the hope that it will be useful, but
14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16	* for more details.
17	*
18	* You should have received a copy of the GNU General Public License along
19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21	*
22	* The authors can be reached via e-mail to <crossfire@schmorp.de>
23	*/
24
25	#ifndef FACE_H__
26	#define FACE_H__
27
28	#include <string>
29	#include <tr1/unordered_map>
30
31	#define CHKSUM_SIZE 6
32	#define MAX_FACES 10000 // stupid gcfclient artificially limits
33
34	typedef uint16 faceidx;
35
36	extern faceidx blank_face, empty_face;
37
38	struct facedata
39	{
40	std::string data;
41	uint8 chksum[CHKSUM_SIZE];
42	};
43
44	/* New face structure - this enforces the notion that data is face by
45	* face only - you can not change the color of an item - you need to instead
46	* create a new face with that color.
47	*/
48	struct faceinfo
49	{
50	shstr name;
51	std::string meta;
52	facedata data32, data64; // either 32/64 face or data32 == generic resource
53	faceidx number; /* This is the image id. It should be the */
54	/* same value as its position in the array */
55	faceidx smooth; /* the smooth face for this face, or 0 */
56	uint8 type; // 0 normal face, 1 generic resource
57	uint8 smoothlevel; // smoothlevel is per-face in 2.x servers
58	uint8 visibility;
59	uint8 magicmap; /* Color to show this in magic map */
60
61	faceinfo ()
62	: number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0)
63	{ }
64	};
65
66	inline void
67	object_freezer::put (keyword k, faceinfo *v)
68	{
69	put (k, v ? &v->name : (const char *)0);
70	}
71
72	typedef std::tr1::unordered_map<const char , int, str_hash, str_equal, slice_allocator< std::pair<const char const, int> >, true> facehash_t;
73
74	extern facehash_t facehash;
75	extern std::vector<faceinfo> faces;
76
77	/* This returns an the face number of face 'name'. Number is constant
78	* during an invocation, but not necessarily between versions (this
79	* is because the faces are arranged in alphabetical order, so
80	* if a face is removed or added, all faces after that will now
81	* have a different number.
82	*
83	* If a face is not found, then defidx is returned. This can be useful
84	* if you want some default face used, or can be set to negative so that
85	* it will be known that the face could not be found.
86	*/
87	faceidx face_find (const char *name, faceidx defidx = 0);
88	faceinfo *face_info (faceidx idx);
89	facedata *face_data (faceidx idx, int faceset);
90
91	struct MapLook
92	{
93	faceinfo *face;
94	uint8 flags;
95	};
96
97	typedef uint16 animidx;
98
99	struct animation
100	{
101	shstr name; /* Name of the animation sequence */
102	animidx number;
103	uint8 num_animations; /* How many different faces to animate */
104	uint8 facings; /* How many facings (1,2,4,8) */
105	faceidx faces; / The different animations */
106
107	static animation &create (const char *name, uint8 frames, uint8 facings = 1);
108	static animation &find (const char *name);
109
110	void resize (int new_size);
111	};
112
113	typedef std::tr1::unordered_map<const char , int, str_hash, str_equal, slice_allocator< std::pair<const char const, int> >, true> animhash_t;
114
115	extern animhash_t animhash;
116	extern std::vector<animation> animations;
117
118	#endif
119