begin KDTree implementation

2 files changed, 45 insertions, 0 deletions

diff --git a/modules/KDTree.js b/modules/KDTree.js
new file mode 100644
index 0000000..d9133d1
--- /dev/null
+++ b/modules/KDTree.js
@@ -0,0 +1,33 @@
+'use strict';
+
+class NodeType {
+	static Leaf = new NodeType('Leaf');
+	static Branch = new NodeType('Branch');
+
+	constructor(name) { this.name = name; }
+	toString() { return `NodeType.${this.name}`; }
+}
+
+
+class LeafNode {
+	constructor(point) {
+		this.type = NodeType.Leaf;
+		this.point = point;
+	}
+}
+class BranchNode {
+}
+
+
+class KDTree {
+	constructor() {
+		this.root = null;
+	}
+
+	insert(point) {
+		this.root = new LeafNode(point);
+	}
+}
+
+export { KDTree, NodeType, LeafNode, BranchNode };
+export default KDTree;
diff --git a/modules/KDTree.test.js b/modules/KDTree.test.js
new file mode 100644
index 0000000..4e2657b
--- /dev/null
+++ b/modules/KDTree.test.js
@@ -0,0 +1,12 @@
+import { test, assert } from './test-assert.js';
+
+import { KDTree, NodeType } from './KDTree.js';
+
+test('single point does not split tree', () => {
+	let tree = new KDTree();
+	tree.insert({x: 0.5, y: 0.5 });
+	assert.deepEqual(tree.root.type, NodeType.Leaf);
+	assert.ok(tree.root.point);
+	assert(tree.root.point.x = 0.5);
+	assert(tree.root.point.y = 0.5);
+});