server/random_maps/layout.C

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) Crossfire Development Team (restored, original file without copyright notice)
 * 
 * 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.
 * 
 * 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 Affero GNU General Public License
 * and the GNU General Public License along with this program. If not, see
 * <http://www.gnu.org/licenses/>.
 * 
 * The authors can be reached via e-mail to <support@deliantra.net>
 */

#include <global.h>
#include <random_map.h>
#include <rproto.h>

Layout::Layout (int w, int h)
: w(w), h(h)
{
  int size = (sizeof (char *) + sizeof (char) * h) * w;

  col = (char **)salloc<char> (size);

  char *data = (char *)(col + w);

  for (int x = w; x--; )
    col [x] = data + x * h;
}

Layout::~Layout ()
{
  int size = (sizeof (char *) + sizeof (char) * h) * w;

  sfree ((char *)col, size);
}

void
Layout::fill (char fill)
{
  memset (col [0], fill, w * h);
}

void
Layout::rect (int x1, int y1, int x2, int y2, char fill)
{
  for (; x1 < x2; ++x1)
    memset (col [x1] + y1, fill, y2 - y1);
}

void Layout::border (char fill)
{
  for (int i = 0; i < w; i++) col [i][0] = col [i][h - 1] = fill;
  for (int j = 0; j < h; j++) col [0][j] = col [w - 1][j] = fill;
}

void
Layout::fill_rand (int percent)
{
  percent = lerp (percent, 0, 100, 0, 256);

  for (int x = w - 1; --x > 0; )
    for (int y = h - 1; --y > 0; )
      col [x][y] = rmg_rndm (256) > percent ? 0 : '#';
}

/////////////////////////////////////////////////////////////////////////////

// erode by cellular automata
void
Layout::erode_1_2 (int c1, int c2, int repeat)
{
  Layout neu (w, h);

  while (repeat--)
    {
      for (int x = 0; x < w; ++x)
        {
          coroapi::cede_to_tick ();

          for (int y = 0; y < h; ++y)
            {
              int n1 = 0, n2 = 0;

              // a 5x5 area, dx, dy, distance (1 == <= 1, 0 <= 2)
              static I8 dds[][3] = {
                               { -2, -1, 0 }, { -2,  0, 0 }, { -2,  1, 0 },
                { -1, -2, 0 }, { -1, -1, 1 }, { -1,  0, 1 }, { -1,  1, 1 }, { -1,  2, 0 },
                {  0, -2, 0 }, {  0, -1, 1 }, {  0,  0, 1 }, {  0,  1, 1 }, {  0,  2, 0 },
                {  1, -2, 0 }, {  1, -1, 1 }, {  1,  0, 1 }, {  1,  1, 1 }, {  1,  2, 0 },
                               {  2, -1, 0 }, {  2,  0, 0 }, {  2,  1, 0 },
              };

              for (int i = array_length (dds); i--; )
                {
                  int nx = x + dds [i][0];
                  int ny = y + dds [i][1];

                  if (!IN_RANGE_EXC (nx, 0, w) || !IN_RANGE_EXC (ny, 0, h) || !col [nx][ny])
                    {
                      n1 += dds [i][2];
                      n2++;
                    }
                }

              neu [x][y] = n1 >= c1 || n2 <= c2 ? '#' : 0;
            }
        }

      swap (neu);
    }
}

/////////////////////////////////////////////////////////////////////////////

void
Layout::print () const
{
  for (int y = 0; y < h; y++)
    {
      for (int x = 0; x < w; x++)
        {
          U8 c = (U8)col [x][y];

          if (!c)
            c = ' ';
          else if (c < 10)
            c += '0';
          else if (c < 32)
            c += 'a' - 10;

          putc ((char)c, stdout);
        }

      putc ('\n', stdout);
    }

  putc ('\n', stdout);
}

/////////////////////////////////////////////////////////////////////////////
// isolation remover - ensures single connected area

typedef fixed_stack<point> pointlist;

static noinline void
push_flood_fill (Layout &dist, pointlist &seeds, int x, int y)
{
  if (dist [x][y])
    return;

  while (y > 0 && !dist [x][y - 1])
    --y;

  int y0 = y;

  while (y < dist.h && !dist [x][y])
    {
      seeds.push (point (x, y));

      dist [x][y] = 1;
      ++y;
    }

  while (--y >= y0)
    {
      if (x >          0) push_flood_fill (dist, seeds, x - 1, y);
      if (x < dist.w - 1) push_flood_fill (dist, seeds, x + 1, y);
    }
}

static inline void
make_tunnel (Layout &dist, pointlist &seeds, int x, int y, U8 d)
{
  for (;;)
    {
      if (x >               1 && U8 (dist [x - 1][y]) < d && dist [x - 1][y] > 1)
        --x;
      else if (x < dist.w - 2 && U8 (dist [x + 1][y]) < d && dist [x + 1][y] > 1)
        ++x;
      else if (y >          1 && U8 (dist [x][y - 1]) < d && dist [x][y - 1] > 1)
        --y;
      else if (y < dist.h - 2 && U8 (dist [x][y + 1]) < d && dist [x][y + 1] > 1)
        ++y;
      else
        break;

      d = dist [x][y];
      dist [x][y] = 1;
      seeds.push (point (x, y));
    }
}

static void inline
maybe_push (Layout &dist, pointlist &seeds, int x, int y, U8 d)
{
  char &D = dist [x][y];

  if (U8 (D) > d) // if wall and higher distance, lower distance
    D = d;
  else if (D) // otherwise, if it's no room, this space is uninteresting
    return;

  seeds.push (point (x, y));
}

