node-red-contrib-tak-registration 0.3.1 → 0.6.0

package/node_modules/quickselect/package.json

@@ -1,34 +1,9 @@
 {
-  "_from": "quickselect@^2.0.0",
-  "_id": "quickselect@2.0.0",
-  "_inBundle": false,
-  "_integrity": "sha512-RKJ22hX8mHe3Y6wH/N3wCM6BWtjaxIyyUIkpHOvfFnxdI4yD4tBXEBKSbriGujF6jnSVkJrffuo6vxACiSSxIw==",
-  "_location": "/quickselect",
-  "_phantomChildren": {},
-  "_requested": {
-    "type": "range",
-    "registry": true,
-    "raw": "quickselect@^2.0.0",
-    "name": "quickselect",
-    "escapedName": "quickselect",
-    "rawSpec": "^2.0.0",
-    "saveSpec": null,
-    "fetchSpec": "^2.0.0"
-  },
-  "_requiredBy": [
-    "/rbush"
-  ],
-  "_resolved": "https://registry.npmjs.org/quickselect/-/quickselect-2.0.0.tgz",
-  "_shasum": "f19680a486a5eefb581303e023e98faaf25dd018",
-  "_spec": "quickselect@^2.0.0",
-  "_where": "/Users/conway/Projects/TAKreg/node_modules/rbush",
-  "author": {
-    "name": "Vladimir Agafonkin"
-  },
-  "bundleDependencies": false,
-  "dependencies": {},
-  "deprecated": false,
+  "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",
@@ -42,6 +17,13 @@
       "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"
@@ -55,16 +37,6 @@
     "floyd",
     "rivest"
   ],
-  "license": "ISC",
-  "main": "quickselect.js",
-  "module": "index.js",
-  "name": "quickselect",
-  "scripts": {
-    "bench": "node -r esm bench.js",
-    "build": "rollup -c",
-    "prepublishOnly": "npm run build",
-    "pretest": "eslint index.js test.js bench.js",
-    "test": "node -r esm test.js"
-  },
-  "version": "2.0.0"
+  "author": "Vladimir Agafonkin",
+  "license": "ISC"
 }

package/node_modules/rbush/README.md

@@ -33,15 +33,15 @@ Install with NPM (`npm install rbush`), or use CDN links for browsers:
 ### Creating a Tree
 
 ```js
-const tree = new RBush();
+var tree = rbush();
 ```
 
-An optional argument to `RBush` defines the maximum number of entries in a tree node.
+An optional argument to `rbush` defines the maximum number of entries in a tree node.
 `9` (used by default) is a reasonable choice for most applications.
 Higher value means faster insertion and slower search, and vice versa.
 
 ```js
-const tree = new RBush(16);
+var tree = rbush(16);
 ```
 
 ### Adding Data
@@ -49,7 +49,7 @@ const tree = new RBush(16);
 Insert an item:
 
 ```js
-const item = {
+var item = {
     minX: 20,
     minY: 40,
     maxX: 30,
@@ -72,7 +72,7 @@ However, you can pass a custom `equals` function to compare by value for removal
 which is useful when you only have a copy of the object you need removed (e.g. loaded from server):
 
 ```js
