server/include/treasure.h

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
 * Copyright (©) 1992 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>
 */

/*
 * defines and variables used by the artifact generation routines
 */

#ifndef TREASURE_H
#define TREASURE_H

#define MAGIC_VALUE             10000   /* Might need to increase later */
#define CHANCE_FOR_ARTIFACT     20

#define STARTMAL        100
#define STEPMAL         10

/* List, What type to clone_arch(), max magic, how many */

#define MAXMAGIC 4

#define DIFFLEVELS 31

/*
 * Flags to generate_treasures():
 */
enum
{
  GT_ENVIRONMENT = 0x0001,  // put treasure at object, not into object
  GT_INVISIBLE   = 0x0002,
  GT_STARTEQUIP  = 0x0004,
  GT_APPLY       = 0x0008,
  GT_ONLY_GOOD   = 0x0010,
  GT_MINIMAL     = 0x0020,  // Do minimal adjustments
};

/* when a treasure got cloned from archlist, we want perhaps change some default
 * values. All values in this structure will override the default arch.
 * TODO: It is a bad way to implement this with a special structure.
 * Because the real arch list is a at runtime not changed, we can grap for example
 * here a clone of the arch, store it in the treasure list and then run the original
 * arch parser over this clone, using the treasure list as script until an END comes. 
 * This will allow ANY changes which is possible and we use ony one parser.
 */

typedef struct _change_arch
{
  shstr name;              /* is != NULL, copy this over the original arch name */
  shstr title;             /* is != NULL, copy this over the original arch name */
  shstr slaying;           /* is != NULL, copy this over the original arch name */
} _change_arch;

/*
 * treasure is one element in a linked list, which together consist of a
 * complete treasure-list.  Any arch can point to a treasure-list
 * to get generated standard treasure when an archetype of that type
 * is generated (from a generator)
*/
struct treasure : zero_initialised
{
  arch_ptr item;                   /* Which item this link can be */
  shstr name;                      /* If non null, name of list to use
                                      instead */
  treasure *next;                  /* Next treasure-item in a linked list */
  treasure *next_yes;              /* If this item was generated, use */
                                   /* this link instead of ->next */
  treasure *next_no;               /* If this item was not generated, */
                                   /* then continue here */
  struct _change_arch change_arch; /* override default arch values if set in treasure list */
  uint16 chance;                   /* Percent chance for this item */
                                   /* If the entry is a list transition,
                                    * 'magic' contains the difficulty
                                    * required to go to the new list
                                    */
  uint16 nrof;                     /* random 1 to nrof items are generated */
  uint8 magic;                     /* Max magic bonus to item */

  treasure ()
  : chance (100)
  { }
};

struct treasurelist : zero_initialised
{
  shstr name;                           /* Usually monster-name/combination */
  sint16 total_chance;                  /* If non-zero, only 1 item on this
                                         * list should be generated.  The
                                         * total_chance contains the sum of
                                         * the chance for this list.
                                         */
  treasurelist *next;   /* Next treasure-item in linked list */
  treasure *items;              /* Items in this list, linked */

  void create (object *op, int flag, int difficulty);

  static treasurelist *read (object_thawer &f);
  static treasurelist *get  (const char *name); // find or create
  static treasurelist *find (const char *name);
};

inline void
object_freezer::put (const keyword_string k, treasurelist *v)
{
  if (expect_true (v))
    put (k, v->name);
  else
    put (k);
}

void create_treasure (treasurelist *t, object *op, int flag, int difficulty, int tries = 0);

#endif

