dgeoutils 2.2.17 → 2.2.18

package/dist/DPoint.d.ts

@@ -102,5 +102,5 @@ export declare class DPoint {
     setIfLessThan(p: DPoint): DPoint;
     minus(): DPoint;
     orthodromicPath(point: DPoint, pointsCount?: number): DPolygon;
-    findCloserPoint(p: DPolygon): DPoint;
+    sortByDistance(p: DPolygon): DPolygon;
 }

package/dist/DPoint.js

@@ -462,17 +462,15 @@ class DPoint {
             return new DPoint(x, y).radiansToDegrees();
         }));
     }
-    findCloserPoint(p) {
-        let d = Infinity;
-        let res = DPoint.zero();
-        for (const t of p.points) {
-            const td = this.distance(t);
-            if (td < d) {
-                d = td;
-                res = t.clone();
-            }
-        }
-        return res;
+    sortByDistance(p) {
+        return p
+            .clone()
+            .map((d, index) => {
+            d.properties.distance = d.distance(this);
+            d.properties.index = index;
+            return d;
+        })
+            .sort((a, b) => a.properties.distance - b.properties.distance);
     }
 }
 exports.DPoint = DPoint;

package/dist/DPolygon.d.ts

@@ -58,6 +58,7 @@ export declare class DPolygon {
     filter(f: (p: DPoint) => boolean): DPolygon;
     map(f: (r: DPoint) => DPoint): DPolygon;
     map(f: (r: DPoint, index: number) => DPoint): DPolygon;
+    sort(f: (a: DPoint, b: DPoint) => number): DPolygon;
     at(index: number): DPoint;
     pop(): DPoint;
     push(...args: DPoint[]): number;

package/dist/DPolygon.js

@@ -349,6 +349,10 @@ class DPolygon {
         this.holes = this.holes.map((h) => h.map(f));
         return this;
     }
+    sort(f) {
+        this.points.sort(f);
+        return this;
+    }
     at(index) {
         const { length } = this;
         return this.points[(index % length + length) % length];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "dgeoutils",
-  "version": "2.2.17",
+  "version": "2.2.18",
   "description": "",
   "scripts": {
     "build": "node_modules/.bin/tsc",