57 lines
1.5 KiB
JavaScript
57 lines
1.5 KiB
JavaScript
/* *
|
|
*
|
|
* (c) 2010-2021 Torstein Honsi
|
|
*
|
|
* License: www.highcharts.com/license
|
|
*
|
|
* !!!!!!! SOURCE GETS TRANSPILED BY TYPESCRIPT. EDIT TS FILE ONLY. !!!!!!!
|
|
*
|
|
* */
|
|
'use strict';
|
|
// Compute bounds from a path element
|
|
var boundsFromPath = function (path) {
|
|
var x2 = -Number.MAX_VALUE, x1 = Number.MAX_VALUE, y2 = -Number.MAX_VALUE, y1 = Number.MAX_VALUE, validBounds;
|
|
path.forEach(function (seg) {
|
|
var x = seg[seg.length - 2], y = seg[seg.length - 1];
|
|
if (typeof x === 'number' &&
|
|
typeof y === 'number') {
|
|
x1 = Math.min(x1, x);
|
|
x2 = Math.max(x2, x);
|
|
y1 = Math.min(y1, y);
|
|
y2 = Math.max(y2, y);
|
|
validBounds = true;
|
|
}
|
|
});
|
|
if (validBounds) {
|
|
return { x1: x1, y1: y1, x2: x2, y2: y2 };
|
|
}
|
|
};
|
|
/**
|
|
* Test for point in polygon. Polygon defined as array of [x,y] points.
|
|
* @private
|
|
*/
|
|
var pointInPolygon = function (point, polygon) {
|
|
var i, j, rel1, rel2, c = false, x = point.x, y = point.y;
|
|
for (i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {
|
|
rel1 = polygon[i][1] > y;
|
|
rel2 = polygon[j][1] > y;
|
|
if (rel1 !== rel2 &&
|
|
(x < (polygon[j][0] - polygon[i][0]) * (y - polygon[i][1]) /
|
|
(polygon[j][1] - polygon[i][1]) +
|
|
polygon[i][0])) {
|
|
c = !c;
|
|
}
|
|
}
|
|
return c;
|
|
};
|
|
/* *
|
|
*
|
|
* Default Export
|
|
*
|
|
* */
|
|
var MapUtilities = {
|
|
boundsFromPath: boundsFromPath,
|
|
pointInPolygon: pointInPolygon
|
|
};
|
|
export default MapUtilities;
|