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

package/node_modules/sweepline-intersections/dist/sweeplineIntersections.js

@@ -1,260 +0,0 @@
-(function (global, factory) {
-    typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
-    typeof define === 'function' && define.amd ? define(factory) :
-    (global = typeof globalThis !== 'undefined' ? globalThis : global || self, global.sweeplineIntersections = factory());
-}(this, (function () { 'use strict';
-
-    var TinyQueue = function TinyQueue(data, compare) {
-        if ( data === void 0 ) data = [];
-        if ( compare === void 0 ) compare = defaultCompare;
-
-        this.data = data;
-        this.length = this.data.length;
-        this.compare = compare;
-
-        if (this.length > 0) {
-            for (var i = (this.length >> 1) - 1; i >= 0; i--) { this._down(i); }
-        }
-    };
-
-    TinyQueue.prototype.push = function push (item) {
-        this.data.push(item);
-        this.length++;
-        this._up(this.length - 1);
-    };
-
-    TinyQueue.prototype.pop = function pop () {
-        if (this.length === 0) { return undefined; }
-
-        var top = this.data[0];
-        var bottom = this.data.pop();
-        this.length--;
-
-        if (this.length > 0) {
-            this.data[0] = bottom;
-            this._down(0);
-        }
-
-        return top;
-    };
-
-    TinyQueue.prototype.peek = function peek () {
-        return this.data[0];
-    };
-
-    TinyQueue.prototype._up = function _up (pos) {
-        var ref = this;
-            var data = ref.data;
-            var compare = ref.compare;
-        var item = data[pos];
-
-        while (pos > 0) {
-            var parent = (pos - 1) >> 1;
-            var current = data[parent];
-            if (compare(item, current) >= 0) { break; }
-            data[pos] = current;
-            pos = parent;
-        }
-
-        data[pos] = item;
-    };
-
-    TinyQueue.prototype._down = function _down (pos) {
-        var ref = this;
-            var data = ref.data;
-            var compare = ref.compare;
-        var halfLength = this.length >> 1;
-        var item = data[pos];
-
-        while (pos < halfLength) {
-            var left = (pos << 1) + 1;
-            var best = data[left];
-            var 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
-    }
-
-    var Event = function Event (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;
-    };
-
-    Event.prototype.isSamePoint = function isSamePoint (eventToCheck) {
-        return this.p.x === eventToCheck.p.x && this.p.y === eventToCheck.p.y
-    };
-
-    function fillEventQueue (geojson, eventQueue) {
-        if (geojson.type === 'FeatureCollection') {
-            var features = geojson.features;
-            for (var i = 0; i < features.length; i++) {
-                processFeature(features[i], eventQueue);
-            }
-        } else {
-            processFeature(geojson, eventQueue);
-        }
-    }
-
-    var featureId = 0;
-    var ringId = 0;
-    var eventId = 0;
-    function processFeature (featureOrGeometry, eventQueue) {
-        var geom = featureOrGeometry.type === 'Feature' ? featureOrGeometry.geometry : featureOrGeometry;
-        var coords = geom.coordinates;
-        // standardise the input
-        if (geom.type === 'Polygon' || geom.type === 'MultiLineString') { coords = [coords]; }
-        if (geom.type === 'LineString') { coords = [[coords]]; }
-
-        for (var i = 0; i < coords.length; i++) {
-            for (var ii = 0; ii < coords[i].length; ii++) {
-                var currentP = coords[i][ii][0];
-                var nextP = null;
-                ringId = ringId + 1;
-                for (var iii = 0; iii < coords[i][ii].length - 1; iii++) {
-                    nextP = coords[i][ii][iii + 1];
-
-                    var e1 = new Event(currentP, featureId, ringId, eventId);
-                    var 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;
-    }
-
-    var Segment = function Segment (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 }
-
-        var x1 = seg1.leftSweepEvent.p.x;
-        var y1 = seg1.leftSweepEvent.p.y;
-        var x2 = seg1.rightSweepEvent.p.x;
-        var y2 = seg1.rightSweepEvent.p.y;
-        var x3 = seg2.leftSweepEvent.p.x;
-        var y3 = seg2.leftSweepEvent.p.y;
-        var x4 = seg2.rightSweepEvent.p.x;
-        var y4 = seg2.rightSweepEvent.p.y;
-
-        var denom = ((y4 - y3) * (x2 - x1)) - ((x4 - x3) * (y2 - y1));
-        var numeA = ((x4 - x3) * (y1 - y3)) - ((y4 - y3) * (x1 - x3));
-        var numeB = ((x2 - x1) * (y1 - y3)) - ((y2 - y1) * (x1 - x3));
-
-        if (denom === 0) {
-            if (numeA === 0 && numeB === 0) { return false }
-            return false
-        }
-
-        var uA = numeA / denom;
-        var uB = numeB / denom;
-
-        if (uA >= 0 && uA <= 1 && uB >= 0 && uB <= 1) {
-            var x = x1 + (uA * (x2 - x1));
-            var y = y1 + (uA * (y2 - y1));
-            return [x, y]
-        }
-        return false
-    }
-
-    // import {debugEventAndSegments, debugRemovingSegment} from './debug'
-
-    function runCheck (eventQueue, ignoreSelfIntersections) {
-        ignoreSelfIntersections = ignoreSelfIntersections ? ignoreSelfIntersections : false;
-
-        var intersectionPoints = [];
-        var outQueue = new TinyQueue([], checkWhichSegmentHasRightEndpointFirst);
-
-        while (eventQueue.length) {
-            var event = eventQueue.pop();
-            if (event.isLeftEndpoint) {
-                // debugEventAndSegments(event.p, outQueue.data)
-                var segment = new Segment(event);
-                for (var i = 0; i < outQueue.data.length; i++) {
-                    var otherSeg = outQueue.data[i];
-                    if (ignoreSelfIntersections) {
-                        if (otherSeg.leftSweepEvent.featureId === event.featureId) { continue }
-                    }
-                    var 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
-    }
-
-    function sweeplineIntersections (geojson, ignoreSelfIntersections) {
-        var eventQueue = new TinyQueue([], checkWhichEventIsLeft);
-        fillEventQueue(geojson, eventQueue);
-        return runCheck(eventQueue, ignoreSelfIntersections)
-    }
-
-    return sweeplineIntersections;
-
-})));

package/node_modules/sweepline-intersections/dist/sweeplineIntersections.min.js

@@ -1 +0,0 @@
-!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?module.exports=t():"function"==typeof define&&define.amd?define(t):(e="undefined"!=typeof globalThis?globalThis:e||self).sweeplineIntersections=t()}(this,function(){"use strict";var e=function(e,n){if(void 0===e&&(e=[]),void 0===n&&(n=t),this.data=e,this.length=this.data.length,this.compare=n,this.length>0)for(var i=(this.length>>1)-1;i>=0;i--)this._down(i)};function t(e,t){return e<t?-1:e>t?1:0}function n(e,t){return e.p.x>t.p.x?1:e.p.x<t.p.x?-1:e.p.y!==t.p.y?e.p.y>t.p.y?1:-1:1}function i(e,t){return e.rightSweepEvent.p.x>t.rightSweepEvent.p.x?1:e.rightSweepEvent.p.x<t.rightSweepEvent.p.x?-1:e.rightSweepEvent.p.y!==t.rightSweepEvent.p.y?e.rightSweepEvent.p.y<t.rightSweepEvent.p.y?1:-1:1}e.prototype.push=function(e){this.data.push(e),this.length++,this._up(this.length-1)},e.prototype.pop=function(){if(0!==this.length){var e=this.data[0],t=this.data.pop();return this.length--,this.length>0&&(this.data[0]=t,this._down(0)),e}},e.prototype.peek=function(){return this.data[0]},e.prototype._up=function(e){for(var t=this.data,n=this.compare,i=t[e];e>0;){var p=e-1>>1,r=t[p];if(n(i,r)>=0)break;t[e]=r,e=p}t[e]=i},e.prototype._down=function(e){for(var t=this.data,n=this.compare,i=this.length>>1,p=t[e];e<i;){var r=1+(e<<1),o=t[r],h=r+1;if(h<this.length&&n(t[h],o)<0&&(r=h,o=t[h]),n(o,p)>=0)break;t[e]=o,e=r}t[e]=p};var p=function(e,t,n,i){this.p={x:e[0],y:e[1]},this.featureId=t,this.ringId=n,this.eventId=i,this.otherEvent=null,this.isLeftEndpoint=null};p.prototype.isSamePoint=function(e){return this.p.x===e.p.x&&this.p.y===e.p.y};var r=0,o=0,h=0;function f(e,t){var i="Feature"===e.type?e.geometry:e,f=i.coordinates;"Polygon"!==i.type&&"MultiLineString"!==i.type||(f=[f]),"LineString"===i.type&&(f=[[f]]);for(var s=0;s<f.length;s++)for(var a=0;a<f[s].length;a++){var v=f[s][a][0],u=null;o+=1;for(var l=0;l<f[s][a].length-1;l++){u=f[s][a][l+1];var g=new p(v,r,o,h),E=new p(u,r,o,h+1);g.otherEvent=E,E.otherEvent=g,n(g,E)>0?(E.isLeftEndpoint=!0,g.isLeftEndpoint=!1):(g.isLeftEndpoint=!0,E.isLeftEndpoint=!1),t.push(g),t.push(E),v=u,h+=1}}r+=1}var s=function(e){this.leftSweepEvent=e,this.rightSweepEvent=e.otherEvent};function a(e,t){if(null===e||null===t)return!1;if(e.leftSweepEvent.ringId===t.leftSweepEvent.ringId&&(e.rightSweepEvent.isSamePoint(t.leftSweepEvent)||e.rightSweepEvent.isSamePoint(t.leftSweepEvent)||e.rightSweepEvent.isSamePoint(t.rightSweepEvent)||e.leftSweepEvent.isSamePoint(t.leftSweepEvent)||e.leftSweepEvent.isSamePoint(t.rightSweepEvent)))return!1;var n=e.leftSweepEvent.p.x,i=e.leftSweepEvent.p.y,p=e.rightSweepEvent.p.x,r=e.rightSweepEvent.p.y,o=t.leftSweepEvent.p.x,h=t.leftSweepEvent.p.y,f=t.rightSweepEvent.p.x,s=t.rightSweepEvent.p.y,a=(s-h)*(p-n)-(f-o)*(r-i),v=(f-o)*(i-h)-(s-h)*(n-o),u=(p-n)*(i-h)-(r-i)*(n-o);if(0===a)return!1;var l=v/a,g=u/a;return l>=0&&l<=1&&g>=0&&g<=1&&[n+l*(p-n),i+l*(r-i)]}return function(t,p){var r=new e([],n);return function(e,t){if("FeatureCollection"===e.type)for(var n=e.features,i=0;i<n.length;i++)f(n[i],t);else f(e,t)}(t,r),function(t,n){n=n||!1;for(var p=[],r=new e([],i);t.length;){var o=t.pop();if(o.isLeftEndpoint){for(var h=new s(o),f=0;f<r.data.length;f++){var v=r.data[f];if(!n||v.leftSweepEvent.featureId!==o.featureId){var u=a(h,v);!1!==u&&p.push(u)}}r.push(h)}else!1===o.isLeftEndpoint&&r.pop()}return p}(r,p)}});

package/node_modules/sweepline-intersections/package.json

@@ -1,79 +0,0 @@
-{
-  "name": "sweepline-intersections",
-  "version": "1.5.0",
-  "description": "A module to check if a polygon self-intersects using a sweepline algorithm",
-  "main": "dist/sweeplineIntersections.js",
-  "module": "dist/sweeplineIntersections.esm.js",
-  "unpkg": "dist/sweeplineIntersections.min.js",
-  "jsdelivr": "dist/sweeplineIntersections.min.js",
-  "typings": "types.d.ts",
-  "scripts": {
-    "bench": "npm run build && node test/benchmark.js",
-    "build": "rollup -c",
-    "build:debug": "cross-env webpack --config debug/webpack.config.js --mode production",
-    "debug": "cross-env webpack-dev-server --config debug/webpack.config.js --mode development --open --hot",
-    "test": "ava --verbose"
-  },
-  "files": [
-    "dist/",
-    "types.d.ts"
-  ],
-  "ava": {
-    "files": [
-      "test/test.e2e.js",
-      "test/*.spec.js"
-    ],
-    "require": [
-      "esm"
-    ]
-  },
-  "author": "",
-  "license": "MIT",
-  "dependencies": {
-    "tinyqueue": "^2.0.0"
-  },
-  "devDependencies": {
-    "@rollup/plugin-buble": "^0.21.3",
-    "@rollup/plugin-commonjs": "^11.1.0",
-    "@rollup/plugin-node-resolve": "^7.1.3",
-    "@rollup/plugin-strip": "^1.3.2",
-    "@types/geojson": "7946.0.8",
-    "2d-polygon-self-intersections": "^1.3.1",
-    "ava": "^1.0.1",
-    "benchmark": "^2.1.4",
-    "bentley-ottmann-intersections": "0.0.1",
-    "cross-env": "^5.2.0",
-    "css-loader": "^2.1.0",
-    "eslint": "^5.12.0",
-    "eslint-config-mourner": "^3.0.0",
-    "esm": "^3.0.84",
-    "file-loader": "^3.0.1",
-    "geojson-polygon-self-intersections": "^1.2.0",
-    "glob": "^7.1.3",
-    "json-loader": "^0.5.7",
-    "leaflet": "^1.4.0",
-    "load-json-file": "^5.3.0",
-    "nyc": "^13.1.0",
-    "rollup": "^2.7.6",
-    "rollup-plugin-terser": "^4.0.2",
-    "vue": "^2.5.22",
-    "vue-loader": "^15.6.2",
-    "vue-template-compiler": "^2.5.22",
-    "webpack": "^4.29.0",
-    "webpack-cli": "^3.2.1",
-    "webpack-dev-server": "^3.1.14"
-  },
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/rowanwins/sweepline-intersections.git"
-  },
-  "bugs": {
-    "url": "https://github.com/rowanwins/sweepline-intersections/issues"
-  },
-  "keywords": [
-    "kinks",
-    "intersections",
-    "self-intersections",
-    "complex polygon"
-  ]
-}

package/node_modules/sweepline-intersections/types.d.ts

@@ -1,8 +0,0 @@
-import { FeatureCollection, Feature, GeometryObject } from "geojson";
-
-export type Intersection = [number, number];
-
-export default function sweeplineIntersections(
-  geojson: FeatureCollection<GeometryObject> | Feature<GeometryObject>,
-  ignoreSelfIntersections: boolean
-): Intersection[];

package/node_modules/tinyqueue/LICENSE

@@ -1,15 +0,0 @@
-ISC License
-
-Copyright (c) 2017, Vladimir Agafonkin
-
-Permission to use, copy, modify, and/or distribute this software for any purpose
-with or without fee is hereby granted, provided that the above copyright notice
-and this permission notice appear in all copies.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
-REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
-FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
-INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
-OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
-TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
-THIS SOFTWARE.

package/node_modules/tinyqueue/README.md

@@ -1,59 +0,0 @@
-## tinyqueue
-
-The smallest and simplest binary heap priority queue in JavaScript.
-
-```js
-// create an empty priority queue
-var queue = new TinyQueue();
-
-// add some items
-queue.push(7);
-queue.push(5);
-queue.push(10);
-
-// remove the top item
-var top = queue.pop(); // returns 5
-
-// return the top item (without removal)
-top = queue.peek(); // returns 7
-
-// get queue length
-queue.length; // returns 2
-
-// create a priority queue from an existing array (modifies the array)
-queue = new TinyQueue([7, 5, 10]);
-
-// pass a custom item comparator as a second argument
-queue = new TinyQueue([{value: 5}, {value: 7}], function (a, b) {
-	return a.value - b.value;
-});
-
-// turn a queue into a sorted array
-var array = [];
-while (queue.length) array.push(queue.pop());
-```
-
-For a faster number-based queue, see [flatqueue](https://github.com/mourner/flatqueue).
-
-### Install
-
-Install using NPM (`npm install tinyqueue`) or Yarn (`yarn add tinyqueue`), then:
-
-```js
-// import as an ES module
-import TinyQueue from 'tinyqueue';
-
-// or require in Node / Browserify
-const TinyQueue = require('tinyqueue');
-```
-
-Or use a browser build directly:
-
-```html
-<script src="https://unpkg.com/tinyqueue@2.0.0/tinyqueue.min.js"></script>
-```
-
-### Thanks
-
-Inspired by [js-priority-queue](https://github.com/adamhooper/js-priority-queue)
-by [Adam Hooper](https://github.com/adamhooper).

package/node_modules/tinyqueue/index.d.ts

@@ -1,11 +0,0 @@
-export declare type Item = any;
-export declare type Comparator<Item> = (a: Item, b: Item) => number;
-
-export default class TinyQueue<Item> {
-  public data : Item[];
-  public length : number;
-  constructor (items? : Item[], compare? : Comparator<Item>);
-  peek () : Item | undefined;
-  pop () : Item | undefined;
-  push (item: Item) : void;
-}

package/node_modules/tinyqueue/index.js

@@ -1,79 +0,0 @@
-
-export default 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;
-}

package/node_modules/tinyqueue/package.json

@@ -1,53 +0,0 @@
-{
-  "name": "tinyqueue",
-  "version": "2.0.3",
-  "description": "The smallest and simplest JavaScript priority queue",
-  "main": "tinyqueue.js",
-  "module": "index.js",
-  "jsdelivr": "tinyqueue.min.js",
-  "unpkg": "tinyqueue.min.js",
-  "types": "index.d.ts",
-  "scripts": {
-    "lint": "eslint index.js test.js bench.js rollup.config.js",
-    "pretest": "npm run lint",
-    "test": "tape -r esm test.js",
-    "bench": "node -r esm bench.js",
-    "build": "rollup -c",
-    "watch": "rollup -cw",
-    "prepublishOnly": "npm test"
-  },
-  "files": [
-    "index.js",
-    "tinyqueue.js",
-    "tinyqueue.min.js",
-    "index.d.ts"
-  ],
-  "repository": {
-    "type": "git",
-    "url": "https://github.com/mourner/tinyqueue.git"
-  },
-  "keywords": [
-    "queue",
-    "priority",
-    "binary heap",
-    "data structures"
-  ],
-  "author": "",
-  "license": "ISC",
-  "bugs": {
-    "url": "https://github.com/mourner/tinyqueue/issues"
-  },
-  "homepage": "https://github.com/mourner/tinyqueue",
-  "devDependencies": {
-    "eslint": "^5.16.0",
-    "eslint-config-mourner": "^3.0.0",
-    "esm": "^3.2.25",
-    "rollup": "^1.15.4",
-    "rollup-plugin-buble": "^0.19.6",
-    "rollup-plugin-terser": "^5.0.0",
-    "tape": "^4.10.2"
-  },
-  "eslintConfig": {
-    "extends": "mourner"
-  }
-}

package/node_modules/tinyqueue/tinyqueue.js

@@ -1,93 +0,0 @@
-(function (global, factory) {
-typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
-typeof define === 'function' && define.amd ? define(factory) :
-(global = global || self, global.TinyQueue = factory());
-}(this, function () { 'use strict';
-
-var TinyQueue = function TinyQueue(data, compare) {
-    if ( data === void 0 ) data = [];
-    if ( compare === void 0 ) compare = defaultCompare;
-
-    this.data = data;
-    this.length = this.data.length;
-    this.compare = compare;
-
-    if (this.length > 0) {
-        for (var i = (this.length >> 1) - 1; i >= 0; i--) { this._down(i); }
-    }
-};
-
-TinyQueue.prototype.push = function push (item) {
-    this.data.push(item);
-    this.length++;
-    this._up(this.length - 1);
-};
-
-TinyQueue.prototype.pop = function pop () {
-    if (this.length === 0) { return undefined; }
-
-    var top = this.data[0];
-    var bottom = this.data.pop();
-    this.length--;
-
-    if (this.length > 0) {
-        this.data[0] = bottom;
-        this._down(0);
-    }
-
-    return top;
-};
-
-TinyQueue.prototype.peek = function peek () {
-    return this.data[0];
-};
-
-TinyQueue.prototype._up = function _up (pos) {
-    var ref = this;
-        var data = ref.data;
-        var compare = ref.compare;
-    var item = data[pos];
-
-    while (pos > 0) {
-        var parent = (pos - 1) >> 1;
-        var current = data[parent];
-        if (compare(item, current) >= 0) { break; }
-        data[pos] = current;
-        pos = parent;
-    }
-
-    data[pos] = item;
-};
-
-TinyQueue.prototype._down = function _down (pos) {
-    var ref = this;
-        var data = ref.data;
-        var compare = ref.compare;
-    var halfLength = this.length >> 1;
-    var item = data[pos];
-
-    while (pos < halfLength) {
-        var left = (pos << 1) + 1;
-        var best = data[left];
-        var 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;
-}
-
-return TinyQueue;
-
-}));

package/node_modules/tinyqueue/tinyqueue.min.js

@@ -1 +0,0 @@
-!function(t,i){"object"==typeof exports&&"undefined"!=typeof module?module.exports=i():"function"==typeof define&&define.amd?define(i):(t=t||self).TinyQueue=i()}(this,function(){"use strict";var t=function(t,e){if(void 0===t&&(t=[]),void 0===e&&(e=i),this.data=t,this.length=this.data.length,this.compare=e,this.length>0)for(var n=(this.length>>1)-1;n>=0;n--)this._down(n)};function i(t,i){return t<i?-1:t>i?1:0}return t.prototype.push=function(t){this.data.push(t),this.length++,this._up(this.length-1)},t.prototype.pop=function(){if(0!==this.length){var t=this.data[0],i=this.data.pop();return this.length--,this.length>0&&(this.data[0]=i,this._down(0)),t}},t.prototype.peek=function(){return this.data[0]},t.prototype._up=function(t){for(var i=this.data,e=this.compare,n=i[t];t>0;){var o=t-1>>1,h=i[o];if(e(n,h)>=0)break;i[t]=h,t=o}i[t]=n},t.prototype._down=function(t){for(var i=this.data,e=this.compare,n=this.length>>1,o=i[t];t<n;){var h=1+(t<<1),s=i[h],a=h+1;if(a<this.length&&e(i[a],s)<0&&(h=a,s=i[a]),e(s,o)>=0)break;i[t]=s,t=h}i[t]=o},t});

package/node_modules/topojson-client/LICENSE

@@ -1,13 +0,0 @@
-Copyright 2012-2019 Michael Bostock
-
-Permission to use, copy, modify, and/or distribute this software for any purpose
-with or without fee is hereby granted, provided that the above copyright notice
-and this permission notice appear in all copies.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
-REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
-FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
-INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
-OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
-TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
-THIS SOFTWARE.