node-red-contrib-tak-registration 0.16.3 → 0.16.5

package/node_modules/splaytree-ts/dist/splaytree-ts.umd.min.js

@@ -1,2 +0,0 @@
-// splaytree-ts v1.0.2 Copyright (c) 2022, Luiz Felipe Machado Barboza
-!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?e(exports):"function"==typeof define&&define.amd?define(["exports"],e):e((t="undefined"!=typeof globalThis?globalThis:t||self)["splaytree-ts"]=t["splaytree-ts"]||{})}(this,(function(t){"use strict";class e{key;left=null;right=null;constructor(t){this.key=t}}class i extends e{constructor(t){super(t)}}class s extends e{value;constructor(t,e){super(t),this.value=e}replaceValue(t){const e=new s(this.key,t);return e.left=this.left,e.right=this.right,e}}class r{size=0;modificationCount=0;splayCount=0;splay(t){const e=this.root;if(null==e)return this.compare(t,t),-1;let i=null,s=null,r=null,o=null,l=e;const n=this.compare;let h;for(;;)if(h=n(l.key,t),h>0){let e=l.left;if(null==e)break;if(h=n(e.key,t),h>0&&(l.left=e.right,e.right=l,l=e,e=l.left,null==e))break;null==i?s=l:i.left=l,i=l,l=e}else{if(!(h<0))break;{let e=l.right;if(null==e)break;if(h=n(e.key,t),h<0&&(l.right=e.left,e.left=l,l=e,e=l.right,null==e))break;null==r?o=l:r.right=l,r=l,l=e}}return null!=r&&(r.right=l.left,l.left=o),null!=i&&(i.left=l.right,l.right=s),this.root!==l&&(this.root=l,this.splayCount++),h}splayMin(t){let e=t,i=e.left;for(;null!=i;){const t=i;e.left=t.right,t.right=e,e=t,i=e.left}return e}splayMax(t){let e=t,i=e.right;for(;null!=i;){const t=i;e.right=t.left,t.left=e,e=t,i=e.right}return e}_delete(t){if(null==this.root)return null;if(0!=this.splay(t))return null;let e=this.root;const i=e,s=e.left;if(this.size--,null==s)this.root=e.right;else{const t=e.right;e=this.splayMax(s),e.right=t,this.root=e}return this.modificationCount++,i}addNewRoot(t,e){this.size++,this.modificationCount++;const i=this.root;null!=i?(e<0?(t.left=i,t.right=i.right,i.right=null):(t.right=i,t.left=i.left,i.left=null),this.root=t):this.root=t}_first(){const t=this.root;return null==t?null:(this.root=this.splayMin(t),this.root)}_last(){const t=this.root;return null==t?null:(this.root=this.splayMax(t),this.root)}clear(){this.root=null,this.size=0,this.modificationCount++}has(t){return this.validKey(t)&&0==this.splay(t)}defaultCompare(){return(t,e)=>t<e?-1:t>e?1:0}wrap(){return{getRoot:()=>this.root,setRoot:t=>{this.root=t},getSize:()=>this.size,getModificationCount:()=>this.modificationCount,getSplayCount:()=>this.splayCount,setSplayCount:t=>{this.splayCount=t},splay:t=>this.splay(t),has:t=>this.has(t)}}}class o extends r{root=null;compare;validKey;constructor(t,e){super(),this.compare=t??this.defaultCompare(),this.validKey=e??(t=>null!=t&&null!=t)}delete(t){return!!this.validKey(t)&&null!=this._delete(t)}forEach(t){const e=new f(this.wrap());let i;for(;i=e.next(),!i.done;)t(i.value[1],i.value[0],this)}get(t){if(this.validKey(t)&&null!=this.root){if(0==this.splay(t))return this.root.value}}hasValue(t){const e=this.splayCount,i=s=>{for(;null!=s;){if(s.value==t)return!0;if(e!=this.splayCount)throw"Concurrent modification during iteration.";if(null!=s.right&&i(s.right))return!0;s=s.left}return!1};return i(this.root)}set(t,e){const i=this.splay(t);return 0==i?(this.root=this.root.replaceValue(e),this.splayCount+=1,this):(this.addNewRoot(new s(t,e),i),this)}setAll(t){t.forEach(((t,e)=>{this.set(e,t)}))}setIfAbsent(t,e){let i=this.splay(t);if(0==i)return this.root.value;const r=this.modificationCount,o=this.splayCount,l=e();if(r!=this.modificationCount)throw"Concurrent modification during iteration.";return o!=this.splayCount&&(i=this.splay(t)),this.addNewRoot(new s(t,l),i),l}isEmpty(){return null==this.root}isNotEmpty(){return!this.isEmpty()}firstKey(){return null==this.root?null:this._first().key}lastKey(){return null==this.root?null:this._last().key}lastKeyBefore(t){if(null==t)throw"Invalid arguments(s)";if(null==this.root)return null;if(this.splay(t)<0)return this.root.key;let e=this.root.left;if(null==e)return null;let i=e.right;for(;null!=i;)e=i,i=e.right;return e.key}firstKeyAfter(t){if(null==t)throw"Invalid arguments(s)";if(null==this.root)return null;if(this.splay(t)>0)return this.root.key;let e=this.root.right;if(null==e)return null;let i=e.left;for(;null!=i;)e=i,i=e.left;return e.key}update(t,e,i){let r=this.splay(t);if(0==r){const i=this.modificationCount,s=this.splayCount,r=e(this.root.value);if(i!=this.modificationCount)throw"Concurrent modification during iteration.";return s!=this.splayCount&&this.splay(t),this.root=this.root.replaceValue(r),this.splayCount+=1,r}if(null!=i){const e=this.modificationCount,o=this.splayCount,l=i();if(e!=this.modificationCount)throw"Concurrent modification during iteration.";return o!=this.splayCount&&(r=this.splay(t)),this.addNewRoot(new s(t,l),r),l}throw"Invalid argument (key): Key not in map."}updateAll(t){if(null==this.root)return;const e=new f(this.wrap());let i;for(;i=e.next(),!i.done;){const s=t(...i.value);e.replaceValue(s)}}keys(){return new h(this.wrap())}values(){return new a(this.wrap())}entries(){return this[Symbol.iterator]()}[Symbol.iterator](){return new f(this.wrap())}[Symbol.toStringTag]="[object Map]"}class l extends r{root=null;compare;validKey;constructor(t,e){super(),this.compare=t??this.defaultCompare(),this.validKey=e??(t=>null!=t&&null!=t)}delete(t){return!!this.validKey(t)&&null!=this._delete(t)}deleteAll(t){for(const e of t)this.delete(e)}forEach(t){const e=this[Symbol.iterator]();let i;for(;i=e.next(),!i.done;)t(i.value,i.value,this)}add(t){const e=this.splay(t);return 0!=e&&this.addNewRoot(new i(t),e),this}addAndReturn(t){const e=this.splay(t);return 0!=e&&this.addNewRoot(new i(t),e),this.root.key}addAll(t){for(const e of t)this.add(e)}isEmpty(){return null==this.root}isNotEmpty(){return null!=this.root}single(){if(0==this.size)throw"Bad state: No element";if(this.size>1)throw"Bad state: Too many element";return this.root.key}first(){if(0==this.size)throw"Bad state: No element";return this._first().key}last(){if(0==this.size)throw"Bad state: No element";return this._last().key}lastBefore(t){if(null==t)throw"Invalid arguments(s)";if(null==this.root)return null;if(this.splay(t)<0)return this.root.key;let e=this.root.left;if(null==e)return null;let i=e.right;for(;null!=i;)e=i,i=e.right;return e.key}firstAfter(t){if(null==t)throw"Invalid arguments(s)";if(null==this.root)return null;if(this.splay(t)>0)return this.root.key;let e=this.root.right;if(null==e)return null;let i=e.left;for(;null!=i;)e=i,i=e.left;return e.key}retainAll(t){const e=new l(this.compare,this.validKey),i=this.modificationCount;for(const s of t){if(i!=this.modificationCount)throw"Concurrent modification during iteration.";this.validKey(s)&&0==this.splay(s)&&e.add(this.root.key)}e.size!=this.size&&(this.root=e.root,this.size=e.size,this.modificationCount++)}lookup(t){if(!this.validKey(t))return null;return 0!=this.splay(t)?null:this.root.key}intersection(t){const e=new l(this.compare,this.validKey);for(const i of this)t.has(i)&&e.add(i);return e}difference(t){const e=new l(this.compare,this.validKey);for(const i of this)t.has(i)||e.add(i);return e}union(t){const e=this.clone();return e.addAll(t),e}clone(){const t=new l(this.compare,this.validKey);return t.size=this.size,t.root=this.copyNode(this.root),t}copyNode(t){if(null==t)return null;const e=new i(t.key);return function t(e,s){let r,o;do{if(r=e.left,o=e.right,null!=r){const e=new i(r.key);s.left=e,t(r,e)}if(null!=o){const t=new i(o.key);s.right=t,e=o,s=t}}while(null!=o)}(t,e),e}toSet(){return this.clone()}entries(){return new u(this.wrap())}keys(){return this[Symbol.iterator]()}values(){return this[Symbol.iterator]()}[Symbol.iterator](){return new h(this.wrap())}[Symbol.toStringTag]="[object Set]"}class n{tree;path=new Array;modificationCount=null;splayCount;constructor(t){this.tree=t,this.splayCount=t.getSplayCount()}[Symbol.iterator](){return this}next(){return this.moveNext()?{done:!1,value:this.current()}:{done:!0,value:null}}current(){if(!this.path.length)return null;const t=this.path[this.path.length-1];return this.getValue(t)}rebuildPath(t){this.path.splice(0,this.path.length),this.tree.splay(t),this.path.push(this.tree.getRoot()),this.splayCount=this.tree.getSplayCount()}findLeftMostDescendent(t){for(;null!=t;)this.path.push(t),t=t.left}moveNext(){if(this.modificationCount!=this.tree.getModificationCount()){if(null==this.modificationCount){this.modificationCount=this.tree.getModificationCount();let t=this.tree.getRoot();for(;null!=t;)this.path.push(t),t=t.left;return this.path.length>0}throw"Concurrent modification during iteration."}if(!this.path.length)return!1;this.splayCount!=this.tree.getSplayCount()&&this.rebuildPath(this.path[this.path.length-1].key);let t=this.path[this.path.length-1],e=t.right;if(null!=e){for(;null!=e;)this.path.push(e),e=e.left;return!0}for(this.path.pop();this.path.length&&this.path[this.path.length-1].right===t;)t=this.path.pop();return this.path.length>0}}class h extends n{getValue(t){return t.key}}class u extends n{getValue(t){return[t.key,t.key]}}class a extends n{constructor(t){super(t)}getValue(t){return t.value}}class f extends n{constructor(t){super(t)}getValue(t){return[t.key,t.value]}replaceValue(t){if(this.modificationCount!=this.tree.getModificationCount())throw"Concurrent modification during iteration.";this.splayCount!=this.tree.getSplayCount()&&this.rebuildPath(this.path[this.path.length-1].key);const e=this.path.pop(),i=e.replaceValue(t);if(this.path.length){const t=this.path[this.path.length-1];e===t.left?t.left=i:t.right=i}else this.tree.setRoot(i);this.path.push(i);const s=this.tree.getSplayCount()+1;this.tree.setSplayCount(s),this.splayCount=s}}t.SplayTreeMap=o,t.SplayTreeSet=l,t.version="1.0.2",Object.defineProperty(t,"__esModule",{value:!0})}));

