ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/treasure.h
(Generate patch)

Comparing deliantra/server/include/treasure.h (file contents):
Revision 1.1 by root, Fri Feb 3 07:12:51 2006 UTC vs.
Revision 1.20 by root, Sun Jul 1 05:00:18 2007 UTC

1/* 1/*
2 * static char *rcsid_treasure_h = 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * "$Id: treasure.h,v 1.1 2006/02/03 07:12:51 root Exp $"; 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 *
8 * Crossfire TRT 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 3 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, see <http://www.gnu.org/licenses/>.
20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
4 */ 22 */
5
6/*
7 CrossFire, A Multiplayer game for X-windows
8
9 Copyright (C) 2002 Mark Wedel & Crossfire Development Team
10 Copyright (C) 1992 Frank Tore Johansen
11
12 This program is free software; you can redistribute it and/or modify
13 it under the terms of the GNU General Public License as published by
14 the Free Software Foundation; either version 2 of the License, or
15 (at your option) any later version.
16
17 This program is distributed in the hope that it will be useful,
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 GNU General Public License for more details.
21
22 You should have received a copy of the GNU General Public License
23 along with this program; if not, write to the Free Software
24 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25
26 The authors can be reached via e-mail at crossfire-devel@real-time.com
27*/
28 23
29/* 24/*
30 * defines and variables used by the artifact generation routines 25 * defines and variables used by the artifact generation routines
31 */ 26 */
32 27
… …
43 38
44#define MAXMAGIC 4 39#define MAXMAGIC 4
45 40
46#define DIFFLEVELS 31 41#define DIFFLEVELS 31
47 42
48
49/* 43/*
50 * Flags to generate_treasures(): 44 * Flags to generate_treasures():
51 */ 45 */
52
53enum { 46enum
54 GT_ENVIRONMENT = 0x0001, 47{
48 GT_ENVIRONMENT = 0x0001, // put treasure at objetc, not into object
55 GT_INVISIBLE = 0x0002, 49 GT_INVISIBLE = 0x0002,
56 GT_STARTEQUIP = 0x0004, 50 GT_STARTEQUIP = 0x0004,
57 GT_APPLY = 0x0008, 51 GT_APPLY = 0x0008,
58 GT_ONLY_GOOD = 0x0010, 52 GT_ONLY_GOOD = 0x0010,
59 GT_UPDATE_INV = 0x0020, 53 GT_UPDATE_INV = 0x0020,
60 GT_MINIMAL = 0x0040 /* Do minimal adjustments */ 54 GT_MINIMAL = 0x0040, // Do minimal adjustments
61}; 55};
62
63 56
64/* when a treasure got cloned from archlist, we want perhaps change some default 57/* when a treasure got cloned from archlist, we want perhaps change some default
65 * values. All values in this structure will override the default arch. 58 * values. All values in this structure will override the default arch.
66 * TODO: It is a bad way to implement this with a special structure. 59 * TODO: It is a bad way to implement this with a special structure.
67 * Because the real arch list is a at runtime not changed, we can grap for example 60 * Because the real arch list is a at runtime not changed, we can grap for example
68 * here a clone of the arch, store it in the treasure list and then run the original 61 * here a clone of the arch, store it in the treasure list and then run the original
69 * arch parser over this clone, using the treasure list as script until an END comes. 62 * arch parser over this clone, using the treasure list as script until an END comes.
70 * This will allow ANY changes which is possible and we use ony one parser. 63 * This will allow ANY changes which is possible and we use ony one parser.
71 */ 64 */
72 65
73typedef struct _change_arch { 66typedef struct _change_arch
67{
74 const char *name; /* is != NULL, copy this over the original arch name */ 68 shstr name; /* is != NULL, copy this over the original arch name */
75 const char *title; /* is != NULL, copy this over the original arch name */ 69 shstr title; /* is != NULL, copy this over the original arch name */
76 const char *slaying; /* is != NULL, copy this over the original arch name */ 70 shstr slaying; /* is != NULL, copy this over the original arch name */
77} _change_arch; 71} _change_arch;
78
79 72
80/* 73/*
81 * treasure is one element in a linked list, which together consist of a 74 * treasure is one element in a linked list, which together consist of a
82 * complete treasure-list. Any arch can point to a treasure-list 75 * complete treasure-list. Any arch can point to a treasure-list
83 * to get generated standard treasure when an archetype of that type 76 * to get generated standard treasure when an archetype of that type
84 * is generated (from a generator) 77 * is generated (from a generator)
85*/ 78*/
86 79struct treasure : zero_initialised
87typedef struct treasurestruct { 80{
88 struct archt *item; /* Which item this link can be */ 81 struct archetype *item; /* Which item this link can be */
89 const char *name; /* If non null, name of list to use 82 shstr name; /* If non null, name of list to use
90 instead */ 83 instead */
91 struct treasurestruct *next; /* Next treasure-item in a linked list */ 84 treasure *next; /* Next treasure-item in a linked list */
92 struct treasurestruct *next_yes; /* If this item was generated, use */ 85 treasure *next_yes; /* If this item was generated, use */
93 /* this link instead of ->next */ 86 /* this link instead of ->next */
94 struct treasurestruct *next_no; /* If this item was not generated, */ 87 treasure *next_no; /* If this item was not generated, */
95 /* then continue here */ 88 /* then continue here */
96 struct _change_arch change_arch; /* override default arch values if set in treasure list */ 89 struct _change_arch change_arch; /* override default arch values if set in treasure list */
97 uint8 chance; /* Percent chance for this item */ 90 uint16 chance; /* Percent chance for this item */
98 uint8 magic; /* Max magic bonus to item */ 91 /* If the entry is a list transition,
99 /* If the entry is a list transition, 92 * 'magic' contains the difficulty
100 * 'magic' contains the difficulty 93 * required to go to the new list
101 * required to go to the new list
102 */ 94 */
103 uint16 nrof; /* random 1 to nrof items are generated */ 95 uint16 nrof; /* random 1 to nrof items are generated */
104} treasure; 96 uint8 magic; /* Max magic bonus to item */
105 97
98 treasure ()
99 : chance (100)
100 { }
101};
106 102
107typedef struct treasureliststruct { 103struct treasurelist : zero_initialised
104{
108 const char *name; /* Usually monster-name/combination */ 105 shstr name; /* Usually monster-name/combination */
109 sint16 total_chance; /* If non-zero, only 1 item on this 106 sint16 total_chance; /* If non-zero, only 1 item on this
110 * list should be generated. The 107 * list should be generated. The
111 * total_chance contains the sum of 108 * total_chance contains the sum of
112 * the chance for this list. 109 * the chance for this list.
113 */ 110 */
114 struct treasureliststruct *next; /* Next treasure-item in linked list */ 111 treasurelist *next; /* Next treasure-item in linked list */
115 struct treasurestruct *items; /* Items in this list, linked */ 112 treasure *items; /* Items in this list, linked */
116} treasurelist;
117 113
114 void create (object *op, int flag, int difficulty);
118 115
116 static treasurelist *read (object_thawer &f);
117 static treasurelist *get (const char *name); // find or create
118 static treasurelist *find (const char *name);
119};
120
121inline void
122object_freezer::put (keyword k, treasurelist *v)
123{
124 put (k, v ? &v->name : (const char *)0);
125}
126
127void create_treasure (treasurelist *t, object *op, int flag, int difficulty, int tries = 0);
119 128
120#endif 129#endif
130

Diff Legend

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