typescript-ds-lib 0.3.8 → 0.4.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/LICENSE +1 -1
- package/README.md +3 -5
- package/dist/index.d.ts +2 -0
- package/dist/index.js +5 -1
- package/dist/index.js.map +1 -1
- package/dist/lib/base-collection.d.ts +4 -0
- package/dist/lib/base-collection.js.map +1 -1
- package/dist/lib/binary-search-tree.d.ts +5 -0
- package/dist/lib/binary-search-tree.js +22 -4
- package/dist/lib/binary-search-tree.js.map +1 -1
- package/dist/lib/deque.d.ts +4 -0
- package/dist/lib/deque.js +8 -0
- package/dist/lib/deque.js.map +1 -1
- package/dist/lib/graph/base.d.ts +167 -0
- package/dist/lib/graph/base.js +233 -0
- package/dist/lib/graph/base.js.map +1 -0
- package/dist/lib/graph/linked-list-graph.d.ts +18 -0
- package/dist/lib/graph/linked-list-graph.js +71 -0
- package/dist/lib/graph/linked-list-graph.js.map +1 -0
- package/dist/lib/graph/matrix-graph.d.ts +18 -0
- package/dist/lib/graph/matrix-graph.js +102 -0
- package/dist/lib/graph/matrix-graph.js.map +1 -0
- package/dist/lib/hash-table.d.ts +4 -0
- package/dist/lib/hash-table.js +25 -4
- package/dist/lib/hash-table.js.map +1 -1
- package/dist/lib/hash-utils.d.ts +0 -1
- package/dist/lib/hash-utils.js +4 -45
- package/dist/lib/hash-utils.js.map +1 -1
- package/dist/lib/heap.d.ts +4 -0
- package/dist/lib/heap.js +17 -4
- package/dist/lib/heap.js.map +1 -1
- package/dist/lib/linked-list.d.ts +4 -0
- package/dist/lib/linked-list.js +19 -0
- package/dist/lib/linked-list.js.map +1 -1
- package/dist/lib/map.d.ts +1 -0
- package/dist/lib/map.js +5 -0
- package/dist/lib/map.js.map +1 -1
- package/dist/lib/matrix.js +14 -6
- package/dist/lib/matrix.js.map +1 -1
- package/dist/lib/priority-queue.d.ts +4 -0
- package/dist/lib/priority-queue.js +8 -0
- package/dist/lib/priority-queue.js.map +1 -1
- package/dist/lib/queue.d.ts +4 -0
- package/dist/lib/queue.js +8 -0
- package/dist/lib/queue.js.map +1 -1
- package/dist/lib/red-black-tree.d.ts +6 -0
- package/dist/lib/red-black-tree.js +21 -0
- package/dist/lib/red-black-tree.js.map +1 -1
- package/dist/lib/set.d.ts +4 -0
- package/dist/lib/set.js +8 -0
- package/dist/lib/set.js.map +1 -1
- package/dist/lib/stack.d.ts +5 -1
- package/dist/lib/stack.js +8 -0
- package/dist/lib/stack.js.map +1 -1
- package/dist/lib/utils.d.ts +3 -0
- package/dist/lib/utils.js +47 -0
- package/dist/lib/utils.js.map +1 -0
- package/package.json +9 -5
- package/dist/lib/graph.d.ts +0 -14
- package/dist/lib/graph.js +0 -3
- package/dist/lib/graph.js.map +0 -1
|
@@ -0,0 +1,71 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.LinkedListGraph = void 0;
|
|
4
|
+
const linked_list_1 = require("../linked-list");
|
|
5
|
+
const base_1 = require("./base");
|
|
6
|
+
/**
|
|
7
|
+
* LinkedList-based Graph implementation.
|
|
8
|
+
* Uses adjacency lists to represent the graph.
|
|
9
|
+
*/
|
|
10
|
+
class LinkedListGraph extends base_1.BaseGraph {
|
|
11
|
+
adjacencyLists;
|
|
12
|
+
constructor() {
|
|
13
|
+
super();
|
|
14
|
+
this.adjacencyLists = new Map();
|
|
15
|
+
}
|
|
16
|
+
onVertexAdded(vertex) {
|
|
17
|
+
this.adjacencyLists.set(vertex, new linked_list_1.LinkedList());
|
|
18
|
+
}
|
|
19
|
+
onVertexRemoved(vertex, vertexIndex) {
|
|
20
|
+
this.adjacencyLists.delete(vertex);
|
|
21
|
+
}
|
|
22
|
+
onEdgeAdded(from, to, weight) {
|
|
23
|
+
const fromList = this.adjacencyLists.get(from);
|
|
24
|
+
if (fromList) {
|
|
25
|
+
// Remove existing edge if it exists
|
|
26
|
+
fromList.removeIf((edge) => edge.vertex === to);
|
|
27
|
+
fromList.pushBack({ vertex: to, weight });
|
|
28
|
+
}
|
|
29
|
+
}
|
|
30
|
+
onEdgeRemoved(from, to) {
|
|
31
|
+
const fromList = this.adjacencyLists.get(from);
|
|
32
|
+
if (fromList) {
|
|
33
|
+
fromList.removeIf((edge) => edge.vertex === to);
|
|
34
|
+
}
|
|
35
|
+
}
|
|
36
|
+
onGetNeighbors(vertex) {
|
|
37
|
+
const list = this.adjacencyLists.get(vertex);
|
|
38
|
+
if (!list)
|
|
39
|
+
return [];
|
|
40
|
+
const neighbors = [];
|
|
41
|
+
list.forEach((edge) => neighbors.push(edge.vertex));
|
|
42
|
+
return neighbors;
|
|
43
|
+
}
|
|
44
|
+
onGetEdgeWeight(from, to) {
|
|
45
|
+
const list = this.adjacencyLists.get(from);
|
|
46
|
+
if (!list)
|
|
47
|
+
return undefined;
|
|
48
|
+
for (let i = 0; i < list.size(); i++) {
|
|
49
|
+
const edge = list.get(i);
|
|
50
|
+
if (edge && edge.vertex === to) {
|
|
51
|
+
return edge.weight;
|
|
52
|
+
}
|
|
53
|
+
}
|
|
54
|
+
return undefined;
|
|
55
|
+
}
|
|
56
|
+
onHasEdge(from, to) {
|
|
57
|
+
return this.onGetEdgeWeight(from, to) !== undefined;
|
|
58
|
+
}
|
|
59
|
+
onGetEdgeCount() {
|
|
60
|
+
let count = 0;
|
|
61
|
+
this.adjacencyLists.forEach((list) => {
|
|
62
|
+
count += list.size();
|
|
63
|
+
});
|
|
64
|
+
return count;
|
|
65
|
+
}
|
|
66
|
+
onClear() {
|
|
67
|
+
this.adjacencyLists.clear();
|
|
68
|
+
}
|
|
69
|
+
}
|
|
70
|
+
exports.LinkedListGraph = LinkedListGraph;
|
|
71
|
+
//# sourceMappingURL=linked-list-graph.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"linked-list-graph.js","sourceRoot":"","sources":["../../../lib/graph/linked-list-graph.ts"],"names":[],"mappings":";;;AAAA,gDAA4C;AAC5C,iCAAmC;AAEnC;;;GAGG;AACH,MAAa,eAA+B,SAAQ,gBAAe;IACzD,cAAc,CAA+C;IAErE;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,cAAc,GAAG,IAAI,GAAG,EAA2C,CAAC;IAC3E,CAAC;IAES,aAAa,CAAC,MAAS;QAC/B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,wBAAU,EAA4B,CAAC,CAAC;IAC9E,CAAC;IAES,eAAe,CAAC,MAAS,EAAE,WAAmB;QACtD,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IAES,WAAW,CAAC,IAAO,EAAE,EAAK,EAAE,MAAS;QAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,QAAQ,EAAE,CAAC;YACb,oCAAoC;YACpC,QAAQ,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;YAChD,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAES,aAAa,CAAC,IAAO,EAAE,EAAK;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAES,cAAc,CAAC,MAAS;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,CAAC;QAErB,MAAM,SAAS,GAAQ,EAAE,CAAC;QAC1B,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACpD,OAAO,SAAS,CAAC;IACnB,CAAC;IAES,eAAe,CAAC,IAAO,EAAE,EAAK;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;gBAC/B,OAAO,IAAI,CAAC,MAAM,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAES,SAAS,CAAC,IAAO,EAAE,EAAK;QAChC,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,SAAS,CAAC;IACtD,CAAC;IAES,cAAc;QACtB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACnC,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QACvB,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC;IAES,OAAO;QACf,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;IAC9B,CAAC;CACF;AArED,0CAqEC"}
|
|
@@ -0,0 +1,18 @@
|
|
|
1
|
+
import { BaseGraph } from './base';
|
|
2
|
+
/**
|
|
3
|
+
* Matrix-based Graph implementation.
|
|
4
|
+
* Uses adjacency matrix to represent the graph.
|
|
5
|
+
*/
|
|
6
|
+
export declare class MatrixGraph<V, W = number> extends BaseGraph<V, W> {
|
|
7
|
+
private adjacencyMatrix;
|
|
8
|
+
constructor();
|
|
9
|
+
protected onVertexAdded(vertex: V): void;
|
|
10
|
+
protected onVertexRemoved(vertex: V, vertexIndex: number): void;
|
|
11
|
+
protected onEdgeAdded(from: V, to: V, weight: W): void;
|
|
12
|
+
protected onEdgeRemoved(from: V, to: V): void;
|
|
13
|
+
protected onGetNeighbors(vertex: V): V[];
|
|
14
|
+
protected onGetEdgeWeight(from: V, to: V): W | undefined;
|
|
15
|
+
protected onHasEdge(from: V, to: V): boolean;
|
|
16
|
+
protected onGetEdgeCount(): number;
|
|
17
|
+
protected onClear(): void;
|
|
18
|
+
}
|
|
@@ -0,0 +1,102 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.MatrixGraph = void 0;
|
|
4
|
+
const matrix_1 = require("../matrix");
|
|
5
|
+
const base_1 = require("./base");
|
|
6
|
+
/**
|
|
7
|
+
* Matrix-based Graph implementation.
|
|
8
|
+
* Uses adjacency matrix to represent the graph.
|
|
9
|
+
*/
|
|
10
|
+
class MatrixGraph extends base_1.BaseGraph {
|
|
11
|
+
adjacencyMatrix;
|
|
12
|
+
constructor() {
|
|
13
|
+
super();
|
|
14
|
+
this.adjacencyMatrix = new matrix_1.Matrix(0, 0);
|
|
15
|
+
}
|
|
16
|
+
onVertexAdded(vertex) {
|
|
17
|
+
const newSize = this.vertexCount();
|
|
18
|
+
const newMatrix = new matrix_1.Matrix(newSize, newSize);
|
|
19
|
+
for (let i = 0; i < this.adjacencyMatrix.rows(); i++) {
|
|
20
|
+
for (let j = 0; j < this.adjacencyMatrix.columns(); j++) {
|
|
21
|
+
newMatrix.set(i, j, this.adjacencyMatrix.get(i, j));
|
|
22
|
+
}
|
|
23
|
+
}
|
|
24
|
+
this.adjacencyMatrix = newMatrix;
|
|
25
|
+
}
|
|
26
|
+
onVertexRemoved(vertex, vertexIndex) {
|
|
27
|
+
const newSize = this.vertexCount();
|
|
28
|
+
const newMatrix = new matrix_1.Matrix(newSize, newSize);
|
|
29
|
+
// Copy data excluding the removed vertex
|
|
30
|
+
let newRow = 0;
|
|
31
|
+
for (let oldRow = 0; oldRow < this.adjacencyMatrix.rows(); oldRow++) {
|
|
32
|
+
if (oldRow === vertexIndex)
|
|
33
|
+
continue;
|
|
34
|
+
let newCol = 0;
|
|
35
|
+
for (let oldCol = 0; oldCol < this.adjacencyMatrix.columns(); oldCol++) {
|
|
36
|
+
if (oldCol === vertexIndex)
|
|
37
|
+
continue;
|
|
38
|
+
newMatrix.set(newRow, newCol, this.adjacencyMatrix.get(oldRow, oldCol));
|
|
39
|
+
newCol++;
|
|
40
|
+
}
|
|
41
|
+
newRow++;
|
|
42
|
+
}
|
|
43
|
+
this.adjacencyMatrix = newMatrix;
|
|
44
|
+
}
|
|
45
|
+
onEdgeAdded(from, to, weight) {
|
|
46
|
+
const fromIndex = this.getVertexIndex(from);
|
|
47
|
+
const toIndex = this.getVertexIndex(to);
|
|
48
|
+
if (fromIndex !== -1 && toIndex !== -1) {
|
|
49
|
+
this.adjacencyMatrix.set(fromIndex, toIndex, weight);
|
|
50
|
+
}
|
|
51
|
+
}
|
|
52
|
+
onEdgeRemoved(from, to) {
|
|
53
|
+
const fromIndex = this.getVertexIndex(from);
|
|
54
|
+
const toIndex = this.getVertexIndex(to);
|
|
55
|
+
if (fromIndex !== -1 && toIndex !== -1) {
|
|
56
|
+
this.adjacencyMatrix.set(fromIndex, toIndex, undefined);
|
|
57
|
+
}
|
|
58
|
+
}
|
|
59
|
+
onGetNeighbors(vertex) {
|
|
60
|
+
const vertexIndex = this.getVertexIndex(vertex);
|
|
61
|
+
if (vertexIndex === -1)
|
|
62
|
+
return [];
|
|
63
|
+
const neighbors = [];
|
|
64
|
+
for (let i = 0; i < this.adjacencyMatrix.columns(); i++) {
|
|
65
|
+
const weight = this.adjacencyMatrix.get(vertexIndex, i);
|
|
66
|
+
if (weight !== undefined) {
|
|
67
|
+
const neighborVertex = this.getVertexAt(i);
|
|
68
|
+
if (neighborVertex !== undefined) {
|
|
69
|
+
neighbors.push(neighborVertex);
|
|
70
|
+
}
|
|
71
|
+
}
|
|
72
|
+
}
|
|
73
|
+
return neighbors;
|
|
74
|
+
}
|
|
75
|
+
onGetEdgeWeight(from, to) {
|
|
76
|
+
const fromIndex = this.getVertexIndex(from);
|
|
77
|
+
const toIndex = this.getVertexIndex(to);
|
|
78
|
+
if (fromIndex === -1 || toIndex === -1) {
|
|
79
|
+
return undefined;
|
|
80
|
+
}
|
|
81
|
+
return this.adjacencyMatrix.get(fromIndex, toIndex);
|
|
82
|
+
}
|
|
83
|
+
onHasEdge(from, to) {
|
|
84
|
+
return this.onGetEdgeWeight(from, to) !== undefined;
|
|
85
|
+
}
|
|
86
|
+
onGetEdgeCount() {
|
|
87
|
+
let count = 0;
|
|
88
|
+
for (let i = 0; i < this.adjacencyMatrix.rows(); i++) {
|
|
89
|
+
for (let j = 0; j < this.adjacencyMatrix.columns(); j++) {
|
|
90
|
+
if (this.adjacencyMatrix.get(i, j) !== undefined) {
|
|
91
|
+
count++;
|
|
92
|
+
}
|
|
93
|
+
}
|
|
94
|
+
}
|
|
95
|
+
return count;
|
|
96
|
+
}
|
|
97
|
+
onClear() {
|
|
98
|
+
this.adjacencyMatrix = new matrix_1.Matrix(0, 0);
|
|
99
|
+
}
|
|
100
|
+
}
|
|
101
|
+
exports.MatrixGraph = MatrixGraph;
|
|
102
|
+
//# sourceMappingURL=matrix-graph.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"matrix-graph.js","sourceRoot":"","sources":["../../../lib/graph/matrix-graph.ts"],"names":[],"mappings":";;;AAAA,sCAAmC;AACnC,iCAAmC;AAEnC;;;GAGG;AACH,MAAa,WAA2B,SAAQ,gBAAe;IACrD,eAAe,CAAwB;IAE/C;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,eAAe,GAAG,IAAI,eAAM,CAAgB,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;IAES,aAAa,CAAC,MAAS;QAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,IAAI,eAAM,CAAgB,OAAO,EAAE,OAAO,CAAC,CAAC;QAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxD,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;QACD,IAAI,CAAC,eAAe,GAAG,SAAS,CAAC;IACnC,CAAC;IAES,eAAe,CAAC,MAAS,EAAE,WAAmB;QACtD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,IAAI,eAAM,CAAgB,OAAO,EAAE,OAAO,CAAC,CAAC;QAE9D,yCAAyC;QACzC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC;YACpE,IAAI,MAAM,KAAK,WAAW;gBAAE,SAAS;YAErC,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC;gBACvE,IAAI,MAAM,KAAK,WAAW;oBAAE,SAAS;gBAErC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;gBACxE,MAAM,EAAE,CAAC;YACX,CAAC;YACD,MAAM,EAAE,CAAC;QACX,CAAC;QAED,IAAI,CAAC,eAAe,GAAG,SAAS,CAAC;IACnC,CAAC;IAES,WAAW,CAAC,IAAO,EAAE,EAAK,EAAE,MAAS;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAExC,IAAI,SAAS,KAAK,CAAC,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IAES,aAAa,CAAC,IAAO,EAAE,EAAK;QACpC,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAExC,IAAI,SAAS,KAAK,CAAC,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAES,cAAc,CAAC,MAAS;QAChC,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,WAAW,KAAK,CAAC,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,MAAM,SAAS,GAAQ,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACxD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAC3C,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;oBACjC,SAAS,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAES,eAAe,CAAC,IAAO,EAAE,EAAK;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAExC,IAAI,SAAS,KAAK,CAAC,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC;YACvC,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IAES,SAAS,CAAC,IAAO,EAAE,EAAK;QAChC,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,SAAS,CAAC;IACtD,CAAC;IAES,cAAc;QACtB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxD,IAAI,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;oBACjD,KAAK,EAAE,CAAC;gBACV,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAES,OAAO;QACf,IAAI,CAAC,eAAe,GAAG,IAAI,eAAM,CAAgB,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;CACF;AA1GD,kCA0GC"}
|
package/dist/lib/hash-table.d.ts
CHANGED
package/dist/lib/hash-table.js
CHANGED
|
@@ -3,6 +3,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
|
|
|
3
3
|
exports.HashTable = void 0;
|
|
4
4
|
const hash_utils_1 = require("./hash-utils");
|
|
5
5
|
const base_collection_1 = require("./base-collection");
|
|
6
|
+
const utils_1 = require("./utils");
|
|
6
7
|
class HashNode {
|
|
7
8
|
key;
|
|
8
9
|
value;
|
|
@@ -33,14 +34,14 @@ class HashTable extends base_collection_1.BaseCollection {
|
|
|
33
34
|
return;
|
|
34
35
|
}
|
|
35
36
|
// Check first node for key match. If it matches, update the value.
|
|
36
|
-
if (
|
|
37
|
+
if (utils_1.Utils.equals(this.table[index].key, key)) {
|
|
37
38
|
this.table[index].value = value;
|
|
38
39
|
return;
|
|
39
40
|
}
|
|
40
41
|
// Traverse chain to find key or last node. If it matches, update the value.
|
|
41
42
|
let current = this.table[index];
|
|
42
43
|
while (current?.next) {
|
|
43
|
-
if (
|
|
44
|
+
if (utils_1.Utils.equals(current.next.key, key)) {
|
|
44
45
|
current.next.value = value;
|
|
45
46
|
return;
|
|
46
47
|
}
|
|
@@ -54,7 +55,7 @@ class HashTable extends base_collection_1.BaseCollection {
|
|
|
54
55
|
const index = hash_utils_1.HashUtils.hash(key, this.capacity);
|
|
55
56
|
let current = this.table[index];
|
|
56
57
|
while (current) {
|
|
57
|
-
if (
|
|
58
|
+
if (utils_1.Utils.equals(current.key, key)) {
|
|
58
59
|
return current.value;
|
|
59
60
|
}
|
|
60
61
|
current = current.next;
|
|
@@ -66,7 +67,7 @@ class HashTable extends base_collection_1.BaseCollection {
|
|
|
66
67
|
let current = this.table[index];
|
|
67
68
|
let prev = null;
|
|
68
69
|
while (current) {
|
|
69
|
-
if (
|
|
70
|
+
if (utils_1.Utils.equals(current.key, key)) {
|
|
70
71
|
if (prev) {
|
|
71
72
|
prev.next = current.next;
|
|
72
73
|
}
|
|
@@ -100,6 +101,26 @@ class HashTable extends base_collection_1.BaseCollection {
|
|
|
100
101
|
this.table = new Array(this.capacity).fill(null);
|
|
101
102
|
this.count = 0;
|
|
102
103
|
}
|
|
104
|
+
/**
|
|
105
|
+
* Checks if two hash tables are equal.
|
|
106
|
+
*/
|
|
107
|
+
equals(other) {
|
|
108
|
+
if (!other || !(other instanceof HashTable)) {
|
|
109
|
+
return false;
|
|
110
|
+
}
|
|
111
|
+
if (this.size() !== other.size()) {
|
|
112
|
+
return false;
|
|
113
|
+
}
|
|
114
|
+
// Check each key-value pair in this table exists in other table
|
|
115
|
+
let isEqual = true;
|
|
116
|
+
this.forEach((key, value) => {
|
|
117
|
+
const otherValue = other.get(key);
|
|
118
|
+
if (!utils_1.Utils.equals(value, otherValue)) {
|
|
119
|
+
isEqual = false;
|
|
120
|
+
}
|
|
121
|
+
});
|
|
122
|
+
return isEqual;
|
|
123
|
+
}
|
|
103
124
|
}
|
|
104
125
|
exports.HashTable = HashTable;
|
|
105
126
|
//# sourceMappingURL=hash-table.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../lib/hash-table.ts"],"names":[],"mappings":";;;AAAA,6CAAyC;AACzC,uDAAmD;
|
|
1
|
+
{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../lib/hash-table.ts"],"names":[],"mappings":";;;AAAA,6CAAyC;AACzC,uDAAmD;AACnD,mCAAgC;AAShC,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,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,aAAK,CAAC,MAAM,CAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YACjD,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,aAAK,CAAC,MAAM,CAAI,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC3C,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,aAAK,CAAC,MAAM,CAAI,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACtC,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,aAAK,CAAC,MAAM,CAAI,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACtC,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;IAED;;OAEG;IACH,MAAM,CAAC,KAAsB;QAC3B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,YAAY,SAAS,CAAC,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACjC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,gEAAgE;QAChE,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;YAC1B,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,CAAC,aAAK,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC;gBACrC,OAAO,GAAG,KAAK,CAAC;YAClB,CAAC;QACH,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAnHD,8BAmHC"}
|
package/dist/lib/hash-utils.d.ts
CHANGED
package/dist/lib/hash-utils.js
CHANGED
|
@@ -58,7 +58,10 @@ class HashUtils {
|
|
|
58
58
|
}
|
|
59
59
|
static hash(key, capacity) {
|
|
60
60
|
if (key && typeof key.hashCode === 'function') {
|
|
61
|
-
|
|
61
|
+
const hashValue = key.hashCode();
|
|
62
|
+
return typeof hashValue === 'number'
|
|
63
|
+
? hashValue % capacity
|
|
64
|
+
: HashUtils.djb2aHash(String(hashValue)) % capacity;
|
|
62
65
|
}
|
|
63
66
|
if (typeof key === 'number' && Number.isSafeInteger(key)) {
|
|
64
67
|
return HashUtils.wangHash32(key) % capacity;
|
|
@@ -66,50 +69,6 @@ class HashUtils {
|
|
|
66
69
|
const stringKey = this.valueToString(key);
|
|
67
70
|
return HashUtils.djb2aHash(stringKey) % capacity;
|
|
68
71
|
}
|
|
69
|
-
static equals(key1, key2) {
|
|
70
|
-
if (key1 === key2)
|
|
71
|
-
return true;
|
|
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
|
-
}
|
|
85
|
-
return key1 === key2;
|
|
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())));
|
|
91
|
-
}
|
|
92
|
-
if (key1 instanceof RegExp) {
|
|
93
|
-
return key2 instanceof RegExp && key1.toString() === key2.toString();
|
|
94
|
-
}
|
|
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
|
-
}
|
|
102
|
-
return true;
|
|
103
|
-
}
|
|
104
|
-
// Handle plain objects
|
|
105
|
-
if (typeof key1 === 'object' && typeof key2 === 'object') {
|
|
106
|
-
const keys1 = Object.keys(key1);
|
|
107
|
-
const keys2 = Object.keys(key2);
|
|
108
|
-
return keys1.length === keys2.length &&
|
|
109
|
-
keys1.every(k => k in key2 && HashUtils.equals(key1[k], key2[k]));
|
|
110
|
-
}
|
|
111
|
-
return false;
|
|
112
|
-
}
|
|
113
72
|
}
|
|
114
73
|
exports.HashUtils = HashUtils;
|
|
115
74
|
//# sourceMappingURL=hash-utils.js.map
|
|
@@ -1 +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,
|
|
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,MAAM,SAAS,GAAI,GAAW,CAAC,QAAQ,EAAE,CAAC;YAC1C,OAAO,OAAO,SAAS,KAAK,QAAQ;gBAClC,CAAC,CAAC,SAAS,GAAG,QAAQ;gBACtB,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC;QACxD,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;CACF;AArED,8BAqEC"}
|
package/dist/lib/heap.d.ts
CHANGED
package/dist/lib/heap.js
CHANGED
|
@@ -2,6 +2,7 @@
|
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
3
|
exports.Heap = void 0;
|
|
4
4
|
const base_collection_1 = require("./base-collection");
|
|
5
|
+
const utils_1 = require("./utils");
|
|
5
6
|
class Heap extends base_collection_1.BaseCollection {
|
|
6
7
|
items;
|
|
7
8
|
comparator;
|
|
@@ -63,8 +64,7 @@ class Heap extends base_collection_1.BaseCollection {
|
|
|
63
64
|
while (index > 0) {
|
|
64
65
|
const parentIndex = Math.floor((index - 1) / 2);
|
|
65
66
|
if (this.comparator(this.items[index], this.items[parentIndex])) {
|
|
66
|
-
[this.items[index], this.items[parentIndex]] =
|
|
67
|
-
[this.items[parentIndex], this.items[index]];
|
|
67
|
+
[this.items[index], this.items[parentIndex]] = [this.items[parentIndex], this.items[index]];
|
|
68
68
|
index = parentIndex;
|
|
69
69
|
}
|
|
70
70
|
else {
|
|
@@ -91,11 +91,24 @@ class Heap extends base_collection_1.BaseCollection {
|
|
|
91
91
|
if (smallestIndex === index) {
|
|
92
92
|
break;
|
|
93
93
|
}
|
|
94
|
-
[this.items[index], this.items[smallestIndex]] =
|
|
95
|
-
[this.items[smallestIndex], this.items[index]];
|
|
94
|
+
[this.items[index], this.items[smallestIndex]] = [this.items[smallestIndex], this.items[index]];
|
|
96
95
|
index = smallestIndex;
|
|
97
96
|
}
|
|
98
97
|
}
|
|
98
|
+
/**
|
|
99
|
+
* Checks if two heaps are equal.
|
|
100
|
+
*/
|
|
101
|
+
equals(other) {
|
|
102
|
+
if (!other || !(other instanceof Heap))
|
|
103
|
+
return false;
|
|
104
|
+
if (this.size() !== other.size())
|
|
105
|
+
return false;
|
|
106
|
+
for (let i = 0; i < this.items.length; i++) {
|
|
107
|
+
if (!utils_1.Utils.equals(this.items[i], other.items[i]))
|
|
108
|
+
return false;
|
|
109
|
+
}
|
|
110
|
+
return true;
|
|
111
|
+
}
|
|
99
112
|
}
|
|
100
113
|
exports.Heap = Heap;
|
|
101
114
|
//# sourceMappingURL=heap.js.map
|
package/dist/lib/heap.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"heap.js","sourceRoot":"","sources":["../../lib/heap.ts"],"names":[],"mappings":";;;AACA,uDAAmD;
|
|
1
|
+
{"version":3,"file":"heap.js","sourceRoot":"","sources":["../../lib/heap.ts"],"names":[],"mappings":";;;AACA,uDAAmD;AACnD,mCAAgC;AAQhC,MAAa,IAAQ,SAAQ,gCAAiB;IACpC,KAAK,CAAM;IACX,UAAU,CAAgB;IAElC,YAAY,aAA4B,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;QAC3D,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,OAAU;QACb,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,GAAG;QACD,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,IAAI,GAAM,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,WAAW,GAAM,IAAI,CAAC,KAAK,CAAC,GAAG,EAAG,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;YAC5B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,GAAG;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,KAAa;QAC7B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,WAAW,GAAW,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxD,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC;gBAChE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC5F,KAAK,GAAG,WAAW,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,KAAa;QAC/B,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,aAAa,GAAW,KAAK,CAAC;YAClC,MAAM,SAAS,GAAW,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACxC,MAAM,UAAU,GAAW,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACzC,IACE,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBAC7B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,EACjE,CAAC;gBACD,aAAa,GAAG,SAAS,CAAC;YAC5B,CAAC;YACD,IACE,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBAC9B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,EAClE,CAAC;gBACD,aAAa,GAAG,UAAU,CAAC;YAC7B,CAAC;YACD,IAAI,aAAa,KAAK,KAAK,EAAE,CAAC;gBAC5B,MAAM;YACR,CAAC;YACD,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YAChG,KAAK,GAAG,aAAa,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAc;QACnB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,YAAY,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QACrD,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,KAAK,CAAC,IAAI,EAAE;YAAE,OAAO,KAAK,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,aAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QACjE,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AApHD,oBAoHC"}
|
package/dist/lib/linked-list.js
CHANGED
|
@@ -2,6 +2,7 @@
|
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
3
|
exports.LinkedList = void 0;
|
|
4
4
|
const base_collection_1 = require("./base-collection");
|
|
5
|
+
const utils_1 = require("./utils");
|
|
5
6
|
class Node {
|
|
6
7
|
value;
|
|
7
8
|
next;
|
|
@@ -280,6 +281,24 @@ class LinkedList extends base_collection_1.BaseCollection {
|
|
|
280
281
|
this.tail = null;
|
|
281
282
|
this.length = 0;
|
|
282
283
|
}
|
|
284
|
+
/**
|
|
285
|
+
* Checks if two lists are equal.
|
|
286
|
+
*/
|
|
287
|
+
equals(other) {
|
|
288
|
+
if (!other || !(other instanceof LinkedList))
|
|
289
|
+
return false;
|
|
290
|
+
if (this.size() !== other.size())
|
|
291
|
+
return false;
|
|
292
|
+
let current = this.head;
|
|
293
|
+
let otherCurrent = other.head;
|
|
294
|
+
while (current !== null) {
|
|
295
|
+
if (!utils_1.Utils.equals(current.value, otherCurrent.value))
|
|
296
|
+
return false;
|
|
297
|
+
current = current.next;
|
|
298
|
+
otherCurrent = otherCurrent.next;
|
|
299
|
+
}
|
|
300
|
+
return true;
|
|
301
|
+
}
|
|
283
302
|
}
|
|
284
303
|
exports.LinkedList = LinkedList;
|
|
285
304
|
//# sourceMappingURL=linked-list.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"linked-list.js","sourceRoot":"","sources":["../../lib/linked-list.ts"],"names":[],"mappings":";;;AAAA,uDAAmD;
|
|
1
|
+
{"version":3,"file":"linked-list.js","sourceRoot":"","sources":["../../lib/linked-list.ts"],"names":[],"mappings":";;;AAAA,uDAAmD;AACnD,mCAAgC;AAkBhC,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;AAED,MAAa,UAAc,SAAQ,gCAAiB;IAC1C,IAAI,CAAiB;IACrB,IAAI,CAAiB;IACrB,MAAM,CAAS;IAEvB;QACE,KAAK,EAAE,CAAC;QACR,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,GAAY,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,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,GAAY,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,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,GAAmB,IAAI,CAAC,IAAI,CAAC;QACxC,OAAO,OAAO,EAAE,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YACnC,OAAO,GAAG,OAAQ,CAAC,IAAI,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,GAAY,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAI,OAAO,GAAmB,IAAI,CAAC,IAAI,CAAC;QACxC,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,GAAmB,IAAI,CAAC,IAAI,CAAC;QACxC,OAAO,OAAO,EAAE,IAAI,KAAK,IAAI,EAAE,CAAC;YAC9B,IAAI,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBAClC,MAAM,OAAO,GAAY,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC3C,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,GAAmB,IAAI,CAAC,IAAI,CAAC;QACxC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7B,MAAM,OAAO,GAAY,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC3C,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,OAAQ,CAAC,IAAI,CAAC;QAC1B,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,GAAmB,IAAI,CAAC,IAAI,CAAC;QACxC,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;IAED;;OAEG;IACH,MAAM,CAAC,KAAoB;QACzB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,YAAY,UAAU,CAAC;YAAE,OAAO,KAAK,CAAC;QAC3D,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,KAAK,CAAC,IAAI,EAAE;YAAE,OAAO,KAAK,CAAC;QAC/C,IAAI,OAAO,GAAmB,IAAI,CAAC,IAAI,CAAC;QACxC,IAAI,YAAY,GAAmB,KAAK,CAAC,IAAI,CAAC;QAC9C,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,aAAK,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,YAAa,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACpE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACvB,YAAY,GAAG,YAAa,CAAC,IAAI,CAAC;QACpC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AA3SD,gCA2SC"}
|
package/dist/lib/map.d.ts
CHANGED
package/dist/lib/map.js
CHANGED
|
@@ -33,6 +33,11 @@ class Map extends base_collection_1.BaseCollection {
|
|
|
33
33
|
forEach(callback) {
|
|
34
34
|
this.rbTree.forEach(callback);
|
|
35
35
|
}
|
|
36
|
+
equals(other) {
|
|
37
|
+
if (!other || !(other instanceof Map))
|
|
38
|
+
return false;
|
|
39
|
+
return this.rbTree.equals(other.rbTree);
|
|
40
|
+
}
|
|
36
41
|
}
|
|
37
42
|
exports.Map = Map;
|
|
38
43
|
//# 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;AAChD,uDAAmD;
|
|
1
|
+
{"version":3,"file":"map.js","sourceRoot":"","sources":["../../lib/map.ts"],"names":[],"mappings":";;;AACA,qDAAgD;AAChD,uDAAmD;AAUnD,MAAa,GAAU,SAAQ,gCAAiB;IACtC,MAAM,CAAqB;IAEnC,YAAY,aAA4B,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;QAC3D,KAAK,EAAE,CAAC;QACR,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;IAED,MAAM,CAAC,KAAgB;QACrB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,YAAY,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACpD,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;CACF;AA5CD,kBA4CC"}
|
package/dist/lib/matrix.js
CHANGED
|
@@ -10,7 +10,9 @@ class Matrix extends base_collection_1.BaseCollection {
|
|
|
10
10
|
super();
|
|
11
11
|
this.numRows = rows;
|
|
12
12
|
this.numCols = cols;
|
|
13
|
-
this.data = Array(rows)
|
|
13
|
+
this.data = Array(rows)
|
|
14
|
+
.fill(null)
|
|
15
|
+
.map(() => Array(cols).fill(undefined));
|
|
14
16
|
}
|
|
15
17
|
/**
|
|
16
18
|
* Gets the value at the specified position. The value at [row,col] or undefined if out of bounds.
|
|
@@ -44,13 +46,17 @@ class Matrix extends base_collection_1.BaseCollection {
|
|
|
44
46
|
* Fills the entire matrix with a value.
|
|
45
47
|
*/
|
|
46
48
|
fill(value) {
|
|
47
|
-
this.data = Array(this.numRows)
|
|
49
|
+
this.data = Array(this.numRows)
|
|
50
|
+
.fill(null)
|
|
51
|
+
.map(() => Array(this.numCols).fill(value));
|
|
48
52
|
}
|
|
49
53
|
/**
|
|
50
54
|
* Clears the matrix by setting all elements to undefined.
|
|
51
55
|
*/
|
|
52
56
|
clear() {
|
|
53
|
-
this.data = Array(this.numRows)
|
|
57
|
+
this.data = Array(this.numRows)
|
|
58
|
+
.fill(null)
|
|
59
|
+
.map(() => Array(this.numCols).fill(undefined));
|
|
54
60
|
}
|
|
55
61
|
/**
|
|
56
62
|
* Checks if the matrix is empty (has zero dimensions).
|
|
@@ -198,7 +204,7 @@ class Matrix extends base_collection_1.BaseCollection {
|
|
|
198
204
|
* Converts the matrix to a 2D array.
|
|
199
205
|
*/
|
|
200
206
|
toArray() {
|
|
201
|
-
return this.data.map(row => [...row]);
|
|
207
|
+
return this.data.map((row) => [...row]);
|
|
202
208
|
}
|
|
203
209
|
/**
|
|
204
210
|
* Checks if this matrix equals another matrix.
|
|
@@ -231,7 +237,7 @@ class Matrix extends base_collection_1.BaseCollection {
|
|
|
231
237
|
if (col < 0 || col >= this.numCols) {
|
|
232
238
|
return [];
|
|
233
239
|
}
|
|
234
|
-
return this.data.map(row => row[col]);
|
|
240
|
+
return this.data.map((row) => row[col]);
|
|
235
241
|
}
|
|
236
242
|
/**
|
|
237
243
|
* Sets values for an entire row.
|
|
@@ -335,7 +341,9 @@ class Matrix extends base_collection_1.BaseCollection {
|
|
|
335
341
|
* Resizes the matrix to new dimensions, preserving existing values where possible.
|
|
336
342
|
*/
|
|
337
343
|
resize(rows, cols) {
|
|
338
|
-
const newData = Array(rows)
|
|
344
|
+
const newData = Array(rows)
|
|
345
|
+
.fill(null)
|
|
346
|
+
.map(() => Array(cols).fill(undefined));
|
|
339
347
|
const minRows = Math.min(rows, this.numRows);
|
|
340
348
|
const minCols = Math.min(cols, this.numCols);
|
|
341
349
|
for (let i = 0; i < minRows; i++) {
|