@turf/polygonize 6.4.0 → 7.0.0-alpha.0

package/dist/js/lib/Graph.js

@@ -1,13 +1,11 @@
 "use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
 Object.defineProperty(exports, "__esModule", { value: true });
-var Node_1 = __importDefault(require("./Node"));
-var Edge_1 = __importDefault(require("./Edge"));
-var EdgeRing_1 = __importDefault(require("./EdgeRing"));
-var meta_1 = require("@turf/meta");
-var invariant_1 = require("@turf/invariant");
+const tslib_1 = require("tslib");
+const Node_1 = tslib_1.__importDefault(require("./Node"));
+const Edge_1 = tslib_1.__importDefault(require("./Edge"));
+const EdgeRing_1 = tslib_1.__importDefault(require("./EdgeRing"));
+const meta_1 = require("@turf/meta");
+const invariant_1 = require("@turf/invariant");
 /**
  * Validates the geoJson.
  *
@@ -22,7 +20,7 @@ function validateGeoJson(geoJson) {
         geoJson.type !== "MultiLineString" &&
         geoJson.type !== "LineString" &&
         geoJson.type !== "Feature")
-        throw new Error("Invalid input type '" + geoJson.type + "'. Geojson must be FeatureCollection, GeometryCollection, LineString, MultiLineString or Feature");
+        throw new Error(`Invalid input type '${geoJson.type}'. Geojson must be FeatureCollection, GeometryCollection, LineString, MultiLineString or Feature`);
 }
 /**
  * Represents a planar graph of edges and nodes that can be used to compute a polygonization.
@@ -33,8 +31,8 @@ function validateGeoJson(geoJson) {
  *
  * This graph is directed (both directions are created)
  */
