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

package/node_modules/geojson-polygon-self-intersections/index.js

@@ -1,196 +0,0 @@
-// Find self-intersections in geojson polygon (possibly with interior rings)
-var rbush = require('rbush');
-
-
-var merge = function(){
-  var output = {};
-  Array.prototype.slice.call(arguments).forEach(function(arg){
-    if(arg){
-      Object.keys(arg).forEach(function(key){
-        output[key]=arg[key];
-      });
-    }
-  });
-  return output;
-};
-var defaults = {
-  useSpatialIndex: true,
-  epsilon: 0,
-  reportVertexOnVertex: false,
-  reportVertexOnEdge: false
-};
-
-module.exports = function(feature, filterFn, options0) {
-  var options;
-  if("object" === typeof options0){
-    options = merge(defaults,options0);
-  } else {
-    options = merge(defaults,{useSpatialIndex:options0});
-  }
-
-  if (feature.geometry.type != "Polygon") throw new Error("The input feature must be a Polygon");
-
-  var coord = feature.geometry.coordinates;
-
-  var output = [];
-  var seen = {};
-
-  if (options.useSpatialIndex) {
-    var allEdgesAsRbushTreeItems = [];
-    for (var ring0 = 0; ring0 < coord.length; ring0++) {
-      for (var edge0 = 0; edge0 < coord[ring0].length-1; edge0++) {
-        allEdgesAsRbushTreeItems.push(rbushTreeItem(ring0, edge0))
-      }
-    }
-    var tree = rbush();
-    tree.load(allEdgesAsRbushTreeItems);
-  }
-
-  for (var ring0 = 0; ring0 < coord.length; ring0++) {
-    for (var edge0 = 0; edge0 < coord[ring0].length-1; edge0++) {
-      if (options.useSpatialIndex) {
-        var bboxOverlaps = tree.search(rbushTreeItem(ring0, edge0));
-        bboxOverlaps.forEach(function(bboxIsect) {
-          var ring1 = bboxIsect.ring;
-          var edge1 = bboxIsect.edge;
-          ifIsectAddToOutput(ring0, edge0, ring1, edge1);
-        });
-      }
-      else {
-        for (var ring1 = 0; ring1 < coord.length; ring1++) {
-          for (var edge1 = 0 ; edge1 < coord[ring1].length-1; edge1++) {
-            // TODO: speedup possible if only interested in unique: start last two loops at ring0 and edge0+1
-            ifIsectAddToOutput(ring0, edge0, ring1, edge1);
-          }
-        }
-      }
-    }
-  }
-
-  if (!filterFn) output = {type: "Feature", geometry: {type: "MultiPoint", coordinates: output}};
-  return output;
-
-  // true if frac is (almost) 1.0 or 0.0
-  function isBoundaryCase(frac){
-    var e2 = options.epsilon * options.epsilon;
-    return e2 >= (frac-1)*(frac-1) || e2 >= frac*frac;
-  }
-  function isOutside(frac){
-    return frac < 0 - options.epsilon || frac > 1 + options.epsilon;
-  }
-  // Function to check if two edges intersect and add the intersection to the output
-  function ifIsectAddToOutput(ring0, edge0, ring1, edge1) {
-    var start0 = coord[ring0][edge0];
-    var end0 = coord[ring0][edge0+1];
-    var start1 = coord[ring1][edge1];
-    var end1 = coord[ring1][edge1+1];
-
-    var isect = intersect(start0, end0, start1, end1);
-
-    if (isect == null) return; // discard parallels and coincidence
-    frac0, frac1;
-    if (end0[0] != start0[0]) {
-      var frac0 = (isect[0]-start0[0])/(end0[0]-start0[0]);
-    } else {
-      var frac0 = (isect[1]-start0[1])/(end0[1]-start0[1]);
-    };
-    if (end1[0] != start1[0]) {
-      var frac1 = (isect[0]-start1[0])/(end1[0]-start1[0]);
-    } else {
-      var frac1 = (isect[1]-start1[1])/(end1[1]-start1[1]);
-    };
-
-    // There are roughly three cases we need to deal with.
-    // 1. If at least one of the fracs lies outside [0,1], there is no intersection.
-    if (isOutside(frac0) || isOutside(frac1)) {
-      return; // require segment intersection
-    }
-
-    // 2. If both are either exactly 0 or exactly 1, this is not an intersection but just
-    // two edge segments sharing a common vertex.
-    if (isBoundaryCase(frac0) && isBoundaryCase(frac1)){
-      if(! options.reportVertexOnVertex) return;
-    }
-
-    // 3. If only one of the fractions is exactly 0 or 1, this is
-    // a vertex-on-edge situation.
-    if (isBoundaryCase(frac0) || isBoundaryCase(frac1)){
-      if(! options.reportVertexOnEdge) return;
-    }
-
-    var key = isect;
-    var unique = !seen[key];
-    if (unique) {
-      seen[key] = true;
-    }
-
-    if (filterFn) {
-      output.push(filterFn(isect, ring0, edge0, start0, end0, frac0, ring1, edge1, start1, end1, frac1, unique));
-    } else {
-      output.push(isect);
-    }
-  }
-
-  // Function to return a rbush tree item given an ring and edge number
-  function rbushTreeItem(ring, edge) {
-
-    var start = coord[ring][edge];
-    var end = coord[ring][edge+1];
-
-    if (start[0] < end[0]) {
-      var minX = start[0], maxX = end[0];
-    } else {
-      var minX = end[0], maxX = start[0];
-    };
-    if (start[1] < end[1]) {
-      var minY = start[1], maxY = end[1];
-    } else {
-      var minY = end[1], maxY = start[1];
-    }
-    return {minX: minX, minY: minY, maxX: maxX, maxY: maxY, ring: ring, edge: edge};
-  }
-
-}
-
-// Function to compute where two lines (not segments) intersect. From https://en.wikipedia.org/wiki/Line%E2%80%93line_intersection
-function intersect(start0, end0, start1, end1) {
-  if (equalArrays(start0,start1) || equalArrays(start0,end1) || equalArrays(end0,start1) || equalArrays(end1,start1)) return null;
-  var x0 = start0[0],
-      y0 = start0[1],
-      x1 = end0[0],
-      y1 = end0[1],
-      x2 = start1[0],
-      y2 = start1[1],
-      x3 = end1[0],
-      y3 = end1[1];
-  var denom = (x0 - x1) * (y2 - y3) - (y0 - y1) * (x2 - x3);
-  if (denom == 0) return null;
-  var x4 = ((x0 * y1 - y0 * x1) * (x2 - x3) - (x0 - x1) * (x2 * y3 - y2 * x3)) / denom;
-  var y4 = ((x0 * y1 - y0 * x1) * (y2 - y3) - (y0 - y1) * (x2 * y3 - y2 * x3)) / denom;
-  return [x4, y4];
-}
-
-// Function to compare Arrays of numbers. From http://stackoverflow.com/questions/7837456/how-to-compare-arrays-in-javascript
-function equalArrays(array1, array2) {
-  // if the other array is a falsy value, return
-  if (!array1 || !array2)
-      return false;
-
-  // compare lengths - can save a lot of time
-  if (array1.length != array2.length)
-      return false;
-
-  for (var i = 0, l=array1.length; i < l; i++) {
-      // Check if we have nested arrays
-      if (array1[i] instanceof Array && array2[i] instanceof Array) {
-          // recurse into the nested arrays
-          if (!equalArrays(array1[i],array2[i]))
-              return false;
-      }
-      else if (array1[i] != array2[i]) {
-          // Warning - two different object instances will never be equal: {x:20} != {x:20}
-          return false;
-      }
-  }
-  return true;
-}

