1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
8 | * Deliantra 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 3 of the License, or |
10 | * the Free Software Foundation, either version 3 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, |
… | |
… | |
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, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | #ifndef OBJECT_H |
24 | #ifndef OBJECT_H |
25 | #define OBJECT_H |
25 | #define OBJECT_H |
26 | |
26 | |
… | |
… | |
65 | const char *nonuse_name; /* Name to describe objects we can't use */ |
65 | const char *nonuse_name; /* Name to describe objects we can't use */ |
66 | } Body_Locations; |
66 | } Body_Locations; |
67 | |
67 | |
68 | extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; |
68 | extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; |
69 | |
69 | |
|
|
70 | #define NUM_COINS 4 /* number of coin types */ |
|
|
71 | extern const char *const coins[NUM_COINS + 1]; |
|
|
72 | |
70 | /* |
73 | /* |
71 | * Each object (this also means archetypes!) could have a few of these |
74 | * Each object (this also means archetypes!) could have a few of these |
72 | * "dangling" from it; this could also end up containing 'parse errors'. |
75 | * "dangling" from it; this could also end up containing 'parse errors'. |
73 | * |
76 | * |
74 | * key and value are shared-strings. |
77 | * key and value are shared-strings. |
… | |
… | |
85 | |
88 | |
86 | struct UUID |
89 | struct UUID |
87 | { |
90 | { |
88 | uint64 seq; |
91 | uint64 seq; |
89 | |
92 | |
|
|
93 | static UUID cur; // last uuid generated |
|
|
94 | static void init (); |
|
|
95 | static UUID gen (); |
|
|
96 | |
90 | UUID () { } |
97 | UUID () { } |
91 | UUID (uint64 seq) : seq(seq) { } |
98 | UUID (uint64 seq) : seq(seq) { } |
92 | operator uint64() { return seq; } |
99 | operator uint64() { return seq; } |
93 | void operator =(uint64 seq) { this->seq = seq; } |
100 | void operator =(uint64 seq) { this->seq = seq; } |
94 | }; |
101 | }; |
95 | |
|
|
96 | extern void init_uuid (); |
|
|
97 | extern UUID gen_uuid (); |
|
|
98 | extern const uint64 UUID_SKIP; |
|
|
99 | |
102 | |
100 | /* Definition for WILL_APPLY values. Replaces having harcoded values |
103 | /* Definition for WILL_APPLY values. Replaces having harcoded values |
101 | * sprinkled in the code. Note that some of these also replace fields |
104 | * sprinkled in the code. Note that some of these also replace fields |
102 | * that were in the can_apply area. What is the point of having both |
105 | * that were in the can_apply area. What is the point of having both |
103 | * can_apply and will_apply? |
106 | * can_apply and will_apply? |
… | |
… | |
580 | MTH static archetype *find (const_utf8_string name); |
583 | MTH static archetype *find (const_utf8_string name); |
581 | |
584 | |
582 | MTH void link (); |
585 | MTH void link (); |
583 | MTH void unlink (); |
586 | MTH void unlink (); |
584 | |
587 | |
|
|
588 | MTH object *instance (); |
|
|
589 | |
585 | object_vector_index ACC (RW, archid); // index in archvector |
590 | object_vector_index ACC (RW, archid); // index in archvector |
586 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
591 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
587 | bool ACC (RW, stub); // if true, this is an invalid archetype |
592 | bool ACC (RW, stub); // if true, this is an invalid archetype |
588 | |
593 | |
589 | sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
594 | sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |