typescript-ds-lib 0.2.2 → 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.
- package/README.md +4 -2
- package/dist/lib/binary-search-tree.d.ts +4 -0
- package/dist/lib/binary-search-tree.js +39 -0
- package/dist/lib/binary-search-tree.js.map +1 -1
- package/dist/lib/hash-table.js +33 -29
- package/dist/lib/hash-table.js.map +1 -1
- package/dist/lib/linked-list.d.ts +5 -0
- package/dist/lib/linked-list.js +66 -0
- package/dist/lib/linked-list.js.map +1 -1
- package/dist/lib/map.d.ts +2 -0
- package/dist/lib/map.js +6 -0
- package/dist/lib/map.js.map +1 -1
- package/dist/lib/matrix.d.ts +16 -5
- package/dist/lib/matrix.js +126 -0
- package/dist/lib/matrix.js.map +1 -1
- package/dist/lib/priority-queue.d.ts +1 -1
- package/dist/lib/priority-queue.js +16 -20
- package/dist/lib/priority-queue.js.map +1 -1
- package/dist/lib/red-black-tree.d.ts +2 -0
- package/dist/lib/red-black-tree.js +10 -0
- package/dist/lib/red-black-tree.js.map +1 -1
- package/dist/lib/set.d.ts +2 -0
- package/dist/lib/set.js +14 -0
- package/dist/lib/set.js.map +1 -1
- package/package.json +1 -1
- package/dist/tests/binary-search-tree.test.d.ts +0 -1
- package/dist/tests/binary-search-tree.test.js +0 -118
- 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 -149
- 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 -60
- 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 -188
- 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 -59
- 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 -74
- 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 -75
- 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
|
@@ -1,149 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const linked_list_1 = require("../lib/linked-list");
|
|
4
|
-
describe('LinkedList', () => {
|
|
5
|
-
let list;
|
|
6
|
-
beforeEach(() => {
|
|
7
|
-
list = new linked_list_1.LinkedList();
|
|
8
|
-
});
|
|
9
|
-
test('should add elements to the end', () => {
|
|
10
|
-
list.pushBack(1);
|
|
11
|
-
list.pushBack(2);
|
|
12
|
-
list.pushBack(3);
|
|
13
|
-
expect(list.size()).toBe(3);
|
|
14
|
-
expect(list.get(0)).toBe(1);
|
|
15
|
-
expect(list.get(1)).toBe(2);
|
|
16
|
-
expect(list.get(2)).toBe(3);
|
|
17
|
-
});
|
|
18
|
-
test('should add elements to the front', () => {
|
|
19
|
-
list.pushFront(1);
|
|
20
|
-
list.pushFront(2);
|
|
21
|
-
list.pushFront(3);
|
|
22
|
-
expect(list.size()).toBe(3);
|
|
23
|
-
expect(list.get(0)).toBe(3);
|
|
24
|
-
expect(list.get(1)).toBe(2);
|
|
25
|
-
expect(list.get(2)).toBe(1);
|
|
26
|
-
});
|
|
27
|
-
test('should insert at valid positions', () => {
|
|
28
|
-
list.pushBack(1);
|
|
29
|
-
list.pushBack(3);
|
|
30
|
-
expect(list.insert(2, 1)).toBe(true);
|
|
31
|
-
expect(list.get(0)).toBe(1);
|
|
32
|
-
expect(list.get(1)).toBe(2);
|
|
33
|
-
expect(list.get(2)).toBe(3);
|
|
34
|
-
});
|
|
35
|
-
test('should return false for invalid positions', () => {
|
|
36
|
-
expect(list.insert(1, -1)).toBe(false);
|
|
37
|
-
expect(list.insert(1, 1)).toBe(false);
|
|
38
|
-
});
|
|
39
|
-
test('should remove elements that satisfy the condition', () => {
|
|
40
|
-
list.pushBack(1);
|
|
41
|
-
list.pushBack(2);
|
|
42
|
-
list.pushBack(3);
|
|
43
|
-
expect(list.removeIf(x => x === 2)).toBe(true);
|
|
44
|
-
expect(list.size()).toBe(2);
|
|
45
|
-
expect(list.get(0)).toBe(1);
|
|
46
|
-
expect(list.get(1)).toBe(3);
|
|
47
|
-
});
|
|
48
|
-
test('should return false if no element satisfies the condition', () => {
|
|
49
|
-
list.pushBack(1);
|
|
50
|
-
list.pushBack(2);
|
|
51
|
-
expect(list.removeIf(x => x === 3)).toBe(false);
|
|
52
|
-
expect(list.size()).toBe(2);
|
|
53
|
-
});
|
|
54
|
-
test('should remove elements at valid positions', () => {
|
|
55
|
-
list.pushBack(1);
|
|
56
|
-
list.pushBack(2);
|
|
57
|
-
list.pushBack(3);
|
|
58
|
-
expect(list.removeAt(1)).toBe(2);
|
|
59
|
-
expect(list.size()).toBe(2);
|
|
60
|
-
expect(list.get(0)).toBe(1);
|
|
61
|
-
expect(list.get(1)).toBe(3);
|
|
62
|
-
});
|
|
63
|
-
test('should return undefined for invalid positions', () => {
|
|
64
|
-
list.pushBack(1);
|
|
65
|
-
expect(list.removeAt(-1)).toBeUndefined();
|
|
66
|
-
expect(list.removeAt(1)).toBeUndefined();
|
|
67
|
-
});
|
|
68
|
-
test('should return elements at valid positions', () => {
|
|
69
|
-
list.pushBack(1);
|
|
70
|
-
list.pushBack(2);
|
|
71
|
-
expect(list.get(0)).toBe(1);
|
|
72
|
-
expect(list.get(1)).toBe(2);
|
|
73
|
-
});
|
|
74
|
-
test('should return undefined for invalid positions', () => {
|
|
75
|
-
list.pushBack(1);
|
|
76
|
-
expect(list.get(-1)).toBeUndefined();
|
|
77
|
-
expect(list.get(1)).toBeUndefined();
|
|
78
|
-
});
|
|
79
|
-
test('should return true for empty list', () => {
|
|
80
|
-
expect(list.isEmpty()).toBe(true);
|
|
81
|
-
});
|
|
82
|
-
test('should return false for non-empty list', () => {
|
|
83
|
-
list.pushBack(1);
|
|
84
|
-
expect(list.isEmpty()).toBe(false);
|
|
85
|
-
});
|
|
86
|
-
test('should return correct size', () => {
|
|
87
|
-
expect(list.size()).toBe(0);
|
|
88
|
-
list.pushBack(1);
|
|
89
|
-
expect(list.size()).toBe(1);
|
|
90
|
-
list.pushBack(2);
|
|
91
|
-
expect(list.size()).toBe(2);
|
|
92
|
-
});
|
|
93
|
-
test('should remove all elements', () => {
|
|
94
|
-
list.pushBack(1);
|
|
95
|
-
list.pushBack(2);
|
|
96
|
-
list.clear();
|
|
97
|
-
expect(list.isEmpty()).toBe(true);
|
|
98
|
-
expect(list.size()).toBe(0);
|
|
99
|
-
});
|
|
100
|
-
test('should pop elements from back', () => {
|
|
101
|
-
list.pushBack(1);
|
|
102
|
-
list.pushBack(2);
|
|
103
|
-
list.pushBack(3);
|
|
104
|
-
expect(list.popBack()).toBe(3);
|
|
105
|
-
expect(list.size()).toBe(2);
|
|
106
|
-
expect(list.popBack()).toBe(2);
|
|
107
|
-
expect(list.size()).toBe(1);
|
|
108
|
-
expect(list.popBack()).toBe(1);
|
|
109
|
-
expect(list.size()).toBe(0);
|
|
110
|
-
});
|
|
111
|
-
test('should return undefined when popping from empty list from back', () => {
|
|
112
|
-
expect(list.popBack()).toBeUndefined();
|
|
113
|
-
});
|
|
114
|
-
test('should pop elements from front', () => {
|
|
115
|
-
list.pushBack(1);
|
|
116
|
-
list.pushBack(2);
|
|
117
|
-
list.pushBack(3);
|
|
118
|
-
expect(list.popFront()).toBe(1);
|
|
119
|
-
expect(list.size()).toBe(2);
|
|
120
|
-
expect(list.popFront()).toBe(2);
|
|
121
|
-
expect(list.size()).toBe(1);
|
|
122
|
-
expect(list.popFront()).toBe(3);
|
|
123
|
-
expect(list.size()).toBe(0);
|
|
124
|
-
});
|
|
125
|
-
test('should return undefined when popping from empty list from front', () => {
|
|
126
|
-
expect(list.popFront()).toBeUndefined();
|
|
127
|
-
});
|
|
128
|
-
test('should handle mixed push and pop operations', () => {
|
|
129
|
-
list.pushBack(1);
|
|
130
|
-
list.pushFront(2);
|
|
131
|
-
expect(list.popBack()).toBe(1);
|
|
132
|
-
list.pushBack(3);
|
|
133
|
-
expect(list.popFront()).toBe(2);
|
|
134
|
-
expect(list.size()).toBe(1);
|
|
135
|
-
expect(list.get(0)).toBe(3);
|
|
136
|
-
});
|
|
137
|
-
test('should maintain correct order after multiple operations', () => {
|
|
138
|
-
list.pushBack(1);
|
|
139
|
-
list.pushFront(2);
|
|
140
|
-
list.pushBack(3);
|
|
141
|
-
list.pushFront(4);
|
|
142
|
-
expect(list.size()).toBe(4);
|
|
143
|
-
expect(list.get(0)).toBe(4);
|
|
144
|
-
expect(list.get(1)).toBe(2);
|
|
145
|
-
expect(list.get(2)).toBe(1);
|
|
146
|
-
expect(list.get(3)).toBe(3);
|
|
147
|
-
});
|
|
148
|
-
});
|
|
149
|
-
//# sourceMappingURL=linked-list.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"linked-list.test.js","sourceRoot":"","sources":["../../tests/linked-list.test.ts"],"names":[],"mappings":";;AAAA,oDAAgD;AAEhD,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;IAC1B,IAAI,IAAwB,CAAC;IAE7B,UAAU,CAAC,GAAG,EAAE;QACd,IAAI,GAAG,IAAI,wBAAU,EAAU,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC5C,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC5C,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC7D,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACrE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACrD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACzD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACrD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACzD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QACrC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAClD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gEAAgE,EAAE,GAAG,EAAE;QAC1E,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iEAAiE,EAAE,GAAG,EAAE;QAC3E,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACvD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACnE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
package/dist/tests/map.test.d.ts
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
export {};
|
package/dist/tests/map.test.js
DELETED
|
@@ -1,60 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const map_1 = require("../lib/map");
|
|
4
|
-
describe('Map', () => {
|
|
5
|
-
let map;
|
|
6
|
-
beforeEach(() => {
|
|
7
|
-
map = new map_1.Map();
|
|
8
|
-
});
|
|
9
|
-
test('should start empty', () => {
|
|
10
|
-
expect(map.isEmpty()).toBe(true);
|
|
11
|
-
expect(map.size()).toBe(0);
|
|
12
|
-
});
|
|
13
|
-
test('should insert and find key-value pairs correctly', () => {
|
|
14
|
-
map.insert('one', 1);
|
|
15
|
-
map.insert('two', 2);
|
|
16
|
-
map.insert('three', 3);
|
|
17
|
-
expect(map.isEmpty()).toBe(false);
|
|
18
|
-
expect(map.size()).toBe(3);
|
|
19
|
-
expect(map.find('one')).toBe(1);
|
|
20
|
-
expect(map.find('two')).toBe(2);
|
|
21
|
-
expect(map.find('three')).toBe(3);
|
|
22
|
-
expect(map.find('four')).toBeUndefined();
|
|
23
|
-
});
|
|
24
|
-
test('should handle duplicate keys by updating values', () => {
|
|
25
|
-
map.insert('test', 1);
|
|
26
|
-
map.insert('test', 2);
|
|
27
|
-
map.insert('test', 3);
|
|
28
|
-
expect(map.size()).toBe(1);
|
|
29
|
-
expect(map.find('test')).toBe(3);
|
|
30
|
-
});
|
|
31
|
-
test('should delete key-value pairs correctly', () => {
|
|
32
|
-
map.insert('one', 1);
|
|
33
|
-
map.insert('two', 2);
|
|
34
|
-
map.insert('three', 3);
|
|
35
|
-
expect(map.size()).toBe(3);
|
|
36
|
-
map.delete('two');
|
|
37
|
-
expect(map.find('two')).toBeUndefined();
|
|
38
|
-
expect(map.size()).toBe(2);
|
|
39
|
-
map.delete('one');
|
|
40
|
-
expect(map.find('one')).toBeUndefined();
|
|
41
|
-
expect(map.size()).toBe(1);
|
|
42
|
-
});
|
|
43
|
-
test('should handle deleting non-existent keys', () => {
|
|
44
|
-
map.insert('one', 1);
|
|
45
|
-
map.insert('two', 2);
|
|
46
|
-
const initialSize = map.size();
|
|
47
|
-
map.delete('three');
|
|
48
|
-
expect(map.size()).toBe(initialSize);
|
|
49
|
-
});
|
|
50
|
-
test('should clear all entries', () => {
|
|
51
|
-
map.insert('one', 1);
|
|
52
|
-
map.insert('two', 2);
|
|
53
|
-
map.insert('three', 3);
|
|
54
|
-
expect(map.isEmpty()).toBe(false);
|
|
55
|
-
map.clear();
|
|
56
|
-
expect(map.isEmpty()).toBe(true);
|
|
57
|
-
expect(map.size()).toBe(0);
|
|
58
|
-
});
|
|
59
|
-
});
|
|
60
|
-
//# sourceMappingURL=map.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"map.test.js","sourceRoot":"","sources":["../../tests/map.test.ts"],"names":[],"mappings":";;AAAA,oCAAiC;AAEjC,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;IACnB,IAAI,GAAwB,CAAC;IAE7B,UAAU,CAAC,GAAG,EAAE;QACd,GAAG,GAAG,IAAI,SAAG,EAAkB,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC9B,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC5D,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrB,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrB,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iDAAiD,EAAE,GAAG,EAAE;QAC3D,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACtB,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACtB,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAEtB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACnD,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrB,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrB,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAE3B,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAE3B,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACpD,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrB,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAErB,MAAM,WAAW,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QAC/B,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAEpB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrB,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrB,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAElC,GAAG,CAAC,KAAK,EAAE,CAAC;QAEZ,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
export {};
|
|
@@ -1,188 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const matrix_1 = require("../lib/matrix");
|
|
4
|
-
describe('Matrix', () => {
|
|
5
|
-
let matrix;
|
|
6
|
-
beforeEach(() => {
|
|
7
|
-
matrix = new matrix_1.Matrix(3, 3);
|
|
8
|
-
});
|
|
9
|
-
describe('constructor', () => {
|
|
10
|
-
it('should create an empty matrix of specified dimensions', () => {
|
|
11
|
-
expect(matrix.rows()).toBe(3);
|
|
12
|
-
expect(matrix.columns()).toBe(3);
|
|
13
|
-
expect(matrix.isEmpty()).toBe(false);
|
|
14
|
-
});
|
|
15
|
-
it('should create a matrix with zero dimensions', () => {
|
|
16
|
-
const emptyMatrix = new matrix_1.Matrix(0, 0);
|
|
17
|
-
expect(emptyMatrix.isEmpty()).toBe(true);
|
|
18
|
-
expect(emptyMatrix.size()).toBe(0);
|
|
19
|
-
});
|
|
20
|
-
});
|
|
21
|
-
describe('get/set operations', () => {
|
|
22
|
-
it('should set and get values correctly', () => {
|
|
23
|
-
matrix.set(0, 0, 1);
|
|
24
|
-
matrix.set(1, 1, 2);
|
|
25
|
-
matrix.set(2, 2, 3);
|
|
26
|
-
expect(matrix.get(0, 0)).toBe(1);
|
|
27
|
-
expect(matrix.get(1, 1)).toBe(2);
|
|
28
|
-
expect(matrix.get(2, 2)).toBe(3);
|
|
29
|
-
});
|
|
30
|
-
it('should return undefined for out of bounds access', () => {
|
|
31
|
-
expect(matrix.get(-1, 0)).toBeUndefined();
|
|
32
|
-
expect(matrix.get(0, -1)).toBeUndefined();
|
|
33
|
-
expect(matrix.get(3, 0)).toBeUndefined();
|
|
34
|
-
expect(matrix.get(0, 3)).toBeUndefined();
|
|
35
|
-
});
|
|
36
|
-
it('should ignore out of bounds set operations', () => {
|
|
37
|
-
matrix.set(-1, 0, 1);
|
|
38
|
-
matrix.set(0, -1, 1);
|
|
39
|
-
matrix.set(3, 0, 1);
|
|
40
|
-
matrix.set(0, 3, 1);
|
|
41
|
-
expect(matrix.toArray()).toEqual([
|
|
42
|
-
[undefined, undefined, undefined],
|
|
43
|
-
[undefined, undefined, undefined],
|
|
44
|
-
[undefined, undefined, undefined]
|
|
45
|
-
]);
|
|
46
|
-
});
|
|
47
|
-
});
|
|
48
|
-
describe('matrix operations', () => {
|
|
49
|
-
it('should fill matrix with a value', () => {
|
|
50
|
-
matrix.fill(5);
|
|
51
|
-
for (let i = 0; i < 3; i++) {
|
|
52
|
-
for (let j = 0; j < 3; j++) {
|
|
53
|
-
expect(matrix.get(i, j)).toBe(5);
|
|
54
|
-
}
|
|
55
|
-
}
|
|
56
|
-
});
|
|
57
|
-
it('should clear matrix', () => {
|
|
58
|
-
matrix.fill(5);
|
|
59
|
-
matrix.clear();
|
|
60
|
-
for (let i = 0; i < 3; i++) {
|
|
61
|
-
for (let j = 0; j < 3; j++) {
|
|
62
|
-
expect(matrix.get(i, j)).toBeUndefined();
|
|
63
|
-
}
|
|
64
|
-
}
|
|
65
|
-
});
|
|
66
|
-
it('should transpose matrix correctly', () => {
|
|
67
|
-
matrix.set(0, 1, 1);
|
|
68
|
-
matrix.set(1, 0, 2);
|
|
69
|
-
const transposed = matrix.transpose();
|
|
70
|
-
expect(transposed.get(1, 0)).toBe(1);
|
|
71
|
-
expect(transposed.get(0, 1)).toBe(2);
|
|
72
|
-
});
|
|
73
|
-
it('should add matrices correctly', () => {
|
|
74
|
-
const other = new matrix_1.Matrix(3, 3);
|
|
75
|
-
matrix.fill(1);
|
|
76
|
-
other.fill(2);
|
|
77
|
-
const result = matrix.add(other);
|
|
78
|
-
for (let i = 0; i < 3; i++) {
|
|
79
|
-
for (let j = 0; j < 3; j++) {
|
|
80
|
-
expect(result.get(i, j)).toBe(3);
|
|
81
|
-
}
|
|
82
|
-
}
|
|
83
|
-
});
|
|
84
|
-
it('should throw error when adding matrices of different dimensions', () => {
|
|
85
|
-
const other = new matrix_1.Matrix(2, 3);
|
|
86
|
-
matrix.fill(1);
|
|
87
|
-
other.fill(2);
|
|
88
|
-
expect(() => matrix.add(other)).toThrow('Matrix dimensions must match for addition');
|
|
89
|
-
});
|
|
90
|
-
it('should subtract matrices correctly', () => {
|
|
91
|
-
const other = new matrix_1.Matrix(3, 3);
|
|
92
|
-
matrix.fill(3);
|
|
93
|
-
other.fill(1);
|
|
94
|
-
const result = matrix.subtract(other);
|
|
95
|
-
for (let i = 0; i < 3; i++) {
|
|
96
|
-
for (let j = 0; j < 3; j++) {
|
|
97
|
-
expect(result.get(i, j)).toBe(2);
|
|
98
|
-
}
|
|
99
|
-
}
|
|
100
|
-
});
|
|
101
|
-
it('should throw error when subtracting matrices of different dimensions', () => {
|
|
102
|
-
const other = new matrix_1.Matrix(2, 3);
|
|
103
|
-
matrix.fill(1);
|
|
104
|
-
other.fill(2);
|
|
105
|
-
expect(() => matrix.subtract(other)).toThrow('Matrix dimensions must match for subtraction');
|
|
106
|
-
});
|
|
107
|
-
it('should multiply matrices correctly', () => {
|
|
108
|
-
const other = new matrix_1.Matrix(3, 3);
|
|
109
|
-
matrix.fill(2);
|
|
110
|
-
other.fill(3);
|
|
111
|
-
const result = matrix.multiply(other);
|
|
112
|
-
for (let i = 0; i < 3; i++) {
|
|
113
|
-
for (let j = 0; j < 3; j++) {
|
|
114
|
-
expect(result.get(i, j)).toBe(18); // 2 * 3 * 3 (dot product)
|
|
115
|
-
}
|
|
116
|
-
}
|
|
117
|
-
});
|
|
118
|
-
it('should throw error when multiplying incompatible matrices', () => {
|
|
119
|
-
const other = new matrix_1.Matrix(2, 3);
|
|
120
|
-
matrix.fill(1);
|
|
121
|
-
other.fill(2);
|
|
122
|
-
expect(() => matrix.multiply(other)).toThrow('Matrix dimensions must be compatible for multiplication');
|
|
123
|
-
});
|
|
124
|
-
});
|
|
125
|
-
describe('utility operations', () => {
|
|
126
|
-
it('should map values correctly', () => {
|
|
127
|
-
matrix.fill(1);
|
|
128
|
-
const result = matrix.map((value) => value * 2);
|
|
129
|
-
for (let i = 0; i < 3; i++) {
|
|
130
|
-
for (let j = 0; j < 3; j++) {
|
|
131
|
-
expect(result.get(i, j)).toBe(2);
|
|
132
|
-
}
|
|
133
|
-
}
|
|
134
|
-
});
|
|
135
|
-
it('should execute forEach correctly', () => {
|
|
136
|
-
matrix.fill(1);
|
|
137
|
-
let sum = 0;
|
|
138
|
-
matrix.forEach((value) => {
|
|
139
|
-
sum += value;
|
|
140
|
-
});
|
|
141
|
-
expect(sum).toBe(9);
|
|
142
|
-
});
|
|
143
|
-
it('should get/set rows correctly', () => {
|
|
144
|
-
matrix.setRow(0, [1, 2, 3]);
|
|
145
|
-
expect(matrix.getRow(0)).toEqual([1, 2, 3]);
|
|
146
|
-
});
|
|
147
|
-
it('should ignore invalid row operations', () => {
|
|
148
|
-
matrix.setRow(-1, [1, 2, 3]);
|
|
149
|
-
matrix.setRow(3, [1, 2, 3]);
|
|
150
|
-
matrix.setRow(0, [1, 2]); // Wrong length
|
|
151
|
-
expect(matrix.getRow(-1)).toEqual([]);
|
|
152
|
-
expect(matrix.getRow(3)).toEqual([]);
|
|
153
|
-
});
|
|
154
|
-
it('should get/set columns correctly', () => {
|
|
155
|
-
matrix.setColumn(0, [1, 2, 3]);
|
|
156
|
-
expect(matrix.getColumn(0)).toEqual([1, 2, 3]);
|
|
157
|
-
});
|
|
158
|
-
it('should ignore invalid column operations', () => {
|
|
159
|
-
matrix.setColumn(-1, [1, 2, 3]);
|
|
160
|
-
matrix.setColumn(3, [1, 2, 3]);
|
|
161
|
-
expect(matrix.getColumn(-1)).toEqual([]);
|
|
162
|
-
expect(matrix.getColumn(3)).toEqual([]);
|
|
163
|
-
});
|
|
164
|
-
it('should convert to array correctly', () => {
|
|
165
|
-
matrix.fill(1);
|
|
166
|
-
const arr = matrix.toArray();
|
|
167
|
-
expect(arr).toEqual([
|
|
168
|
-
[1, 1, 1],
|
|
169
|
-
[1, 1, 1],
|
|
170
|
-
[1, 1, 1]
|
|
171
|
-
]);
|
|
172
|
-
});
|
|
173
|
-
it('should clone matrix correctly', () => {
|
|
174
|
-
matrix.fill(1);
|
|
175
|
-
const clone = matrix.clone();
|
|
176
|
-
expect(clone.toArray()).toEqual(matrix.toArray());
|
|
177
|
-
// Verify deep copy
|
|
178
|
-
matrix.set(0, 0, 2);
|
|
179
|
-
expect(clone.get(0, 0)).toBe(1);
|
|
180
|
-
});
|
|
181
|
-
it('should calculate size correctly', () => {
|
|
182
|
-
expect(matrix.size()).toBe(9);
|
|
183
|
-
const matrix2 = new matrix_1.Matrix(2, 4);
|
|
184
|
-
expect(matrix2.size()).toBe(8);
|
|
185
|
-
});
|
|
186
|
-
});
|
|
187
|
-
});
|
|
188
|
-
//# sourceMappingURL=matrix.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"matrix.test.js","sourceRoot":"","sources":["../../tests/matrix.test.ts"],"names":[],"mappings":";;AAAA,0CAAuC;AAEvC,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;IACtB,IAAI,MAAsB,CAAC;IAE3B,UAAU,CAAC,GAAG,EAAE;QACd,MAAM,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC3B,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;YAC/D,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACrD,MAAM,WAAW,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC7C,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAEpB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;YAC1D,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YAC1C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YAC1C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACpD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;gBAC/B,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC;gBACjC,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC;gBACjC,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC;aAClC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QACjC,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,KAAK,EAAE,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;gBAC3C,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;YACtC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;YACzE,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC;QACvF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC5C,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;YAC9E,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,8CAA8C,CAAC,CAAC;QAC/F,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC5C,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,0BAA0B;gBAC/D,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;YACnE,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,yDAAyD,CAAC,CAAC;QAC1G,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACrC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;gBACvB,GAAG,IAAI,KAAK,CAAC;YACf,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC9C,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe;YACzC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC1C,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YACjD,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC3C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;gBAClB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACV,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;YAC7B,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;YAElD,mBAAmB;YACnB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,OAAO,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
export {};
|
|
@@ -1,59 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const priority_queue_1 = require("../lib/priority-queue");
|
|
4
|
-
describe('PriorityQueue', () => {
|
|
5
|
-
let pq;
|
|
6
|
-
beforeEach(() => {
|
|
7
|
-
pq = new priority_queue_1.PriorityQueue();
|
|
8
|
-
});
|
|
9
|
-
test('should create empty priority queue', () => {
|
|
10
|
-
expect(pq.isEmpty()).toBe(true);
|
|
11
|
-
expect(pq.size()).toBe(0);
|
|
12
|
-
});
|
|
13
|
-
test('should push elements with priority', () => {
|
|
14
|
-
pq.push('low', 1);
|
|
15
|
-
pq.push('high', 3);
|
|
16
|
-
pq.push('medium', 2);
|
|
17
|
-
expect(pq.size()).toBe(3);
|
|
18
|
-
expect(pq.front()).toBe('high');
|
|
19
|
-
});
|
|
20
|
-
test('should maintain priority order when pushing', () => {
|
|
21
|
-
pq.push('third', 1);
|
|
22
|
-
pq.push('first', 3);
|
|
23
|
-
pq.push('second', 2);
|
|
24
|
-
expect(pq.pop()).toBe('first');
|
|
25
|
-
expect(pq.pop()).toBe('second');
|
|
26
|
-
expect(pq.pop()).toBe('third');
|
|
27
|
-
});
|
|
28
|
-
test('should pop elements in priority order', () => {
|
|
29
|
-
pq.push('low', 1);
|
|
30
|
-
pq.push('high', 3);
|
|
31
|
-
pq.push('medium', 2);
|
|
32
|
-
expect(pq.pop()).toBe('high');
|
|
33
|
-
expect(pq.size()).toBe(2);
|
|
34
|
-
expect(pq.pop()).toBe('medium');
|
|
35
|
-
expect(pq.pop()).toBe('low');
|
|
36
|
-
expect(pq.isEmpty()).toBe(true);
|
|
37
|
-
});
|
|
38
|
-
test('should return undefined when popping empty queue', () => {
|
|
39
|
-
expect(pq.pop()).toBeUndefined();
|
|
40
|
-
});
|
|
41
|
-
test('should return front element without removing it', () => {
|
|
42
|
-
pq.push('low', 1);
|
|
43
|
-
pq.push('high', 3);
|
|
44
|
-
expect(pq.front()).toBe('high');
|
|
45
|
-
expect(pq.size()).toBe(2);
|
|
46
|
-
});
|
|
47
|
-
test('should return undefined when checking front of empty queue', () => {
|
|
48
|
-
expect(pq.front()).toBeUndefined();
|
|
49
|
-
});
|
|
50
|
-
test('should clear all elements from queue', () => {
|
|
51
|
-
pq.push('low', 1);
|
|
52
|
-
pq.push('high', 3);
|
|
53
|
-
pq.push('medium', 2);
|
|
54
|
-
pq.clear();
|
|
55
|
-
expect(pq.isEmpty()).toBe(true);
|
|
56
|
-
expect(pq.size()).toBe(0);
|
|
57
|
-
});
|
|
58
|
-
});
|
|
59
|
-
//# sourceMappingURL=priority-queue.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"priority-queue.test.js","sourceRoot":"","sources":["../../tests/priority-queue.test.ts"],"names":[],"mappings":";;AAAA,0DAAsD;AAEtD,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,IAAI,EAAyB,CAAC;IAE9B,UAAU,CAAC,GAAG,EAAE;QACd,EAAE,GAAG,IAAI,8BAAa,EAAU,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAClB,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACnB,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACvD,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACpB,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACpB,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAClB,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACnB,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iDAAiD,EAAE,GAAG,EAAE;QAC3D,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAClB,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACtE,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAClB,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACnB,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrB,EAAE,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
export {};
|
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,74 +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
|
-
test('should start empty', () => {
|
|
10
|
-
expect(tree.isEmpty()).toBe(true);
|
|
11
|
-
expect(tree.size()).toBe(0);
|
|
12
|
-
});
|
|
13
|
-
test('should insert values correctly', () => {
|
|
14
|
-
tree.insert(5, 5);
|
|
15
|
-
tree.insert(3, 3);
|
|
16
|
-
tree.insert(7, 7);
|
|
17
|
-
expect(tree.isEmpty()).toBe(false);
|
|
18
|
-
expect(tree.size()).toBe(3);
|
|
19
|
-
expect(tree.find(5)).toBe(5);
|
|
20
|
-
expect(tree.find(3)).toBe(3);
|
|
21
|
-
expect(tree.find(7)).toBe(7);
|
|
22
|
-
expect(tree.find(1)).toBeUndefined();
|
|
23
|
-
});
|
|
24
|
-
test('should handle duplicate inserts', () => {
|
|
25
|
-
tree.insert(5, 1);
|
|
26
|
-
tree.insert(5, 2);
|
|
27
|
-
tree.insert(5, 3);
|
|
28
|
-
expect(tree.size()).toBe(1);
|
|
29
|
-
expect(tree.find(5)).toBe(3);
|
|
30
|
-
});
|
|
31
|
-
test('should remove values correctly', () => {
|
|
32
|
-
tree.insert(5, 5);
|
|
33
|
-
tree.insert(3, 3);
|
|
34
|
-
tree.insert(7, 7);
|
|
35
|
-
tree.insert(1, 1);
|
|
36
|
-
tree.insert(9, 9);
|
|
37
|
-
expect(tree.size()).toBe(5);
|
|
38
|
-
tree.remove(3);
|
|
39
|
-
expect(tree.find(3)).toBeUndefined();
|
|
40
|
-
expect(tree.size()).toBe(4);
|
|
41
|
-
tree.remove(5);
|
|
42
|
-
expect(tree.find(5)).toBeUndefined();
|
|
43
|
-
expect(tree.size()).toBe(3);
|
|
44
|
-
});
|
|
45
|
-
test('should handle removing non-existent values', () => {
|
|
46
|
-
tree.insert(5, 5);
|
|
47
|
-
tree.insert(3, 3);
|
|
48
|
-
const initialSize = tree.size();
|
|
49
|
-
tree.remove(7);
|
|
50
|
-
expect(tree.size()).toBe(initialSize);
|
|
51
|
-
});
|
|
52
|
-
test('should clear all nodes', () => {
|
|
53
|
-
tree.insert(5, 5);
|
|
54
|
-
tree.insert(3, 3);
|
|
55
|
-
tree.insert(7, 7);
|
|
56
|
-
expect(tree.isEmpty()).toBe(false);
|
|
57
|
-
tree.clear();
|
|
58
|
-
expect(tree.isEmpty()).toBe(true);
|
|
59
|
-
expect(tree.size()).toBe(0);
|
|
60
|
-
});
|
|
61
|
-
test('should maintain correct size after operations', () => {
|
|
62
|
-
expect(tree.size()).toBe(0);
|
|
63
|
-
tree.insert(1, 1);
|
|
64
|
-
expect(tree.size()).toBe(1);
|
|
65
|
-
tree.insert(2, 2);
|
|
66
|
-
tree.insert(3, 3);
|
|
67
|
-
expect(tree.size()).toBe(3);
|
|
68
|
-
tree.remove(2);
|
|
69
|
-
expect(tree.size()).toBe(2);
|
|
70
|
-
tree.clear();
|
|
71
|
-
expect(tree.size()).toBe(0);
|
|
72
|
-
});
|
|
73
|
-
});
|
|
74
|
-
//# sourceMappingURL=red-black-tree.test.js.map
|