npm - node-red-contrib-tak-registration - Versions diffs - 0.16.3 → 0.16.5 - Mend

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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (2240) hide show

package/node_modules/rbush/rbush.js DELETED Viewed

@@ -1,574 +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.RBush = factory());
-}(this, function () { 'use strict';
-function quickselect(arr, k, left, right, compare) {
-    quickselectStep(arr, k, left || 0, right || (arr.length - 1), compare || defaultCompare);
-}
-function quickselectStep(arr, k, left, right, compare) {
-    while (right > left) {
-        if (right - left > 600) {
-            var n = right - left + 1;
-            var m = k - left + 1;
-            var z = Math.log(n);
-            var s = 0.5 * Math.exp(2 * z / 3);
-            var sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);
-            var newLeft = Math.max(left, Math.floor(k - m * s / n + sd));
-            var newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));
-            quickselectStep(arr, k, newLeft, newRight, compare);
-        }
-        var t = arr[k];
-        var i = left;
-        var j = right;
-        swap(arr, left, k);
-        if (compare(arr[right], t) > 0) { swap(arr, left, right); }
-        while (i < j) {
-            swap(arr, i, j);
-            i++;
-            j--;
-            while (compare(arr[i], t) < 0) { i++; }
-            while (compare(arr[j], t) > 0) { j--; }
-        }
-        if (compare(arr[left], t) === 0) { swap(arr, left, j); }
-        else {
-            j++;
-            swap(arr, j, right);
-        }
-        if (j <= k) { left = j + 1; }
-        if (k <= j) { right = j - 1; }
-    }
-}
-function swap(arr, i, j) {
-    var tmp = arr[i];
-    arr[i] = arr[j];
-    arr[j] = tmp;
-}
-function defaultCompare(a, b) {
-    return a < b ? -1 : a > b ? 1 : 0;
-}
-var RBush = function RBush(maxEntries) {
-    if ( maxEntries === void 0 ) maxEntries = 9;
-    // max entries in a node is 9 by default; min node fill is 40% for best performance
-    this._maxEntries = Math.max(4, maxEntries);
-    this._minEntries = Math.max(2, Math.ceil(this._maxEntries * 0.4));
-    this.clear();
-};
-RBush.prototype.all = function all () {
-    return this._all(this.data, []);
-};
-RBush.prototype.search = function search (bbox) {
-    var node = this.data;
-    var result = [];
-    if (!intersects(bbox, node)) { return result; }
-    var toBBox = this.toBBox;
-    var nodesToSearch = [];
-    while (node) {
-        for (var i = 0; i < node.children.length; i++) {
-            var child = node.children[i];
-            var childBBox = node.leaf ? toBBox(child) : child;
-            if (intersects(bbox, childBBox)) {
-                if (node.leaf) { result.push(child); }
-                else if (contains(bbox, childBBox)) { this._all(child, result); }
-                else { nodesToSearch.push(child); }
-            }
-        }
-        node = nodesToSearch.pop();
-    }
-    return result;
-};
-RBush.prototype.collides = function collides (bbox) {
-    var node = this.data;
-    if (!intersects(bbox, node)) { return false; }
-    var nodesToSearch = [];
-    while (node) {
-        for (var i = 0; i < node.children.length; i++) {
-            var child = node.children[i];
-            var childBBox = node.leaf ? this.toBBox(child) : child;
-            if (intersects(bbox, childBBox)) {
-                if (node.leaf || contains(bbox, childBBox)) { return true; }
-                nodesToSearch.push(child);
-            }
-        }
-        node = nodesToSearch.pop();
-    }
-    return false;
-};
-RBush.prototype.load = function load (data) {
-    if (!(data && data.length)) { return this; }
-    if (data.length < this._minEntries) {
-        for (var i = 0; i < data.length; i++) {
-            this.insert(data[i]);
-        }
-        return this;
-    }
-    // recursively build the tree with the given data from scratch using OMT algorithm
-    var node = this._build(data.slice(), 0, data.length - 1, 0);
-    if (!this.data.children.length) {
-        // save as is if tree is empty
-        this.data = node;
-    } else if (this.data.height === node.height) {
-        // split root if trees have the same height
-        this._splitRoot(this.data, node);
-    } else {
-        if (this.data.height < node.height) {
-            // swap trees if inserted one is bigger
-            var tmpNode = this.data;
-            this.data = node;
-            node = tmpNode;
-        }
-        // insert the small tree into the large tree at appropriate level
-        this._insert(node, this.data.height - node.height - 1, true);
-    }
-    return this;
-};
-RBush.prototype.insert = function insert (item) {
-    if (item) { this._insert(item, this.data.height - 1); }
-    return this;
-};
-RBush.prototype.clear = function clear () {
-    this.data = createNode([]);
-    return this;
-};
-RBush.prototype.remove = function remove (item, equalsFn) {
-    if (!item) { return this; }
-    var node = this.data;
-    var bbox = this.toBBox(item);
-    var path = [];
-    var indexes = [];
-    var i, parent, goingUp;
-    // depth-first iterative tree traversal
-    while (node || path.length) {
-        if (!node) { // go up
-            node = path.pop();
-            parent = path[path.length - 1];
-            i = indexes.pop();
-            goingUp = true;
-        }
-        if (node.leaf) { // check current node
-            var index = findItem(item, node.children, equalsFn);
-            if (index !== -1) {
-                // item found, remove the item and condense tree upwards
-                node.children.splice(index, 1);
-                path.push(node);
-                this._condense(path);
-                return this;
-            }
-        }
-        if (!goingUp && !node.leaf && contains(node, bbox)) { // go down
-            path.push(node);
-            indexes.push(i);
-            i = 0;
-            parent = node;
-            node = node.children[0];
-        } else if (parent) { // go right
-            i++;
-            node = parent.children[i];
-            goingUp = false;
-        } else { node = null; } // nothing found
-    }
-    return this;
-};
-RBush.prototype.toBBox = function toBBox (item) { return item; };
-RBush.prototype.compareMinX = function compareMinX (a, b) { return a.minX - b.minX; };
-RBush.prototype.compareMinY = function compareMinY (a, b) { return a.minY - b.minY; };
-RBush.prototype.toJSON = function toJSON () { return this.data; };
-RBush.prototype.fromJSON = function fromJSON (data) {
-    this.data = data;
-    return this;
-};
-RBush.prototype._all = function _all (node, result) {
-    var nodesToSearch = [];
-    while (node) {
-        if (node.leaf) { result.push.apply(result, node.children); }
-        else { nodesToSearch.push.apply(nodesToSearch, node.children); }
-        node = nodesToSearch.pop();
-    }
-    return result;
-};
-RBush.prototype._build = function _build (items, left, right, height) {
-    var N = right - left + 1;
-    var M = this._maxEntries;
-    var node;
-    if (N <= M) {
-        // reached leaf level; return leaf
-        node = createNode(items.slice(left, right + 1));
-        calcBBox(node, this.toBBox);
-        return node;
-    }
-    if (!height) {
-        // target height of the bulk-loaded tree
-        height = Math.ceil(Math.log(N) / Math.log(M));
-        // target number of root entries to maximize storage utilization
-        M = Math.ceil(N / Math.pow(M, height - 1));
-    }
-    node = createNode([]);
-    node.leaf = false;
-    node.height = height;
-    // split the items into M mostly square tiles
-    var N2 = Math.ceil(N / M);
-    var N1 = N2 * Math.ceil(Math.sqrt(M));
-    multiSelect(items, left, right, N1, this.compareMinX);
-    for (var i = left; i <= right; i += N1) {
-        var right2 = Math.min(i + N1 - 1, right);
-        multiSelect(items, i, right2, N2, this.compareMinY);
-        for (var j = i; j <= right2; j += N2) {
-            var right3 = Math.min(j + N2 - 1, right2);
-            // pack each entry recursively
-            node.children.push(this._build(items, j, right3, height - 1));
-        }
-    }
-    calcBBox(node, this.toBBox);
-    return node;
-};
-RBush.prototype._chooseSubtree = function _chooseSubtree (bbox, node, level, path) {
-    while (true) {
-        path.push(node);
-        if (node.leaf || path.length - 1 === level) { break; }
-        var minArea = Infinity;
-        var minEnlargement = Infinity;
-        var targetNode = (void 0);
-        for (var i = 0; i < node.children.length; i++) {
-            var child = node.children[i];
-            var area = bboxArea(child);
-            var enlargement = enlargedArea(bbox, child) - area;
-            // choose entry with the least area enlargement
-            if (enlargement < minEnlargement) {
-                minEnlargement = enlargement;
-                minArea = area < minArea ? area : minArea;
-                targetNode = child;
-            } else if (enlargement === minEnlargement) {
-                // otherwise choose one with the smallest area
-                if (area < minArea) {
-                    minArea = area;
-                    targetNode = child;
-                }
-            }
-        }
-        node = targetNode || node.children[0];
-    }
-    return node;
-};
-RBush.prototype._insert = function _insert (item, level, isNode) {
-    var bbox = isNode ? item : this.toBBox(item);
-    var insertPath = [];
-    // find the best node for accommodating the item, saving all nodes along the path too
-    var node = this._chooseSubtree(bbox, this.data, level, insertPath);
-    // put the item into the node
-    node.children.push(item);
-    extend(node, bbox);
-    // split on node overflow; propagate upwards if necessary
-    while (level >= 0) {
-        if (insertPath[level].children.length > this._maxEntries) {
-            this._split(insertPath, level);
-            level--;
-        } else { break; }
-    }
-    // adjust bboxes along the insertion path
-    this._adjustParentBBoxes(bbox, insertPath, level);
-};
-// split overflowed node into two
-RBush.prototype._split = function _split (insertPath, level) {
-    var node = insertPath[level];
-    var M = node.children.length;
-    var m = this._minEntries;
-    this._chooseSplitAxis(node, m, M);
-    var splitIndex = this._chooseSplitIndex(node, m, M);
-    var newNode = createNode(node.children.splice(splitIndex, node.children.length - splitIndex));
-    newNode.height = node.height;
-    newNode.leaf = node.leaf;
-    calcBBox(node, this.toBBox);
-    calcBBox(newNode, this.toBBox);
-    if (level) { insertPath[level - 1].children.push(newNode); }
-    else { this._splitRoot(node, newNode); }
-};
-RBush.prototype._splitRoot = function _splitRoot (node, newNode) {
-    // split root node
-    this.data = createNode([node, newNode]);
-    this.data.height = node.height + 1;
-    this.data.leaf = false;
-    calcBBox(this.data, this.toBBox);
-};
-RBush.prototype._chooseSplitIndex = function _chooseSplitIndex (node, m, M) {
-    var index;
-    var minOverlap = Infinity;
-    var minArea = Infinity;
-    for (var i = m; i <= M - m; i++) {
-        var bbox1 = distBBox(node, 0, i, this.toBBox);
-        var bbox2 = distBBox(node, i, M, this.toBBox);
-        var overlap = intersectionArea(bbox1, bbox2);
-        var area = bboxArea(bbox1) + bboxArea(bbox2);
-        // choose distribution with minimum overlap
-        if (overlap < minOverlap) {
-            minOverlap = overlap;
-            index = i;
-            minArea = area < minArea ? area : minArea;
-        } else if (overlap === minOverlap) {
-            // otherwise choose distribution with minimum area
-            if (area < minArea) {
-                minArea = area;
-                index = i;
-            }
-        }
-    }
-    return index || M - m;
-};
-// sorts node children by the best axis for split
-RBush.prototype._chooseSplitAxis = function _chooseSplitAxis (node, m, M) {
-    var compareMinX = node.leaf ? this.compareMinX : compareNodeMinX;
-    var compareMinY = node.leaf ? this.compareMinY : compareNodeMinY;
-    var xMargin = this._allDistMargin(node, m, M, compareMinX);
-    var yMargin = this._allDistMargin(node, m, M, compareMinY);
-    // if total distributions margin value is minimal for x, sort by minX,
-    // otherwise it's already sorted by minY
-    if (xMargin < yMargin) { node.children.sort(compareMinX); }
-};
-// total margin of all possible split distributions where each node is at least m full
-RBush.prototype._allDistMargin = function _allDistMargin (node, m, M, compare) {
-    node.children.sort(compare);
-    var toBBox = this.toBBox;
-    var leftBBox = distBBox(node, 0, m, toBBox);
-    var rightBBox = distBBox(node, M - m, M, toBBox);
-    var margin = bboxMargin(leftBBox) + bboxMargin(rightBBox);
-    for (var i = m; i < M - m; i++) {
-        var child = node.children[i];
-        extend(leftBBox, node.leaf ? toBBox(child) : child);
-        margin += bboxMargin(leftBBox);
-    }
-    for (var i$1 = M - m - 1; i$1 >= m; i$1--) {
-        var child$1 = node.children[i$1];
-        extend(rightBBox, node.leaf ? toBBox(child$1) : child$1);
-        margin += bboxMargin(rightBBox);
-    }
-    return margin;
-};
-RBush.prototype._adjustParentBBoxes = function _adjustParentBBoxes (bbox, path, level) {
-    // adjust bboxes along the given tree path
-    for (var i = level; i >= 0; i--) {
-        extend(path[i], bbox);
-    }
-};
-RBush.prototype._condense = function _condense (path) {
-    // go through the path, removing empty nodes and updating bboxes
-    for (var i = path.length - 1, siblings = (void 0); i >= 0; i--) {
-        if (path[i].children.length === 0) {
-            if (i > 0) {
-                siblings = path[i - 1].children;
-                siblings.splice(siblings.indexOf(path[i]), 1);
-            } else { this.clear(); }
-        } else { calcBBox(path[i], this.toBBox); }
-    }
-};
-function findItem(item, items, equalsFn) {
-    if (!equalsFn) { return items.indexOf(item); }
-    for (var i = 0; i < items.length; i++) {
-        if (equalsFn(item, items[i])) { return i; }
-    }
-    return -1;
-}
-// calculate node's bbox from bboxes of its children
-function calcBBox(node, toBBox) {
-    distBBox(node, 0, node.children.length, toBBox, node);
-}
-// min bounding rectangle of node children from k to p-1
-function distBBox(node, k, p, toBBox, destNode) {
-    if (!destNode) { destNode = createNode(null); }
-    destNode.minX = Infinity;
-    destNode.minY = Infinity;
-    destNode.maxX = -Infinity;
-    destNode.maxY = -Infinity;
-    for (var i = k; i < p; i++) {
-        var child = node.children[i];
-        extend(destNode, node.leaf ? toBBox(child) : child);
-    }
-    return destNode;
-}
-function extend(a, b) {
-    a.minX = Math.min(a.minX, b.minX);
-    a.minY = Math.min(a.minY, b.minY);
-    a.maxX = Math.max(a.maxX, b.maxX);
-    a.maxY = Math.max(a.maxY, b.maxY);
-    return a;
-}
-function compareNodeMinX(a, b) { return a.minX - b.minX; }
-function compareNodeMinY(a, b) { return a.minY - b.minY; }
-function bboxArea(a)   { return (a.maxX - a.minX) * (a.maxY - a.minY); }
-function bboxMargin(a) { return (a.maxX - a.minX) + (a.maxY - a.minY); }
-function enlargedArea(a, b) {
-    return (Math.max(b.maxX, a.maxX) - Math.min(b.minX, a.minX)) *
-           (Math.max(b.maxY, a.maxY) - Math.min(b.minY, a.minY));
-}
-function intersectionArea(a, b) {
-    var minX = Math.max(a.minX, b.minX);
-    var minY = Math.max(a.minY, b.minY);
-    var maxX = Math.min(a.maxX, b.maxX);
-    var maxY = Math.min(a.maxY, b.maxY);
-    return Math.max(0, maxX - minX) *
-           Math.max(0, maxY - minY);
-}
-function contains(a, b) {
-    return a.minX <= b.minX &&
-           a.minY <= b.minY &&
-           b.maxX <= a.maxX &&
-           b.maxY <= a.maxY;
-}
-function intersects(a, b) {
-    return b.minX <= a.maxX &&
-           b.minY <= a.maxY &&
-           b.maxX >= a.minX &&
-           b.maxY >= a.minY;
-}
-function createNode(children) {
-    return {
-        children: children,
-        height: 1,
-        leaf: true,
-        minX: Infinity,
-        minY: Infinity,
-        maxX: -Infinity,
-        maxY: -Infinity
-    };
-}
-// sort an array so that items come in groups of n unsorted items, with groups sorted between each other;
-// combines selection algorithm with binary divide & conquer approach
-function multiSelect(arr, left, right, n, compare) {
-    var stack = [left, right];
-    while (stack.length) {
-        right = stack.pop();
-        left = stack.pop();
-        if (right - left <= n) { continue; }
-        var mid = left + Math.ceil((right - left) / n / 2) * n;
-        quickselect(arr, mid, left, right, compare);
-        stack.push(left, mid, mid, right);
-    }
-}
-return RBush;
-}));

