Merge pull request #52 from alexbol99/51_support_for_bigint

Support for bigint

Author: alexbol99

README.md

@@ -28,19 +28,16 @@ import IntervalTree from '@flatten-js/interval-tree'
 
 ### Notes
 Tree stores pairs ```<key,value>``` where key is an interval, and value is an object of any type.
-If value omitted, tree stores only keys.
- 
-In a ```<key,value>``` tree none of the ```value``` can be 
-```undefined```.
+If value omitted, tree stores only keys. ```value``` cannot be ```undefined```.
 
-Interval can be simply a pair of numbers or it can be
-a user-defined object that implements ```IntervalInterface``` described in
+Interval can be a pair of numbers or an object that implements ```IntervalInterface``` described in
 typescript declaration file ```index.d.ts```.
 
 Axis aligned rectangle is an example of such interval.
 We may look at rectangle as an interval between its low left and top right corners.
-See **Box** class in [flatten-js](https://github.com/alexbol99/flatten-js) library as an example 
-of ```IntervalInterface``` implementation.
+It makes possible to use interval tree in spatial queries.
+See **Box** class in [flatten-js](https://github.com/alexbol99/flatten-js) library for such
+implementation.
 
 ### Example
 
@@ -77,13 +74,13 @@ let node = tree.insert(key, value)
 
 ### Exist(key, value)
 Method returns true if item {key, value} exists in the tree. <br/>
-Method may be useful if need to support unique items.
+
 ```javascript
 let exist = tree.exist(key, value)
 ```
 
 ### Remove(key, value)
-Removes item from the tree. Returns true if item was actually deleted, false if not found
+Removes item from the tree. Returns true if item was found and deleted, false if not found
 ```javascript
 let removed = tree.remove(key, value)
 ```
@@ -123,7 +120,7 @@ console.log(searchRes)
 ```
 
 ### Intersect_any(interval)
-Returns true if intersection between given and any interval stored in the tree found
+Returns true if intersection found between given interval and any of intervals stored in the tree
 
 ```javascript
 let found = tree.intersect_any(interval)

dist/main.cjs

@@ -1,6 +1,6 @@
 {
   "name": "@flatten-js/interval-tree",
-  "version": "1.1.1",
+  "version": "1.1.2",
   "description": "Interval search tree",
   "author": "Alex Bol",
   "license": "MIT",

dist/main.mjs

@@ -5,7 +5,7 @@
 /**
  * Interval is a pair of numbers or a pair of any comparable objects on which may be defined predicates
  * *equal*, *less* and method *max(p1, p1)* that returns maximum in a pair.
- * When interval is an object rather than pair of numbers, this object should have properties *low*, *high*, *max*
+ * When interval is an object rather than a pair of numbers, this object should have properties *low*, *high*, *max*
  * and implement methods *less_than(), equal_to(), intersect(), not_intersect(), clone(), output()*.
  * Two static methods *comparable_max(), comparable_less_than()* define how to compare values in pair. <br/>
  * This interface is described in typescript definition file *index.d.ts*
@@ -51,7 +51,7 @@ const Interval = class Interval {
      */
     less_than(other_interval) {
         return this.low < other_interval.low ||
-            this.low == other_interval.low && this.high < other_interval.high;
+            this.low === other_interval.low && this.high < other_interval.high;
     }
 
     /**
@@ -60,7 +60,7 @@ const Interval = class Interval {
      * @returns {boolean}
      */
     equal_to(other_interval) {
-        return this.low == other_interval.low && this.high == other_interval.high;
+        return this.low === other_interval.low && this.high === other_interval.high;
     }
 
     /**
@@ -83,13 +83,15 @@ const Interval = class Interval {
 
     /**
      * Returns new interval merged with other interval
-     * @param {Interval} interval - Other interval to merge with
+     * @param {Interval} other_interval - Other interval to merge with
      * @returns {Interval}
      */
     merge(other_interval) {
         return new Interval(
-            this.low === undefined ? other_interval.low : Math.min(this.low, other_interval.low),
-            this.high === undefined ? other_interval.high : Math.max(this.high, other_interval.high)
+            this.low === undefined ?
+                other_interval.low : (this.low < other_interval.low ? this.low : other_interval.low),
+            this.high === undefined ?
+                other_interval.high : (this.high > other_interval.high ? this.high : other_interval.high)
         );
     }