static void
isolation_remover (Layout &maze, bool dirty)
{
  Layout dist (maze.w, maze.h);

  // dist contains
  // 0 == invisited rooms
  // 1 == visited rooms
  // 2+ shortest distance to random near room

  // phase 1, initialise dist array, find seed
  int cnt = 0;
  int x, y;

  for (int i = 0; i < maze.w; ++i)
    for (int j = 0; j < maze.h; ++j)
      {
        if (maze [i][j] == '#')
          dist [i][j] = U8 (255);
        else
          {
            dist [i][j] = 0;
            if (!rmg_rndm (++cnt))
              x = i, y = j;
          }
      }

  if (!cnt)
    return;

  fixed_stack<point> seeds (maze.w * maze.h * 5);

  // found first free space - picking the first one gives
  // us a slight bias for tunnels, but usually you won't
  // notice that in-game
  seeds.push (point (x, y));

  // phase 2, while we have seeds, if
  // seed is empty, floodfill, else grow

  while (seeds.size)
    {
      coroapi::cede_to_tick ();

      point p = seeds.remove (rmg_rndm (seeds.size));

      x = p.x;
      y = p.y;

      if (!dist [x][y])
        {
          // found new isolated area, make tunnel
          if (!dirty)
            push_flood_fill (dist, seeds, x, y);

          make_tunnel (dist, seeds, x, y, 255);

          if (dirty)
            push_flood_fill (dist, seeds, x, y);
        }
      else
        {
          // nothing here, continue to expand
          U8 d = U8 (dist [x][y]) + 1;

          if (x < dist.w - 1) maybe_push (dist, seeds, x + 1, y, d);
          if (x >          0) maybe_push (dist, seeds, x - 1, y, d);
          if (y < dist.h - 1) maybe_push (dist, seeds, x, y + 1, d);
          if (y >          0) maybe_push (dist, seeds, x, y - 1, d);
        }
    }

  // now copy the tunnels over
  for (int x = 0; x < maze.w; ++x)
    for (int y = 0; y < maze.h; ++y)
      if (maze [x][y] == '#' && dist [x][y] == 1)
        maze [x][y] = 0;
}

void
Layout::isolation_remover (bool dirty)
{
  ::isolation_remover (*this, dirty);
}

/////////////////////////////////////////////////////////////////////////////

// inspired mostly by http://www.jimrandomh.org/misc/caves.txt
void
Layout::gen_cave (int subtype)
{
  switch (subtype)
    {
      // a rough cave
      case 0:
        fill_rand (rmg_rndm (80, 95));
        break;

      // corridors
      case 1:
        fill_rand (rmg_rndm (5, 40));
        erode_1_2 (5,  2, 10);
        erode_1_2 (5, -1, 10);
        erode_1_2 (5,  2, 1);
        break;

      // somewhat open, roundish
      case 2:
        fill_rand (45);
        erode_1_2 (5,  0, 5);
        erode_1_2 (5, 1, 1);
        break;

      // wide open, some room-like structures
      case 3:
        fill_rand (45);
        erode_1_2 (5,  2, 4);
        erode_1_2 (5, -1, 3);
        break;
    }

  border ();
  isolation_remover ();
}

/////////////////////////////////////////////////////////////////////////////

//+GPL

/*  puts doors at appropriate locations in a layout. */
void
Layout::doorify ()
{
  int ndoors = w * h / 60;      /* reasonable number of doors. */
  int doorlocs = 0;             /* # of available doorlocations */

  uint16 *doorlist_x = salloc<uint16> (w * h);
  uint16 *doorlist_y = salloc<uint16> (w * h);

  /* make a list of possible door locations */
  for (int i = 1; i < w - 1; i++)
    for (int j = 1; j < h - 1; j++)
      {
        int sindex = surround_flag (*this, i, j);

        if (sindex == 3 || sindex == 12)        /* these are possible door sindex */
          {
            doorlist_x [doorlocs] = i;
            doorlist_y [doorlocs] = j;
            doorlocs++;
          }
      }

  while (ndoors > 0 && doorlocs > 0)
    {
      int di = rmg_rndm (doorlocs);
      int i = doorlist_x [di];
      int j = doorlist_y [di];
      int sindex = surround_flag (*this, i, j);

      if (sindex == 3 || sindex == 12)  /* these are possible door sindex */
        {
          col [i][j] = 'D';
          ndoors--;
        }

      /* reduce the size of the list */
      doorlocs--;
      doorlist_x[di] = doorlist_x [doorlocs];
      doorlist_y[di] = doorlist_y [doorlocs];
    }

  sfree (doorlist_x, w * h);
  sfree (doorlist_y, w * h);
}

/* takes a map and makes it symmetric: adjusts Xsize and
 * Ysize to produce a symmetric map.
 */
void
Layout::symmetrize (int symmetry)
{
  if (symmetry == SYMMETRY_NONE)
    return;

  Layout sym_layout (
    symmetry == SYMMETRY_X || symmetry == SYMMETRY_XY ? w * 2 - 3 : w,
    symmetry == SYMMETRY_Y || symmetry == SYMMETRY_XY ? h * 2 - 3 : h
  );

  if (symmetry == SYMMETRY_X)
    for (int i = 0; i < sym_layout.w / 2 + 1; i++)
      for (int j = 0; j < sym_layout.h; j++)
        {
          sym_layout[i                   ][j] =
          sym_layout[sym_layout.w - i - 1][j] = col[i][j];
        }

  if (symmetry == SYMMETRY_Y)
    for (int i = 0; i < sym_layout.w; i++)
      for (int j = 0; j < sym_layout.h / 2 + 1; j++)
        {
          sym_layout[i][j                   ] =
          sym_layout[i][sym_layout.h - j - 1] = col[i][j];
        }

  if (symmetry == SYMMETRY_XY)
    for (int i = 0; i < sym_layout.w / 2 + 1; i++)
      for (int j = 0; j < sym_layout.h / 2 + 1; j++)
        {
          sym_layout[i                   ][j                   ] =
          sym_layout[i                   ][sym_layout.h - j - 1] =
          sym_layout[sym_layout.w - i - 1][j                   ] =
          sym_layout[sym_layout.w - i - 1][sym_layout.h - j - 1] = col[i][j];
        }

  /* need to run the isolation remover for some layouts */
#if 0
  switch (RP->map_layout_style)
    {
      case LAYOUT_ONION:
      case LAYOUT_SNAKE:
      case LAYOUT_SQUARE_SPIRAL:
        // safe
        break;

      default:
        sym_layout.isolation_remover ();
        break;
    }
#endif
  sym_layout.isolation_remover ();

  swap (sym_layout);
}

//-GPL