package/node_modules/rbush/rbush.min.js DELETED Viewed

@@ -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).RBush=i()}(this,function(){"use strict";function t(t,r,e,a,h){!function t(n,r,e,a,h){for(;a>e;){if(a-e>600){var o=a-e+1,s=r-e+1,l=Math.log(o),f=.5*Math.exp(2*l/3),u=.5*Math.sqrt(l*f*(o-f)/o)*(s-o/2<0?-1:1),m=Math.max(e,Math.floor(r-s*f/o+u)),c=Math.min(a,Math.floor(r+(o-s)*f/o+u));t(n,r,m,c,h)}var p=n[r],d=e,x=a;for(i(n,e,r),h(n[a],p)>0&&i(n,e,a);d<x;){for(i(n,d,x),d++,x--;h(n[d],p)<0;)d++;for(;h(n[x],p)>0;)x--}0===h(n[e],p)?i(n,e,x):i(n,++x,a),x<=r&&(e=x+1),r<=x&&(a=x-1)}}(t,r,e||0,a||t.length-1,h||n)}function i(t,i,n){var r=t[i];t[i]=t[n],t[n]=r}function n(t,i){return t<i?-1:t>i?1:0}var r=function(t){void 0===t&&(t=9),this._maxEntries=Math.max(4,t),this._minEntries=Math.max(2,Math.ceil(.4*this._maxEntries)),this.clear()};function e(t,i,n){if(!n)return i.indexOf(t);for(var r=0;r<i.length;r++)if(n(t,i[r]))return r;return-1}function a(t,i){h(t,0,t.children.length,i,t)}function h(t,i,n,r,e){e||(e=p(null)),e.minX=1/0,e.minY=1/0,e.maxX=-1/0,e.maxY=-1/0;for(var a=i;a<n;a++){var h=t.children[a];o(e,t.leaf?r(h):h)}return e}function o(t,i){return t.minX=Math.min(t.minX,i.minX),t.minY=Math.min(t.minY,i.minY),t.maxX=Math.max(t.maxX,i.maxX),t.maxY=Math.max(t.maxY,i.maxY),t}function s(t,i){return t.minX-i.minX}function l(t,i){return t.minY-i.minY}function f(t){return(t.maxX-t.minX)*(t.maxY-t.minY)}function u(t){return t.maxX-t.minX+(t.maxY-t.minY)}function m(t,i){return t.minX<=i.minX&&t.minY<=i.minY&&i.maxX<=t.maxX&&i.maxY<=t.maxY}function c(t,i){return i.minX<=t.maxX&&i.minY<=t.maxY&&i.maxX>=t.minX&&i.maxY>=t.minY}function p(t){return{children:t,height:1,leaf:!0,minX:1/0,minY:1/0,maxX:-1/0,maxY:-1/0}}function d(i,n,r,e,a){for(var h=[n,r];h.length;)if(!((r=h.pop())-(n=h.pop())<=e)){var o=n+Math.ceil((r-n)/e/2)*e;t(i,o,n,r,a),h.push(n,o,o,r)}}return r.prototype.all=function(){return this._all(this.data,[])},r.prototype.search=function(t){var i=this.data,n=[];if(!c(t,i))return n;for(var r=this.toBBox,e=[];i;){for(var a=0;a<i.children.length;a++){var h=i.children[a],o=i.leaf?r(h):h;c(t,o)&&(i.leaf?n.push(h):m(t,o)?this._all(h,n):e.push(h))}i=e.pop()}return n},r.prototype.collides=function(t){var i=this.data;if(!c(t,i))return!1;for(var n=[];i;){for(var r=0;r<i.children.length;r++){var e=i.children[r],a=i.leaf?this.toBBox(e):e;if(c(t,a)){if(i.leaf||m(t,a))return!0;n.push(e)}}i=n.pop()}return!1},r.prototype.load=function(t){if(!t||!t.length)return this;if(t.length<this._minEntries){for(var i=0;i<t.length;i++)this.insert(t[i]);return this}var n=this._build(t.slice(),0,t.length-1,0);if(this.data.children.length)if(this.data.height===n.height)this._splitRoot(this.data,n);else{if(this.data.height<n.height){var r=this.data;this.data=n,n=r}this._insert(n,this.data.height-n.height-1,!0)}else this.data=n;return this},r.prototype.insert=function(t){return t&&this._insert(t,this.data.height-1),this},r.prototype.clear=function(){return this.data=p([]),this},r.prototype.remove=function(t,i){if(!t)return this;for(var n,r,a,h=this.data,o=this.toBBox(t),s=[],l=[];h||s.length;){if(h||(h=s.pop(),r=s[s.length-1],n=l.pop(),a=!0),h.leaf){var f=e(t,h.children,i);if(-1!==f)return h.children.splice(f,1),s.push(h),this._condense(s),this}a||h.leaf||!m(h,o)?r?(n++,h=r.children[n],a=!1):h=null:(s.push(h),l.push(n),n=0,r=h,h=h.children[0])}return this},r.prototype.toBBox=function(t){return t},r.prototype.compareMinX=function(t,i){return t.minX-i.minX},r.prototype.compareMinY=function(t,i){return t.minY-i.minY},r.prototype.toJSON=function(){return this.data},r.prototype.fromJSON=function(t){return this.data=t,this},r.prototype._all=function(t,i){for(var n=[];t;)t.leaf?i.push.apply(i,t.children):n.push.apply(n,t.children),t=n.pop();return i},r.prototype._build=function(t,i,n,r){var e,h=n-i+1,o=this._maxEntries;if(h<=o)return a(e=p(t.slice(i,n+1)),this.toBBox),e;r||(r=Math.ceil(Math.log(h)/Math.log(o)),o=Math.ceil(h/Math.pow(o,r-1))),(e=p([])).leaf=!1,e.height=r;var s=Math.ceil(h/o),l=s*Math.ceil(Math.sqrt(o));d(t,i,n,l,this.compareMinX);for(var f=i;f<=n;f+=l){var u=Math.min(f+l-1,n);d(t,f,u,s,this.compareMinY);for(var m=f;m<=u;m+=s){var c=Math.min(m+s-1,u);e.children.push(this._build(t,m,c,r-1))}}return a(e,this.toBBox),e},r.prototype._chooseSubtree=function(t,i,n,r){for(;r.push(i),!i.leaf&&r.length-1!==n;){for(var e=1/0,a=1/0,h=void 0,o=0;o<i.children.length;o++){var s=i.children[o],l=f(s),u=(m=t,c=s,(Math.max(c.maxX,m.maxX)-Math.min(c.minX,m.minX))*(Math.max(c.maxY,m.maxY)-Math.min(c.minY,m.minY))-l);u<a?(a=u,e=l<e?l:e,h=s):u===a&&l<e&&(e=l,h=s)}i=h||i.children[0]}var m,c;return i},r.prototype._insert=function(t,i,n){var r=n?t:this.toBBox(t),e=[],a=this._chooseSubtree(r,this.data,i,e);for(a.children.push(t),o(a,r);i>=0&&e[i].children.length>this._maxEntries;)this._split(e,i),i--;this._adjustParentBBoxes(r,e,i)},r.prototype._split=function(t,i){var n=t[i],r=n.children.length,e=this._minEntries;this._chooseSplitAxis(n,e,r);var h=this._chooseSplitIndex(n,e,r),o=p(n.children.splice(h,n.children.length-h));o.height=n.height,o.leaf=n.leaf,a(n,this.toBBox),a(o,this.toBBox),i?t[i-1].children.push(o):this._splitRoot(n,o)},r.prototype._splitRoot=function(t,i){this.data=p([t,i]),this.data.height=t.height+1,this.data.leaf=!1,a(this.data,this.toBBox)},r.prototype._chooseSplitIndex=function(t,i,n){for(var r,e,a,o,s,l,u,m=1/0,c=1/0,p=i;p<=n-i;p++){var d=h(t,0,p,this.toBBox),x=h(t,p,n,this.toBBox),v=(e=d,a=x,o=void 0,s=void 0,l=void 0,u=void 0,o=Math.max(e.minX,a.minX),s=Math.max(e.minY,a.minY),l=Math.min(e.maxX,a.maxX),u=Math.min(e.maxY,a.maxY),Math.max(0,l-o)*Math.max(0,u-s)),M=f(d)+f(x);v<m?(m=v,r=p,c=M<c?M:c):v===m&&M<c&&(c=M,r=p)}return r||n-i},r.prototype._chooseSplitAxis=function(t,i,n){var r=t.leaf?this.compareMinX:s,e=t.leaf?this.compareMinY:l;this._allDistMargin(t,i,n,r)<this._allDistMargin(t,i,n,e)&&t.children.sort(r)},r.prototype._allDistMargin=function(t,i,n,r){t.children.sort(r);for(var e=this.toBBox,a=h(t,0,i,e),s=h(t,n-i,n,e),l=u(a)+u(s),f=i;f<n-i;f++){var m=t.children[f];o(a,t.leaf?e(m):m),l+=u(a)}for(var c=n-i-1;c>=i;c--){var p=t.children[c];o(s,t.leaf?e(p):p),l+=u(s)}return l},r.prototype._adjustParentBBoxes=function(t,i,n){for(var r=n;r>=0;r--)o(i[r],t)},r.prototype._condense=function(t){for(var i=t.length-1,n=void 0;i>=0;i--)0===t[i].children.length?i>0?(n=t[i-1].children).splice(n.indexOf(t[i]),1):this.clear():a(t[i],this.toBBox)},r});

