Spaces:
Running
Running
File size: 1,466 Bytes
87b3b3a |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 |
/**
* @class Abstract FOV algorithm
* @param {function} lightPassesCallback Does the light pass through x,y?
* @param {object} [options]
* @param {int} [options.topology=8] 4/6/8
*/
ROT.FOV = function(lightPassesCallback, options) {
this._lightPasses = lightPassesCallback;
this._options = {
topology: 8
}
for (var p in options) { this._options[p] = options[p]; }
};
/**
* Compute visibility
* @param {int} x
* @param {int} y
* @param {int} R Maximum visibility radius
* @param {function} callback
*/
ROT.FOV.prototype.compute = function(x, y, R, callback) {}
/**
* Return all neighbors in a concentric ring
* @param {int} cx center-x
* @param {int} cy center-y
* @param {int} r range
*/
ROT.FOV.prototype._getCircle = function(cx, cy, r) {
var result = [];
var dirs, countFactor, startOffset;
switch (this._options.topology) {
case 4:
countFactor = 1;
startOffset = [0, 1];
dirs = [
ROT.DIRS[8][7],
ROT.DIRS[8][1],
ROT.DIRS[8][3],
ROT.DIRS[8][5]
]
break;
case 6:
dirs = ROT.DIRS[6];
countFactor = 1;
startOffset = [-1, 1];
break;
case 8:
dirs = ROT.DIRS[4];
countFactor = 2;
startOffset = [-1, 1];
break;
}
/* starting neighbor */
var x = cx + startOffset[0]*r;
var y = cy + startOffset[1]*r;
/* circle */
for (var i=0;i<dirs.length;i++) {
for (var j=0;j<r*countFactor;j++) {
result.push([x, y]);
x += dirs[i][0];
y += dirs[i][1];
}
}
return result;
}
|