forked from mirrors/0ad
mimo
118 lines
2.9 KiB
JavaScript
118 lines
2.9 KiB
JavaScript
var API3 = function(m)
|
|
{
|
|
|
|
m.warn = function(output)
|
|
{
|
|
if (typeof output === "string")
|
|
warn("PlayerID " + PlayerID + " | " + output);
|
|
else
|
|
warn("PlayerID " + PlayerID + " | " + uneval(output));
|
|
};
|
|
|
|
m.VectorDistance = function(a, b)
|
|
{
|
|
let dx = a[0] - b[0];
|
|
let dz = a[1] - b[1];
|
|
return Math.sqrt(dx*dx + dz*dz);
|
|
};
|
|
|
|
m.SquareVectorDistance = function(a, b)
|
|
{
|
|
let dx = a[0] - b[0];
|
|
let dz = a[1] - b[1];
|
|
return dx*dx + dz*dz;
|
|
};
|
|
|
|
/**
|
|
* A is the reference, B must be in "range" of A
|
|
* this supposes the range is already squared
|
|
*/
|
|
m.inRange = function(a, b, range)// checks for X distance
|
|
{
|
|
// will avoid unnecessary checking for position in some rare cases... I'm lazy
|
|
if (a === undefined || b === undefined || range === undefined)
|
|
return undefined;
|
|
|
|
let dx = a[0] - b[0];
|
|
let dz = a[1] - b[1];
|
|
return dx*dx + dz*dz < range;
|
|
};
|
|
|
|
/** Slower than SquareVectorDistance, faster than VectorDistance but not exactly accurate. */
|
|
m.ManhattanDistance = function(a, b)
|
|
{
|
|
let dx = a[0] - b[0];
|
|
let dz = a[1] - b[1];
|
|
return Math.abs(dx) + Math.abs(dz);
|
|
};
|
|
|
|
m.AssocArraytoArray = function(assocArray)
|
|
{
|
|
let endArray = [];
|
|
for (let i in assocArray)
|
|
endArray.push(assocArray[i]);
|
|
return endArray;
|
|
};
|
|
|
|
/** Picks a random element from an array */
|
|
m.PickRandom = function(list)
|
|
{
|
|
return list.length ? list[Math.floor(Math.random()*list.length)] : undefined;
|
|
};
|
|
|
|
|
|
/** Utility functions for conversions of maps of different sizes */
|
|
|
|
/**
|
|
* Returns the index of map2 with max content from indices contained inside the cell i of map1
|
|
* map1.cellSize must be a multiple of map2.cellSize
|
|
*/
|
|
m.getMaxMapIndex = function(i, map1, map2)
|
|
{
|
|
let ratio = map1.cellSize / map2.cellSize;
|
|
let ix = (i % map1.width) * ratio;
|
|
let iy = Math.floor(i / map1.width) * ratio;
|
|
let index;
|
|
for (let kx = 0; kx < ratio; ++kx)
|
|
for (let ky = 0; ky < ratio; ++ky)
|
|
if (!index || map2.map[ix+kx+(iy+ky)*map2.width] > map2.map[index])
|
|
index = ix+kx+(iy+ky)*map2.width;
|
|
return index;
|
|
};
|
|
|
|
/**
|
|
* Returns the list of indices of map2 contained inside the cell i of map1
|
|
* map1.cellSize must be a multiple of map2.cellSize
|
|
*/
|
|
m.getMapIndices = function(i, map1, map2)
|
|
{
|
|
let ratio = map1.cellSize / map2.cellSize; // TODO check that this is integer >= 1 ?
|
|
let ix = (i % map1.width) * ratio;
|
|
let iy = Math.floor(i / map1.width) * ratio;
|
|
let ret = [];
|
|
for (let kx = 0; kx < ratio; ++kx)
|
|
for (let ky = 0; ky < ratio; ++ky)
|
|
ret.push(ix+kx+(iy+ky)*map2.width);
|
|
return ret;
|
|
};
|
|
|
|
/**
|
|
* Returns the list of points of map2 contained inside the cell i of map1
|
|
* map1.cellSize must be a multiple of map2.cellSize
|
|
*/
|
|
m.getMapPoints = function(i, map1, map2)
|
|
{
|
|
let ratio = map1.cellSize / map2.cellSize; // TODO check that this is integer >= 1 ?
|
|
let ix = (i % map1.width) * ratio;
|
|
let iy = Math.floor(i / map1.width) * ratio;
|
|
let ret = [];
|
|
for (let kx = 0; kx < ratio; ++kx)
|
|
for (let ky = 0; ky < ratio; ++ky)
|
|
ret.push([ix+kx, iy+ky]);
|
|
return ret;
|
|
};
|
|
|
|
return m;
|
|
|
|
}(API3);
|