[ViewVC] Diff of: cvs/deliantra/server/random

Comparing deliantra/server/random_maps/treasure.C (file contents):
Revision 1.65 by root, Sun Jan 29 02:47:05 2017 UTC vs.
Revision 1.67 by root, Sat Nov 17 23:40:02 2018 UTC

 /*
  * This file is part of Deliantra, the Roguelike Realtime MMORPG.
  *
+ * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
  * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
  * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
  * Copyright (©) 1992 Frank Tore Johansen
  *
  * Deliantra is free software: you can redistribute it and/or modify it under
             }
           // can freeindex ever be < 0?
           if (freeindex >= 0)
             {
-              kx += freearr_x [freeindex];
+              kx += DIRX (freeindex);
-              ky += freearr_y [freeindex];
+              ky += DIRY (freeindex);
             }
         }
     }
   else
     {                           /* NO_PASS_DOORS --we have to work harder. */
     {
       the_chest->destroy ();
       return NULL;
     }
-  int xl = x + freearr_x[i];
+  int xl = x + DIRX (i);
-  int yl = y + freearr_y[i];
+  int yl = y + DIRY (i);
   /* if the placement is blocked, return a fail. */
   if (wall_blocked (map, xl, yl))
     return 0;
   for (i = 0; i < SIZEOFFREE; i++)
     {
       int lx, ly;
-      lx = x + freearr_x[i];
+      lx = x + DIRX (i);
-      ly = y + freearr_y[i];
+      ly = y + DIRY (i);
       /* boundscheck */
       if (lx >= 0 && ly >= 0 && lx < map->width && ly < map->height)
         /* don't bother searching this square unless the map says life exists. */
         if (GET_MAP_FLAGS (map, lx, ly) & P_IS_ALIVE)
           {
     }
   /* now search all the 8 squares around recursively for a monster,in random order */
   for (i = rmg_rndm (8), j = 0; j < 8 && !theMonsterToFind; i++, j++)
     {
-      theMonsterToFind = find_monster_in_room_recursive (maze, map, x + freearr_x[i % 8 + 1], y + freearr_y[i % 8 + 1]);
+      theMonsterToFind = find_monster_in_room_recursive (maze, map, x + DIRX (i % 8 + 1), y + DIRY (i % 8 + 1));
       if (theMonsterToFind)
         return theMonsterToFind;
     }
   return theMonsterToFind;
   maze[x][y] = 1;
   spots.push (point (x, y));
   /* now search all the 8 squares around recursively for free spots,in random order */
   for (int i = rmg_rndm (8), j = 0; j < 8 && !theMonsterToFind; i++, j++)
-    find_spot_in_room_recursive (maze, spots, x + freearr_x[i % 8 + 1], y + freearr_y[i % 8 + 1]);
+    find_spot_in_room_recursive (maze, spots, x + DIRX (i % 8 + 1), y + DIRY (i % 8 + 1));
 }
 /* find a random non-blocked spot in this room to drop a key. */
 static void
   for (i = 0; i <= SIZEOFFREE1; i++)
     {
       int lx, ly, sindex;
-      lx = x + freearr_x[i];
+      lx = x + DIRX (i);
-      ly = y + freearr_y[i];
+      ly = y + DIRY (i);
       sindex = surround_flag3 (map, lx, ly);
       /* if it's blocked on 3 sides, it's enclosed */
       if (sindex == 7 || sindex == 11 || sindex == 13 || sindex == 14)
         {
           *cx = lx;
      spots--try to find someplace which is 2x enclosed.  */
   for (i = 0; i <= SIZEOFFREE1; i++)
     {
       int lx, ly, sindex;
-      lx = x + freearr_x[i];
+      lx = x + DIRX (i);
-      ly = y + freearr_y[i];
+      ly = y + DIRY (i);
       sindex = surround_flag3 (map, lx, ly);
       /* if it's blocked on 3 sides, it's enclosed */
       if (sindex == 3 || sindex == 5 || sindex == 9 || sindex == 6 || sindex == 10 || sindex == 12)
         {
           *cx = lx;
   /* settle for one surround point */
   for (i = 0; i <= SIZEOFFREE1; i++)
     {
       int lx, ly, sindex;
-      lx = x + freearr_x[i];
+      lx = x + DIRX (i);
-      ly = y + freearr_y[i];
+      ly = y + DIRY (i);
       sindex = surround_flag3 (map, lx, ly);
       /* if it's blocked on 3 sides, it's enclosed */
       if (sindex)
         {
           *cx = lx;
   /* give up and return the closest free spot. */
   i = rmg_find_free_spot (archetype::find (shstr_chest), map, x, y, 1, SIZEOFFREE1 + 1);
   if (i != -1)
     {
-      *cx = x + freearr_x[i];
+      *cx = x + DIRX (i);
-      *cy = y + freearr_y[i];
+      *cy = y + DIRY (i);
     }
   else
     {
       /* indicate failure */
       *cx = -1;
     }
   /* place doors in all the 8 adjacent unblocked squares. */
   for (i = 1; i < 9; i++)
     {
-      int x1 = x + freearr_x[i], y1 = y + freearr_y[i];
+      int x1 = x + DIRX (i), y1 = y + DIRY (i);
       if (!wall_blocked (map, x1, y1) && maze[x1][y1] == '>')
         {                       /* place a door */
           remove_monsters (x1, y1, map);
-          object *new_door = archetype::get (freearr_x[i] == 0 ? doors[1] : doors[0]);
+          object *new_door = archetype::get (DIRX (i) == 0 ? doors[1] : doors[0]);
           map->insert (new_door, x1, y1);
           doorlist[ndoors_made] = new_door;
           ndoors_made++;
         }
     }
       maze[x][y] = 1;
       /* now search all the 8 squares around recursively for free spots,in random order */
       for (i = rmg_rndm (8), j = 0; j < 8 && !theMonsterToFind; i++, j++)
         find_doors_in_room_recursive (maze, map,
-                                      x + freearr_x[i % 8 + 1], y + freearr_y[i % 8 + 1],
+                                      x + DIRX (i % 8 + 1), y + DIRY (i % 8 + 1),
                                       doorlist, ndoors);
     }
 }
 /* find a random non-blocked spot in this room to drop a key. */

Diff Legend

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

Comparing deliantra/server/random_maps/treasure.C (file contents): Revision 1.65 by root, Sun Jan 29 02:47:05 2017 UTC vs. Revision 1.67 by root, Sat Nov 17 23:40:02 2018 UTC

Diff Legend

Comparing deliantra/server/random_maps/treasure.C (file contents):
Revision 1.65 by root, Sun Jan 29 02:47:05 2017 UTC vs.
Revision 1.67 by root, Sat Nov 17 23:40:02 2018 UTC