@turf/polygonize 6.5.0 → 7.0.0-alpha.0

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,4 +1,4 @@
-import { Feature, Polygon } from "@turf/helpers";
+import { Feature, Polygon } from "geojson";
 /**
  * Returns the direction of the point q relative to the vector p1 -> p2.
  *

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,7 +36,7 @@ exports.orientationIndex = orientationIndex;
  * @returns {boolean} - True if the envelopes are equal
  */
 function envelopeIsEqual(env1, env2) {
-    var envX1 = env1.geometry.coordinates[0].map(function (c) { return c[0]; }), envY1 = env1.geometry.coordinates[0].map(function (c) { return c[1]; }), envX2 = env2.geometry.coordinates[0].map(function (c) { return c[0]; }), envY2 = env2.geometry.coordinates[0].map(function (c) { return c[1]; });
+    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) &&
@@ -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.5.0",
+  "version": "7.0.0-alpha.0",
   "description": "turf polygonize module",
   "author": "Turf Authors",
   "contributors": [
@@ -48,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": "*",
@@ -61,11 +61,12 @@
     "write-json-file": "*"
   },
   "dependencies": {
-    "@turf/boolean-point-in-polygon": "^6.5.0",
-    "@turf/envelope": "^6.5.0",
-    "@turf/helpers": "^6.5.0",
-    "@turf/invariant": "^6.5.0",
-    "@turf/meta": "^6.5.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": "5375941072b90d489389db22b43bfe809d5e451e"
+  "gitHead": "0edc4c491b999e5ace770a61e1cf549f7c004189"
 }