@turf/unkink-polygon - npm Package Compare versions

Comparing version 5.1.0 to 5.1.1

lib/geojson-polygon-self-intersections.js

 // Find self-intersections in geojson polygon (possibly with interior rings)
-var rbush = require('rbush');
+import rbush from 'rbush';
 
@@ -4,0 +4,0 @@ export default function (feature, filterFn, useSpatialIndex) {

lib/simplepolygon.js

@@ -5,3 +5,3 @@ import isects from './geojson-polygon-self-intersections';
 import booleanPointInPolygon from '@turf/boolean-point-in-polygon';
-var rbush = require('rbush');
+import rbush from 'rbush';
 
@@ -8,0 +8,0 @@ /**

main.js

@@ -7,2 +7,3 @@ 'use strict';
 var helpers = require('@turf/helpers');
+var rbush = _interopDefault(require('rbush'));
 var area = _interopDefault(require('@turf/area'));
@@ -12,4 +13,2 @@ var booleanPointInPolygon = _interopDefault(require('@turf/boolean-point-in-polygon'));
 // Find self-intersections in geojson polygon (possibly with interior rings)
-var rbush$1 = require('rbush');
-
 var isects = function (feature, filterFn, useSpatialIndex) {
@@ -31,3 +30,3 @@ if (feature.geometry.type !== 'Polygon') { throw new Error('The input feature must be a Polygon'); }
         }
-        var tree = rbush$1();
+        var tree = rbush();
         tree.load(allEdgesAsRbushTreeItems);
@@ -165,4 +164,2 @@ }
 
-var rbush = require('rbush');
-
 /**
@@ -169,0 +166,0 @@ * Takes a complex (i.e. self-intersecting) geojson polygon, and breaks it down into its composite simple, non-self-intersecting one-ring polygons.

package.json

 {
   "name": "@turf/unkink-polygon",
-  "version": "5.1.0",
+  "version": "5.1.1",
   "description": "turf unkink-polygon module",
@@ -5,0 +5,0 @@ "main": "main.js",

No alert changes

Worsened metrics

Total package byte prevSize

101645

decreased by-0.06%

Lines of code

1589

decreased by-0.13%

No dependency changes