--- deliantra/server/random_maps/treasure.C	2007/01/17 12:36:31	1.19
+++ deliantra/server/random_maps/treasure.C	2007/01/18 19:42:10	1.21
@@ -1,5 +1,4 @@
 /*
-<<<<<<< treasure.C
  * CrossFire, A Multiplayer game
  *
  * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
@@ -22,30 +21,6 @@
  *
  * The authors can be reached via e-mail at <crossfire@schmorp.de>
  */
-=======
- * CrossFire, A Multiplayer game for X-windows
- * 
- * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
- * Copyright (C) 2001 Mark Wedel & Crossfire Development Team
- * Copyright (C) 1992 Frank Tore Johansen
- * 
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2 of the License, or
- * (at your option) any later version.
- * 
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU General Public License for more details.
- * 
- * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
- *
- * The authors can be reached via e-mail at <crossfire@schmorp.de>
- */
->>>>>>> 1.18
 
 /*  placing treasure in maps, where appropriate.  */
 
@@ -107,7 +82,7 @@
   /* filter out the mutually exclusive options */
   if ((treasureoptions & RICH) && (treasureoptions & SPARSE))
     {
-      if (RANDOM () % 2)
+      if (rndm (2))
         treasureoptions -= 1;
       else
         treasureoptions -= 2;
@@ -490,7 +465,7 @@
     }
 
   /* now search all the 8 squares around recursively for a monster,in random order */
-  for (i = RANDOM () % 8, j = 0; j < 8 && theMonsterToFind == NULL; i++, j++)
+  for (i = rndm (8), j = 0; j < 8 && theMonsterToFind == NULL; i++, j++)
     {
       theMonsterToFind = find_monster_in_room_recursive (layout, map, x + freearr_x[i % 8 + 1], y + freearr_y[i % 8 + 1], RP);
       if (theMonsterToFind != NULL)
@@ -563,7 +538,7 @@
   number_of_free_spots_in_room++;
 
   /* now search all the 8 squares around recursively for free spots,in random order */
-  for (i = RANDOM () % 8, j = 0; j < 8 && theMonsterToFind == NULL; i++, j++)
+  for (i = rndm (8), j = 0; j < 8 && theMonsterToFind == NULL; i++, j++)
     find_spot_in_room_recursive (layout, x + freearr_x[i % 8 + 1], y + freearr_y[i % 8 + 1], RP);
 
 }
@@ -802,7 +777,7 @@
     {
       layout[x][y] = 1;
       /* now search all the 8 squares around recursively for free spots,in random order */
-      for (i = RANDOM () % 8, j = 0; j < 8 && theMonsterToFind == NULL; i++, j++)
+      for (i = rndm (8), j = 0; j < 8 && theMonsterToFind == NULL; i++, j++)
         find_doors_in_room_recursive (layout, map, x + freearr_x[i % 8 + 1], y + freearr_y[i % 8 + 1], doorlist, ndoors, RP);
     }
 }