typescript-ds-lib 0.2.5 → 0.2.6

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 (34) hide show
  1. package/package.json +1 -1
  2. package/dist/tests/binary-search-tree.test.d.ts +0 -1
  3. package/dist/tests/binary-search-tree.test.js +0 -163
  4. package/dist/tests/binary-search-tree.test.js.map +0 -1
  5. package/dist/tests/deque.test.d.ts +0 -1
  6. package/dist/tests/deque.test.js +0 -78
  7. package/dist/tests/deque.test.js.map +0 -1
  8. package/dist/tests/hash-table.test.d.ts +0 -1
  9. package/dist/tests/hash-table.test.js +0 -94
  10. package/dist/tests/hash-table.test.js.map +0 -1
  11. package/dist/tests/linked-list.test.d.ts +0 -1
  12. package/dist/tests/linked-list.test.js +0 -344
  13. package/dist/tests/linked-list.test.js.map +0 -1
  14. package/dist/tests/map.test.d.ts +0 -1
  15. package/dist/tests/map.test.js +0 -176
  16. package/dist/tests/map.test.js.map +0 -1
  17. package/dist/tests/matrix.test.d.ts +0 -1
  18. package/dist/tests/matrix.test.js +0 -278
  19. package/dist/tests/matrix.test.js.map +0 -1
  20. package/dist/tests/priority-queue.test.d.ts +0 -1
  21. package/dist/tests/priority-queue.test.js +0 -118
  22. package/dist/tests/priority-queue.test.js.map +0 -1
  23. package/dist/tests/queue.test.d.ts +0 -1
  24. package/dist/tests/queue.test.js +0 -48
  25. package/dist/tests/queue.test.js.map +0 -1
  26. package/dist/tests/red-black-tree.test.d.ts +0 -1
  27. package/dist/tests/red-black-tree.test.js +0 -167
  28. package/dist/tests/red-black-tree.test.js.map +0 -1
  29. package/dist/tests/set.test.d.ts +0 -1
  30. package/dist/tests/set.test.js +0 -119
  31. package/dist/tests/set.test.js.map +0 -1
  32. package/dist/tests/stack.test.d.ts +0 -1
  33. package/dist/tests/stack.test.js +0 -57
  34. package/dist/tests/stack.test.js.map +0 -1
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "typescript-ds-lib",
3
- "version": "0.2.5",
3
+ "version": "0.2.6",
4
4
  "description": "A collection of TypeScript data structure implementations",
5
5
  "author": "Artiom Baloian <artiom.baloian@gmail.com>",
6
6
  "license": "MIT",