void
Layout::rotate (int rotation)
{
  switch (rotation & 3)
    {
      case 2:                  /* a reflection */
        {
          Layout new_layout (w, h);

          for (int i = 0; i < w; i++)                   /* copy a reflection back */
            for (int j = 0; j < h; j++)
              new_layout [i][j] = col [w - i - 1][h - j - 1];

          swap (new_layout);
        }
        break;

      case 1:
      case 3:
        {
          Layout new_layout (h, w);

          if (rotation == 1)    /* swap x and y */
            for (int i = 0; i < w; i++)
              for (int j = 0; j < h; j++)
                new_layout [j][i] = col [i][j];

          if (rotation == 3) /* swap x and y */
            for (int i = 0; i < w; i++)
              for (int j = 0; j < h; j++)
                new_layout [j][i] = col [w - i - 1][h - j - 1];

          swap (new_layout);
        }
        break;
    }
}

/////////////////////////////////////////////////////////////////////////////

//+GPL

/*
 * Expands a layout by 2x in each dimension.
 * H. S. Teoh
 */

/* Copy the old tile X into the new one at location (i*2, j*2) and
 * fill up the rest of the 2x2 result with \0:
 *      X  ---> X  \0
 *              \0 \0
 */
static void inline
expand_misc (Layout &newlayout, int i, int j, Layout &layout)
{
  newlayout[i * 2 + rmg_rndm (1)][j * 2 + rmg_rndm (1)] = layout[i][j];
  /* (Note: no need to reset rest of 2x2 area to \0 because calloc does that
   * for us.) */
}

/* Returns a bitmap that represents which squares on the right and bottom
 * edges of a square (i,j) match the given character:
 *      1       match on (i+1, j)
 *      2       match on (i, j+1)
 *      4       match on (i+1, j+1)
 * and the possible combinations thereof.
 */
static int noinline
calc_pattern (char ch, Layout &layout, int i, int j)
{
  int pattern = 0;

  if (i + 1 < layout.w && layout[i + 1][j] == ch)
    pattern |= 1;

  if (j + 1 < layout.h)
    {
      if (layout[i][j + 1] == ch)
        pattern |= 2;

      if (i + 1 < layout.w && layout[i + 1][j + 1] == ch)
        pattern |= 4;
    }

  return pattern;
}

/* Expand a wall. This function will try to sensibly connect the resulting
 * wall to adjacent wall squares, so that the result won't have disconnected
 * walls.
 */
static void inline
expand_wall (Layout &newlayout, int i, int j, Layout &layout)
{
  int wall_pattern = calc_pattern ('#', layout, i, j);
  int door_pattern = calc_pattern ('D', layout, i, j);
  int both_pattern = wall_pattern | door_pattern;

  newlayout[i * 2][j * 2] = '#';

  if (i + 1 < layout.w)
    {
      if (both_pattern & 1)
        {                       /* join walls/doors to the right */
/*      newlayout[i*2+1][j*2] = '#'; */
          newlayout[i * 2 + 1][j * 2] = layout[i + 1][j];
        }
    }

  if (j + 1 < layout.h)
    {
      if (both_pattern & 2)
        {                       /* join walls/doors to the bottom */
/*      newlayout[i*2][j*2+1] = '#'; */
          newlayout[i * 2][j * 2 + 1] = layout[i][j + 1];
        }

      if (wall_pattern == 7)
        {                       /* if orig layout is a 2x2 wall block,
                                 * we fill the result with walls. */
          newlayout[i * 2 + 1][j * 2 + 1] = '#';
        }
    }
}

/* This function will try to sensibly connect doors so that they meet up with
 * adjacent walls. Note that it will also presumptuously delete (ignore) doors
 * that it doesn't know how to correctly expand.
 */
static void inline
expand_door (Layout &newlayout, int i, int j, Layout &layout)
{
  int wall_pattern = calc_pattern ('#', layout, i, j);
  int door_pattern = calc_pattern ('D', layout, i, j);
  int join_pattern;

  /* Doors "like" to connect to walls more than other doors. If there is
   * a wall and another door, this door will connect to the wall and
   * disconnect from the other door. */
  if (wall_pattern & 3)
    join_pattern = wall_pattern;
  else
    join_pattern = door_pattern;

  newlayout[i * 2][j * 2] = 'D';

  if (i + 1 < layout.w)
    if (join_pattern & 1)
      /* there is a door/wall to the right */
      newlayout[i * 2 + 1][j * 2] = 'D';

  if (j + 1 < layout.h)
    if (join_pattern & 2)
      /* there is a door/wall below */
      newlayout[i * 2][j * 2 + 1] = 'D';
}

void
Layout::expand2x ()
{
  Layout new_layout (w * 2 - 1, h * 2 - 1);

  new_layout.clear ();

  for (int i = 0; i < w; i++)
    for (int j = 0; j < h; j++)
      switch (col [i][j])
        {
          case '#': expand_wall (new_layout, i, j, *this); break; 
          case 'D': expand_door (new_layout, i, j, *this); break; 
          default:  expand_misc (new_layout, i, j, *this); break;
        }

  swap (new_layout);
}

/////////////////////////////////////////////////////////////////////////////

/*  checks the layout to see if I can stick a horizontal(dir = 0) wall
    (or vertical, dir == 1)
    here which ends up on other walls sensibly.  */
static int
can_make_wall (const Layout &maze, int dx, int dy, int dir)
{
  int i1;
  int length = 0;

  /* dont make walls if we're on the edge. */
  if (dx == 0 || dx == (maze.w - 1) || dy == 0 || dy == (maze.h - 1))
    return -1;

  /* don't make walls if we're ON a wall. */
  if (maze [dx][dy] != 0)
    return -1;

  if (dir == 0)                 /* horizontal */
    {
      int y = dy;

      for (i1 = dx - 1; i1 > 0; i1--)
        {
          int sindex = surround_flag2 (maze, i1, y);

          if (sindex == 1) break;
          if (sindex != 0) return -1;          /* can't make horiz.  wall here */
          if (maze[i1][y] != 0) return -1;     /* can't make horiz.  wall here */

          length++;
        }

      for (i1 = dx + 1; i1 < maze.w - 1; i1++)
        {
          int sindex = surround_flag2 (maze, i1, y);

          if (sindex == 2) break;
          if (sindex != 0) return -1;          /* can't make horiz.  wall here */
          if (maze[i1][y] != 0) return -1;     /* can't make horiz.  wall here */

          length++;
        }
      return length;
    }
  else
    {                           /* vertical */
      int x = dx;

      for (i1 = dy - 1; i1 > 0; i1--)
        {
          int sindex = surround_flag2 (maze, x, i1);

          if (sindex == 4) break;
          if (sindex != 0) return -1;          /* can't make vert. wall here */
          if (maze[x][i1] != 0) return -1;     /* can't make horiz.  wall here */

          length++;
        }

      for (i1 = dy + 1; i1 < maze.h - 1; i1++)
        {
          int sindex = surround_flag2 (maze, x, i1);

          if (sindex == 8) break;
          if (sindex != 0) return -1;          /* can't make verti. wall here */
          if (maze[x][i1] != 0) return -1;     /* can't make horiz.  wall here */

          length++;
        }

      return length;
    }

  return -1;
}

