nlptoolkit-datastructure 1.0.0 → 1.0.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/Stack.d.ts +7 -0
- package/dist/Stack.js +35 -0
- package/dist/Stack.js.map +1 -0
- package/dist/heap/Heap.d.ts +13 -0
- package/dist/heap/Heap.js +74 -0
- package/dist/heap/Heap.js.map +1 -0
- package/dist/heap/HeapNode.d.ts +5 -0
- package/dist/heap/HeapNode.js +23 -0
- package/dist/heap/HeapNode.js.map +1 -0
- package/dist/heap/MaxHeap.d.ts +5 -0
- package/dist/heap/MaxHeap.js +24 -0
- package/dist/heap/MaxHeap.js.map +1 -0
- package/dist/heap/MinHeap.d.ts +5 -0
- package/dist/heap/MinHeap.js +24 -0
- package/dist/heap/MinHeap.js.map +1 -0
- package/dist/tree/AvlTree.d.ts +12 -0
- package/dist/tree/AvlTree.js +107 -0
- package/dist/tree/AvlTree.js.map +1 -0
- package/dist/tree/AvlTreeNode.d.ts +5 -0
- package/dist/tree/AvlTreeNode.js +22 -0
- package/dist/tree/AvlTreeNode.js.map +1 -0
- package/dist/tree/BTree.d.ts +9 -0
- package/dist/tree/BTree.js +58 -0
- package/dist/tree/BTree.js.map +1 -0
- package/dist/tree/BTreeNode.d.ts +15 -0
- package/dist/tree/BTreeNode.js +122 -0
- package/dist/tree/BTreeNode.js.map +1 -0
- package/dist/tree/Tree.d.ts +10 -0
- package/dist/tree/Tree.js +69 -0
- package/dist/tree/Tree.js.map +1 -0
- package/dist/tree/TreeNode.d.ts +6 -0
- package/dist/tree/TreeNode.js +22 -0
- package/dist/tree/TreeNode.js.map +1 -0
- package/index.js +8 -1
- package/package.json +1 -1
- package/source/Stack.ts +26 -0
- package/source/heap/Heap.ts +73 -0
- package/source/heap/HeapNode.ts +13 -0
- package/source/heap/MaxHeap.ts +14 -0
- package/source/heap/MinHeap.ts +13 -0
- package/source/tree/AvlTree.ts +97 -0
- package/source/tree/AvlTreeNode.ts +12 -0
- package/source/tree/BTree.ts +50 -0
- package/source/tree/BTreeNode.ts +116 -0
- package/source/tree/Tree.ts +58 -0
- package/source/tree/TreeNode.ts +11 -0
- package/tests/CounterHashMapTest.ts +1 -1
- package/tests/HeapTest.ts +40 -0
- package/tests/LRUCacheTest.ts +1 -1
- package/tests/TreeTest.ts +47 -0
|
@@ -0,0 +1,47 @@
|
|
|
1
|
+
import * as assert from "assert";
|
|
2
|
+
import {Tree} from "../dist/tree/Tree";
|
|
3
|
+
import {AvlTree} from "../dist/tree/AvlTree";
|
|
4
|
+
import {BTree} from "../dist/tree/BTree";
|
|
5
|
+
|
|
6
|
+
describe('TreeTest', function() {
|
|
7
|
+
describe('TreeTest', function() {
|
|
8
|
+
function compare<T>(item1: T, item2: T): number {
|
|
9
|
+
if (typeof item1 == "number" && typeof item2 == "number"){
|
|
10
|
+
return item1 - item2
|
|
11
|
+
}
|
|
12
|
+
return 0
|
|
13
|
+
}
|
|
14
|
+
it('testTree', function() {
|
|
15
|
+
let tree : Tree<number> = new Tree<number>(compare);
|
|
16
|
+
tree.insertData(4);
|
|
17
|
+
tree.insertData(6);
|
|
18
|
+
tree.insertData(2);
|
|
19
|
+
tree.insertData(5);
|
|
20
|
+
tree.insertData(3);
|
|
21
|
+
tree.insertData(1);
|
|
22
|
+
tree.insertData(7);
|
|
23
|
+
assert.notEqual(null, tree.search(3));
|
|
24
|
+
assert.equal(null, tree.search(8));
|
|
25
|
+
});
|
|
26
|
+
it('testTree2', function() {
|
|
27
|
+
let tree : AvlTree<number> = new AvlTree<number>(compare);
|
|
28
|
+
for (let i = 1; i <= 31; i++){
|
|
29
|
+
tree.insertData(i);
|
|
30
|
+
}
|
|
31
|
+
for (let i = 1; i < 32; i++){
|
|
32
|
+
assert.notEqual(null, tree.search(i));
|
|
33
|
+
}
|
|
34
|
+
assert.equal(null, tree.search(32));
|
|
35
|
+
});
|
|
36
|
+
it('testTree3', function() {
|
|
37
|
+
let tree : BTree<number> = new BTree<number>(1, compare);
|
|
38
|
+
for (let i = 1; i <= 31; i++){
|
|
39
|
+
tree.insertData(i);
|
|
40
|
+
}
|
|
41
|
+
for (let i = 1; i < 32; i++){
|
|
42
|
+
assert.notEqual(null, tree.search(i));
|
|
43
|
+
}
|
|
44
|
+
assert.equal(null, tree.search(32));
|
|
45
|
+
});
|
|
46
|
+
});
|
|
47
|
+
});
|