typescript-ds-lib 0.2.1 → 0.2.5
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 +6 -3
- 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/deque.js +11 -10
- package/dist/lib/deque.js.map +1 -1
- package/dist/lib/hash-table.js +33 -19
- package/dist/lib/hash-table.js.map +1 -1
- package/dist/lib/linked-list.d.ts +7 -0
- package/dist/lib/linked-list.js +111 -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 +17 -11
- package/dist/lib/matrix.js +134 -13
- 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/queue.d.ts +2 -26
- package/dist/lib/queue.js +8 -7
- package/dist/lib/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/dist/tests/binary-search-tree.test.js +148 -60
- package/dist/tests/binary-search-tree.test.js.map +1 -1
- package/dist/tests/linked-list.test.js +324 -81
- package/dist/tests/linked-list.test.js.map +1 -1
- package/dist/tests/map.test.js +161 -45
- package/dist/tests/map.test.js.map +1 -1
- package/dist/tests/matrix.test.js +90 -0
- package/dist/tests/matrix.test.js.map +1 -1
- package/dist/tests/priority-queue.test.js +59 -0
- package/dist/tests/priority-queue.test.js.map +1 -1
- package/dist/tests/red-black-tree.test.js +151 -58
- package/dist/tests/red-black-tree.test.js.map +1 -1
- package/dist/tests/set.test.js +104 -60
- package/dist/tests/set.test.js.map +1 -1
- package/package.json +1 -1
package/README.md
CHANGED
|
@@ -4,9 +4,12 @@
|
|
|
4
4
|
Native TypeScript data structure implementations without external dependencies.
|
|
5
5
|
Provides Comparator for custom types. Just pass your own comparator function to the constructor.
|
|
6
6
|
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
7
|
+
- Fully Tested
|
|
8
|
+
- Fast
|
|
9
|
+
- 0 Dependencies
|
|
10
|
+
- Lightweight
|
|
11
|
+
- Comes with Comparator (for custom types)
|
|
12
|
+
- `hashCode()` and `equals()` are supported
|
|
10
13
|
|
|
11
14
|
## Install
|
|
12
15
|
```
|
|
@@ -5,6 +5,7 @@ export interface BinarySearchTree<T> {
|
|
|
5
5
|
find(element: T): boolean;
|
|
6
6
|
min(): T | undefined;
|
|
7
7
|
max(): T | undefined;
|
|
8
|
+
forEach(callback: (element: T) => void, traversal?: 'inorder' | 'preorder' | 'postorder'): void;
|
|
8
9
|
isEmpty(): boolean;
|
|
9
10
|
clear(): void;
|
|
10
11
|
count(): number;
|
|
@@ -16,5 +17,8 @@ export declare class BinarySearchTree<T> implements BinarySearchTree<T> {
|
|
|
16
17
|
private removeNode;
|
|
17
18
|
private findMin;
|
|
18
19
|
private isEqual;
|
|
20
|
+
private inorderTraversal;
|
|
21
|
+
private preorderTraversal;
|
|
22
|
+
private postorderTraversal;
|
|
19
23
|
private countNodes;
|
|
20
24
|
}
|
|
@@ -133,6 +133,45 @@ class BinarySearchTree {
|
|
|
133
133
|
// Two values are equal if neither is less than the other
|
|
134
134
|
return !this.comparator(a, b) && !this.comparator(b, a);
|
|
135
135
|
}
|
|
136
|
+
/**
|
|
137
|
+
* Executes a callback function for each element in the BST in-order traversal
|
|
138
|
+
*/
|
|
139
|
+
forEach(callback, traversal = 'inorder') {
|
|
140
|
+
switch (traversal) {
|
|
141
|
+
case 'inorder':
|
|
142
|
+
this.inorderTraversal(this.root, callback);
|
|
143
|
+
break;
|
|
144
|
+
case 'preorder':
|
|
145
|
+
this.preorderTraversal(this.root, callback);
|
|
146
|
+
break;
|
|
147
|
+
case 'postorder':
|
|
148
|
+
this.postorderTraversal(this.root, callback);
|
|
149
|
+
break;
|
|
150
|
+
default:
|
|
151
|
+
this.inorderTraversal(this.root, callback);
|
|
152
|
+
}
|
|
153
|
+
}
|
|
154
|
+
inorderTraversal(node, callback) {
|
|
155
|
+
if (node === null)
|
|
156
|
+
return;
|
|
157
|
+
this.inorderTraversal(node.left, callback);
|
|
158
|
+
callback(node.value);
|
|
159
|
+
this.inorderTraversal(node.right, callback);
|
|
160
|
+
}
|
|
161
|
+
preorderTraversal(node, callback) {
|
|
162
|
+
if (node === null)
|
|
163
|
+
return;
|
|
164
|
+
callback(node.value);
|
|
165
|
+
this.preorderTraversal(node.left, callback);
|
|
166
|
+
this.preorderTraversal(node.right, callback);
|
|
167
|
+
}
|
|
168
|
+
postorderTraversal(node, callback) {
|
|
169
|
+
if (node === null)
|
|
170
|
+
return;
|
|
171
|
+
this.postorderTraversal(node.left, callback);
|
|
172
|
+
this.postorderTraversal(node.right, callback);
|
|
173
|
+
callback(node.value);
|
|
174
|
+
}
|
|
136
175
|
/**
|
|
137
176
|
* Returns true if the BST is empty, false otherwise
|
|
138
177
|
*/
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"binary-search-tree.js","sourceRoot":"","sources":["../../lib/binary-search-tree.ts"],"names":[],"mappings":";;;
|
|
1
|
+
{"version":3,"file":"binary-search-tree.js","sourceRoot":"","sources":["../../lib/binary-search-tree.ts"],"names":[],"mappings":";;;AAgBA,MAAM,QAAQ;IACZ,KAAK,CAAI;IACT,IAAI,CAAqB;IACzB,KAAK,CAAqB;IAE1B,YAAY,KAAQ;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;CACF;AAGD,MAAa,gBAAgB;IACnB,IAAI,CAAqB;IACzB,UAAU,CAAgB;IAElC,YAAY,aAA4B,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;QAC3D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,MAAM,OAAO,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,OAAO;QACT,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1C,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;oBAC1B,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;oBACvB,MAAM;gBACR,CAAC;gBACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;oBAC3B,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC;oBACxB,MAAM;gBACR,CAAC;gBACD,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,KAAQ;QACX,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1C,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,GAAG;QACD,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QACjC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,OAAO,CAAC,KAAK,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,GAAG;QACD,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QACjC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YAC9B,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;QAC1B,CAAC;QACD,OAAO,OAAO,CAAC,KAAK,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAChD,CAAC;IAEO,UAAU,CAAC,IAAwB,EAAE,KAAQ;QACnD,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC9C,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAChD,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,uBAAuB;YACvB,oBAAoB;YACpB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;gBAC9C,OAAO,IAAI,CAAC;YACd,CAAC;YACD,8BAA8B;YAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,KAAK,CAAC;YAC1C,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC;YAC1C,iCAAiC;YACjC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;YACxD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAEO,OAAO,CAAC,IAAiB;QAC/B,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,OAAO,CAAC,CAAI,EAAE,CAAI;QACxB,yDAAyD;QACzD,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,QAA8B,EAAE,YAAkD,SAAS;QACjG,QAAQ,SAAS,EAAE,CAAC;YAClB,KAAK,SAAS;gBACZ,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC3C,MAAM;YACR,KAAK,UAAU;gBACb,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC5C,MAAM;YACR,KAAK,WAAW;gBACd,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC7C,MAAM;YACR;gBACE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAEO,gBAAgB,CAAC,IAAwB,EAAE,QAA8B;QAC/E,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC3C,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAEO,iBAAiB,CAAC,IAAwB,EAAE,QAA8B;QAChF,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAEO,kBAAkB,CAAC,IAAwB,EAAE,QAA8B;QACjF,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC9C,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAEO,UAAU,CAAC,IAAwB;QACzC,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;QAC5B,OAAO,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtE,CAAC;CACF;AA5LD,4CA4LC"}
|
package/dist/lib/deque.js
CHANGED
|
@@ -1,64 +1,65 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
3
|
exports.Deque = void 0;
|
|
4
|
+
const linked_list_1 = require("./linked-list");
|
|
4
5
|
class Deque {
|
|
5
6
|
items;
|
|
6
7
|
constructor() {
|
|
7
|
-
this.items =
|
|
8
|
+
this.items = new linked_list_1.LinkedList();
|
|
8
9
|
}
|
|
9
10
|
/**
|
|
10
11
|
* Adds an element to the front of the deque
|
|
11
12
|
*/
|
|
12
13
|
pushFront(element) {
|
|
13
|
-
this.items.
|
|
14
|
+
this.items.pushFront(element);
|
|
14
15
|
}
|
|
15
16
|
/**
|
|
16
17
|
* Adds an element to the back of the deque
|
|
17
18
|
*/
|
|
18
19
|
pushBack(element) {
|
|
19
|
-
this.items.
|
|
20
|
+
this.items.pushBack(element);
|
|
20
21
|
}
|
|
21
22
|
/**
|
|
22
23
|
* Removes and returns the front element from the deque, or undefined if deque is empty
|
|
23
24
|
*/
|
|
24
25
|
popFront() {
|
|
25
|
-
return this.items.
|
|
26
|
+
return this.items.popFront();
|
|
26
27
|
}
|
|
27
28
|
/**
|
|
28
29
|
* Removes and returns the back element from the deque, or undefined if deque is empty
|
|
29
30
|
*/
|
|
30
31
|
popBack() {
|
|
31
|
-
return this.items.
|
|
32
|
+
return this.items.popBack();
|
|
32
33
|
}
|
|
33
34
|
/**
|
|
34
35
|
* Returns the front element without removing it, or undefined if deque is empty
|
|
35
36
|
*/
|
|
36
37
|
front() {
|
|
37
|
-
return this.items
|
|
38
|
+
return this.items.get(0);
|
|
38
39
|
}
|
|
39
40
|
/**
|
|
40
41
|
* Returns the back element without removing it, or undefined if deque is empty
|
|
41
42
|
*/
|
|
42
43
|
back() {
|
|
43
|
-
return this.items
|
|
44
|
+
return this.items.get(this.items.size() - 1);
|
|
44
45
|
}
|
|
45
46
|
/**
|
|
46
47
|
* Returns true if the deque is empty, false otherwise
|
|
47
48
|
*/
|
|
48
49
|
isEmpty() {
|
|
49
|
-
return this.items.
|
|
50
|
+
return this.items.isEmpty();
|
|
50
51
|
}
|
|
51
52
|
/**
|
|
52
53
|
* Returns the number of elements in the deque
|
|
53
54
|
*/
|
|
54
55
|
size() {
|
|
55
|
-
return this.items.
|
|
56
|
+
return this.items.size();
|
|
56
57
|
}
|
|
57
58
|
/**
|
|
58
59
|
* Removes all elements from the deque
|
|
59
60
|
*/
|
|
60
61
|
clear() {
|
|
61
|
-
this.items
|
|
62
|
+
this.items.clear();
|
|
62
63
|
}
|
|
63
64
|
}
|
|
64
65
|
exports.Deque = Deque;
|
package/dist/lib/deque.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"deque.js","sourceRoot":"","sources":["../../lib/deque.ts"],"names":[],"mappings":";;;
|
|
1
|
+
{"version":3,"file":"deque.js","sourceRoot":"","sources":["../../lib/deque.ts"],"names":[],"mappings":";;;AAAA,+CAA2C;AAgB3C,MAAa,KAAK;IACR,KAAK,CAAgB;IAE7B;QACE,IAAI,CAAC,KAAK,GAAG,IAAI,wBAAU,EAAK,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,OAAU;QAClB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,OAAU;QACjB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;CACF;AArED,sBAqEC"}
|
package/dist/lib/hash-table.js
CHANGED
|
@@ -25,26 +25,40 @@ class HashTable {
|
|
|
25
25
|
return key.hashCode();
|
|
26
26
|
}
|
|
27
27
|
let stringKey;
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
else if (key instanceof RegExp) {
|
|
28
|
+
switch (typeof key) {
|
|
29
|
+
case 'number':
|
|
30
|
+
// If the number is a safe integer, use Knuth's multiplicative method.
|
|
31
|
+
if (Number.isSafeInteger(key)) {
|
|
32
|
+
const knuthConstant = 2654435761;
|
|
33
|
+
return (Math.abs(key * knuthConstant) >>> 0) % this.capacity;
|
|
34
|
+
}
|
|
36
35
|
stringKey = key.toString();
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
36
|
+
break;
|
|
37
|
+
case 'object':
|
|
38
|
+
if (key === null) {
|
|
39
|
+
stringKey = 'null';
|
|
40
|
+
}
|
|
41
|
+
else if (typeof key.toString === 'function') {
|
|
42
|
+
stringKey = key.toString();
|
|
43
|
+
}
|
|
44
|
+
else {
|
|
45
|
+
stringKey = JSON.stringify(key);
|
|
46
|
+
}
|
|
47
|
+
break;
|
|
48
|
+
case 'string':
|
|
49
|
+
stringKey = key;
|
|
50
|
+
break;
|
|
51
|
+
case 'function':
|
|
52
|
+
stringKey = key.toString();
|
|
53
|
+
break;
|
|
54
|
+
case 'symbol':
|
|
55
|
+
stringKey = key.toString();
|
|
56
|
+
break;
|
|
57
|
+
case 'undefined':
|
|
58
|
+
stringKey = 'null';
|
|
59
|
+
break;
|
|
60
|
+
default:
|
|
61
|
+
stringKey = String(key);
|
|
48
62
|
}
|
|
49
63
|
let hash = 0;
|
|
50
64
|
// DJB2 hash algorithm
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../lib/hash-table.ts"],"names":[],"mappings":";;;AAUA,MAAM,QAAQ;IACZ,GAAG,CAAI;IACP,KAAK,CAAI;IACT,IAAI,CAAwB;IAE5B,YAAY,GAAM,EAAE,KAAQ;QAC1B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AAED,MAAa,SAAS;IACZ,KAAK,CAA+B;IACpC,KAAK,CAAS;IACL,QAAQ,CAAS;IAElC,YAAY,WAAmB,EAAE;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAEO,IAAI,CAAC,GAAM;QACjB,IAAI,OAAQ,GAAW,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;YAChD,OAAQ,GAAW,CAAC,QAAQ,EAAE,CAAC;QACjC,CAAC;
|
|
1
|
+
{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../lib/hash-table.ts"],"names":[],"mappings":";;;AAUA,MAAM,QAAQ;IACZ,GAAG,CAAI;IACP,KAAK,CAAI;IACT,IAAI,CAAwB;IAE5B,YAAY,GAAM,EAAE,KAAQ;QAC1B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AAED,MAAa,SAAS;IACZ,KAAK,CAA+B;IACpC,KAAK,CAAS;IACL,QAAQ,CAAS;IAElC,YAAY,WAAmB,EAAE;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAEO,IAAI,CAAC,GAAM;QACjB,IAAI,OAAQ,GAAW,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;YAChD,OAAQ,GAAW,CAAC,QAAQ,EAAE,CAAC;QACjC,CAAC;QAED,IAAI,SAAiB,CAAC;QACtB,QAAQ,OAAO,GAAG,EAAE,CAAC;YACnB,KAAK,QAAQ;gBACX,sEAAsE;gBACtE,IAAI,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC9B,MAAM,aAAa,GAAG,UAAU,CAAC;oBACjC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAC/D,CAAC;gBACD,SAAS,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;gBAC3B,MAAM;YACR,KAAK,QAAQ;gBACX,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;oBACjB,SAAS,GAAG,MAAM,CAAC;gBACrB,CAAC;qBAAM,IAAI,OAAQ,GAAW,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;oBACvD,SAAS,GAAI,GAAW,CAAC,QAAQ,EAAE,CAAC;gBACtC,CAAC;qBAAM,CAAC;oBACN,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBAClC,CAAC;gBACD,MAAM;YACR,KAAK,QAAQ;gBACX,SAAS,GAAG,GAAG,CAAC;gBAChB,MAAM;YACR,KAAK,UAAU;gBACb,SAAS,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;gBAC3B,MAAM;YACR,KAAK,QAAQ;gBACX,SAAS,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;gBAC3B,MAAM;YACR,KAAK,WAAW;gBACd,SAAS,GAAG,MAAM,CAAC;gBACnB,MAAM;YACR;gBACE,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,sBAAsB;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACtD,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,qCAAqC;QAC1D,CAAC;QACD,OAAO,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC9B,CAAC;IAED,MAAM,CAAC,GAAM,EAAE,KAAQ;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;YAC5B,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,OAAO;QACT,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,OAAO,OAAO,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrC,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC;gBACtB,OAAO;YACT,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBAClB,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;gBACvB,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,OAAO;YACT,CAAC;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,OAAO,OAAO,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrC,OAAO,OAAO,CAAC,KAAK,CAAC;YACvB,CAAC;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,IAAI,GAA0B,IAAI,CAAC;QACvC,OAAO,OAAO,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrC,IAAI,IAAI,EAAE,CAAC;oBACT,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBAC3B,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;gBACnC,CAAC;gBACD,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,GAAG,OAAO,CAAC;YACf,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,SAAS,CAAC,IAAO,EAAE,IAAO;QAChC,6DAA6D;QAC7D,IAAI,OAAQ,IAAY,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YAC/C,OAAQ,IAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;YAAE,OAAO,KAAK,CAAC;QAE/C,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YACzD,OAAO,IAAI,KAAK,IAAI,CAAC;QACvB,CAAC;QACD,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;QAC3C,CAAC;QACD,IAAI,IAAI,YAAY,MAAM,IAAI,IAAI,YAAY,MAAM,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC7C,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/C,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;gBAChC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7D,CAAC;QACD,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YACzD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,OAAO,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;gBAClC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,SAAS,CAAE,IAAY,CAAC,CAAC,CAAC,EAAG,IAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;CACF;AA5JD,8BA4JC"}
|
|
@@ -1,9 +1,16 @@
|
|
|
1
1
|
export interface LinkedList<T> {
|
|
2
2
|
pushBack(element: T): void;
|
|
3
3
|
pushFront(element: T): void;
|
|
4
|
+
popBack(): T | undefined;
|
|
5
|
+
popFront(): T | undefined;
|
|
6
|
+
front(): T | undefined;
|
|
7
|
+
back(): T | undefined;
|
|
4
8
|
insert(element: T, position: number): boolean;
|
|
9
|
+
insertBefore(element: T, condition: (element: T) => boolean): boolean;
|
|
10
|
+
insertAfter(element: T, condition: (element: T) => boolean): boolean;
|
|
5
11
|
removeIf(condition: (element: T) => boolean): boolean;
|
|
6
12
|
removeAt(position: number): T | undefined;
|
|
13
|
+
forEach(callback: (element: T) => void): void;
|
|
7
14
|
get(position: number): T | undefined;
|
|
8
15
|
isEmpty(): boolean;
|
|
9
16
|
size(): number;
|
package/dist/lib/linked-list.js
CHANGED
|
@@ -18,6 +18,18 @@ class LinkedList {
|
|
|
18
18
|
this.tail = null;
|
|
19
19
|
this.length = 0;
|
|
20
20
|
}
|
|
21
|
+
/**
|
|
22
|
+
* Returns the first element in the list without removing it, or undefined if list is empty
|
|
23
|
+
*/
|
|
24
|
+
front() {
|
|
25
|
+
return this.head?.value;
|
|
26
|
+
}
|
|
27
|
+
/**
|
|
28
|
+
* Returns the last element in the list without removing it, or undefined if list is empty
|
|
29
|
+
*/
|
|
30
|
+
back() {
|
|
31
|
+
return this.tail?.value;
|
|
32
|
+
}
|
|
21
33
|
/**
|
|
22
34
|
* Adds an element to the end of the list
|
|
23
35
|
*/
|
|
@@ -48,6 +60,45 @@ class LinkedList {
|
|
|
48
60
|
}
|
|
49
61
|
this.length++;
|
|
50
62
|
}
|
|
63
|
+
/**
|
|
64
|
+
* Removes and returns the last element from the list, or undefined if list is empty
|
|
65
|
+
*/
|
|
66
|
+
popBack() {
|
|
67
|
+
if (!this.head) {
|
|
68
|
+
return undefined;
|
|
69
|
+
}
|
|
70
|
+
if (this.length === 1) {
|
|
71
|
+
const value = this.head.value;
|
|
72
|
+
this.head = null;
|
|
73
|
+
this.tail = null;
|
|
74
|
+
this.length = 0;
|
|
75
|
+
return value;
|
|
76
|
+
}
|
|
77
|
+
let current = this.head;
|
|
78
|
+
while (current.next !== this.tail) {
|
|
79
|
+
current = current.next;
|
|
80
|
+
}
|
|
81
|
+
const value = this.tail.value;
|
|
82
|
+
current.next = null;
|
|
83
|
+
this.tail = current;
|
|
84
|
+
this.length--;
|
|
85
|
+
return value;
|
|
86
|
+
}
|
|
87
|
+
/**
|
|
88
|
+
* Removes and returns the first element from the list, or undefined if list is empty
|
|
89
|
+
*/
|
|
90
|
+
popFront() {
|
|
91
|
+
if (!this.head) {
|
|
92
|
+
return undefined;
|
|
93
|
+
}
|
|
94
|
+
const value = this.head.value;
|
|
95
|
+
this.head = this.head.next;
|
|
96
|
+
this.length--;
|
|
97
|
+
if (this.length === 0) {
|
|
98
|
+
this.tail = null;
|
|
99
|
+
}
|
|
100
|
+
return value;
|
|
101
|
+
}
|
|
51
102
|
/**
|
|
52
103
|
* Inserts an element at the specified position. Returns true if successful, false if position is invalid
|
|
53
104
|
*/
|
|
@@ -77,6 +128,50 @@ class LinkedList {
|
|
|
77
128
|
this.length++;
|
|
78
129
|
return true;
|
|
79
130
|
}
|
|
131
|
+
/**
|
|
132
|
+
* Inserts an element before the first element that satisfies the condition. Returns true if successful, false if no matching element found
|
|
133
|
+
*/
|
|
134
|
+
insertBefore(element, condition) {
|
|
135
|
+
if (!this.head) {
|
|
136
|
+
return false;
|
|
137
|
+
}
|
|
138
|
+
if (condition(this.head.value)) {
|
|
139
|
+
this.pushFront(element);
|
|
140
|
+
return true;
|
|
141
|
+
}
|
|
142
|
+
let current = this.head;
|
|
143
|
+
while (current.next !== null) {
|
|
144
|
+
if (condition(current.next.value)) {
|
|
145
|
+
const newNode = new Node(element);
|
|
146
|
+
newNode.next = current.next;
|
|
147
|
+
current.next = newNode;
|
|
148
|
+
this.length++;
|
|
149
|
+
return true;
|
|
150
|
+
}
|
|
151
|
+
current = current.next;
|
|
152
|
+
}
|
|
153
|
+
return false;
|
|
154
|
+
}
|
|
155
|
+
/**
|
|
156
|
+
* Inserts an element after the first element that satisfies the condition. Returns true if successful, false if no matching element found
|
|
157
|
+
*/
|
|
158
|
+
insertAfter(element, condition) {
|
|
159
|
+
let current = this.head;
|
|
160
|
+
while (current !== null) {
|
|
161
|
+
if (condition(current.value)) {
|
|
162
|
+
const newNode = new Node(element);
|
|
163
|
+
newNode.next = current.next;
|
|
164
|
+
current.next = newNode;
|
|
165
|
+
if (current === this.tail) {
|
|
166
|
+
this.tail = newNode;
|
|
167
|
+
}
|
|
168
|
+
this.length++;
|
|
169
|
+
return true;
|
|
170
|
+
}
|
|
171
|
+
current = current.next;
|
|
172
|
+
}
|
|
173
|
+
return false;
|
|
174
|
+
}
|
|
80
175
|
/**
|
|
81
176
|
* Removes the first element that satisfies the predicate. Returns true if an element was removed, false otherwise.
|
|
82
177
|
*/
|
|
@@ -132,6 +227,16 @@ class LinkedList {
|
|
|
132
227
|
this.length--;
|
|
133
228
|
return current.value;
|
|
134
229
|
}
|
|
230
|
+
/**
|
|
231
|
+
* Executes a provided function once for each element in the list
|
|
232
|
+
*/
|
|
233
|
+
forEach(callback) {
|
|
234
|
+
let current = this.head;
|
|
235
|
+
while (current !== null) {
|
|
236
|
+
callback(current.value);
|
|
237
|
+
current = current.next;
|
|
238
|
+
}
|
|
239
|
+
}
|
|
135
240
|
/**
|
|
136
241
|
* Returns the element at the specified position without removing it. Returns undefined if position is invalid
|
|
137
242
|
*/
|
|
@@ -139,6 +244,12 @@ class LinkedList {
|
|
|
139
244
|
if (position < 0 || position >= this.length) {
|
|
140
245
|
return undefined;
|
|
141
246
|
}
|
|
247
|
+
// Optimize for front element
|
|
248
|
+
if (position === 0)
|
|
249
|
+
return this.head.value;
|
|
250
|
+
// Optimize for back element
|
|
251
|
+
if (position === this.length - 1)
|
|
252
|
+
return this.tail.value;
|
|
142
253
|
let current = this.head;
|
|
143
254
|
let index = 0;
|
|
144
255
|
while (index < position) {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"linked-list.js","sourceRoot":"","sources":["../../lib/linked-list.ts"],"names":[],"mappings":";;;
|
|
1
|
+
{"version":3,"file":"linked-list.js","sourceRoot":"","sources":["../../lib/linked-list.ts"],"names":[],"mappings":";;;AAoBA,MAAM,IAAI;IACR,KAAK,CAAI;IACT,IAAI,CAAiB;IAErB,YAAY,KAAQ;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AAGD,MAAa,UAAU;IACb,IAAI,CAAiB;IACrB,IAAI,CAAiB;IACrB,MAAM,CAAS;IAEvB;QACE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,OAAU;QACjB,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,OAAO,CAAC;YAC1B,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,OAAU;QAClB,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACzB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;YAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAChB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YAClC,OAAO,GAAG,OAAO,CAAC,IAAK,CAAC;QAC1B,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAK,CAAC,KAAK,CAAC;QAC/B,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACpB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;QAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,OAAU,EAAE,QAAgB;QACjC,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,QAAQ,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YACvB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,IAAI,IAAI,GAAmB,IAAI,CAAC;QAChC,IAAI,KAAK,GAAW,CAAC,CAAC;QACtB,OAAO,KAAK,GAAG,QAAQ,EAAE,CAAC;YACxB,IAAI,GAAG,OAAO,CAAC;YACf,OAAO,GAAG,OAAQ,CAAC,IAAI,CAAC;YACxB,KAAK,EAAE,CAAC;QACV,CAAC;QACD,IAAK,CAAC,IAAI,GAAG,OAAO,CAAC;QACrB,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,OAAU,EAAE,SAAkC;QACzD,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC7B,IAAI,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBAClC,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;gBAClC,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBAC5B,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;gBACvB,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,OAAO,IAAI,CAAC;YACd,CAAC;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,OAAU,EAAE,SAAkC;QACxD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7B,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;gBAClC,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBAC5B,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;gBACvB,IAAI,OAAO,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;oBAC1B,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;gBACtB,CAAC;gBACD,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,OAAO,IAAI,CAAC;YACd,CAAC;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,SAAkC;QACzC,IAAI,OAAO,GAAmB,IAAI,CAAC,IAAI,CAAC;QACxC,IAAI,IAAI,GAAmB,IAAI,CAAC;QAChC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7B,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;oBAClB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBAC3B,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBAC3B,CAAC;gBACD,IAAI,OAAO,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;oBAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;gBACnB,CAAC;gBACD,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,GAAG,OAAO,CAAC;YACf,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,QAAgB;QACvB,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5C,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,OAAO,GAAmB,IAAI,CAAC,IAAI,CAAC;QACxC,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,IAAI,GAAG,OAAQ,CAAC,IAAI,CAAC;YAC1B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACnB,CAAC;YACD,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,OAAO,OAAQ,CAAC,KAAK,CAAC;QACxB,CAAC;QAED,IAAI,IAAI,GAAmB,IAAI,CAAC;QAChC,IAAI,KAAK,GAAW,CAAC,CAAC;QACtB,OAAO,KAAK,GAAG,QAAQ,EAAE,CAAC;YACxB,IAAI,GAAG,OAAO,CAAC;YACf,OAAO,GAAG,OAAQ,CAAC,IAAI,CAAC;YACxB,KAAK,EAAE,CAAC;QACV,CAAC;QACD,IAAK,CAAC,IAAI,GAAG,OAAQ,CAAC,IAAI,CAAC;QAC3B,IAAI,QAAQ,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,OAAQ,CAAC,KAAK,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,QAA8B;QACpC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACxB,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,QAAgB;QAClB,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5C,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,6BAA6B;QAC7B,IAAI,QAAQ,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,IAAK,CAAC,KAAK,CAAC;QAC5C,4BAA4B;QAC5B,IAAI,QAAQ,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,IAAK,CAAC,KAAK,CAAC;QAC1D,IAAI,OAAO,GAAmB,IAAI,CAAC,IAAI,CAAC;QACxC,IAAI,KAAK,GAAW,CAAC,CAAC;QACtB,OAAO,KAAK,GAAG,QAAQ,EAAE,CAAC;YACxB,OAAO,GAAG,OAAQ,CAAC,IAAI,CAAC;YACxB,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,OAAQ,CAAC,KAAK,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;CACF;AA1RD,gCA0RC"}
|
package/dist/lib/map.d.ts
CHANGED
package/dist/lib/map.js
CHANGED
|
@@ -16,6 +16,9 @@ class Map {
|
|
|
16
16
|
delete(key) {
|
|
17
17
|
this.rbTree.remove(key);
|
|
18
18
|
}
|
|
19
|
+
remove(key) {
|
|
20
|
+
this.rbTree.remove(key);
|
|
21
|
+
}
|
|
19
22
|
clear() {
|
|
20
23
|
this.rbTree.clear();
|
|
21
24
|
}
|
|
@@ -25,6 +28,9 @@ class Map {
|
|
|
25
28
|
isEmpty() {
|
|
26
29
|
return this.rbTree.isEmpty();
|
|
27
30
|
}
|
|
31
|
+
forEach(callback) {
|
|
32
|
+
this.rbTree.forEach(callback);
|
|
33
|
+
}
|
|
28
34
|
}
|
|
29
35
|
exports.Map = Map;
|
|
30
36
|
//# sourceMappingURL=map.js.map
|
package/dist/lib/map.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"map.js","sourceRoot":"","sources":["../../lib/map.ts"],"names":[],"mappings":";;;AACA,qDAAgD;
|
|
1
|
+
{"version":3,"file":"map.js","sourceRoot":"","sources":["../../lib/map.ts"],"names":[],"mappings":";;;AACA,qDAAgD;AAehD,MAAa,GAAG;IACN,MAAM,CAAqB;IAEnC,YAAY,aAA4B,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;QAC3D,IAAI,CAAC,MAAM,GAAG,IAAI,6BAAY,CAAO,UAAU,CAAC,CAAC;IACnD,CAAC;IAED,MAAM,CAAC,GAAM,EAAE,KAAQ;QACrB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,IAAI,CAAC,GAAM;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,CAAC,GAAM;QACX,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,MAAM,CAAC,GAAM;QACX,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,OAAO,CAAC,QAAoC;QAC1C,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;CACF;AAtCD,kBAsCC"}
|
package/dist/lib/matrix.d.ts
CHANGED
|
@@ -5,31 +5,37 @@ export interface Matrix<T> {
|
|
|
5
5
|
columns(): number;
|
|
6
6
|
fill(value: T): void;
|
|
7
7
|
clear(): void;
|
|
8
|
+
resize(rows: number, cols: number): void;
|
|
8
9
|
isEmpty(): boolean;
|
|
9
10
|
size(): number;
|
|
11
|
+
isSquare(): boolean;
|
|
12
|
+
isSymmetric(): boolean;
|
|
13
|
+
getRow(row: number): T[];
|
|
14
|
+
getColumn(col: number): T[];
|
|
15
|
+
setRow(row: number, values: T[]): void;
|
|
16
|
+
setColumn(col: number, values: T[]): void;
|
|
17
|
+
swapRows(row1: number, row2: number): void;
|
|
18
|
+
swapColumns(col1: number, col2: number): void;
|
|
10
19
|
transpose(): Matrix<T>;
|
|
11
20
|
add(other: Matrix<T>): Matrix<T>;
|
|
12
21
|
subtract(other: Matrix<T>): Matrix<T>;
|
|
13
22
|
multiply(other: Matrix<T>): Matrix<T>;
|
|
23
|
+
scalarMultiply(scalar: number): Matrix<T>;
|
|
14
24
|
map(fn: (value: T, row: number, col: number) => T): Matrix<T>;
|
|
15
25
|
forEach(fn: (value: T, row: number, col: number) => void): void;
|
|
16
26
|
clone(): Matrix<T>;
|
|
17
27
|
toArray(): T[][];
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
28
|
+
equals(other: Matrix<T>): boolean;
|
|
29
|
+
submatrix(startRow: number, startCol: number, endRow: number, endCol: number): Matrix<T>;
|
|
30
|
+
insertMatrix(other: Matrix<T>, startRow: number, startCol: number): void;
|
|
31
|
+
getDiagonal(): T[];
|
|
32
|
+
setDiagonal(values: T[]): void;
|
|
33
|
+
trace(): T;
|
|
23
34
|
}
|
|
24
|
-
/**
|
|
25
|
-
* A generic matrix implementation that supports basic matrix operations.
|
|
26
|
-
*/
|
|
27
35
|
export declare class Matrix<T> implements Matrix<T> {
|
|
28
36
|
private data;
|
|
29
37
|
private numRows;
|
|
30
38
|
private numCols;
|
|
31
|
-
/**
|
|
32
|
-
* Creates a new matrix with the specified dimensions.
|
|
33
|
-
*/
|
|
34
39
|
constructor(rows: number, cols: number);
|
|
40
|
+
private isValidPosition;
|
|
35
41
|
}
|