server/include/face.h

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 1994,2007 Mark Wedel
 * Copyright (©) 1992,2007 Frank Tore Johansen
 * 
 * Deliantra is free software: you can redistribute it and/or modify it under
 * the terms of the Affero GNU General Public License as published by the
 * Free Software Foundation, either version 3 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 Affero GNU General Public License
 * and the GNU General Public License along with this program. If not, see
 * <http://www.gnu.org/licenses/>.
 * 
 * The authors can be reached via e-mail to <support@deliantra.net>
 */

#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
{
  faceinfo ()
  : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0)
  {
  }

  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, otherwise other resource
  uint8 smoothlevel;            // smoothlevel is per-face in 2.x servers
  uint8 visibility;
  uint8 magicmap;               /* Color to show this in magic map */

  facedata *data (int faceset) const;
};

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> > > 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
{
  faceidx *faces;               /* The different animations */
  int num_animations;           /* How many different faces to animate */
  sint8 facings;                /* How many facings (1,2,4,8) */
  animidx number;
  shstr name;                   /* Name of the animation sequence */

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

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

#endif

Revision:	1.27
Committed:	Mon Oct 12 14:00:58 2009 UTC (14 years, 7 months ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-2_82, rel-2_81
Changes since 1.26:	+7 -6 lines
Log Message:	clarify license
#	User	Rev	Content
1	root	1.1	/*
2	root	1.24	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	pippijn	1.7	*
4	root	1.25	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	root	1.15	* Copyright (©) 1994,2007 Mark Wedel
6			* Copyright (©) 1992,2007 Frank Tore Johansen
7	pippijn	1.7	*
8	root	1.27	* Deliantra is free software: you can redistribute it and/or modify it under
9			* the terms of the Affero GNU General Public License as published by the
10			* Free Software Foundation, either version 3 of the License, or (at your
11			* option) any later version.
12	pippijn	1.7	*
13	root	1.18	* 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	pippijn	1.7	*
18	root	1.27	* You should have received a copy of the Affero GNU General Public License
19			* and the GNU General Public License along with this program. If not, see
20			* <http://www.gnu.org/licenses/>.
21	root	1.15	*
22	root	1.24	* The authors can be reached via e-mail to <support@deliantra.net>
23	pippijn	1.7	*/
24	root	1.15
25	root	1.9	#ifndef FACE_H__
26			#define FACE_H__
27
28			#include <string>
29			#include <tr1/unordered_map>
30
31	root	1.12	#define CHKSUM_SIZE 6
32	root	1.9	#define MAX_FACES 10000 // stupid gcfclient artificially limits
33
34			typedef uint16 faceidx;
35
36			extern faceidx blank_face, empty_face;
37	root	1.1
38	root	1.10	struct facedata
39			{
40			std::string data;
41			uint8 chksum[CHKSUM_SIZE];
42			};
43
44	root	1.1	/* 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	elmex	1.23	struct faceinfo
49	root	1.3	{
50	elmex	1.23	faceinfo ()
51			: number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0)
52			{
53			}
54
55	root	1.9	shstr name;
56	root	1.17	std::string meta;
57			facedata data32, data64; // either 32/64 face or data32 == generic resource
58	root	1.9	faceidx number; /* This is the image id. It should be the */
59	root	1.2	/* same value as its position in the array */
60	root	1.10	faceidx smooth; /* the smooth face for this face, or 0 */
61	root	1.19	uint8 type; // 0 normal face, otherwise other resource
62	root	1.13	uint8 smoothlevel; // smoothlevel is per-face in 2.x servers
63	root	1.3	uint8 visibility;
64			uint8 magicmap; /* Color to show this in magic map */
65	root	1.11
66	root	1.20	facedata *data (int faceset) const;
67	root	1.4	};
68	root	1.3
69	root	1.16	inline void
70			object_freezer::put (keyword k, faceinfo *v)
71			{
72			put (k, v ? &v->name : (const char *)0);
73			}
74
75	root	1.26	typedef std::tr1::unordered_map<const char , int, str_hash, str_equal, slice_allocator< std::pair<const char const, int> > > facehash_t;
76	root	1.9
77			extern facehash_t facehash;
78			extern std::vector<faceinfo> faces;
79
80			/* This returns an the face number of face 'name'. Number is constant
81			* during an invocation, but not necessarily between versions (this
82			* is because the faces are arranged in alphabetical order, so
83			* if a face is removed or added, all faces after that will now
84			* have a different number.
85			*
86			* If a face is not found, then defidx is returned. This can be useful
87			* if you want some default face used, or can be set to negative so that
88			* it will be known that the face could not be found.
89			*/
90	root	1.10	faceidx face_find (const char *name, faceidx defidx = 0);
91			faceinfo *face_info (faceidx idx);
92			facedata *face_data (faceidx idx, int faceset);
93	root	1.9
94	root	1.4	struct MapLook
95	root	1.3	{
96	root	1.9	faceinfo *face;
97	root	1.3	uint8 flags;
98	root	1.4	};
99	root	1.1
100	root	1.14	typedef uint16 animidx;
101
102	root	1.8	struct animation
103	root	1.3	{
104	root	1.21	faceidx faces; / The different animations */
105			int num_animations; /* How many different faces to animate */
106			sint8 facings; /* How many facings (1,2,4,8) */
107			animidx number;
108	root	1.3	shstr name; /* Name of the animation sequence */
109	root	1.14
110			static animation &create (const char *name, uint8 frames, uint8 facings = 1);
111			static animation &find (const char *name);
112
113			void resize (int new_size);
114	root	1.4	};
115	root	1.1
116	root	1.26	typedef std::tr1::unordered_map<const char , int, str_hash, str_equal, slice_allocator< std::pair<const char const, int> > > animhash_t;
117	root	1.14
118			extern animhash_t animhash;
119			extern std::vector<animation> animations;
120
121	root	1.9	#endif
122