package/node_modules/splaytree-ts/package.json

@@ -1,59 +0,0 @@
-{
-  "name": "splaytree-ts",
-  "description": "A splay tree typescript library",
-  "version": "1.0.2",
-  "author": {
-    "name": "Luiz Felipe Machado Barboza"
-  },
-  "license": "BDS-3-Clause",
-  "type": "module",
-  "main": "dist/esm/index.js",
-  "module": "dist/esm/index.js",
-  "jsdelivr": "dist/splaytree-ts.umd.js",
-  "unpkg": "dist/splaytree-ts.umd.js",
-  "types": "dist/esm/index.d.ts",
-  "exports": {
-    "umd": "./dist/splaytree-ts.umd.js",
-    "import": "./dist/esm/index.js",
-    "require": "./dist/cjs/index.cjs",
-    "default": "./dist/cjs/index.cjs"
-  },
-  "files": [
-    "dist"
-  ],
-  "keywords": [
-    "splay",
-    "tree",
-    "map",
-    "set",
-    "self-balancing",
-    "binary",
-    "search"
-  ],
-  "repository": {
-    "type": "git",
-    "url": "https://github.com/SBanksX/splaytree-ts.git"
-  },
-  "scripts": {
-    "preversion": "npm run test",
-    "version": "npm run build && git add -A",
-    "postversion": "git push && git push --tags",
-    "build": "rollup -c && tsup",
-    "test": "npm run test:typecheck && npm run test:lint",
-    "test:lint": "eslint src",
-    "test:typecheck": "tsc --noEmit"
-  },
-  "devDependencies": {
-    "@typescript-eslint/eslint-plugin": "^5.25.0",
-    "@typescript-eslint/parser": "^5.25.0",
-    "@babel/preset-env": "^7.19.0",
-    "@babel/preset-typescript": "^7.18.6",
-    "@rollup/plugin-json": "4",
-    "@rollup/plugin-node-resolve": "13",
-    "@rollup/plugin-typescript": "^8.5.0",
-    "rollup-plugin-terser": "7",
-    "eslint": "^8.16.0",
-    "eslint-config-prettier": "^8.5.0",
-    "tsup": "^8.3.5"
-  }
-}

