package com.planet_ink.coffee_mud.Libraries.layouts;
import java.util.List;
import java.util.Vector;
import com.planet_ink.coffee_mud.core.CMLib;
import com.planet_ink.coffee_mud.core.Directions;
import com.planet_ink.coffee_mud.Libraries.interfaces.AreaGenerationLibrary.LayoutFlags;
import com.planet_ink.coffee_mud.Libraries.interfaces.AreaGenerationLibrary.LayoutNode;
import com.planet_ink.coffee_mud.Libraries.interfaces.AreaGenerationLibrary.LayoutTypes;
/*
Copyright 2008-2019 Bo Zimmerman
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
public class MazeLayout extends AbstractLayout
{
@Override
public String name()
{
return "MAZE";
}
public void fillMaze(final LayoutSet lSet, final LayoutNode p, final int width, final int height)
{
final Vector<Integer> dirs = new Vector<Integer>();
for(int i=0;i<4;i++)
dirs.add(Integer.valueOf(i));
final Vector<Integer> rdirs = new Vector<Integer>();
while(dirs.size()>0)
{
final int x = r.nextInt(dirs.size());
final Integer dir = dirs.elementAt(x);
dirs.removeElementAt(x);
rdirs.addElement(dir);
}
for(int r=0;r<rdirs.size();r++)
{
final Integer dir = rdirs.elementAt(r);
final LayoutNode p2 = lSet.makeNextNode(p, dir.intValue());
if((!lSet.isUsed(p2.coord()))
&&(p2.coord()[0]>=0)
&&(p2.coord()[1]<=0)
&&(p2.coord()[0]<width)
&&(p2.coord()[1]>-height))
{
lSet.use(p2,LayoutTypes.street);
p.crossLink(p2);
fillMaze(lSet,p2,width,height);
}
}
}
@Override
public List<LayoutNode> generate(final int num, final int dir)
{
final Vector<LayoutNode> set = new Vector<LayoutNode>();
final int diameter = (int)Math.round(Math.sqrt(num));
final int plusX = (diff(diameter,diameter,num) > diff(diameter+1,diameter,num)) ? 1 : 0;
final LayoutSet lSet = new LayoutSet(set,num);
LayoutNode n = null;
switch(dir)
{
case Directions.NORTH:
n = new DefaultLayoutNode(new long[] { (diameter + plusX) / 2, 0 });
break;
case Directions.SOUTH:
n = new DefaultLayoutNode(new long[] { (diameter + plusX) / 2, -diameter + 1 });
break;
case Directions.EAST:
n = new DefaultLayoutNode(new long[] { 0, (-diameter + 1) / 2 });
break;
case Directions.WEST:
n = new DefaultLayoutNode(new long[] { diameter + plusX - 1, (-diameter + 1) / 2 });
break;
case Directions.NORTHEAST:
n = new DefaultLayoutNode(new long[] { 0, (-diameter + 1) / 2 });
break;
case Directions.NORTHWEST:
n = new DefaultLayoutNode(new long[] { diameter + plusX - 1, (-diameter + 1) / 2 });
break;
case Directions.SOUTHEAST:
n = new DefaultLayoutNode(new long[] { 0, (-diameter + 1) / 2 });
break;
case Directions.SOUTHWEST:
n = new DefaultLayoutNode(new long[] { diameter + plusX - 1, (-diameter + 1) / 2 });
break;
default:
return generate(num,CMLib.dice().pick(Directions.CODES())); // pick one of the above, and only those.
}
if(n!=null)
{
//n.flagGateExit(dir);
lSet.use(n,LayoutTypes.street);
n.flag(LayoutFlags.gate);
fillMaze(lSet,n,diameter+plusX,diameter);
lSet.fillInFlags();
}
return set;
}
}