-tree.remove(itemCopy, (a, b) => {
+tree.remove(itemCopy, function (a, b) {
     return a.id === b.id;
 });
 ```
@@ -87,16 +87,12 @@ tree.clear();
 
 By default, RBush assumes the format of data points to be an object
 with `minX`, `minY`, `maxX` and `maxY` properties.
-You can customize this by overriding `toBBox`, `compareMinX` and `compareMinY` methods like this:
+You can customize this by providing an array with corresponding accessor strings
+as a second argument to `rbush` like this:
 
 ```js
-class MyRBush extends RBush {
-    toBBox([x, y]) { return {minX: x, minY: y, maxX: x, maxY: y}; }
-    compareMinX(a, b) { return a.x - b.x; }
-    compareMinY(a, b) { return a.y - b.y; }
-}
-const tree = new MyRBush();
-tree.insert([20, 50]); // accepts [x, y] points
+var tree = rbush(9, ['[0]', '[1]', '[0]', '[1]']); // accept [x, y] points
+tree.insert([20, 50]);
 ```
 
 If you're indexing a static list of points (you don't need to add/remove points after indexing), you should use [kdbush](https://github.com/mourner/kdbush) which performs point indexing 5-8x faster than RBush.
@@ -123,7 +119,7 @@ but makes query performance worse if the data is scattered.
 ### Search
 
 ```js
-const result = tree.search({
+var result = tree.search({
     minX: 40,
     minY: 20,
     maxX: 80,
@@ -134,10 +130,10 @@ const result = tree.search({
 Returns an array of data items (points or rectangles) that the given bounding box intersects.
 
 Note that the `search` method accepts a bounding box in `{minX, minY, maxX, maxY}` format
-regardless of the data format.
+regardless of the format specified in the constructor (which only affects inserted objects).
 
 ```js
-const allItems = tree.all();
+var allItems = tree.all();
 ```
 
 Returns all items of the tree.
@@ -145,7 +141,7 @@ Returns all items of the tree.
 ### Collisions
 
 ```js
-const result = tree.collides({minX: 40, minY: 20, maxX: 80, maxY: 70});
+var result = tree.collides({minX: 40, minY: 20, maxX: 80, maxY: 70});
 ```
 
 Returns `true` if there are any items intersecting the given bounding box, otherwise `false`.
@@ -155,10 +151,10 @@ Returns `true` if there are any items intersecting the given bounding box, other
 
 ```js
 // export data as JSON object
-const treeData = tree.toJSON();
+var treeData = tree.toJSON();
 
 // import previously exported data
-const tree = rbush(9).fromJSON(treeData);
+var tree = rbush(9).fromJSON(treeData);
 ```
 
 Importing and exporting as JSON allows you to use RBush on both the server (using Node.js) and the browser combined,
@@ -208,11 +204,88 @@ bulk-insert 1M items         | 1.25s  | n/a    | 6.7x
 ```bash
 npm install  # install dependencies
 
-npm test     # lint the code and run tests
+npm test     # check the code with JSHint and run tests
 npm run perf # run performance benchmarks
-npm run cov  # report test coverage
+npm run cov  # report test coverage (with more detailed report in coverage/lcov-report/index.html)
 ```
 
 ## Compatibility
 
-RBush should run on Node and all major browsers that support ES5.
+RBush should run on Node and all major browsers. The only caveat: IE 8 needs an [Array#indexOf polyfill](https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf#Polyfill) for `remove` method to work.
+
+## Changelog
+
+#### 2.0.1 — June 29, 2016
+
+- Fixed browser builds in NPM.
+
+#### 2.0.0 — June 29, 2016
+
+- **Breaking:** changed the default format of inserted items from `[20, 40, 30, 50]` to `{minX: 20, minY: 40, maxX: 30, maxY: 50}`.
+- **Breaking:** changed the `search` method argument format from `[20, 40, 30, 50]` to `{minX: 20, minY: 40, maxX: 30, maxY: 50}`.
+- Improved performance by up to 30%.
+- Added `equalsFn` optional argument to `remove` to be able to remove by value rather than by reference.
+- Changed the source code to use CommonJS module format. Browser builds are automatically built and published to NPM.
+- Quickselect algorithm (used internally) is now a [separate module](https://github.com/mourner/quickselect).
+
+#### 1.4.3 — May 17, 2016
+
+- Fixed an error when inserting many empty bounding boxes.
+
+#### 1.4.2 — Dec 16, 2015
+
+- 50% faster insertion.
+
+#### 1.4.1 — Sep 16, 2015
+
+- Fixed insertion in IE8.
+
+#### 1.4.0 — Apr 22, 2015
+
+- Added `collides` method for fast collision detection.
+
+#### 1.3.4 — Aug 31, 2014
+
+- Improved bulk insertion performance for a large number of items (e.g. up to 100% for inserting a million items).
+- Fixed performance regression for high node sizes.
+
+#### 1.3.3 — Aug 30, 2014
+
+- Improved bulk insertion performance by ~60-70%.
+- Improved insertion performance by ~40%.
+- Improved search performance by ~30%.
+
+#### 1.3.2 — Nov 25, 2013
+
+- Improved removal performance by ~50%. [#18](https://github.com/mourner/rbush/pull/18)
+
+#### 1.3.1 — Nov 24, 2013
+
+- Fixed minor error in the choose split axis algorithm. [#17](https://github.com/mourner/rbush/pull/17)
+- Much better test coverage (near 100%). [#6](https://github.com/mourner/rbush/issues/6)
+
+#### 1.3.0 — Nov 21, 2013
+
+- Significantly improved search performance (especially on large-bbox queries — up to 3x faster). [#11](https://github.com/mourner/rbush/pull/11)
+- Added `all` method for getting all of the tree items. [#11](https://github.com/mourner/rbush/pull/11)
+- Made `toBBox`, `compareMinX`, `compareMinY` methods public, made it possible to avoid Content Security Policy issues by overriding them for custom format. [#14](https://github.com/mourner/rbush/pull/14) [#12](https://github.com/mourner/rbush/pull/12)
+
+#### 1.2.5 — Nov 5, 2013
+
+- Fixed a bug where insertion failed on a tree that had all items removed previously. [#10](https://github.com/mourner/rbush/issues/10)
+
+#### 1.2.4 — Oct 25, 2013
+
+- Added Web Workers support. [#9](https://github.com/mourner/rbush/pull/9)
+
+#### 1.2.3 — Aug 30, 2013
+
+- Added AMD support. [#8](https://github.com/mourner/rbush/pull/8)
+
+#### 1.2.2 — Aug 27, 2013
+
+- Eliminated recursion when recalculating node bboxes (on insert, remove, load).
+
+#### 1.2.0 — Jul 19, 2013
+
+First fully functional RBush release.