package com.planet_ink.coffee_mud.Libraries.layouts;
import java.util.Enumeration;
import java.util.Hashtable;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Random;
import java.util.Vector;
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.LayoutRuns;
import com.planet_ink.coffee_mud.Libraries.interfaces.AreaGenerationLibrary.LayoutTypes;
import com.planet_ink.coffee_mud.core.CMLib;
import com.planet_ink.coffee_mud.core.Directions;
/*
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 LayoutSet
{
Random r = new Random();
private long total = 0;
private final Map<Long, LayoutNode> used = new Hashtable<Long, LayoutNode>();
private List<LayoutNode> set = null;
public LayoutSet(final List<LayoutNode> V, final long total)
{
this.total = total;
this.set = V;
}
public List<LayoutNode> set()
{
return set;
}
public Long getHashCode(final long x, final long y)
{
return (Long.valueOf((x * total) + y));
}
public boolean isUsed(final long[] xy)
{
return isUsed(xy[0], xy[1]);
}
public boolean isUsed(final long x, final long y)
{
return used.containsKey(getHashCode(x, y));
}
public boolean isUsed(final LayoutNode n)
{
return isUsed(n.coord()) && set.contains(n);
}
public void unUse(final LayoutNode n)
{
used.remove(getHashCode(n.coord()[0],n.coord()[1]));
set.remove(n);
}
public boolean use(final LayoutNode n, final LayoutTypes nodeType)
{
if(isUsed(n.coord()))
return false;
used.put(getHashCode(n.coord()[0],n.coord()[1]),n);
set.add(n);
if(nodeType != null)
n.reType(nodeType);
return true;
}
public LayoutNode getNode(final long[] xy)
{
return getNode(xy[0], xy[1]);
}
public LayoutNode getNode(final long x, final long y)
{
return used.get(getHashCode(x, y));
}
public boolean spaceAvailable()
{
return set.size() < total;
}
public long[] makeNextCoord(final long[] n, final int dir)
{
switch(dir)
{
case Directions.NORTH:
return new long[]{n[0],n[1]-1};
case Directions.SOUTH:
return new long[]{n[0],n[1]+1};
case Directions.EAST:
return new long[]{n[0]+1,n[1]};
case Directions.WEST:
return new long[]{n[0]-1,n[1]};
default:
return makeNextCoord(n,CMLib.dice().pick(Directions.CODES())); // picks one of the above, and only one of the above
}
}
public LayoutNode makeNextNode(final LayoutNode n, final int dir)
{
final long[] l = makeNextCoord(n.coord(),dir);
if(l!=null)
return new DefaultLayoutNode(l);
return null;
}
public LayoutNode getNextNode(final LayoutNode n, final int dir)
{
final LayoutNode next = makeNextNode(n,dir);
return getNode(next.coord());
}
public void drawABox(final int width, final int height)
{
LayoutNode n = new DefaultLayoutNode(new long[]{0,0});
n.flag(LayoutFlags.corner);
for(int y=0;y<height-1;y++)
{
use(n,LayoutTypes.surround);
LayoutNode nn = getNextNode(n, Directions.NORTH);
if(nn==null)
nn=makeNextNode(n, Directions.NORTH);
n.crossLink(nn);
nn.flagRun(LayoutRuns.ns);
n=nn;
}
n.flag(LayoutFlags.corner);
use(n,LayoutTypes.surround);
n = new DefaultLayoutNode(new long[]{width-1,0});
n.flag(LayoutFlags.corner);
for(int y=0;y<height-1;y++)
{
use(n,LayoutTypes.surround);
LayoutNode nn = getNextNode(n, Directions.NORTH);
if(nn==null)
nn=makeNextNode(n, Directions.NORTH);
n.crossLink(nn);
nn.flagRun(LayoutRuns.ns);
n=nn;
}
n.flag(LayoutFlags.corner);
use(n,LayoutTypes.surround);
n = getNode(new long[]{0,0});
n.flag(LayoutFlags.corner);
for(int x=0;x<width-1;x++)
{
use(n,LayoutTypes.surround);
LayoutNode nn = getNextNode(n, Directions.EAST);
if(nn==null)
nn=makeNextNode(n, Directions.EAST);
n.crossLink(nn);
nn.flagRun(LayoutRuns.ew);
n=nn;
}
n.flag(LayoutFlags.corner);
use(n,LayoutTypes.surround);
n = getNode(new long[]{0,-height+1});
n.flag(LayoutFlags.corner);
for(int x=0;x<width-1;x++)
{
use(n,LayoutTypes.surround);
LayoutNode nn = getNextNode(n, Directions.EAST);
if(nn==null)
nn=makeNextNode(n, Directions.EAST);
n.crossLink(nn);
nn.flagRun(LayoutRuns.ew);
n=nn;
}
n.flag(LayoutFlags.corner);
use(n,LayoutTypes.surround);
}
public boolean fillMaze(final LayoutNode p)
{
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);
LayoutNode p2 = getNextNode(p, dir.intValue());
if(p2 == null)
{
p2 = makeNextNode(p, dir.intValue());
p.crossLink(p2);
use(p2,LayoutTypes.interior);
fillMaze(p2);
}
}
return true;
}
public void clipLongStreets()
{
final Vector<LayoutNode> set2= new Vector<LayoutNode>(set());
for (final LayoutNode p : set2)
{
if(isUsed(p) && p.isStreetLike())
{
for(int d=0;d<4;d++)
{
if(p.getLink(d)==null)
{
final LayoutNode p2 =getNextNode(p, d);
if((p2!=null)
&&(!p.links().containsValue(p2)))
{
final Iterator<LayoutNode> nodes=p.links().values().iterator();
final LayoutNode p_1=nodes.next();
final LayoutNode p_2=nodes.next();
p.deLink();
p_1.crossLink(p_2);
unUse(p);
final LayoutNode p3 = makeNextNode(p2, Directions.getOpDirectionCode(d));
p2.crossLink(p3);
use(p3, LayoutTypes.leaf);
break;
}
}
}
}
}
}
public void fillInFlags()
{
for (final LayoutNode n : set())
{
final int[] dirs=new int[n.links().size()];
int x=0;
for(final Integer dirLink : n.links().keySet())
dirs[x++]=dirLink.intValue();
n.setExits(dirs);
if((dirs.length==1)&&(!n.isFlagged(LayoutFlags.gate)))
n.reType(LayoutTypes.leaf);
}
for (final LayoutNode n : set())
{
if(n.links().size()==2)
{
LayoutFlags flag = null;
if(n.type()==LayoutTypes.interior)
{
for(final Integer dirLink : n.links().keySet())
{
final LayoutNode n2=n.links().get(dirLink);
if((n2!=null)&&(n2.type()==LayoutTypes.leaf))
flag=LayoutFlags.offleaf;
}
}
if(flag!=null)
n.flag(flag);
else
{
final Iterator<Integer> dirs=n.links().keySet().iterator();
final Integer lN1=dirs.next();
final Integer lN2=dirs.next();
if(lN1.intValue() != Directions.getOpDirectionCode(lN2.intValue()))
n.flag(LayoutFlags.corner);
}
}
else
if((n.links().size()==3)
&&(((n.type()==LayoutTypes.street)
||(n.type()!=LayoutTypes.surround))))
{
boolean allStreet = true;
for(final Integer dirLink : n.links().keySet())
{
final LayoutNode n2=n.links().get(dirLink);
if((n2==null)
||((n2.type()!=LayoutTypes.street)
&&(n2.type()!=LayoutTypes.surround)))
allStreet = false;
}
if(allStreet)
n.flag(LayoutFlags.tee);
}
else
if((n.links().size()==4)
&&(((n.type()==LayoutTypes.street)
||(n.type()!=LayoutTypes.surround))))
{
boolean allStreet = true;
for(final Integer dirLink : n.links().keySet())
{
final LayoutNode n2=n.links().get(dirLink);
if((n2==null)
||((n2.type()!=LayoutTypes.street)
&&(n2.type()!=LayoutTypes.surround)))
allStreet = false;
}
if(allStreet)
n.flag(LayoutFlags.intersection);
}
}
}
}
