cad.simcad.maps
Class ClassicCellMapNoDiag

java.lang.Object
  |
  +--cad.simcad.maps.CellMap
        |
        +--cad.simcad.maps.ClassicCellMap
              |
              +--cad.simcad.maps.ClassicCellMapNoDiag

All Implemented Interfaces:

AbstractMap, PathFindable, java.io.Serializable

public class ClassicCellMapNoDiag

extends ClassicCellMap

Version:

1.0

Author:

Charles-Philip Bentley

See Also:

Serialized Form

Field Summary

Fields inherited from class cad.simcad.maps.CellMap

_abstractMapEventListeners, _art, _cell, _cex, _cgex, _fillerServer, _h, _heurFactor, _mapResolution, _name, _objects, _pathPlaceEventListeners, _regions, _statServer, _w

Constructor Summary

ClassicCellMapNoDiag(java.lang.Integer w, java.lang.Integer h, int res, FillerServer fs, StatServer ss)
Creates new ClassicCellMap

ClassicCellMapNoDiag(int w, int h, int res, FillerServer fs, StatServer ss)
Creates new ClassicCellMap

Method Summary

boolean	areAdjacent(MapUnit mu1, MapUnit mu2)
double	computeHeuristic(PathPlace origin, PathPlace dest) calculates the heuristic for the Cell C The heuristic depends on the Map.
double	computeHeuristic(PathPlace origin, PathPlace dest, double factor) calculates the heuristic for the Cell C The heuristic depends on the Map.
Cell[]	getAdjacent(Cell c)
CellGroup[]	getAdjacent(CellGroup g) Returns every possible CellGroups adjacent to the CellGroup given in argument It depends of the resolution
MapUnit[]	getAdjacent(MapUnit c) Returns POST : An array of Cell.
java.lang.String	getName() Returns the name of the Map
java.lang.String	toString()

Methods inherited from class cad.simcad.maps.ClassicCellMap

getAdjacentUnits, getAdjacentUnits, getMapObjects, getMapObjectsFromRef, getMapUnit, getMapUnitsFromRef, isThereRoom

Methods inherited from class cad.simcad.maps.CellMap

addAbstractMapListener, addPathPlaceEventListener, clearAll, fastFindShortestPath, fillMap, findShortestPath, findShortestPath, firePathComputation, firePathPlaceChange, flushAllObjects, generateBlankMap, getAbstractMapListener, getAdjacent, getAllMapUnits, getCell, getCostToReach, getDefaultFiller, getFillerServer, getFillerTypes, getMapHeight, getMapResolution, getMapUnit, getMapWidth, getMoveStat, getObject, getObjects, getPathPlaceEventListeners, getResolution, getStatServer, getSteepRatio, getSteepRatio, getXFactor, getYFactor, getZFactor, populateMap, removeAbstractMapListener, removeAllListeners, removePathPlaceEventListener, resetAllCells, resetAllCellsValue, resetAllUnits, setHeuristicFactor, setName, setObject, setValue

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

ClassicCellMapNoDiag

public ClassicCellMapNoDiag(int w,
                            int h,
                            int res,
                            FillerServer fs,
                            StatServer ss)

Creates new ClassicCellMap

ClassicCellMapNoDiag

public ClassicCellMapNoDiag(java.lang.Integer w,
                            java.lang.Integer h,
                            int res,
                            FillerServer fs,
                            StatServer ss)

Creates new ClassicCellMap

Method Detail

areAdjacent

public boolean areAdjacent(MapUnit mu1,
                           MapUnit mu2)

Overrides:

areAdjacent in class ClassicCellMap

getAdjacent

public CellGroup[] getAdjacent(CellGroup g)

Returns every possible CellGroups adjacent to the CellGroup given in argument It depends of the resolution

Overrides:

getAdjacent in class ClassicCellMap

computeHeuristic

public double computeHeuristic(PathPlace origin,
                               PathPlace dest)

calculates the heuristic for the Cell C The heuristic depends on the Map. On a

Specified by:

computeHeuristic in interface AbstractMap

Overrides:

computeHeuristic in class ClassicCellMap

Parameters:

origin - The PathPlace origin from which we want to compute the heuristic

dest - The PathPlace origin from which we want to compute the heuristic

Returns:

a double value

computeHeuristic

public double computeHeuristic(PathPlace origin,
                               PathPlace dest,
                               double factor)

calculates the heuristic for the Cell C The heuristic depends on the Map. On a

Specified by:

computeHeuristic in interface AbstractMap

Overrides:

computeHeuristic in class ClassicCellMap

Parameters:

origin - The PathPlace origin from which we want to compute the heuristic

dest - The PathPlace origin from which we want to compute the heuristic

factor - the factor by which we want to multiply the heuristic. Typically, more the factor is high, more we want to give weight to the heuristic

Returns:

a double value

getAdjacent

public Cell[] getAdjacent(Cell c)

Overrides:

getAdjacent in class ClassicCellMap

getAdjacent

public MapUnit[] getAdjacent(MapUnit c)

Returns POST : An array of Cell. Can contains null

Overrides:

getAdjacent in class ClassicCellMap

toString

public java.lang.String toString()

Overrides:

toString in class ClassicCellMap

getName

public java.lang.String getName()

Description copied from interface: AbstractMap

Returns the name of the Map

Specified by:

getName in interface AbstractMap

Overrides:

getName in class ClassicCellMap