-var Graph = /** @class */ (function () {
-    function Graph() {
+class Graph {
+    constructor() {
         this.edges = []; //< {Edge[]} dirEdges
         // The key is the `id` of the Node (ie: coordinates.join(','))
         this.nodes = {};
@@ -46,35 +44,35 @@ var Graph = /** @class */ (function () {
      * @returns {Graph} - The newly created graph
      * @throws {Error} if geoJson is invalid.
      */
-    Graph.fromGeoJson = function (geoJson) {
+    static fromGeoJson(geoJson) {
         validateGeoJson(geoJson);
-        var graph = new Graph();
-        meta_1.flattenEach(geoJson, function (feature) {
+        const graph = new Graph();
+        meta_1.flattenEach(geoJson, (feature) => {
             invariant_1.featureOf(feature, "LineString", "Graph::fromGeoJson");
             // When a LineString if formed by many segments, split them
-            meta_1.coordReduce(feature, function (prev, cur) {
+            meta_1.coordReduce(feature, (prev, cur) => {
                 if (prev) {
-                    var start = graph.getNode(prev), end = graph.getNode(cur);
+                    const start = graph.getNode(prev), end = graph.getNode(cur);
                     graph.addEdge(start, end);
                 }
                 return cur;
             });
         });
         return graph;
-    };
+    }
     /**
      * Creates or get a Node.
      *
      * @param {number[]} coordinates - Coordinates of the node
      * @returns {Node} - The created or stored node
      */
-    Graph.prototype.getNode = function (coordinates) {
-        var id = Node_1.default.buildId(coordinates);
-        var node = this.nodes[id];
+    getNode(coordinates) {
+        const id = Node_1.default.buildId(coordinates);
+        let node = this.nodes[id];
         if (!node)
             node = this.nodes[id] = new Node_1.default(coordinates);
         return node;
-    };
+    }
     /**
      * Adds an Edge and its symetricall.
      *
@@ -83,20 +81,19 @@ var Graph = /** @class */ (function () {
      * @param {Node} from - Node which starts the Edge
      * @param {Node} to - Node which ends the Edge
      */
-    Graph.prototype.addEdge = function (from, to) {
-        var edge = new Edge_1.default(from, to), symetricEdge = edge.getSymetric();
+    addEdge(from, to) {
+        const edge = new Edge_1.default(from, to), symetricEdge = edge.getSymetric();
         this.edges.push(edge);
         this.edges.push(symetricEdge);
-    };
+    }
     /**
      * Removes Dangle Nodes (nodes with grade 1).
      */
-    Graph.prototype.deleteDangles = function () {
-        var _this = this;
+    deleteDangles() {
         Object.keys(this.nodes)
-            .map(function (id) { return _this.nodes[id]; })
-            .forEach(function (node) { return _this._removeIfDangle(node); });
-    };
+            .map((id) => this.nodes[id])
+            .forEach((node) => this._removeIfDangle(node));
+    }
     /**
      * Check if node is dangle, if so, remove it.
      *
@@ -104,15 +101,14 @@ var Graph = /** @class */ (function () {
      *
      * @param {Node} node - Node to check if it's a dangle
      */
-    Graph.prototype._removeIfDangle = function (node) {
-        var _this = this;
+    _removeIfDangle(node) {
         // As edges are directed and symetrical, we count only innerEdges
         if (node.innerEdges.length <= 1) {
-            var outerNodes = node.getOuterEdges().map(function (e) { return e.to; });
+            const outerNodes = node.getOuterEdges().map((e) => e.to);
             this.removeNode(node);
-            outerNodes.forEach(function (n) { return _this._removeIfDangle(n); });
+            outerNodes.forEach((n) => this._removeIfDangle(n));
         }
-    };
+    }
     /**
      * Delete cut-edges (bridge edges).
      *
@@ -120,18 +116,17 @@ var Graph = /** @class */ (function () {
      * in which they are. (The label is a number incremented by 1). Edges with the same
      * label are cut-edges.
      */
-    Graph.prototype.deleteCutEdges = function () {
-        var _this = this;
+    deleteCutEdges() {
         this._computeNextCWEdges();
         this._findLabeledEdgeRings();
         // Cut-edges (bridges) are edges where both edges have the same label
-        this.edges.forEach(function (edge) {
+        this.edges.forEach((edge) => {
             if (edge.label === edge.symetric.label) {
-                _this.removeEdge(edge.symetric);
-                _this.removeEdge(edge);
+                this.removeEdge(edge.symetric);
+                this.removeEdge(edge);
             }
         });
-    };
+    }
     /**
      * Set the `next` property of each Edge.
      *
@@ -140,19 +135,16 @@ var Graph = /** @class */ (function () {
      *
      * @param {Node} [node] - If no node is passed, the function calls itself for every node in the Graph
      */
-    Graph.prototype._computeNextCWEdges = function (node) {
-        var _this = this;
+    _computeNextCWEdges(node) {
         if (typeof node === "undefined") {
-            Object.keys(this.nodes).forEach(function (id) {
-                return _this._computeNextCWEdges(_this.nodes[id]);
-            });
+            Object.keys(this.nodes).forEach((id) => this._computeNextCWEdges(this.nodes[id]));
         }
         else {
-            node.getOuterEdges().forEach(function (edge, i) {
+            node.getOuterEdges().forEach((edge, i) => {
                 node.getOuterEdge((i === 0 ? node.getOuterEdges().length : i) - 1).symetric.next = edge;
             });
         }
-    };
+    }
     /**
      * Computes the next edge pointers going CCW around the given node, for the given edgering label.
      *
@@ -164,11 +156,11 @@ var Graph = /** @class */ (function () {
      * @param {Node} node - Node
      * @param {number} label - Ring's label
      */
-    Graph.prototype._computeNextCCWEdges = function (node, label) {
-        var edges = node.getOuterEdges();
-        var firstOutDE, prevInDE;
-        for (var i = edges.length - 1; i >= 0; --i) {
-            var de = edges[i], sym = de.symetric, outDE = void 0, inDE = void 0;
+    _computeNextCCWEdges(node, label) {
+        const edges = node.getOuterEdges();
+        let firstOutDE, prevInDE;
+        for (let i = edges.length - 1; i >= 0; --i) {
+            let de = edges[i], sym = de.symetric, outDE, inDE;
             if (de.label === label)
                 outDE = de;
             if (sym.label === label)
@@ -189,7 +181,7 @@ var Graph = /** @class */ (function () {
         }
         if (prevInDE)
             prevInDE.next = firstOutDE;
-    };
+    }
     /**
      * Finds rings and labels edges according to which rings are.
      *
@@ -197,14 +189,14 @@ var Graph = /** @class */ (function () {
      *
      * @returns {Edge[]} edges that start rings
      */
-    Graph.prototype._findLabeledEdgeRings = function () {
-        var edgeRingStarts = [];
-        var label = 0;
-        this.edges.forEach(function (edge) {
+    _findLabeledEdgeRings() {
+        const edgeRingStarts = [];
+        let label = 0;
+        this.edges.forEach((edge) => {
             if (edge.label >= 0)
                 return;
             edgeRingStarts.push(edge);
-            var e = edge;
+            let e = edge;
             do {
                 e.label = label;
                 e = e.next;
@@ -212,96 +204,90 @@ var Graph = /** @class */ (function () {
             label++;
         });
         return edgeRingStarts;
-    };
+    }
     /**
      * Computes the EdgeRings formed by the edges in this graph.
      *
      * @returns {EdgeRing[]} - A list of all the EdgeRings in the graph.
      */
-    Graph.prototype.getEdgeRings = function () {
-        var _this = this;
+    getEdgeRings() {
         this._computeNextCWEdges();
         // Clear labels
-        this.edges.forEach(function (edge) {
+        this.edges.forEach((edge) => {
             edge.label = undefined;
         });
-        this._findLabeledEdgeRings().forEach(function (edge) {
+        this._findLabeledEdgeRings().forEach((edge) => {
             // convertMaximalToMinimalEdgeRings
-            _this._findIntersectionNodes(edge).forEach(function (node) {
-                _this._computeNextCCWEdges(node, edge.label);
+            this._findIntersectionNodes(edge).forEach((node) => {
+                this._computeNextCCWEdges(node, edge.label);
             });
         });
-        var edgeRingList = [];
+        const edgeRingList = [];
         // find all edgerings
-        this.edges.forEach(function (edge) {
+        this.edges.forEach((edge) => {
             if (edge.ring)
                 return;
-            edgeRingList.push(_this._findEdgeRing(edge));
+            edgeRingList.push(this._findEdgeRing(edge));
         });
         return edgeRingList;
-    };
+    }
     /**
      * Find all nodes in a Maxima EdgeRing which are self-intersection nodes.
      *
      * @param {Node} startEdge - Start Edge of the Ring
      * @returns {Node[]} - intersection nodes
      */
-    Graph.prototype._findIntersectionNodes = function (startEdge) {
-        var intersectionNodes = [];
-        var edge = startEdge;
-        var _loop_1 = function () {
+    _findIntersectionNodes(startEdge) {
+        const intersectionNodes = [];
+        let edge = startEdge;
+        do {
             // getDegree
-            var degree = 0;
-            edge.from.getOuterEdges().forEach(function (e) {
+            let degree = 0;
+            edge.from.getOuterEdges().forEach((e) => {
                 if (e.label === startEdge.label)
                     ++degree;
             });
             if (degree > 1)
                 intersectionNodes.push(edge.from);
             edge = edge.next;
-        };
-        do {
-            _loop_1();
         } while (!startEdge.isEqual(edge));
         return intersectionNodes;
-    };
+    }
     /**
      * Get the edge-ring which starts from the provided Edge.
      *
      * @param {Edge} startEdge - starting edge of the edge ring
      * @returns {EdgeRing} - EdgeRing which start Edge is the provided one.
      */
-    Graph.prototype._findEdgeRing = function (startEdge) {
-        var edge = startEdge;
-        var edgeRing = new EdgeRing_1.default();
+    _findEdgeRing(startEdge) {
+        let edge = startEdge;
+        const edgeRing = new EdgeRing_1.default();
         do {
             edgeRing.push(edge);
             edge.ring = edgeRing;
             edge = edge.next;
         } while (!startEdge.isEqual(edge));
         return edgeRing;
-    };
+    }
     /**
      * Removes a node from the Graph.
      *
      * It also removes edges asociated to that node
      * @param {Node} node - Node to be removed
      */
-    Graph.prototype.removeNode = function (node) {
-        var _this = this;
-        node.getOuterEdges().forEach(function (edge) { return _this.removeEdge(edge); });
-        node.innerEdges.forEach(function (edge) { return _this.removeEdge(edge); });
+    removeNode(node) {
+        node.getOuterEdges().forEach((edge) => this.removeEdge(edge));
+        node.innerEdges.forEach((edge) => this.removeEdge(edge));
         delete this.nodes[node.id];
-    };
+    }
     /**
      * Remove edge from the graph and deletes the edge.
      *
      * @param {Edge} edge - Edge to be removed
      */
-    Graph.prototype.removeEdge = function (edge) {
-        this.edges = this.edges.filter(function (e) { return !e.isEqual(edge); });
+    removeEdge(edge) {
+        this.edges = this.edges.filter((e) => !e.isEqual(edge));
         edge.deleteEdge();
-    };
-    return Graph;
-}());
+    }
+}
 exports.default = Graph;

package/dist/js/lib/Node.d.ts

@@ -10,15 +10,15 @@ export default class Node {
     private outerEdges;
     private outerEdgesSorted;
     constructor(coordinates: number[]);
-    removeInnerEdge(edge: any): void;
-    removeOuterEdge(edge: any): void;
+    removeInnerEdge(edge: Edge): void;
+    removeOuterEdge(edge: Edge): void;
     /**
      * Outer edges are stored CCW order.
      *
      * @memberof Node
      * @param {Edge} edge - Edge to add as an outerEdge.
      */
-    addOuterEdge(edge: any): void;
+    addOuterEdge(edge: Edge): void;
     /**
      * Sorts outer edges in CCW way.
      *
@@ -35,6 +35,6 @@ export default class Node {
      * @returns {Edge[]} - List of outer edges sorted in a CCW order.
      */
     getOuterEdges(): Edge[];
-    getOuterEdge(i: any): Edge;
-    addInnerEdge(edge: any): void;
+    getOuterEdge(i: number): Edge;
+    addInnerEdge(edge: Edge): void;
 }

package/dist/js/lib/Node.js

@@ -1,11 +1,11 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-var util_1 = require("./util");
+const util_1 = require("./util");
 /**
  * Node
  */
-var Node = /** @class */ (function () {
-    function Node(coordinates) {
+class Node {
+    constructor(coordinates) {
         this.id = Node.buildId(coordinates);
         this.coordinates = coordinates; //< {Number[]}
         this.innerEdges = []; //< {Edge[]}
@@ -13,64 +13,63 @@ var Node = /** @class */ (function () {
         this.outerEdges = []; //< {Edge[]}
         this.outerEdgesSorted = false; //< {Boolean} flag that stores if the outer Edges had been sorted
     }
-    Node.buildId = function (coordinates) {
+    static buildId(coordinates) {
         return coordinates.join(",");
-    };
-    Node.prototype.removeInnerEdge = function (edge) {
-        this.innerEdges = this.innerEdges.filter(function (e) { return e.from.id !== edge.from.id; });
-    };
-    Node.prototype.removeOuterEdge = function (edge) {
-        this.outerEdges = this.outerEdges.filter(function (e) { return e.to.id !== edge.to.id; });
-    };
+    }
+    removeInnerEdge(edge) {
+        this.innerEdges = this.innerEdges.filter((e) => e.from.id !== edge.from.id);
+    }
+    removeOuterEdge(edge) {
+        this.outerEdges = this.outerEdges.filter((e) => e.to.id !== edge.to.id);
+    }
     /**
      * Outer edges are stored CCW order.
      *
      * @memberof Node
      * @param {Edge} edge - Edge to add as an outerEdge.
      */
-    Node.prototype.addOuterEdge = function (edge) {
+    addOuterEdge(edge) {
         this.outerEdges.push(edge);
         this.outerEdgesSorted = false;
-    };
+    }
     /**
      * Sorts outer edges in CCW way.
      *
      * @memberof Node
      * @private
      */
-    Node.prototype.sortOuterEdges = function () {
-        var _this = this;
+    sortOuterEdges() {
         if (!this.outerEdgesSorted) {
             //this.outerEdges.sort((a, b) => a.compareTo(b));
             // Using this comparator in order to be deterministic
-            this.outerEdges.sort(function (a, b) {
-                var aNode = a.to, bNode = b.to;
-                if (aNode.coordinates[0] - _this.coordinates[0] >= 0 &&
-                    bNode.coordinates[0] - _this.coordinates[0] < 0)
+            this.outerEdges.sort((a, b) => {
+                const aNode = a.to, bNode = b.to;
+                if (aNode.coordinates[0] - this.coordinates[0] >= 0 &&
+                    bNode.coordinates[0] - this.coordinates[0] < 0)
                     return 1;
-                if (aNode.coordinates[0] - _this.coordinates[0] < 0 &&
-                    bNode.coordinates[0] - _this.coordinates[0] >= 0)
+                if (aNode.coordinates[0] - this.coordinates[0] < 0 &&
+                    bNode.coordinates[0] - this.coordinates[0] >= 0)
                     return -1;
-                if (aNode.coordinates[0] - _this.coordinates[0] === 0 &&
-                    bNode.coordinates[0] - _this.coordinates[0] === 0) {
-                    if (aNode.coordinates[1] - _this.coordinates[1] >= 0 ||
-                        bNode.coordinates[1] - _this.coordinates[1] >= 0)
+                if (aNode.coordinates[0] - this.coordinates[0] === 0 &&
+                    bNode.coordinates[0] - this.coordinates[0] === 0) {
+                    if (aNode.coordinates[1] - this.coordinates[1] >= 0 ||
+                        bNode.coordinates[1] - this.coordinates[1] >= 0)
                         return aNode.coordinates[1] - bNode.coordinates[1];
                     return bNode.coordinates[1] - aNode.coordinates[1];
                 }
-                var det = util_1.orientationIndex(_this.coordinates, aNode.coordinates, bNode.coordinates);
+                const det = util_1.orientationIndex(this.coordinates, aNode.coordinates, bNode.coordinates);
                 if (det < 0)
                     return 1;
                 if (det > 0)
                     return -1;
-                var d1 = Math.pow(aNode.coordinates[0] - _this.coordinates[0], 2) +
-                    Math.pow(aNode.coordinates[1] - _this.coordinates[1], 2), d2 = Math.pow(bNode.coordinates[0] - _this.coordinates[0], 2) +
-                    Math.pow(bNode.coordinates[1] - _this.coordinates[1], 2);
+                const d1 = Math.pow(aNode.coordinates[0] - this.coordinates[0], 2) +
+                    Math.pow(aNode.coordinates[1] - this.coordinates[1], 2), d2 = Math.pow(bNode.coordinates[0] - this.coordinates[0], 2) +
+                    Math.pow(bNode.coordinates[1] - this.coordinates[1], 2);
                 return d1 - d2;
             });
             this.outerEdgesSorted = true;
         }
-    };
+    }
     /**
      * Retrieves outer edges.
      *
@@ -79,17 +78,16 @@ var Node = /** @class */ (function () {
      * @memberof Node
      * @returns {Edge[]} - List of outer edges sorted in a CCW order.
      */
-    Node.prototype.getOuterEdges = function () {
+    getOuterEdges() {
         this.sortOuterEdges();
         return this.outerEdges;
-    };
-    Node.prototype.getOuterEdge = function (i) {
+    }
+    getOuterEdge(i) {
         this.sortOuterEdges();
         return this.outerEdges[i];
-    };
-    Node.prototype.addInnerEdge = function (edge) {
+    }
+    addInnerEdge(edge) {
         this.innerEdges.push(edge);
-    };
-    return Node;
-}());
+    }
+}
 exports.default = Node;

package/dist/js/lib/util.d.ts

@@ -1,3 +1,4 @@
+import { Feature, Polygon } from "geojson";
 /**
  * Returns the direction of the point q relative to the vector p1 -> p2.
  *
@@ -12,7 +13,7 @@
  *    -1 if q is cw (right) from p1->p2,
  *     0 if q is colinear with p1->p2
  */
-declare function orientationIndex(p1: any, p2: any, q: any): number;
+export declare function orientationIndex(p1: number[], p2: number[], q: number[]): number;
 /**
  * Checks if two envelopes are equal.
  *
@@ -22,7 +23,7 @@ declare function orientationIndex(p1: any, p2: any, q: any): number;
  * @param {Feature<Polygon>} env2 - Envelope
  * @returns {boolean} - True if the envelopes are equal
  */
-declare function envelopeIsEqual(env1: any, env2: any): boolean;
+export declare function envelopeIsEqual(env1: Feature<Polygon>, env2: Feature<Polygon>): boolean;
 /**
  * Check if a envelope is contained in other one.
  *
@@ -34,7 +35,7 @@ declare function envelopeIsEqual(env1: any, env2: any): boolean;
  * @param {Feature<Polygon>} env - Envelope
  * @returns {boolean} - True if env is contained in self
  */
-declare function envelopeContains(self: any, env: any): any;
+export declare function envelopeContains(self: Feature<Polygon>, env: Feature<Polygon>): boolean;
 /**
  * Checks if two coordinates are equal.
  *
@@ -42,5 +43,4 @@ declare function envelopeContains(self: any, env: any): any;
  * @param {number[]} coord2 - Second coordinate
  * @returns {boolean} - True if coordinates are equal
  */
-declare function coordinatesEqual(coord1: any, coord2: any): boolean;
-export { orientationIndex, envelopeIsEqual, envelopeContains, coordinatesEqual, };
+export declare function coordinatesEqual(coord1: number[], coord2: number[]): boolean;

package/dist/js/lib/util.js

@@ -1,10 +1,8 @@
 "use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
 Object.defineProperty(exports, "__esModule", { value: true });
-var boolean_point_in_polygon_1 = __importDefault(require("@turf/boolean-point-in-polygon"));
-var helpers_1 = require("@turf/helpers");
+const tslib_1 = require("tslib");
+const boolean_point_in_polygon_1 = tslib_1.__importDefault(require("@turf/boolean-point-in-polygon"));
+const helpers_1 = require("@turf/helpers");
 // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/sign#Polyfill
 function mathSign(x) {
     return ((x > 0) - (x < 0) || +x);
@@ -24,7 +22,7 @@ function mathSign(x) {
  *     0 if q is colinear with p1->p2
  */
 function orientationIndex(p1, p2, q) {
-    var dx1 = p2[0] - p1[0], dy1 = p2[1] - p1[1], dx2 = q[0] - p2[0], dy2 = q[1] - p2[1];
+    const dx1 = p2[0] - p1[0], dy1 = p2[1] - p1[1], dx2 = q[0] - p2[0], dy2 = q[1] - p2[1];
     return mathSign(dx1 * dy2 - dx2 * dy1);
 }
 exports.orientationIndex = orientationIndex;
@@ -38,11 +36,11 @@ exports.orientationIndex = orientationIndex;
  * @returns {boolean} - True if the envelopes are equal
  */
 function envelopeIsEqual(env1, env2) {
-    var envX1 = env1.geometry.coordinates.map(function (c) { return c[0]; }), envY1 = env1.geometry.coordinates.map(function (c) { return c[1]; }), envX2 = env2.geometry.coordinates.map(function (c) { return c[0]; }), envY2 = env2.geometry.coordinates.map(function (c) { return c[1]; });
-    return (Math.max(null, envX1) === Math.max(null, envX2) &&
-        Math.max(null, envY1) === Math.max(null, envY2) &&
-        Math.min(null, envX1) === Math.min(null, envX2) &&
-        Math.min(null, envY1) === Math.min(null, envY2));
+    const envX1 = env1.geometry.coordinates[0].map((c) => c[0]), envY1 = env1.geometry.coordinates[0].map((c) => c[1]), envX2 = env2.geometry.coordinates[0].map((c) => c[0]), envY2 = env2.geometry.coordinates[0].map((c) => c[1]);
+    return (Math.max.apply(null, envX1) === Math.max.apply(null, envX2) &&
+        Math.max.apply(null, envY1) === Math.max.apply(null, envY2) &&
+        Math.min.apply(null, envX1) === Math.min.apply(null, envX2) &&
+        Math.min.apply(null, envY1) === Math.min.apply(null, envY2));
 }
 exports.envelopeIsEqual = envelopeIsEqual;
 /**
@@ -57,9 +55,7 @@ exports.envelopeIsEqual = envelopeIsEqual;
  * @returns {boolean} - True if env is contained in self
  */
 function envelopeContains(self, env) {
-    return env.geometry.coordinates[0].every(function (c) {
-        return boolean_point_in_polygon_1.default(helpers_1.point(c), self);
-    });
+    return env.geometry.coordinates[0].every((c) => boolean_point_in_polygon_1.default(helpers_1.point(c), self));
 }
 exports.envelopeContains = envelopeContains;
 /**

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@turf/polygonize",
-  "version": "6.4.0",
+  "version": "7.0.0-alpha.0",
   "description": "turf polygonize module",
   "author": "Turf Authors",
   "contributors": [
@@ -16,6 +16,7 @@
     "type": "git",
     "url": "git://github.com/Turfjs/turf.git"
   },
+  "funding": "https://opencollective.com/turf",
   "publishConfig": {
     "access": "public"
   },
@@ -47,7 +48,7 @@
     "docs": "node ../../scripts/generate-readmes",
     "test": "npm-run-all test:*",
     "test:tape": "ts-node -r esm test.js",
-    "test:types": "tsc --esModuleInterop --noEmit types.ts"
+    "test:types": "tsc --esModuleInterop --noEmit --strict types.ts"
   },
   "devDependencies": {
     "benchmark": "*",
@@ -60,11 +61,12 @@
     "write-json-file": "*"
   },
   "dependencies": {
-    "@turf/boolean-point-in-polygon": "^6.4.0",
-    "@turf/envelope": "^6.4.0",
-    "@turf/helpers": "^6.4.0",
-    "@turf/invariant": "^6.4.0",
-    "@turf/meta": "^6.4.0"
+    "@turf/boolean-point-in-polygon": "^7.0.0-alpha.0",
+    "@turf/envelope": "^7.0.0-alpha.0",
+    "@turf/helpers": "^7.0.0-alpha.0",
+    "@turf/invariant": "^7.0.0-alpha.0",
+    "@turf/meta": "^7.0.0-alpha.0",
+    "tslib": "^2.3.0"
   },
-  "gitHead": "1e62773cfc88c627cca8effcb5c14cfb65a905ac"
+  "gitHead": "0edc4c491b999e5ace770a61e1cf549f7c004189"
 }