Sunday, December 30, 2012
EscapeTheMines
MIRROR(Hosted on Deviant Art in case my website is down)
I think the simplest game I can make using the mechanics I have now is:
A game where you have to get through the level without getting blown up.
Friday, December 28, 2012
Lazy Initialization
package
{
import flash.display.Sprite;
import flash.events.Event;
/**
* ...
* @author JMIM
*/
public class Main extends Sprite
{
public var lazyObject:LazyInitClass;
public var myArrayContainer:Object = { object: null };
private var counter:int = 0;
public function Main():void
{
if (stage) init();
else addEventListener(Event.ADDED_TO_STAGE, init);
}
private function init(e:Event = null):void
{
removeEventListener(Event.ADDED_TO_STAGE, init);
// entry point
lazyObject = new LazyInitClass( myArrayContainer );
this.addEventListener(Event.ENTER_FRAME, update);
}
public function update(e:Event):void
{
lazyObject.update();
counter++;
if (counter == 100)
{
myArrayContainer.object = ["1", "2", "3"];
}
}
}
}
internal class LazyInitClass
{
//if this works, make different kinds of lazy init containers for all the different data types.
public var _initialized:Boolean = false;
public var theArray:Array = null;
public var arrayContainer:Object;
public function LazyInitClass( inArrayContainer:Object )
{
arrayContainer = inArrayContainer;
}
public function update():void
{
if (!_initialized)
{
trace("checking for non-null references");
theArray = arrayContainer.object;
if (theArray != null) { _initialized = true;}
}
else
{
trace("initialized!");
}
}
}
Friday, December 21, 2012
Bookmarks For later
Game object editor that uses reflection
http://divillysausages.com/as3_game_object_editor
http://code.google.com/p/as3-game-object-editor/downloads/detail?name=GameObjEditor_v1.3.1.zip&can=2&q=
http://www.photonstorm.com/archives/1187/flash-game-dev-tip-5-configure-your-games-in-real-time
http://www.photonstorm.com/archives/2247/flash-game-dev-tip-12-building-a-retro-platform-game-in-flixel-part-1
Game Dev Tips
http://forums.flixel.org/index.php/topic,3189.0.html
TODO: Figure out art/logic behind auto tile mapping production.
Wednesday, December 19, 2012
How to use multiple TileSets in Flixel using AutoTile Feature
Example usage: var collisionMap:FlxTileMap = new FlxTileMap(); collisionMap.loadMap(new default_auto(), auto_tiles, TILE_WIDTH, TILE_HEIGHT, FlxTilemap.AUTO); collisionMap.fuseType = FlxTileMap.FUSETYPE_OVERLAP;
How to use multiple TileSets with Flixel's AutoTile Feature: Step1: Hack FlxTileMap.as Step2: Make a tile sheet with this format: // [##] represents a tile image in a tile sheet. // Row of 16 tiles is a different "sub-tile" set to be used with the autoTile algorithm feature // in flixel. // [00][01][02][03][04][05][06][07][08][09][10][11][12][13][14][15] //TILE SET # 0; 0 - 15 // [16][17][18][19][20][21][22][23][24][25][26][27][28][29][30][31] //TILE SET # 1; 16- 31 // [32][33][34][35][36][37][38][39][40][41][42][43][44][45][46][47] //TILE SET # 2; 32- 47 // [48][49][50][51][52][53][54][55][56][57][58][59][60][61][62][63] //TILE SET # 3; 48- 63
package org.flixel
{
import flash.display.Bitmap;
import flash.display.BitmapData;
import flash.display.Graphics;
import flash.geom.Matrix;
import flash.geom.Point;
import flash.geom.Rectangle;
import org.flixel.system.FlxTile;
import org.flixel.system.FlxTilemapBuffer;
/**
* This is a traditional tilemap display and collision class.
* It takes a string of comma-separated numbers and then associates
* those values with tiles from the sheet you pass in.
* It also includes some handy static parsers that can convert
* arrays or images into strings that can be loaded.
*
* @author Adam Atomic
*/
public class FlxTilemap extends FlxObject
{
[Embed(source="data/autotiles.png")] static public var ImgAuto:Class;
[Embed(source="data/autotiles_alt.png")] static public var ImgAutoAlt:Class;
/**
* No auto-tiling.
*/
static public const OFF:uint = 0;
/**
* Good for levels with thin walls that don'tile need interior corner art.
*/
static public const AUTO:uint = 1;
/** AUTO TILING MODE that does NOT fuse together sperate tile-sets */
static public const FUSETYPE_NONE :uint = 10;
/** AUTO TILING MODE that allows other tile-sets to fuse with each other.
* This would be good if you wanted to made code where you could point and click
* and get the effect of painting a wall.
*/
static public const FUSETYPE_ALL :uint = 11;
/** AUTO TILING MODE that makes higher-indexed tile-set sub-sets within
* your tiles PNG overlap the lower ordered tile-sets.
*/
static public const FUSETYPE_OVERLAP :uint = 12;
/**
* Better for levels with thick walls that look better with interior corner art.
*/
static public const ALT:uint = 2;
/**
* Set this flag to use one of the 16-tile binary auto-tile algorithms (OFF, AUTO, or ALT).
*/
public var auto:uint;
/**
* Set this flag to control how:
* [ Auto tilemapping with multiple tile types ]
* will behave.
*/
public var _fuseType:uint = FUSETYPE_ALL;
public function set fuseType(enum:uint):void
{
_fuseType = enum;
//re-drawing seems to be a problem after setting fuse type.
//set buffers to FALSE to force a re-draw maybe.
for each(var b:FlxTilemapBuffer in _buffers) { b.dirty = true; };
}
public function get fuseType():uint { return _fuseType; }
/**
* Read-only variable, do NOT recommend changing after the map is loaded!
*/
public var widthInTiles:uint;
/**
* Read-only variable, do NOT recommend changing after the map is loaded!
*/
public var heightInTiles:uint;
/**
* Read-only variable, do NOT recommend changing after the map is loaded!
*/
public var totalTiles:uint;
/**
* Rendering helper, minimize new object instantiation on repetitive methods.
*/
protected var _flashPoint:Point;
/**
* Rendering helper, minimize new object instantiation on repetitive methods.
*/
protected var _flashRect:Rectangle;
/**
* Internal reference to the bitmap data object that stores the original tile graphics.
*/
protected var _tiles:BitmapData;
/**
* Internal list of buffers, one for each camera, used for drawing the tilemaps.
*/
protected var _buffers:Array;
/**
* Internal representation of the actual tile data, as a large 1D array of integers.
*/
protected var _data:Array;
/**
* Internal representation of rectangles, one for each tile in the entire tilemap, used to speed up drawing.
*/
protected var _rects:Array;
/**
* Internal, the width of a single tile.
*/
protected var _tileWidth:uint;
/**
* Internal, the height of a single tile.
*/
protected var _tileHeight:uint;
/**
* Internal collection of tile objects, one for each type of tile in the map (NOTE one for every single tile in the whole map).
*/
protected var _tileObjects:Array;
/**
* Internal, used for rendering the debug bounding box display.
*/
protected var _debugTileNotSolid:BitmapData;
/**
* Internal, used for rendering the debug bounding box display.
*/
protected var _debugTilePartial:BitmapData;
/**
* Internal, used for rendering the debug bounding box display.
*/
protected var _debugTileSolid:BitmapData;
/**
* Internal, used for rendering the debug bounding box display.
*/
protected var _debugRect:Rectangle;
/**
* Internal flag for checking to see if we need to refresh
* the tilemap display to show or hide the bounding boxes.
*/
protected var _lastVisualDebug:Boolean;
/**
* Internal, used to sort of insert blank tiles in front of the tiles in the provided graphic.
*/
protected var _startingIndex:uint;
/**
* The tilemap constructor just initializes some basic variables.
*/
public function FlxTilemap()
{
super();
auto = OFF;
widthInTiles = 0;
heightInTiles = 0;
totalTiles = 0;
_buffers = new Array();
_flashPoint = new Point();
_flashRect = null;
_data = null;
_tileWidth = 0;
_tileHeight = 0;
_rects = null;
_tiles = null;
_tileObjects = null;
immovable = true;
cameras = null;
_debugTileNotSolid = null;
_debugTilePartial = null;
_debugTileSolid = null;
_debugRect = null;
_lastVisualDebug = FlxG.visualDebug;
_startingIndex = 0;
}
/**
* Clean up memory.
*/
override public function destroy():void
{
_flashPoint = null;
_flashRect = null;
_tiles = null;
var i:uint = 0;
var l:uint = _tileObjects.length;
while(i < l)
(_tileObjects[i++] as FlxTile).destroy();
_tileObjects = null;
i = 0;
l = _buffers.length;
while(i < l)
(_buffers[i++] as FlxTilemapBuffer).destroy();
_buffers = null;
_data = null;
_rects = null;
_debugTileNotSolid = null;
_debugTilePartial = null;
_debugTileSolid = null;
_debugRect = null;
super.destroy();
}
/**
* Load the tilemap with string data and a tile graphic.
*
* @param MapData A string of comma and line-return delineated indices indicating what order the tiles should go in.
* @param TileGraphic All the tiles you want to use, arranged in a strip corresponding to the numbers in MapData.
* @param TileWidth The width of your tiles (e.g. 8) - defaults to height of the tile graphic if unspecified.
* @param TileHeight The height of your tiles (e.g. 8) - defaults to width if unspecified.
* @param AutoTile Whether to load the map using an automatic tile placement algorithm. Setting this to either AUTO or ALT will override any values you put for StartingIndex, DrawIndex, or CollideIndex.
* @param StartingIndex Used to sort of insert empty tiles in front of the provided graphic. Default is 0, usually safest ot leave it at that. Ignored if AutoTile is set.
* @param DrawIndex Initializes all tile objects equal to and after this index as visible. Default value is 1. Ignored if AutoTile is set.
* @param CollideIndex Initializes all tile objects equal to and after this index as allowCollisions = ANY. Default value is 1. Ignored if AutoTile is set. Can override and customize per-tile-type collision behavior using setTileProperties().
*
* @return A pointer this instance of FlxTilemap, for chaining as usual :)
*/
public function loadMap(MapData:String, TileGraphic:Class, TileWidth:uint=0, TileHeight:uint=0, AutoTile:uint=OFF, StartingIndex:uint=0, DrawIndex:uint=1, CollideIndex:uint=1):FlxTilemap
{
auto = AutoTile;
_startingIndex = StartingIndex;
//Figure out the map dimensions based on the data string
var columns:Array;
var rows:Array = MapData.split("\n");
heightInTiles = rows.length;
_data = new Array();
var row:uint = 0;
var column:uint;
while(row < heightInTiles)
{
columns = rows[row++].split(",");
if(columns.length <= 1)
{
heightInTiles = heightInTiles - 1;
continue;
}
if(widthInTiles == 0)
widthInTiles = columns.length;
column = 0;
while(column < widthInTiles)
_data.push(uint(columns[column++]));
}
//Pre-process the map data if it's auto-tiled
var i:uint;
totalTiles = widthInTiles*heightInTiles;
if(auto > OFF)
{
_startingIndex = 1;
DrawIndex = 1;
CollideIndex = 1;
i = 0;
while(i < totalTiles)
autoTile(i++);
}
//Figure out the size of the tiles
_tiles = FlxG.addBitmap(TileGraphic);
_tileWidth = TileWidth;
if(_tileWidth == 0)
_tileWidth = _tiles.height;
_tileHeight = TileHeight;
if(_tileHeight == 0)
_tileHeight = _tileWidth;
//create some tile objects that we'll use for overlap checks (one for each tile)
i = 0;
var l:uint = (_tiles.width/_tileWidth) * (_tiles.height/_tileHeight);
if(auto > OFF)
l++;
_tileObjects = new Array(l);
var ac:uint;
while(i < l)
{
_tileObjects[i] = new FlxTile(this,i,_tileWidth,_tileHeight,(i >= DrawIndex),(i >= CollideIndex)?allowCollisions:NONE);
i++;
}
//create debug tiles for rendering bounding boxes on demand
_debugTileNotSolid = makeDebugTile(FlxG.BLUE);
_debugTilePartial = makeDebugTile(FlxG.PINK);
_debugTileSolid = makeDebugTile(FlxG.GREEN);
_debugRect = new Rectangle(0,0,_tileWidth,_tileHeight);
//Then go through and create the actual map
width = widthInTiles*_tileWidth;
height = heightInTiles*_tileHeight;
_rects = new Array(totalTiles);
i = 0;
while(i < totalTiles)
updateTile(i++);
return this;
}
/**
* Internal function to clean up the map loading code.
* Just generates a wireframe box the size of a tile with the specified color.
*/
protected function makeDebugTile(Color:uint):BitmapData
{
var debugTile:BitmapData
debugTile = new BitmapData(_tileWidth,_tileHeight,true,0);
var gfx:Graphics = FlxG.flashGfx;
gfx.clear();
gfx.moveTo(0,0);
gfx.lineStyle(1,Color,0.5);
gfx.lineTo(_tileWidth-1,0);
gfx.lineTo(_tileWidth-1,_tileHeight-1);
gfx.lineTo(0,_tileHeight-1);
gfx.lineTo(0,0);
debugTile.draw(FlxG.flashGfxSprite);
return debugTile;
}
/**
* Main logic loop for tilemap is pretty simple,
* just checks to see if visual debug got turned on.
* If it did, the tilemap is flagged as dirty so it
* will be redrawn with debug info on the next draw call.
*/
override public function update():void
{
if(_lastVisualDebug != FlxG.visualDebug)
{
_lastVisualDebug = FlxG.visualDebug;
setDirty();
}
}
/**
* Internal function that actually renders the tilemap to the tilemap buffer. Called by draw().
*
* @param Buffer The FlxTilemapBuffer you are rendering to.
* @param Camera The related FlxCamera, mainly for scroll values.
*/
protected function drawTilemap(Buffer:FlxTilemapBuffer,Camera:FlxCamera):void
{
Buffer.fill();
//Copy tile images into the tile buffer
_point.x = int(Camera.scroll.x*scrollFactor.x) - x; //modified from getScreenXY()
_point.y = int(Camera.scroll.y*scrollFactor.y) - y;
var screenXInTiles:int = (_point.x + ((_point.x > 0)?0.0000001:-0.0000001))/_tileWidth;
var screenYInTiles:int = (_point.y + ((_point.y > 0)?0.0000001:-0.0000001))/_tileHeight;
var screenRows:uint = Buffer.rows;
var screenColumns:uint = Buffer.columns;
//Bound the upper left corner
if(screenXInTiles < 0)
screenXInTiles = 0;
if(screenXInTiles > widthInTiles-screenColumns)
screenXInTiles = widthInTiles-screenColumns;
if(screenYInTiles < 0)
screenYInTiles = 0;
if(screenYInTiles > heightInTiles-screenRows)
screenYInTiles = heightInTiles-screenRows;
var rowIndex:int = screenYInTiles*widthInTiles+screenXInTiles;
_flashPoint.y = 0;
var row:uint = 0;
var column:uint;
var columnIndex:uint;
var tile:FlxTile;
var debugTile:BitmapData;
while(row < screenRows)
{
columnIndex = rowIndex;
column = 0;
_flashPoint.x = 0;
while(column < screenColumns)
{
_flashRect = _rects[columnIndex] as Rectangle;
if(_flashRect != null)
{
Buffer.pixels.copyPixels(_tiles,_flashRect,_flashPoint,null,null,true);
if(FlxG.visualDebug && !ignoreDrawDebug)
{
tile = _tileObjects[_data[columnIndex]];
if(tile != null)
{
if(tile.allowCollisions <= NONE)
debugTile = _debugTileNotSolid; //blue
else if(tile.allowCollisions != ANY)
debugTile = _debugTilePartial; //pink
else
debugTile = _debugTileSolid; //green
Buffer.pixels.copyPixels(debugTile,_debugRect,_flashPoint,null,null,true);
}
}
}
_flashPoint.x += _tileWidth;
column++;
columnIndex++;
}
rowIndex += widthInTiles;
_flashPoint.y += _tileHeight;
row++;
}
Buffer.x = screenXInTiles*_tileWidth;
Buffer.y = screenYInTiles*_tileHeight;
}
/**
* Draws the tilemap buffers to the cameras and handles flickering.
*/
override public function draw():void
{
if(_flickerTimer != 0)
{
_flicker = !_flicker;
if(_flicker)
return;
}
if(cameras == null)
cameras = FlxG.cameras;
var camera:FlxCamera;
var buffer:FlxTilemapBuffer;
var i:uint = 0;
var l:uint = cameras.length;
while(i < l)
{
camera = cameras[i];
if(_buffers[i] == null)
_buffers[i] = new FlxTilemapBuffer(_tileWidth,_tileHeight,widthInTiles,heightInTiles,camera);
buffer = _buffers[i++] as FlxTilemapBuffer;
if(!buffer.dirty)
{
_point.x = x - int(camera.scroll.x*scrollFactor.x) + buffer.x; //copied from getScreenXY()
_point.y = y - int(camera.scroll.y*scrollFactor.y) + buffer.y;
buffer.dirty = (_point.x > 0) || (_point.y > 0) || (_point.x + buffer.width < camera.width) || (_point.y + buffer.height < camera.height);
}
if(buffer.dirty)
{
drawTilemap(buffer,camera);
buffer.dirty = false;
}
_flashPoint.x = x - int(camera.scroll.x*scrollFactor.x) + buffer.x; //copied from getScreenXY()
_flashPoint.y = y - int(camera.scroll.y*scrollFactor.y) + buffer.y;
_flashPoint.x += (_flashPoint.x > 0)?0.0000001:-0.0000001;
_flashPoint.y += (_flashPoint.y > 0)?0.0000001:-0.0000001;
buffer.draw(camera,_flashPoint);
_VISIBLECOUNT++;
}
}
/**
* Fetches the tilemap data array.
*
* @param Simple If true, returns the data as copy, as a series of 1s and 0s (useful for auto-tiling stuff). Default value is false, meaning it will return the actual data array (NOT a copy).
*
* @return An array the size of the tilemap full of integers indicating tile placement.
*/
public function getData(Simple:Boolean=false):Array
{
if(!Simple)
return _data;
var i:uint = 0;
var l:uint = _data.length;
var data:Array = new Array(l);
while(i < l)
{
data[i] = ((_tileObjects[_data[i]] as FlxTile).allowCollisions > 0)?1:0;
i++;
}
return data;
}
/**
* Set the dirty flag on all the tilemap buffers.
* Basically forces a reset of the drawn tilemaps, even if it wasn'tile necessary.
*
* @param Dirty Whether to flag the tilemap buffers as dirty or not.
*/
public function setDirty(Dirty:Boolean=true):void
{
var i:uint = 0;
var l:uint = _buffers.length;
while(i < l)
(_buffers[i++] as FlxTilemapBuffer).dirty = Dirty;
}
/**
* Find a path through the tilemap. Any tile with any collision flags set is treated as impassable.
* If no path is discovered then a null reference is returned.
*
* @param Start The start point in world coordinates.
* @param End The end point in world coordinates.
* @param Simplify Whether to run a basic simplification algorithm over the path data, removing extra points that are on the same line. Default value is true.
* @param RaySimplify Whether to run an extra raycasting simplification algorithm over the remaining path data. This can result in some close corners being cut, and should be used with care if at all (yet). Default value is false.
*
* @return A FlxPath from the start to the end. If no path could be found, then a null reference is returned.
*/
public function findPath(Start:FlxPoint,End:FlxPoint,Simplify:Boolean=true,RaySimplify:Boolean=false):FlxPath
{
//figure out what tile we are starting and ending on.
var startIndex:uint = int((Start.y-y)/_tileHeight) * widthInTiles + int((Start.x-x)/_tileWidth);
var endIndex:uint = int((End.y-y)/_tileHeight) * widthInTiles + int((End.x-x)/_tileWidth);
//check that the start and end are clear.
if( ((_tileObjects[_data[startIndex]] as FlxTile).allowCollisions > 0) ||
((_tileObjects[_data[endIndex]] as FlxTile).allowCollisions > 0) )
return null;
//figure out how far each of the tiles is from the starting tile
var distances:Array = computePathDistance(startIndex,endIndex);
if(distances == null)
return null;
//then count backward to find the shortest path.
var points:Array = new Array();
walkPath(distances,endIndex,points);
//reset the start and end points to be exact
var node:FlxPoint;
node = points[points.length-1] as FlxPoint;
node.x = Start.x;
node.y = Start.y;
node = points[0] as FlxPoint;
node.x = End.x;
node.y = End.y;
//some simple path cleanup options
if(Simplify)
simplifyPath(points);
if(RaySimplify)
raySimplifyPath(points);
//finally load the remaining points into a new path object and return it
var path:FlxPath = new FlxPath();
var i:int = points.length - 1;
while(i >= 0)
{
node = points[i--] as FlxPoint;
if(node != null)
path.addPoint(node,true);
}
return path;
}
/**
* Pathfinding helper function, strips out extra points on the same line.
*
* @param Points An array of FlxPoint nodes.
*/
protected function simplifyPath(Points:Array):void
{
var deltaPrevious:Number;
var deltaNext:Number;
var last:FlxPoint = Points[0];
var node:FlxPoint;
var i:uint = 1;
var l:uint = Points.length-1;
while(i < l)
{
node = Points[i];
deltaPrevious = (node.x - last.x)/(node.y - last.y);
deltaNext = (node.x - Points[i+1].x)/(node.y - Points[i+1].y);
if((last.x == Points[i+1].x) || (last.y == Points[i+1].y) || (deltaPrevious == deltaNext))
Points[i] = null;
else
last = node;
i++;
}
}
/**
* Pathfinding helper function, strips out even more points by raycasting from one point to the next and dropping unnecessary points.
*
* @param Points An array of FlxPoint nodes.
*/
protected function raySimplifyPath(Points:Array):void
{
var source:FlxPoint = Points[0];
var lastIndex:int = -1;
var node:FlxPoint;
var i:uint = 1;
var l:uint = Points.length;
while(i < l)
{
node = Points[i++];
if(node == null)
continue;
if(ray(source,node,_point))
{
if(lastIndex >= 0)
Points[lastIndex] = null;
}
else
source = Points[lastIndex];
lastIndex = i-1;
}
}
/**
* Pathfinding helper function, floods a grid with distance information until it finds the end point.
* NOTE: Currently this process does NOT use any kind of fancy heuristic! It's pretty brute.
*
* @param StartIndex The starting tile's map index.
* @param EndIndex The ending tile's map index.
*
* @return A Flash Array of FlxPoint nodes. If the end tile could not be found, then a null Array is returned instead.
*/
protected function computePathDistance(StartIndex:uint, EndIndex:uint):Array
{
//Create a distance-based representation of the tilemap.
//All walls are flagged as -2, all open areas as -1.
var mapSize:uint = widthInTiles*heightInTiles;
var distances:Array = new Array(mapSize);
var i:int = 0;
while(i < mapSize)
{
if((_tileObjects[_data[i]] as FlxTile).allowCollisions)
distances[i] = -2;
else
distances[i] = -1;
i++;
}
distances[StartIndex] = 0;
var distance:uint = 1;
var neighbors:Array = [StartIndex];
var current:Array;
var currentIndex:uint;
var left:Boolean;
var right:Boolean;
var up:Boolean;
var down:Boolean;
var currentLength:uint;
var foundEnd:Boolean = false;
while(neighbors.length > 0)
{
current = neighbors;
neighbors = new Array();
i = 0;
currentLength = current.length;
while(i < currentLength)
{
currentIndex = current[i++];
if(currentIndex == EndIndex)
{
foundEnd = true;
neighbors.length = 0;
break;
}
//basic map bounds
left = currentIndex%widthInTiles > 0;
right = currentIndex%widthInTiles < widthInTiles-1;
up = currentIndex/widthInTiles > 0;
down = currentIndex/widthInTiles < heightInTiles-1;
var index:uint;
if(up)
{
index = currentIndex - widthInTiles;
if(distances[index] == -1)
{
distances[index] = distance;
neighbors.push(index);
}
}
if(right)
{
index = currentIndex + 1;
if(distances[index] == -1)
{
distances[index] = distance;
neighbors.push(index);
}
}
if(down)
{
index = currentIndex + widthInTiles;
if(distances[index] == -1)
{
distances[index] = distance;
neighbors.push(index);
}
}
if(left)
{
index = currentIndex - 1;
if(distances[index] == -1)
{
distances[index] = distance;
neighbors.push(index);
}
}
if(up && right)
{
index = currentIndex - widthInTiles + 1;
if((distances[index] == -1) && (distances[currentIndex-widthInTiles] >= -1) && (distances[currentIndex+1] >= -1))
{
distances[index] = distance;
neighbors.push(index);
}
}
if(right && down)
{
index = currentIndex + widthInTiles + 1;
if((distances[index] == -1) && (distances[currentIndex+widthInTiles] >= -1) && (distances[currentIndex+1] >= -1))
{
distances[index] = distance;
neighbors.push(index);
}
}
if(left && down)
{
index = currentIndex + widthInTiles - 1;
if((distances[index] == -1) && (distances[currentIndex+widthInTiles] >= -1) && (distances[currentIndex-1] >= -1))
{
distances[index] = distance;
neighbors.push(index);
}
}
if(up && left)
{
index = currentIndex - widthInTiles - 1;
if((distances[index] == -1) && (distances[currentIndex-widthInTiles] >= -1) && (distances[currentIndex-1] >= -1))
{
distances[index] = distance;
neighbors.push(index);
}
}
}
distance++;
}
if(!foundEnd)
distances = null;
return distances;
}
/**
* Pathfinding helper function, recursively walks the grid and finds a shortest path back to the start.
*
* @param Data A Flash Array of distance information.
* @param Start The tile we're on in our walk backward.
* @param Points A Flash Array of FlxPoint nodes composing the path from the start to the end, compiled in reverse order.
*/
protected function walkPath(Data:Array,Start:uint,Points:Array):void
{
Points.push(new FlxPoint(x + uint(Start%widthInTiles)*_tileWidth + _tileWidth*0.5, y + uint(Start/widthInTiles)*_tileHeight + _tileHeight*0.5));
if(Data[Start] == 0)
return;
//basic map bounds
var left:Boolean = Start%widthInTiles > 0;
var right:Boolean = Start%widthInTiles < widthInTiles-1;
var up:Boolean = Start/widthInTiles > 0;
var down:Boolean = Start/widthInTiles < heightInTiles-1;
var current:uint = Data[Start];
var i:uint;
if(up)
{
i = Start - widthInTiles;
if((Data[i] >= 0) && (Data[i] < current))
{
walkPath(Data,i,Points);
return;
}
}
if(right)
{
i = Start + 1;
if((Data[i] >= 0) && (Data[i] < current))
{
walkPath(Data,i,Points);
return;
}
}
if(down)
{
i = Start + widthInTiles;
if((Data[i] >= 0) && (Data[i] < current))
{
walkPath(Data,i,Points);
return;
}
}
if(left)
{
i = Start - 1;
if((Data[i] >= 0) && (Data[i] < current))
{
walkPath(Data,i,Points);
return;
}
}
if(up && right)
{
i = Start - widthInTiles + 1;
if((Data[i] >= 0) && (Data[i] < current))
{
walkPath(Data,i,Points);
return;
}
}
if(right && down)
{
i = Start + widthInTiles + 1;
if((Data[i] >= 0) && (Data[i] < current))
{
walkPath(Data,i,Points);
return;
}
}
if(left && down)
{
i = Start + widthInTiles - 1;
if((Data[i] >= 0) && (Data[i] < current))
{
walkPath(Data,i,Points);
return;
}
}
if(up && left)
{
i = Start - widthInTiles - 1;
if((Data[i] >= 0) && (Data[i] < current))
{
walkPath(Data,i,Points);
return;
}
}
}
/**
* Checks to see if some FlxObject overlaps this FlxObject object in world space.
* If the group has a LOT of things in it, it might be faster to use FlxG.overlaps().
* WARNING: Currently tilemaps do NOT support screen space overlap checks!
*
* @param Object The object being tested.
* @param InScreenSpace Whether to take scroll factors into account when checking for overlap.
* @param Camera Specify which game camera you want. If null getScreenXY() will just grab the first global camera.
*
* @return Whether or not the two objects overlap.
*/
override public function overlaps(ObjectOrGroup:FlxBasic,InScreenSpace:Boolean=false,Camera:FlxCamera=null):Boolean
{
if(ObjectOrGroup is FlxGroup)
{
var results:Boolean = false;
var basic:FlxBasic;
var i:uint = 0;
var members:Array = (ObjectOrGroup as FlxGroup).members;
while(i < length)
{
basic = members[i++] as FlxBasic;
if(basic is FlxObject)
{
if(overlapsWithCallback(basic as FlxObject))
results = true;
}
else
{
if(overlaps(basic,InScreenSpace,Camera))
results = true;
}
}
return results;
}
else if(ObjectOrGroup is FlxObject)
return overlapsWithCallback(ObjectOrGroup as FlxObject);
return false;
}
/**
* Checks to see if this FlxObject were located at the given position, would it overlap the FlxObject or FlxGroup?
* This is distinct from overlapsPoint(), which just checks that point, rather than taking the object's size into account.
* WARNING: Currently tilemaps do NOT support screen space overlap checks!
*
* @param X The X position you want to check. Pretends this object (the caller, not the parameter) is located here.
* @param Y The Y position you want to check. Pretends this object (the caller, not the parameter) is located here.
* @param ObjectOrGroup The object or group being tested.
* @param InScreenSpace Whether to take scroll factors into account when checking for overlap. Default is false, or "only compare in world space."
* @param Camera Specify which game camera you want. If null getScreenXY() will just grab the first global camera.
*
* @return Whether or not the two objects overlap.
*/
override public function overlapsAt(X:Number,Y:Number,ObjectOrGroup:FlxBasic,InScreenSpace:Boolean=false,Camera:FlxCamera=null):Boolean
{
if(ObjectOrGroup is FlxGroup)
{
var results:Boolean = false;
var basic:FlxBasic;
var i:uint = 0;
var members:Array = (ObjectOrGroup as FlxGroup).members;
while(i < length)
{
basic = members[i++] as FlxBasic;
if(basic is FlxObject)
{
_point.x = X;
_point.y = Y;
if(overlapsWithCallback(basic as FlxObject,null,false,_point))
results = true;
}
else
{
if(overlapsAt(X,Y,basic,InScreenSpace,Camera))
results = true;
}
}
return results;
}
else if(ObjectOrGroup is FlxObject)
{
_point.x = X;
_point.y = Y;
return overlapsWithCallback(ObjectOrGroup as FlxObject,null,false,_point);
}
return false;
}
/**
* Checks if the Object overlaps any tiles with any collision flags set,
* and calls the specified callback function (if there is one).
* Also calls the tile's registered callback if the filter matches.
*
* @param Object The FlxObject you are checking for overlaps against.
* @param Callback An optional function that takes the form "myCallback(Object1:FlxObject,Object2:FlxObject)", where Object1 is a FlxTile object, and Object2 is the object passed in in the first parameter of this method.
* @param FlipCallbackParams Used to preserve A-B list ordering from FlxObject.separate() - returns the FlxTile object as the second parameter instead.
* @param Position Optional, specify a custom position for the tilemap (useful for overlapsAt()-type funcitonality).
*
* @return Whether there were overlaps, or if a callback was specified, whatever the return value of the callback was.
*/
public function overlapsWithCallback(Object:FlxObject,Callback:Function=null,FlipCallbackParams:Boolean=false,Position:FlxPoint=null):Boolean
{
var results:Boolean = false;
var X:Number = x;
var Y:Number = y;
if(Position != null)
{
X = Position.x;
Y = Position.y;
}
//Figure out what tiles we need to check against
var selectionX:int = FlxU.floor((Object.x - X)/_tileWidth);
var selectionY:int = FlxU.floor((Object.y - Y)/_tileHeight);
var selectionWidth:uint = selectionX + (FlxU.ceil(Object.width/_tileWidth)) + 1;
var selectionHeight:uint = selectionY + FlxU.ceil(Object.height/_tileHeight) + 1;
//Then bound these coordinates by the map edges
if(selectionX < 0)
selectionX = 0;
if(selectionY < 0)
selectionY = 0;
if(selectionWidth > widthInTiles)
selectionWidth = widthInTiles;
if(selectionHeight > heightInTiles)
selectionHeight = heightInTiles;
//Then loop through this selection of tiles and call FlxObject.separate() accordingly
var rowStart:uint = selectionY*widthInTiles;
var row:uint = selectionY;
var column:uint;
var tile:FlxTile;
var overlapFound:Boolean;
var deltaX:Number = X - last.x;
var deltaY:Number = Y - last.y;
while(row < selectionHeight)
{
column = selectionX;
while(column < selectionWidth)
{
overlapFound = false;
tile = _tileObjects[_data[rowStart+column]] as FlxTile;
if(tile.allowCollisions)
{
tile.x = X+column*_tileWidth;
tile.y = Y+row*_tileHeight;
tile.last.x = tile.x - deltaX;
tile.last.y = tile.y - deltaY;
if(Callback != null)
{
if(FlipCallbackParams)
overlapFound = Callback(Object,tile);
else
overlapFound = Callback(tile,Object);
}
else
overlapFound = (Object.x + Object.width > tile.x) && (Object.x < tile.x + tile.width) && (Object.y + Object.height > tile.y) && (Object.y < tile.y + tile.height);
if(overlapFound)
{
if((tile.callback != null) && ((tile.filter == null) || (Object is tile.filter)))
{
tile.mapIndex = rowStart+column;
tile.callback(tile,Object);
}
results = true;
}
}
else if((tile.callback != null) && ((tile.filter == null) || (Object is tile.filter)))
{
tile.mapIndex = rowStart+column;
tile.callback(tile,Object);
}
column++;
}
rowStart += widthInTiles;
row++;
}
return results;
}
/**
* Checks to see if a point in 2D world space overlaps this FlxObject object.
*
* @param Point The point in world space you want to check.
* @param InScreenSpace Whether to take scroll factors into account when checking for overlap.
* @param Camera Specify which game camera you want. If null getScreenXY() will just grab the first global camera.
*
* @return Whether or not the point overlaps this object.
*/
override public function overlapsPoint(Point:FlxPoint,InScreenSpace:Boolean=false,Camera:FlxCamera=null):Boolean
{
if(!InScreenSpace)
return (_tileObjects[_data[uint(uint((Point.y-y)/_tileHeight)*widthInTiles + (Point.x-x)/_tileWidth)]] as FlxTile).allowCollisions > 0;
if(Camera == null)
Camera = FlxG.camera;
Point.x = Point.x - Camera.scroll.x;
Point.y = Point.y - Camera.scroll.y;
getScreenXY(_point,Camera);
return (_tileObjects[_data[uint(uint((Point.y-_point.y)/_tileHeight)*widthInTiles + (Point.x-_point.x)/_tileWidth)]] as FlxTile).allowCollisions > 0;
}
/**
* Check the value of a particular tile.
*
* @param X The X coordinate of the tile (in tiles, not pixels).
* @param Y The Y coordinate of the tile (in tiles, not pixels).
*
* @return A uint containing the value of the tile at this spot in the array.
*/
public function getTile(X:uint,Y:uint):uint
{
return _data[Y * widthInTiles + X] as uint;
}
/**
* Get the value of a tile in the tilemap by index.
*
* @param Index The slot in the data array (Y * widthInTiles + X) where this tile is stored.
*
* @return A uint containing the value of the tile at this spot in the array.
*/
public function getTileByIndex(Index:uint):uint
{
return _data[Index] as uint;
}
/**
* Returns a new Flash Array full of every map index of the requested tile type.
*
* @param Index The requested tile type.
*
* @return An Array with a list of all map indices of that tile type.
*/
public function getTileInstances(Index:uint):Array
{
var array:Array = null;
var i:uint = 0;
var l:uint = widthInTiles * heightInTiles;
while(i < l)
{
if(_data[i] == Index)
{
if(array == null)
array = new Array();
array.push(i);
}
i++;
}
return array;
}
/**
* Returns a new Flash Array full of every coordinate of the requested tile type.
*
* @param Index The requested tile type.
* @param Midpoint Whether to return the coordinates of the tile midpoint, or upper left corner. Default is true, return midpoint.
*
* @return An Array with a list of all the coordinates of that tile type.
*/
public function getTileCoords(Index:uint,Midpoint:Boolean=true):Array
{
var array:Array = null;
var point:FlxPoint;
var i:uint = 0;
var l:uint = widthInTiles * heightInTiles;
while(i < l)
{
if(_data[i] == Index)
{
point = new FlxPoint(x + uint(i%widthInTiles)*_tileWidth,y + uint(i/widthInTiles)*_tileHeight);
if(Midpoint)
{
point.x += _tileWidth*0.5;
point.y += _tileHeight*0.5;
}
if(array == null)
array = new Array();
array.push(point);
}
i++;
}
return array;
}
/**
* Change the data and graphic of a tile in the tilemap.
*
* @param X The X coordinate of the tile (in tiles, not pixels).
* @param Y The Y coordinate of the tile (in tiles, not pixels).
* @param Tile The new integer data you wish to inject.
* @param UpdateGraphics Whether the graphical representation of this tile should change.
*
* @return Whether or not the tile was actually changed.
*/
public function setTile(X:uint,Y:uint,Tile:uint,UpdateGraphics:Boolean=true):Boolean
{
if((X >= widthInTiles) || (Y >= heightInTiles))
return false;
return setTileByIndex(Y * widthInTiles + X,Tile,UpdateGraphics);
}
/**
* Change the data and graphic of a tile in the tilemap.
*
* @param Index The slot in the data array (Y * widthInTiles + X) where this tile is stored.
* @param Tile The new integer data you wish to inject.
* @param UpdateGraphics Whether the graphical representation of this tile should change.
*
* @return Whether or not the tile was actually changed.
*/
public function setTileByIndex(Index:uint,Tile:uint,UpdateGraphics:Boolean=true):Boolean
{
if(Index >= _data.length)
return false;
var ok:Boolean = true;
_data[Index] = Tile;
if(!UpdateGraphics)
return ok;
setDirty();
if(auto == OFF)
{
updateTile(Index);
return ok;
}
//If this map is autotiled and it changes, locally update the arrangement
var i:uint;
var row:int = int(Index/widthInTiles) - 1;
var rowLength:int = row + 3;
var column:int = Index%widthInTiles - 1;
var columnHeight:int = column + 3;
while(row < rowLength)
{
column = columnHeight - 3;
while(column < columnHeight)
{
if((row >= 0) && (row < heightInTiles) && (column >= 0) && (column < widthInTiles))
{
i = row*widthInTiles+column;
autoTile(i);
updateTile(i);
}
column++;
}
row++;
}
return ok;
}
/**
* Adjust collision settings and/or bind a callback function to a range of tiles.
* This callback function, if present, is triggered by calls to overlap() or overlapsWithCallback().
*
* @param Tile The tile or tiles you want to adjust.
* @param AllowCollisions Modify the tile or tiles to only allow collisions from certain directions, use FlxObject constants NONE, ANY, LEFT, RIGHT, etc. Default is "ANY".
* @param Callback The function to trigger, e.g. lavaCallback(Tile:FlxTile, Object:FlxObject).
* @param CallbackFilter If you only want the callback to go off for certain classes or objects based on a certain class, set that class here.
* @param Range If you want this callback to work for a bunch of different tiles, input the range here. Default value is 1.
*/
public function setTileProperties(Tile:uint,AllowCollisions:uint=0x1111,Callback:Function=null,CallbackFilter:Class=null,Range:uint=1):void
{
if(Range <= 0)
Range = 1;
var tile:FlxTile;
var i:uint = Tile;
var l:uint = Tile+Range;
while(i < l)
{
tile = _tileObjects[i++] as FlxTile;
tile.allowCollisions = AllowCollisions;
tile.callback = Callback;
tile.filter = CallbackFilter;
}
}
/**
* Call this function to lock the automatic camera to the map's edges.
*
* @param Camera Specify which game camera you want. If null getScreenXY() will just grab the first global camera.
* @param Border Adjusts the camera follow boundary by whatever number of tiles you specify here. Handy for blocking off deadends that are offscreen, etc. Use a negative number to add padding instead of hiding the edges.
* @param UpdateWorld Whether to update the collision system's world size, default value is true.
*/
public function follow(Camera:FlxCamera=null,Border:int=0,UpdateWorld:Boolean=true):void
{
if(Camera == null)
Camera = FlxG.camera;
Camera.setBounds(x+Border*_tileWidth,y+Border*_tileHeight,width-Border*_tileWidth*2,height-Border*_tileHeight*2,UpdateWorld);
}
/**
* Get the world coordinates and size of the entire tilemap as a FlxRect.
*
* @param Bounds Optional, pass in a pre-existing FlxRect to prevent instantiation of a new object.
*
* @return A FlxRect containing the world coordinates and size of the entire tilemap.
*/
public function getBounds(Bounds:FlxRect=null):FlxRect
{
if(Bounds == null)
Bounds = new FlxRect();
return Bounds.make(x,y,width,height);
}
/**
* Shoots a ray from the start point to the end point.
* If/when it passes through a tile, it stores that point and returns false.
*
* @param Start The world coordinates of the start of the ray.
* @param End The world coordinates of the end of the ray.
* @param Result A Point object containing the first wall impact.
* @param Resolution Defaults to 1, meaning check every tile or so. Higher means more checks!
* @return Returns true if the ray made it from Start to End without hitting anything. Returns false and fills Result if a tile was hit.
*/
public function ray(Start:FlxPoint, End:FlxPoint, Result:FlxPoint=null, Resolution:Number=1):Boolean
{
var step:Number = _tileWidth;
if(_tileHeight < _tileWidth)
step = _tileHeight;
step /= Resolution;
var deltaX:Number = End.x - Start.x;
var deltaY:Number = End.y - Start.y;
var distance:Number = Math.sqrt(deltaX*deltaX + deltaY*deltaY);
var steps:uint = Math.ceil(distance/step);
var stepX:Number = deltaX/steps;
var stepY:Number = deltaY/steps;
var curX:Number = Start.x - stepX - x;
var curY:Number = Start.y - stepY - y;
var tileX:uint;
var tileY:uint;
var i:uint = 0;
while(i < steps)
{
curX += stepX;
curY += stepY;
if((curX < 0) || (curX > width) || (curY < 0) || (curY > height))
{
i++;
continue;
}
tileX = curX/_tileWidth;
tileY = curY/_tileHeight;
if((_tileObjects[_data[tileY*widthInTiles+tileX]] as FlxTile).allowCollisions)
{
//Some basic helper stuff
tileX *= _tileWidth;
tileY *= _tileHeight;
var rx:Number = 0;
var ry:Number = 0;
var q:Number;
var lx:Number = curX-stepX;
var ly:Number = curY-stepY;
//Figure out if it crosses the X boundary
q = tileX;
if(deltaX < 0)
q += _tileWidth;
rx = q;
ry = ly + stepY*((q-lx)/stepX);
if((ry > tileY) && (ry < tileY + _tileHeight))
{
if(Result == null)
Result = new FlxPoint();
Result.x = rx;
Result.y = ry;
return false;
}
//Else, figure out if it crosses the Y boundary
q = tileY;
if(deltaY < 0)
q += _tileHeight;
rx = lx + stepX*((q-ly)/stepY);
ry = q;
if((rx > tileX) && (rx < tileX + _tileWidth))
{
if(Result == null)
Result = new FlxPoint();
Result.x = rx;
Result.y = ry;
return false;
}
return true;
}
i++;
}
return true;
}
/**
* Converts a one-dimensional array of tile data to a comma-separated string.
*
* @param Data An array full of integer tile references.
* @param Width The number of tiles in each row.
* @param Invert Recommended only for 1-bit arrays - changes 0s to 1s and vice versa.
*
* @return A comma-separated string containing the level data in a FlxTilemap-friendly format.
*/
static public function arrayToCSV(Data:Array,Width:int,Invert:Boolean=false):String
{
var row:uint = 0;
var column:uint;
var csv:String;
var Height:int = Data.length / Width;
var index:int;
while(row < Height)
{
column = 0;
while(column < Width)
{
index = Data[row*Width+column];
if(Invert)
{
if(index == 0)
index = 1;
else if(index == 1)
index = 0;
}
if(column == 0)
{
if(row == 0)
csv += index;
else
csv += "\n"+index;
}
else
csv += ", "+index;
column++;
}
row++;
}
return csv;
}
/**
* Converts a BitmapData object to a comma-separated string.
* Black pixels are flagged as 'solid' by default,
* non-black pixels are set as non-colliding.
* Black pixels must be PURE BLACK.
*
* @param bitmapData A Flash BitmapData object, preferably black and white.
* @param Invert Load white pixels as solid instead.
* @param Scale Default is 1. Scale of 2 means each pixel forms a 2x2 block of tiles, and so on.
*
* @return A comma-separated string containing the level data in a FlxTilemap-friendly format.
*/
static public function bitmapToCSV(bitmapData:BitmapData,Invert:Boolean=false,Scale:uint=1):String
{
//Import and scale image if necessary
if(Scale > 1)
{
var bd:BitmapData = bitmapData;
bitmapData = new BitmapData(bitmapData.width*Scale,bitmapData.height*Scale);
var mtx:Matrix = new Matrix();
mtx.scale(Scale,Scale);
bitmapData.draw(bd,mtx);
}
//Walk image and export pixel values
var row:uint = 0;
var column:uint;
var pixel:uint;
var csv:String = "";
var bitmapWidth:uint = bitmapData.width;
var bitmapHeight:uint = bitmapData.height;
while(row < bitmapHeight)
{
column = 0;
while(column < bitmapWidth)
{
//Decide if this pixel/tile is solid (1) or not (0)
pixel = bitmapData.getPixel(column,row);
if((Invert && (pixel > 0)) || (!Invert && (pixel == 0)))
pixel = 1;
else
pixel = 0;
//Write the result to the string
if(column == 0)
{
if(row == 0)
csv += pixel;
else
csv += "\n"+pixel;
}
else
csv += ", "+pixel;
column++;
}
row++;
}
return csv;
}
/**
* Converts a resource image file to a comma-separated string.
* Black pixels are flagged as 'solid' by default,
* non-black pixels are set as non-colliding.
* Black pixels must be PURE BLACK.
*
* @param ImageFile An embedded graphic, preferably black and white.
* @param Invert Load white pixels as solid instead.
* @param Scale Default is 1. Scale of 2 means each pixel forms a 2x2 block of tiles, and so on.
*
* @return A comma-separated string containing the level data in a FlxTilemap-friendly format.
*/
static public function imageToCSV(ImageFile:Class,Invert:Boolean=false,Scale:uint=1):String
{
return bitmapToCSV((new ImageFile).bitmapData,Invert,Scale);
}
/**
* An internal function used by the binary auto-tilers.
*
* @param Index The index of the tile you want to analyze.
*/
protected function autoTile(Index:uint):void
{
if(_data[Index] == 0)
return;
if (auto == AUTO)
{
//JMIM: MOD: Remap Function:
//if _data[Index] is 1 - 16 , Z == 0, (tileSet #0) 0*16 = 0
// 17- 32 , Z == 1, (tileSet #1) 1*16 = 16
// 33- 48 , Z == 2, (tileSet #2) 2*16 = 32
// 49- 66 , Z == 3, (tileSet #3) 3*16 = 48
var TSI:int = Math.ceil( _data[Index] / 16) - 1;
//Z == the tile we are counting as "ZERO" or our MIN.
var Z:int = TSI * 16; //tile set index.
_data[Index] = Z; //our new first tile before calculations are made.
}
else
{
_data[Index] = 0;
}
if (_fuseType == FUSETYPE_ALL || (auto == ALT ) )
{
if((Index-widthInTiles < 0) || (_data[Index-widthInTiles] > 0)) //UP (JM: Very top of map, or tile above Index tile)
_data[Index] += 1;
if((Index%widthInTiles >= widthInTiles-1) || (_data[Index+1] > 0)) //RIGHT
_data[Index] += 2;
if((Index+widthInTiles >= totalTiles) || (_data[Index+widthInTiles] > 0)) //DOWN
_data[Index] += 4;
if((Index%widthInTiles <= 0) || (_data[Index-1] > 0)) //LEFT
_data[Index] += 8;
}
else
{
var X:int = Z + 16;
var d1:int = _data[Index-widthInTiles];
var d2:int = _data[Index + 1];
var d4:int = _data[Index + widthInTiles];
var d8:int = _data[Index - 1];
if (_fuseType == FUSETYPE_NONE)
{
if((Index-widthInTiles < 0) || ((d1 > Z)&&(d1 <= X)) ) //UP (JM: Very top of map, or tile above Index tile)
_data[Index] += 1;
if((Index%widthInTiles >= widthInTiles-1) || ((d2 > Z)&&(d2 <= X)) ) //RIGHT
_data[Index] += 2;
if((Index+widthInTiles >= totalTiles) || ((d4 > Z)&&(d4 <= X)) ) //DOWN
_data[Index] += 4;
if((Index%widthInTiles <= 0) || ((d8 > Z)&&(d8 <= X)) ) //LEFT
_data[Index] += 8;
}
else
if (_fuseType == FUSETYPE_OVERLAP)
{
if((Index-widthInTiles < 0) || (d1 > Z) ) //UP (JM: Very top of map, or tile above Index tile)
_data[Index] += 1;
if((Index%widthInTiles >= widthInTiles-1) || (d2 > Z) ) //RIGHT
_data[Index] += 2;
if((Index+widthInTiles >= totalTiles) || (d4 > Z) ) //DOWN
_data[Index] += 4;
if((Index%widthInTiles <= 0) || (d8 > Z) ) //LEFT
_data[Index] += 8;
}
}
if((auto == ALT) && (_data[Index] == 15)) //The alternate algo checks for interior corners
{
if((Index%widthInTiles > 0) && (Index+widthInTiles < totalTiles) && (_data[Index+widthInTiles-1] <= 0))
_data[Index] = 1; //BOTTOM LEFT OPEN
if((Index%widthInTiles > 0) && (Index-widthInTiles >= 0) && (_data[Index-widthInTiles-1] <= 0))
_data[Index] = 2; //TOP LEFT OPEN
if((Index%widthInTiles < widthInTiles-1) && (Index-widthInTiles >= 0) && (_data[Index-widthInTiles+1] <= 0))
_data[Index] = 4; //TOP RIGHT OPEN
if((Index%widthInTiles < widthInTiles-1) && (Index+widthInTiles < totalTiles) && (_data[Index+widthInTiles+1] <= 0))
_data[Index] = 8; //BOTTOM RIGHT OPEN
}
_data[Index] += 1;
}
/**
* Internal function used in setTileByIndex() and the constructor to update the map.
*
* @param Index The index of the tile you want to update.
*/
protected function updateTile(Index:uint):void
{
var tile:FlxTile = _tileObjects[_data[Index]] as FlxTile;
if((tile == null) || !tile.visible) //TODO: Why is tile == null?
{
_rects[Index] = null;
return;
}
var rx:uint = (_data[Index]-_startingIndex)*_tileWidth;
var ry:uint = 0;
if(rx >= _tiles.width)
{
ry = uint(rx/_tiles.width)*_tileHeight;
rx %= _tiles.width;
}
_rects[Index] = (new Rectangle(rx,ry,_tileWidth,_tileHeight));
}
}
}
Flixel Multiple TileSets AutoTile Hack (WORK)
Hacking Flixel AutoTile to support over 16 tiles.
AKA: Multiple auto tiling sets on same screen.
Saving Original Function as I hack away at it:
In FlxTileMap:
/**
* An internal function used by the binary auto-tilers.
*
* @param Index The index of the tile you want to analyze.
*/
protected function autoTile(Index:uint):void
{
if(_data[Index] == 0)
return;
_data[Index] = 0;
if((Index-widthInTiles < 0) || (_data[Index-widthInTiles] > 0)) //UP (JM: Very top of map, or tile above Index tile)
_data[Index] += 1;
if((Index%widthInTiles >= widthInTiles-1) || (_data[Index+1] > 0)) //RIGHT
_data[Index] += 2;
if((Index+widthInTiles >= totalTiles) || (_data[Index+widthInTiles] > 0)) //DOWN
_data[Index] += 4;
if((Index%widthInTiles <= 0) || (_data[Index-1] > 0)) //LEFT
_data[Index] += 8;
if((auto == ALT) && (_data[Index] == 15)) //The alternate algo checks for interior corners
{
if((Index%widthInTiles > 0) && (Index+widthInTiles < totalTiles) && (_data[Index+widthInTiles-1] <= 0))
_data[Index] = 1; //BOTTOM LEFT OPEN
if((Index%widthInTiles > 0) && (Index-widthInTiles >= 0) && (_data[Index-widthInTiles-1] <= 0))
_data[Index] = 2; //TOP LEFT OPEN
if((Index%widthInTiles < widthInTiles-1) && (Index-widthInTiles >= 0) && (_data[Index-widthInTiles+1] <= 0))
_data[Index] = 4; //TOP RIGHT OPEN
if((Index%widthInTiles < widthInTiles-1) && (Index+widthInTiles < totalTiles) && (_data[Index+widthInTiles+1] <= 0))
_data[Index] = 8; //BOTTOM RIGHT OPEN
}
_data[Index] += 1;
}
Created fast re-mapping function to test logic for re-mapping
indicies without the use of the slow "Math.floor"
private function indexToColumnNumberRemap(columnWidth:int):void
{
//In Flixel: When using auto-tiling, you have 16 tiles to choose from.
// Tiles 1 - 16. Represented in based zero here by 0 - 15
// If I want to edit Flixels: "autoTile" function in FlxTileMap, I will have to
// re-map a given tile-number to what tile-set it belongs to.
// this code attempts to do that re-map blazingly fast.
// faster than: Math.ceil( index / 15 ) - 1;
// or faster than: INV_15 = 1/15; Math.ceil( index * INV_15 ) - 1;
//
// [00][01][02][03][04][05][06][07][08][09][10][11][12][13][14][15] //USE TILE SET # 0; 0 - 15
// [16][17][18][19][20][21][22][23][24][25][26][27][28][29][30][31] //USE TILE SET # 1; 16- 31
// [32][33][34][35][36][37][38][39][40][41][42][43][44][45][46][47] //USE TILE SET # 2; 32- 47
// [48][49][50][51][52][53][54][55][56][57][58][59][60][61][62][63] //USE TILE SET # 3; 48- 63
// [64]
var inv_ColumnWidth :Number = 1 / columnWidth;
var inv_ColumnWidthPlus1:Number = 1 / (columnWidth + 1);
var shift:int;
var finalVal:int;
var I:int;
for (var i:int = 0; i < 100; i++)
{
shift = int( i * inv_ColumnWidth );
I = i + shift;
finalVal = int( I * inv_ColumnWidthPlus1);
trace(i + " finalVal==" + finalVal);
}
}
private function divTest_015():void
{
// Proof of concept function: Remap logic:
// [00][01][02][03][04][05][06][07][08][09][10][11][12][13][14][15] //USE TILE SET # 0; 0 - 15
// [16][17][18][19][20][21][22][23][24][25][26][27][28][29][30][31] //USE TILE SET # 1; 16- 31
// [32][33][34][35][36][37][38][39][40][41][42][43][44][45][46][47] //USE TILE SET # 2; 32- 47
// [48][49][50][51][52][53][54][55][56][57][58][59][60][61][62][63] //USE TILE SET # 3; 48- 63
// [64]
var I:int; //i shifted back one.
var d:int;
var m:int;
var r:int;
var finalVal:int;
for (var i:int = 0; i < 100; i++)
{
m = int( (i) / 16);
I = i + m;
finalVal = int( I / (16 + 1) ); //i divided by 17, rather than 16. Will shift off by one each cycle of 16,
trace(i + " m==" + m + " finalVal==" + finalVal);
}
}
As fun as that was... Remapping using:
Is a bit faster.
Here is my benchmark test:
private function remapBenchmarkTest(columnWidth:int):void
{
//In Flixel: When using auto-tiling, you have 16 tiles to choose from.
// Tiles 1 - 16. Represented in based zero here by 0 - 15
// If I want to edit Flixels: "autoTile" function in FlxTileMap, I will have to
// re-map a given tile-number to what tile-set it belongs to.
// this code attempts to do that re-map blazingly fast.
// faster than: Math.ceil( index / 15 ) - 1;
// or faster than: INV_15 = 1/15; Math.ceil( index * INV_15 ) - 1;
//
// update: actual calculation using floor;
// Math.ceil( (i + 1) / columnWidth) - 1);
//
// [00][01][02][03][04][05][06][07][08][09][10][11][12][13][14][15] //USE TILE SET # 0; 0 - 15
// [16][17][18][19][20][21][22][23][24][25][26][27][28][29][30][31] //USE TILE SET # 1; 16- 31
// [32][33][34][35][36][37][38][39][40][41][42][43][44][45][46][47] //USE TILE SET # 2; 32- 47
// [48][49][50][51][52][53][54][55][56][57][58][59][60][61][62][63] //USE TILE SET # 3; 48- 63
// [64]
var MAXTIMES:int = 9876543;
var inv_ColumnWidth :Number = 1 / columnWidth;
var inv_ColumnWidthPlus1:Number = 1 / (columnWidth + 1);
var shift:int;
var finalVal:int;
var I:int;
var t:int; //for timer.
t = getTimer();
var i:int;
for (i = 0; i < MAXTIMES; i++)
{
shift = int( i * inv_ColumnWidth );
I = i + shift;
finalVal = int( I * inv_ColumnWidthPlus1);
//if (finalVal != ( Math.ceil( (i + 1) / columnWidth) - 1) ) { throw new Error("HAY!!!"); }
//trace(i + " finalVal==" + finalVal);
}
t = getTimer() - t;
trace("time taken for optimized code:" + t);
t = getTimer();
for (i = 0; i < MAXTIMES; i++)
{
Math.ceil(i);
}
t = getTimer() - t;
trace("time taken for just using Math.ceil" + t);
t = getTimer();
for (i = 0; i < MAXTIMES; i++)
{
finalVal = Math.ceil( (i + 1) / columnWidth) - 1;
}
t = getTimer() - t;
trace("time taken for actual remap code using math.ceil" + t);
}
LevelEaters
This SWF I have made is a combination of two demos by these folks, found on the flixel.org features page: http://twitter.com/#!/phmongeau http://twitter.com/#!/lordtim Also combined observations of Bomberman for NES to get the explosion mechanic. Needs a little bit of work. Like combining explosions together. But that is purely aesthetic, so not going to work on it till mechanics are fun. Thinking I could make a game where: 1. You have to blow parts of the level up in order to escape from rising water. Could start the game by accidentally blowing a hole in the floor that lets the water in. 2. Maybe a game where you are always moving DOWN and blowing holes in the floor trying to escape from something chasing you. Maybe the thing chasing you is 2X as big, so it can't get through the little holes you tunnel yourself. 3. A game where you have a rock, and the objective is to set off the land mines and get through the level without dying. 4. Collecting objects to blow up certain materials.
Monday, December 17, 2012
Flixel Collision Notes
//This call:
collision_cratesVSmap(crateStormGroup, collisionMap);
//is equivalent in affect to this call:
FlxG.collide(crateStormGroup, collisionMap, crateOnWallAction);
private function collision_cratesVSmap(objectOrGroup1:FlxBasic, objectOrGroup2:FlxBasic):void
{
FlxG.overlap(objectOrGroup1, objectOrGroup2, crateOnWallAction, FlxObject.separate);
}
private function crateOnWallAction(b1:FlxBasic, b2:FlxBasic):void
{
//get the object that is NOT the wall, but our sprite.
var b:FlxSprite;
if (b1 is FlxSprite) { b = b1 as FlxSprite; }
else
if (b2 is FlxSprite) { b = b2 as FlxSprite; }
if (b1 is Sprite && b2 is Sprite) { throw new Error("both sprites"); }
b.acceleration.x = 0 - b.acceleration.x;
b.acceleration.y = 0 - b.acceleration.y;
}
Saturday, December 15, 2012
My First Flixel Project
This SWF I have made is a combination of two demos by these folks, found on the flixel.org features page: http://twitter.com/#!/phmongeau http://twitter.com/#!/lordtim I thought it would be a good learning exercise to merge the features from both demos into one.
Monday, December 10, 2012
get hg command to work in command line
Set user variable: PATH to: C:\Program Files\TortoiseHg Or where ever hg.exe lives on your computer.
Configure FlashDevelop to point to the correct version of Java
After a few Hours, I have figured out how to configure flashDevelop to point to the correct version of Java. Problem: On the command line, when I type: java -version I get a response that tells me I am running version 6 of Java, the correct version of Java for Flash Develop. YET, when I try to compile in Flash Develop, it keeps trying to run Java from C:\System32\bin\java.exe Solution: My JAVA_HOME variable was wrong. And Flash Develop first checks the JAVA_HOME environment variable. It also will check the PATH and JAVA variables as well. But only if JAVA_HOME is NOT supplied. If it is supplied with a bad value, flash develop will simply stop there and tell you that it failed to find Java.exe Configure FlashDevelop to run Java from a different directory: Quick Answer: Edit JAVA_HOME environment variable to point to the location of the java install's "bin" folder. The "bin" folder contains "java.exe" More detailed answer: In the FlexSDK: Location of FlexSDK if you installed it with flashDevelop: Relative Path: ..\FlashDevelop\Tools\flexsdk On My computer: C:\Program Files (x86)\FlashDevelop\Tools\flexsdk In FlexSDK\bin: There is a jvm.config file that you can edit to change where the flexSDK looks for java. (on my computer: C:\Program Files (x86)\FlashDevelop\Tools\flexsdk\bin\jvm.config) Looks like editing jvm.config may be helpful if you are running multiple versions of Java on your computer and want to make sure the FLEX SDK (and thus flash develop) use version 6. As flash develop is not compatible with newer versions of java. NOTE: REQUIRED RESTART OF MY COMPUTER. Resources: [1]: Pointed me to jvm.config: http://www.flashdevelop.org/wikidocs/index.php?title=Configuration
Tuesday, November 20, 2012
constructor length problem
Article found here to solve problem via hack:
http://jacksondunstan.com/articles/398
Wednesday, November 7, 2012
swap out character in middle of string
private function swapOutCharacterChunk
( //used because some numbered assets have the number in the MIDDLE of them.
baseWord:String,
search:String,
replace:String
)
{
var halves:Array = baseWord.split(search);
if (halves.length > 2) { throw new Error("replaces only ONE") };
return ( halves[0] + replace + halves[1] );
}
//example:
var originalText = "GetThis#Thingy";
var newText:String = swapOutCharacterChunk(originalText, "#", "3");
trace("newText==" + newText);
//output:
newText==GetThis3Thingy
//not overly useful.
//should really make your artists adhere to naming conventions than do this.
Friday, November 2, 2012
using the WITH keyword in ActionScript AS3
var retVal:stuff = new stuff();
with(retVal)
{
a = 1;
b = 2;
c = 3;
}
trace("retVal.a == " + retVal.a);
trace("retVal.b == " + retVal.b);
trace("retVal.c == " + retVal.c);
internal class stuff
{
public var a:int;
public var b:int;
public var c:int;
public function stuff():void{}
}
//output:
/*
retVal.a == 1
retVal.b == 2
retVal.c == 3
*/
Not sure I find this useful.
Saves typing, but I am not sure how I feel about debugging code written like this.
Also, intellisense in flashDevelop doesn't appreciate it.
Maybe I will use the with keyword... Depends on how much typing I need to save
and what makes things more readable.
Monday, October 29, 2012
Event Listener trick using bracket notation
//Event Listener Trick using bracket notation:
//Standard way:--------------------------------------------------------------------
public function addEventListeners():void
{
someObject_01.addEventListener(Event.ENTER_FRAME, someFunction_01);
someObject_02.addEventListener(Event.ENTER_FRAME, someFunction_02);
someObject_03.addEventListener(Event.ENTER_FRAME, someFunction_03);
}
public function removeEventListeners():void
{
someObject_01.removeEventListener(Event.ENTER_FRAME, someFunction_01);
someObject_02.removeEventListener(Event.ENTER_FRAME, someFunction_02);
someObject_03.removeEventListener(Event.ENTER_FRAME, someFunction_03);
}
//---------------------------------------------------------------------------------
//Using bracket notation-----------------------------------------------------------
public function setEventListeners(add:Boolean):void
{
var XXX:String;
if(add ){XXX = "addEventListener" };
if(!add){XXX = "removeEventListener"};
someObject_01[XXX](Event.ENTER_FRAME, someFunction_01);
someObject_02[XXX](Event.ENTER_FRAME, someFunction_02);
someObject_03[XXX](Event.ENTER_FRAME, someFunction_03);
}
//---------------------------------------------------------------------------------
Thursday, October 25, 2012
Bound Function AKA CallBacks AS3
//Another weird AS3 Syntax thing I did not know was possible:
private function takeCallback(boundFunction:Function):void
{
trace("calling boundFunction / callback");
boundFunction();
}//takeCallback
//Call Function and pass it an inlined function.
takeCallback( function():void { trace("Function Speaking") } );
Wednesday, October 24, 2012
Breaking Out of Non-Looping Statements:
notAloop:
{
trace("hello 1");
break notAloop;
trace("hello 2");
trace("hello 3");
}
trace("parenEnd");
do {
trace ("do this once.");
break;
trace ("don't do this.");
}while ( false );
//output:
/*
hello 1
parenEnd
do this once.
*/
A few new cool things I found I can do with actionScript syntax.
Wednesday, September 5, 2012
Switch to Flex and Flash Develop
So today I tried to make a document class and compile it...
It couldn't be found.
I've done this many times... So I checked common errors.
I even tried editing and saving the "automatically generated"
document class just in case there was some slight mistake in my typing.
But then my "automatically generated" document class was not found either.
Then I decided to compile some old projects that used document classes...
They didn't compile.
I checked the files classPath settings.
As I compile off a USB stick so that changes often.
That was all fine and dandy...
Did some research and I found some people have actually solved the
problem by re-installing flash.
I am not sure if I have some type of horrible coding practice or what is going on.
But the most common hang ups I come across are errors in package structure that I can't find.
And I've been doing actionScript on a daily basis for about 2 years now.
Messenger and Interpreter Pattern AS3
Making a messenger design pattern in as3 should not be too hard:
Seeing that this is possible:
function doStuff():void
{
trace("doStuff called");
}
var obj:Object = new Object();
obj["x"] = 100;
trace(obj.x);
obj["f"] = doStuff;
obj.f();
obj["f"]();
var fString:String = "f";
obj[fString]();
//output:
//100
//doStuff called
//doStuff called
//doStuff called
Speed Test: Dot Operator and Empty Functions
For a component based class, if a component does NOT need updating, should it call an empty update function, or should it have a variable called "needsUpdate" that determines if an update method is called? Class Test: Component based object:
package com.JM.RESEARCH_CLASSES.functionOrFlag{
import com.JM.RESEARCH_CLASSES.functionOrFlag.ModuleWithEmptyUpdateLocalFunction;
import flash.utils.getTimer;
public class TEST_FuncOrFlag {
private var module1:ModuleWithEmptyUpdateLocalFunction;
private var module2:ModuleWithEmptyUpdateLocalFunction;
private var module3:ModuleWithEmptyUpdateLocalFunction;
private var module4:ModuleWithEmptyUpdateLocalFunction;
private var hasModule1:Boolean = true;
private var hasModule2:Boolean = true;
private var hasModule3:Boolean = true;
private var hasModule4:Boolean = true;
private var module3_updateLocal:Function;
private var variableAccessTest:Boolean;
private var module1NeedsUpdate:Boolean = false;
private var loopTimes:int = 654321;
private var ii:int;
private var t1:int;
private var t2:int;
private var tt:int;
public function TEST_FuncOrFlag() {
module1 = new ModuleWithEmptyUpdateLocalFunction();
module2 = new ModuleWithEmptyUpdateLocalFunction();
module3 = new ModuleWithEmptyUpdateLocalFunction();
module4 = new ModuleWithEmptyUpdateLocalFunction();
module3_updateLocal = module3.updateLocal;
}
public function test():void
{
t1 = getTimer();
for(ii=0; ii < loopTimes; ii++){
if(hasModule1 && module1NeedsUpdate)
{
module1.updateLocal();
}
}
t2 = getTimer();
tt = t2-t1;
trace("skipping function call time: " + tt);
t1 = getTimer();
for(ii=0; ii < loopTimes; ii++){
if(hasModule2)
{
module2.updateLocal();
}
}
t2 = getTimer();
tt = t2-t1;
trace("empty function call time: " + tt);
t1 = getTimer();
for(ii=0; ii < loopTimes; ii++){
if(hasModule3)
{
module3_updateLocal(); //call bound function.
}
}
t2 = getTimer();
tt = t2-t1;
trace("empty function call, bound function:" + tt);
t1 = getTimer();
for(ii=0; ii < loopTimes; ii++){
if(hasModule4)
{
variableAccessTest = module4.testPublicVar;
}
}
t2 = getTimer();
tt = t2-t1;
trace("public variable access:" + tt);
t2 = getTimer();
tt = t2-t1;
trace("empty function call, bound function:" + tt);
t1 = getTimer();
for(ii=0; ii < loopTimes; ii++){
if(true)
{
internalFunc();
}
}
t2 = getTimer();
tt = t2-t1;
trace("internal function call:" + tt);
}
private function internalFunc():void{}; //empty function.
}//class
}//package
//Module with empty update:
package com.JM.RESEARCH_CLASSES.functionOrFlag{
public class ModuleWithEmptyUpdateLocalFunction {
public var testPublicVar:Boolean = true;
public function ModuleWithEmptyUpdateLocalFunction() {
// constructor code
}
public function updateLocal():void
{
//do nothing. This function needs not to be updated.
//we are doing this to keep uniform architecture.
}
}
}
//Testing setup:
import com.JM.RESEARCH_CLASSES.functionOrFlag.TEST_FuncOrFlag; var test:TEST_FuncOrFlag = new TEST_FuncOrFlag(); test.test();
Results: skipping function call time: 20, 19, 20, 21 empty function call time: 126, 128, 137, 131 Explanation of results: Making function call to empty function is slower than checking a boolean that is PART of a class. So we have: Two Boolean checks(FASTER) vs Using the DOT operator to access ANOTHER object. AND calling a function. UPDATE: Trying out a bound function call to empty function. The theory: It would be nice for the main "gameObject" to have a single vector that stores all the objects who's updateLocal() function need to be called. If the module does NOT exist, or does not need to be updated, it simply would not have it's update method included in the vector. Results: empty function call, bound function: 159, 155, 145, 144 A bit slower than calling an empty function. Not surprising, as I already knew calling bound functions was a bit slow. Earlier I had tried to do something like: private var math_sqrt:Function = Math.sqrt; And found that: math_sqrt() is slower than Math.sqrt(); Judging by results: I would say that for a particle system, it definitely makes sense to use an MVC or Bridge pattern. If you have 1000 particles, having ONE class that updates all the particles positions is going to be ONE function call rather than 1000 slow function calls to each self-updating particle. Now... I need to do one more test. To see if it is the function call, or simply the use of the dot-operator. For example: When using an MVC model in a particle system, you have to prepped all of your logic with a reference to the the current object you are working on: If working with self updating particles you can write: vel_x += acc_x; If working with an MVC model where there is an updater class for the particle system: currentParticle.vel_x += currentParticle.acc_x; Question: How slow is the dot operator accessing a VARIABLE compared to the dot operator calling an EMPTY FUNCTION? Need to do a quick test on this. public variable access: 19, 20, 21, 21 Result: Pretty much as fast as accessing local variables. FINAL WORDS: I read this article that mentions that OOP is made to increase programmer efficiency, NOT code execution efficiency: http://www.as3dp.com/2011/04/beginners-oop-design-patterns-in-actionscript-3-0-post-2-code-organizer/ This is a good point... So.... Even though a bound function call is the SLOWEST... I really think the design of having a que of modules in a vector that are all updated in a loop is quite elegant... I think I am going to program my gameObject class this way. I am being a bit ambitious thinking that my game object class needs to be so efficient that I could use instances of "gameObject" as particles in a particle system.
FINAL RESULTS: (I swear I am done now) skipping function call time : 20, 19, 20, 21 empty function call time : 126, 128, 137, 131 empty function call, bound function: 159, 155, 145, 144 public variable access : 19, 20, 21, 21 internal function call :109 , 124, 125, 109
Monday, September 3, 2012
Iteratively traverse a node tree diagram
Put this diagram here for my own reference.
This is how I go about iteratively traversing an entire
tree. Where each node has ONE parent but multiple children.
Taking a break on making a linked particle-type
to create a component-based enemy that has a
movement, display, collisionDetection, and collisionResolution
modules....
Its a real pain to do... But I figure if I do it right the first time
I will be able to re-use this enemy class multiple times by fitting it
with different modules.
I'll make an enemy factory class that utilizes this enemy shell class.
The enemy factory class will have a default implementation for
constructing enemies for fast prototyping, but it will be customizable.
The enemy factory will NOT be a singleton.
My mind is a bit fried.
The end.
Subscribe to:
Posts (Atom)