package/node_modules/robust-predicates/LICENSE DELETED Viewed

@@ -1,24 +0,0 @@
-This is free and unencumbered software released into the public domain.
-Anyone is free to copy, modify, publish, use, compile, sell, or
-distribute this software, either in source code form or as a compiled
-binary, for any purpose, commercial or non-commercial, and by any
-means.
-In jurisdictions that recognize copyright laws, the author or authors
-of this software dedicate any and all copyright interest in the
-software to the public domain. We make this dedication for the benefit
-of the public at large and to the detriment of our heirs and
-successors. We intend this dedication to be an overt act of
-relinquishment in perpetuity of all present and future rights to this
-software under copyright law.
-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 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.
-For more information, please refer to <http://unlicense.org>

package/node_modules/robust-predicates/README.md DELETED Viewed

@@ -1,82 +0,0 @@
-# robust-predicates
-Fast robust predicates for computational geometry in JavaScript. Provides reliable 2D and 3D point orientation tests (`orient2d`, `orient3d`, `incircle`, `insphere`) that are not susceptible to floating point errors (without sacrificing performance). A modern port of [Jonathan R Shewchuk's C code](https://www.cs.cmu.edu/~quake/robust.html), an industry standard since 1996.
-<a href="https://observablehq.com/@mourner/non-robust-arithmetic-as-art"><img width="600" height="200" src="predicates.png" /></a>
-_Figure: non-robust vs robust `orient2d` test for points within a tiny range (2<sup>-42</sup>)._
-[![Build Status](https://travis-ci.com/mourner/robust-predicates.svg?branch=master)](https://travis-ci.com/mourner/robust-predicates)
-[![Simply Awesome](https://img.shields.io/badge/simply-awesome-brightgreen.svg)](https://github.com/mourner/projects)
-[![Browser Build](https://badgen.net/bundlephobia/minzip/robust-predicates)](https://unpkg.com/robust-predicates)
-## [Demo](https://observablehq.com/@mourner/non-robust-arithmetic-as-art)
-## API
-Note: unlike J. Shewchuk's original code, all the functions in this library assume `y` axis is oriented _downwards_ &darr;, so the semantics are different.
-### `orient2d(ax,ay, bx,by, cx,cy)`
-- Returns a *positive* value if the points `a`, `b`, and `c` occur in _counterclockwise_ order (`c` lies to the left of the directed line defined by points `a` and `b`).
-- Returns a *negative* value if they occur in _clockwise_ order (`c` lies to the right of the directed line `ab`).
-- Returns *zero* if they are _collinear_.
-The result is also an approximation of twice the signed area of the triangle defined by the three points.
-### `incircle(ax,ay, bx,by, cx,cy, dx,dy)`
-- Returns a _positive_ value if the point `d` lies _outside_ the circle passing through `a`, `b`, and `c`.
-- Returns a _negative_ value if it lies _inside_.
-- Returns _zero_ if the four points are _cocircular_.
-The points `a`, `b`, and `c` must be in _counterclockwise_ order, or the sign of the result will be reversed.
-### `orient3d(ax,ay,az, bx,by,bz, cx,cy,cz, dx,dy,dz)`
-- Returns a _positive_ value if the point `d` lies _above_ the plane passing through `a`, `b`, and `c`, meaning that `a`, `b`, and `c` appear in counterclockwise order when viewed from `d`.
-- Returns a _negative_ value if `d` lies _below_ the plane.
-- Returns _zero_ if the points are _coplanar_.
-The result is also an approximation of six times the signed volume of the tetrahedron defined by the four points.
-### `insphere(ax,ay,az, bx,by,bz, cx,cy,cz, dx,dy,dz, ex,ey,ez)`
-- Returns a _positive_ value if the point `e` lies _outside_ the sphere passing through `a`, `b`, `c`, and `d`.
-- Returns a _negative_ value if it lies _inside_.
-- Returns _zero_ if the five points are _cospherical_.
-The points `a`, `b`, `c`, and `d` must be ordered so that they have a _positive orientation_
-(as defined by `orient3d`), or the sign of the result will be reversed.
-### `orient2dfast`, `orient3dfast`, `incirclefast`, `inspherefast`
-Simple, approximate, non-robust versions of predicates above. Use when robustness isn't needed.
-## Example
-```js
-import {orient2d} from 'robust-predicates';
-const ccw = orient2d(ax, ay, bx, by, cx, cy) > 0;
-````
-## Install
-Install with `npm install robust-predicates` or `yarn add robust-predicates`, or use one of the browser builds:
-- [predicates.min.js](https://unpkg.com/robust-predicates/umd/predicates.min.js) (all predicates)
-- [orient2d.min.js](https://unpkg.com/robust-predicates/umd/orient2d.min.js) (`orient2d`, `orient2dfast`)
-- [orient3d.min.js](https://unpkg.com/robust-predicates/umd/orient3d.min.js) (`orient3d`, `orient3dfast`)
-- [incircle.min.js](https://unpkg.com/robust-predicates/umd/incircle.min.js) (`incircle`, `incirclefast`)
-- [insphere.min.js](https://unpkg.com/robust-predicates/umd/insphere.min.js) (`insphere`, `inspherefast`)
-## Thanks
-This project is just a port — all the brilliant, hard work was done by [Jonathan Richard Shewchuk](https://people.eecs.berkeley.edu/~jrs/).
-The port was also inspired by [Mikola Lysenko](https://twitter.com/MikolaLysenko)'s excellent [Robust Arithmetic Notes](https://github.com/mikolalysenko/robust-arithmetic-notes) and related projects like [robust-orientation](https://github.com/mikolalysenko/robust-orientation) and [robust-in-sphere](https://github.com/mikolalysenko/robust-in-sphere).
-## License
-Since the original code is in the public domain, this project follows the same choice. See [Unlicense](https://unlicense.org).