npm - node-red-contrib-tak-registration - Versions diffs - 0.13.0 → 0.14.0 - Mend

node-red-contrib-tak-registration 0.13.0 → 0.14.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1151) hide show

package/node_modules/@turf/tin/dist/cjs/index.cjs CHANGED Viewed

@@ -68,22 +68,21 @@ function dedup(edges) {
   let i;
   let m;
   let n;
-  outer:
-    while (j) {
-      b = edges[--j];
-      a = edges[--j];
-      i = j;
-      while (i) {
-        n = edges[--i];
-        m = edges[--i];
-        if (a === m && b === n || a === n && b === m) {
-          edges.splice(j, 2);
-          edges.splice(i, 2);
-          j -= 2;
-          continue outer;
-        }
+  outer: while (j) {
+    b = edges[--j];
+    a = edges[--j];
+    i = j;
+    while (i) {
+      n = edges[--i];
+      m = edges[--i];
+      if (a === m && b === n || a === n && b === m) {
+        edges.splice(j, 2);
+        edges.splice(i, 2);
+        j -= 2;
+        continue outer;
       }
     }
+  }
 }
 function triangulate(vertices) {
   if (vertices.length < 3) {

package/node_modules/@turf/tin/dist/cjs/index.cjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../../index.ts"],"names":[],"mappings":";AAGA,SAAS,mBAAmB,eAAe;AA6C3C,SAAS,IACP,QACA,GAC4B;AAE5B,MAAI,WAAW;AACf,SAAO;AAAA,IACL;AAAA,MACE,OAAO,SAAS,IAAI,CAAC,MAAM;AACzB,cAAM,QAAY;AAAA,UAChB,GAAG,EAAE,SAAS,YAAY,CAAC;AAAA,UAC3B,GAAG,EAAE,SAAS,YAAY,CAAC;AAAA,QAC7B;AACA,YAAI,GAAG;AACL,gBAAM,IAAI,EAAE,WAAW,CAAC;AAAA,QAC1B,WAAW,EAAE,SAAS,YAAY,WAAW,GAAG;AAC9C,qBAAW;AACX,gBAAM,IAAI,EAAE,SAAS,YAAY,CAAC;AAAA,QACpC;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH,EAAE,IAAI,CAAC,aAAkB;AACvB,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,UAAI,aAAa,CAAC;AAIlB,UAAI,UAAU;AACZ,UAAE,KAAK,SAAS,EAAE,CAAC;AACnB,UAAE,KAAK,SAAS,EAAE,CAAC;AACnB,UAAE,KAAK,SAAS,EAAE,CAAC;AAAA,MACrB,OAAO;AACL,qBAAa;AAAA,UACX,GAAG,SAAS,EAAE;AAAA,UACd,GAAG,SAAS,EAAE;AAAA,UACd,GAAG,SAAS,EAAE;AAAA,QAChB;AAAA,MACF;AAEA,aAAO,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,UAAU;AAAA,IAC3C,CAAC;AAAA,EACH;AACF;AAEA,IAAM,WAAN,MAAe;AAAA,EAQb,YAAY,GAAO,GAAO,GAAO;AAC/B,SAAK,IAAI;AACT,SAAK,IAAI;AACT,SAAK,IAAI;AAET,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACzC,UAAM,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACzC,UAAM,IAAI,KAAK,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AAC9C,QAAI;AACJ,QAAI;AAIJ,SAAK,KAAK,IAAI,IAAI,IAAI,KAAK;AAC3B,SAAK,KAAK,IAAI,IAAI,IAAI,KAAK;AAC3B,SAAK,KAAK,IAAI,EAAE;AAChB,SAAK,KAAK,IAAI,EAAE;AAChB,SAAK,IAAI,KAAK,KAAK,KAAK;AAAA,EAC1B;AACF;AAEA,SAAS,IAAI,GAAO,GAAO;AACzB,SAAO,EAAE,IAAI,EAAE;AACjB;AAEA,SAAS,MAAM,OAAiB;AAC9B,MAAI,IAAI,MAAM;AACd,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ;AAAO,WAAO,GAAG;AACf,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,MAAM,EAAE,CAAC;AACb,UAAI;AACJ,aAAO,GAAG;AACR,YAAI,MAAM,EAAE,CAAC;AACb,YAAI,MAAM,EAAE,CAAC;AACb,YAAK,MAAM,KAAK,MAAM,KAAO,MAAM,KAAK,MAAM,GAAI;AAChD,gBAAM,OAAO,GAAG,CAAC;AACjB,gBAAM,OAAO,GAAG,CAAC;AACjB,eAAK;AACL,mBAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AACF;AAEA,SAAS,YAAY,UAAqB;AAExC,MAAI,SAAS,SAAS,GAAG;AACvB,WAAO,CAAC;AAAA,EACV;AAKA,WAAS,KAAK,GAAG;AAEjB,MAAI,IAAI,SAAS,SAAS;AAC1B,QAAM,OAAO,SAAS,CAAC,EAAE;AACzB,QAAM,OAAO,SAAS,CAAC,EAAE;AACzB,MAAI,OAAO,SAAS,CAAC,EAAE;AACvB,MAAI,OAAO;AACX,QAAM,UAAU;AAEhB,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,SAAO,KAAK;AACV,QAAI,SAAS,CAAC,EAAE,IAAI,MAAM;AACxB,aAAO,SAAS,CAAC,EAAE;AAAA,IACrB;AACA,QAAI,SAAS,CAAC,EAAE,IAAI,MAAM;AACxB,aAAO,SAAS,CAAC,EAAE;AAAA,IACrB;AAAA,EACF;AAUA,MAAI,KAAK,OAAO;AAChB,MAAI,KAAK,OAAO;AAChB,QAAM,OAAO,KAAK,KAAK,KAAK;AAC5B,QAAM,QAAQ,OAAO,QAAQ;AAC7B,QAAM,QAAQ,OAAO,QAAQ;AAC7B,QAAM,OAAO;AAAA,IACX,IAAI;AAAA,MACF;AAAA,QACE,YAAY;AAAA,QACZ,GAAG,OAAO,KAAK;AAAA,QACf,GAAG,OAAO;AAAA,MACZ;AAAA,MACA;AAAA,QACE,YAAY;AAAA,QACZ,GAAG;AAAA,QACH,GAAG,OAAO,KAAK;AAAA,MACjB;AAAA,MACA;AAAA,QACE,YAAY;AAAA,QACZ,GAAG,OAAO,KAAK;AAAA,QACf,GAAG,OAAO;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACA,QAAM,SAAS,CAAC;AAChB,QAAM,QAAa,CAAC;AACpB,MAAI;AAGJ,MAAI,SAAS;AACb,SAAO,KAAK;AAIV,UAAM,SAAS;AACf,QAAI,KAAK;AACT,WAAO,KAAK;AAIV,WAAK,SAAS,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE;AAC7B,UAAI,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,EAAE,GAAG;AACjC,eAAO,KAAK,KAAK,CAAC,CAAC;AACnB,aAAK,OAAO,GAAG,CAAC;AAChB;AAAA,MACF;AAGA,WAAK,SAAS,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE;AAC7B,UAAI,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,EAAE,GAAG;AACjC;AAAA,MACF;AAGA,YAAM;AAAA,QACJ,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,MACV;AACA,WAAK,OAAO,GAAG,CAAC;AAAA,IAClB;AAGA,UAAM,KAAK;AAGX,QAAI,MAAM;AACV,WAAO,GAAG;AACR,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,SAAS,CAAC;AAGd,UAAI,EAAE,IAAI,EAAE;AACZ,UAAI,EAAE,IAAI,EAAE;AACZ,UAAI,KAAK,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACxC,UAAI,KAAK,IAAI,CAAC,IAAI,SAAS;AACzB,aAAK,KAAK,IAAI,SAAS,GAAG,GAAG,CAAC,CAAC;AAAA,MACjC;AAAA,IACF;AAAA,EACF;AAIA,QAAM,UAAU,KAAK,MAAM,QAAQ,IAAI;AAEvC,MAAI,OAAO;AACX,SAAO,KAAK;AACV,QACE,OAAO,CAAC,EAAE,EAAE,cACZ,OAAO,CAAC,EAAE,EAAE,cACZ,OAAO,CAAC,EAAE,EAAE,YACZ;AACA,aAAO,OAAO,GAAG,CAAC;AAAA,IACpB;AAAA,EACF;AAEA,SAAO;AACT;AAGA,IAAO,mBAAQ","sourcesContent":["// http://en.wikipedia.org/wiki/Delaunay_triangulation\n// https://github.com/ironwallaby/delaunay\nimport { FeatureCollection, Point, Polygon } from \"geojson\";\nimport { featureCollection, polygon } from \"@turf/helpers\";\n\ninterface Pt {\n x: number;\n y: number;\n z?: number;\n __sentinel?: boolean;\n}\ninterface Vertice {\n x: number;\n y: number;\n}\n\n/*\n Takes a set of {@link Point\|points} and creates a\n * [Triangulated Irregular Network](http://en.wikipedia.org/wiki/Triangulated_irregular_network),\n * or a TIN for short, returned as a collection of Polygons. These are often used\n * for developing elevation contour maps or stepped heat visualizations.\n \n If an optional z-value property is provided then it is added as properties called `a`, `b`,\n * and `c` representing its value at each of the points that represent the corners of the\n * triangle.\n \n @name tin\n * @param {FeatureCollection<Point>} points input points\n * @param {String} [z] name of the property from which to pull z values\n * This is optional: if not given, then there will be no extra data added to the derived triangles.\n * @returns {FeatureCollection<Polygon>} TIN output\n * @example\n * // generate some random point data\n * var points = turf.randomPoint(30, {bbox: [50, 30, 70, 50]});\n \n // add a random property to each point between 0 and 9\n * for (var i = 0; i < points.features.length; i++) {\n * points.features[i].properties.z = ~~(Math.random() * 9);\n * }\n * var tin = turf.tin(points, 'z');\n \n //addToMap\n * var addToMap = [tin, points]\n * for (var i = 0; i < tin.features.length; i++) {\n * var properties = tin.features[i].properties;\n * properties.fill = '#' + properties.a + properties.b + properties.c;\n * }\n /\nfunction tin(\n points: FeatureCollection<Point, any>,\n z?: string\n): FeatureCollection<Polygon> {\n // break down points\n let isPointZ = false;\n return featureCollection(\n triangulate(\n points.features.map((p) => {\n const point: Pt = {\n x: p.geometry.coordinates[0],\n y: p.geometry.coordinates[1],\n };\n if (z) {\n point.z = p.properties[z];\n } else if (p.geometry.coordinates.length === 3) {\n isPointZ = true;\n point.z = p.geometry.coordinates[2];\n }\n return point;\n })\n ).map((triangle: any) => {\n const a = [triangle.a.x, triangle.a.y];\n const b = [triangle.b.x, triangle.b.y];\n const c = [triangle.c.x, triangle.c.y];\n let properties = {};\n\n // Add z coordinates to triangle points if user passed\n // them in that way otherwise add it as a property.\n if (isPointZ) {\n a.push(triangle.a.z);\n b.push(triangle.b.z);\n c.push(triangle.c.z);\n } else {\n properties = {\n a: triangle.a.z,\n b: triangle.b.z,\n c: triangle.c.z,\n };\n }\n\n return polygon([[a, b, c, a]], properties);\n })\n );\n}\n\nclass Triangle {\n public a: Pt;\n public b: Pt;\n public c: Pt;\n public x: number;\n public y: number;\n public r: number;\n\n constructor(a: Pt, b: Pt, c: Pt) {\n this.a = a;\n this.b = b;\n this.c = c;\n\n const A = b.x - a.x;\n const B = b.y - a.y;\n const C = c.x - a.x;\n const D = c.y - a.y;\n const E = A (a.x + b.x) + B * (a.y + b.y);\n const F = C * (a.x + c.x) + D * (a.y + c.y);\n const G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n let dx;\n let dy;\n\n // If the points of the triangle are collinear, then just find the\n // extremes and use the midpoint as the center of the circumcircle.\n this.x = (D * E - B * F) / G;\n this.y = (A * F - C * E) / G;\n dx = this.x - a.x;\n dy = this.y - a.y;\n this.r = dx * dx + dy * dy;\n }\n}\n\nfunction byX(a: Pt, b: Pt) {\n return b.x - a.x;\n}\n\nfunction dedup(edges: number[]) {\n let j = edges.length;\n let a;\n let b;\n let i;\n let m;\n let n;\n\n outer: while (j) {\n b = edges[--j];\n a = edges[--j];\n i = j;\n while (i) {\n n = edges[--i];\n m = edges[--i];\n if ((a === m && b === n) \|\| (a === n && b === m)) {\n edges.splice(j, 2);\n edges.splice(i, 2);\n j -= 2;\n continue outer;\n }\n }\n }\n}\n\nfunction triangulate(vertices: Vertice[]) {\n // Bail if there aren't enough vertices to form any triangles.\n if (vertices.length < 3) {\n return [];\n }\n\n // Ensure the vertex array is in order of descending X coordinate\n // (which is needed to ensure a subquadratic runtime), and then find\n // the bounding box around the points.\n vertices.sort(byX);\n\n let i = vertices.length - 1;\n const xmin = vertices[i].x;\n const xmax = vertices[0].x;\n let ymin = vertices[i].y;\n let ymax = ymin;\n const epsilon = 1e-12;\n\n let a;\n let b;\n let c;\n let A;\n let B;\n let G;\n\n while (i--) {\n if (vertices[i].y < ymin) {\n ymin = vertices[i].y;\n }\n if (vertices[i].y > ymax) {\n ymax = vertices[i].y;\n }\n }\n\n // Find a supertriangle, which is a triangle that surrounds all the\n // vertices. This is used like something of a sentinel value to remove\n // cases in the main algorithm, and is removed before we return any\n // results.\n\n // Once found, put it in the \"open\" list. (The \"open\" list is for\n // triangles who may still need to be considered; the \"closed\" list is\n // for triangles which do not.)\n let dx = xmax - xmin;\n let dy = ymax - ymin;\n const dmax = dx > dy ? dx : dy;\n const xmid = (xmax + xmin) * 0.5;\n const ymid = (ymax + ymin) * 0.5;\n const open = [\n new Triangle(\n {\n __sentinel: true,\n x: xmid - 20 * dmax,\n y: ymid - dmax,\n },\n {\n __sentinel: true,\n x: xmid,\n y: ymid + 20 * dmax,\n },\n {\n __sentinel: true,\n x: xmid + 20 * dmax,\n y: ymid - dmax,\n }\n ),\n ];\n const closed = [];\n const edges: any = [];\n let j;\n\n // Incrementally add each vertex to the mesh.\n i = vertices.length;\n while (i--) {\n // For each open triangle, check to see if the current point is\n // inside it's circumcircle. If it is, remove the triangle and add\n // it's edges to an edge list.\n edges.length = 0;\n j = open.length;\n while (j--) {\n // If this point is to the right of this triangle's circumcircle,\n // then this triangle should never get checked again. Remove it\n // from the open list, add it to the closed list, and skip.\n dx = vertices[i].x - open[j].x;\n if (dx > 0 && dx * dx > open[j].r) {\n closed.push(open[j]);\n open.splice(j, 1);\n continue;\n }\n\n // If not, skip this triangle.\n dy = vertices[i].y - open[j].y;\n if (dx * dx + dy * dy > open[j].r) {\n continue;\n }\n\n // Remove the triangle and add it's edges to the edge list.\n edges.push(\n open[j].a,\n open[j].b,\n open[j].b,\n open[j].c,\n open[j].c,\n open[j].a\n );\n open.splice(j, 1);\n }\n\n // Remove any doubled edges.\n dedup(edges);\n\n // Add a new triangle for each edge.\n j = edges.length;\n while (j) {\n b = edges[--j];\n a = edges[--j];\n c = vertices[i];\n // Avoid adding colinear triangles (which have error-prone\n // circumcircles)\n A = b.x - a.x;\n B = b.y - a.y;\n G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n if (Math.abs(G) > epsilon) {\n open.push(new Triangle(a, b, c));\n }\n }\n }\n\n // Copy any remaining open triangles to the closed list, and then\n // remove any triangles that share a vertex with the supertriangle.\n Array.prototype.push.apply(closed, open);\n\n i = closed.length;\n while (i--) {\n if (\n closed[i].a.__sentinel \|\|\n closed[i].b.__sentinel \|\|\n closed[i].c.__sentinel\n ) {\n closed.splice(i, 1);\n }\n }\n\n return closed;\n}\n\nexport { Pt, Vertice, tin };\nexport default tin;\n"]}
1	+ {"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-tin/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACGA,wCAA2C;AA6C3C,SAAS,GAAA,CACP,MAAA,EACA,CAAA,EAC4B;AAE5B,EAAA,IAAI,SAAA,EAAW,KAAA;AACf,EAAA,OAAO,wCAAA;AAAA,IACL,WAAA;AAAA,MACE,MAAA,CAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,EAAA,GAAM;AACzB,QAAA,MAAM,MAAA,EAAY;AAAA,UAChB,CAAA,EAAG,CAAA,CAAE,QAAA,CAAS,WAAA,CAAY,CAAC,CAAA;AAAA,UAC3B,CAAA,EAAG,CAAA,CAAE,QAAA,CAAS,WAAA,CAAY,CAAC;AAAA,QAC7B,CAAA;AACA,QAAA,GAAA,CAAI,CAAA,EAAG;AACL,UAAA,KAAA,CAAM,EAAA,EAAI,CAAA,CAAE,UAAA,CAAW,CAAC,CAAA;AAAA,QAC1B,EAAA,KAAA,GAAA,CAAW,CAAA,CAAE,QAAA,CAAS,WAAA,CAAY,OAAA,IAAW,CAAA,EAAG;AAC9C,UAAA,SAAA,EAAW,IAAA;AACX,UAAA,KAAA,CAAM,EAAA,EAAI,CAAA,CAAE,QAAA,CAAS,WAAA,CAAY,CAAC,CAAA;AAAA,QACpC;AACA,QAAA,OAAO,KAAA;AAAA,MACT,CAAC;AAAA,IACH,CAAA,CAAE,GAAA,CAAI,CAAC,QAAA,EAAA,GAAkB;AACvB,MAAA,MAAM,EAAA,EAAI,CAAC,QAAA,CAAS,CAAA,CAAE,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACrC,MAAA,MAAM,EAAA,EAAI,CAAC,QAAA,CAAS,CAAA,CAAE,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACrC,MAAA,MAAM,EAAA,EAAI,CAAC,QAAA,CAAS,CAAA,CAAE,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACrC,MAAA,IAAI,WAAA,EAAa,CAAC,CAAA;AAIlB,MAAA,GAAA,CAAI,QAAA,EAAU;AACZ,QAAA,CAAA,CAAE,IAAA,CAAK,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACnB,QAAA,CAAA,CAAE,IAAA,CAAK,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AACnB,QAAA,CAAA,CAAE,IAAA,CAAK,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA;AAAA,MACrB,EAAA,KAAO;AACL,QAAA,WAAA,EAAa;AAAA,UACX,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAA;AAAA,UACd,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE,CAAA;AAAA,UACd,CAAA,EAAG,QAAA,CAAS,CAAA,CAAE;AAAA,QAChB,CAAA;AAAA,MACF;AAEA,MAAA,OAAO,8BAAA,CAAS,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAC,CAAA,EAAG,UAAU,CAAA;AAAA,IAC3C,CAAC;AAAA,EACH,CAAA;AACF;AAEA,IAAM,SAAA,EAAN,MAAe;AAAA,EAQb,WAAA,CAAY,CAAA,EAAO,CAAA,EAAO,CAAA,EAAO;AAC/B,IAAA,IAAA,CAAK,EAAA,EAAI,CAAA;AACT,IAAA,IAAA,CAAK,EAAA,EAAI,CAAA;AACT,IAAA,IAAA,CAAK,EAAA,EAAI,CAAA;AAET,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AAClB,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AAClB,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AAClB,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AAClB,IAAA,MAAM,EAAA,EAAI,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,EAAA,EAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,CAAA;AACzC,IAAA,MAAM,EAAA,EAAI,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,EAAA,EAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,CAAA;AACzC,IAAA,MAAM,EAAA,EAAI,EAAA,EAAA,CAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,EAAA,EAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,CAAA,CAAA;AAC9C,IAAA,IAAI,EAAA;AACJ,IAAA,IAAI,EAAA;AAIJ,IAAA,IAAA,CAAK,EAAA,EAAA,CAAK,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,CAAA,EAAA,EAAK,CAAA;AAC3B,IAAA,IAAA,CAAK,EAAA,EAAA,CAAK,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,CAAA,EAAA,EAAK,CAAA;AAC3B,IAAA,GAAA,EAAK,IAAA,CAAK,EAAA,EAAI,CAAA,CAAE,CAAA;AAChB,IAAA,GAAA,EAAK,IAAA,CAAK,EAAA,EAAI,CAAA,CAAE,CAAA;AAChB,IAAA,IAAA,CAAK,EAAA,EAAI,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,EAAA;AAAA,EAC1B;AACF,CAAA;AAEA,SAAS,GAAA,CAAI,CAAA,EAAO,CAAA,EAAO;AACzB,EAAA,OAAO,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AACjB;AAEA,SAAS,KAAA,CAAM,KAAA,EAAiB;AAC9B,EAAA,IAAI,EAAA,EAAI,KAAA,CAAM,MAAA;AACd,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AAEJ,EAAA,KAAA,EAAO,MAAA,CAAO,CAAA,EAAG;AACf,IAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,IAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,IAAA,EAAA,EAAI,CAAA;AACJ,IAAA,MAAA,CAAO,CAAA,EAAG;AACR,MAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,MAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,MAAA,GAAA,CAAK,EAAA,IAAM,EAAA,GAAK,EAAA,IAAM,EAAA,GAAO,EAAA,IAAM,EAAA,GAAK,EAAA,IAAM,CAAA,EAAI;AAChD,QAAA,KAAA,CAAM,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AACjB,QAAA,KAAA,CAAM,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AACjB,QAAA,EAAA,GAAK,CAAA;AACL,QAAA,SAAS,KAAA;AAAA,MACX;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,WAAA,CAAY,QAAA,EAAqB;AAExC,EAAA,GAAA,CAAI,QAAA,CAAS,OAAA,EAAS,CAAA,EAAG;AACvB,IAAA,OAAO,CAAC,CAAA;AAAA,EACV;AAKA,EAAA,QAAA,CAAS,IAAA,CAAK,GAAG,CAAA;AAEjB,EAAA,IAAI,EAAA,EAAI,QAAA,CAAS,OAAA,EAAS,CAAA;AAC1B,EAAA,MAAM,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AACzB,EAAA,MAAM,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AACzB,EAAA,IAAI,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AACvB,EAAA,IAAI,KAAA,EAAO,IAAA;AACX,EAAA,MAAM,QAAA,EAAU,KAAA;AAEhB,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,CAAA;AAEJ,EAAA,MAAA,CAAO,CAAA,EAAA,EAAK;AACV,IAAA,GAAA,CAAI,QAAA,CAAS,CAAC,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM;AACxB,MAAA,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AAAA,IACrB;AACA,IAAA,GAAA,CAAI,QAAA,CAAS,CAAC,CAAA,CAAE,EAAA,EAAI,IAAA,EAAM;AACxB,MAAA,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,CAAA;AAAA,IACrB;AAAA,EACF;AAUA,EAAA,IAAI,GAAA,EAAK,KAAA,EAAO,IAAA;AAChB,EAAA,IAAI,GAAA,EAAK,KAAA,EAAO,IAAA;AAChB,EAAA,MAAM,KAAA,EAAO,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,EAAA;AAC5B,EAAA,MAAM,KAAA,EAAA,CAAQ,KAAA,EAAO,IAAA,EAAA,EAAQ,GAAA;AAC7B,EAAA,MAAM,KAAA,EAAA,CAAQ,KAAA,EAAO,IAAA,EAAA,EAAQ,GAAA;AAC7B,EAAA,MAAM,KAAA,EAAO;AAAA,IACX,IAAI,QAAA;AAAA,MACF;AAAA,QACE,UAAA,EAAY,IAAA;AAAA,QACZ,CAAA,EAAG,KAAA,EAAO,GAAA,EAAK,IAAA;AAAA,QACf,CAAA,EAAG,KAAA,EAAO;AAAA,MACZ,CAAA;AAAA,MACA;AAAA,QACE,UAAA,EAAY,IAAA;AAAA,QACZ,CAAA,EAAG,IAAA;AAAA,QACH,CAAA,EAAG,KAAA,EAAO,GAAA,EAAK;AAAA,MACjB,CAAA;AAAA,MACA;AAAA,QACE,UAAA,EAAY,IAAA;AAAA,QACZ,CAAA,EAAG,KAAA,EAAO,GAAA,EAAK,IAAA;AAAA,QACf,CAAA,EAAG,KAAA,EAAO;AAAA,MACZ;AAAA,IACF;AAAA,EACF,CAAA;AACA,EAAA,MAAM,OAAA,EAAS,CAAC,CAAA;AAChB,EAAA,MAAM,MAAA,EAAa,CAAC,CAAA;AACpB,EAAA,IAAI,CAAA;AAGJ,EAAA,EAAA,EAAI,QAAA,CAAS,MAAA;AACb,EAAA,MAAA,CAAO,CAAA,EAAA,EAAK;AAIV,IAAA,KAAA,CAAM,OAAA,EAAS,CAAA;AACf,IAAA,EAAA,EAAI,IAAA,CAAK,MAAA;AACT,IAAA,MAAA,CAAO,CAAA,EAAA,EAAK;AAIV,MAAA,GAAA,EAAK,QAAA,CAAS,CAAC,CAAA,CAAE,EAAA,EAAI,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAC7B,MAAA,GAAA,CAAI,GAAA,EAAK,EAAA,GAAK,GAAA,EAAK,GAAA,EAAK,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA,EAAG;AACjC,QAAA,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;AACnB,QAAA,IAAA,CAAK,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AAChB,QAAA,QAAA;AAAA,MACF;AAGA,MAAA,GAAA,EAAK,QAAA,CAAS,CAAC,CAAA,CAAE,EAAA,EAAI,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAC7B,MAAA,GAAA,CAAI,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA,EAAG;AACjC,QAAA,QAAA;AAAA,MACF;AAGA,MAAA,KAAA,CAAM,IAAA;AAAA,QACJ,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE,CAAA;AAAA,QACR,IAAA,CAAK,CAAC,CAAA,CAAE;AAAA,MACV,CAAA;AACA,MAAA,IAAA,CAAK,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AAAA,IAClB;AAGA,IAAA,KAAA,CAAM,KAAK,CAAA;AAGX,IAAA,EAAA,EAAI,KAAA,CAAM,MAAA;AACV,IAAA,MAAA,CAAO,CAAA,EAAG;AACR,MAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,MAAA,EAAA,EAAI,KAAA,CAAM,EAAE,CAAC,CAAA;AACb,MAAA,EAAA,EAAI,QAAA,CAAS,CAAC,CAAA;AAGd,MAAA,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AACZ,MAAA,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA;AACZ,MAAA,EAAA,EAAI,EAAA,EAAA,CAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,EAAA,EAAK,EAAA,EAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,CAAA,CAAA,CAAA;AACxC,MAAA,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,CAAC,EAAA,EAAI,OAAA,EAAS;AACzB,QAAA,IAAA,CAAK,IAAA,CAAK,IAAI,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,MACjC;AAAA,IACF;AAAA,EACF;AAIA,EAAA,KAAA,CAAM,SAAA,CAAU,IAAA,CAAK,KAAA,CAAM,MAAA,EAAQ,IAAI,CAAA;AAEvC,EAAA,EAAA,EAAI,MAAA,CAAO,MAAA;AACX,EAAA,MAAA,CAAO,CAAA,EAAA,EAAK;AACV,IAAA,GAAA,CACE,MAAA,CAAO,CAAC,CAAA,CAAE,CAAA,CAAE,WAAA,GACZ,MAAA,CAAO,CAAC,CAAA,CAAE,CAAA,CAAE,WAAA,GACZ,MAAA,CAAO,CAAC,CAAA,CAAE,CAAA,CAAE,UAAA,EACZ;AACA,MAAA,MAAA,CAAO,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;AAAA,IACpB;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAGA,IAAO,iBAAA,EAAQ,GAAA;ADnHf;AACE;AACA;AACF,sDAAC","file":"/home/runner/work/turf/turf/packages/turf-tin/dist/cjs/index.cjs","sourcesContent":[null,"// http://en.wikipedia.org/wiki/Delaunay_triangulation\n// https://github.com/ironwallaby/delaunay\nimport { FeatureCollection, Point, Polygon } from \"geojson\";\nimport { featureCollection, polygon } from \"@turf/helpers\";\n\ninterface Pt {\n x: number;\n y: number;\n z?: number;\n __sentinel?: boolean;\n}\ninterface Vertice {\n x: number;\n y: number;\n}\n\n/*\n Takes a set of {@link Point\|points} and creates a\n * [Triangulated Irregular Network](http://en.wikipedia.org/wiki/Triangulated_irregular_network),\n * or a TIN for short, returned as a collection of Polygons. These are often used\n * for developing elevation contour maps or stepped heat visualizations.\n \n If an optional z-value property is provided then it is added as properties called `a`, `b`,\n * and `c` representing its value at each of the points that represent the corners of the\n * triangle.\n \n @function\n * @param {FeatureCollection<Point>} points input points\n * @param {String} [z] name of the property from which to pull z values\n * This is optional: if not given, then there will be no extra data added to the derived triangles.\n * @returns {FeatureCollection<Polygon>} TIN output\n * @example\n * // generate some random point data\n * var points = turf.randomPoint(30, {bbox: [50, 30, 70, 50]});\n \n // add a random property to each point between 0 and 9\n * for (var i = 0; i < points.features.length; i++) {\n * points.features[i].properties.z = ~~(Math.random() * 9);\n * }\n * var tin = turf.tin(points, 'z');\n \n //addToMap\n * var addToMap = [tin, points]\n * for (var i = 0; i < tin.features.length; i++) {\n * var properties = tin.features[i].properties;\n * properties.fill = '#' + properties.a + properties.b + properties.c;\n * }\n /\nfunction tin(\n points: FeatureCollection<Point, any>,\n z?: string\n): FeatureCollection<Polygon> {\n // break down points\n let isPointZ = false;\n return featureCollection(\n triangulate(\n points.features.map((p) => {\n const point: Pt = {\n x: p.geometry.coordinates[0],\n y: p.geometry.coordinates[1],\n };\n if (z) {\n point.z = p.properties[z];\n } else if (p.geometry.coordinates.length === 3) {\n isPointZ = true;\n point.z = p.geometry.coordinates[2];\n }\n return point;\n })\n ).map((triangle: any) => {\n const a = [triangle.a.x, triangle.a.y];\n const b = [triangle.b.x, triangle.b.y];\n const c = [triangle.c.x, triangle.c.y];\n let properties = {};\n\n // Add z coordinates to triangle points if user passed\n // them in that way otherwise add it as a property.\n if (isPointZ) {\n a.push(triangle.a.z);\n b.push(triangle.b.z);\n c.push(triangle.c.z);\n } else {\n properties = {\n a: triangle.a.z,\n b: triangle.b.z,\n c: triangle.c.z,\n };\n }\n\n return polygon([[a, b, c, a]], properties);\n })\n );\n}\n\nclass Triangle {\n public a: Pt;\n public b: Pt;\n public c: Pt;\n public x: number;\n public y: number;\n public r: number;\n\n constructor(a: Pt, b: Pt, c: Pt) {\n this.a = a;\n this.b = b;\n this.c = c;\n\n const A = b.x - a.x;\n const B = b.y - a.y;\n const C = c.x - a.x;\n const D = c.y - a.y;\n const E = A (a.x + b.x) + B * (a.y + b.y);\n const F = C * (a.x + c.x) + D * (a.y + c.y);\n const G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n let dx;\n let dy;\n\n // If the points of the triangle are collinear, then just find the\n // extremes and use the midpoint as the center of the circumcircle.\n this.x = (D * E - B * F) / G;\n this.y = (A * F - C * E) / G;\n dx = this.x - a.x;\n dy = this.y - a.y;\n this.r = dx * dx + dy * dy;\n }\n}\n\nfunction byX(a: Pt, b: Pt) {\n return b.x - a.x;\n}\n\nfunction dedup(edges: number[]) {\n let j = edges.length;\n let a;\n let b;\n let i;\n let m;\n let n;\n\n outer: while (j) {\n b = edges[--j];\n a = edges[--j];\n i = j;\n while (i) {\n n = edges[--i];\n m = edges[--i];\n if ((a === m && b === n) \|\| (a === n && b === m)) {\n edges.splice(j, 2);\n edges.splice(i, 2);\n j -= 2;\n continue outer;\n }\n }\n }\n}\n\nfunction triangulate(vertices: Vertice[]) {\n // Bail if there aren't enough vertices to form any triangles.\n if (vertices.length < 3) {\n return [];\n }\n\n // Ensure the vertex array is in order of descending X coordinate\n // (which is needed to ensure a subquadratic runtime), and then find\n // the bounding box around the points.\n vertices.sort(byX);\n\n let i = vertices.length - 1;\n const xmin = vertices[i].x;\n const xmax = vertices[0].x;\n let ymin = vertices[i].y;\n let ymax = ymin;\n const epsilon = 1e-12;\n\n let a;\n let b;\n let c;\n let A;\n let B;\n let G;\n\n while (i--) {\n if (vertices[i].y < ymin) {\n ymin = vertices[i].y;\n }\n if (vertices[i].y > ymax) {\n ymax = vertices[i].y;\n }\n }\n\n // Find a supertriangle, which is a triangle that surrounds all the\n // vertices. This is used like something of a sentinel value to remove\n // cases in the main algorithm, and is removed before we return any\n // results.\n\n // Once found, put it in the \"open\" list. (The \"open\" list is for\n // triangles who may still need to be considered; the \"closed\" list is\n // for triangles which do not.)\n let dx = xmax - xmin;\n let dy = ymax - ymin;\n const dmax = dx > dy ? dx : dy;\n const xmid = (xmax + xmin) * 0.5;\n const ymid = (ymax + ymin) * 0.5;\n const open = [\n new Triangle(\n {\n __sentinel: true,\n x: xmid - 20 * dmax,\n y: ymid - dmax,\n },\n {\n __sentinel: true,\n x: xmid,\n y: ymid + 20 * dmax,\n },\n {\n __sentinel: true,\n x: xmid + 20 * dmax,\n y: ymid - dmax,\n }\n ),\n ];\n const closed = [];\n const edges: any = [];\n let j;\n\n // Incrementally add each vertex to the mesh.\n i = vertices.length;\n while (i--) {\n // For each open triangle, check to see if the current point is\n // inside it's circumcircle. If it is, remove the triangle and add\n // it's edges to an edge list.\n edges.length = 0;\n j = open.length;\n while (j--) {\n // If this point is to the right of this triangle's circumcircle,\n // then this triangle should never get checked again. Remove it\n // from the open list, add it to the closed list, and skip.\n dx = vertices[i].x - open[j].x;\n if (dx > 0 && dx * dx > open[j].r) {\n closed.push(open[j]);\n open.splice(j, 1);\n continue;\n }\n\n // If not, skip this triangle.\n dy = vertices[i].y - open[j].y;\n if (dx * dx + dy * dy > open[j].r) {\n continue;\n }\n\n // Remove the triangle and add it's edges to the edge list.\n edges.push(\n open[j].a,\n open[j].b,\n open[j].b,\n open[j].c,\n open[j].c,\n open[j].a\n );\n open.splice(j, 1);\n }\n\n // Remove any doubled edges.\n dedup(edges);\n\n // Add a new triangle for each edge.\n j = edges.length;\n while (j) {\n b = edges[--j];\n a = edges[--j];\n c = vertices[i];\n // Avoid adding colinear triangles (which have error-prone\n // circumcircles)\n A = b.x - a.x;\n B = b.y - a.y;\n G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n if (Math.abs(G) > epsilon) {\n open.push(new Triangle(a, b, c));\n }\n }\n }\n\n // Copy any remaining open triangles to the closed list, and then\n // remove any triangles that share a vertex with the supertriangle.\n Array.prototype.push.apply(closed, open);\n\n i = closed.length;\n while (i--) {\n if (\n closed[i].a.__sentinel \|\|\n closed[i].b.__sentinel \|\|\n closed[i].c.__sentinel\n ) {\n closed.splice(i, 1);\n }\n }\n\n return closed;\n}\n\nexport { Pt, Vertice, tin };\nexport default tin;\n"]}

package/node_modules/@turf/tin/dist/cjs/index.d.cts CHANGED Viewed

@@ -20,7 +20,7 @@ interface Vertice {
  * and `c` representing its value at each of the points that represent the corners of the
  * triangle.
  *
- * @name tin
+ * @function
  * @param {FeatureCollection<Point>} points input points
  * @param {String} [z] name of the property from which to pull z values
  * This is optional: if not given, then there will be no extra data added to the derived triangles.

package/node_modules/@turf/tin/dist/esm/index.d.ts CHANGED Viewed

@@ -20,7 +20,7 @@ interface Vertice {
  * and `c` representing its value at each of the points that represent the corners of the
  * triangle.
  *
- * @name tin
+ * @function
  * @param {FeatureCollection<Point>} points input points
  * @param {String} [z] name of the property from which to pull z values
  * This is optional: if not given, then there will be no extra data added to the derived triangles.

package/node_modules/@turf/tin/dist/esm/index.js CHANGED Viewed

@@ -68,22 +68,21 @@ function dedup(edges) {
   let i;
   let m;
   let n;
-  outer:
-    while (j) {
-      b = edges[--j];
-      a = edges[--j];
-      i = j;
-      while (i) {
-        n = edges[--i];
-        m = edges[--i];
-        if (a === m && b === n || a === n && b === m) {
-          edges.splice(j, 2);
-          edges.splice(i, 2);
-          j -= 2;
-          continue outer;
-        }
+  outer: while (j) {
+    b = edges[--j];
+    a = edges[--j];
+    i = j;
+    while (i) {
+      n = edges[--i];
+      m = edges[--i];
+      if (a === m && b === n || a === n && b === m) {
+        edges.splice(j, 2);
+        edges.splice(i, 2);
+        j -= 2;
+        continue outer;
       }
     }
+  }
 }
 function triangulate(vertices) {
   if (vertices.length < 3) {

package/node_modules/@turf/tin/dist/esm/index.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../../index.ts"],"sourcesContent":["// http://en.wikipedia.org/wiki/Delaunay_triangulation\n// https://github.com/ironwallaby/delaunay\nimport { FeatureCollection, Point, Polygon } from \"geojson\";\nimport { featureCollection, polygon } from \"@turf/helpers\";\n\ninterface Pt {\n x: number;\n y: number;\n z?: number;\n __sentinel?: boolean;\n}\ninterface Vertice {\n x: number;\n y: number;\n}\n\n/*\n Takes a set of {@link Point\|points} and creates a\n * [Triangulated Irregular Network](http://en.wikipedia.org/wiki/Triangulated_irregular_network),\n * or a TIN for short, returned as a collection of Polygons. These are often used\n * for developing elevation contour maps or stepped heat visualizations.\n \n If an optional z-value property is provided then it is added as properties called `a`, `b`,\n * and `c` representing its value at each of the points that represent the corners of the\n * triangle.\n \n @name tin\n * @param {FeatureCollection<Point>} points input points\n * @param {String} [z] name of the property from which to pull z values\n * This is optional: if not given, then there will be no extra data added to the derived triangles.\n * @returns {FeatureCollection<Polygon>} TIN output\n * @example\n * // generate some random point data\n * var points = turf.randomPoint(30, {bbox: [50, 30, 70, 50]});\n \n // add a random property to each point between 0 and 9\n * for (var i = 0; i < points.features.length; i++) {\n * points.features[i].properties.z = ~~(Math.random() * 9);\n * }\n * var tin = turf.tin(points, 'z');\n \n //addToMap\n * var addToMap = [tin, points]\n * for (var i = 0; i < tin.features.length; i++) {\n * var properties = tin.features[i].properties;\n * properties.fill = '#' + properties.a + properties.b + properties.c;\n * }\n /\nfunction tin(\n points: FeatureCollection<Point, any>,\n z?: string\n): FeatureCollection<Polygon> {\n // break down points\n let isPointZ = false;\n return featureCollection(\n triangulate(\n points.features.map((p) => {\n const point: Pt = {\n x: p.geometry.coordinates[0],\n y: p.geometry.coordinates[1],\n };\n if (z) {\n point.z = p.properties[z];\n } else if (p.geometry.coordinates.length === 3) {\n isPointZ = true;\n point.z = p.geometry.coordinates[2];\n }\n return point;\n })\n ).map((triangle: any) => {\n const a = [triangle.a.x, triangle.a.y];\n const b = [triangle.b.x, triangle.b.y];\n const c = [triangle.c.x, triangle.c.y];\n let properties = {};\n\n // Add z coordinates to triangle points if user passed\n // them in that way otherwise add it as a property.\n if (isPointZ) {\n a.push(triangle.a.z);\n b.push(triangle.b.z);\n c.push(triangle.c.z);\n } else {\n properties = {\n a: triangle.a.z,\n b: triangle.b.z,\n c: triangle.c.z,\n };\n }\n\n return polygon([[a, b, c, a]], properties);\n })\n );\n}\n\nclass Triangle {\n public a: Pt;\n public b: Pt;\n public c: Pt;\n public x: number;\n public y: number;\n public r: number;\n\n constructor(a: Pt, b: Pt, c: Pt) {\n this.a = a;\n this.b = b;\n this.c = c;\n\n const A = b.x - a.x;\n const B = b.y - a.y;\n const C = c.x - a.x;\n const D = c.y - a.y;\n const E = A (a.x + b.x) + B * (a.y + b.y);\n const F = C * (a.x + c.x) + D * (a.y + c.y);\n const G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n let dx;\n let dy;\n\n // If the points of the triangle are collinear, then just find the\n // extremes and use the midpoint as the center of the circumcircle.\n this.x = (D * E - B * F) / G;\n this.y = (A * F - C * E) / G;\n dx = this.x - a.x;\n dy = this.y - a.y;\n this.r = dx * dx + dy * dy;\n }\n}\n\nfunction byX(a: Pt, b: Pt) {\n return b.x - a.x;\n}\n\nfunction dedup(edges: number[]) {\n let j = edges.length;\n let a;\n let b;\n let i;\n let m;\n let n;\n\n outer: while (j) {\n b = edges[--j];\n a = edges[--j];\n i = j;\n while (i) {\n n = edges[--i];\n m = edges[--i];\n if ((a === m && b === n) \|\| (a === n && b === m)) {\n edges.splice(j, 2);\n edges.splice(i, 2);\n j -= 2;\n continue outer;\n }\n }\n }\n}\n\nfunction triangulate(vertices: Vertice[]) {\n // Bail if there aren't enough vertices to form any triangles.\n if (vertices.length < 3) {\n return [];\n }\n\n // Ensure the vertex array is in order of descending X coordinate\n // (which is needed to ensure a subquadratic runtime), and then find\n // the bounding box around the points.\n vertices.sort(byX);\n\n let i = vertices.length - 1;\n const xmin = vertices[i].x;\n const xmax = vertices[0].x;\n let ymin = vertices[i].y;\n let ymax = ymin;\n const epsilon = 1e-12;\n\n let a;\n let b;\n let c;\n let A;\n let B;\n let G;\n\n while (i--) {\n if (vertices[i].y < ymin) {\n ymin = vertices[i].y;\n }\n if (vertices[i].y > ymax) {\n ymax = vertices[i].y;\n }\n }\n\n // Find a supertriangle, which is a triangle that surrounds all the\n // vertices. This is used like something of a sentinel value to remove\n // cases in the main algorithm, and is removed before we return any\n // results.\n\n // Once found, put it in the \"open\" list. (The \"open\" list is for\n // triangles who may still need to be considered; the \"closed\" list is\n // for triangles which do not.)\n let dx = xmax - xmin;\n let dy = ymax - ymin;\n const dmax = dx > dy ? dx : dy;\n const xmid = (xmax + xmin) * 0.5;\n const ymid = (ymax + ymin) * 0.5;\n const open = [\n new Triangle(\n {\n __sentinel: true,\n x: xmid - 20 * dmax,\n y: ymid - dmax,\n },\n {\n __sentinel: true,\n x: xmid,\n y: ymid + 20 * dmax,\n },\n {\n __sentinel: true,\n x: xmid + 20 * dmax,\n y: ymid - dmax,\n }\n ),\n ];\n const closed = [];\n const edges: any = [];\n let j;\n\n // Incrementally add each vertex to the mesh.\n i = vertices.length;\n while (i--) {\n // For each open triangle, check to see if the current point is\n // inside it's circumcircle. If it is, remove the triangle and add\n // it's edges to an edge list.\n edges.length = 0;\n j = open.length;\n while (j--) {\n // If this point is to the right of this triangle's circumcircle,\n // then this triangle should never get checked again. Remove it\n // from the open list, add it to the closed list, and skip.\n dx = vertices[i].x - open[j].x;\n if (dx > 0 && dx * dx > open[j].r) {\n closed.push(open[j]);\n open.splice(j, 1);\n continue;\n }\n\n // If not, skip this triangle.\n dy = vertices[i].y - open[j].y;\n if (dx * dx + dy * dy > open[j].r) {\n continue;\n }\n\n // Remove the triangle and add it's edges to the edge list.\n edges.push(\n open[j].a,\n open[j].b,\n open[j].b,\n open[j].c,\n open[j].c,\n open[j].a\n );\n open.splice(j, 1);\n }\n\n // Remove any doubled edges.\n dedup(edges);\n\n // Add a new triangle for each edge.\n j = edges.length;\n while (j) {\n b = edges[--j];\n a = edges[--j];\n c = vertices[i];\n // Avoid adding colinear triangles (which have error-prone\n // circumcircles)\n A = b.x - a.x;\n B = b.y - a.y;\n G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n if (Math.abs(G) > epsilon) {\n open.push(new Triangle(a, b, c));\n }\n }\n }\n\n // Copy any remaining open triangles to the closed list, and then\n // remove any triangles that share a vertex with the supertriangle.\n Array.prototype.push.apply(closed, open);\n\n i = closed.length;\n while (i--) {\n if (\n closed[i].a.__sentinel \|\|\n closed[i].b.__sentinel \|\|\n closed[i].c.__sentinel\n ) {\n closed.splice(i, 1);\n }\n }\n\n return closed;\n}\n\nexport { Pt, Vertice, tin };\nexport default tin;\n"],"mappings":";AAGA,SAAS,mBAAmB,eAAe;AA6C3C,SAAS,IACP,QACA,GAC4B;AAE5B,MAAI,WAAW;AACf,SAAO;AAAA,IACL;AAAA,MACE,OAAO,SAAS,IAAI,CAAC,MAAM;AACzB,cAAM,QAAY;AAAA,UAChB,GAAG,EAAE,SAAS,YAAY,CAAC;AAAA,UAC3B,GAAG,EAAE,SAAS,YAAY,CAAC;AAAA,QAC7B;AACA,YAAI,GAAG;AACL,gBAAM,IAAI,EAAE,WAAW,CAAC;AAAA,QAC1B,WAAW,EAAE,SAAS,YAAY,WAAW,GAAG;AAC9C,qBAAW;AACX,gBAAM,IAAI,EAAE,SAAS,YAAY,CAAC;AAAA,QACpC;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH,EAAE,IAAI,CAAC,aAAkB;AACvB,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,UAAI,aAAa,CAAC;AAIlB,UAAI,UAAU;AACZ,UAAE,KAAK,SAAS,EAAE,CAAC;AACnB,UAAE,KAAK,SAAS,EAAE,CAAC;AACnB,UAAE,KAAK,SAAS,EAAE,CAAC;AAAA,MACrB,OAAO;AACL,qBAAa;AAAA,UACX,GAAG,SAAS,EAAE;AAAA,UACd,GAAG,SAAS,EAAE;AAAA,UACd,GAAG,SAAS,EAAE;AAAA,QAChB;AAAA,MACF;AAEA,aAAO,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,UAAU;AAAA,IAC3C,CAAC;AAAA,EACH;AACF;AAEA,IAAM,WAAN,MAAe;AAAA,EAQb,YAAY,GAAO,GAAO,GAAO;AAC/B,SAAK,IAAI;AACT,SAAK,IAAI;AACT,SAAK,IAAI;AAET,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACzC,UAAM,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACzC,UAAM,IAAI,KAAK,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AAC9C,QAAI;AACJ,QAAI;AAIJ,SAAK,KAAK,IAAI,IAAI,IAAI,KAAK;AAC3B,SAAK,KAAK,IAAI,IAAI,IAAI,KAAK;AAC3B,SAAK,KAAK,IAAI,EAAE;AAChB,SAAK,KAAK,IAAI,EAAE;AAChB,SAAK,IAAI,KAAK,KAAK,KAAK;AAAA,EAC1B;AACF;AAEA,SAAS,IAAI,GAAO,GAAO;AACzB,SAAO,EAAE,IAAI,EAAE;AACjB;AAEA,SAAS,MAAM,OAAiB;AAC9B,MAAI,IAAI,MAAM;AACd,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ;AAAO,WAAO,GAAG;AACf,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,MAAM,EAAE,CAAC;AACb,UAAI;AACJ,aAAO,GAAG;AACR,YAAI,MAAM,EAAE,CAAC;AACb,YAAI,MAAM,EAAE,CAAC;AACb,YAAK,MAAM,KAAK,MAAM,KAAO,MAAM,KAAK,MAAM,GAAI;AAChD,gBAAM,OAAO,GAAG,CAAC;AACjB,gBAAM,OAAO,GAAG,CAAC;AACjB,eAAK;AACL,mBAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AACF;AAEA,SAAS,YAAY,UAAqB;AAExC,MAAI,SAAS,SAAS,GAAG;AACvB,WAAO,CAAC;AAAA,EACV;AAKA,WAAS,KAAK,GAAG;AAEjB,MAAI,IAAI,SAAS,SAAS;AAC1B,QAAM,OAAO,SAAS,CAAC,EAAE;AACzB,QAAM,OAAO,SAAS,CAAC,EAAE;AACzB,MAAI,OAAO,SAAS,CAAC,EAAE;AACvB,MAAI,OAAO;AACX,QAAM,UAAU;AAEhB,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,SAAO,KAAK;AACV,QAAI,SAAS,CAAC,EAAE,IAAI,MAAM;AACxB,aAAO,SAAS,CAAC,EAAE;AAAA,IACrB;AACA,QAAI,SAAS,CAAC,EAAE,IAAI,MAAM;AACxB,aAAO,SAAS,CAAC,EAAE;AAAA,IACrB;AAAA,EACF;AAUA,MAAI,KAAK,OAAO;AAChB,MAAI,KAAK,OAAO;AAChB,QAAM,OAAO,KAAK,KAAK,KAAK;AAC5B,QAAM,QAAQ,OAAO,QAAQ;AAC7B,QAAM,QAAQ,OAAO,QAAQ;AAC7B,QAAM,OAAO;AAAA,IACX,IAAI;AAAA,MACF;AAAA,QACE,YAAY;AAAA,QACZ,GAAG,OAAO,KAAK;AAAA,QACf,GAAG,OAAO;AAAA,MACZ;AAAA,MACA;AAAA,QACE,YAAY;AAAA,QACZ,GAAG;AAAA,QACH,GAAG,OAAO,KAAK;AAAA,MACjB;AAAA,MACA;AAAA,QACE,YAAY;AAAA,QACZ,GAAG,OAAO,KAAK;AAAA,QACf,GAAG,OAAO;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACA,QAAM,SAAS,CAAC;AAChB,QAAM,QAAa,CAAC;AACpB,MAAI;AAGJ,MAAI,SAAS;AACb,SAAO,KAAK;AAIV,UAAM,SAAS;AACf,QAAI,KAAK;AACT,WAAO,KAAK;AAIV,WAAK,SAAS,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE;AAC7B,UAAI,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,EAAE,GAAG;AACjC,eAAO,KAAK,KAAK,CAAC,CAAC;AACnB,aAAK,OAAO,GAAG,CAAC;AAChB;AAAA,MACF;AAGA,WAAK,SAAS,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE;AAC7B,UAAI,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,EAAE,GAAG;AACjC;AAAA,MACF;AAGA,YAAM;AAAA,QACJ,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,MACV;AACA,WAAK,OAAO,GAAG,CAAC;AAAA,IAClB;AAGA,UAAM,KAAK;AAGX,QAAI,MAAM;AACV,WAAO,GAAG;AACR,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,SAAS,CAAC;AAGd,UAAI,EAAE,IAAI,EAAE;AACZ,UAAI,EAAE,IAAI,EAAE;AACZ,UAAI,KAAK,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACxC,UAAI,KAAK,IAAI,CAAC,IAAI,SAAS;AACzB,aAAK,KAAK,IAAI,SAAS,GAAG,GAAG,CAAC,CAAC;AAAA,MACjC;AAAA,IACF;AAAA,EACF;AAIA,QAAM,UAAU,KAAK,MAAM,QAAQ,IAAI;AAEvC,MAAI,OAAO;AACX,SAAO,KAAK;AACV,QACE,OAAO,CAAC,EAAE,EAAE,cACZ,OAAO,CAAC,EAAE,EAAE,cACZ,OAAO,CAAC,EAAE,EAAE,YACZ;AACA,aAAO,OAAO,GAAG,CAAC;AAAA,IACpB;AAAA,EACF;AAEA,SAAO;AACT;AAGA,IAAO,mBAAQ;","names":[]}
1	+ {"version":3,"sources":["../../index.ts"],"sourcesContent":["// http://en.wikipedia.org/wiki/Delaunay_triangulation\n// https://github.com/ironwallaby/delaunay\nimport { FeatureCollection, Point, Polygon } from \"geojson\";\nimport { featureCollection, polygon } from \"@turf/helpers\";\n\ninterface Pt {\n x: number;\n y: number;\n z?: number;\n __sentinel?: boolean;\n}\ninterface Vertice {\n x: number;\n y: number;\n}\n\n/*\n Takes a set of {@link Point\|points} and creates a\n * [Triangulated Irregular Network](http://en.wikipedia.org/wiki/Triangulated_irregular_network),\n * or a TIN for short, returned as a collection of Polygons. These are often used\n * for developing elevation contour maps or stepped heat visualizations.\n \n If an optional z-value property is provided then it is added as properties called `a`, `b`,\n * and `c` representing its value at each of the points that represent the corners of the\n * triangle.\n \n @function\n * @param {FeatureCollection<Point>} points input points\n * @param {String} [z] name of the property from which to pull z values\n * This is optional: if not given, then there will be no extra data added to the derived triangles.\n * @returns {FeatureCollection<Polygon>} TIN output\n * @example\n * // generate some random point data\n * var points = turf.randomPoint(30, {bbox: [50, 30, 70, 50]});\n \n // add a random property to each point between 0 and 9\n * for (var i = 0; i < points.features.length; i++) {\n * points.features[i].properties.z = ~~(Math.random() * 9);\n * }\n * var tin = turf.tin(points, 'z');\n \n //addToMap\n * var addToMap = [tin, points]\n * for (var i = 0; i < tin.features.length; i++) {\n * var properties = tin.features[i].properties;\n * properties.fill = '#' + properties.a + properties.b + properties.c;\n * }\n /\nfunction tin(\n points: FeatureCollection<Point, any>,\n z?: string\n): FeatureCollection<Polygon> {\n // break down points\n let isPointZ = false;\n return featureCollection(\n triangulate(\n points.features.map((p) => {\n const point: Pt = {\n x: p.geometry.coordinates[0],\n y: p.geometry.coordinates[1],\n };\n if (z) {\n point.z = p.properties[z];\n } else if (p.geometry.coordinates.length === 3) {\n isPointZ = true;\n point.z = p.geometry.coordinates[2];\n }\n return point;\n })\n ).map((triangle: any) => {\n const a = [triangle.a.x, triangle.a.y];\n const b = [triangle.b.x, triangle.b.y];\n const c = [triangle.c.x, triangle.c.y];\n let properties = {};\n\n // Add z coordinates to triangle points if user passed\n // them in that way otherwise add it as a property.\n if (isPointZ) {\n a.push(triangle.a.z);\n b.push(triangle.b.z);\n c.push(triangle.c.z);\n } else {\n properties = {\n a: triangle.a.z,\n b: triangle.b.z,\n c: triangle.c.z,\n };\n }\n\n return polygon([[a, b, c, a]], properties);\n })\n );\n}\n\nclass Triangle {\n public a: Pt;\n public b: Pt;\n public c: Pt;\n public x: number;\n public y: number;\n public r: number;\n\n constructor(a: Pt, b: Pt, c: Pt) {\n this.a = a;\n this.b = b;\n this.c = c;\n\n const A = b.x - a.x;\n const B = b.y - a.y;\n const C = c.x - a.x;\n const D = c.y - a.y;\n const E = A (a.x + b.x) + B * (a.y + b.y);\n const F = C * (a.x + c.x) + D * (a.y + c.y);\n const G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n let dx;\n let dy;\n\n // If the points of the triangle are collinear, then just find the\n // extremes and use the midpoint as the center of the circumcircle.\n this.x = (D * E - B * F) / G;\n this.y = (A * F - C * E) / G;\n dx = this.x - a.x;\n dy = this.y - a.y;\n this.r = dx * dx + dy * dy;\n }\n}\n\nfunction byX(a: Pt, b: Pt) {\n return b.x - a.x;\n}\n\nfunction dedup(edges: number[]) {\n let j = edges.length;\n let a;\n let b;\n let i;\n let m;\n let n;\n\n outer: while (j) {\n b = edges[--j];\n a = edges[--j];\n i = j;\n while (i) {\n n = edges[--i];\n m = edges[--i];\n if ((a === m && b === n) \|\| (a === n && b === m)) {\n edges.splice(j, 2);\n edges.splice(i, 2);\n j -= 2;\n continue outer;\n }\n }\n }\n}\n\nfunction triangulate(vertices: Vertice[]) {\n // Bail if there aren't enough vertices to form any triangles.\n if (vertices.length < 3) {\n return [];\n }\n\n // Ensure the vertex array is in order of descending X coordinate\n // (which is needed to ensure a subquadratic runtime), and then find\n // the bounding box around the points.\n vertices.sort(byX);\n\n let i = vertices.length - 1;\n const xmin = vertices[i].x;\n const xmax = vertices[0].x;\n let ymin = vertices[i].y;\n let ymax = ymin;\n const epsilon = 1e-12;\n\n let a;\n let b;\n let c;\n let A;\n let B;\n let G;\n\n while (i--) {\n if (vertices[i].y < ymin) {\n ymin = vertices[i].y;\n }\n if (vertices[i].y > ymax) {\n ymax = vertices[i].y;\n }\n }\n\n // Find a supertriangle, which is a triangle that surrounds all the\n // vertices. This is used like something of a sentinel value to remove\n // cases in the main algorithm, and is removed before we return any\n // results.\n\n // Once found, put it in the \"open\" list. (The \"open\" list is for\n // triangles who may still need to be considered; the \"closed\" list is\n // for triangles which do not.)\n let dx = xmax - xmin;\n let dy = ymax - ymin;\n const dmax = dx > dy ? dx : dy;\n const xmid = (xmax + xmin) * 0.5;\n const ymid = (ymax + ymin) * 0.5;\n const open = [\n new Triangle(\n {\n __sentinel: true,\n x: xmid - 20 * dmax,\n y: ymid - dmax,\n },\n {\n __sentinel: true,\n x: xmid,\n y: ymid + 20 * dmax,\n },\n {\n __sentinel: true,\n x: xmid + 20 * dmax,\n y: ymid - dmax,\n }\n ),\n ];\n const closed = [];\n const edges: any = [];\n let j;\n\n // Incrementally add each vertex to the mesh.\n i = vertices.length;\n while (i--) {\n // For each open triangle, check to see if the current point is\n // inside it's circumcircle. If it is, remove the triangle and add\n // it's edges to an edge list.\n edges.length = 0;\n j = open.length;\n while (j--) {\n // If this point is to the right of this triangle's circumcircle,\n // then this triangle should never get checked again. Remove it\n // from the open list, add it to the closed list, and skip.\n dx = vertices[i].x - open[j].x;\n if (dx > 0 && dx * dx > open[j].r) {\n closed.push(open[j]);\n open.splice(j, 1);\n continue;\n }\n\n // If not, skip this triangle.\n dy = vertices[i].y - open[j].y;\n if (dx * dx + dy * dy > open[j].r) {\n continue;\n }\n\n // Remove the triangle and add it's edges to the edge list.\n edges.push(\n open[j].a,\n open[j].b,\n open[j].b,\n open[j].c,\n open[j].c,\n open[j].a\n );\n open.splice(j, 1);\n }\n\n // Remove any doubled edges.\n dedup(edges);\n\n // Add a new triangle for each edge.\n j = edges.length;\n while (j) {\n b = edges[--j];\n a = edges[--j];\n c = vertices[i];\n // Avoid adding colinear triangles (which have error-prone\n // circumcircles)\n A = b.x - a.x;\n B = b.y - a.y;\n G = 2 * (A * (c.y - b.y) - B * (c.x - b.x));\n if (Math.abs(G) > epsilon) {\n open.push(new Triangle(a, b, c));\n }\n }\n }\n\n // Copy any remaining open triangles to the closed list, and then\n // remove any triangles that share a vertex with the supertriangle.\n Array.prototype.push.apply(closed, open);\n\n i = closed.length;\n while (i--) {\n if (\n closed[i].a.__sentinel \|\|\n closed[i].b.__sentinel \|\|\n closed[i].c.__sentinel\n ) {\n closed.splice(i, 1);\n }\n }\n\n return closed;\n}\n\nexport { Pt, Vertice, tin };\nexport default tin;\n"],"mappings":";AAGA,SAAS,mBAAmB,eAAe;AA6C3C,SAAS,IACP,QACA,GAC4B;AAE5B,MAAI,WAAW;AACf,SAAO;AAAA,IACL;AAAA,MACE,OAAO,SAAS,IAAI,CAAC,MAAM;AACzB,cAAM,QAAY;AAAA,UAChB,GAAG,EAAE,SAAS,YAAY,CAAC;AAAA,UAC3B,GAAG,EAAE,SAAS,YAAY,CAAC;AAAA,QAC7B;AACA,YAAI,GAAG;AACL,gBAAM,IAAI,EAAE,WAAW,CAAC;AAAA,QAC1B,WAAW,EAAE,SAAS,YAAY,WAAW,GAAG;AAC9C,qBAAW;AACX,gBAAM,IAAI,EAAE,SAAS,YAAY,CAAC;AAAA,QACpC;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH,EAAE,IAAI,CAAC,aAAkB;AACvB,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,YAAM,IAAI,CAAC,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC;AACrC,UAAI,aAAa,CAAC;AAIlB,UAAI,UAAU;AACZ,UAAE,KAAK,SAAS,EAAE,CAAC;AACnB,UAAE,KAAK,SAAS,EAAE,CAAC;AACnB,UAAE,KAAK,SAAS,EAAE,CAAC;AAAA,MACrB,OAAO;AACL,qBAAa;AAAA,UACX,GAAG,SAAS,EAAE;AAAA,UACd,GAAG,SAAS,EAAE;AAAA,UACd,GAAG,SAAS,EAAE;AAAA,QAChB;AAAA,MACF;AAEA,aAAO,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,UAAU;AAAA,IAC3C,CAAC;AAAA,EACH;AACF;AAEA,IAAM,WAAN,MAAe;AAAA,EAQb,YAAY,GAAO,GAAO,GAAO;AAC/B,SAAK,IAAI;AACT,SAAK,IAAI;AACT,SAAK,IAAI;AAET,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,EAAE,IAAI,EAAE;AAClB,UAAM,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACzC,UAAM,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACzC,UAAM,IAAI,KAAK,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AAC9C,QAAI;AACJ,QAAI;AAIJ,SAAK,KAAK,IAAI,IAAI,IAAI,KAAK;AAC3B,SAAK,KAAK,IAAI,IAAI,IAAI,KAAK;AAC3B,SAAK,KAAK,IAAI,EAAE;AAChB,SAAK,KAAK,IAAI,EAAE;AAChB,SAAK,IAAI,KAAK,KAAK,KAAK;AAAA,EAC1B;AACF;AAEA,SAAS,IAAI,GAAO,GAAO;AACzB,SAAO,EAAE,IAAI,EAAE;AACjB;AAEA,SAAS,MAAM,OAAiB;AAC9B,MAAI,IAAI,MAAM;AACd,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,QAAO,QAAO,GAAG;AACf,QAAI,MAAM,EAAE,CAAC;AACb,QAAI,MAAM,EAAE,CAAC;AACb,QAAI;AACJ,WAAO,GAAG;AACR,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,MAAM,EAAE,CAAC;AACb,UAAK,MAAM,KAAK,MAAM,KAAO,MAAM,KAAK,MAAM,GAAI;AAChD,cAAM,OAAO,GAAG,CAAC;AACjB,cAAM,OAAO,GAAG,CAAC;AACjB,aAAK;AACL,iBAAS;AAAA,MACX;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,YAAY,UAAqB;AAExC,MAAI,SAAS,SAAS,GAAG;AACvB,WAAO,CAAC;AAAA,EACV;AAKA,WAAS,KAAK,GAAG;AAEjB,MAAI,IAAI,SAAS,SAAS;AAC1B,QAAM,OAAO,SAAS,CAAC,EAAE;AACzB,QAAM,OAAO,SAAS,CAAC,EAAE;AACzB,MAAI,OAAO,SAAS,CAAC,EAAE;AACvB,MAAI,OAAO;AACX,QAAM,UAAU;AAEhB,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,SAAO,KAAK;AACV,QAAI,SAAS,CAAC,EAAE,IAAI,MAAM;AACxB,aAAO,SAAS,CAAC,EAAE;AAAA,IACrB;AACA,QAAI,SAAS,CAAC,EAAE,IAAI,MAAM;AACxB,aAAO,SAAS,CAAC,EAAE;AAAA,IACrB;AAAA,EACF;AAUA,MAAI,KAAK,OAAO;AAChB,MAAI,KAAK,OAAO;AAChB,QAAM,OAAO,KAAK,KAAK,KAAK;AAC5B,QAAM,QAAQ,OAAO,QAAQ;AAC7B,QAAM,QAAQ,OAAO,QAAQ;AAC7B,QAAM,OAAO;AAAA,IACX,IAAI;AAAA,MACF;AAAA,QACE,YAAY;AAAA,QACZ,GAAG,OAAO,KAAK;AAAA,QACf,GAAG,OAAO;AAAA,MACZ;AAAA,MACA;AAAA,QACE,YAAY;AAAA,QACZ,GAAG;AAAA,QACH,GAAG,OAAO,KAAK;AAAA,MACjB;AAAA,MACA;AAAA,QACE,YAAY;AAAA,QACZ,GAAG,OAAO,KAAK;AAAA,QACf,GAAG,OAAO;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACA,QAAM,SAAS,CAAC;AAChB,QAAM,QAAa,CAAC;AACpB,MAAI;AAGJ,MAAI,SAAS;AACb,SAAO,KAAK;AAIV,UAAM,SAAS;AACf,QAAI,KAAK;AACT,WAAO,KAAK;AAIV,WAAK,SAAS,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE;AAC7B,UAAI,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,EAAE,GAAG;AACjC,eAAO,KAAK,KAAK,CAAC,CAAC;AACnB,aAAK,OAAO,GAAG,CAAC;AAChB;AAAA,MACF;AAGA,WAAK,SAAS,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE;AAC7B,UAAI,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,EAAE,GAAG;AACjC;AAAA,MACF;AAGA,YAAM;AAAA,QACJ,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,QACR,KAAK,CAAC,EAAE;AAAA,MACV;AACA,WAAK,OAAO,GAAG,CAAC;AAAA,IAClB;AAGA,UAAM,KAAK;AAGX,QAAI,MAAM;AACV,WAAO,GAAG;AACR,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,MAAM,EAAE,CAAC;AACb,UAAI,SAAS,CAAC;AAGd,UAAI,EAAE,IAAI,EAAE;AACZ,UAAI,EAAE,IAAI,EAAE;AACZ,UAAI,KAAK,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,IAAI,EAAE;AACxC,UAAI,KAAK,IAAI,CAAC,IAAI,SAAS;AACzB,aAAK,KAAK,IAAI,SAAS,GAAG,GAAG,CAAC,CAAC;AAAA,MACjC;AAAA,IACF;AAAA,EACF;AAIA,QAAM,UAAU,KAAK,MAAM,QAAQ,IAAI;AAEvC,MAAI,OAAO;AACX,SAAO,KAAK;AACV,QACE,OAAO,CAAC,EAAE,EAAE,cACZ,OAAO,CAAC,EAAE,EAAE,cACZ,OAAO,CAAC,EAAE,EAAE,YACZ;AACA,aAAO,OAAO,GAAG,CAAC;AAAA,IACpB;AAAA,EACF;AAEA,SAAO;AACT;AAGA,IAAO,mBAAQ;","names":[]}

package/node_modules/@turf/tin/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "name": "@turf/tin",
-  "version": "7.1.0",
+  "version": "7.2.0",
   "description": "turf tin module",
   "author": "Turf Authors",
   "license": "MIT",
@@ -52,18 +52,18 @@
   },
   "devDependencies": {
     "@types/benchmark": "^2.1.5",
-    "@types/tape": "^4.2.32",
+    "@types/tape": "^4.13.4",
     "benchmark": "^2.1.4",
     "npm-run-all": "^4.1.5",
-    "tape": "^5.7.2",
-    "tsup": "^8.0.1",
-    "tsx": "^4.6.2",
-    "typescript": "^5.2.2"
+    "tape": "^5.9.0",
+    "tsup": "^8.3.5",
+    "tsx": "^4.19.2",
+    "typescript": "^5.5.4"
   },
   "dependencies": {
-    "@turf/helpers": "^7.1.0",
+    "@turf/helpers": "^7.2.0",
     "@types/geojson": "^7946.0.10",
-    "tslib": "^2.6.2"
+    "tslib": "^2.8.1"
   },
-  "gitHead": "68915eeebc9278bb40dec3f1034499698a0561ef"
+  "gitHead": "7b0f0374c4668cd569f8904c71e2ae7d941be867"
 }

package/node_modules/@turf/transform-rotate/dist/cjs/index.cjs CHANGED Viewed

@@ -9,19 +9,15 @@ var _invariant = require('@turf/invariant');
 var _helpers = require('@turf/helpers');
 function transformRotate(geojson, angle, options) {
   options = options || {};
-  if (!_helpers.isObject.call(void 0, options))
-    throw new Error("options is invalid");
+  if (!_helpers.isObject.call(void 0, options)) throw new Error("options is invalid");
   const pivot = options.pivot;
   const mutate = options.mutate;
-  if (!geojson)
-    throw new Error("geojson is required");
+  if (!geojson) throw new Error("geojson is required");
   if (angle === void 0 || angle === null || isNaN(angle))
     throw new Error("angle is required");
-  if (angle === 0)
-    return geojson;
+  if (angle === 0) return geojson;
   const pivotCoord = pivot != null ? pivot : _centroid.centroid.call(void 0, geojson);
-  if (mutate === false || mutate === void 0)
-    geojson = _clone.clone.call(void 0, geojson);
+  if (mutate === false || mutate === void 0) geojson = _clone.clone.call(void 0, geojson);
   _meta.coordEach.call(void 0, geojson, function(pointCoords) {
     const initialAngle = _rhumbbearing.rhumbBearing.call(void 0, pivotCoord, pointCoords);
     const finalAngle = initialAngle + angle;

package/node_modules/@turf/transform-rotate/dist/cjs/index.cjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../../index.ts"],"names":[],"mappings":";~~AACA~~,~~SAAS,gBAAgB~~;AACzB,~~SAAS,oBAAoB~~;AAC7B,~~SAAS,qBAAqB~~;AAC9B,~~SAAS,wBAAwB~~;AACjC,~~SAAS,aAAa~~;AACtB,~~SAAS,iBAAiB~~;AAC1B,~~SAAS,iBAAiB~~;AAC1B,~~SAAS,gBAAuB~~;AAqBhC,SAAS,~~gBACP~~,~~SACA~~,~~OACA~~,~~SAIG~~;AAEH,~~YAAU~~,~~WAAW~~,CAAC;AACtB,~~MAAI~~,CAAC,~~SAAS~~,~~OAAO;AAAG~~,~~UAAM~~,IAAI,~~MAAM~~,oBAAoB;AAC5D,~~QAAM~~,~~QAAQ~~,~~QAAQ~~;AACtB,~~QAAM~~,~~SAAS~~,~~QAAQ~~;AAGvB,~~MAAI~~,CAAC~~;AAAS~~,~~UAAM~~,~~IAAI~~,MAAM,qBAAqB;AACnD,~~MAAI~~,~~UAAU~~,~~UAAa~~,~~UAAU~~,~~QAAQ~~,~~MAAM~~,KAAK;AACtD,~~UAAM~~,IAAI,~~MAAM~~,mBAAmB;AAGrC,~~MAAI~~,~~UAAU;AAAG~~,~~WAAO~~;AAGxB,~~QAAM~~,~~aAAa~~,~~wBAAS~~,~~SAAS~~,~~OAAO~~;AAG5C,~~MAAI~~,~~WAAW~~,~~SAAS~~,~~WAAW;AAAW~~,~~cAAU~~,~~MAAM~~,~~OAAO~~;AAGrE,~~YAAU~~,~~SAAS~~,~~SAAU~~,~~aAAa~~;AACxC,~~UAAM~~,~~eAAe~~,~~aAAa~~,~~YAAY~~,WAAW;AACzD,~~UAAM~~,~~aAAa~~,~~eAAe~~;AAClC,~~UAAM~~,~~WAAW~~,~~cAAc~~,~~YAAY~~,WAAW;AACtD,~~UAAM~~,~~YAAY~~;AAAA,MAChB,~~iBAAiB~~,~~YAAY~~,~~UAAU~~,UAAU;AAAA,IACnD;AACA,~~gBAAY~~,CAAC,~~IAAI~~,~~UAAU~~,CAAC;AAC5B,~~gBAAY~~,CAAC,~~IAAI~~,~~UAAU~~,CAAC;AAAA,EAC9B,CAAC;AACD,~~SAAO~~;AACT;AAGA,IAAO,~~gCAAQ~~","sourcesContent":["import { GeoJSON, GeometryCollection } from \"geojson\";\nimport { centroid } from \"@turf/centroid\";\nimport { rhumbBearing } from \"@turf/rhumb-bearing\";\nimport { rhumbDistance } from \"@turf/rhumb-distance\";\nimport { rhumbDestination } from \"@turf/rhumb-destination\";\nimport { clone } from \"@turf/clone\";\nimport { coordEach } from \"@turf/meta\";\nimport { getCoords } from \"@turf/invariant\";\nimport { isObject, Coord } from \"@turf/helpers\";\n\n/*\n Rotates any geojson Feature or Geometry of a specified angle, around its `centroid` or a given `pivot` point.\n \n @~~name transformRotate~~\n * @param {GeoJSON} geojson object to be rotated\n * @param {number} angle of rotation in decimal degrees, positive clockwise\n * @param {Object} [options={}] Optional parameters\n * @param {Coord} [options.pivot='centroid'] point around which the rotation will be performed\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)\n * @returns {GeoJSON} the rotated GeoJSON feature\n * @example\n * const poly = turf.polygon([[[0,29],[3.5,29],[2.5,32],[0,29]]]);\n * const options = {pivot: [0, 25]};\n * const rotatedPoly = turf.transformRotate(poly, 10, options);\n \n //addToMap\n * const addToMap = [poly, rotatedPoly];\n * rotatedPoly.properties = {stroke: '#F00', 'stroke-width': 4};\n */\nfunction transformRotate<T extends GeoJSON \| GeometryCollection>(\n geojson: T,\n angle: number,\n options?: {\n pivot?: Coord;\n mutate?: boolean;\n }\n): T {\n // Optional parameters\n options = options \|\| {};\n if (!isObject(options)) throw new Error(\"options is invalid\");\n const pivot = options.pivot;\n const mutate = options.mutate;\n\n // Input validation\n if (!geojson) throw new Error(\"geojson is required\");\n if (angle === undefined \|\| angle === null \|\| isNaN(angle))\n throw new Error(\"angle is required\");\n\n // Shortcut no-rotation\n if (angle === 0) return geojson;\n\n // Use centroid of GeoJSON if pivot is not provided\n const pivotCoord = pivot ?? centroid(geojson);\n\n // Clone geojson to avoid side effects\n if (mutate === false \|\| mutate === undefined) geojson = clone(geojson);\n\n // Rotate each coordinate\n coordEach(geojson, function (pointCoords) {\n const initialAngle = rhumbBearing(pivotCoord, pointCoords);\n const finalAngle = initialAngle + angle;\n const distance = rhumbDistance(pivotCoord, pointCoords);\n const newCoords = getCoords(\n rhumbDestination(pivotCoord, distance, finalAngle)\n );\n pointCoords[0] = newCoords[0];\n pointCoords[1] = newCoords[1];\n });\n return geojson;\n}\n\nexport { transformRotate };\nexport default transformRotate;\n"]}
1	+ {"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-transform-rotate/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACCA,0CAAyB;AACzB,mDAA6B;AAC7B,qDAA8B;AAC9B,2DAAiC;AACjC,oCAAsB;AACtB,kCAA0B;AAC1B,4CAA0B;AAC1B,wCAAgC;AAqBhC,SAAS,eAAA,CACP,OAAA,EACA,KAAA,EACA,OAAA,EAIG;AAEH,EAAA,QAAA,EAAU,QAAA,GAAW,CAAC,CAAA;AACtB,EAAA,GAAA,CAAI,CAAC,+BAAA,OAAgB,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,oBAAoB,CAAA;AAC5D,EAAA,MAAM,MAAA,EAAQ,OAAA,CAAQ,KAAA;AACtB,EAAA,MAAM,OAAA,EAAS,OAAA,CAAQ,MAAA;AAGvB,EAAA,GAAA,CAAI,CAAC,OAAA,EAAS,MAAM,IAAI,KAAA,CAAM,qBAAqB,CAAA;AACnD,EAAA,GAAA,CAAI,MAAA,IAAU,KAAA,EAAA,GAAa,MAAA,IAAU,KAAA,GAAQ,KAAA,CAAM,KAAK,CAAA;AACtD,IAAA,MAAM,IAAI,KAAA,CAAM,mBAAmB,CAAA;AAGrC,EAAA,GAAA,CAAI,MAAA,IAAU,CAAA,EAAG,OAAO,OAAA;AAGxB,EAAA,MAAM,WAAA,EAAa,MAAA,GAAA,KAAA,EAAA,MAAA,EAAS,gCAAA,OAAgB,CAAA;AAG5C,EAAA,GAAA,CAAI,OAAA,IAAW,MAAA,GAAS,OAAA,IAAW,KAAA,CAAA,EAAW,QAAA,EAAU,0BAAA,OAAa,CAAA;AAGrE,EAAA,6BAAA,OAAU,EAAS,QAAA,CAAU,WAAA,EAAa;AACxC,IAAA,MAAM,aAAA,EAAe,wCAAA,UAAa,EAAY,WAAW,CAAA;AACzD,IAAA,MAAM,WAAA,EAAa,aAAA,EAAe,KAAA;AAClC,IAAA,MAAM,SAAA,EAAW,0CAAA,UAAc,EAAY,WAAW,CAAA;AACtD,IAAA,MAAM,UAAA,EAAY,kCAAA;AAAA,MAChB,gDAAA,UAAiB,EAAY,QAAA,EAAU,UAAU;AAAA,IACnD,CAAA;AACA,IAAA,WAAA,CAAY,CAAC,EAAA,EAAI,SAAA,CAAU,CAAC,CAAA;AAC5B,IAAA,WAAA,CAAY,CAAC,EAAA,EAAI,SAAA,CAAU,CAAC,CAAA;AAAA,EAC9B,CAAC,CAAA;AACD,EAAA,OAAO,OAAA;AACT;AAGA,IAAO,8BAAA,EAAQ,eAAA;ADvCf;AACE;AACA;AACF,2FAAC","file":"/home/runner/work/turf/turf/packages/turf-transform-rotate/dist/cjs/index.cjs","sourcesContent":[null,"import { GeoJSON, GeometryCollection } from \"geojson\";\nimport { centroid } from \"@turf/centroid\";\nimport { rhumbBearing } from \"@turf/rhumb-bearing\";\nimport { rhumbDistance } from \"@turf/rhumb-distance\";\nimport { rhumbDestination } from \"@turf/rhumb-destination\";\nimport { clone } from \"@turf/clone\";\nimport { coordEach } from \"@turf/meta\";\nimport { getCoords } from \"@turf/invariant\";\nimport { isObject, Coord } from \"@turf/helpers\";\n\n/*\n Rotates any geojson Feature or Geometry of a specified angle, around its `centroid` or a given `pivot` point.\n \n @function\n * @param {GeoJSON} geojson object to be rotated\n * @param {number} angle of rotation in decimal degrees, positive clockwise\n * @param {Object} [options={}] Optional parameters\n * @param {Coord} [options.pivot='centroid'] point around which the rotation will be performed\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)\n * @returns {GeoJSON} the rotated GeoJSON feature\n * @example\n * const poly = turf.polygon([[[0,29],[3.5,29],[2.5,32],[0,29]]]);\n * const options = {pivot: [0, 25]};\n * const rotatedPoly = turf.transformRotate(poly, 10, options);\n \n //addToMap\n * const addToMap = [poly, rotatedPoly];\n * rotatedPoly.properties = {stroke: '#F00', 'stroke-width': 4};\n */\nfunction transformRotate<T extends GeoJSON \| GeometryCollection>(\n geojson: T,\n angle: number,\n options?: {\n pivot?: Coord;\n mutate?: boolean;\n }\n): T {\n // Optional parameters\n options = options \|\| {};\n if (!isObject(options)) throw new Error(\"options is invalid\");\n const pivot = options.pivot;\n const mutate = options.mutate;\n\n // Input validation\n if (!geojson) throw new Error(\"geojson is required\");\n if (angle === undefined \|\| angle === null \|\| isNaN(angle))\n throw new Error(\"angle is required\");\n\n // Shortcut no-rotation\n if (angle === 0) return geojson;\n\n // Use centroid of GeoJSON if pivot is not provided\n const pivotCoord = pivot ?? centroid(geojson);\n\n // Clone geojson to avoid side effects\n if (mutate === false \|\| mutate === undefined) geojson = clone(geojson);\n\n // Rotate each coordinate\n coordEach(geojson, function (pointCoords) {\n const initialAngle = rhumbBearing(pivotCoord, pointCoords);\n const finalAngle = initialAngle + angle;\n const distance = rhumbDistance(pivotCoord, pointCoords);\n const newCoords = getCoords(\n rhumbDestination(pivotCoord, distance, finalAngle)\n );\n pointCoords[0] = newCoords[0];\n pointCoords[1] = newCoords[1];\n });\n return geojson;\n}\n\nexport { transformRotate };\nexport default transformRotate;\n"]}

package/node_modules/@turf/transform-rotate/dist/cjs/index.d.cts CHANGED Viewed

@@ -4,7 +4,7 @@ import { Coord } from '@turf/helpers';
 /**
  * Rotates any geojson Feature or Geometry of a specified angle, around its `centroid` or a given `pivot` point.
  *
- * @name transformRotate
+ * @function
  * @param {GeoJSON} geojson object to be rotated
  * @param {number} angle of rotation in decimal degrees, positive clockwise
  * @param {Object} [options={}] Optional parameters

package/node_modules/@turf/transform-rotate/dist/esm/index.d.ts CHANGED Viewed

@@ -4,7 +4,7 @@ import { Coord } from '@turf/helpers';
 /**
  * Rotates any geojson Feature or Geometry of a specified angle, around its `centroid` or a given `pivot` point.
  *
- * @name transformRotate
+ * @function
  * @param {GeoJSON} geojson object to be rotated
  * @param {number} angle of rotation in decimal degrees, positive clockwise
  * @param {Object} [options={}] Optional parameters

package/node_modules/@turf/transform-rotate/dist/esm/index.js CHANGED Viewed

@@ -9,19 +9,15 @@ import { getCoords } from "@turf/invariant";
 import { isObject } from "@turf/helpers";
 function transformRotate(geojson, angle, options) {
   options = options || {};
-  if (!isObject(options))
-    throw new Error("options is invalid");
+  if (!isObject(options)) throw new Error("options is invalid");
   const pivot = options.pivot;
   const mutate = options.mutate;
-  if (!geojson)
-    throw new Error("geojson is required");
+  if (!geojson) throw new Error("geojson is required");
   if (angle === void 0 || angle === null || isNaN(angle))
     throw new Error("angle is required");
-  if (angle === 0)
-    return geojson;
+  if (angle === 0) return geojson;
   const pivotCoord = pivot != null ? pivot : centroid(geojson);
-  if (mutate === false || mutate === void 0)
-    geojson = clone(geojson);
+  if (mutate === false || mutate === void 0) geojson = clone(geojson);
   coordEach(geojson, function(pointCoords) {
     const initialAngle = rhumbBearing(pivotCoord, pointCoords);
     const finalAngle = initialAngle + angle;

package/node_modules/@turf/transform-rotate/dist/esm/index.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../../index.ts"],"sourcesContent":["import { GeoJSON, GeometryCollection } from \"geojson\";\nimport { centroid } from \"@turf/centroid\";\nimport { rhumbBearing } from \"@turf/rhumb-bearing\";\nimport { rhumbDistance } from \"@turf/rhumb-distance\";\nimport { rhumbDestination } from \"@turf/rhumb-destination\";\nimport { clone } from \"@turf/clone\";\nimport { coordEach } from \"@turf/meta\";\nimport { getCoords } from \"@turf/invariant\";\nimport { isObject, Coord } from \"@turf/helpers\";\n\n/*\n Rotates any geojson Feature or Geometry of a specified angle, around its `centroid` or a given `pivot` point.\n \n @~~name transformRotate~~\n * @param {GeoJSON} geojson object to be rotated\n * @param {number} angle of rotation in decimal degrees, positive clockwise\n * @param {Object} [options={}] Optional parameters\n * @param {Coord} [options.pivot='centroid'] point around which the rotation will be performed\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)\n * @returns {GeoJSON} the rotated GeoJSON feature\n * @example\n * const poly = turf.polygon([[[0,29],[3.5,29],[2.5,32],[0,29]]]);\n * const options = {pivot: [0, 25]};\n * const rotatedPoly = turf.transformRotate(poly, 10, options);\n \n //addToMap\n * const addToMap = [poly, rotatedPoly];\n * rotatedPoly.properties = {stroke: '#F00', 'stroke-width': 4};\n */\nfunction transformRotate<T extends GeoJSON \| GeometryCollection>(\n geojson: T,\n angle: number,\n options?: {\n pivot?: Coord;\n mutate?: boolean;\n }\n): T {\n // Optional parameters\n options = options \|\| {};\n if (!isObject(options)) throw new Error(\"options is invalid\");\n const pivot = options.pivot;\n const mutate = options.mutate;\n\n // Input validation\n if (!geojson) throw new Error(\"geojson is required\");\n if (angle === undefined \|\| angle === null \|\| isNaN(angle))\n throw new Error(\"angle is required\");\n\n // Shortcut no-rotation\n if (angle === 0) return geojson;\n\n // Use centroid of GeoJSON if pivot is not provided\n const pivotCoord = pivot ?? centroid(geojson);\n\n // Clone geojson to avoid side effects\n if (mutate === false \|\| mutate === undefined) geojson = clone(geojson);\n\n // Rotate each coordinate\n coordEach(geojson, function (pointCoords) {\n const initialAngle = rhumbBearing(pivotCoord, pointCoords);\n const finalAngle = initialAngle + angle;\n const distance = rhumbDistance(pivotCoord, pointCoords);\n const newCoords = getCoords(\n rhumbDestination(pivotCoord, distance, finalAngle)\n );\n pointCoords[0] = newCoords[0];\n pointCoords[1] = newCoords[1];\n });\n return geojson;\n}\n\nexport { transformRotate };\nexport default transformRotate;\n"],"mappings":";AACA,SAAS,gBAAgB;AACzB,SAAS,oBAAoB;AAC7B,SAAS,qBAAqB;AAC9B,SAAS,wBAAwB;AACjC,SAAS,aAAa;AACtB,SAAS,iBAAiB;AAC1B,SAAS,iBAAiB;AAC1B,SAAS,gBAAuB;AAqBhC,SAAS,gBACP,SACA,OACA,SAIG;AAEH,YAAU,WAAW,CAAC;AACtB,MAAI,CAAC,SAAS,OAAO~~;AAAG~~,~~UAAM~~,IAAI,MAAM,oBAAoB;AAC5D,QAAM,QAAQ,QAAQ;AACtB,QAAM,SAAS,QAAQ;AAGvB,MAAI,CAAC~~;AAAS~~,~~UAAM~~,IAAI,MAAM,qBAAqB;AACnD,MAAI,UAAU,UAAa,UAAU,QAAQ,MAAM,KAAK;AACtD,UAAM,IAAI,MAAM,mBAAmB;AAGrC,MAAI,UAAU~~;AAAG~~,~~WAAO~~;AAGxB,QAAM,aAAa,wBAAS,SAAS,OAAO;AAG5C,MAAI,WAAW,SAAS,WAAW~~;AAAW~~,~~cAAU~~,MAAM,OAAO;AAGrE,YAAU,SAAS,SAAU,aAAa;AACxC,UAAM,eAAe,aAAa,YAAY,WAAW;AACzD,UAAM,aAAa,eAAe;AAClC,UAAM,WAAW,cAAc,YAAY,WAAW;AACtD,UAAM,YAAY;AAAA,MAChB,iBAAiB,YAAY,UAAU,UAAU;AAAA,IACnD;AACA,gBAAY,CAAC,IAAI,UAAU,CAAC;AAC5B,gBAAY,CAAC,IAAI,UAAU,CAAC;AAAA,EAC9B,CAAC;AACD,SAAO;AACT;AAGA,IAAO,gCAAQ;","names":[]}
1	+ {"version":3,"sources":["../../index.ts"],"sourcesContent":["import { GeoJSON, GeometryCollection } from \"geojson\";\nimport { centroid } from \"@turf/centroid\";\nimport { rhumbBearing } from \"@turf/rhumb-bearing\";\nimport { rhumbDistance } from \"@turf/rhumb-distance\";\nimport { rhumbDestination } from \"@turf/rhumb-destination\";\nimport { clone } from \"@turf/clone\";\nimport { coordEach } from \"@turf/meta\";\nimport { getCoords } from \"@turf/invariant\";\nimport { isObject, Coord } from \"@turf/helpers\";\n\n/*\n Rotates any geojson Feature or Geometry of a specified angle, around its `centroid` or a given `pivot` point.\n \n @function\n * @param {GeoJSON} geojson object to be rotated\n * @param {number} angle of rotation in decimal degrees, positive clockwise\n * @param {Object} [options={}] Optional parameters\n * @param {Coord} [options.pivot='centroid'] point around which the rotation will be performed\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)\n * @returns {GeoJSON} the rotated GeoJSON feature\n * @example\n * const poly = turf.polygon([[[0,29],[3.5,29],[2.5,32],[0,29]]]);\n * const options = {pivot: [0, 25]};\n * const rotatedPoly = turf.transformRotate(poly, 10, options);\n \n //addToMap\n * const addToMap = [poly, rotatedPoly];\n * rotatedPoly.properties = {stroke: '#F00', 'stroke-width': 4};\n */\nfunction transformRotate<T extends GeoJSON \| GeometryCollection>(\n geojson: T,\n angle: number,\n options?: {\n pivot?: Coord;\n mutate?: boolean;\n }\n): T {\n // Optional parameters\n options = options \|\| {};\n if (!isObject(options)) throw new Error(\"options is invalid\");\n const pivot = options.pivot;\n const mutate = options.mutate;\n\n // Input validation\n if (!geojson) throw new Error(\"geojson is required\");\n if (angle === undefined \|\| angle === null \|\| isNaN(angle))\n throw new Error(\"angle is required\");\n\n // Shortcut no-rotation\n if (angle === 0) return geojson;\n\n // Use centroid of GeoJSON if pivot is not provided\n const pivotCoord = pivot ?? centroid(geojson);\n\n // Clone geojson to avoid side effects\n if (mutate === false \|\| mutate === undefined) geojson = clone(geojson);\n\n // Rotate each coordinate\n coordEach(geojson, function (pointCoords) {\n const initialAngle = rhumbBearing(pivotCoord, pointCoords);\n const finalAngle = initialAngle + angle;\n const distance = rhumbDistance(pivotCoord, pointCoords);\n const newCoords = getCoords(\n rhumbDestination(pivotCoord, distance, finalAngle)\n );\n pointCoords[0] = newCoords[0];\n pointCoords[1] = newCoords[1];\n });\n return geojson;\n}\n\nexport { transformRotate };\nexport default transformRotate;\n"],"mappings":";AACA,SAAS,gBAAgB;AACzB,SAAS,oBAAoB;AAC7B,SAAS,qBAAqB;AAC9B,SAAS,wBAAwB;AACjC,SAAS,aAAa;AACtB,SAAS,iBAAiB;AAC1B,SAAS,iBAAiB;AAC1B,SAAS,gBAAuB;AAqBhC,SAAS,gBACP,SACA,OACA,SAIG;AAEH,YAAU,WAAW,CAAC;AACtB,MAAI,CAAC,SAAS,OAAO,EAAG,OAAM,IAAI,MAAM,oBAAoB;AAC5D,QAAM,QAAQ,QAAQ;AACtB,QAAM,SAAS,QAAQ;AAGvB,MAAI,CAAC,QAAS,OAAM,IAAI,MAAM,qBAAqB;AACnD,MAAI,UAAU,UAAa,UAAU,QAAQ,MAAM,KAAK;AACtD,UAAM,IAAI,MAAM,mBAAmB;AAGrC,MAAI,UAAU,EAAG,QAAO;AAGxB,QAAM,aAAa,wBAAS,SAAS,OAAO;AAG5C,MAAI,WAAW,SAAS,WAAW,OAAW,WAAU,MAAM,OAAO;AAGrE,YAAU,SAAS,SAAU,aAAa;AACxC,UAAM,eAAe,aAAa,YAAY,WAAW;AACzD,UAAM,aAAa,eAAe;AAClC,UAAM,WAAW,cAAc,YAAY,WAAW;AACtD,UAAM,YAAY;AAAA,MAChB,iBAAiB,YAAY,UAAU,UAAU;AAAA,IACnD;AACA,gBAAY,CAAC,IAAI,UAAU,CAAC;AAC5B,gBAAY,CAAC,IAAI,UAAU,CAAC;AAAA,EAC9B,CAAC;AACD,SAAO;AACT;AAGA,IAAO,gCAAQ;","names":[]}

package/node_modules/@turf/transform-rotate/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "name": "@turf/transform-rotate",
-  "version": "7.1.0",
+  "version": "7.2.0",
   "description": "turf transform-rotate module",
   "author": "Turf Authors",
   "contributors": [
@@ -56,29 +56,29 @@
     "test:types": "tsc --esModuleInterop --module node16 --moduleResolution node16 --noEmit --strict types.ts"
   },
   "devDependencies": {
-    "@turf/truncate": "^7.1.0",
+    "@turf/truncate": "^7.2.0",
     "@types/benchmark": "^2.1.5",
-    "@types/tape": "^4.2.32",
+    "@types/tape": "^4.13.4",
     "benchmark": "^2.1.4",
     "load-json-file": "^7.0.1",
     "npm-run-all": "^4.1.5",
-    "tape": "^5.7.2",
-    "tsup": "^8.0.1",
-    "tsx": "^4.6.2",
-    "typescript": "^5.2.2",
+    "tape": "^5.9.0",
+    "tsup": "^8.3.5",
+    "tsx": "^4.19.2",
+    "typescript": "^5.5.4",
     "write-json-file": "^5.0.0"
   },
   "dependencies": {
-    "@turf/centroid": "^7.1.0",
-    "@turf/clone": "^7.1.0",
-    "@turf/helpers": "^7.1.0",
-    "@turf/invariant": "^7.1.0",
-    "@turf/meta": "^7.1.0",
-    "@turf/rhumb-bearing": "^7.1.0",
-    "@turf/rhumb-destination": "^7.1.0",
-    "@turf/rhumb-distance": "^7.1.0",
+    "@turf/centroid": "^7.2.0",
+    "@turf/clone": "^7.2.0",
+    "@turf/helpers": "^7.2.0",
+    "@turf/invariant": "^7.2.0",
+    "@turf/meta": "^7.2.0",
+    "@turf/rhumb-bearing": "^7.2.0",
+    "@turf/rhumb-destination": "^7.2.0",
+    "@turf/rhumb-distance": "^7.2.0",
     "@types/geojson": "^7946.0.10",
-    "tslib": "^2.6.2"
+    "tslib": "^2.8.1"
   },
-  "gitHead": "68915eeebc9278bb40dec3f1034499698a0561ef"
+  "gitHead": "7b0f0374c4668cd569f8904c71e2ae7d941be867"
 }

package/node_modules/@turf/transform-scale/dist/cjs/index.cjs CHANGED Viewed

@@ -11,17 +11,14 @@ var _helpers = require('@turf/helpers');
 var _invariant = require('@turf/invariant');
 function transformScale(geojson, factor, options) {
   options = options || {};
-  if (!_helpers.isObject.call(void 0, options))
-    throw new Error("options is invalid");
+  if (!_helpers.isObject.call(void 0, options)) throw new Error("options is invalid");
   const origin = options.origin || "centroid";
   const mutate = options.mutate || false;
-  if (!geojson)
-    throw new Error("geojson required");
+  if (!geojson) throw new Error("geojson required");
   if (typeof factor !== "number" || factor <= 0)
     throw new Error("invalid factor");
   const originIsPoint = Array.isArray(origin) || typeof origin === "object";
-  if (mutate !== true)
-    geojson = _clone.clone.call(void 0, geojson);
+  if (mutate !== true) geojson = _clone.clone.call(void 0, geojson);
   if (geojson.type === "FeatureCollection" && !originIsPoint) {
     _meta.featureEach.call(void 0, geojson, function(feature, index) {
       geojson.features[index] = scale(
@@ -37,8 +34,7 @@ function transformScale(geojson, factor, options) {
 function scale(feature, factor, origin) {
   const isPoint = _invariant.getType.call(void 0, feature) === "Point";
   const originCoord = defineOrigin(feature, origin);
-  if (factor === 1 || isPoint)
-    return feature;
+  if (factor === 1 || isPoint) return feature;
   _meta.coordEach.call(void 0, feature, function(coord) {
     const originalDistance = _rhumbdistance.rhumbDistance.call(void 0, originCoord, coord);
     const bearing = _rhumbbearing.rhumbBearing.call(void 0, originCoord, coord);
@@ -48,15 +44,13 @@ function scale(feature, factor, origin) {
     );
     coord[0] = newCoord[0];
     coord[1] = newCoord[1];
-    if (coord.length === 3)
-      coord[2] *= factor;
+    if (coord.length === 3) coord[2] *= factor;
   });
   delete feature.bbox;
   return feature;
 }
 function defineOrigin(geojson, origin) {
-  if (origin === void 0 || origin === null)
-    origin = "centroid";
+  if (origin === void 0 || origin === null) origin = "centroid";
   if (Array.isArray(origin) || typeof origin === "object")
     return _invariant.getCoord.call(void 0, origin);
   const bbox = geojson.bbox ? geojson.bbox : _bbox.bbox.call(void 0, geojson, { recompute: true });
@@ -66,23 +60,35 @@ function defineOrigin(geojson, origin) {
   const north = bbox[3];
   switch (origin) {
     case "sw":
+    // @ts-expect-error undocumented, to be removed for v8 #techdebt
     case "southwest":
+    // @ts-expect-error undocumented, to be removed for v8 #techdebt
     case "westsouth":
+    // @ts-expect-error undocumented, to be removed for v8 #techdebt
     case "bottomleft":
       return _helpers.point.call(void 0, [west, south]);
     case "se":
+    // @ts-expect-error undocumented, to be removed for v8 #techdebt
     case "southeast":
+    // @ts-expect-error undocumented, to be removed for v8 #techdebt
     case "eastsouth":
+    // @ts-expect-error undocumented, to be removed for v8 #techdebt
     case "bottomright":
       return _helpers.point.call(void 0, [east, south]);
     case "nw":
+    // @ts-expect-error undocumented, to be removed for v8 #techdebt
     case "northwest":
+    // @ts-expect-error undocumented, to be removed for v8 #techdebt
     case "westnorth":
+    // @ts-expect-error undocumented, to be removed for v8 #techdebt
     case "topleft":
       return _helpers.point.call(void 0, [west, north]);
     case "ne":
+    // @ts-expect-error undocumented, to be removed for v8 #techdebt
     case "northeast":
+    // @ts-expect-error undocumented, to be removed for v8 #techdebt
     case "eastnorth":
+    // @ts-expect-error undocumented, to be removed for v8 #techdebt
     case "topright":
       return _helpers.point.call(void 0, [east, north]);
     case "center":

package/node_modules/@turf/transform-scale/dist/cjs/index.cjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../../index.ts"],"names":[],"mappings":";AAEA,SAAS,aAAa;AACtB,SAAS,cAAc;AACvB,SAAS,gBAAgB;AACzB,SAAS,QAAQ,gBAAgB;AACjC,SAAS,oBAAoB;AAC7B,SAAS,qBAAqB;AAC9B,SAAS,wBAAwB;AACjC,SAAS,WAAW,mBAAmB;AACvC,SAAS,OAAO,gBAAgB;AAChC,SAAS,UAAU,WAAW,eAAe;AAuB7C,SAAS,eACP,SACA,QACA,SAIG;AAEH,YAAU,WAAW,CAAC;AACtB,MAAI,CAAC,SAAS,OAAO;AAAG,UAAM,IAAI,MAAM,oBAAoB;AAC5D,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,SAAS,QAAQ,UAAU;AAGjC,MAAI,CAAC;AAAS,UAAM,IAAI,MAAM,kBAAkB;AAChD,MAAI,OAAO,WAAW,YAAY,UAAU;AAC1C,UAAM,IAAI,MAAM,gBAAgB;AAClC,QAAM,gBAAgB,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW;AAGjE,MAAI,WAAW;AAAM,cAAU,MAAM,OAAO;AAI5C,MAAI,QAAQ,SAAS,uBAAuB,CAAC,eAAe;AAC1D,gBAAY,SAAS,SAAU,SAAS,OAAO;AAG7C,MAAC,QAA8B,SAAS,KAAK,IAAI;AAAA,QAC/C;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,CAAC;AACD,WAAO;AAAA,EACT;AAEA,SAAO,MAAM,SAAS,QAAQ,MAAM;AACtC;AAWA,SAAS,MACP,SACA,QACA,QACG;AAEH,QAAM,UAAU,QAAQ,OAAO,MAAM;AAErC,QAAM,cAAqB,aAAa,SAAS,MAAM;AAGvD,MAAI,WAAW,KAAK;AAAS,WAAO;AAGpC,YAAU,SAAS,SAAU,OAAO;AAClC,UAAM,mBAAmB,cAAc,aAAa,KAAK;AACzD,UAAM,UAAU,aAAa,aAAa,KAAK;AAC/C,UAAM,cAAc,mBAAmB;AACvC,UAAM,WAAW;AAAA,MACf,iBAAiB,aAAa,aAAa,OAAO;AAAA,IACpD;AACA,UAAM,CAAC,IAAI,SAAS,CAAC;AACrB,UAAM,CAAC,IAAI,SAAS,CAAC;AACrB,QAAI,MAAM,WAAW;AAAG,YAAM,CAAC,KAAK;AAAA,EACtC,CAAC;AAED,SAAO,QAAQ;AAEf,SAAO;AACT;AAUA,SAAS,aACP,SACA,QACO;AAEP,MAAI,WAAW,UAAa,WAAW;AAAM,aAAS;AAGtD,MAAI,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW;AAC7C,WAAO,SAAS,MAAM;AAGxB,QAAM,OAAO,QAAQ,OACjB,QAAQ,OACR,SAAS,SAAS,EAAE,WAAW,KAAK,CAAC;AACzC,QAAM,OAAO,KAAK,CAAC;AACnB,QAAM,QAAQ,KAAK,CAAC;AACpB,QAAM,OAAO,KAAK,CAAC;AACnB,QAAM,QAAQ,KAAK,CAAC;AAOpB,UAAQ,QAAQ;AAAA,IACd,KAAK;AAAA,IAEL,KAAK;AAAA,IAEL,KAAK;AAAA,IAEL,KAAK;AACH,aAAO,MAAM,CAAC,MAAM,KAAK,CAAC;AAAA,IAC5B,KAAK;AAAA,IAEL,KAAK;AAAA,IAEL,KAAK;AAAA,IAEL,KAAK;AACH,aAAO,MAAM,CAAC,MAAM,KAAK,CAAC;AAAA,IAC5B,KAAK;AAAA,IAEL,KAAK;AAAA,IAEL,KAAK;AAAA,IAEL,KAAK;AACH,aAAO,MAAM,CAAC,MAAM,KAAK,CAAC;AAAA,IAC5B,KAAK;AAAA,IAEL,KAAK;AAAA,IAEL,KAAK;AAAA,IAEL,KAAK;AACH,aAAO,MAAM,CAAC,MAAM,KAAK,CAAC;AAAA,IAC5B,KAAK;AACH,aAAO,OAAO,OAAO;AAAA,IACvB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,SAAS,OAAO;AAAA,IACzB;AACE,YAAM,IAAI,MAAM,gBAAgB;AAAA,EACpC;AAEF;AAGA,IAAO,+BAAQ","sourcesContent":["import { Corners, Coord } from \"@turf/helpers\";\nimport { FeatureCollection, GeoJSON, GeometryCollection } from \"geojson\";\nimport { clone } from \"@turf/clone\";\nimport { center } from \"@turf/center\";\nimport { centroid } from \"@turf/centroid\";\nimport { bbox as turfBBox } from \"@turf/bbox\";\nimport { rhumbBearing } from \"@turf/rhumb-bearing\";\nimport { rhumbDistance } from \"@turf/rhumb-distance\";\nimport { rhumbDestination } from \"@turf/rhumb-destination\";\nimport { coordEach, featureEach } from \"@turf/meta\";\nimport { point, isObject } from \"@turf/helpers\";\nimport { getCoord, getCoords, getType } from \"@turf/invariant\";\n\n/*\n Scale GeoJSON objects from a given point by a scaling factor e.g. factor=2\n * would make each object 200% larger.\n * If a FeatureCollection is provided, the origin point will be calculated\n * based on each individual feature _unless_ an exact\n \n @name transformScale\n * @param {GeoJSON\|GeometryCollection} geojson objects to be scaled\n * @param {number} factor of scaling, positive values greater than 0. Numbers between 0 and 1 will shrink the geojson, numbers greater than 1 will expand it, a factor of 1 will not change the geojson.\n * @param {Object} [options={}] Optional parameters\n * @param {Corners\|Coord} [options.origin='centroid'] Point from which the scaling will occur (string options: sw/se/nw/ne/center/centroid)\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance improvement if true)\n * @returns {GeoJSON\|GeometryCollection} scaled GeoJSON\n * @example\n * const poly = turf.polygon([[[0,29],[3.5,29],[2.5,32],[0,29]]]);\n * const scaledPoly = turf.transformScale(poly, 3);\n \n //addToMap\n * const addToMap = [poly, scaledPoly];\n * scaledPoly.properties = {stroke: '#F00', 'stroke-width': 4};\n /\nfunction transformScale<T extends GeoJSON \| GeometryCollection>(\n geojson: T,\n factor: number,\n options?: {\n origin?: Corners \| Coord;\n mutate?: boolean;\n }\n): T {\n // Optional parameters\n options = options \|\| {};\n if (!isObject(options)) throw new Error(\"options is invalid\");\n const origin = options.origin \|\| \"centroid\";\n const mutate = options.mutate \|\| false;\n\n // Input validation\n if (!geojson) throw new Error(\"geojson required\");\n if (typeof factor !== \"number\" \|\| factor <= 0)\n throw new Error(\"invalid factor\");\n const originIsPoint = Array.isArray(origin) \|\| typeof origin === \"object\";\n\n // Clone geojson to avoid side effects\n if (mutate !== true) geojson = clone(geojson);\n\n // Scale each Feature separately if a feature collection AND the user didn't\n // pass a single explicit point to scale the whole collection from.\n if (geojson.type === \"FeatureCollection\" && !originIsPoint) {\n featureEach(geojson, function (feature, index) {\n // The type guard above is not recognised in the callback so we have to\n // cast to accept responsibility.\n (geojson as FeatureCollection).features[index] = scale(\n feature,\n factor,\n origin\n );\n });\n return geojson;\n }\n // Scale Feature/Geometry\n return scale(geojson, factor, origin);\n}\n\n/\n Scale Feature/Geometry\n \n @private\n * @param {GeoJSON\|GeometryCollection} feature feature or geometry collection to scale\n * @param {number} factor of scaling, positive or negative values greater than 0\n * @param {Corners\|Coord} [origin=\"centroid\"] Point from which the scaling will occur (string options: sw/se/nw/ne/center/centroid)\n * @returns {GeoJSON\|GeometryCollection} scaled GeoJSON Feature/Geometry\n /\nfunction scale<T extends GeoJSON \| GeometryCollection>(\n feature: T,\n factor: number,\n origin: Corners \| Coord\n): T {\n // Default params\n const isPoint = getType(feature) === \"Point\";\n // Work with a Coord equivalent of the origin from here on.\n const originCoord: Coord = defineOrigin(feature, origin);\n\n // Shortcut no-scaling\n if (factor === 1 \|\| isPoint) return feature;\n\n // Scale each coordinate\n coordEach(feature, function (coord) {\n const originalDistance = rhumbDistance(originCoord, coord);\n const bearing = rhumbBearing(originCoord, coord);\n const newDistance = originalDistance factor;\n const newCoord = getCoords(\n rhumbDestination(originCoord, newDistance, bearing)\n );\n coord[0] = newCoord[0];\n coord[1] = newCoord[1];\n if (coord.length === 3) coord[2] = factor;\n });\n\n delete feature.bbox;\n\n return feature;\n}\n\n/\n Define Origin\n \n @private\n * @param {GeoJSON\|GeometryCollection} geojson GeoJSON\n * @param {Corners\|Coord} origin sw/se/nw/ne/center/centroid\n * @returns {Feature<Point>} Point origin\n /\nfunction defineOrigin(\n geojson: GeoJSON \| GeometryCollection,\n origin: Corners \| Coord\n): Coord {\n // Default params\n if (origin === undefined \|\| origin === null) origin = \"centroid\";\n\n // Input Coord\n if (Array.isArray(origin) \|\| typeof origin === \"object\")\n return getCoord(origin);\n\n // Define BBox\n const bbox = geojson.bbox\n ? geojson.bbox\n : turfBBox(geojson, { recompute: true });\n const west = bbox[0];\n const south = bbox[1];\n const east = bbox[2];\n const north = bbox[3];\n\n // Having to disable eslint below for lines which fail the no-fallthrough\n // rule, though only because of the ts-expect-error rules. Once we remove\n // southeast, bottomright, rightbottom, etc we should be able to remove all\n // these supressions.\n / eslint-disable no-fallthrough /\n switch (origin) {\n case \"sw\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"southwest\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"westsouth\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"bottomleft\":\n return point([west, south]);\n case \"se\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"southeast\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"eastsouth\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"bottomright\":\n return point([east, south]);\n case \"nw\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"northwest\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"westnorth\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"topleft\":\n return point([west, north]);\n case \"ne\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"northeast\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"eastnorth\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"topright\":\n return point([east, north]);\n case \"center\":\n return center(geojson);\n case undefined:\n case null:\n case \"centroid\":\n return centroid(geojson);\n default:\n throw new Error(\"invalid origin\");\n }\n / eslint-enable no-fallthrough */\n}\n\nexport { transformScale };\nexport default transformScale;\n"]}
1	+ {"version":3,"sources":["/home/runner/work/turf/turf/packages/turf-transform-scale/dist/cjs/index.cjs","../../index.ts"],"names":[],"mappings":"AAAA;ACEA,oCAAsB;AACtB,sCAAuB;AACvB,0CAAyB;AACzB,kCAAiC;AACjC,mDAA6B;AAC7B,qDAA8B;AAC9B,2DAAiC;AACjC,kCAAuC;AACvC,wCAAgC;AAChC,4CAA6C;AAuB7C,SAAS,cAAA,CACP,OAAA,EACA,MAAA,EACA,OAAA,EAIG;AAEH,EAAA,QAAA,EAAU,QAAA,GAAW,CAAC,CAAA;AACtB,EAAA,GAAA,CAAI,CAAC,+BAAA,OAAgB,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,oBAAoB,CAAA;AAC5D,EAAA,MAAM,OAAA,EAAS,OAAA,CAAQ,OAAA,GAAU,UAAA;AACjC,EAAA,MAAM,OAAA,EAAS,OAAA,CAAQ,OAAA,GAAU,KAAA;AAGjC,EAAA,GAAA,CAAI,CAAC,OAAA,EAAS,MAAM,IAAI,KAAA,CAAM,kBAAkB,CAAA;AAChD,EAAA,GAAA,CAAI,OAAO,OAAA,IAAW,SAAA,GAAY,OAAA,GAAU,CAAA;AAC1C,IAAA,MAAM,IAAI,KAAA,CAAM,gBAAgB,CAAA;AAClC,EAAA,MAAM,cAAA,EAAgB,KAAA,CAAM,OAAA,CAAQ,MAAM,EAAA,GAAK,OAAO,OAAA,IAAW,QAAA;AAGjE,EAAA,GAAA,CAAI,OAAA,IAAW,IAAA,EAAM,QAAA,EAAU,0BAAA,OAAa,CAAA;AAI5C,EAAA,GAAA,CAAI,OAAA,CAAQ,KAAA,IAAS,oBAAA,GAAuB,CAAC,aAAA,EAAe;AAC1D,IAAA,+BAAA,OAAY,EAAS,QAAA,CAAU,OAAA,EAAS,KAAA,EAAO;AAG7C,MAAC,OAAA,CAA8B,QAAA,CAAS,KAAK,EAAA,EAAI,KAAA;AAAA,QAC/C,OAAA;AAAA,QACA,MAAA;AAAA,QACA;AAAA,MACF,CAAA;AAAA,IACF,CAAC,CAAA;AACD,IAAA,OAAO,OAAA;AAAA,EACT;AAEA,EAAA,OAAO,KAAA,CAAM,OAAA,EAAS,MAAA,EAAQ,MAAM,CAAA;AACtC;AAWA,SAAS,KAAA,CACP,OAAA,EACA,MAAA,EACA,MAAA,EACG;AAEH,EAAA,MAAM,QAAA,EAAU,gCAAA,OAAe,EAAA,IAAM,OAAA;AAErC,EAAA,MAAM,YAAA,EAAqB,YAAA,CAAa,OAAA,EAAS,MAAM,CAAA;AAGvD,EAAA,GAAA,CAAI,OAAA,IAAW,EAAA,GAAK,OAAA,EAAS,OAAO,OAAA;AAGpC,EAAA,6BAAA,OAAU,EAAS,QAAA,CAAU,KAAA,EAAO;AAClC,IAAA,MAAM,iBAAA,EAAmB,0CAAA,WAAc,EAAa,KAAK,CAAA;AACzD,IAAA,MAAM,QAAA,EAAU,wCAAA,WAAa,EAAa,KAAK,CAAA;AAC/C,IAAA,MAAM,YAAA,EAAc,iBAAA,EAAmB,MAAA;AACvC,IAAA,MAAM,SAAA,EAAW,kCAAA;AAAA,MACf,gDAAA,WAAiB,EAAa,WAAA,EAAa,OAAO;AAAA,IACpD,CAAA;AACA,IAAA,KAAA,CAAM,CAAC,EAAA,EAAI,QAAA,CAAS,CAAC,CAAA;AACrB,IAAA,KAAA,CAAM,CAAC,EAAA,EAAI,QAAA,CAAS,CAAC,CAAA;AACrB,IAAA,GAAA,CAAI,KAAA,CAAM,OAAA,IAAW,CAAA,EAAG,KAAA,CAAM,CAAC,EAAA,GAAK,MAAA;AAAA,EACtC,CAAC,CAAA;AAED,EAAA,OAAO,OAAA,CAAQ,IAAA;AAEf,EAAA,OAAO,OAAA;AACT;AAUA,SAAS,YAAA,CACP,OAAA,EACA,MAAA,EACO;AAEP,EAAA,GAAA,CAAI,OAAA,IAAW,KAAA,EAAA,GAAa,OAAA,IAAW,IAAA,EAAM,OAAA,EAAS,UAAA;AAGtD,EAAA,GAAA,CAAI,KAAA,CAAM,OAAA,CAAQ,MAAM,EAAA,GAAK,OAAO,OAAA,IAAW,QAAA;AAC7C,IAAA,OAAO,iCAAA,MAAe,CAAA;AAGxB,EAAA,MAAM,KAAA,EAAO,OAAA,CAAQ,KAAA,EACjB,OAAA,CAAQ,KAAA,EACR,wBAAA,OAAS,EAAS,EAAE,SAAA,EAAW,KAAK,CAAC,CAAA;AACzC,EAAA,MAAM,KAAA,EAAO,IAAA,CAAK,CAAC,CAAA;AACnB,EAAA,MAAM,MAAA,EAAQ,IAAA,CAAK,CAAC,CAAA;AACpB,EAAA,MAAM,KAAA,EAAO,IAAA,CAAK,CAAC,CAAA;AACnB,EAAA,MAAM,MAAA,EAAQ,IAAA,CAAK,CAAC,CAAA;AAOpB,EAAA,OAAA,CAAQ,MAAA,EAAQ;AAAA,IACd,KAAK,IAAA;AAAA;AAAA,IAEL,KAAK,WAAA;AAAA;AAAA,IAEL,KAAK,WAAA;AAAA;AAAA,IAEL,KAAK,YAAA;AACH,MAAA,OAAO,4BAAA,CAAO,IAAA,EAAM,KAAK,CAAC,CAAA;AAAA,IAC5B,KAAK,IAAA;AAAA;AAAA,IAEL,KAAK,WAAA;AAAA;AAAA,IAEL,KAAK,WAAA;AAAA;AAAA,IAEL,KAAK,aAAA;AACH,MAAA,OAAO,4BAAA,CAAO,IAAA,EAAM,KAAK,CAAC,CAAA;AAAA,IAC5B,KAAK,IAAA;AAAA;AAAA,IAEL,KAAK,WAAA;AAAA;AAAA,IAEL,KAAK,WAAA;AAAA;AAAA,IAEL,KAAK,SAAA;AACH,MAAA,OAAO,4BAAA,CAAO,IAAA,EAAM,KAAK,CAAC,CAAA;AAAA,IAC5B,KAAK,IAAA;AAAA;AAAA,IAEL,KAAK,WAAA;AAAA;AAAA,IAEL,KAAK,WAAA;AAAA;AAAA,IAEL,KAAK,UAAA;AACH,MAAA,OAAO,4BAAA,CAAO,IAAA,EAAM,KAAK,CAAC,CAAA;AAAA,IAC5B,KAAK,QAAA;AACH,MAAA,OAAO,4BAAA,OAAc,CAAA;AAAA,IACvB,KAAK,KAAA,CAAA;AAAA,IACL,KAAK,IAAA;AAAA,IACL,KAAK,UAAA;AACH,MAAA,OAAO,gCAAA,OAAgB,CAAA;AAAA,IACzB,OAAA;AACE,MAAA,MAAM,IAAI,KAAA,CAAM,gBAAgB,CAAA;AAAA,EACpC;AAEF;AAGA,IAAO,6BAAA,EAAQ,cAAA;AD1Ff;AACE;AACA;AACF,wFAAC","file":"/home/runner/work/turf/turf/packages/turf-transform-scale/dist/cjs/index.cjs","sourcesContent":[null,"import { Corners, Coord } from \"@turf/helpers\";\nimport { FeatureCollection, GeoJSON, GeometryCollection } from \"geojson\";\nimport { clone } from \"@turf/clone\";\nimport { center } from \"@turf/center\";\nimport { centroid } from \"@turf/centroid\";\nimport { bbox as turfBBox } from \"@turf/bbox\";\nimport { rhumbBearing } from \"@turf/rhumb-bearing\";\nimport { rhumbDistance } from \"@turf/rhumb-distance\";\nimport { rhumbDestination } from \"@turf/rhumb-destination\";\nimport { coordEach, featureEach } from \"@turf/meta\";\nimport { point, isObject } from \"@turf/helpers\";\nimport { getCoord, getCoords, getType } from \"@turf/invariant\";\n\n/*\n Scale GeoJSON objects from a given point by a scaling factor e.g. factor=2\n * would make each object 200% larger.\n * If a FeatureCollection is provided, the origin point will be calculated\n * based on each individual feature _unless_ an exact\n \n @function\n * @param {GeoJSON\|GeometryCollection} geojson objects to be scaled\n * @param {number} factor of scaling, positive values greater than 0. Numbers between 0 and 1 will shrink the geojson, numbers greater than 1 will expand it, a factor of 1 will not change the geojson.\n * @param {Object} [options={}] Optional parameters\n * @param {Corners\|Coord} [options.origin='centroid'] Point from which the scaling will occur (string options: sw/se/nw/ne/center/centroid)\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance improvement if true)\n * @returns {GeoJSON\|GeometryCollection} scaled GeoJSON\n * @example\n * const poly = turf.polygon([[[0,29],[3.5,29],[2.5,32],[0,29]]]);\n * const scaledPoly = turf.transformScale(poly, 3);\n \n //addToMap\n * const addToMap = [poly, scaledPoly];\n * scaledPoly.properties = {stroke: '#F00', 'stroke-width': 4};\n /\nfunction transformScale<T extends GeoJSON \| GeometryCollection>(\n geojson: T,\n factor: number,\n options?: {\n origin?: Corners \| Coord;\n mutate?: boolean;\n }\n): T {\n // Optional parameters\n options = options \|\| {};\n if (!isObject(options)) throw new Error(\"options is invalid\");\n const origin = options.origin \|\| \"centroid\";\n const mutate = options.mutate \|\| false;\n\n // Input validation\n if (!geojson) throw new Error(\"geojson required\");\n if (typeof factor !== \"number\" \|\| factor <= 0)\n throw new Error(\"invalid factor\");\n const originIsPoint = Array.isArray(origin) \|\| typeof origin === \"object\";\n\n // Clone geojson to avoid side effects\n if (mutate !== true) geojson = clone(geojson);\n\n // Scale each Feature separately if a feature collection AND the user didn't\n // pass a single explicit point to scale the whole collection from.\n if (geojson.type === \"FeatureCollection\" && !originIsPoint) {\n featureEach(geojson, function (feature, index) {\n // The type guard above is not recognised in the callback so we have to\n // cast to accept responsibility.\n (geojson as FeatureCollection).features[index] = scale(\n feature,\n factor,\n origin\n );\n });\n return geojson;\n }\n // Scale Feature/Geometry\n return scale(geojson, factor, origin);\n}\n\n/\n Scale Feature/Geometry\n \n @private\n * @param {GeoJSON\|GeometryCollection} feature feature or geometry collection to scale\n * @param {number} factor of scaling, positive or negative values greater than 0\n * @param {Corners\|Coord} [origin=\"centroid\"] Point from which the scaling will occur (string options: sw/se/nw/ne/center/centroid)\n * @returns {GeoJSON\|GeometryCollection} scaled GeoJSON Feature/Geometry\n /\nfunction scale<T extends GeoJSON \| GeometryCollection>(\n feature: T,\n factor: number,\n origin: Corners \| Coord\n): T {\n // Default params\n const isPoint = getType(feature) === \"Point\";\n // Work with a Coord equivalent of the origin from here on.\n const originCoord: Coord = defineOrigin(feature, origin);\n\n // Shortcut no-scaling\n if (factor === 1 \|\| isPoint) return feature;\n\n // Scale each coordinate\n coordEach(feature, function (coord) {\n const originalDistance = rhumbDistance(originCoord, coord);\n const bearing = rhumbBearing(originCoord, coord);\n const newDistance = originalDistance factor;\n const newCoord = getCoords(\n rhumbDestination(originCoord, newDistance, bearing)\n );\n coord[0] = newCoord[0];\n coord[1] = newCoord[1];\n if (coord.length === 3) coord[2] = factor;\n });\n\n delete feature.bbox;\n\n return feature;\n}\n\n/\n Define Origin\n \n @private\n * @param {GeoJSON\|GeometryCollection} geojson GeoJSON\n * @param {Corners\|Coord} origin sw/se/nw/ne/center/centroid\n * @returns {Feature<Point>} Point origin\n /\nfunction defineOrigin(\n geojson: GeoJSON \| GeometryCollection,\n origin: Corners \| Coord\n): Coord {\n // Default params\n if (origin === undefined \|\| origin === null) origin = \"centroid\";\n\n // Input Coord\n if (Array.isArray(origin) \|\| typeof origin === \"object\")\n return getCoord(origin);\n\n // Define BBox\n const bbox = geojson.bbox\n ? geojson.bbox\n : turfBBox(geojson, { recompute: true });\n const west = bbox[0];\n const south = bbox[1];\n const east = bbox[2];\n const north = bbox[3];\n\n // Having to disable eslint below for lines which fail the no-fallthrough\n // rule, though only because of the ts-expect-error rules. Once we remove\n // southeast, bottomright, rightbottom, etc we should be able to remove all\n // these supressions.\n / eslint-disable no-fallthrough /\n switch (origin) {\n case \"sw\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"southwest\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"westsouth\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"bottomleft\":\n return point([west, south]);\n case \"se\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"southeast\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"eastsouth\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"bottomright\":\n return point([east, south]);\n case \"nw\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"northwest\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"westnorth\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"topleft\":\n return point([west, north]);\n case \"ne\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"northeast\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"eastnorth\":\n // @ts-expect-error undocumented, to be removed for v8 #techdebt\n case \"topright\":\n return point([east, north]);\n case \"center\":\n return center(geojson);\n case undefined:\n case null:\n case \"centroid\":\n return centroid(geojson);\n default:\n throw new Error(\"invalid origin\");\n }\n / eslint-enable no-fallthrough */\n}\n\nexport { transformScale };\nexport default transformScale;\n"]}

package/node_modules/@turf/transform-scale/dist/cjs/index.d.cts CHANGED Viewed

@@ -7,7 +7,7 @@ import { GeoJSON, GeometryCollection } from 'geojson';
  * If a FeatureCollection is provided, the origin point will be calculated
  * based on each individual feature _unless_ an exact
  *
- * @name transformScale
+ * @function
  * @param {GeoJSON|GeometryCollection} geojson objects to be scaled
  * @param {number} factor of scaling, positive values greater than 0. Numbers between 0 and 1 will shrink the geojson, numbers greater than 1 will expand it, a factor of 1 will not change the geojson.
  * @param {Object} [options={}] Optional parameters

package/node_modules/@turf/transform-scale/dist/esm/index.d.ts CHANGED Viewed

@@ -7,7 +7,7 @@ import { GeoJSON, GeometryCollection } from 'geojson';
  * If a FeatureCollection is provided, the origin point will be calculated
  * based on each individual feature _unless_ an exact
  *
- * @name transformScale
+ * @function
  * @param {GeoJSON|GeometryCollection} geojson objects to be scaled
  * @param {number} factor of scaling, positive values greater than 0. Numbers between 0 and 1 will shrink the geojson, numbers greater than 1 will expand it, a factor of 1 will not change the geojson.
  * @param {Object} [options={}] Optional parameters