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.10 by pippijn, Sat Jan 6 14:42:30 2007 UTC vs.
Revision 1.15 by root, Thu Apr 19 16:23:47 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
7 7 *
8 This program is free software; you can redistribute it and/or modify 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 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 10 * the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version. 11 * (at your option) any later version.
12 12 *
13 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details. 16 * GNU General Public License for more details.
17 17 *
18 You should have received a copy of the GNU General Public License 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 19 * along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 21 *
22 The authors can be reached via e-mail at crossfire@schmorp.de 22 * The authors can be reached via e-mail at crossfire@schmorp.de
23*/ 23 */
24 24
25/* 25/*
26 * defines and variables used by the artifact generation routines 26 * defines and variables used by the artifact generation routines
27 */ 27 */
28 28
… …
42#define DIFFLEVELS 31 42#define DIFFLEVELS 31
43 43
44/* 44/*
45 * Flags to generate_treasures(): 45 * Flags to generate_treasures():
46 */ 46 */
47
48enum 47enum
49{ 48{
50 GT_ENVIRONMENT = 0x0001, 49 GT_ENVIRONMENT = 0x0001, // put treasure at objetc, not into object
51 GT_INVISIBLE = 0x0002, 50 GT_INVISIBLE = 0x0002,
52 GT_STARTEQUIP = 0x0004, 51 GT_STARTEQUIP = 0x0004,
53 GT_APPLY = 0x0008, 52 GT_APPLY = 0x0008,
54 GT_ONLY_GOOD = 0x0010, 53 GT_ONLY_GOOD = 0x0010,
55 GT_UPDATE_INV = 0x0020, 54 GT_UPDATE_INV = 0x0020,
56 GT_MINIMAL = 0x0040 /* Do minimal adjustments */ 55 GT_MINIMAL = 0x0040, // Do minimal adjustments
57}; 56};
58 57
59/* when a treasure got cloned from archlist, we want perhaps change some default 58/* when a treasure got cloned from archlist, we want perhaps change some default
60 * values. All values in this structure will override the default arch. 59 * values. All values in this structure will override the default arch.
61 * TODO: It is a bad way to implement this with a special structure. 60 * TODO: It is a bad way to implement this with a special structure.
… …
76 * treasure is one element in a linked list, which together consist of a 75 * treasure is one element in a linked list, which together consist of a
77 * complete treasure-list. Any arch can point to a treasure-list 76 * complete treasure-list. Any arch can point to a treasure-list
78 * to get generated standard treasure when an archetype of that type 77 * to get generated standard treasure when an archetype of that type
79 * is generated (from a generator) 78 * is generated (from a generator)
80*/ 79*/
81
82struct treasure : zero_initialised 80struct treasure : zero_initialised
83{ 81{
84 struct archetype *item; /* Which item this link can be */ 82 struct archetype *item; /* Which item this link can be */
85 shstr name; /* If non null, name of list to use 83 shstr name; /* If non null, name of list to use
86 instead */ 84 instead */
87 treasure *next; /* Next treasure-item in a linked list */ 85 treasure *next; /* Next treasure-item in a linked list */
88 treasure *next_yes; /* If this item was generated, use */ 86 treasure *next_yes; /* If this item was generated, use */
89 /* this link instead of ->next */ 87 /* this link instead of ->next */
… …
95 /* If the entry is a list transition, 93 /* If the entry is a list transition,
96 * 'magic' contains the difficulty 94 * 'magic' contains the difficulty
97 * required to go to the new list 95 * required to go to the new list
98 */ 96 */
99 uint16 nrof; /* random 1 to nrof items are generated */ 97 uint16 nrof; /* random 1 to nrof items are generated */
98
99 treasure ()
100 : chance (100)
101 { }
100}; 102};
101 103
102struct treasurelist : zero_initialised 104struct treasurelist : zero_initialised
103{ 105{
104 shstr name; /* Usually monster-name/combination */ 106 shstr name; /* Usually monster-name/combination */
… …
107 * total_chance contains the sum of 109 * total_chance contains the sum of
108 * the chance for this list. 110 * the chance for this list.
109 */ 111 */
110 treasurelist *next; /* Next treasure-item in linked list */ 112 treasurelist *next; /* Next treasure-item in linked list */
111 treasure *items; /* Items in this list, linked */ 113 treasure *items; /* Items in this list, linked */
114
115 static treasurelist *read (object_thawer &f);
116 static treasurelist *get (const char *name); // find or create
117 static treasurelist *find (const char *name);
112}; 118};
113 119
120void create_treasure (treasurelist *t, object *op, int flag, int difficulty, int tries = 0);
121
114#endif 122#endif
123

Diff Legend

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