Revision:	1.30
Committed:	Sat Apr 23 04:56:51 2011 UTC (13 years, 1 month ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.29:	+1 -1 lines
Log Message:	update copyright to 2011
#	User	Rev	Content
1	root	1.1	/*
2	root	1.21	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	pippijn	1.11	*
4	root	1.30	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	root	1.27	* Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6			* Copyright (©) 1992 Frank Tore Johansen
7	pippijn	1.11	*
8	root	1.25	* 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.11	*
13	root	1.20	* 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.11	*
18	root	1.25	* 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.18	*
22	root	1.21	* The authors can be reached via e-mail to <support@deliantra.net>
23	pippijn	1.11	*/
24	root	1.1
25			/*
26			* defines and variables used by the artifact generation routines
27			*/
28
29			#ifndef TREASURE_H
30			#define TREASURE_H
31
32			#define MAGIC_VALUE 10000 /* Might need to increase later */
33			#define CHANCE_FOR_ARTIFACT 20
34
35			#define STARTMAL 100
36			#define STEPMAL 10
37
38			/* List, What type to clone_arch(), max magic, how many */
39
40			#define MAXMAGIC 4
41
42			#define DIFFLEVELS 31
43
44			/*
45			* Flags to generate_treasures():
46			*/
47	root	1.6	enum
48			{
49	root	1.29	GT_ENVIRONMENT = 0x0001, // put treasure at object, not into object
50	root	1.15	GT_INVISIBLE = 0x0002,
51			GT_STARTEQUIP = 0x0004,
52			GT_APPLY = 0x0008,
53			GT_ONLY_GOOD = 0x0010,
54	root	1.23	GT_MINIMAL = 0x0020, // Do minimal adjustments
55	root	1.1	};
56
57			/* when a treasure got cloned from archlist, we want perhaps change some default
58			* values. All values in this structure will override the default arch.
59			* TODO: It is a bad way to implement this with a special structure.
60			* Because the real arch list is a at runtime not changed, we can grap for example
61			* here a clone of the arch, store it in the treasure list and then run the original
62			* arch parser over this clone, using the treasure list as script until an END comes.
63			* This will allow ANY changes which is possible and we use ony one parser.
64			*/
65
66	root	1.6	typedef struct _change_arch
67			{
68	root	1.3	shstr name; /* is != NULL, copy this over the original arch name */
69			shstr title; /* is != NULL, copy this over the original arch name */
70			shstr slaying; /* is != NULL, copy this over the original arch name */
71	root	1.1	} _change_arch;
72
73			/*
74			* treasure is one element in a linked list, which together consist of a
75			* complete treasure-list. Any arch can point to a treasure-list
76			* to get generated standard treasure when an archetype of that type
77			* is generated (from a generator)
78			*/
79	root	1.7	struct treasure : zero_initialised
80	root	1.4	{
81	root	1.22	arch_ptr item; /* Which item this link can be */
82			shstr name; /* If non null, name of list to use
83			instead */
84			treasure next; / Next treasure-item in a linked list */
85			treasure next_yes; / If this item was generated, use */
86			/* this link instead of ->next */
87			treasure next_no; / If this item was not generated, */
88			/* then continue here */
89			struct _change_arch change_arch; /* override default arch values if set in treasure list */
90			uint16 chance; /* Percent chance for this item */
91			/* If the entry is a list transition,
92			* 'magic' contains the difficulty
93			* required to go to the new list
94			*/
95			uint16 nrof; /* random 1 to nrof items are generated */
96			uint8 magic; /* Max magic bonus to item */
97	root	1.13
98			treasure ()
99			: chance (100)
100			{ }
101	root	1.7	};
102	root	1.1
103	root	1.7	struct treasurelist : zero_initialised
104	root	1.4	{
105	root	1.3	shstr name; /* Usually monster-name/combination */
106	root	1.1	sint16 total_chance; /* If non-zero, only 1 item on this
107	root	1.2	* list should be generated. The
108			* total_chance contains the sum of
109			* the chance for this list.
110			*/
111	root	1.7	treasurelist next; / Next treasure-item in linked list */
112			treasure items; / Items in this list, linked */
113	root	1.13
114	root	1.16	void create (object *op, int flag, int difficulty);
115
116	root	1.14	static treasurelist *read (object_thawer &f);
117	root	1.13	static treasurelist get (const char name); // find or create
118			static treasurelist find (const char name);
119	root	1.7	};
120	root	1.1
121	root	1.19	inline void
122	root	1.26	object_freezer::put (const keyword_string k, treasurelist *v)
123	root	1.19	{
124	root	1.26	if (expect_true (v))
125			put (k, v->name);
126			else
127			put (k);
128	root	1.19	}
129
130	root	1.15	void create_treasure (treasurelist t, object op, int flag, int difficulty, int tries = 0);
131
132	root	1.1	#endif
133	root	1.12