typescript-ds-lib 0.3.5 → 0.3.8
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 +12 -1
- package/dist/lib/binary-search-tree.d.ts +1 -2
- package/dist/lib/binary-search-tree.js +14 -14
- package/dist/lib/binary-search-tree.js.map +1 -1
- package/dist/lib/hash-table.js +8 -8
- package/dist/lib/hash-table.js.map +1 -1
- package/dist/lib/hash-utils.d.ts +7 -0
- package/dist/lib/{hash-table-utils.js → hash-utils.js} +37 -30
- package/dist/lib/hash-utils.js.map +1 -0
- package/dist/lib/set.d.ts +6 -5
- package/dist/lib/set.js +21 -23
- package/dist/lib/set.js.map +1 -1
- package/package.json +1 -1
- package/dist/lib/hash-table-utils.d.ts +0 -7
- package/dist/lib/hash-table-utils.js.map +0 -1
package/README.md
CHANGED
|
@@ -54,7 +54,18 @@ See the [documentation](https://github.com/baloian/typescript-ds-lib/blob/master
|
|
|
54
54
|
- Stack
|
|
55
55
|
- Graph (coming soon)
|
|
56
56
|
|
|
57
|
-
|
|
57
|
+
|
|
58
|
+
## `Map-Set` vs Native JavaScript `Map-Set`
|
|
59
|
+
The library's `Map` and `Set` data structures are implemented as Red-Black Tree and Binary Search Tree respectively.
|
|
60
|
+
Native JavaScript `Map` and `Set` are implemented as Hash Table and Hash Set respectively.
|
|
61
|
+
|
|
62
|
+
When to use the library's `Map` and `Set`?
|
|
63
|
+
- If CPU consumption is important for you as RBT and BST do not do any kind of CPU intensive hashing.
|
|
64
|
+
- If your goal is to have a balanced tree with O(log n) complexity for all the operations in Map.
|
|
65
|
+
- If memory efficiency is important for you as RBT and BST are more memory efficient than Hash Table and HashSet.
|
|
66
|
+
|
|
67
|
+
You can consider the library's `Map` and `Set` as ordered map and set, and native JavaScript `Map` and `Set` as unordered map and set.
|
|
68
|
+
|
|
58
69
|
|
|
59
70
|
## Contributions
|
|
60
71
|
Contributions are welcome and can be made by submitting GitHub pull requests
|
|
@@ -7,11 +7,11 @@ export interface BinarySearchTree<T> {
|
|
|
7
7
|
min(): T | undefined;
|
|
8
8
|
max(): T | undefined;
|
|
9
9
|
forEach(callback: (element: T) => void, traversal?: 'inorder' | 'preorder' | 'postorder'): void;
|
|
10
|
-
count(): number;
|
|
11
10
|
}
|
|
12
11
|
export declare class BinarySearchTree<T> extends BaseCollection<T> implements BinarySearchTree<T> {
|
|
13
12
|
private root;
|
|
14
13
|
private comparator;
|
|
14
|
+
private nodeCount;
|
|
15
15
|
constructor(comparator?: Comparator<T>);
|
|
16
16
|
private removeNode;
|
|
17
17
|
private findMin;
|
|
@@ -31,5 +31,4 @@ export declare class BinarySearchTree<T> extends BaseCollection<T> implements Bi
|
|
|
31
31
|
* Returns the number of nodes in the BST.
|
|
32
32
|
*/
|
|
33
33
|
size(): number;
|
|
34
|
-
private countNodes;
|
|
35
34
|
}
|
|
@@ -15,25 +15,33 @@ class TreeNode {
|
|
|
15
15
|
class BinarySearchTree extends base_collection_1.BaseCollection {
|
|
16
16
|
root;
|
|
17
17
|
comparator;
|
|
18
|
+
nodeCount;
|
|
18
19
|
constructor(comparator = (a, b) => a < b) {
|
|
19
20
|
super();
|
|
20
21
|
this.root = null;
|
|
21
22
|
this.comparator = comparator;
|
|
23
|
+
this.nodeCount = 0;
|
|
22
24
|
}
|
|
23
25
|
/**
|
|
24
|
-
* Inserts a value into the BST
|
|
26
|
+
* Inserts a value into the BST if it doesn't already exist
|
|
25
27
|
*/
|
|
26
28
|
insert(value) {
|
|
27
29
|
const newNode = new TreeNode(value);
|
|
28
30
|
if (!this.root) {
|
|
29
31
|
this.root = newNode;
|
|
32
|
+
this.nodeCount++;
|
|
30
33
|
return;
|
|
31
34
|
}
|
|
32
35
|
let current = this.root;
|
|
33
36
|
while (true) {
|
|
37
|
+
if (this.isEqual(value, current.value)) {
|
|
38
|
+
// Value already exists, don't insert
|
|
39
|
+
return;
|
|
40
|
+
}
|
|
34
41
|
if (this.comparator(value, current.value)) {
|
|
35
42
|
if (current.left === null) {
|
|
36
43
|
current.left = newNode;
|
|
44
|
+
this.nodeCount++;
|
|
37
45
|
break;
|
|
38
46
|
}
|
|
39
47
|
current = current.left;
|
|
@@ -41,6 +49,7 @@ class BinarySearchTree extends base_collection_1.BaseCollection {
|
|
|
41
49
|
else {
|
|
42
50
|
if (current.right === null) {
|
|
43
51
|
current.right = newNode;
|
|
52
|
+
this.nodeCount++;
|
|
44
53
|
break;
|
|
45
54
|
}
|
|
46
55
|
current = current.right;
|
|
@@ -108,6 +117,7 @@ class BinarySearchTree extends base_collection_1.BaseCollection {
|
|
|
108
117
|
}
|
|
109
118
|
else {
|
|
110
119
|
// Node to delete found
|
|
120
|
+
this.nodeCount--;
|
|
111
121
|
// Case 1: Leaf node
|
|
112
122
|
if (node.left === null && node.right === null) {
|
|
113
123
|
return null;
|
|
@@ -121,6 +131,7 @@ class BinarySearchTree extends base_collection_1.BaseCollection {
|
|
|
121
131
|
const minNode = this.findMin(node.right);
|
|
122
132
|
node.value = minNode.value;
|
|
123
133
|
node.right = this.removeNode(node.right, minNode.value);
|
|
134
|
+
this.nodeCount++; // Increment back since the recursive call decremented
|
|
124
135
|
return node;
|
|
125
136
|
}
|
|
126
137
|
}
|
|
@@ -185,24 +196,13 @@ class BinarySearchTree extends base_collection_1.BaseCollection {
|
|
|
185
196
|
*/
|
|
186
197
|
clear() {
|
|
187
198
|
this.root = null;
|
|
199
|
+
this.nodeCount = 0;
|
|
188
200
|
}
|
|
189
201
|
/**
|
|
190
202
|
* Returns the number of nodes in the BST.
|
|
191
203
|
*/
|
|
192
204
|
size() {
|
|
193
|
-
return this.
|
|
194
|
-
}
|
|
195
|
-
/**
|
|
196
|
-
* Returns the number of nodes in the BST.
|
|
197
|
-
* TODO: I should remove this method and use size() instead.
|
|
198
|
-
*/
|
|
199
|
-
count() {
|
|
200
|
-
return this.countNodes(this.root);
|
|
201
|
-
}
|
|
202
|
-
countNodes(node) {
|
|
203
|
-
if (node === null)
|
|
204
|
-
return 0;
|
|
205
|
-
return 1 + this.countNodes(node.left) + this.countNodes(node.right);
|
|
205
|
+
return this.nodeCount;
|
|
206
206
|
}
|
|
207
207
|
}
|
|
208
208
|
exports.BinarySearchTree = BinarySearchTree;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"binary-search-tree.js","sourceRoot":"","sources":["../../lib/binary-search-tree.ts"],"names":[],"mappings":";;;AACA,uDAAmD;
|
|
1
|
+
{"version":3,"file":"binary-search-tree.js","sourceRoot":"","sources":["../../lib/binary-search-tree.ts"],"names":[],"mappings":";;;AACA,uDAAmD;AAanD,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,gBAAoB,SAAQ,gCAAiB;IAChD,IAAI,CAAqB;IACzB,UAAU,CAAgB;IAC1B,SAAS,CAAS;IAE1B,YAAY,aAA4B,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;QAC3D,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,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,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,OAAO;QACT,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvC,qCAAqC;gBACrC,OAAO;YACT,CAAC;YACD,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,IAAI,CAAC,SAAS,EAAE,CAAC;oBACjB,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,IAAI,CAAC,SAAS,EAAE,CAAC;oBACjB,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,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,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,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,sDAAsD;YACxE,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;QACjB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;CACF;AApMD,4CAoMC"}
|
package/dist/lib/hash-table.js
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
3
|
exports.HashTable = void 0;
|
|
4
|
-
const
|
|
4
|
+
const hash_utils_1 = require("./hash-utils");
|
|
5
5
|
const base_collection_1 = require("./base-collection");
|
|
6
6
|
class HashNode {
|
|
7
7
|
key;
|
|
@@ -25,7 +25,7 @@ class HashTable extends base_collection_1.BaseCollection {
|
|
|
25
25
|
this.count = 0;
|
|
26
26
|
}
|
|
27
27
|
insert(key, value) {
|
|
28
|
-
const index =
|
|
28
|
+
const index = hash_utils_1.HashUtils.hash(key, this.capacity);
|
|
29
29
|
// Handle empty bucket case.
|
|
30
30
|
if (!this.table[index]) {
|
|
31
31
|
this.table[index] = new HashNode(key, value);
|
|
@@ -33,14 +33,14 @@ class HashTable extends base_collection_1.BaseCollection {
|
|
|
33
33
|
return;
|
|
34
34
|
}
|
|
35
35
|
// Check first node for key match. If it matches, update the value.
|
|
36
|
-
if (
|
|
36
|
+
if (hash_utils_1.HashUtils.equals(this.table[index].key, key)) {
|
|
37
37
|
this.table[index].value = value;
|
|
38
38
|
return;
|
|
39
39
|
}
|
|
40
40
|
// Traverse chain to find key or last node. If it matches, update the value.
|
|
41
41
|
let current = this.table[index];
|
|
42
42
|
while (current?.next) {
|
|
43
|
-
if (
|
|
43
|
+
if (hash_utils_1.HashUtils.equals(current.next.key, key)) {
|
|
44
44
|
current.next.value = value;
|
|
45
45
|
return;
|
|
46
46
|
}
|
|
@@ -51,10 +51,10 @@ class HashTable extends base_collection_1.BaseCollection {
|
|
|
51
51
|
this.count++;
|
|
52
52
|
}
|
|
53
53
|
get(key) {
|
|
54
|
-
const index =
|
|
54
|
+
const index = hash_utils_1.HashUtils.hash(key, this.capacity);
|
|
55
55
|
let current = this.table[index];
|
|
56
56
|
while (current) {
|
|
57
|
-
if (
|
|
57
|
+
if (hash_utils_1.HashUtils.equals(current.key, key)) {
|
|
58
58
|
return current.value;
|
|
59
59
|
}
|
|
60
60
|
current = current.next;
|
|
@@ -62,11 +62,11 @@ class HashTable extends base_collection_1.BaseCollection {
|
|
|
62
62
|
return undefined;
|
|
63
63
|
}
|
|
64
64
|
remove(key) {
|
|
65
|
-
const index =
|
|
65
|
+
const index = hash_utils_1.HashUtils.hash(key, this.capacity);
|
|
66
66
|
let current = this.table[index];
|
|
67
67
|
let prev = null;
|
|
68
68
|
while (current) {
|
|
69
|
-
if (
|
|
69
|
+
if (hash_utils_1.HashUtils.equals(current.key, key)) {
|
|
70
70
|
if (prev) {
|
|
71
71
|
prev.next = current.next;
|
|
72
72
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../lib/hash-table.ts"],"names":[],"mappings":";;;AAAA,
|
|
1
|
+
{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../lib/hash-table.ts"],"names":[],"mappings":";;;AAAA,6CAAyC;AACzC,uDAAmD;AAWnD,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;AAGD,MAAa,SAAgB,SAAQ,gCAAiB;IAC5C,KAAK,CAA+B;IACpC,KAAK,CAAS;IACL,QAAQ,CAAS;IAElC,YAAY,WAAmB,IAAI;QACjC,KAAK,EAAE,CAAC;QACR,6DAA6D;QAC7D,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC;QAChD,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;IAED,MAAM,CAAC,GAAM,EAAE,KAAQ;QACrB,MAAM,KAAK,GAAW,sBAAS,CAAC,IAAI,CAAI,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5D,4BAA4B;QAC5B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,QAAQ,CAAO,GAAG,EAAE,KAAK,CAAC,CAAC;YACnD,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,OAAO;QACT,CAAC;QACD,mEAAmE;QACnE,IAAI,sBAAS,CAAC,MAAM,CAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YACrD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC,KAAK,GAAG,KAAK,CAAC;YACjC,OAAO;QACT,CAAC;QACD,4EAA4E;QAC5E,IAAI,OAAO,GAA0B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACvD,OAAO,OAAO,EAAE,IAAI,EAAE,CAAC;YACrB,IAAI,sBAAS,CAAC,MAAM,CAAI,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC/C,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;gBAC3B,OAAO;YACT,CAAC;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,kCAAkC;QAClC,OAAO,CAAC,IAAI,GAAG,IAAI,QAAQ,CAAO,GAAG,EAAE,KAAK,CAAC,CAAC;QAC9C,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,KAAK,GAAW,sBAAS,CAAC,IAAI,CAAI,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,OAAO,GAA0B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACvD,OAAO,OAAO,EAAE,CAAC;YACf,IAAI,sBAAS,CAAC,MAAM,CAAI,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC1C,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,GAAW,sBAAS,CAAC,IAAI,CAAI,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,OAAO,GAA0B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACvD,IAAI,IAAI,GAA0B,IAAI,CAAC;QACvC,OAAO,OAAO,EAAE,CAAC;YACf,IAAI,sBAAS,CAAC,MAAM,CAAI,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC1C,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;IAED,OAAO,CAAC,QAAoC;QAC1C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,OAAO,GAA0B,IAAI,CAAC;YAC1C,OAAO,OAAO,EAAE,CAAC;gBACf,QAAQ,CAAC,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;gBACrC,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACzB,CAAC;QACH,CAAC;IACH,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;AA9FD,8BA8FC"}
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
exports.
|
|
4
|
-
class
|
|
3
|
+
exports.HashUtils = void 0;
|
|
4
|
+
class HashUtils {
|
|
5
5
|
static valueToString(value) {
|
|
6
6
|
if (value === null || value === undefined)
|
|
7
7
|
return 'null';
|
|
@@ -48,7 +48,7 @@ class HashTableUtils {
|
|
|
48
48
|
* DJB2a (variant using xor rather than +) hash algorithm.
|
|
49
49
|
* See: http://www.cse.yorku.ca/~oz/hash.html
|
|
50
50
|
*/
|
|
51
|
-
static
|
|
51
|
+
static djb2aHash(str) {
|
|
52
52
|
let hash = 5381;
|
|
53
53
|
for (let i = 0; i < str.length; i++) {
|
|
54
54
|
hash = ((hash << 5) + hash) ^ str.charCodeAt(i);
|
|
@@ -61,48 +61,55 @@ class HashTableUtils {
|
|
|
61
61
|
return key.hashCode();
|
|
62
62
|
}
|
|
63
63
|
if (typeof key === 'number' && Number.isSafeInteger(key)) {
|
|
64
|
-
return
|
|
64
|
+
return HashUtils.wangHash32(key) % capacity;
|
|
65
65
|
}
|
|
66
66
|
const stringKey = this.valueToString(key);
|
|
67
|
-
return
|
|
67
|
+
return HashUtils.djb2aHash(stringKey) % capacity;
|
|
68
68
|
}
|
|
69
|
-
static
|
|
70
|
-
if (key1 && key2 && typeof key1.equals === 'function') {
|
|
71
|
-
return key1.equals(key2);
|
|
72
|
-
}
|
|
69
|
+
static equals(key1, key2) {
|
|
73
70
|
if (key1 === key2)
|
|
74
71
|
return true;
|
|
75
|
-
if (
|
|
76
|
-
return
|
|
77
|
-
|
|
72
|
+
if (key1 == null || key2 == null)
|
|
73
|
+
return key1 === key2;
|
|
74
|
+
// Check for custom equals method
|
|
75
|
+
if (typeof key1.equals === 'function') {
|
|
76
|
+
return key1.equals(key2);
|
|
77
|
+
}
|
|
78
|
+
const type1 = typeof key1;
|
|
79
|
+
const type2 = typeof key2;
|
|
80
|
+
// Handle primitives
|
|
81
|
+
if (type1 !== 'object' && type2 !== 'object') {
|
|
82
|
+
if (type1 === 'number' && type2 === 'number') {
|
|
83
|
+
return key1 === key2 || (isNaN(key1) && isNaN(key2));
|
|
84
|
+
}
|
|
78
85
|
return key1 === key2;
|
|
79
|
-
if (key1 instanceof Date && key2 instanceof Date) {
|
|
80
|
-
// Handle invalid dates
|
|
81
|
-
if (isNaN(key1.getTime()) && isNaN(key2.getTime()))
|
|
82
|
-
return true;
|
|
83
|
-
return key1.getTime() === key2.getTime();
|
|
84
86
|
}
|
|
85
|
-
|
|
86
|
-
|
|
87
|
+
// Handle special object types
|
|
88
|
+
if (key1 instanceof Date) {
|
|
89
|
+
return key2 instanceof Date &&
|
|
90
|
+
(key1.getTime() === key2.getTime() || (isNaN(key1.getTime()) && isNaN(key2.getTime())));
|
|
87
91
|
}
|
|
88
|
-
if (
|
|
89
|
-
return key1.
|
|
90
|
-
key1.every((val, idx) => HashTableUtils.keysEqual(val, key2[idx]));
|
|
92
|
+
if (key1 instanceof RegExp) {
|
|
93
|
+
return key2 instanceof RegExp && key1.toString() === key2.toString();
|
|
91
94
|
}
|
|
92
|
-
if (key1
|
|
95
|
+
if (Array.isArray(key1)) {
|
|
96
|
+
if (!Array.isArray(key2) || key1.length !== key2.length)
|
|
97
|
+
return false;
|
|
98
|
+
for (let i = 0; i < key1.length; i++) {
|
|
99
|
+
if (!HashUtils.equals(key1[i], key2[i]))
|
|
100
|
+
return false;
|
|
101
|
+
}
|
|
93
102
|
return true;
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
if (key1 === null || key1 === undefined || key2 === null || key2 === undefined)
|
|
97
|
-
return false;
|
|
103
|
+
}
|
|
104
|
+
// Handle plain objects
|
|
98
105
|
if (typeof key1 === 'object' && typeof key2 === 'object') {
|
|
99
106
|
const keys1 = Object.keys(key1);
|
|
100
107
|
const keys2 = Object.keys(key2);
|
|
101
108
|
return keys1.length === keys2.length &&
|
|
102
|
-
keys1.every(k => k in key2 &&
|
|
109
|
+
keys1.every(k => k in key2 && HashUtils.equals(key1[k], key2[k]));
|
|
103
110
|
}
|
|
104
111
|
return false;
|
|
105
112
|
}
|
|
106
113
|
}
|
|
107
|
-
exports.
|
|
108
|
-
//# sourceMappingURL=hash-
|
|
114
|
+
exports.HashUtils = HashUtils;
|
|
115
|
+
//# sourceMappingURL=hash-utils.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"hash-utils.js","sourceRoot":"","sources":["../../lib/hash-utils.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;IACZ,MAAM,CAAC,aAAa,CAAI,KAAQ;QACtC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QACzD,IAAI,SAAiB,CAAC;QACtB,QAAQ,OAAO,KAAK,EAAE,CAAC;YACrB,KAAK,QAAQ;gBACX,SAAS,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC7B,MAAM;YACR,KAAK,QAAQ;gBACX,IAAI,OAAQ,KAAa,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;oBAClD,SAAS,GAAI,KAAa,CAAC,QAAQ,EAAE,CAAC;gBACxC,CAAC;qBAAM,CAAC;oBACN,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBACpC,CAAC;gBACD,MAAM;YACR,KAAK,QAAQ;gBACX,SAAS,GAAG,KAAK,CAAC;gBAClB,MAAM;YACR,KAAK,UAAU;gBACb,SAAS,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC7B,MAAM;YACR,KAAK,QAAQ;gBACX,SAAS,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC7B,MAAM;YACR;gBACE,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,uCAAuC;IACvC,MAAM,CAAC,UAAU,CAAC,GAAW;QAC3B,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC;QAChB,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;QACzB,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;QACzB,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACvB,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACxB,yCAAyC;QACzC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;QAC7C,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;QACzB,OAAO,GAAG,KAAK,CAAC,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,SAAS,CAAC,GAAW;QAC1B,IAAI,IAAI,GAAW,IAAI,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,6EAA6E;QAC7E,OAAO,IAAI,KAAK,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,CAAC,IAAI,CAAI,GAAM,EAAE,QAAgB;QACrC,IAAI,GAAG,IAAI,OAAQ,GAAW,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;YACvD,OAAQ,GAAW,CAAC,QAAQ,EAAE,CAAC;QACjC,CAAC;QACD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YACzD,OAAO,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;QAC9C,CAAC;QACD,MAAM,SAAS,GAAW,IAAI,CAAC,aAAa,CAAI,GAAG,CAAC,CAAC;QACrD,OAAO,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,QAAQ,CAAC;IACnD,CAAC;IAED,MAAM,CAAC,MAAM,CAAI,IAAO,EAAE,IAAO;QAC/B,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;YAAE,OAAO,IAAI,KAAK,IAAI,CAAC;QAEvD,iCAAiC;QACjC,IAAI,OAAQ,IAAY,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YAC/C,OAAQ,IAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC;QAED,MAAM,KAAK,GAAG,OAAO,IAAI,CAAC;QAC1B,MAAM,KAAK,GAAG,OAAO,IAAI,CAAC;QAE1B,oBAAoB;QACpB,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC7C,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC7C,OAAO,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,IAAc,CAAC,IAAI,KAAK,CAAC,IAAc,CAAC,CAAC,CAAC;YAC3E,CAAC;YACD,OAAO,IAAI,KAAK,IAAI,CAAC;QACvB,CAAC;QAED,8BAA8B;QAC9B,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;YACzB,OAAO,IAAI,YAAY,IAAI;gBACzB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5F,CAAC;QAED,IAAI,IAAI,YAAY,MAAM,EAAE,CAAC;YAC3B,OAAO,IAAI,YAAY,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;QACvE,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YACtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;YACxD,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,uBAAuB;QACvB,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,SAAS,CAAC,MAAM,CAAE,IAAY,CAAC,CAAC,CAAC,EAAG,IAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxF,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAlHD,8BAkHC"}
|
package/dist/lib/set.d.ts
CHANGED
|
@@ -1,25 +1,26 @@
|
|
|
1
|
-
import { Comparator } from '../types';
|
|
2
1
|
import { BaseCollection } from './base-collection';
|
|
2
|
+
import { Comparator } from '../types';
|
|
3
3
|
export interface Set<T> {
|
|
4
4
|
insert(element: T): void;
|
|
5
5
|
insertList(elements: T[]): void;
|
|
6
6
|
remove(element: T): void;
|
|
7
7
|
find(element: T): boolean;
|
|
8
|
+
has(element: T): boolean;
|
|
8
9
|
forEach(callback: (element: T) => void): void;
|
|
9
10
|
}
|
|
10
11
|
export declare class Set<T> extends BaseCollection<T> implements Set<T> {
|
|
11
|
-
private
|
|
12
|
+
private tree;
|
|
12
13
|
constructor(comparator?: Comparator<T>);
|
|
13
14
|
/**
|
|
14
|
-
* Removes all elements from the set
|
|
15
|
+
* Removes all elements from the set.
|
|
15
16
|
*/
|
|
16
17
|
clear(): void;
|
|
17
18
|
/**
|
|
18
|
-
* Returns true if the set contains no elements
|
|
19
|
+
* Returns true if the set contains no elements.
|
|
19
20
|
*/
|
|
20
21
|
isEmpty(): boolean;
|
|
21
22
|
/**
|
|
22
|
-
* Returns the number of elements in the set
|
|
23
|
+
* Returns the number of elements in the set.
|
|
23
24
|
*/
|
|
24
25
|
size(): number;
|
|
25
26
|
}
|
package/dist/lib/set.js
CHANGED
|
@@ -1,65 +1,63 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
3
|
exports.Set = void 0;
|
|
4
|
-
const binary_search_tree_1 = require("./binary-search-tree");
|
|
5
4
|
const base_collection_1 = require("./base-collection");
|
|
5
|
+
const binary_search_tree_1 = require("./binary-search-tree");
|
|
6
6
|
class Set extends base_collection_1.BaseCollection {
|
|
7
|
-
|
|
7
|
+
tree;
|
|
8
8
|
constructor(comparator = (a, b) => a < b) {
|
|
9
9
|
super();
|
|
10
|
-
this.
|
|
10
|
+
this.tree = new binary_search_tree_1.BinarySearchTree(comparator);
|
|
11
11
|
}
|
|
12
12
|
/**
|
|
13
|
-
* Adds a value to the set if it's not already present
|
|
13
|
+
* Adds a value to the set if it's not already present.
|
|
14
14
|
*/
|
|
15
15
|
insert(value) {
|
|
16
|
-
|
|
17
|
-
this.bst.insert(value);
|
|
18
|
-
}
|
|
16
|
+
this.tree.insert(value);
|
|
19
17
|
}
|
|
20
18
|
/**
|
|
21
|
-
* Adds multiple values to the set if they're not already present
|
|
19
|
+
* Adds multiple values to the set if they're not already present.
|
|
22
20
|
*/
|
|
23
21
|
insertList(values) {
|
|
24
22
|
for (const value of values) {
|
|
25
|
-
this.insert(value);
|
|
23
|
+
this.tree.insert(value);
|
|
26
24
|
}
|
|
27
25
|
}
|
|
28
26
|
/**
|
|
29
|
-
* Checks if a value exists in the set
|
|
27
|
+
* Checks if a value exists in the set.
|
|
30
28
|
*/
|
|
31
29
|
find(value) {
|
|
32
|
-
return this.
|
|
30
|
+
return this.tree.find(value);
|
|
31
|
+
}
|
|
32
|
+
has(value) {
|
|
33
|
+
return this.find(value);
|
|
33
34
|
}
|
|
34
35
|
/**
|
|
35
|
-
* Removes a value from the set
|
|
36
|
+
* Removes a value from the set.
|
|
36
37
|
*/
|
|
37
38
|
remove(value) {
|
|
38
|
-
this.
|
|
39
|
+
this.tree.remove(value);
|
|
39
40
|
}
|
|
40
|
-
/**
|
|
41
|
-
* Executes a callback function for each element in the set
|
|
42
|
-
*/
|
|
43
41
|
forEach(callback) {
|
|
44
|
-
this.
|
|
42
|
+
this.tree.forEach(callback);
|
|
45
43
|
}
|
|
46
44
|
/**
|
|
47
|
-
* Removes all elements from the set
|
|
45
|
+
* Removes all elements from the set.
|
|
48
46
|
*/
|
|
49
47
|
clear() {
|
|
50
|
-
this.
|
|
48
|
+
this.tree = new binary_search_tree_1.BinarySearchTree();
|
|
51
49
|
}
|
|
52
50
|
/**
|
|
53
|
-
* Returns true if the set contains no elements
|
|
51
|
+
* Returns true if the set contains no elements.
|
|
54
52
|
*/
|
|
55
53
|
isEmpty() {
|
|
56
|
-
return this.
|
|
54
|
+
return this.tree.size() === 0;
|
|
57
55
|
}
|
|
58
56
|
/**
|
|
59
|
-
* Returns the number of elements in the set
|
|
57
|
+
* Returns the number of elements in the set.
|
|
60
58
|
*/
|
|
61
59
|
size() {
|
|
62
|
-
return this.
|
|
60
|
+
return this.tree.size();
|
|
63
61
|
}
|
|
64
62
|
}
|
|
65
63
|
exports.Set = Set;
|
package/dist/lib/set.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"set.js","sourceRoot":"","sources":["../../lib/set.ts"],"names":[],"mappings":";;;
|
|
1
|
+
{"version":3,"file":"set.js","sourceRoot":"","sources":["../../lib/set.ts"],"names":[],"mappings":";;;AAAA,uDAAmD;AACnD,6DAAwD;AAcxD,MAAa,GAAO,SAAQ,gCAAiB;IACnC,IAAI,CAAsB;IAElC,YAAY,aAA4B,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;QAC3D,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,qCAAgB,CAAI,UAAU,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,MAAW;QACpB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,KAAQ;QACX,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,OAAO,CAAC,QAA8B;QACpC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,IAAI,qCAAgB,EAAK,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC1B,CAAC;CACF;AAlED,kBAkEC"}
|
package/package.json
CHANGED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"hash-table-utils.js","sourceRoot":"","sources":["../../lib/hash-table-utils.ts"],"names":[],"mappings":";;;AAAA,MAAa,cAAc;IACjB,MAAM,CAAC,aAAa,CAAI,KAAQ;QACtC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QACzD,IAAI,SAAiB,CAAC;QACtB,QAAQ,OAAO,KAAK,EAAE,CAAC;YACrB,KAAK,QAAQ;gBACX,SAAS,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC7B,MAAM;YACR,KAAK,QAAQ;gBACX,IAAI,OAAQ,KAAa,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;oBAClD,SAAS,GAAI,KAAa,CAAC,QAAQ,EAAE,CAAC;gBACxC,CAAC;qBAAM,CAAC;oBACN,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBACpC,CAAC;gBACD,MAAM;YACR,KAAK,QAAQ;gBACX,SAAS,GAAG,KAAK,CAAC;gBAClB,MAAM;YACR,KAAK,UAAU;gBACb,SAAS,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC7B,MAAM;YACR,KAAK,QAAQ;gBACX,SAAS,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC7B,MAAM;YACR;gBACE,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,uCAAuC;IACvC,MAAM,CAAC,UAAU,CAAC,GAAW;QAC3B,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC;QAChB,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;QACzB,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;QACzB,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACvB,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACxB,yCAAyC;QACzC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;QAC7C,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;QACzB,OAAO,GAAG,KAAK,CAAC,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,YAAY,CAAC,GAAW;QAC7B,IAAI,IAAI,GAAW,IAAI,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,6EAA6E;QAC7E,OAAO,IAAI,KAAK,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,CAAC,IAAI,CAAI,GAAM,EAAE,QAAgB;QACrC,IAAI,GAAG,IAAI,OAAQ,GAAW,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;YACvD,OAAQ,GAAW,CAAC,QAAQ,EAAE,CAAC;QACjC,CAAC;QACD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YACzD,OAAO,cAAc,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;QACnD,CAAC;QACD,MAAM,SAAS,GAAW,IAAI,CAAC,aAAa,CAAI,GAAG,CAAC,CAAC;QACrD,OAAO,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,QAAQ,CAAC;IACjD,CAAC;IAED,MAAM,CAAC,SAAS,CAAI,IAAO,EAAE,IAAO;QAClC,IAAI,IAAI,IAAI,IAAI,IAAI,OAAQ,IAAY,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YAC/D,OAAQ,IAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QACpG,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ;YAAE,OAAO,IAAI,KAAK,IAAI,CAAC;QAC/E,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;YACjD,uBAAuB;YACvB,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;gBAAE,OAAO,IAAI,CAAC;YAChE,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,cAAc,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvE,CAAC;QACD,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAChD,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QAC1D,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAE7F,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,cAAc,CAAC,SAAS,CAAE,IAAY,CAAC,CAAC,CAAC,EAAG,IAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAlGD,wCAkGC"}
|