package/dist/tests/binary-search-tree.test.d.ts DELETED
@@ -1 +0,0 @@
1
- export {};
package/dist/tests/binary-search-tree.test.js DELETED
@@ -1,163 +0,0 @@
1
- "use strict";
2
- Object.defineProperty(exports, "__esModule", { value: true });
3
- const binary_search_tree_1 = require("../lib/binary-search-tree");
4
- describe('BinarySearchTree', () => {
5
- let bst;
6
- beforeEach(() => {
7
- bst = new binary_search_tree_1.BinarySearchTree();
8
- });
9
- describe('Basic Operations', () => {
10
- test('should create empty tree', () => {
11
- expect(bst.isEmpty()).toBe(true);
12
- expect(bst.count()).toBe(0);
13
- });
14
- test('should insert and search values', () => {
15
- bst.insert(5);
16
- bst.insert(3);
17
- bst.insert(7);
18
- expect(bst.find(5)).toBe(true);
19
- expect(bst.find(3)).toBe(true);
20
- expect(bst.find(7)).toBe(true);
21
- expect(bst.find(1)).toBe(false);
22
- expect(bst.count()).toBe(3);
23
- expect(bst.isEmpty()).toBe(false);
24
- });
25
- test('should clear all nodes from tree', () => {
26
- bst.insert(5);
27
- bst.insert(3);
28
- bst.insert(7);
29
- bst.clear();
30
- expect(bst.isEmpty()).toBe(true);
31
- expect(bst.find(5)).toBe(false);
32
- expect(bst.min()).toBeUndefined();
33
- expect(bst.max()).toBeUndefined();
34
- expect(bst.count()).toBe(0);
35
- });
36
- });
37
- describe('Min/Max Operations', () => {
38
- test('should find min and max values', () => {
39
- bst.insert(5);
40
- bst.insert(3);
41
- bst.insert(7);
42
- bst.insert(1);
43
- bst.insert(9);
44
- expect(bst.min()).toBe(1);
45
- expect(bst.max()).toBe(9);
46
- });
47
- test('should return undefined min/max for empty tree', () => {
48
- expect(bst.min()).toBeUndefined();
49
- expect(bst.max()).toBeUndefined();
50
- });
51
- });
52
- describe('Remove Operations', () => {
53
- test('should remove leaf nodes', () => {
54
- bst.insert(5);
55
- bst.insert(3);
56
- bst.insert(7);
57
- bst.remove(3);
58
- expect(bst.find(3)).toBe(false);
59
- expect(bst.find(5)).toBe(true);
60
- expect(bst.find(7)).toBe(true);
61
- expect(bst.count()).toBe(2);
62
- });
63
- test('should remove nodes with one child', () => {
64
- bst.insert(5);
65
- bst.insert(3);
66
- bst.insert(2);
67
- bst.remove(3);
68
- expect(bst.find(3)).toBe(false);
69
- expect(bst.find(5)).toBe(true);
70
- expect(bst.find(2)).toBe(true);
71
- expect(bst.count()).toBe(2);
72
- });
73
- test('should remove nodes with two children', () => {
74
- bst.insert(5);
75
- bst.insert(3);
76
- bst.insert(7);
77
- bst.insert(6);
78
- bst.insert(8);
79
- bst.remove(7);
80
- expect(bst.find(7)).toBe(false);
81
- expect(bst.find(5)).toBe(true);
82
- expect(bst.find(8)).toBe(true);
83
- expect(bst.find(6)).toBe(true);
84
- expect(bst.count()).toBe(4);
85
- });
86
- test('should handle removing root node', () => {
87
- bst.insert(5);
88
- bst.insert(3);
89
- bst.insert(7);
90
- bst.remove(5);
91
- expect(bst.find(5)).toBe(false);
92
- expect(bst.find(3)).toBe(true);
93
- expect(bst.find(7)).toBe(true);
94
- expect(bst.count()).toBe(2);
95
- });
96
- test('should handle removing non-existent values', () => {
97
- bst.insert(5);
98
- bst.insert(3);
99
- bst.remove(7);
100
- expect(bst.count()).toBe(2);
101
- expect(bst.find(5)).toBe(true);
102
- expect(bst.find(3)).toBe(true);
103
- });
104
- });
105
- describe('Special Cases', () => {
106
- test('should maintain order with duplicate values', () => {
107
- const bst = new binary_search_tree_1.BinarySearchTree();
108
- bst.insert(5);
109
- bst.insert(5);
110
- bst.insert(5);
111
- expect(bst.count()).toBe(3);
112
- bst.remove(5);
113
- expect(bst.count()).toBe(2);
114
- expect(bst.find(5)).toBe(true);
115
- });
116
- test('should work with custom comparator', () => {
117
- const reverseBst = new binary_search_tree_1.BinarySearchTree((a, b) => a > b);
118
- reverseBst.insert(5);
119
- reverseBst.insert(3);
120
- reverseBst.insert(7);
121
- expect(reverseBst.min()).toBe(7);
122
- expect(reverseBst.max()).toBe(3);
123
- });
124
- });
125
- describe('Traversal Operations', () => {
126
- test('should traverse tree in-order', () => {
127
- bst.insert(5);
128
- bst.insert(3);
129
- bst.insert(7);
130
- bst.insert(1);
131
- bst.insert(9);
132
- const result = [];
133
- bst.forEach((value) => result.push(value));
134
- expect(result).toEqual([1, 3, 5, 7, 9]);
135
- });
136
- test('should traverse tree pre-order', () => {
137
- bst.insert(5);
138
- bst.insert(3);
139
- bst.insert(7);
140
- bst.insert(1);
141
- bst.insert(9);
142
- const result = [];
143
- bst.forEach((value) => result.push(value), 'preorder');
144
- expect(result).toEqual([5, 3, 1, 7, 9]);
145
- });
146
- test('should traverse tree post-order', () => {
147
- bst.insert(5);
148
- bst.insert(3);
149
- bst.insert(7);
150
- bst.insert(1);
151
- bst.insert(9);
152
- const result = [];
153
- bst.forEach((value) => result.push(value), 'postorder');
154
- expect(result).toEqual([1, 3, 9, 7, 5]);
155
- });
156
- test('should handle forEach on empty tree', () => {
157
- const result = [];
158
- bst.forEach((value) => result.push(value));
159
- expect(result).toEqual([]);
160
- });
161
- });
162
- });
163
- //# sourceMappingURL=binary-search-tree.test.js.map
package/dist/tests/binary-search-tree.test.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"file":"binary-search-tree.test.js","sourceRoot":"","sources":["../../tests/binary-search-tree.test.ts"],"names":[],"mappings":";;AAAA,kEAA6D;AAE7D,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,IAAI,GAA6B,CAAC;IAElC,UAAU,CAAC,GAAG,EAAE;QACd,GAAG,GAAG,IAAI,qCAAgB,EAAU,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAChC,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACpC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iCAAiC,EAAE,GAAG,EAAE;YAC3C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC5C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,GAAG,CAAC,KAAK,EAAE,CAAC;YACZ,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAClC,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;YAC1C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gDAAgD,EAAE,GAAG,EAAE;YAC1D,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;QACpC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QACjC,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACpC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC9C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;YACjD,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC5C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACtD,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;QAC7B,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACvD,MAAM,GAAG,GAAG,IAAI,qCAAgB,EAAU,CAAC;YAC3C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC9C,MAAM,UAAU,GAAG,IAAI,qCAAgB,CAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACjE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAErB,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;QACpC,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACzC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;YAC1C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,UAAU,CAAC,CAAC;YACvD,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iCAAiC,EAAE,GAAG,EAAE;YAC3C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEd,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,WAAW,CAAC,CAAC;YACxD,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC/C,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
package/dist/tests/deque.test.d.ts DELETED
@@ -1 +0,0 @@
1
- export {};
package/dist/tests/deque.test.js DELETED
@@ -1,78 +0,0 @@
1
- "use strict";
2
- Object.defineProperty(exports, "__esModule", { value: true });
3
- const deque_1 = require("../lib/deque");
4
- describe('Deque', () => {
5
- let deque;
6
- beforeEach(() => {
7
- deque = new deque_1.Deque();
8
- });
9
- test('should create empty deque', () => {
10
- expect(deque.isEmpty()).toBe(true);
11
- expect(deque.size()).toBe(0);
12
- });
13
- test('should push elements to front', () => {
14
- deque.pushFront(1);
15
- deque.pushFront(2);
16
- expect(deque.size()).toBe(2);
17
- expect(deque.front()).toBe(2);
18
- expect(deque.back()).toBe(1);
19
- });
20
- test('should push elements to back', () => {
21
- deque.pushBack(1);
22
- deque.pushBack(2);
23
- expect(deque.size()).toBe(2);
24
- expect(deque.front()).toBe(1);
25
- expect(deque.back()).toBe(2);
26
- });
27
- test('should pop elements from front', () => {
28
- deque.pushBack(1);
29
- deque.pushBack(2);
30
- expect(deque.popFront()).toBe(1);
31
- expect(deque.size()).toBe(1);
32
- expect(deque.popFront()).toBe(2);
33
- expect(deque.isEmpty()).toBe(true);
34
- });
35
- test('should pop elements from back', () => {
36
- deque.pushBack(1);
37
- deque.pushBack(2);
38
- expect(deque.popBack()).toBe(2);
39
- expect(deque.size()).toBe(1);
40
- expect(deque.popBack()).toBe(1);
41
- expect(deque.isEmpty()).toBe(true);
42
- });
43
- test('should return undefined when popping empty deque', () => {
44
- expect(deque.popFront()).toBeUndefined();
45
- expect(deque.popBack()).toBeUndefined();
46
- });
47
- test('should return front and back elements without removing them', () => {
48
- deque.pushBack(1);
49
- deque.pushBack(2);
50
- expect(deque.front()).toBe(1);
51
- expect(deque.back()).toBe(2);
52
- expect(deque.size()).toBe(2);
53
- });
54
- test('should return undefined when checking front/back of empty deque', () => {
55
- expect(deque.front()).toBeUndefined();
56
- expect(deque.back()).toBeUndefined();
57
- });
58
- test('should clear all elements from deque', () => {
59
- deque.pushBack(1);
60
- deque.pushBack(2);
61
- deque.pushBack(3);
62
- deque.clear();
63
- expect(deque.isEmpty()).toBe(true);
64
- expect(deque.size()).toBe(0);
65
- });
66
- test('should correctly report size', () => {
67
- expect(deque.size()).toBe(0);
68
- deque.pushBack(1);
69
- expect(deque.size()).toBe(1);
70
- deque.pushFront(2);
71
- expect(deque.size()).toBe(2);
72
- deque.popBack();
73
- expect(deque.size()).toBe(1);
74
- deque.popFront();
75
- expect(deque.size()).toBe(0);
76
- });
77
- });
78
- //# sourceMappingURL=deque.test.js.map
package/dist/tests/deque.test.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"file":"deque.test.js","sourceRoot":"","sources":["../../tests/deque.test.ts"],"names":[],"mappings":";;AAAA,wCAAqC;AAErC,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;IACrB,IAAI,KAAoB,CAAC;IAEzB,UAAU,CAAC,GAAG,EAAE;QACd,KAAK,GAAG,IAAI,aAAK,EAAU,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACxC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;QACzC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACvE,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iEAAiE,EAAE,GAAG,EAAE;QAC3E,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;QACtC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,KAAK,CAAC,QAAQ,EAAE,CAAC;QACjB,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
package/dist/tests/hash-table.test.d.ts DELETED
@@ -1 +0,0 @@
1
- export {};
package/dist/tests/hash-table.test.js DELETED
@@ -1,94 +0,0 @@
1
- "use strict";
2
- Object.defineProperty(exports, "__esModule", { value: true });
3
- const hash_table_1 = require("../lib/hash-table");
4
- describe('HashTable', () => {
5
- let hashTable;
6
- beforeEach(() => {
7
- hashTable = new hash_table_1.HashTable();
8
- });
9
- test('should start empty', () => {
10
- expect(hashTable.isEmpty()).toBe(true);
11
- expect(hashTable.size()).toBe(0);
12
- });
13
- test('should insert and retrieve values', () => {
14
- hashTable.insert('one', 1);
15
- hashTable.insert('two', 2);
16
- hashTable.insert('three', 3);
17
- expect(hashTable.get('one')).toBe(1);
18
- expect(hashTable.get('two')).toBe(2);
19
- expect(hashTable.get('three')).toBe(3);
20
- expect(hashTable.size()).toBe(3);
21
- });
22
- test('should handle collisions', () => {
23
- // Force collisions by using a small capacity
24
- const smallTable = new hash_table_1.HashTable(2);
25
- smallTable.insert('a', 1);
26
- smallTable.insert('b', 2);
27
- smallTable.insert('c', 3);
28
- smallTable.insert('d', 4);
29
- expect(smallTable.get('a')).toBe(1);
30
- expect(smallTable.get('b')).toBe(2);
31
- expect(smallTable.get('c')).toBe(3);
32
- expect(smallTable.get('d')).toBe(4);
33
- });
34
- test('should update existing keys', () => {
35
- hashTable.insert('key', 1);
36
- expect(hashTable.get('key')).toBe(1);
37
- hashTable.insert('key', 2);
38
- expect(hashTable.get('key')).toBe(2);
39
- expect(hashTable.size()).toBe(1);
40
- });
41
- test('should remove elements', () => {
42
- hashTable.insert('one', 1);
43
- hashTable.insert('two', 2);
44
- expect(hashTable.remove('one')).toBe(true);
45
- expect(hashTable.get('one')).toBeUndefined();
46
- expect(hashTable.size()).toBe(1);
47
- expect(hashTable.remove('nonexistent')).toBe(false);
48
- });
49
- test('should clear the table', () => {
50
- hashTable.insert('one', 1);
51
- hashTable.insert('two', 2);
52
- hashTable.insert('three', 3);
53
- hashTable.clear();
54
- expect(hashTable.isEmpty()).toBe(true);
55
- expect(hashTable.size()).toBe(0);
56
- expect(hashTable.get('one')).toBeUndefined();
57
- });
58
- test('should handle different key types', () => {
59
- const mixedTable = new hash_table_1.HashTable();
60
- mixedTable.insert(42, 'number');
61
- mixedTable.insert(true, 'boolean');
62
- mixedTable.insert({ id: 1 }, 'object');
63
- mixedTable.insert([1, 2, 3], 'array');
64
- expect(mixedTable.get(42)).toBe('number');
65
- expect(mixedTable.get(true)).toBe('boolean');
66
- expect(mixedTable.get({ id: 1 })).toBe('object');
67
- expect(mixedTable.get([1, 2, 3])).toBe('array');
68
- });
69
- test('should handle keys with custom hashCode and equals methods', () => {
70
- class CustomKey {
71
- id;
72
- constructor(id) {
73
- this.id = id;
74
- }
75
- hashCode() {
76
- return this.id;
77
- }
78
- equals(other) {
79
- return this.id === other.id;
80
- }
81
- }
82
- const customTable = new hash_table_1.HashTable();
83
- const key1 = new CustomKey(1);
84
- const key2 = new CustomKey(2);
85
- const key1Duplicate = new CustomKey(1);
86
- customTable.insert(key1, 'first');
87
- customTable.insert(key2, 'second');
88
- expect(customTable.get(key1)).toBe('first');
89
- expect(customTable.get(key2)).toBe('second');
90
- expect(customTable.get(key1Duplicate)).toBe('first');
91
- expect(customTable.size()).toBe(2);
92
- });
93
- });
94
- //# sourceMappingURL=hash-table.test.js.map
package/dist/tests/hash-table.test.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"file":"hash-table.test.js","sourceRoot":"","sources":["../../tests/hash-table.test.ts"],"names":[],"mappings":";;AAAA,kDAA8C;AAE9C,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;IACzB,IAAI,SAAoC,CAAC;IAEzC,UAAU,CAAC,GAAG,EAAE;QACd,SAAS,GAAG,IAAI,sBAAS,EAAkB,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC9B,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC7C,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3B,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3B,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAE7B,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,6CAA6C;QAC7C,MAAM,UAAU,GAAG,IAAI,sBAAS,CAAiB,CAAC,CAAC,CAAC;QACpD,UAAU,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC1B,UAAU,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC1B,UAAU,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC1B,UAAU,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAE1B,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAErC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAClC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3B,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAE3B,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QAC7C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEjC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAClC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3B,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3B,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAE7B,SAAS,CAAC,KAAK,EAAE,CAAC;QAClB,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC7C,MAAM,UAAU,GAAG,IAAI,sBAAS,EAAe,CAAC;QAEhD,UAAU,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAChC,UAAU,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QACnC,UAAU,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QACvC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAEtC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7C,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACtE,MAAM,SAAS;YACO;YAApB,YAAoB,EAAU;gBAAV,OAAE,GAAF,EAAE,CAAQ;YAAG,CAAC;YAElC,QAAQ;gBACN,OAAO,IAAI,CAAC,EAAE,CAAC;YACjB,CAAC;YAED,MAAM,CAAC,KAAgB;gBACrB,OAAO,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC;YAC9B,CAAC;SACF;QAED,MAAM,WAAW,GAAG,IAAI,sBAAS,EAAqB,CAAC;QACvD,MAAM,IAAI,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,aAAa,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;QAEvC,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAClC,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAEnC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5C,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7C,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAErD,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
package/dist/tests/linked-list.test.d.ts DELETED
@@ -1 +0,0 @@
1
- export {};