public void Init(TilePropagator propagator)
{
ISet <Tile> actualTiles;
ISet <Tile> actualEndPointTiles;
if (TileRotation != null)
{
actualTiles = new HashSet <Tile>(TileRotation.RotateAll(Tiles));
actualEndPointTiles = EndPointTiles == null ? null : new HashSet <Tile>(TileRotation.RotateAll(EndPointTiles));
}
else
{
actualTiles = Tiles;
actualEndPointTiles = EndPointTiles;
}
tileSet = propagator.CreateTileSet(actualTiles);
selectedTracker = propagator.CreateSelectedTracker(tileSet);
endPointTileSet = EndPointTiles != null?propagator.CreateTileSet(actualEndPointTiles) : null;
endPointSelectedTracker = EndPointTiles != null?propagator.CreateSelectedTracker(endPointTileSet) : null;
graph = PathConstraintUtils.CreateGraph(propagator.Topology);
Check(propagator, true);
}
public void Init(TilePropagator propagator)
{
tileSet = propagator.CreateTileSet(Tiles);
selectedTracker = propagator.CreateSelectedTracker(tileSet);
endPointTileSet = EndPointTiles != null?propagator.CreateTileSet(EndPointTiles) : null;
endPointSelectedTracker = EndPointTiles != null?propagator.CreateSelectedTracker(endPointTileSet) : null;
graph = PathConstraintUtils.CreateGraph(propagator.Topology);
}
public void Init(TilePropagator propagator)
{
ISet <Tile> actualEndPointTiles;
if (TileRotation != null)
{
actualExits = new Dictionary <Tile, ISet <Direction> >();
foreach (var kv in Exits)
{
foreach (var rot in TileRotation.RotationGroup)
{
if (TileRotation.Rotate(kv.Key, rot, out var rtile))
{
Direction Rotate(Direction d)
{
return(TopoArrayUtils.RotateDirection(propagator.Topology.AsGridTopology().Directions, d, rot));
}
var rexits = new HashSet <Direction>(kv.Value.Select(Rotate));
actualExits[rtile] = rexits;
}
}
}
actualEndPointTiles = EndPointTiles == null ? null : new HashSet <Tile>(TileRotation.RotateAll(EndPointTiles));
}
else
{
actualExits = Exits;
actualEndPointTiles = EndPointTiles;
}
pathTileSet = propagator.CreateTileSet(Exits.Keys);
pathSelectedTracker = propagator.CreateSelectedTracker(pathTileSet);
endPointTileSet = EndPointTiles != null?propagator.CreateTileSet(actualEndPointTiles) : null;
endPointSelectedTracker = EndPointTiles != null?propagator.CreateSelectedTracker(endPointTileSet) : null;
graph = CreateEdgedGraph(propagator.Topology);
tilesByExit = actualExits
.SelectMany(kv => kv.Value.Select(e => Tuple.Create(kv.Key, e)))
.GroupBy(x => x.Item2, x => x.Item1)
.ToDictionary(g => g.Key, propagator.CreateTileSet);
trackerByExit = tilesByExit
.ToDictionary(kv => kv.Key, kv => propagator.CreateSelectedTracker(kv.Value));
Check(propagator, true);
}
public void Init(TilePropagator propagator)
{
var oddPathTiles = PathSpec.Exits.Where(x => x.Value.Count() % 2 == 1).Select(x => x.Key).ToList();
oddPathTilesSet = propagator.CreateTileSet(oddPathTiles);
oddPathTracker = oddPathTiles.Count > 0 ? propagator.CreateSelectedTracker(oddPathTilesSet) : null;
pathView = (EdgedPathView)PathSpec.MakeView(propagator);
this.propagator = propagator;
this.topology = propagator.Topology;
}
public void Init(TilePropagator propagator)
{
var topology = propagator.Topology as GridTopology;
if (topology == null ||
topology.Directions.Type != Topo.DirectionSetType.Cartesian2d &&
topology.Directions.Type != Topo.DirectionSetType.Cartesian3d)
{
// This wouldn't be that hard to fix
throw new Exception("MaxConsecutiveConstraint only supports cartesian topologies.");
}
tileSet = propagator.CreateTileSet(Tiles);
selectedTracker = propagator.CreateSelectedTracker(tileSet);
}
public PathView(PathSpec spec, TilePropagator propagator)
{
if (spec.TileRotation != null)
{
tiles = new HashSet <Tile>(spec.TileRotation.RotateAll(spec.Tiles));
endPointTiles = spec.RelevantTiles == null ? null : new HashSet <Tile>(spec.TileRotation.RotateAll(spec.RelevantTiles));
}
else
{
tiles = spec.Tiles;
endPointTiles = spec.RelevantTiles;
}
tileSet = propagator.CreateTileSet(tiles);
selectedTracker = propagator.CreateSelectedTracker(tileSet);
Graph = PathConstraintUtils.CreateGraph(propagator.Topology);
this.propagator = propagator;
CouldBePath = new bool[propagator.Topology.IndexCount];
MustBePath = new bool[propagator.Topology.IndexCount];
hasEndPoints = spec.RelevantCells != null || spec.RelevantTiles != null;
if (hasEndPoints)
{
CouldBeRelevant = new bool[propagator.Topology.IndexCount];
MustBeRelevant = new bool[propagator.Topology.IndexCount];
endPointIndices = spec.RelevantCells == null ? null :
spec.RelevantCells.Select(p => propagator.Topology.GetIndex(p.X, p.Y, p.Z)).ToList();
endPointTileSet = spec.RelevantTiles != null?propagator.CreateTileSet(endPointTiles) : null;
endPointSelectedTracker = spec.RelevantTiles != null?propagator.CreateSelectedTracker(endPointTileSet) : null;
}
else
{
CouldBeRelevant = CouldBePath;
MustBeRelevant = MustBePath;
endPointTileSet = tileSet;
}
}
public EdgedPathView(EdgedPathSpec spec, TilePropagator propagator)
{
if (spec.TileRotation != null)
{
exits = new Dictionary <Tile, ISet <Direction> >();
foreach (var kv in spec.Exits)
{
foreach (var rot in spec.TileRotation.RotationGroup)
{
if (spec.TileRotation.Rotate(kv.Key, rot, out var rtile))
{
Direction Rotate(Direction d)
{
return(TopoArrayUtils.RotateDirection(propagator.Topology.AsGridTopology().Directions, d, rot));
}
var rexits = new HashSet <Direction>(kv.Value.Select(Rotate));
exits[rtile] = rexits;
}
}
}
endPointTiles = spec.RelevantTiles == null ? null : new HashSet <Tile>(spec.TileRotation.RotateAll(spec.RelevantTiles));
}
else
{
exits = spec.Exits;
endPointTiles = spec.RelevantTiles;
}
pathTileSet = propagator.CreateTileSet(exits.Keys);
pathSelectedTracker = propagator.CreateSelectedTracker(pathTileSet);
Graph = CreateEdgedGraph(propagator.Topology);
this.propagator = propagator;
this.topology = propagator.Topology;
var nodesPerIndex = GetNodesPerIndex();
CouldBePath = new bool[propagator.Topology.IndexCount * nodesPerIndex];
MustBePath = new bool[propagator.Topology.IndexCount * nodesPerIndex];
tileSetByExit = exits
.SelectMany(kv => kv.Value.Select(e => Tuple.Create(kv.Key, e)))
.GroupBy(x => x.Item2, x => x.Item1)
.ToDictionary(g => g.Key, propagator.CreateTileSet);
trackerByExit = tileSetByExit
.ToDictionary(kv => kv.Key, kv => propagator.CreateSelectedTracker(kv.Value));
hasEndPoints = spec.RelevantCells != null || spec.RelevantTiles != null;
if (hasEndPoints)
{
CouldBeRelevant = new bool[propagator.Topology.IndexCount * nodesPerIndex];
MustBeRelevant = new bool[propagator.Topology.IndexCount * nodesPerIndex];
endPointIndices = spec.RelevantCells == null ? null :
spec.RelevantCells.Select(p => propagator.Topology.GetIndex(p.X, p.Y, p.Z)).ToList();
endPointTileSet = endPointTiles != null?propagator.CreateTileSet(endPointTiles) : null;
endPointSelectedTracker = endPointTiles != null?propagator.CreateSelectedTracker(endPointTileSet) : null;
}
else
{
CouldBeRelevant = CouldBePath;
MustBeRelevant = MustBePath;
endPointTileSet = pathTileSet;
}
}
