Release 0.5.1

Author: lsbardel

package.json

@@ -1,5 +1,5 @@
 {
-  "version": "0.5.0",
+  "version": "0.5.1",
   "name": "d3-quant",
   "description": "D3 library for quantitative analytics",
   "homepage": "https://github.com/quantmind/d3-quant",

src/btree.ts

@@ -107,10 +107,10 @@ class Node implements BtreeNode {
     let nd: Node;
 
     if (score > this.score) {
-      if (this.right) return this.right.insert(node);
+      if (this.right) return this.right.insert(node, callback);
       else this.right = nd = new Node(score);
     } else {
-      if (this.left) return this.left.insert(node);
+      if (this.left) return this.left.insert(node, callback);
       else this.left = nd = new Node(score);
     }
     nd.red = true;

tests/btree.test.ts

@@ -1,4 +1,5 @@
-import { binaryTree } from "../src";
+import { range } from "d3-array";
+import { binaryTree, BtreeNode } from "../src";
 
 describe("Btree", () => {
   test("test btree constructor", () => {
@@ -28,4 +29,18 @@ describe("Btree", () => {
     const nodes = tree.nodes();
     expect(nodes.length).toBe(3);
   });
+
+  test("test btree insert callback", () => {
+    const tree = binaryTree();
+    range(50).forEach(() => {
+      const value = Math.random();
+      let nd: BtreeNode | undefined;
+      tree.insert(value, (n: BtreeNode) => {
+        nd = n;
+      });
+      expect(nd?.score).toBe(value);
+    });
+    tree.insert(0.5);
+    tree.insert(0.6);
+  });
 });