data-structure-typed 1.34.8 → 1.34.9
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/.eslintrc.js +1 -0
- package/CHANGELOG.md +1 -1
- package/CONTRIBUTING.md +0 -0
- package/README.md +8 -8
- package/dist/data-structures/binary-tree/aa-tree.js +2 -5
- package/dist/data-structures/binary-tree/aa-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/abstract-binary-tree.js +280 -423
- package/dist/data-structures/binary-tree/abstract-binary-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/avl-tree.js +63 -89
- package/dist/data-structures/binary-tree/avl-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/b-tree.js +2 -5
- package/dist/data-structures/binary-tree/b-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/binary-indexed-tree.js +17 -22
- package/dist/data-structures/binary-tree/binary-indexed-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/binary-tree.js +11 -30
- package/dist/data-structures/binary-tree/binary-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/bst.js +127 -214
- package/dist/data-structures/binary-tree/bst.js.map +1 -1
- package/dist/data-structures/binary-tree/rb-tree.js +19 -43
- package/dist/data-structures/binary-tree/rb-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/segment-tree.js +80 -122
- package/dist/data-structures/binary-tree/segment-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/splay-tree.js +2 -5
- package/dist/data-structures/binary-tree/splay-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/tree-multiset.js +147 -218
- package/dist/data-structures/binary-tree/tree-multiset.js.map +1 -1
- package/dist/data-structures/binary-tree/two-three-tree.js +2 -5
- package/dist/data-structures/binary-tree/two-three-tree.js.map +1 -1
- package/dist/data-structures/graph/abstract-graph.js +338 -572
- package/dist/data-structures/graph/abstract-graph.js.map +1 -1
- package/dist/data-structures/graph/directed-graph.js +145 -275
- package/dist/data-structures/graph/directed-graph.js.map +1 -1
- package/dist/data-structures/graph/map-graph.js +46 -87
- package/dist/data-structures/graph/map-graph.js.map +1 -1
- package/dist/data-structures/graph/undirected-graph.js +90 -179
- package/dist/data-structures/graph/undirected-graph.js.map +1 -1
- package/dist/data-structures/hash/coordinate-map.js +23 -45
- package/dist/data-structures/hash/coordinate-map.js.map +1 -1
- package/dist/data-structures/hash/coordinate-set.js +20 -42
- package/dist/data-structures/hash/coordinate-set.js.map +1 -1
- package/dist/data-structures/hash/hash-map.js +85 -247
- package/dist/data-structures/hash/hash-map.js.map +1 -1
- package/dist/data-structures/hash/hash-table.js +87 -128
- package/dist/data-structures/hash/hash-table.js.map +1 -1
- package/dist/data-structures/hash/pair.js +2 -5
- package/dist/data-structures/hash/pair.js.map +1 -1
- package/dist/data-structures/hash/tree-map.js +2 -5
- package/dist/data-structures/hash/tree-map.js.map +1 -1
- package/dist/data-structures/hash/tree-set.js +2 -5
- package/dist/data-structures/hash/tree-set.js.map +1 -1
- package/dist/data-structures/heap/heap.js +56 -80
- package/dist/data-structures/heap/heap.js.map +1 -1
- package/dist/data-structures/heap/max-heap.js +8 -26
- package/dist/data-structures/heap/max-heap.js.map +1 -1
- package/dist/data-structures/heap/min-heap.js +8 -26
- package/dist/data-structures/heap/min-heap.js.map +1 -1
- package/dist/data-structures/linked-list/doubly-linked-list.js +149 -218
- package/dist/data-structures/linked-list/doubly-linked-list.js.map +1 -1
- package/dist/data-structures/linked-list/singly-linked-list.js +119 -218
- package/dist/data-structures/linked-list/singly-linked-list.js.map +1 -1
- package/dist/data-structures/linked-list/skip-linked-list.js +50 -70
- package/dist/data-structures/linked-list/skip-linked-list.js.map +1 -1
- package/dist/data-structures/matrix/matrix.js +7 -8
- package/dist/data-structures/matrix/matrix.js.map +1 -1
- package/dist/data-structures/matrix/matrix2d.js +57 -70
- package/dist/data-structures/matrix/matrix2d.js.map +1 -1
- package/dist/data-structures/matrix/navigator.js +18 -37
- package/dist/data-structures/matrix/navigator.js.map +1 -1
- package/dist/data-structures/matrix/vector2d.js +63 -84
- package/dist/data-structures/matrix/vector2d.js.map +1 -1
- package/dist/data-structures/priority-queue/max-priority-queue.js +13 -41
- package/dist/data-structures/priority-queue/max-priority-queue.js.map +1 -1
- package/dist/data-structures/priority-queue/min-priority-queue.js +13 -41
- package/dist/data-structures/priority-queue/min-priority-queue.js.map +1 -1
- package/dist/data-structures/priority-queue/priority-queue.js +93 -139
- package/dist/data-structures/priority-queue/priority-queue.js.map +1 -1
- package/dist/data-structures/queue/deque.js +82 -128
- package/dist/data-structures/queue/deque.js.map +1 -1
- package/dist/data-structures/queue/queue.js +57 -157
- package/dist/data-structures/queue/queue.js.map +1 -1
- package/dist/data-structures/stack/stack.js +21 -22
- package/dist/data-structures/stack/stack.js.map +1 -1
- package/dist/data-structures/tree/tree.js +32 -45
- package/dist/data-structures/tree/tree.js.map +1 -1
- package/dist/data-structures/trie/trie.js +93 -200
- package/dist/data-structures/trie/trie.js.map +1 -1
- package/dist/types/data-structures/abstract-binary-tree.js.map +1 -1
- package/dist/utils/utils.js +22 -107
- package/dist/utils/utils.js.map +1 -1
- package/lib/data-structures/binary-tree/abstract-binary-tree.d.ts +79 -78
- package/lib/data-structures/binary-tree/abstract-binary-tree.js +61 -141
- package/lib/data-structures/binary-tree/avl-tree.d.ts +9 -0
- package/lib/data-structures/binary-tree/avl-tree.js +22 -0
- package/lib/data-structures/binary-tree/bst.d.ts +3 -3
- package/lib/data-structures/binary-tree/bst.js +12 -15
- package/lib/data-structures/binary-tree/tree-multiset.d.ts +16 -18
- package/lib/data-structures/binary-tree/tree-multiset.js +26 -36
- package/lib/data-structures/graph/abstract-graph.d.ts +2 -2
- package/lib/data-structures/graph/abstract-graph.js +5 -5
- package/lib/data-structures/priority-queue/priority-queue.d.ts +3 -3
- package/lib/data-structures/priority-queue/priority-queue.js +3 -3
- package/lib/interfaces/abstract-binary-tree.d.ts +23 -28
- package/lib/interfaces/avl-tree.d.ts +3 -1
- package/lib/interfaces/bst.d.ts +2 -1
- package/lib/types/data-structures/abstract-binary-tree.js +0 -1
- package/package.json +6 -6
- package/src/data-structures/binary-tree/abstract-binary-tree.ts +151 -203
- package/src/data-structures/binary-tree/avl-tree.ts +29 -0
- package/src/data-structures/binary-tree/bst.ts +12 -15
- package/src/data-structures/binary-tree/tree-multiset.ts +27 -39
- package/src/data-structures/graph/abstract-graph.ts +5 -5
- package/src/data-structures/priority-queue/priority-queue.ts +3 -3
- package/src/interfaces/abstract-binary-tree.ts +23 -36
- package/src/interfaces/avl-tree.ts +3 -1
- package/src/interfaces/bst.ts +1 -1
- package/src/types/data-structures/abstract-binary-tree.ts +0 -1
- package/test/integration/avl-tree.test.ts +24 -24
- package/test/integration/bst.test.ts +71 -71
- package/test/unit/data-structures/binary-tree/avl-tree.test.ts +4 -4
- package/test/unit/data-structures/binary-tree/binary-tree.test.ts +1 -9
- package/test/unit/data-structures/binary-tree/bst.test.ts +8 -8
- package/test/unit/data-structures/binary-tree/overall.test.ts +1 -1
- package/test/unit/data-structures/binary-tree/tree-multiset.test.ts +9 -9
- package/test/unit/data-structures/priority-queue/priority-queue.test.ts +4 -4
- package/umd/bundle.min.js +1 -1
- package/umd/bundle.min.js.map +1 -1
|
@@ -1,52 +1,28 @@
|
|
|
1
1
|
"use strict";
|
|
2
|
-
var __extends = (this && this.__extends) || (function () {
|
|
3
|
-
var extendStatics = function (d, b) {
|
|
4
|
-
extendStatics = Object.setPrototypeOf ||
|
|
5
|
-
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
|
6
|
-
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
|
7
|
-
return extendStatics(d, b);
|
|
8
|
-
};
|
|
9
|
-
return function (d, b) {
|
|
10
|
-
if (typeof b !== "function" && b !== null)
|
|
11
|
-
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
|
12
|
-
extendStatics(d, b);
|
|
13
|
-
function __() { this.constructor = d; }
|
|
14
|
-
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
15
|
-
};
|
|
16
|
-
})();
|
|
17
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
18
3
|
exports.RBTree = exports.RBTreeNode = void 0;
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
_this._color = types_1.RBColor.RED;
|
|
26
|
-
return _this;
|
|
4
|
+
const types_1 = require("../../types");
|
|
5
|
+
const bst_1 = require("./bst");
|
|
6
|
+
class RBTreeNode extends bst_1.BSTNode {
|
|
7
|
+
constructor(key, val) {
|
|
8
|
+
super(key, val);
|
|
9
|
+
this._color = types_1.RBColor.RED;
|
|
27
10
|
}
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
enumerable: false,
|
|
36
|
-
configurable: true
|
|
37
|
-
});
|
|
38
|
-
return RBTreeNode;
|
|
39
|
-
}(bst_1.BSTNode));
|
|
11
|
+
get color() {
|
|
12
|
+
return this._color;
|
|
13
|
+
}
|
|
14
|
+
set color(value) {
|
|
15
|
+
this._color = value;
|
|
16
|
+
}
|
|
17
|
+
}
|
|
40
18
|
exports.RBTreeNode = RBTreeNode;
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
return _super.call(this, options) || this;
|
|
19
|
+
class RBTree extends bst_1.BST {
|
|
20
|
+
constructor(options) {
|
|
21
|
+
super(options);
|
|
45
22
|
}
|
|
46
|
-
|
|
23
|
+
createNode(key, val) {
|
|
47
24
|
return new RBTreeNode(key, val);
|
|
48
|
-
}
|
|
49
|
-
|
|
50
|
-
}(bst_1.BST));
|
|
25
|
+
}
|
|
26
|
+
}
|
|
51
27
|
exports.RBTree = RBTree;
|
|
52
28
|
//# sourceMappingURL=rb-tree.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"rb-tree.js","sourceRoot":"","sources":["../../../src/data-structures/binary-tree/rb-tree.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"rb-tree.js","sourceRoot":"","sources":["../../../src/data-structures/binary-tree/rb-tree.ts"],"names":[],"mappings":";;;AAAA,uCAAwF;AAExF,+BAAmC;AAEnC,MAAa,UACX,SAAQ,aAAoB;IAK5B,YAAY,GAAsB,EAAE,GAAO;QACzC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,MAAM,GAAG,eAAO,CAAC,GAAG,CAAC;IAC5B,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,CAAC,KAAc;QACtB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;CACF;AAlBD,gCAkBC;AAED,MAAa,MAAuD,SAAQ,SAAM;IAChF,YAAY,OAAuB;QACjC,KAAK,CAAC,OAAO,CAAC,CAAC;IACjB,CAAC;IAEQ,UAAU,CAAC,GAAsB,EAAE,GAAc;QACxD,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,GAAG,CAAM,CAAC;IACvC,CAAC;CA8UF;AArVD,wBAqVC"}
|
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
3
|
exports.SegmentTree = exports.SegmentTreeNode = void 0;
|
|
4
|
-
|
|
5
|
-
|
|
4
|
+
class SegmentTreeNode {
|
|
5
|
+
constructor(start, end, sum, val) {
|
|
6
6
|
this._start = 0;
|
|
7
7
|
this._end = 0;
|
|
8
8
|
this._val = null;
|
|
@@ -14,71 +14,46 @@ var SegmentTreeNode = (function () {
|
|
|
14
14
|
this._sum = sum;
|
|
15
15
|
this._val = val || null;
|
|
16
16
|
}
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
}
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
enumerable: false,
|
|
55
|
-
configurable: true
|
|
56
|
-
});
|
|
57
|
-
Object.defineProperty(SegmentTreeNode.prototype, "left", {
|
|
58
|
-
get: function () {
|
|
59
|
-
return this._left;
|
|
60
|
-
},
|
|
61
|
-
set: function (v) {
|
|
62
|
-
this._left = v;
|
|
63
|
-
},
|
|
64
|
-
enumerable: false,
|
|
65
|
-
configurable: true
|
|
66
|
-
});
|
|
67
|
-
Object.defineProperty(SegmentTreeNode.prototype, "right", {
|
|
68
|
-
get: function () {
|
|
69
|
-
return this._right;
|
|
70
|
-
},
|
|
71
|
-
set: function (v) {
|
|
72
|
-
this._right = v;
|
|
73
|
-
},
|
|
74
|
-
enumerable: false,
|
|
75
|
-
configurable: true
|
|
76
|
-
});
|
|
77
|
-
return SegmentTreeNode;
|
|
78
|
-
}());
|
|
17
|
+
get start() {
|
|
18
|
+
return this._start;
|
|
19
|
+
}
|
|
20
|
+
set start(v) {
|
|
21
|
+
this._start = v;
|
|
22
|
+
}
|
|
23
|
+
get end() {
|
|
24
|
+
return this._end;
|
|
25
|
+
}
|
|
26
|
+
set end(v) {
|
|
27
|
+
this._end = v;
|
|
28
|
+
}
|
|
29
|
+
get val() {
|
|
30
|
+
return this._val;
|
|
31
|
+
}
|
|
32
|
+
set val(v) {
|
|
33
|
+
this._val = v;
|
|
34
|
+
}
|
|
35
|
+
get sum() {
|
|
36
|
+
return this._sum;
|
|
37
|
+
}
|
|
38
|
+
set sum(v) {
|
|
39
|
+
this._sum = v;
|
|
40
|
+
}
|
|
41
|
+
get left() {
|
|
42
|
+
return this._left;
|
|
43
|
+
}
|
|
44
|
+
set left(v) {
|
|
45
|
+
this._left = v;
|
|
46
|
+
}
|
|
47
|
+
get right() {
|
|
48
|
+
return this._right;
|
|
49
|
+
}
|
|
50
|
+
set right(v) {
|
|
51
|
+
this._right = v;
|
|
52
|
+
}
|
|
53
|
+
}
|
|
79
54
|
exports.SegmentTreeNode = SegmentTreeNode;
|
|
80
|
-
|
|
81
|
-
|
|
55
|
+
class SegmentTree {
|
|
56
|
+
constructor(values, start, end) {
|
|
82
57
|
this._values = [];
|
|
83
58
|
this._start = 0;
|
|
84
59
|
start = start || 0;
|
|
@@ -94,61 +69,45 @@ var SegmentTree = (function () {
|
|
|
94
69
|
this._values = [];
|
|
95
70
|
}
|
|
96
71
|
}
|
|
97
|
-
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
|
|
108
|
-
|
|
109
|
-
|
|
110
|
-
});
|
|
111
|
-
Object.defineProperty(SegmentTree.prototype, "end", {
|
|
112
|
-
get: function () {
|
|
113
|
-
return this._end;
|
|
114
|
-
},
|
|
115
|
-
enumerable: false,
|
|
116
|
-
configurable: true
|
|
117
|
-
});
|
|
118
|
-
Object.defineProperty(SegmentTree.prototype, "root", {
|
|
119
|
-
get: function () {
|
|
120
|
-
return this._root;
|
|
121
|
-
},
|
|
122
|
-
enumerable: false,
|
|
123
|
-
configurable: true
|
|
124
|
-
});
|
|
125
|
-
SegmentTree.prototype.build = function (start, end) {
|
|
72
|
+
get values() {
|
|
73
|
+
return this._values;
|
|
74
|
+
}
|
|
75
|
+
get start() {
|
|
76
|
+
return this._start;
|
|
77
|
+
}
|
|
78
|
+
get end() {
|
|
79
|
+
return this._end;
|
|
80
|
+
}
|
|
81
|
+
get root() {
|
|
82
|
+
return this._root;
|
|
83
|
+
}
|
|
84
|
+
build(start, end) {
|
|
126
85
|
if (start > end) {
|
|
127
86
|
return new SegmentTreeNode(start, end, 0);
|
|
128
87
|
}
|
|
129
88
|
if (start === end)
|
|
130
89
|
return new SegmentTreeNode(start, end, this._values[start]);
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
90
|
+
const mid = start + Math.floor((end - start) / 2);
|
|
91
|
+
const left = this.build(start, mid);
|
|
92
|
+
const right = this.build(mid + 1, end);
|
|
93
|
+
const cur = new SegmentTreeNode(start, end, left.sum + right.sum);
|
|
135
94
|
cur.left = left;
|
|
136
95
|
cur.right = right;
|
|
137
96
|
return cur;
|
|
138
|
-
}
|
|
139
|
-
|
|
140
|
-
|
|
97
|
+
}
|
|
98
|
+
updateNode(index, sum, val) {
|
|
99
|
+
const root = this.root || null;
|
|
141
100
|
if (!root) {
|
|
142
101
|
return;
|
|
143
102
|
}
|
|
144
|
-
|
|
103
|
+
const dfs = (cur, index, sum, val) => {
|
|
145
104
|
if (cur.start === cur.end && cur.start === index) {
|
|
146
105
|
cur.sum = sum;
|
|
147
106
|
if (val !== undefined)
|
|
148
107
|
cur.val = val;
|
|
149
108
|
return;
|
|
150
109
|
}
|
|
151
|
-
|
|
110
|
+
const mid = cur.start + Math.floor((cur.end - cur.start) / 2);
|
|
152
111
|
if (index <= mid) {
|
|
153
112
|
if (cur.left) {
|
|
154
113
|
dfs(cur.left, index, sum, val);
|
|
@@ -164,20 +123,20 @@ var SegmentTree = (function () {
|
|
|
164
123
|
}
|
|
165
124
|
};
|
|
166
125
|
dfs(root, index, sum, val);
|
|
167
|
-
}
|
|
168
|
-
|
|
169
|
-
|
|
126
|
+
}
|
|
127
|
+
querySumByRange(indexA, indexB) {
|
|
128
|
+
const root = this.root || null;
|
|
170
129
|
if (!root) {
|
|
171
130
|
return 0;
|
|
172
131
|
}
|
|
173
132
|
if (indexA < 0 || indexB >= this.values.length || indexA > indexB) {
|
|
174
133
|
return NaN;
|
|
175
134
|
}
|
|
176
|
-
|
|
135
|
+
const dfs = (cur, i, j) => {
|
|
177
136
|
if (i <= cur.start && j >= cur.end) {
|
|
178
137
|
return cur.sum;
|
|
179
138
|
}
|
|
180
|
-
|
|
139
|
+
const mid = cur.start + Math.floor((cur.end - cur.start) / 2);
|
|
181
140
|
if (j <= mid) {
|
|
182
141
|
if (cur.left) {
|
|
183
142
|
return dfs(cur.left, i, j);
|
|
@@ -195,8 +154,8 @@ var SegmentTree = (function () {
|
|
|
195
154
|
}
|
|
196
155
|
}
|
|
197
156
|
else {
|
|
198
|
-
|
|
199
|
-
|
|
157
|
+
let leftSum = 0;
|
|
158
|
+
let rightSum = 0;
|
|
200
159
|
if (cur.left) {
|
|
201
160
|
leftSum = dfs(cur.left, i, mid);
|
|
202
161
|
}
|
|
@@ -207,20 +166,19 @@ var SegmentTree = (function () {
|
|
|
207
166
|
}
|
|
208
167
|
};
|
|
209
168
|
return dfs(root, indexA, indexB);
|
|
210
|
-
}
|
|
211
|
-
|
|
169
|
+
}
|
|
170
|
+
_setValues(value) {
|
|
212
171
|
this._values = value;
|
|
213
|
-
}
|
|
214
|
-
|
|
172
|
+
}
|
|
173
|
+
_setStart(value) {
|
|
215
174
|
this._start = value;
|
|
216
|
-
}
|
|
217
|
-
|
|
175
|
+
}
|
|
176
|
+
_setEnd(value) {
|
|
218
177
|
this._end = value;
|
|
219
|
-
}
|
|
220
|
-
|
|
178
|
+
}
|
|
179
|
+
_setRoot(v) {
|
|
221
180
|
this._root = v;
|
|
222
|
-
}
|
|
223
|
-
|
|
224
|
-
}());
|
|
181
|
+
}
|
|
182
|
+
}
|
|
225
183
|
exports.SegmentTree = SegmentTree;
|
|
226
184
|
//# sourceMappingURL=segment-tree.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"segment-tree.js","sourceRoot":"","sources":["../../../src/data-structures/binary-tree/segment-tree.ts"],"names":[],"mappings":";;;AAUA;
|
|
1
|
+
{"version":3,"file":"segment-tree.js","sourceRoot":"","sources":["../../../src/data-structures/binary-tree/segment-tree.ts"],"names":[],"mappings":";;;AAUA,MAAa,eAAe;IAC1B,YAAY,KAAa,EAAE,GAAW,EAAE,GAAW,EAAE,GAA+B;QAO5E,WAAM,GAAG,CAAC,CAAC;QASX,SAAI,GAAG,CAAC,CAAC;QAUT,SAAI,GAA8B,IAAI,CAAC;QAUvC,SAAI,GAAG,CAAC,CAAC;QAUT,UAAK,GAA2B,IAAI,CAAC;QAUrC,WAAM,GAA2B,IAAI,CAAC;QAvD5C,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC;IAC1B,CAAC;IAGD,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,CAAC,CAAS;QACjB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAID,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED,IAAI,GAAG,CAAC,CAAS;QACf,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;IAChB,CAAC;IAID,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED,IAAI,GAAG,CAAC,CAA4B;QAClC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;IAChB,CAAC;IAID,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED,IAAI,GAAG,CAAC,CAAS;QACf,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;IAChB,CAAC;IAID,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,IAAI,CAAC,CAAyB;QAChC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAID,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,CAAC,CAAyB;QACjC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;CACF;AAlED,0CAkEC;AAED,MAAa,WAAW;IAUtB,YAAY,MAAgB,EAAE,KAAc,EAAE,GAAY;QAelD,YAAO,GAAa,EAAE,CAAC;QAMvB,WAAM,GAAG,CAAC,CAAC;QApBjB,KAAK,GAAG,KAAK,IAAI,CAAC,CAAC;QACnB,GAAG,GAAG,GAAG,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAEhB,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YACrB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;SACrC;aAAM;YACL,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;SACnB;IACH,CAAC;IAID,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAGD,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAID,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAID,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAWD,KAAK,CAAC,KAAa,EAAE,GAAW;QAC9B,IAAI,KAAK,GAAG,GAAG,EAAE;YACf,OAAO,IAAI,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;SAC3C;QACD,IAAI,KAAK,KAAK,GAAG;YAAE,OAAO,IAAI,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QAE/E,MAAM,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,IAAI,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QAClE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;QAChB,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;QAClB,OAAO,GAAG,CAAC;IACb,CAAC;IAaD,UAAU,CAAC,KAAa,EAAE,GAAW,EAAE,GAAwB;QAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE;YACT,OAAO;SACR;QACD,MAAM,GAAG,GAAG,CAAC,GAAoB,EAAE,KAAa,EAAE,GAAW,EAAE,GAAwB,EAAE,EAAE;YACzF,IAAI,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,KAAK,EAAE;gBAChD,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;gBACd,IAAI,GAAG,KAAK,SAAS;oBAAE,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;gBACrC,OAAO;aACR;YACD,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,IAAI,KAAK,IAAI,GAAG,EAAE;gBAChB,IAAI,GAAG,CAAC,IAAI,EAAE;oBACZ,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;iBAChC;aACF;iBAAM;gBACL,IAAI,GAAG,CAAC,KAAK,EAAE;oBACb,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;iBACjC;aACF;YACD,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE;gBACzB,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;aACxC;QACH,CAAC,CAAC;QAEF,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC7B,CAAC;IASD,eAAe,CAAC,MAAc,EAAE,MAAc;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE;YACT,OAAO,CAAC,CAAC;SACV;QAED,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,GAAG,MAAM,EAAE;YACjE,OAAO,GAAG,CAAC;SACZ;QAED,MAAM,GAAG,GAAG,CAAC,GAAoB,EAAE,CAAS,EAAE,CAAS,EAAU,EAAE;YACjE,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE;gBAElC,OAAO,GAAG,CAAC,GAAG,CAAC;aAChB;YACD,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,IAAI,CAAC,IAAI,GAAG,EAAE;gBACZ,IAAI,GAAG,CAAC,IAAI,EAAE;oBACZ,OAAO,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;iBAC5B;qBAAM;oBACL,OAAO,GAAG,CAAC;iBACZ;aACF;iBAAM,IAAI,CAAC,GAAG,GAAG,EAAE;gBAClB,IAAI,GAAG,CAAC,KAAK,EAAE;oBACb,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;iBAC7B;qBAAM;oBACL,OAAO,GAAG,CAAC;iBACZ;aACF;iBAAM;gBAEL,IAAI,OAAO,GAAG,CAAC,CAAC;gBAChB,IAAI,QAAQ,GAAG,CAAC,CAAC;gBACjB,IAAI,GAAG,CAAC,IAAI,EAAE;oBACZ,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;iBACjC;gBACD,IAAI,GAAG,CAAC,KAAK,EAAE;oBACb,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;iBACvC;gBACD,OAAO,OAAO,GAAG,QAAQ,CAAC;aAC3B;QACH,CAAC,CAAC;QACF,OAAO,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;IAES,UAAU,CAAC,KAAe;QAClC,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;IACvB,CAAC;IAES,SAAS,CAAC,KAAa;QAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAES,OAAO,CAAC,KAAa;QAC7B,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;IACpB,CAAC;IAES,QAAQ,CAAC,CAAyB;QAC1C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;CACF;AAlLD,kCAkLC"}
|
|
@@ -1,10 +1,7 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
3
|
exports.SplayTree = void 0;
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
}
|
|
7
|
-
return SplayTree;
|
|
8
|
-
}());
|
|
4
|
+
class SplayTree {
|
|
5
|
+
}
|
|
9
6
|
exports.SplayTree = SplayTree;
|
|
10
7
|
//# sourceMappingURL=splay-tree.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"splay-tree.js","sourceRoot":"","sources":["../../../src/data-structures/binary-tree/splay-tree.ts"],"names":[],"mappings":";;;AAAA
|
|
1
|
+
{"version":3,"file":"splay-tree.js","sourceRoot":"","sources":["../../../src/data-structures/binary-tree/splay-tree.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;CAAG;AAAzB,8BAAyB"}
|