@flatten-js/interval-tree - npm Package Compare versions

Comparing version 1.0.7 to 1.0.8

dist/main.cjs.js

@@ -206,3 +206,3 @@ 'use strict';
         const comparable_less_than = this.item.key.constructor.comparable_less_than;  // static method
-        let high = this.left.max.high ? this.left.max.high : this.left.max;
+        let high = this.left.max.high !== undefined ? this.left.max.high : this.left.max;
         return comparable_less_than(high, search_node.item.key.low);
@@ -214,3 +214,3 @@ }
         const comparable_less_than = this.item.key.constructor.comparable_less_than;  // static method
-        let low = this.right.max.low ? this.right.max.low : this.right.item.key.low;
+        let low = this.right.max.low !== undefined ? this.right.max.low : this.right.item.key.low;
         return comparable_less_than(search_node.item.key.high, low);
@@ -217,0 +217,0 @@ }

dist/main.esm.js

@@ -202,3 +202,3 @@ /**
         const comparable_less_than = this.item.key.constructor.comparable_less_than;  // static method
-        let high = this.left.max.high ? this.left.max.high : this.left.max;
+        let high = this.left.max.high !== undefined ? this.left.max.high : this.left.max;
         return comparable_less_than(high, search_node.item.key.low);
@@ -210,3 +210,3 @@ }
         const comparable_less_than = this.item.key.constructor.comparable_less_than;  // static method
-        let low = this.right.max.low ? this.right.max.low : this.right.item.key.low;
+        let low = this.right.max.low !== undefined ? this.right.max.low : this.right.item.key.low;
         return comparable_less_than(search_node.item.key.high, low);
@@ -213,0 +213,0 @@ }

dist/main.umd.js

@@ -208,3 +208,3 @@ (function (global, factory) {
             const comparable_less_than = this.item.key.constructor.comparable_less_than;  // static method
-            let high = this.left.max.high ? this.left.max.high : this.left.max;
+            let high = this.left.max.high !== undefined ? this.left.max.high : this.left.max;
             return comparable_less_than(high, search_node.item.key.low);
@@ -216,3 +216,3 @@ }
             const comparable_less_than = this.item.key.constructor.comparable_less_than;  // static method
-            let low = this.right.max.low ? this.right.max.low : this.right.item.key.low;
+            let low = this.right.max.low !== undefined ? this.right.max.low : this.right.item.key.low;
             return comparable_less_than(search_node.item.key.high, low);
@@ -219,0 +219,0 @@ }

examples/create-react-app/package.json

@@ -0,0 +0,0 @@ {

examples/create-react-app/src/App.js

@@ -0,0 +0,0 @@ import React from 'react';

examples/create-react-app/src/ComposersList.js

@@ -0,0 +0,0 @@ import React from 'react';

examples/create-react-app/src/index.js

@@ -0,0 +0,0 @@ import React from 'react';

examples/nodejs/index.js

@@ -0,0 +0,0 @@ const IntervalTree = require("@flatten-js/interval-tree").default;

index.d.ts

@@ -0,0 +0,0 @@ // Type definitions for flatten-interval-tree library v1.0.2

index.js

 export {default as Node} from './src/classes/node';
 export {default as Interval} from './src/classes/interval';
 export {default} from './src/classes/intervalTree.js';

package.json

 {
   "name": "@flatten-js/interval-tree",
-  "version": "1.0.7",
+  "version": "1.0.8",
   "description": "Interval search tree",
@@ -5,0 +5,0 @@ "main": "dist/main.cjs.js",

README.md

@@ -0,0 +0,0 @@ # Interval Tree

rollup.config.js

@@ -0,0 +0,0 @@ export default {

src/classes/interval.js

@@ -0,0 +0,0 @@ /**

src/classes/intervalTree.js

@@ -0,0 +0,0 @@ /**

src/classes/node.js

@@ -72,3 +72,3 @@ /**
         const comparable_less_than = this.item.key.constructor.comparable_less_than;  // static method
-        let high = this.left.max.high ? this.left.max.high : this.left.max;
+        let high = this.left.max.high !== undefined ? this.left.max.high : this.left.max;
         return comparable_less_than(high, search_node.item.key.low);
@@ -80,3 +80,3 @@ }
         const comparable_less_than = this.item.key.constructor.comparable_less_than;  // static method
-        let low = this.right.max.low ? this.right.max.low : this.right.item.key.low;
+        let low = this.right.max.low !== undefined ? this.right.max.low : this.right.item.key.low;
         return comparable_less_than(search_node.item.key.high, low);
@@ -83,0 +83,0 @@ }

src/utils/constants.js

@@ -0,0 +0,0 @@ /**

test/intervalTree.js

@@ -209,3 +209,9 @@ /**
         expect(resp2).to.be.deep.equal(["val2"]);
-    })
+    });
+    it('Low or high can be 0', function () {
+        let tree = new IntervalTree();
+        let ints = [[0,0],[0,0],[1,1],[0,0]];
+        for (let i=0; i < ints.length; i++) tree.insert(ints[i],"val"+i);
+        expect(tree.search([0,0])).to.deep.equal(['val0','val1','val3']);
+    });
 });

test/node.js

@@ -0,0 +0,0 @@ /**

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Lines of code

4044

increased by0.15%

Worsened metrics

Total package byte prevSize

1696991

decreased by-0.29%

No dependency changes