int
make_wall (char **maze, int x, int y, int dir)
{
  maze[x][y] = 'D';             /* mark a door */

  switch (dir)
    {
      case 0:                  /* horizontal */
        {
          for (int i1 = x - 1; maze[i1][y] == 0; --i1) maze[i1][y] = '#';
          for (int i1 = x + 1; maze[i1][y] == 0; ++i1) maze[i1][y] = '#';
          break;
        }
      case 1:                  /* vertical */
        {
          for (int i1 = y - 1; maze[x][i1] == 0; --i1) maze[x][i1] = '#';
          for (int i1 = y + 1; maze[x][i1] == 0; ++i1) maze[x][i1] = '#';
          break;
        }
    }

  return 0;
}

void
Layout::roomify ()
{
  int tries = w * h / 30;

  for (int ti = 0; ti < tries; ti++)
    {
      /* starting location for looking at creating a door */
      int dx = rmg_rndm (w);
      int dy = rmg_rndm (h);

      /* results of checking on creating walls. */
      int cx = can_make_wall (*this, dx, dy, 0); /* horizontal */
      int cy = can_make_wall (*this, dx, dy, 1); /* vertical */

      if (cx == -1)
        {
          if (cy != -1)
            make_wall (*this, dx, dy, 1);

          continue;
        }

      if (cy == -1)
        {
          make_wall (*this, dx, dy, 0);
          continue;
        }

      if (cx < cy)
        make_wall (*this, dx, dy, 0);
      else
        make_wall (*this, dx, dy, 1);
    }
}

/////////////////////////////////////////////////////////////////////////////

/*  function selects the layout function and gives it whatever
    arguments it needs.  */
void
Layout::generate (random_map_params *RP)
{
  switch (RP->map_layout_style)
    {
      case LAYOUT_ONION:
        map_gen_onion (*this, RP->layoutoptions1, RP->layoutoptions2);

        if (!(rmg_rndm (3)) && !(RP->layoutoptions1 & (RMOPT_WALLS_ONLY | RMOPT_WALL_OFF)))
          roomify ();

        break;

      case LAYOUT_MAZE:
        maze_gen (*this, RP->get_iv ("maze_type", rmg_rndm (4)));

        if (rmg_rndm (2))
          doorify ();

        break;

      case LAYOUT_SPIRAL:
        map_gen_spiral (*this, RP->layoutoptions1);

        if (rmg_rndm (2))
          doorify ();

        break;

      case LAYOUT_ROGUELIKE:
        /* Don't put symmetry in rogue maps.  There isn't much reason to
         * do so in the first place (doesn't make it any more interesting),
         * but more importantly, the symmetry code presumes we are symmetrizing
         * spirals, or maps with lots of passages - making a symmetric rogue
         * map fails because its likely that the passages the symmetry process
         * creates may not connect the rooms.
         */
        RP->symmetry_used = SYMMETRY_NONE;
        roguelike_layout_gen (*this, RP->layoutoptions1);
        /* no doorifying...  done already */
        break;

      case LAYOUT_SNAKE:
        make_snake_layout (*this, RP->layoutoptions1);

        if (rmg_rndm (2))
          roomify ();

        break;

      case LAYOUT_SQUARE_SPIRAL:
        make_square_spiral_layout (*this, RP->layoutoptions1);

        if (rmg_rndm (2))
          roomify ();

        break;

      case LAYOUT_CAVE:
        gen_cave (RP->get_iv ("cave_type", rmg_rndm (4)));

        if (rmg_rndm (2))
          doorify ();

        break;

      default:
        abort ();
    }

  /*  rotate the layout randomly */
  rotate (rmg_rndm (4));

  symmetrize (RP->symmetry_used);

#if 0
  print ();//D
#endif

  if (RP->expand2x)
    expand2x ();
}

//-GPL