package/node_modules/sweepline-intersections/LICENSE

@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) 2019 Rowan Winsemius
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.

package/node_modules/sweepline-intersections/README.md

@@ -1,118 +0,0 @@
-# sweepline-intersections
-A small and fast module using a sweepline algorithm to detect intersections between polygons and/or polylines.
-
-## Documentation
-
-### Install
-````
-npm install sweepline-intersections
-````
-
-### Basic Use
-Valid inputs: Geojson `Feature` or `Geometry` including `Polygon`, `LineString`, `MultiPolygon`, `MultiLineString`, as well as `FeatureCollection`.
-
-Returns an array of intersection points eg, [[x1, y1], [x2, y2]] 
-
-````js
-    const findIntersections = require('sweepline-intersections')
-
-    const box = {type: 'Polygon', coordinates: [[[0, 0], [1, 0], [1, 1], [0, 1], [0, 0]]]}
-    const intersections = findIntersections(box)
-    // returns an array of self-intersection points
-````
-
-Also accepts an optional boolean argument second which when set to true means the module won't detect self-intersections and will only report intersections between different features. This defaults to false.
-eg 
-````js
-    const findIntersections = require('sweepline-intersections')
-    const intersectionsBetweenFeature = findIntersections(featureCollection, true)
-    // returns an array of intersection points between features
-````
-
-### Complex Use
-This library also provide a class-based approach which is helpful if you want to check multiple geometries against a single geometry. This allows you to save the state of the initial event queue with the primary geometry.
-
-````js
-    import SweeplineIntersectionsClass from 'sweepline-intersections/dist/SweeplineIntersectionsClass'
-
-    // create the base instance
-    const sl = new SweeplineIntersectionsClass()
-    // populate the event queue with your primary geometry
-    sl.addData(largeGeoJson)
-    // clone the event queue in the original state so you can reuse it
-    const origQueue = sl.cloneEventQueue()
-
-    // now you can iterate through some other set of features saving
-    // the overhead of having to populate the complete queue multiple times
-    someOtherFeatureCollection.features.forEach(feature => {
-        // add another feature to test against your original data
-        sl.addData(feature, origQueue)
-        // check if those two features intersect
-        // add an optional boolean argument to ignore self-intersections 
-        const intersectionPoints = sl.getIntersections(true)
-    })
-````
-
-#### API
-`new SweeplineIntersectionsClass()` - creates a new instance
-
-`.addData(geojson, existingQueue)` - add geojson to the event queue. The second argument for an `existingQueue` is optional, and takes a queue generated from `.cloneEventQueue()`
-
-`.cloneEventQueue()` - clones the state of the existing event queue that's been populated with geojson. Returns a queue that you can pass to the `addData` method
-
-`.getIntersections(ignoreSelfIntersections)` - Checks for segment intersections. Accepts an optional boolean argument to ignore self intersections are only report intersections between features.
-
-
-## Benchmarks
-Tested against 
-- bentley-ottmann-intersections - https://www.npmjs.com/package/bentley-ottmann-intersections
-- gpsi - https://www.npmjs.com/package/geojson-polygon-self-intersections
-- isects - https://www.npmjs.com/package/2d-polygon-self-intersections
-````
-// Switzerland (~700 vertices)
-// gpsi x 37.05 ops/sec ±1.77% (49 runs sampled)
-// bentleyOttmann x 2,010 ops/sec ±1.52% (89 runs sampled)
-// sweepline x 2,621 ops/sec ±0.29% (95 runs sampled)
-// isects x 14.29 ops/sec ±2.16% (40 runs sampled)
-// - Fastest is sweepline (this library)
-
-// Simple Case (6 vertices)
-// gpsi x 246,512 ops/sec ±1.23% (90 runs sampled)
-// bentleyOttmann x 546,326 ops/sec ±0.66% (92 runs sampled)
-// sweepline x 1,157,425 ops/sec ±1.04% (94 runs sampled)
-// - Fastest is sweepline (this library)
-
-// Chile - Vertical geometry (17,000 vertices)
-// bentleyOttmann x 50.22 ops/sec ±1.75% (65 runs sampled)
-// sweepline x 35.64 ops/sec ±1.20% (62 runs sampled)
-// - Fastest is bentleyOttmann (although it doesn't find intersection)
-````
-
-## Contributing
-- For a live dev server run `npm run debug`. 
-  - The geometry being tested can be modified in `debug/src/App.vue`
-- There are a couple of test suites
-  - `npm run test` runs all tests
-  - `npm run test:e2e` does a general test that the correct number of self-intersections are found in the `test/fixtures` folder
-  - `npm run test:unit` is unit style tests to make sure functions & methods do the right thing
-    - these need some love
-
-
-## Algorithm notes
-The basic concept of this algorithm is based on a sweepline. Where this algorithm differs from the [bentley-ottmann algorithm](https://en.wikipedia.org/wiki/Bentley%E2%80%93Ottmann_algorithm) is that there is no use of a tree data structure to store the segments. The reason for the modification is because if you are dealing with polygons or polylines (rather than a random group of line segments) there is a reasonable assumption that there are going to be very few segments that lie on the same x plane.
-
-Removing the tree structure greatly simplifies the code. The tree structure is replaced with a priority queue of segments which is sorted by the x vertex of the right endpoint of the segments. A priority queue is already used to sort the vertices which means only 1 data structure is required.
-
-The package size of this module is 3kb compared to my implementation of the bentley-ottmann algorithm which is 16kb while performance is typically faster than bentley-ottmann. 
-
-Bentley-ottman only outperforms this library when there are several thousands vertices, however I'm also less confident in the results of my bentley-ottman lib as it occassionally misses intersections and is much harder to write tests for due to the more complex logic.
-
-
-### Algorithm Steps
-- Vertices are entered into a priority queue sorted from left to right
-- An empty priority queue is created to store segments encountered
-- An item is removed from the priority queue
-    - If the vertex is the left endpoint of a segment, we test it against every other segment in the segment queue for intersections with any intersection recorded. We then add the vertex (and it's associated right endpoint) to the segment queue.
-    - When we encounter a right endpoint we remove the first item from the segment queue.
-
-Each pair of segments are only tested once. And only segments that overlap on the x plane are tested against each other.

package/node_modules/sweepline-intersections/dist/SweeplineIntersectionsClass.esm.js

@@ -1,277 +0,0 @@
-class TinyQueue {
-    constructor(data = [], compare = defaultCompare) {
-        this.data = data;
-        this.length = this.data.length;
-        this.compare = compare;
-
-        if (this.length > 0) {
-            for (let i = (this.length >> 1) - 1; i >= 0; i--) this._down(i);
-        }
-    }
-
-    push(item) {
-        this.data.push(item);
-        this.length++;
-        this._up(this.length - 1);
-    }
-
-    pop() {
-        if (this.length === 0) return undefined;
-
-        const top = this.data[0];
-        const bottom = this.data.pop();
-        this.length--;
-
-        if (this.length > 0) {
-            this.data[0] = bottom;
-            this._down(0);
-        }
-
-        return top;
-    }
-
-    peek() {
-        return this.data[0];
-    }
-
-    _up(pos) {
-        const {data, compare} = this;
-        const item = data[pos];
-
-        while (pos > 0) {
-            const parent = (pos - 1) >> 1;
-            const current = data[parent];
-            if (compare(item, current) >= 0) break;
-            data[pos] = current;
-            pos = parent;
-        }
-
-        data[pos] = item;
-    }
-
-    _down(pos) {
-        const {data, compare} = this;
-        const halfLength = this.length >> 1;
-        const item = data[pos];
-
-        while (pos < halfLength) {
-            let left = (pos << 1) + 1;
-            let best = data[left];
-            const right = left + 1;
-
-            if (right < this.length && compare(data[right], best) < 0) {
-                left = right;
-                best = data[right];
-            }
-            if (compare(best, item) >= 0) break;
-
-            data[pos] = best;
-            pos = left;
-        }
-
-        data[pos] = item;
-    }
-}
-
-function defaultCompare(a, b) {
-    return a < b ? -1 : a > b ? 1 : 0;
-}
-
-function checkWhichEventIsLeft (e1, e2) {
-    if (e1.p.x > e2.p.x) return 1
-    if (e1.p.x < e2.p.x) return -1
-
-    if (e1.p.y !== e2.p.y) return e1.p.y > e2.p.y ? 1 : -1
-    return 1
-}
-
-function checkWhichSegmentHasRightEndpointFirst (seg1, seg2) {
-    if (seg1.rightSweepEvent.p.x > seg2.rightSweepEvent.p.x) return 1
-    if (seg1.rightSweepEvent.p.x < seg2.rightSweepEvent.p.x) return -1
-
-    if (seg1.rightSweepEvent.p.y !== seg2.rightSweepEvent.p.y) return seg1.rightSweepEvent.p.y < seg2.rightSweepEvent.p.y ? 1 : -1
-    return 1
-}
-
-class Event {
-
-    constructor (p, featureId, ringId, eventId) {
-        this.p = {
-            x: p[0],
-            y: p[1]
-        };
-        this.featureId = featureId;
-        this.ringId = ringId;
-        this.eventId = eventId;
-
-        this.otherEvent = null;
-        this.isLeftEndpoint = null;
-    }
-
-    isSamePoint (eventToCheck) {
-        return this.p.x === eventToCheck.p.x && this.p.y === eventToCheck.p.y
-    }
-}
-
-function fillEventQueue (geojson, eventQueue) {
-    if (geojson.type === 'FeatureCollection') {
-        const features = geojson.features;
-        for (let i = 0; i < features.length; i++) {
-            processFeature(features[i], eventQueue);
-        }
-    } else {
-        processFeature(geojson, eventQueue);
-    }
-}
-
-let featureId = 0;
-let ringId = 0;
-let eventId = 0;
-function processFeature (featureOrGeometry, eventQueue) {
-    const geom = featureOrGeometry.type === 'Feature' ? featureOrGeometry.geometry : featureOrGeometry;
-    let coords = geom.coordinates;
-    // standardise the input
-    if (geom.type === 'Polygon' || geom.type === 'MultiLineString') coords = [coords];
-    if (geom.type === 'LineString') coords = [[coords]];
-
-    for (let i = 0; i < coords.length; i++) {
-        for (let ii = 0; ii < coords[i].length; ii++) {
-            let currentP = coords[i][ii][0];
-            let nextP = null;
-            ringId = ringId + 1;
-            for (let iii = 0; iii < coords[i][ii].length - 1; iii++) {
-                nextP = coords[i][ii][iii + 1];
-
-                const e1 = new Event(currentP, featureId, ringId, eventId);
-                const e2 = new Event(nextP, featureId, ringId, eventId + 1);
-
-                e1.otherEvent = e2;
-                e2.otherEvent = e1;
-
-                if (checkWhichEventIsLeft(e1, e2) > 0) {
-                    e2.isLeftEndpoint = true;
-                    e1.isLeftEndpoint = false;
-                } else {
-                    e1.isLeftEndpoint = true;
-                    e2.isLeftEndpoint = false;
-                }
-                eventQueue.push(e1);
-                eventQueue.push(e2);
-
-                currentP = nextP;
-                eventId = eventId + 1;
-            }
-        }
-    }
-    featureId = featureId + 1;
-}
-
-class Segment {
-
-    constructor (event) {
-        this.leftSweepEvent = event;
-        this.rightSweepEvent = event.otherEvent;
-    }
-}
-
-function testSegmentIntersect (seg1, seg2) {
-    if (seg1 === null || seg2 === null) return false
-
-    if (seg1.leftSweepEvent.ringId === seg2.leftSweepEvent.ringId &&
-        (seg1.rightSweepEvent.isSamePoint(seg2.leftSweepEvent) ||
-        seg1.rightSweepEvent.isSamePoint(seg2.leftSweepEvent) ||
-        seg1.rightSweepEvent.isSamePoint(seg2.rightSweepEvent) ||
-        seg1.leftSweepEvent.isSamePoint(seg2.leftSweepEvent) ||
-        seg1.leftSweepEvent.isSamePoint(seg2.rightSweepEvent))) return false
-
-    const x1 = seg1.leftSweepEvent.p.x;
-    const y1 = seg1.leftSweepEvent.p.y;
-    const x2 = seg1.rightSweepEvent.p.x;
-    const y2 = seg1.rightSweepEvent.p.y;
-    const x3 = seg2.leftSweepEvent.p.x;
-    const y3 = seg2.leftSweepEvent.p.y;
-    const x4 = seg2.rightSweepEvent.p.x;
-    const y4 = seg2.rightSweepEvent.p.y;
-
-    const denom = ((y4 - y3) * (x2 - x1)) - ((x4 - x3) * (y2 - y1));
-    const numeA = ((x4 - x3) * (y1 - y3)) - ((y4 - y3) * (x1 - x3));
-    const numeB = ((x2 - x1) * (y1 - y3)) - ((y2 - y1) * (x1 - x3));
-
-    if (denom === 0) {
-        if (numeA === 0 && numeB === 0) return false
-        return false
-    }
-
-    const uA = numeA / denom;
-    const uB = numeB / denom;
-
-    if (uA >= 0 && uA <= 1 && uB >= 0 && uB <= 1) {
-        const x = x1 + (uA * (x2 - x1));
-        const y = y1 + (uA * (y2 - y1));
-        return [x, y]
-    }
-    return false
-}
-
-// import {debugEventAndSegments, debugRemovingSegment} from './debug'
-
-function runCheck (eventQueue, ignoreSelfIntersections) {
-    ignoreSelfIntersections = ignoreSelfIntersections ? ignoreSelfIntersections : false;
-
-    const intersectionPoints = [];
-    const outQueue = new TinyQueue([], checkWhichSegmentHasRightEndpointFirst);
-
-    while (eventQueue.length) {
-        const event = eventQueue.pop();
-        if (event.isLeftEndpoint) {
-            // debugEventAndSegments(event.p, outQueue.data)
-            const segment = new Segment(event);
-            for (let i = 0; i < outQueue.data.length; i++) {
-                const otherSeg = outQueue.data[i];
-                if (ignoreSelfIntersections) {
-                    if (otherSeg.leftSweepEvent.featureId === event.featureId) continue
-                }
-                const intersection = testSegmentIntersect(segment, otherSeg);
-                if (intersection !== false) intersectionPoints.push(intersection);
-            }
-            outQueue.push(segment);
-        } else if (event.isLeftEndpoint === false) {
-            outQueue.pop();
-            // const seg = outQueue.pop()
-            // debugRemovingSegment(event.p, seg)
-        }
-    }
-    return intersectionPoints
-}
-
-class SweeplineIntersections {
-
-    constructor () {
-        this._eventQueue = new TinyQueue([], checkWhichEventIsLeft);
-    }
-
-    addData (geojson, alternateEventQueue) {
-        if (alternateEventQueue !== undefined) {
-            const newQueue = new TinyQueue([], checkWhichEventIsLeft);
-            for (let i = 0; i < alternateEventQueue.length; i++) {
-                newQueue.push(alternateEventQueue.data[i]);
-            }
-            this._eventQueue = newQueue;
-        }
-        fillEventQueue(geojson, this._eventQueue);
-    }
-
-    cloneEventQueue () {
-        const newQueue = new TinyQueue([], checkWhichEventIsLeft);
-        for (let i = 0; i < this._eventQueue.length; i++) {
-            newQueue.push(this._eventQueue.data[i]);
-        }
-        return newQueue
-    }
-
-    getIntersections (ignoreSelfIntersections) {
-        return runCheck(this._eventQueue, ignoreSelfIntersections)
-    }
-}
-
-export default SweeplineIntersections;