vis-why 1.2.3 → 2.0.0

package/index.js

@@ -1,37 +1,32 @@
-var heap = require('sterta');
-
-module.exports = simplify;
+import heap from 'sterta';
 
 function areaLL(a, b, c) {
   return Math.abs(
-    (a[0] - c[0]) * (b[1] - a[1]) -
-    (a[0] - b[0]) * (c[1] - a[1])
+    (a[0] - c[0]) * (b[1] - a[1]) - (a[0] - b[0]) * (c[1] - a[1])
   );
 }
 
-
 function areaCompare(p, q) {
   return p.area - q.area;
 }
 
-
 function calculate(poly, area) {
-  var i,
-    ts = { heap: heap(areaCompare, true) },
-    triangle,
-    trianglePrev,
-    a = poly[0],
-    b, c = poly[1],
-    list = [];
+  const ts = { heap: heap(areaCompare, true) };
+  let triangle;
+  let trianglePrev;
+  let a = poly[0];
+  let b;
+  let c = poly[1];
+  const list = [];
 
   // calculate areas
-  for (i = 2; i < poly.length; i++) {
+  for (let i = 2; i < poly.length; i++) {
     b = c;
     c = poly[i];
     triangle = {
-      a: a,
-      b: b,
-      c: c,
+      a,
+      b,
+      c,
       area: area(a, b, c),
       next: null,
       prev: trianglePrev,
@@ -56,12 +51,11 @@ function calculate(poly, area) {
   return ts;
 }
 
-
 function eliminate(ts, limit, area) {
-  var triangle,
-    prevTriangle,
-    nextTriangle,
-    counter = ts.heap.size() - limit;
+  let triangle;
+  let prevTriangle;
+  let nextTriangle;
+  let counter = ts.heap.size() - limit;
 
   while (counter-- > 0) {
     triangle = ts.heap.pop();
@@ -88,9 +82,8 @@ function eliminate(ts, limit, area) {
   }
 }
 
-
 function collect(triangle) {
-  var poly = [triangle.a];
+  const poly = [triangle.a];
 
   while (true) {
     poly.push(triangle.b);
@@ -105,8 +98,7 @@ function collect(triangle) {
   return poly;
 }
 
-
-function simplify(poly, limit, area) {
+export default function simplify(poly, limit, area = areaLL) {
   if (poly.length < 3) {
     return poly;
   }
@@ -119,10 +111,7 @@ function simplify(poly, limit, area) {
     return poly;
   }
 
-  // default area function
-  area = area || areaLL;
-
-  var ts = calculate(poly, area);
+  const ts = calculate(poly, area);
   if (!ts.first) {
     // empty heap - straight line with all triangles empty
     return [poly[0], poly[poly.length - 1]];

package/package.json

@@ -1,12 +1,16 @@
 {
   "name": "vis-why",
-  "version": "1.2.3",
+  "version": "2.0.0",
   "description": "M Visvalingam and J D Whyatt line simplification algorithm",
   "main": "index.js",
+  "type": "module",
   "scripts": {
     "test": "make check"
   },
-  "repository": "pirxpilot/vis-why",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/pirxpilot/vis-why.git"
+  },
   "keywords": [
     "line",
     "simplification"
@@ -15,13 +19,12 @@
   "license": "MIT",
   "homepage": "https://github.com/pirxpilot/vis-why",
   "devDependencies": {
-    "@pirxpilot/jshint": "~3",
-    "@pirxpilot/matcha": "~1",
-    "polyline-encoded": "^0.0.8",
-    "should": "~13"
+    "@biomejs/biome": "^1.9.4",
+    "@pirxpilot/google-polyline": "^3.0.2",
+    "@pirxpilot/matcha": "~1"
   },
   "dependencies": {
-    "sterta": "^2.2.1"
+    "sterta": "~3"
   },
   "files": [
     "index.js"