package/node_modules/geojson-polygon-self-intersections/node_modules/quickselect/LICENSE

@@ -1,15 +0,0 @@
-ISC License
-
-Copyright (c) 2018, 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/geojson-polygon-self-intersections/node_modules/quickselect/README.md

@@ -1,28 +0,0 @@
-## quickselect [![Build Status](https://travis-ci.org/mourner/quickselect.svg?branch=master)](https://travis-ci.org/mourner/quickselect)
-
-A tiny and fast [selection algorithm](https://en.wikipedia.org/wiki/Selection_algorithm) in JavaScript
-(specifically, [Floyd-Rivest selection](https://en.wikipedia.org/wiki/Floyd%E2%80%93Rivest_algorithm)).
-
-```js
-quickselect(array, k[, left, right, compareFn]);
-```
-
-Rearranges items so that all items in the `[left, k]` are the smallest.
-The `k`-th element will have the `(k - left + 1)`-th smallest value in `[left, right]`.
-
-- `array`: the array to partially sort (in place)
-- `k`: middle index for partial sorting (as defined above)
-- `left`: left index of the range to sort (`0` by default)
-- `right`: right index (last index of the array by default)
-- `compareFn`: compare function
-
-Example:
-
-```js
-var arr = [65, 28, 59, 33, 21, 56, 22, 95, 50, 12, 90, 53, 28, 77, 39];
-
-quickselect(arr, 8);
-
-// arr is [39, 28, 28, 33, 21, 12, 22, 50, 53, 56, 59, 65, 90, 77, 95]
-//                                         ^^ middle index
-```

package/node_modules/geojson-polygon-self-intersections/node_modules/quickselect/index.js

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

package/node_modules/geojson-polygon-self-intersections/node_modules/quickselect/package.json

@@ -1,42 +0,0 @@
-{
-  "name": "quickselect",
-  "version": "1.1.1",
-  "description": "A tiny and fast selection algorithm in JavaScript.",
-  "main": "quickselect.js",
-  "dependencies": {},
-  "devDependencies": {
-    "eslint": "^4.19.1",
-    "eslint-config-mourner": "^2.0.3",
-    "esm": "^3.0.15",
-    "rollup": "^0.57.1",
-    "tape": "^4.9.0"
-  },
-  "eslintConfig": {
-    "extends": "mourner",
-    "parserOptions": {
-      "sourceType": "module"
-    }
-  },
-  "scripts": {
-    "pretest": "eslint index.js test.js bench.js",
-    "test": "node -r esm test.js",
-    "bench": "node -r esm bench.js",
-    "build": "rollup -c",
-    "prepublishOnly": "npm run build"
-  },
-  "files": [
-    "index.js",
-    "quickselect.js"
-  ],
-  "keywords": [
-    "selection",
-    "algorithm",
-    "quickselect",
-    "sort",
-    "partial",
-    "floyd",
-    "rivest"
-  ],
-  "author": "Vladimir Agafonkin",
-  "license": "ISC"
-}

package/node_modules/geojson-polygon-self-intersections/node_modules/quickselect/quickselect.js

@@ -1,63 +0,0 @@
-(function (global, factory) {
-	typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
-	typeof define === 'function' && define.amd ? define(factory) :
-	(global.quickselect = 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;
-}
-
-return quickselect;
-
-})));

package/node_modules/geojson-polygon-self-intersections/node_modules/rbush/LICENSE

@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) 2016 Vladimir Agafonkin
-
-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.