#if 0
static struct demo
{
  demo ()
  {
    Layout maze (40, 25);
    rmg_rndm.seed (time (0));

    for(int i=1;i<10;i)
      {
        maze.fill_rand (97);
        maze.border ();
        maze.isolation_remover ();
        maze.print ();
      }

    exit (1);
  }
} demo;
#endif
Revision:	1.5
Committed:	Fri Jul 2 03:40:14 2010 UTC (13 years, 10 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.4:	+519 -1 lines
Log Message:	refactoring (untested)
#	Content
1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*
4	* Copyright (©) 2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) Crossfire Development Team (restored, original file without copyright notice)
6	*
7	* Deliantra is free software: you can redistribute it and/or modify it under
8	* the terms of the Affero GNU General Public License as published by the
9	* Free Software Foundation, either version 3 of the License, or (at your
10	* option) any later version.
11	*
12	* This program is distributed in the hope that it will be useful,
13	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	* GNU General Public License for more details.
16	*
17	* You should have received a copy of the Affero GNU General Public License
18	* and the GNU General Public License along with this program. If not, see
19	* <http://www.gnu.org/licenses/>.
20	*
21	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/
23
24	#include <global.h>
25	#include <random_map.h>
26	#include <rproto.h>
27
28	Layout::Layout (int w, int h)
29	: w(w), h(h)
30	{
31	int size = (sizeof (char ) + sizeof (char) h) * w;
32
33	col = (char **)salloc<char> (size);
34
35	char data = (char )(col + w);
36
37	for (int x = w; x--; )
38	col [x] = data + x * h;
39	}
40
41	Layout::~Layout ()
42	{
43	int size = (sizeof (char ) + sizeof (char) h) * w;
44
45	sfree ((char *)col, size);
46	}
47
48	void
49	Layout::fill (char fill)
50	{
51	memset (col [0], fill, w * h);
52	}
53
54	void
55	Layout::rect (int x1, int y1, int x2, int y2, char fill)
56	{
57	for (; x1 < x2; ++x1)
58	memset (col [x1] + y1, fill, y2 - y1);
59	}
60
61	void Layout::border (char fill)
62	{
63	for (int i = 0; i < w; i++) col [i][0] = col [i][h - 1] = fill;
64	for (int j = 0; j < h; j++) col [0][j] = col [w - 1][j] = fill;
65	}
66
67	void
68	Layout::fill_rand (int percent)
69	{
70	percent = lerp (percent, 0, 100, 0, 256);
71
72	for (int x = w - 1; --x > 0; )
73	for (int y = h - 1; --y > 0; )
74	col [x][y] = rmg_rndm (256) > percent ? 0 : '#';
75	}
76
77	/////////////////////////////////////////////////////////////////////////////
78
79	// erode by cellular automata
80	void
81	Layout::erode_1_2 (int c1, int c2, int repeat)
82	{
83	Layout neu (w, h);
84
85	while (repeat--)
86	{
87	for (int x = 0; x < w; ++x)
88	{
89	coroapi::cede_to_tick ();
90
91	for (int y = 0; y < h; ++y)
92	{
93	int n1 = 0, n2 = 0;
94
95	// a 5x5 area, dx, dy, distance (1 == <= 1, 0 <= 2)
96	static I8 dds[][3] = {
97	{ -2, -1, 0 }, { -2, 0, 0 }, { -2, 1, 0 },
98	{ -1, -2, 0 }, { -1, -1, 1 }, { -1, 0, 1 }, { -1, 1, 1 }, { -1, 2, 0 },
99	{ 0, -2, 0 }, { 0, -1, 1 }, { 0, 0, 1 }, { 0, 1, 1 }, { 0, 2, 0 },
100	{ 1, -2, 0 }, { 1, -1, 1 }, { 1, 0, 1 }, { 1, 1, 1 }, { 1, 2, 0 },
101	{ 2, -1, 0 }, { 2, 0, 0 }, { 2, 1, 0 },
102	};
103
104	for (int i = array_length (dds); i--; )
105	{
106	int nx = x + dds [i][0];
107	int ny = y + dds [i][1];
108
109	if (!IN_RANGE_EXC (nx, 0, w) \|\| !IN_RANGE_EXC (ny, 0, h) \|\| !col [nx][ny])
110	{
111	n1 += dds [i][2];
112	n2++;
113	}
114	}
115
116	neu [x][y] = n1 >= c1 \|\| n2 <= c2 ? '#' : 0;
117	}
118	}
119
120	swap (neu);
121	}
122	}
123
124	/////////////////////////////////////////////////////////////////////////////
125
126	void
127	Layout::print () const
128	{
129	for (int y = 0; y < h; y++)
130	{
131	for (int x = 0; x < w; x++)
132	{
133	U8 c = (U8)col [x][y];
134
135	if (!c)
136	c = ' ';
137	else if (c < 10)
138	c += '0';
139	else if (c < 32)
140	c += 'a' - 10;
141
142	putc ((char)c, stdout);
143	}
144
145	putc ('\n', stdout);
146	}
147
148	putc ('\n', stdout);
149	}
150
151	/////////////////////////////////////////////////////////////////////////////
152	// isolation remover - ensures single connected area
153
154	typedef fixed_stack<point> pointlist;
155
156	static noinline void
157	push_flood_fill (Layout &dist, pointlist &seeds, int x, int y)
158	{
159	if (dist [x][y])
160	return;
161
162	while (y > 0 && !dist [x][y - 1])
163	--y;
164
165	int y0 = y;
166
167	while (y < dist.h && !dist [x][y])
168	{
169	seeds.push (point (x, y));
170
171	dist [x][y] = 1;
172	++y;
173	}
174
175	while (--y >= y0)
176	{
177	if (x > 0) push_flood_fill (dist, seeds, x - 1, y);
178	if (x < dist.w - 1) push_flood_fill (dist, seeds, x + 1, y);
179	}
180	}
181
182	static inline void
183	make_tunnel (Layout &dist, pointlist &seeds, int x, int y, U8 d)
184	{
185	for (;;)
186	{
187	if (x > 1 && U8 (dist [x - 1][y]) < d && dist [x - 1][y] > 1)
188	--x;
189	else if (x < dist.w - 2 && U8 (dist [x + 1][y]) < d && dist [x + 1][y] > 1)
190	++x;
191	else if (y > 1 && U8 (dist [x][y - 1]) < d && dist [x][y - 1] > 1)
192	--y;
193	else if (y < dist.h - 2 && U8 (dist [x][y + 1]) < d && dist [x][y + 1] > 1)
194	++y;
195	else
196	break;
197
198	d = dist [x][y];
199	dist [x][y] = 1;
200	seeds.push (point (x, y));
201	}
202	}
203
204	static void inline
205	maybe_push (Layout &dist, pointlist &seeds, int x, int y, U8 d)
206	{
207	char &D = dist [x][y];
208
209	if (U8 (D) > d) // if wall and higher distance, lower distance
210	D = d;
211	else if (D) // otherwise, if it's no room, this space is uninteresting
212	return;
213
214	seeds.push (point (x, y));
215	}
216
217	static void
218	isolation_remover (Layout &maze, bool dirty)
219	{
220	Layout dist (maze.w, maze.h);
221
222	// dist contains
223	// 0 == invisited rooms
224	// 1 == visited rooms
225	// 2+ shortest distance to random near room
226
227	// phase 1, initialise dist array, find seed
228	int cnt = 0;
229	int x, y;
230
231	for (int i = 0; i < maze.w; ++i)
232	for (int j = 0; j < maze.h; ++j)
233	{
234	if (maze [i][j] == '#')
235	dist [i][j] = U8 (255);
236	else
237	{
238	dist [i][j] = 0;
239	if (!rmg_rndm (++cnt))
240	x = i, y = j;
241	}
242	}
243
244	if (!cnt)
245	return;
246
247	fixed_stack<point> seeds (maze.w * maze.h * 5);
248
249	// found first free space - picking the first one gives
250	// us a slight bias for tunnels, but usually you won't
251	// notice that in-game
252	seeds.push (point (x, y));
253
254	// phase 2, while we have seeds, if
255	// seed is empty, floodfill, else grow
256
257	while (seeds.size)
258	{
259	coroapi::cede_to_tick ();
260
261	point p = seeds.remove (rmg_rndm (seeds.size));
262
263	x = p.x;
264	y = p.y;
265
266	if (!dist [x][y])
267	{
268	// found new isolated area, make tunnel
269	if (!dirty)
270	push_flood_fill (dist, seeds, x, y);
271
272	make_tunnel (dist, seeds, x, y, 255);
273
274	if (dirty)
275	push_flood_fill (dist, seeds, x, y);
276	}
277	else
278	{
279	// nothing here, continue to expand
280	U8 d = U8 (dist [x][y]) + 1;
281
282	if (x < dist.w - 1) maybe_push (dist, seeds, x + 1, y, d);
283	if (x > 0) maybe_push (dist, seeds, x - 1, y, d);
284	if (y < dist.h - 1) maybe_push (dist, seeds, x, y + 1, d);
285	if (y > 0) maybe_push (dist, seeds, x, y - 1, d);
286	}
287	}
288
289	// now copy the tunnels over
290	for (int x = 0; x < maze.w; ++x)
291	for (int y = 0; y < maze.h; ++y)
292	if (maze [x][y] == '#' && dist [x][y] == 1)
293	maze [x][y] = 0;
294	}
295
296	void
297	Layout::isolation_remover (bool dirty)
298	{
299	::isolation_remover (*this, dirty);
300	}
301
302	/////////////////////////////////////////////////////////////////////////////
303
304	// inspired mostly by http://www.jimrandomh.org/misc/caves.txt
305	void
306	Layout::gen_cave (int subtype)
307	{
308	switch (subtype)
309	{
310	// a rough cave
311	case 0:
312	fill_rand (rmg_rndm (80, 95));
313	break;
314
315	// corridors
316	case 1:
317	fill_rand (rmg_rndm (5, 40));
318	erode_1_2 (5, 2, 10);
319	erode_1_2 (5, -1, 10);
320	erode_1_2 (5, 2, 1);
321	break;
322
323	// somewhat open, roundish
324	case 2:
325	fill_rand (45);
326	erode_1_2 (5, 0, 5);
327	erode_1_2 (5, 1, 1);
328	break;
329
330	// wide open, some room-like structures
331	case 3:
332	fill_rand (45);
333	erode_1_2 (5, 2, 4);
334	erode_1_2 (5, -1, 3);
335	break;
336	}
337
338	border ();
339	isolation_remover ();
340	}
341
342	/////////////////////////////////////////////////////////////////////////////
343
344	//+GPL
345
346	/* puts doors at appropriate locations in a layout. */
347	void
348	Layout::doorify ()
349	{
350	int ndoors = w * h / 60; /* reasonable number of doors. */
351	int doorlocs = 0; /* # of available doorlocations */
352
353	uint16 doorlist_x = salloc<uint16> (w h);
354	uint16 doorlist_y = salloc<uint16> (w h);
355
356	/* make a list of possible door locations */
357	for (int i = 1; i < w - 1; i++)
358	for (int j = 1; j < h - 1; j++)
359	{
360	int sindex = surround_flag (*this, i, j);
361
362	if (sindex == 3 \|\| sindex == 12) /* these are possible door sindex */
363	{
364	doorlist_x [doorlocs] = i;
365	doorlist_y [doorlocs] = j;
366	doorlocs++;
367	}
368	}
369
370	while (ndoors > 0 && doorlocs > 0)
371	{
372	int di = rmg_rndm (doorlocs);
373	int i = doorlist_x [di];
374	int j = doorlist_y [di];
375	int sindex = surround_flag (*this, i, j);
376
377	if (sindex == 3 \|\| sindex == 12) /* these are possible door sindex */
378	{
379	col [i][j] = 'D';
380	ndoors--;
381	}
382
383	/* reduce the size of the list */
384	doorlocs--;
385	doorlist_x[di] = doorlist_x [doorlocs];
386	doorlist_y[di] = doorlist_y [doorlocs];
387	}
388
389	sfree (doorlist_x, w * h);
390	sfree (doorlist_y, w * h);
391	}
392
393	/* takes a map and makes it symmetric: adjusts Xsize and
394	* Ysize to produce a symmetric map.
395	*/
396	void
397	Layout::symmetrize (int symmetry)
398	{
399	if (symmetry == SYMMETRY_NONE)
400	return;
401
402	Layout sym_layout (
403	symmetry == SYMMETRY_X \|\| symmetry == SYMMETRY_XY ? w * 2 - 3 : w,
404	symmetry == SYMMETRY_Y \|\| symmetry == SYMMETRY_XY ? h * 2 - 3 : h
405	);
406
407	if (symmetry == SYMMETRY_X)
408	for (int i = 0; i < sym_layout.w / 2 + 1; i++)
409	for (int j = 0; j < sym_layout.h; j++)
410	{
411	sym_layout[i ][j] =
412	sym_layout[sym_layout.w - i - 1][j] = col[i][j];
413	}
414
415	if (symmetry == SYMMETRY_Y)
416	for (int i = 0; i < sym_layout.w; i++)
417	for (int j = 0; j < sym_layout.h / 2 + 1; j++)
418	{
419	sym_layout[i][j ] =
420	sym_layout[i][sym_layout.h - j - 1] = col[i][j];
421	}
422
423	if (symmetry == SYMMETRY_XY)
424	for (int i = 0; i < sym_layout.w / 2 + 1; i++)
425	for (int j = 0; j < sym_layout.h / 2 + 1; j++)
426	{
427	sym_layout[i ][j ] =
428	sym_layout[i ][sym_layout.h - j - 1] =
429	sym_layout[sym_layout.w - i - 1][j ] =
430	sym_layout[sym_layout.w - i - 1][sym_layout.h - j - 1] = col[i][j];
431	}
432
433	/* need to run the isolation remover for some layouts */
434	#if 0
435	switch (RP->map_layout_style)
436	{
437	case LAYOUT_ONION:
438	case LAYOUT_SNAKE:
439	case LAYOUT_SQUARE_SPIRAL:
440	// safe
441	break;
442
443	default:
444	sym_layout.isolation_remover ();
445	break;
446	}
447	#endif
448	sym_layout.isolation_remover ();
449
450	swap (sym_layout);
451	}
452
453	//-GPL
454
455	void
456	Layout::rotate (int rotation)
457	{
458	switch (rotation & 3)
459	{
460	case 2: /* a reflection */
461	{
462	Layout new_layout (w, h);
463
464	for (int i = 0; i < w; i++) /* copy a reflection back */
465	for (int j = 0; j < h; j++)
466	new_layout [i][j] = col [w - i - 1][h - j - 1];
467
468	swap (new_layout);
469	}
470	break;
471
472	case 1:
473	case 3:
474	{
475	Layout new_layout (h, w);
476
477	if (rotation == 1) /* swap x and y */
478	for (int i = 0; i < w; i++)
479	for (int j = 0; j < h; j++)
480	new_layout [j][i] = col [i][j];
481
482	if (rotation == 3) /* swap x and y */
483	for (int i = 0; i < w; i++)
484	for (int j = 0; j < h; j++)
485	new_layout [j][i] = col [w - i - 1][h - j - 1];
486
487	swap (new_layout);
488	}
489	break;
490	}
491	}
492
493	/////////////////////////////////////////////////////////////////////////////
494
495	//+GPL
496
497	/*
498	* Expands a layout by 2x in each dimension.
499	* H. S. Teoh
500	*/
501
502	/* Copy the old tile X into the new one at location (i2, j2) and
503	* fill up the rest of the 2x2 result with \0:
504	* X ---> X \0
505	* \0 \0
506	*/
507	static void inline
508	expand_misc (Layout &newlayout, int i, int j, Layout &layout)
509	{
510	newlayout[i * 2 + rmg_rndm (1)][j * 2 + rmg_rndm (1)] = layout[i][j];
511	/* (Note: no need to reset rest of 2x2 area to \0 because calloc does that
512	* for us.) */
513	}
514
515	/* Returns a bitmap that represents which squares on the right and bottom
516	* edges of a square (i,j) match the given character:
517	* 1 match on (i+1, j)
518	* 2 match on (i, j+1)
519	* 4 match on (i+1, j+1)
520	* and the possible combinations thereof.
521	*/
522	static int noinline
523	calc_pattern (char ch, Layout &layout, int i, int j)
524	{
525	int pattern = 0;
526
527	if (i + 1 < layout.w && layout[i + 1][j] == ch)
528	pattern \|= 1;
529
530	if (j + 1 < layout.h)
531	{
532	if (layout[i][j + 1] == ch)
533	pattern \|= 2;
534
535	if (i + 1 < layout.w && layout[i + 1][j + 1] == ch)
536	pattern \|= 4;
537	}
538
539	return pattern;
540	}
541
542	/* Expand a wall. This function will try to sensibly connect the resulting
543	* wall to adjacent wall squares, so that the result won't have disconnected
544	* walls.
545	*/
546	static void inline
547	expand_wall (Layout &newlayout, int i, int j, Layout &layout)
548	{
549	int wall_pattern = calc_pattern ('#', layout, i, j);
550	int door_pattern = calc_pattern ('D', layout, i, j);
551	int both_pattern = wall_pattern \| door_pattern;
552
553	newlayout[i * 2][j * 2] = '#';
554
555	if (i + 1 < layout.w)
556	{
557	if (both_pattern & 1)
558	{ /* join walls/doors to the right */
559	/* newlayout[i2+1][j2] = '#'; */
560	newlayout[i * 2 + 1][j * 2] = layout[i + 1][j];
561	}
562	}
563
564	if (j + 1 < layout.h)
565	{
566	if (both_pattern & 2)
567	{ /* join walls/doors to the bottom */
568	/* newlayout[i2][j2+1] = '#'; */
569	newlayout[i * 2][j * 2 + 1] = layout[i][j + 1];
570	}
571
572	if (wall_pattern == 7)
573	{ /* if orig layout is a 2x2 wall block,
574	* we fill the result with walls. */
575	newlayout[i * 2 + 1][j * 2 + 1] = '#';
576	}
577	}
578	}
579
580	/* This function will try to sensibly connect doors so that they meet up with
581	* adjacent walls. Note that it will also presumptuously delete (ignore) doors
582	* that it doesn't know how to correctly expand.
583	*/
584	static void inline
585	expand_door (Layout &newlayout, int i, int j, Layout &layout)
586	{
587	int wall_pattern = calc_pattern ('#', layout, i, j);
588	int door_pattern = calc_pattern ('D', layout, i, j);
589	int join_pattern;
590
591	/* Doors "like" to connect to walls more than other doors. If there is
592	* a wall and another door, this door will connect to the wall and
593	* disconnect from the other door. */
594	if (wall_pattern & 3)
595	join_pattern = wall_pattern;
596	else
597	join_pattern = door_pattern;
598
599	newlayout[i * 2][j * 2] = 'D';
600
601	if (i + 1 < layout.w)
602	if (join_pattern & 1)
603	/* there is a door/wall to the right */
604	newlayout[i * 2 + 1][j * 2] = 'D';
605
606	if (j + 1 < layout.h)
607	if (join_pattern & 2)
608	/* there is a door/wall below */
609	newlayout[i * 2][j * 2 + 1] = 'D';
610	}
611
612	void
613	Layout::expand2x ()
614	{
615	Layout new_layout (w * 2 - 1, h * 2 - 1);
616
617	new_layout.clear ();
618
619	for (int i = 0; i < w; i++)
620	for (int j = 0; j < h; j++)
621	switch (col [i][j])
622	{
623	case '#': expand_wall (new_layout, i, j, *this); break;
624	case 'D': expand_door (new_layout, i, j, *this); break;
625	default: expand_misc (new_layout, i, j, *this); break;
626	}
627
628	swap (new_layout);
629	}
630
631	/////////////////////////////////////////////////////////////////////////////
632
633	/* checks the layout to see if I can stick a horizontal(dir = 0) wall
634	(or vertical, dir == 1)
635	here which ends up on other walls sensibly. */
636	static int
637	can_make_wall (const Layout &maze, int dx, int dy, int dir)
638	{
639	int i1;
640	int length = 0;
641
642	/* dont make walls if we're on the edge. */
643	if (dx == 0 \|\| dx == (maze.w - 1) \|\| dy == 0 \|\| dy == (maze.h - 1))
644	return -1;
645
646	/* don't make walls if we're ON a wall. */
647	if (maze [dx][dy] != 0)
648	return -1;
649
650	if (dir == 0) /* horizontal */
651	{
652	int y = dy;
653
654	for (i1 = dx - 1; i1 > 0; i1--)
655	{
656	int sindex = surround_flag2 (maze, i1, y);
657
658	if (sindex == 1) break;
659	if (sindex != 0) return -1; /* can't make horiz. wall here */
660	if (maze[i1][y] != 0) return -1; /* can't make horiz. wall here */
661
662	length++;
663	}
664
665	for (i1 = dx + 1; i1 < maze.w - 1; i1++)
666	{
667	int sindex = surround_flag2 (maze, i1, y);
668
669	if (sindex == 2) break;
670	if (sindex != 0) return -1; /* can't make horiz. wall here */
671	if (maze[i1][y] != 0) return -1; /* can't make horiz. wall here */
672
673	length++;
674	}
675	return length;
676	}
677	else
678	{ /* vertical */
679	int x = dx;
680
681	for (i1 = dy - 1; i1 > 0; i1--)
682	{
683	int sindex = surround_flag2 (maze, x, i1);
684
685	if (sindex == 4) break;
686	if (sindex != 0) return -1; /* can't make vert. wall here */
687	if (maze[x][i1] != 0) return -1; /* can't make horiz. wall here */
688
689	length++;
690	}
691
692	for (i1 = dy + 1; i1 < maze.h - 1; i1++)
693	{
694	int sindex = surround_flag2 (maze, x, i1);
695
696	if (sindex == 8) break;
697	if (sindex != 0) return -1; /* can't make verti. wall here */
698	if (maze[x][i1] != 0) return -1; /* can't make horiz. wall here */
699
700	length++;
701	}
702
703	return length;
704	}
705
706	return -1;
707	}
708
709	int
710	make_wall (char **maze, int x, int y, int dir)
711	{
712	maze[x][y] = 'D'; /* mark a door */
713
714	switch (dir)
715	{
716	case 0: /* horizontal */
717	{
718	for (int i1 = x - 1; maze[i1][y] == 0; --i1) maze[i1][y] = '#';
719	for (int i1 = x + 1; maze[i1][y] == 0; ++i1) maze[i1][y] = '#';
720	break;
721	}
722	case 1: /* vertical */
723	{
724	for (int i1 = y - 1; maze[x][i1] == 0; --i1) maze[x][i1] = '#';
725	for (int i1 = y + 1; maze[x][i1] == 0; ++i1) maze[x][i1] = '#';
726	break;
727	}
728	}
729
730	return 0;
731	}
732
733	void
734	Layout::roomify ()
735	{
736	int tries = w * h / 30;
737
738	for (int ti = 0; ti < tries; ti++)
739	{
740	/* starting location for looking at creating a door */
741	int dx = rmg_rndm (w);
742	int dy = rmg_rndm (h);
743
744	/* results of checking on creating walls. */
745	int cx = can_make_wall (this, dx, dy, 0); / horizontal */
746	int cy = can_make_wall (this, dx, dy, 1); / vertical */
747
748	if (cx == -1)
749	{
750	if (cy != -1)
751	make_wall (*this, dx, dy, 1);
752
753	continue;
754	}
755
756	if (cy == -1)
757	{
758	make_wall (*this, dx, dy, 0);
759	continue;
760	}
761
762	if (cx < cy)
763	make_wall (*this, dx, dy, 0);
764	else
765	make_wall (*this, dx, dy, 1);
766	}
767	}
768
769	/////////////////////////////////////////////////////////////////////////////
770
771	/* function selects the layout function and gives it whatever
772	arguments it needs. */
773	void
774	Layout::generate (random_map_params *RP)
775	{
776	switch (RP->map_layout_style)
777	{
778	case LAYOUT_ONION:
779	map_gen_onion (*this, RP->layoutoptions1, RP->layoutoptions2);
780
781	if (!(rmg_rndm (3)) && !(RP->layoutoptions1 & (RMOPT_WALLS_ONLY \| RMOPT_WALL_OFF)))
782	roomify ();
783
784	break;
785
786	case LAYOUT_MAZE:
787	maze_gen (*this, RP->get_iv ("maze_type", rmg_rndm (4)));
788
789	if (rmg_rndm (2))
790	doorify ();
791
792	break;
793
794	case LAYOUT_SPIRAL:
795	map_gen_spiral (*this, RP->layoutoptions1);
796
797	if (rmg_rndm (2))
798	doorify ();
799
800	break;
801
802	case LAYOUT_ROGUELIKE:
803	/* Don't put symmetry in rogue maps. There isn't much reason to
804	* do so in the first place (doesn't make it any more interesting),
805	* but more importantly, the symmetry code presumes we are symmetrizing
806	* spirals, or maps with lots of passages - making a symmetric rogue
807	* map fails because its likely that the passages the symmetry process
808	* creates may not connect the rooms.
809	*/
810	RP->symmetry_used = SYMMETRY_NONE;
811	roguelike_layout_gen (*this, RP->layoutoptions1);
812	/* no doorifying... done already */
813	break;
814
815	case LAYOUT_SNAKE:
816	make_snake_layout (*this, RP->layoutoptions1);
817
818	if (rmg_rndm (2))
819	roomify ();
820
821	break;
822
823	case LAYOUT_SQUARE_SPIRAL:
824	make_square_spiral_layout (*this, RP->layoutoptions1);
825
826	if (rmg_rndm (2))
827	roomify ();
828
829	break;
830
831	case LAYOUT_CAVE:
832	gen_cave (RP->get_iv ("cave_type", rmg_rndm (4)));
833
834	if (rmg_rndm (2))
835	doorify ();
836
837	break;
838
839	default:
840	abort ();
841	}
842
843	/* rotate the layout randomly */
844	rotate (rmg_rndm (4));
845
846	symmetrize (RP->symmetry_used);
847
848	#if 0
849	print ();//D
850	#endif
851
852	if (RP->expand2x)
853	expand2x ();
854	}
855
856	//-GPL
857
858	#if 0
859	static struct demo
860	{
861	demo ()
862	{
863	Layout maze (40, 25);
864	rmg_rndm.seed (time (0));
865
866	for(int i=1;i<10;i)
867	{
868	maze.fill_rand (97);
869	maze.border ();
870	maze.isolation_remover ();
871	maze.print ();
872	}
873
874	exit (1);
875	}
876	} demo;
877	#endif