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

Comparing deliantra/server/include/object.h (file contents):
Revision 1.150 by root, Wed Sep 12 11:10:10 2007 UTC vs.
Revision 1.156 by root, Fri Apr 11 13:59:06 2008 UTC

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
68extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; 68extern Body_Locations body_locations[NUM_BODY_LOCATIONS];
69 69
70#define NUM_COINS 4 /* number of coin types */
71extern 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
86struct UUID 89struct 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};
95 101
96extern void init_uuid (); 102 typedef char BUF [32];
97extern UUID gen_uuid (); 103
98extern const uint64 UUID_SKIP; 104 bool parse (const char *s)
105 {
106 return sscanf (s, "<1%*[,.]%" SCNx64 ">", &seq) == 1;
107 }
108
109 const char *c_str (char *buf, int len) const
110 {
111 snprintf (buf, len, "<1.%" PRIx64 ">", seq);
112
113 return buf;
114 }
115
116 const char *c_str () const
117 {
118 static BUF buf;
119
120 return c_str (buf, sizeof (buf));
121 }
122};
99 123
100/* Definition for WILL_APPLY values. Replaces having harcoded values 124/* Definition for WILL_APPLY values. Replaces having harcoded values
101 * sprinkled in the code. Note that some of these also replace fields 125 * 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 126 * that were in the can_apply area. What is the point of having both
103 * can_apply and will_apply? 127 * can_apply and will_apply?
… …
507 MTH struct region *region () const; 531 MTH struct region *region () const;
508 532
509 void statusmsg (const char *msg, int color = NDI_BLACK); 533 void statusmsg (const char *msg, int color = NDI_BLACK);
510 void failmsg (const char *msg, int color = NDI_RED); 534 void failmsg (const char *msg, int color = NDI_RED);
511 535
536 const char *query_inventory (object *who = 0, const char *indent = "");
537
512 MTH const_octet_string ref () const; // creates and returns a consistent persistent object reference 538 MTH const_octet_string ref () const; // creates and returns a consistent persistent object reference
513 static object *deref (const_octet_string ref); // returns the object from the generated refreence, if possible 539 static object *deref (const_octet_string ref); // returns the object from the generated refreence, if possible
514 540
515protected: 541protected:
516 void link (); 542 void link ();
… …
577 MTH static archetype *get (const_utf8_string name); // find or create 603 MTH static archetype *get (const_utf8_string name); // find or create
578 MTH static archetype *find (const_utf8_string name); 604 MTH static archetype *find (const_utf8_string name);
579 605
580 MTH void link (); 606 MTH void link ();
581 MTH void unlink (); 607 MTH void unlink ();
608
609 MTH object *instance ();
582 610
583 object_vector_index ACC (RW, archid); // index in archvector 611 object_vector_index ACC (RW, archid); // index in archvector
584 shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ 612 shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */
585 bool ACC (RW, stub); // if true, this is an invalid archetype 613 bool ACC (RW, stub); // if true, this is an invalid archetype
586 614
… …
637 * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - 665 * INS_BELOW_ORIGINATOR: Insert new object immediately below originator -
638 * Use for treasure chests so the new object is the highest thing 666 * Use for treasure chests so the new object is the highest thing
639 * beneath the player, but not actually above it. Note - the 667 * beneath the player, but not actually above it. Note - the
640 * map and x,y coordinates for the object to be inserted must 668 * map and x,y coordinates for the object to be inserted must
641 * match the originator. 669 * match the originator.
642 * INS_MAP_LOAD: disable lots of checkings done at insertion to
643 * speed up map loading process, as we assume the ordering in
644 * loaded map is correct.
645 * 670 *
646 * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY 671 * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY
647 * are mutually exclusive. The behaviour for passing more than one 672 * are mutually exclusive. The behaviour for passing more than one
648 * should be considered undefined - while you may notice what happens 673 * should be considered undefined - while you may notice what happens
649 * right now if you pass more than one, that could very well change 674 * right now if you pass more than one, that could very well change
… …
652#define INS_NO_MERGE 0x0001 677#define INS_NO_MERGE 0x0001
653#define INS_ABOVE_FLOOR_ONLY 0x0002 678#define INS_ABOVE_FLOOR_ONLY 0x0002
654#define INS_NO_WALK_ON 0x0004 679#define INS_NO_WALK_ON 0x0004
655#define INS_ON_TOP 0x0008 680#define INS_ON_TOP 0x0008
656#define INS_BELOW_ORIGINATOR 0x0010 681#define INS_BELOW_ORIGINATOR 0x0010
657#define INS_MAP_LOAD 0x0020
658 682
659#define ARCH_DEPLETION "depletion" 683#define ARCH_DEPLETION "depletion"
660 684
661#endif 685#endif
662 686

Diff Legend

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