[ViewVC] Diff of: cvs/deliantra/server/include/map.h

Comparing deliantra/server/include/map.h (file contents):
Revision 1.121 by root, Mon Nov 9 18:47:56 2009 UTC vs.
Revision 1.133 by root, Tue May 4 22:26:49 2010 UTC

 /*
  * This file is part of Deliantra, the Roguelike Realtime MMORPG.
  *
- * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
+ * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
- * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team
+ * Copyright (©) 2002-2005 Mark Wedel & Crossfire Development Team
- * Copyright (©) 1992,2007 Frank Tore Johansen
+ * 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.
   {
     return blocks (op->move_type);
   }
 };
-// a rectangular area of a map
+// a rectangular area of a map, used my split_to_tiles/unordered_mapwalk
 struct maprect
 {
   maptile *m;
   int x0, y0;
   int x1, y1;
   static sint8 outdoor_darkness; /* the global darkness level outside */
   uint16 ACC (RW, enter_x);        /* enter_x and enter_y are default entrance location */
   uint16 ACC (RW, enter_y);        /* on the map if none are set in the exit */
   oblinkpt *buttons;       /* Linked list of linked lists of buttons */
-  sint16 ACC (RW, temp);   /* base temperature of this tile (F) */
-  sint16 ACC (RW, pressure);       /* barometric pressure (mb) */
-  sint8 ACC (RW, humid);   /* humitidy of this tile */
-  sint8 ACC (RW, windspeed);       /* windspeed of this tile */
-  sint8 ACC (RW, winddir); /* direction of wind */
-  sint8 ACC (RW, sky);     /* sky conditions */
-  int ACC (RW, worldpartx), ACC (RW, worldparty);  /*Highly fasten conversion between worldmap and weathermap */
   struct shopitems *shopitems;     /* a semi-colon seperated list of item-types the map's shop will trade in */
   shstr ACC (RW, shoprace);        /* the preffered race of the local shopkeeper */
   double ACC (RW, shopgreed);      /* how much our shopkeeper overcharges */
   sint64 ACC (RW, shopmin);        /* minimum price a shop will trade for */
   sint64 ACC (RW, shopmax);        /* maximum price a shop will offer */
   // allocates all (empty) mapspace
   MTH void alloc ();
   // deallocates the mapspaces (and destroys all objects)
   MTH void clear ();
+  MTH void post_load (); // update cached values in mapspaces etc.
   MTH void fix_auto_apply ();
   MTH void do_decay_objects ();
   MTH void update_buttons ();
   MTH int change_map_light (int change);
   MTH int estimate_difficulty () const;
   MTH void play_sound (faceidx sound, int x, int y) const;
-  MTH void say_msg (const char *msg, int x, int y) const;
+  MTH void say_msg (const_utf8_string msg, int x, int y) const;
   // connected links
   oblinkpt *find_link (shstr_tmp id);
   MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0);
   bool _load_objects (object_thawer &thawer);
   MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); }
   // save objects into the given file (uses IO_ flags)
   bool _save_objects (object_freezer &freezer, int flags);
-  MTH bool _save_objects (const char *path, int flags);
+  MTH bool _save_objects (const_octet_string path, int flags);
   // save the header pseudo object _only_
   bool _save_header (object_freezer &freezer);
-  MTH bool _save_header (const char *path);
+  MTH bool _save_header (const_octet_string path);
   maptile ();
   maptile (int w, int h);
+  void init ();
   ~maptile ();
   void do_destroy ();
   void gather_callbacks (AV *&callbacks, event_type event) const;
   }
   void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
   bool generate_random_map (random_map_params *RP);
-  static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL
+  static maptile *find_async (const_utf8_string path, maptile *original = 0, bool load = true);//PERL
-  static maptile *find_sync (const char *path, maptile *original = 0);//PERL
+  static maptile *find_sync (const_utf8_string path, maptile *original = 0);//PERL
-  static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
+  static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL
   object *pick_random_object (rand_gen &gen = rndm) const;
   mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
   // return an array of maprects corresponding
   // to the given rectangular area. the last rect will have
   // a 0 map pointer.
-  // the array will be stored in a static memory area,
-  // so recursion is not atm. supported
-  maprect *split_to_tiles (int x0, int y0, int x1, int y1);
+  maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1);
+  MTH bool is_in_shop (int x, int y) const;
 };
+inline bool
+object::is_in_shop () const
+{
+  return is_on_map ()
+         && map->is_in_shop (x, y);
+}
 //+GPL
 /* This is used by get_rangevector to determine where the other
  * creature is.  get_rangevector takes into account map tiling,
 // and so on.
 int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
 int out_of_map (maptile *m, int x, int y);
 maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
 void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
-void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/);
+void get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/);
 int on_same_map (const object *op1, const object *op2);
-int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
+int adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy);
 // adjust map, x and y for tiled maps and return true if the position is valid at all
 static inline bool
 xy_normalise (maptile *&map, sint16 &x, sint16 &y)
 {
 #define ordered_mapwalk_end						\
       }									\
   }
+extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations
 // loop over every space in the given maprect,
 // setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0
 // the iterator code must be a single statement following this macro call, similar to "if"
 // "continue" will skip to the next space
 #define rect_mapwalk(rect,dx0,dy0)					\
 // same as ordered_mapwalk, but the walk will not follow any particular
 // order (unorded), but is likely faster.
 // m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op
 // "continue" will skip to the next space
-#define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1)			\
+#define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1)		\
-  for (maprect *r_e_c_t = (map)->split_to_tiles (			\
+  for (maprect *r_e_c_t = (map)->split_to_tiles (buf,			\
          (ox) + (dx0)    , (oy) + (dy0)    ,				\
          (ox) + (dx1) + 1, (oy) + (dy1) + 1);				\
        r_e_c_t->m;							\
        ++r_e_c_t)							\
     rect_mapwalk (r_e_c_t, (ox), (oy))
-#define unordered_mapwalk(op,dx0,dy0,dx1,dy1)				\
+#define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1)			\
-  unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1)
+  unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1)
 #endif

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.121 by root, Mon Nov 9 18:47:56 2009 UTC vs. Revision 1.133 by root, Tue May 4 22:26:49 2010 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.121 by root, Mon Nov 9 18:47:56 2009 UTC vs.
Revision 1.133 by root, Tue May 4 22:26:49 2010 UTC