data-structure-typed 1.48.8 → 1.49.0

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.
Files changed (50) hide show
  1. package/CHANGELOG.md +1 -1
  2. package/README.md +58 -55
  3. package/README_zh-CN.md +58 -56
  4. package/benchmark/report.html +1 -46
  5. package/benchmark/report.json +23 -458
  6. package/dist/cjs/data-structures/binary-tree/avl-tree.d.ts +8 -1
  7. package/dist/cjs/data-structures/binary-tree/avl-tree.js +9 -0
  8. package/dist/cjs/data-structures/binary-tree/avl-tree.js.map +1 -1
  9. package/dist/cjs/data-structures/binary-tree/binary-tree.d.ts +15 -10
  10. package/dist/cjs/data-structures/binary-tree/binary-tree.js +55 -49
  11. package/dist/cjs/data-structures/binary-tree/binary-tree.js.map +1 -1
  12. package/dist/cjs/data-structures/binary-tree/bst.d.ts +8 -1
  13. package/dist/cjs/data-structures/binary-tree/bst.js +9 -0
  14. package/dist/cjs/data-structures/binary-tree/bst.js.map +1 -1
  15. package/dist/cjs/data-structures/binary-tree/rb-tree.d.ts +10 -16
  16. package/dist/cjs/data-structures/binary-tree/rb-tree.js +16 -29
  17. package/dist/cjs/data-structures/binary-tree/rb-tree.js.map +1 -1
  18. package/dist/cjs/data-structures/binary-tree/tree-multimap.d.ts +8 -1
  19. package/dist/cjs/data-structures/binary-tree/tree-multimap.js +9 -0
  20. package/dist/cjs/data-structures/binary-tree/tree-multimap.js.map +1 -1
  21. package/dist/cjs/data-structures/queue/deque.d.ts +0 -110
  22. package/dist/cjs/data-structures/queue/deque.js +1 -172
  23. package/dist/cjs/data-structures/queue/deque.js.map +1 -1
  24. package/dist/mjs/data-structures/binary-tree/avl-tree.d.ts +8 -1
  25. package/dist/mjs/data-structures/binary-tree/avl-tree.js +9 -0
  26. package/dist/mjs/data-structures/binary-tree/binary-tree.d.ts +15 -10
  27. package/dist/mjs/data-structures/binary-tree/binary-tree.js +55 -49
  28. package/dist/mjs/data-structures/binary-tree/bst.d.ts +8 -1
  29. package/dist/mjs/data-structures/binary-tree/bst.js +9 -0
  30. package/dist/mjs/data-structures/binary-tree/rb-tree.d.ts +10 -16
  31. package/dist/mjs/data-structures/binary-tree/rb-tree.js +16 -28
  32. package/dist/mjs/data-structures/binary-tree/tree-multimap.d.ts +8 -1
  33. package/dist/mjs/data-structures/binary-tree/tree-multimap.js +9 -0
  34. package/dist/mjs/data-structures/queue/deque.d.ts +0 -110
  35. package/dist/mjs/data-structures/queue/deque.js +0 -170
  36. package/dist/umd/data-structure-typed.js +94 -239
  37. package/dist/umd/data-structure-typed.min.js +2 -2
  38. package/dist/umd/data-structure-typed.min.js.map +1 -1
  39. package/package.json +1 -1
  40. package/src/data-structures/binary-tree/avl-tree.ts +11 -1
  41. package/src/data-structures/binary-tree/binary-tree.ts +65 -56
  42. package/src/data-structures/binary-tree/bst.ts +11 -1
  43. package/src/data-structures/binary-tree/rb-tree.ts +18 -32
  44. package/src/data-structures/binary-tree/tree-multimap.ts +17 -1
  45. package/src/data-structures/queue/deque.ts +1 -191
  46. package/test/unit/data-structures/binary-tree/binary-tree.test.ts +15 -8
  47. package/test/unit/data-structures/binary-tree/bst.test.ts +1 -1
  48. package/test/unit/data-structures/binary-tree/rb-tree.test.ts +5 -5
  49. package/test/unit/data-structures/queue/deque.test.ts +265 -367
  50. package/test/unit/data-structures/queue/queue.test.ts +158 -158
package/test/unit/data-structures/binary-tree/rb-tree.test.ts CHANGED
@@ -6,10 +6,10 @@ import { OrderedMap } from 'js-sdsl';
6
6
  const isDebug = isDebugTest;
7
7
 
8
8
  describe('RedBlackTree', () => {
9
- let tree: RedBlackTree;
9
+ let tree: RedBlackTree<number>;
10
10
 
11
11
  beforeEach(() => {
12
- tree = new RedBlackTree();
12
+ tree = new RedBlackTree<number>();
13
13
  });
14
14
 
15
15
  describe('add and getNode', () => {
@@ -141,10 +141,10 @@ describe('RedBlackTree', () => {
141
141
  });
142
142
 
143
143
  describe('RedBlackTree', () => {
144
- let tree: RedBlackTree;
144
+ let tree: RedBlackTree<number>;
145
145
 
146
146
  beforeEach(() => {
147
- tree = new RedBlackTree();
147
+ tree = new RedBlackTree<number>();
148
148
  });
149
149
 
150
150
  it('should add nodes into the tree', () => {
@@ -511,7 +511,7 @@ describe('RedBlackTree iterative methods test', () => {
511
511
  beforeEach(() => {
512
512
  rbTree = new RedBlackTree();
513
513
  rbTree.add([1, 'a']);
514
- rbTree.add([2, 'b']);
514
+ rbTree.add(2, 'b');
515
515
  rbTree.add([3, 'c']);
516
516
  });
517
517