typescript-ds-lib 0.2.5 → 0.2.7
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/lib/binary-search-tree.ts +218 -0
- package/lib/deque.ts +86 -0
- package/lib/hash-table.ts +179 -0
- package/lib/linked-list.ts +314 -0
- package/lib/map.ts +55 -0
- package/lib/matrix.ts +427 -0
- package/lib/priority-queue.ts +71 -0
- package/lib/queue.ts +62 -0
- package/lib/red-black-tree.ts +350 -0
- package/lib/set.ts +83 -0
- package/lib/stack.ts +59 -0
- package/package.json +7 -3
- package/types/index.ts +1 -0
- package/dist/tests/binary-search-tree.test.d.ts +0 -1
- package/dist/tests/binary-search-tree.test.js +0 -163
- package/dist/tests/binary-search-tree.test.js.map +0 -1
- package/dist/tests/deque.test.d.ts +0 -1
- package/dist/tests/deque.test.js +0 -78
- package/dist/tests/deque.test.js.map +0 -1
- package/dist/tests/hash-table.test.d.ts +0 -1
- package/dist/tests/hash-table.test.js +0 -94
- package/dist/tests/hash-table.test.js.map +0 -1
- package/dist/tests/linked-list.test.d.ts +0 -1
- package/dist/tests/linked-list.test.js +0 -344
- package/dist/tests/linked-list.test.js.map +0 -1
- package/dist/tests/map.test.d.ts +0 -1
- package/dist/tests/map.test.js +0 -176
- package/dist/tests/map.test.js.map +0 -1
- package/dist/tests/matrix.test.d.ts +0 -1
- package/dist/tests/matrix.test.js +0 -278
- package/dist/tests/matrix.test.js.map +0 -1
- package/dist/tests/priority-queue.test.d.ts +0 -1
- package/dist/tests/priority-queue.test.js +0 -118
- package/dist/tests/priority-queue.test.js.map +0 -1
- package/dist/tests/queue.test.d.ts +0 -1
- package/dist/tests/queue.test.js +0 -48
- package/dist/tests/queue.test.js.map +0 -1
- package/dist/tests/red-black-tree.test.d.ts +0 -1
- package/dist/tests/red-black-tree.test.js +0 -167
- package/dist/tests/red-black-tree.test.js.map +0 -1
- package/dist/tests/set.test.d.ts +0 -1
- package/dist/tests/set.test.js +0 -119
- package/dist/tests/set.test.js.map +0 -1
- package/dist/tests/stack.test.d.ts +0 -1
- package/dist/tests/stack.test.js +0 -57
- package/dist/tests/stack.test.js.map +0 -1
package/dist/tests/queue.test.js
DELETED
|
@@ -1,48 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const queue_1 = require("../lib/queue");
|
|
4
|
-
describe('Queue', () => {
|
|
5
|
-
let queue;
|
|
6
|
-
beforeEach(() => {
|
|
7
|
-
queue = new queue_1.Queue();
|
|
8
|
-
});
|
|
9
|
-
test('should create empty queue', () => {
|
|
10
|
-
expect(queue.isEmpty()).toBe(true);
|
|
11
|
-
expect(queue.size()).toBe(0);
|
|
12
|
-
});
|
|
13
|
-
test('should push elements to queue', () => {
|
|
14
|
-
queue.push(1);
|
|
15
|
-
queue.push(2);
|
|
16
|
-
expect(queue.size()).toBe(2);
|
|
17
|
-
expect(queue.front()).toBe(1);
|
|
18
|
-
});
|
|
19
|
-
test('should pop elements from queue', () => {
|
|
20
|
-
queue.push(1);
|
|
21
|
-
queue.push(2);
|
|
22
|
-
expect(queue.pop()).toBe(1);
|
|
23
|
-
expect(queue.size()).toBe(1);
|
|
24
|
-
expect(queue.pop()).toBe(2);
|
|
25
|
-
expect(queue.isEmpty()).toBe(true);
|
|
26
|
-
});
|
|
27
|
-
test('should return undefined when popping empty queue', () => {
|
|
28
|
-
expect(queue.pop()).toBeUndefined();
|
|
29
|
-
});
|
|
30
|
-
test('should return front element without removing it', () => {
|
|
31
|
-
queue.push(1);
|
|
32
|
-
queue.push(2);
|
|
33
|
-
expect(queue.front()).toBe(1);
|
|
34
|
-
expect(queue.size()).toBe(2);
|
|
35
|
-
});
|
|
36
|
-
test('should return undefined when checking front of empty queue', () => {
|
|
37
|
-
expect(queue.front()).toBeUndefined();
|
|
38
|
-
});
|
|
39
|
-
test('should clear all elements from queue', () => {
|
|
40
|
-
queue.push(1);
|
|
41
|
-
queue.push(2);
|
|
42
|
-
queue.push(3);
|
|
43
|
-
queue.clear();
|
|
44
|
-
expect(queue.isEmpty()).toBe(true);
|
|
45
|
-
expect(queue.size()).toBe(0);
|
|
46
|
-
});
|
|
47
|
-
});
|
|
48
|
-
//# sourceMappingURL=queue.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"queue.test.js","sourceRoot":"","sources":["../../tests/queue.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,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,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;IAChC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,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,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iDAAiD,EAAE,GAAG,EAAE;QAC3D,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,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,4DAA4D,EAAE,GAAG,EAAE;QACtE,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,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;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
export {};
|
|
@@ -1,167 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const red_black_tree_1 = require("../lib/red-black-tree");
|
|
4
|
-
describe('RedBlackTree', () => {
|
|
5
|
-
let tree;
|
|
6
|
-
beforeEach(() => {
|
|
7
|
-
tree = new red_black_tree_1.RedBlackTree();
|
|
8
|
-
});
|
|
9
|
-
describe('Initialization', () => {
|
|
10
|
-
test('should start empty', () => {
|
|
11
|
-
expect(tree.isEmpty()).toBe(true);
|
|
12
|
-
expect(tree.size()).toBe(0);
|
|
13
|
-
});
|
|
14
|
-
test('should initialize with custom comparator', () => {
|
|
15
|
-
const reverseTree = new red_black_tree_1.RedBlackTree((a, b) => b < a);
|
|
16
|
-
reverseTree.insert(1, 1);
|
|
17
|
-
reverseTree.insert(2, 2);
|
|
18
|
-
const values = [];
|
|
19
|
-
reverseTree.forEach((_, value) => values.push(value));
|
|
20
|
-
expect(values).toEqual([2, 1]);
|
|
21
|
-
});
|
|
22
|
-
});
|
|
23
|
-
describe('Insertion', () => {
|
|
24
|
-
test('should insert values correctly', () => {
|
|
25
|
-
tree.insert(5, 5);
|
|
26
|
-
tree.insert(3, 3);
|
|
27
|
-
tree.insert(7, 7);
|
|
28
|
-
expect(tree.isEmpty()).toBe(false);
|
|
29
|
-
expect(tree.size()).toBe(3);
|
|
30
|
-
expect(tree.find(5)).toBe(5);
|
|
31
|
-
expect(tree.find(3)).toBe(3);
|
|
32
|
-
expect(tree.find(7)).toBe(7);
|
|
33
|
-
expect(tree.find(1)).toBeUndefined();
|
|
34
|
-
});
|
|
35
|
-
test('should handle duplicate inserts', () => {
|
|
36
|
-
tree.insert(5, 1);
|
|
37
|
-
tree.insert(5, 2);
|
|
38
|
-
tree.insert(5, 3);
|
|
39
|
-
expect(tree.size()).toBe(1);
|
|
40
|
-
expect(tree.find(5)).toBe(3);
|
|
41
|
-
});
|
|
42
|
-
test('should handle large number of insertions', () => {
|
|
43
|
-
const values = Array.from({ length: 1000 }, (_, i) => i);
|
|
44
|
-
values.forEach(v => tree.insert(v, v));
|
|
45
|
-
expect(tree.size()).toBe(1000);
|
|
46
|
-
// Verify some random values
|
|
47
|
-
expect(tree.find(42)).toBe(42);
|
|
48
|
-
expect(tree.find(999)).toBe(999);
|
|
49
|
-
expect(tree.find(500)).toBe(500);
|
|
50
|
-
});
|
|
51
|
-
});
|
|
52
|
-
describe('Removal', () => {
|
|
53
|
-
test('should remove values correctly', () => {
|
|
54
|
-
tree.insert(5, 5);
|
|
55
|
-
tree.insert(3, 3);
|
|
56
|
-
tree.insert(7, 7);
|
|
57
|
-
tree.insert(1, 1);
|
|
58
|
-
tree.insert(9, 9);
|
|
59
|
-
expect(tree.size()).toBe(5);
|
|
60
|
-
tree.remove(3);
|
|
61
|
-
expect(tree.find(3)).toBeUndefined();
|
|
62
|
-
expect(tree.size()).toBe(4);
|
|
63
|
-
tree.remove(5);
|
|
64
|
-
expect(tree.find(5)).toBeUndefined();
|
|
65
|
-
expect(tree.size()).toBe(3);
|
|
66
|
-
});
|
|
67
|
-
test('should handle removing non-existent values', () => {
|
|
68
|
-
tree.insert(5, 5);
|
|
69
|
-
tree.insert(3, 3);
|
|
70
|
-
const initialSize = tree.size();
|
|
71
|
-
tree.remove(7);
|
|
72
|
-
expect(tree.size()).toBe(initialSize);
|
|
73
|
-
});
|
|
74
|
-
test('should handle removing root node', () => {
|
|
75
|
-
tree.insert(5, 5);
|
|
76
|
-
tree.insert(3, 3);
|
|
77
|
-
tree.insert(7, 7);
|
|
78
|
-
tree.remove(5);
|
|
79
|
-
expect(tree.find(5)).toBeUndefined();
|
|
80
|
-
expect(tree.size()).toBe(2);
|
|
81
|
-
expect(tree.find(3)).toBe(3);
|
|
82
|
-
expect(tree.find(7)).toBe(7);
|
|
83
|
-
});
|
|
84
|
-
test('should handle removing all nodes sequentially', () => {
|
|
85
|
-
[5, 3, 7, 1, 9].forEach(v => tree.insert(v, v));
|
|
86
|
-
[5, 3, 7, 1, 9].forEach(v => {
|
|
87
|
-
tree.remove(v);
|
|
88
|
-
expect(tree.find(v)).toBeUndefined();
|
|
89
|
-
});
|
|
90
|
-
expect(tree.isEmpty()).toBe(true);
|
|
91
|
-
});
|
|
92
|
-
});
|
|
93
|
-
describe('Clear operation', () => {
|
|
94
|
-
test('should clear all nodes', () => {
|
|
95
|
-
tree.insert(5, 5);
|
|
96
|
-
tree.insert(3, 3);
|
|
97
|
-
tree.insert(7, 7);
|
|
98
|
-
expect(tree.isEmpty()).toBe(false);
|
|
99
|
-
tree.clear();
|
|
100
|
-
expect(tree.isEmpty()).toBe(true);
|
|
101
|
-
expect(tree.size()).toBe(0);
|
|
102
|
-
});
|
|
103
|
-
test('should handle clear on empty tree', () => {
|
|
104
|
-
tree.clear();
|
|
105
|
-
expect(tree.isEmpty()).toBe(true);
|
|
106
|
-
expect(tree.size()).toBe(0);
|
|
107
|
-
});
|
|
108
|
-
});
|
|
109
|
-
describe('Size management', () => {
|
|
110
|
-
test('should maintain correct size after operations', () => {
|
|
111
|
-
expect(tree.size()).toBe(0);
|
|
112
|
-
tree.insert(1, 1);
|
|
113
|
-
expect(tree.size()).toBe(1);
|
|
114
|
-
tree.insert(2, 2);
|
|
115
|
-
tree.insert(3, 3);
|
|
116
|
-
expect(tree.size()).toBe(3);
|
|
117
|
-
tree.remove(2);
|
|
118
|
-
expect(tree.size()).toBe(2);
|
|
119
|
-
tree.clear();
|
|
120
|
-
expect(tree.size()).toBe(0);
|
|
121
|
-
});
|
|
122
|
-
test('should handle rapid insertions and deletions', () => {
|
|
123
|
-
for (let i = 0; i < 100; i++) {
|
|
124
|
-
tree.insert(i, i);
|
|
125
|
-
}
|
|
126
|
-
expect(tree.size()).toBe(100);
|
|
127
|
-
for (let i = 0; i < 50; i++) {
|
|
128
|
-
tree.remove(i);
|
|
129
|
-
}
|
|
130
|
-
expect(tree.size()).toBe(50);
|
|
131
|
-
for (let i = 0; i < 25; i++) {
|
|
132
|
-
tree.insert(i, i);
|
|
133
|
-
}
|
|
134
|
-
expect(tree.size()).toBe(75);
|
|
135
|
-
});
|
|
136
|
-
});
|
|
137
|
-
describe('Iteration', () => {
|
|
138
|
-
test('should iterate through values in order using forEach', () => {
|
|
139
|
-
tree.insert(5, 50);
|
|
140
|
-
tree.insert(3, 30);
|
|
141
|
-
tree.insert(7, 70);
|
|
142
|
-
tree.insert(1, 10);
|
|
143
|
-
tree.insert(9, 90);
|
|
144
|
-
const keys = [];
|
|
145
|
-
const values = [];
|
|
146
|
-
tree.forEach((key, value) => {
|
|
147
|
-
keys.push(key);
|
|
148
|
-
values.push(value);
|
|
149
|
-
});
|
|
150
|
-
expect(keys).toEqual([1, 3, 5, 7, 9]);
|
|
151
|
-
expect(values).toEqual([10, 30, 50, 70, 90]);
|
|
152
|
-
});
|
|
153
|
-
test('should handle forEach on empty tree', () => {
|
|
154
|
-
const values = [];
|
|
155
|
-
tree.forEach((_, value) => values.push(value));
|
|
156
|
-
expect(values).toEqual([]);
|
|
157
|
-
});
|
|
158
|
-
test('should maintain order after multiple operations', () => {
|
|
159
|
-
const nums = [5, 3, 7, 1, 9, 2, 8, 4, 6];
|
|
160
|
-
nums.forEach(n => tree.insert(n, n * 10));
|
|
161
|
-
const values = [];
|
|
162
|
-
tree.forEach((_, value) => values.push(value));
|
|
163
|
-
expect(values).toEqual([10, 20, 30, 40, 50, 60, 70, 80, 90]);
|
|
164
|
-
});
|
|
165
|
-
});
|
|
166
|
-
});
|
|
167
|
-
//# sourceMappingURL=red-black-tree.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"red-black-tree.test.js","sourceRoot":"","sources":["../../tests/red-black-tree.test.ts"],"names":[],"mappings":";;AAAA,0DAAqD;AAErD,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,IAAI,IAAkC,CAAC;IAEvC,UAAU,CAAC,GAAG,EAAE;QACd,IAAI,GAAG,IAAI,6BAAY,EAAkB,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC9B,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC9B,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0CAA0C,EAAE,GAAG,EAAE;YACpD,MAAM,WAAW,GAAG,IAAI,6BAAY,CAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtE,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzB,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzB,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACzB,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;YAC1C,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAElB,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iCAAiC,EAAE,GAAG,EAAE;YAC3C,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAElB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0CAA0C,EAAE,GAAG,EAAE;YACpD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAE/B,4BAA4B;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC/B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACvB,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;YAC1C,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAElB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAE5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YACrC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAE5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YACrC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACtD,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAElB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEf,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC5C,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAElB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YACrC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACzD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAEhD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YACvC,CAAC,CAAC,CAAC;YAEH,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC/B,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE;YAClC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAElB,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAEnC,IAAI,CAAC,KAAK,EAAE,CAAC;YAEb,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC7C,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC/B,IAAI,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACzD,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAE5B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAE5B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAE5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAE5B,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACzB,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAChE,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACnB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACnB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACnB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACnB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAEnB,MAAM,IAAI,GAAa,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAa,EAAE,CAAC;YAE5B,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;gBAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC,CAAC,CAAC;YAEH,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC/C,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC3D,MAAM,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAE1C,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
package/dist/tests/set.test.d.ts
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
export {};
|
package/dist/tests/set.test.js
DELETED
|
@@ -1,119 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const set_1 = require("../lib/set");
|
|
4
|
-
describe('Set', () => {
|
|
5
|
-
let set;
|
|
6
|
-
beforeEach(() => {
|
|
7
|
-
set = new set_1.Set();
|
|
8
|
-
});
|
|
9
|
-
describe('Initialization', () => {
|
|
10
|
-
test('should start empty', () => {
|
|
11
|
-
expect(set.isEmpty()).toBe(true);
|
|
12
|
-
expect(set.size()).toBe(0);
|
|
13
|
-
});
|
|
14
|
-
});
|
|
15
|
-
describe('Single Element Operations', () => {
|
|
16
|
-
test('should insert elements correctly', () => {
|
|
17
|
-
set.insert(1);
|
|
18
|
-
expect(set.size()).toBe(1);
|
|
19
|
-
expect(set.find(1)).toBe(true);
|
|
20
|
-
// Duplicate insertion should not increase size
|
|
21
|
-
set.insert(1);
|
|
22
|
-
expect(set.size()).toBe(1);
|
|
23
|
-
set.insert(2);
|
|
24
|
-
expect(set.size()).toBe(2);
|
|
25
|
-
expect(set.find(2)).toBe(true);
|
|
26
|
-
});
|
|
27
|
-
test('should remove elements correctly', () => {
|
|
28
|
-
set.insert(1);
|
|
29
|
-
set.insert(2);
|
|
30
|
-
set.insert(3);
|
|
31
|
-
set.remove(2);
|
|
32
|
-
expect(set.size()).toBe(2);
|
|
33
|
-
expect(set.find(2)).toBe(false);
|
|
34
|
-
expect(set.find(1)).toBe(true);
|
|
35
|
-
expect(set.find(3)).toBe(true);
|
|
36
|
-
// Removing non-existent element should not affect set
|
|
37
|
-
set.remove(4);
|
|
38
|
-
expect(set.size()).toBe(2);
|
|
39
|
-
});
|
|
40
|
-
test('should find elements correctly', () => {
|
|
41
|
-
// Empty set should not find any elements
|
|
42
|
-
expect(set.find(1)).toBe(false);
|
|
43
|
-
// Test finding elements after insertion
|
|
44
|
-
set.insert(1);
|
|
45
|
-
set.insert(2);
|
|
46
|
-
set.insert(3);
|
|
47
|
-
expect(set.find(1)).toBe(true);
|
|
48
|
-
expect(set.find(2)).toBe(true);
|
|
49
|
-
expect(set.find(3)).toBe(true);
|
|
50
|
-
expect(set.find(4)).toBe(false);
|
|
51
|
-
// Test finding after removal
|
|
52
|
-
set.remove(2);
|
|
53
|
-
expect(set.find(2)).toBe(false);
|
|
54
|
-
// Test finding after clear
|
|
55
|
-
set.clear();
|
|
56
|
-
expect(set.find(1)).toBe(false);
|
|
57
|
-
expect(set.find(2)).toBe(false);
|
|
58
|
-
expect(set.find(3)).toBe(false);
|
|
59
|
-
});
|
|
60
|
-
});
|
|
61
|
-
describe('Bulk Operations', () => {
|
|
62
|
-
test('should clear all elements', () => {
|
|
63
|
-
set.insert(1);
|
|
64
|
-
set.insert(2);
|
|
65
|
-
set.insert(3);
|
|
66
|
-
set.clear();
|
|
67
|
-
expect(set.isEmpty()).toBe(true);
|
|
68
|
-
expect(set.size()).toBe(0);
|
|
69
|
-
expect(set.find(1)).toBe(false);
|
|
70
|
-
});
|
|
71
|
-
test('should insert multiple elements with insertList', () => {
|
|
72
|
-
const elements = [1, 2, 3, 4, 5];
|
|
73
|
-
set.insertList(elements);
|
|
74
|
-
expect(set.size()).toBe(elements.length);
|
|
75
|
-
elements.forEach(el => {
|
|
76
|
-
expect(set.find(el)).toBe(true);
|
|
77
|
-
});
|
|
78
|
-
});
|
|
79
|
-
test('should handle duplicate elements in insertList', () => {
|
|
80
|
-
const elements = [1, 1, 2, 2, 3];
|
|
81
|
-
set.insertList(elements);
|
|
82
|
-
expect(set.size()).toBe(3); // Only unique elements should be inserted
|
|
83
|
-
expect(set.find(1)).toBe(true);
|
|
84
|
-
expect(set.find(2)).toBe(true);
|
|
85
|
-
expect(set.find(3)).toBe(true);
|
|
86
|
-
});
|
|
87
|
-
test('should handle empty array in insertList', () => {
|
|
88
|
-
set.insertList([]);
|
|
89
|
-
expect(set.isEmpty()).toBe(true);
|
|
90
|
-
expect(set.size()).toBe(0);
|
|
91
|
-
});
|
|
92
|
-
});
|
|
93
|
-
describe('Iteration', () => {
|
|
94
|
-
test('should iterate over elements with forEach', () => {
|
|
95
|
-
const elements = [1, 2, 3, 4, 5];
|
|
96
|
-
elements.forEach(el => set.insert(el));
|
|
97
|
-
const result = [];
|
|
98
|
-
set.forEach(value => result.push(value));
|
|
99
|
-
expect(result.length).toBe(elements.length);
|
|
100
|
-
expect(result.sort()).toEqual(elements.sort());
|
|
101
|
-
});
|
|
102
|
-
test('should handle forEach on empty set', () => {
|
|
103
|
-
const result = [];
|
|
104
|
-
set.forEach(value => result.push(value));
|
|
105
|
-
expect(result).toEqual([]);
|
|
106
|
-
});
|
|
107
|
-
});
|
|
108
|
-
describe('Type Support', () => {
|
|
109
|
-
test('should work with different data types', () => {
|
|
110
|
-
const stringSet = new set_1.Set();
|
|
111
|
-
stringSet.insert('hello');
|
|
112
|
-
stringSet.insert('world');
|
|
113
|
-
expect(stringSet.size()).toBe(2);
|
|
114
|
-
expect(stringSet.find('hello')).toBe(true);
|
|
115
|
-
expect(stringSet.find('nonexistent')).toBe(false);
|
|
116
|
-
});
|
|
117
|
-
});
|
|
118
|
-
});
|
|
119
|
-
//# sourceMappingURL=set.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"set.test.js","sourceRoot":"","sources":["../../tests/set.test.ts"],"names":[],"mappings":";;AAAA,oCAAiC;AAEjC,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;IACnB,IAAI,GAAgB,CAAC;IAErB,UAAU,CAAC,GAAG,EAAE;QACd,GAAG,GAAG,IAAI,SAAG,EAAU,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC9B,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC9B,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACzC,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC5C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAE/B,+CAA+C;YAC/C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAE3B,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,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,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,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;YAE/B,sDAAsD;YACtD,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;YAC1C,yCAAyC;YACzC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAEhC,wCAAwC;YACxC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,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;YAEhC,6BAA6B;YAC7B,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAEhC,2BAA2B;YAC3B,GAAG,CAAC,KAAK,EAAE,CAAC;YACZ,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,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC/B,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACrC,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,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC3D,MAAM,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACjC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAEzB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACzC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;gBACpB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gDAAgD,EAAE,GAAG,EAAE;YAC1D,MAAM,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACjC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAEzB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,0CAA0C;YACtE,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;QACjC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yCAAyC,EAAE,GAAG,EAAE;YACnD,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACzB,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACrD,MAAM,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACjC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAEvC,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAEzC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC5C,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC9C,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;YACjD,MAAM,SAAS,GAAG,IAAI,SAAG,EAAU,CAAC;YACpC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC1B,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAE1B,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
export {};
|
package/dist/tests/stack.test.js
DELETED
|
@@ -1,57 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const stack_1 = require("../lib/stack");
|
|
4
|
-
describe('Stack', () => {
|
|
5
|
-
let stack;
|
|
6
|
-
beforeEach(() => {
|
|
7
|
-
stack = new stack_1.Stack();
|
|
8
|
-
});
|
|
9
|
-
test('should create empty stack', () => {
|
|
10
|
-
expect(stack.isEmpty()).toBe(true);
|
|
11
|
-
expect(stack.size()).toBe(0);
|
|
12
|
-
});
|
|
13
|
-
test('should push elements to stack', () => {
|
|
14
|
-
stack.push(1);
|
|
15
|
-
stack.push(2);
|
|
16
|
-
expect(stack.size()).toBe(2);
|
|
17
|
-
expect(stack.top()).toBe(2);
|
|
18
|
-
});
|
|
19
|
-
test('should pop elements from stack', () => {
|
|
20
|
-
stack.push(1);
|
|
21
|
-
stack.push(2);
|
|
22
|
-
expect(stack.pop()).toBe(2);
|
|
23
|
-
expect(stack.size()).toBe(1);
|
|
24
|
-
expect(stack.pop()).toBe(1);
|
|
25
|
-
expect(stack.isEmpty()).toBe(true);
|
|
26
|
-
});
|
|
27
|
-
test('should return undefined when popping empty stack', () => {
|
|
28
|
-
expect(stack.pop()).toBeUndefined();
|
|
29
|
-
});
|
|
30
|
-
test('should return top element without removing it', () => {
|
|
31
|
-
stack.push(1);
|
|
32
|
-
stack.push(2);
|
|
33
|
-
expect(stack.top()).toBe(2);
|
|
34
|
-
expect(stack.size()).toBe(2);
|
|
35
|
-
});
|
|
36
|
-
test('should return undefined when checking top of empty stack', () => {
|
|
37
|
-
expect(stack.top()).toBeUndefined();
|
|
38
|
-
});
|
|
39
|
-
test('should clear all elements from stack', () => {
|
|
40
|
-
stack.push(1);
|
|
41
|
-
stack.push(2);
|
|
42
|
-
stack.push(3);
|
|
43
|
-
stack.clear();
|
|
44
|
-
expect(stack.isEmpty()).toBe(true);
|
|
45
|
-
expect(stack.size()).toBe(0);
|
|
46
|
-
});
|
|
47
|
-
test('should correctly report size', () => {
|
|
48
|
-
expect(stack.size()).toBe(0);
|
|
49
|
-
stack.push(1);
|
|
50
|
-
expect(stack.size()).toBe(1);
|
|
51
|
-
stack.push(2);
|
|
52
|
-
expect(stack.size()).toBe(2);
|
|
53
|
-
stack.pop();
|
|
54
|
-
expect(stack.size()).toBe(1);
|
|
55
|
-
});
|
|
56
|
-
});
|
|
57
|
-
//# sourceMappingURL=stack.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"stack.test.js","sourceRoot":"","sources":["../../tests/stack.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,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,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,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACzD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0DAA0D,EAAE,GAAG,EAAE;QACpE,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,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,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|