planning

node_modules/ol/geom/flat/contains.js

@@ -0,0 +1,105 @@
+/**
+ * @module ol/geom/flat/contains
+ */
+import { forEachCorner } from '../../extent.js';
+/**
+ * @param {Array<number>} flatCoordinates Flat coordinates.
+ * @param {number} offset Offset.
+ * @param {number} end End.
+ * @param {number} stride Stride.
+ * @param {import("../../extent.js").Extent} extent Extent.
+ * @return {boolean} Contains extent.
+ */
+export function linearRingContainsExtent(flatCoordinates, offset, end, stride, extent) {
+    var outside = forEachCorner(extent, 
+    /**
+     * @param {import("../../coordinate.js").Coordinate} coordinate Coordinate.
+     * @return {boolean} Contains (x, y).
+     */
+    function (coordinate) {
+        return !linearRingContainsXY(flatCoordinates, offset, end, stride, coordinate[0], coordinate[1]);
+    });
+    return !outside;
+}
+/**
+ * @param {Array<number>} flatCoordinates Flat coordinates.
+ * @param {number} offset Offset.
+ * @param {number} end End.
+ * @param {number} stride Stride.
+ * @param {number} x X.
+ * @param {number} y Y.
+ * @return {boolean} Contains (x, y).
+ */
+export function linearRingContainsXY(flatCoordinates, offset, end, stride, x, y) {
+    // https://geomalgorithms.com/a03-_inclusion.html
+    // Copyright 2000 softSurfer, 2012 Dan Sunday
+    // This code may be freely used and modified for any purpose
+    // providing that this copyright notice is included with it.
+    // SoftSurfer makes no warranty for this code, and cannot be held
+    // liable for any real or imagined damage resulting from its use.
+    // Users of this code must verify correctness for their application.
+    var wn = 0;
+    var x1 = flatCoordinates[end - stride];
+    var y1 = flatCoordinates[end - stride + 1];
+    for (; offset < end; offset += stride) {
+        var x2 = flatCoordinates[offset];
+        var y2 = flatCoordinates[offset + 1];
+        if (y1 <= y) {
+            if (y2 > y && (x2 - x1) * (y - y1) - (x - x1) * (y2 - y1) > 0) {
+                wn++;
+            }
+        }
+        else if (y2 <= y && (x2 - x1) * (y - y1) - (x - x1) * (y2 - y1) < 0) {
+            wn--;
+        }
+        x1 = x2;
+        y1 = y2;
+    }
+    return wn !== 0;
+}
+/**
+ * @param {Array<number>} flatCoordinates Flat coordinates.
+ * @param {number} offset Offset.
+ * @param {Array<number>} ends Ends.
+ * @param {number} stride Stride.
+ * @param {number} x X.
+ * @param {number} y Y.
+ * @return {boolean} Contains (x, y).
+ */
+export function linearRingsContainsXY(flatCoordinates, offset, ends, stride, x, y) {
+    if (ends.length === 0) {
+        return false;
+    }
+    if (!linearRingContainsXY(flatCoordinates, offset, ends[0], stride, x, y)) {
+        return false;
+    }
+    for (var i = 1, ii = ends.length; i < ii; ++i) {
+        if (linearRingContainsXY(flatCoordinates, ends[i - 1], ends[i], stride, x, y)) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * @param {Array<number>} flatCoordinates Flat coordinates.
+ * @param {number} offset Offset.
+ * @param {Array<Array<number>>} endss Endss.
+ * @param {number} stride Stride.
+ * @param {number} x X.
+ * @param {number} y Y.
+ * @return {boolean} Contains (x, y).
+ */
+export function linearRingssContainsXY(flatCoordinates, offset, endss, stride, x, y) {
+    if (endss.length === 0) {
+        return false;
+    }
+    for (var i = 0, ii = endss.length; i < ii; ++i) {
+        var ends = endss[i];
+        if (linearRingsContainsXY(flatCoordinates, offset, ends, stride, x, y)) {
+            return true;
+        }
+        offset = ends[ends.length - 1];
+    }
+    return false;
+}
+//# sourceMappingURL=contains.js.map