data-structure-typed 1.34.8 → 1.35.0

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.
Files changed (142) hide show
  1. package/.eslintrc.js +1 -0
  2. package/.github/ISSUE_TEMPLATE/bug_report.md +38 -0
  3. package/.github/ISSUE_TEMPLATE/custom.md +10 -0
  4. package/.github/ISSUE_TEMPLATE/feature_request.md +20 -0
  5. package/CHANGELOG.md +1 -1
  6. package/CONTRIBUTING.md +0 -0
  7. package/README.md +8 -8
  8. package/dist/data-structures/binary-tree/aa-tree.js +2 -5
  9. package/dist/data-structures/binary-tree/aa-tree.js.map +1 -1
  10. package/dist/data-structures/binary-tree/abstract-binary-tree.js +280 -423
  11. package/dist/data-structures/binary-tree/abstract-binary-tree.js.map +1 -1
  12. package/dist/data-structures/binary-tree/avl-tree.js +63 -89
  13. package/dist/data-structures/binary-tree/avl-tree.js.map +1 -1
  14. package/dist/data-structures/binary-tree/b-tree.js +2 -5
  15. package/dist/data-structures/binary-tree/b-tree.js.map +1 -1
  16. package/dist/data-structures/binary-tree/binary-indexed-tree.js +17 -22
  17. package/dist/data-structures/binary-tree/binary-indexed-tree.js.map +1 -1
  18. package/dist/data-structures/binary-tree/binary-tree.js +11 -30
  19. package/dist/data-structures/binary-tree/binary-tree.js.map +1 -1
  20. package/dist/data-structures/binary-tree/bst.js +127 -214
  21. package/dist/data-structures/binary-tree/bst.js.map +1 -1
  22. package/dist/data-structures/binary-tree/rb-tree.js +19 -43
  23. package/dist/data-structures/binary-tree/rb-tree.js.map +1 -1
  24. package/dist/data-structures/binary-tree/segment-tree.js +80 -122
  25. package/dist/data-structures/binary-tree/segment-tree.js.map +1 -1
  26. package/dist/data-structures/binary-tree/splay-tree.js +2 -5
  27. package/dist/data-structures/binary-tree/splay-tree.js.map +1 -1
  28. package/dist/data-structures/binary-tree/tree-multiset.js +147 -218
  29. package/dist/data-structures/binary-tree/tree-multiset.js.map +1 -1
  30. package/dist/data-structures/binary-tree/two-three-tree.js +2 -5
  31. package/dist/data-structures/binary-tree/two-three-tree.js.map +1 -1
  32. package/dist/data-structures/graph/abstract-graph.js +338 -572
  33. package/dist/data-structures/graph/abstract-graph.js.map +1 -1
  34. package/dist/data-structures/graph/directed-graph.js +145 -275
  35. package/dist/data-structures/graph/directed-graph.js.map +1 -1
  36. package/dist/data-structures/graph/map-graph.js +46 -87
  37. package/dist/data-structures/graph/map-graph.js.map +1 -1
  38. package/dist/data-structures/graph/undirected-graph.js +90 -179
  39. package/dist/data-structures/graph/undirected-graph.js.map +1 -1
  40. package/dist/data-structures/hash/coordinate-map.js +23 -45
  41. package/dist/data-structures/hash/coordinate-map.js.map +1 -1
  42. package/dist/data-structures/hash/coordinate-set.js +20 -42
  43. package/dist/data-structures/hash/coordinate-set.js.map +1 -1
  44. package/dist/data-structures/hash/hash-map.js +85 -247
  45. package/dist/data-structures/hash/hash-map.js.map +1 -1
  46. package/dist/data-structures/hash/hash-table.js +87 -128
  47. package/dist/data-structures/hash/hash-table.js.map +1 -1
  48. package/dist/data-structures/hash/pair.js +2 -5
  49. package/dist/data-structures/hash/pair.js.map +1 -1
  50. package/dist/data-structures/hash/tree-map.js +2 -5
  51. package/dist/data-structures/hash/tree-map.js.map +1 -1
  52. package/dist/data-structures/hash/tree-set.js +2 -5
  53. package/dist/data-structures/hash/tree-set.js.map +1 -1
  54. package/dist/data-structures/heap/heap.js +56 -80
  55. package/dist/data-structures/heap/heap.js.map +1 -1
  56. package/dist/data-structures/heap/max-heap.js +8 -26
  57. package/dist/data-structures/heap/max-heap.js.map +1 -1
  58. package/dist/data-structures/heap/min-heap.js +8 -26
  59. package/dist/data-structures/heap/min-heap.js.map +1 -1
  60. package/dist/data-structures/linked-list/doubly-linked-list.js +149 -218
  61. package/dist/data-structures/linked-list/doubly-linked-list.js.map +1 -1
  62. package/dist/data-structures/linked-list/singly-linked-list.js +119 -218
  63. package/dist/data-structures/linked-list/singly-linked-list.js.map +1 -1
  64. package/dist/data-structures/linked-list/skip-linked-list.js +50 -70
  65. package/dist/data-structures/linked-list/skip-linked-list.js.map +1 -1
  66. package/dist/data-structures/matrix/matrix.js +7 -8
  67. package/dist/data-structures/matrix/matrix.js.map +1 -1
  68. package/dist/data-structures/matrix/matrix2d.js +57 -70
  69. package/dist/data-structures/matrix/matrix2d.js.map +1 -1
  70. package/dist/data-structures/matrix/navigator.js +18 -37
  71. package/dist/data-structures/matrix/navigator.js.map +1 -1
  72. package/dist/data-structures/matrix/vector2d.js +63 -84
  73. package/dist/data-structures/matrix/vector2d.js.map +1 -1
  74. package/dist/data-structures/priority-queue/max-priority-queue.js +13 -41
  75. package/dist/data-structures/priority-queue/max-priority-queue.js.map +1 -1
  76. package/dist/data-structures/priority-queue/min-priority-queue.js +13 -41
  77. package/dist/data-structures/priority-queue/min-priority-queue.js.map +1 -1
  78. package/dist/data-structures/priority-queue/priority-queue.js +93 -139
  79. package/dist/data-structures/priority-queue/priority-queue.js.map +1 -1
  80. package/dist/data-structures/queue/deque.js +82 -128
  81. package/dist/data-structures/queue/deque.js.map +1 -1
  82. package/dist/data-structures/queue/queue.js +57 -157
  83. package/dist/data-structures/queue/queue.js.map +1 -1
  84. package/dist/data-structures/stack/stack.js +21 -22
  85. package/dist/data-structures/stack/stack.js.map +1 -1
  86. package/dist/data-structures/tree/tree.js +32 -45
  87. package/dist/data-structures/tree/tree.js.map +1 -1
  88. package/dist/data-structures/trie/trie.js +93 -200
  89. package/dist/data-structures/trie/trie.js.map +1 -1
  90. package/dist/types/data-structures/abstract-binary-tree.js.map +1 -1
  91. package/dist/utils/utils.js +22 -107
  92. package/dist/utils/utils.js.map +1 -1
  93. package/lib/data-structures/binary-tree/abstract-binary-tree.d.ts +79 -78
  94. package/lib/data-structures/binary-tree/abstract-binary-tree.js +61 -141
  95. package/lib/data-structures/binary-tree/avl-tree.d.ts +9 -0
  96. package/lib/data-structures/binary-tree/avl-tree.js +22 -0
  97. package/lib/data-structures/binary-tree/bst.d.ts +3 -3
  98. package/lib/data-structures/binary-tree/bst.js +12 -15
  99. package/lib/data-structures/binary-tree/tree-multiset.d.ts +16 -18
  100. package/lib/data-structures/binary-tree/tree-multiset.js +26 -36
  101. package/lib/data-structures/graph/abstract-graph.d.ts +2 -2
  102. package/lib/data-structures/graph/abstract-graph.js +5 -5
  103. package/lib/data-structures/priority-queue/priority-queue.d.ts +3 -3
  104. package/lib/data-structures/priority-queue/priority-queue.js +3 -3
  105. package/lib/interfaces/abstract-binary-tree.d.ts +1 -83
  106. package/lib/interfaces/abstract-graph.d.ts +2 -14
  107. package/lib/interfaces/avl-tree.d.ts +3 -4
  108. package/lib/interfaces/binary-tree.d.ts +4 -2
  109. package/lib/interfaces/bst.d.ts +2 -12
  110. package/lib/interfaces/directed-graph.d.ts +0 -9
  111. package/lib/interfaces/rb-tree.d.ts +2 -3
  112. package/lib/interfaces/tree-multiset.d.ts +5 -4
  113. package/lib/interfaces/undirected-graph.d.ts +0 -2
  114. package/lib/types/data-structures/abstract-binary-tree.js +0 -1
  115. package/package.json +7 -7
  116. package/src/data-structures/binary-tree/abstract-binary-tree.ts +151 -203
  117. package/src/data-structures/binary-tree/avl-tree.ts +29 -0
  118. package/src/data-structures/binary-tree/bst.ts +12 -15
  119. package/src/data-structures/binary-tree/tree-multiset.ts +27 -39
  120. package/src/data-structures/graph/abstract-graph.ts +5 -5
  121. package/src/data-structures/priority-queue/priority-queue.ts +3 -3
  122. package/src/interfaces/abstract-binary-tree.ts +2 -183
  123. package/src/interfaces/abstract-graph.ts +2 -26
  124. package/src/interfaces/avl-tree.ts +4 -21
  125. package/src/interfaces/binary-tree.ts +3 -2
  126. package/src/interfaces/bst.ts +2 -27
  127. package/src/interfaces/directed-graph.ts +1 -18
  128. package/src/interfaces/rb-tree.ts +2 -5
  129. package/src/interfaces/tree-multiset.ts +4 -4
  130. package/src/interfaces/undirected-graph.ts +1 -4
  131. package/src/types/data-structures/abstract-binary-tree.ts +0 -1
  132. package/test/integration/avl-tree.test.ts +24 -24
  133. package/test/integration/bst.test.ts +71 -71
  134. package/test/unit/data-structures/binary-tree/avl-tree.test.ts +4 -4
  135. package/test/unit/data-structures/binary-tree/binary-tree.test.ts +1 -9
  136. package/test/unit/data-structures/binary-tree/bst.test.ts +8 -8
  137. package/test/unit/data-structures/binary-tree/overall.test.ts +1 -1
  138. package/test/unit/data-structures/binary-tree/tree-multiset.test.ts +9 -9
  139. package/test/unit/data-structures/linked-list/doubly-linked-list.test.ts +1 -1
  140. package/test/unit/data-structures/priority-queue/priority-queue.test.ts +4 -4
  141. package/umd/bundle.min.js +1 -1
  142. 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
- var types_1 = require("../../types");
20
- var bst_1 = require("./bst");
21
- var RBTreeNode = (function (_super) {
22
- __extends(RBTreeNode, _super);
23
- function RBTreeNode(key, val) {
24
- var _this = _super.call(this, key, val) || this;
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
- Object.defineProperty(RBTreeNode.prototype, "color", {
29
- get: function () {
30
- return this._color;
31
- },
32
- set: function (value) {
33
- this._color = value;
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
- var RBTree = (function (_super) {
42
- __extends(RBTree, _super);
43
- function RBTree(options) {
44
- return _super.call(this, options) || this;
19
+ class RBTree extends bst_1.BST {
20
+ constructor(options) {
21
+ super(options);
45
22
  }
46
- RBTree.prototype.createNode = function (key, val) {
23
+ createNode(key, val) {
47
24
  return new RBTreeNode(key, val);
48
- };
49
- return RBTree;
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":";;;;;;;;;;;;;;;;;;AAAA,qCAAwF;AAExF,6BAAmC;AAEnC;IACU,8BAAoB;IAK5B,oBAAY,GAAsB,EAAE,GAAO;QAA3C,YACE,kBAAM,GAAG,EAAE,GAAG,CAAC,SAEhB;QADC,KAAI,CAAC,MAAM,GAAG,eAAO,CAAC,GAAG,CAAC;;IAC5B,CAAC;IAED,sBAAI,6BAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;aAED,UAAU,KAAc;YACtB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;;;OAJA;IAKH,iBAAC;AAAD,CAAC,AAlBD,CACU,aAAO,GAiBhB;AAlBY,gCAAU;AAoBvB;IAA4E,0BAAM;IAChF,gBAAY,OAAuB;eACjC,kBAAM,OAAO,CAAC;IAChB,CAAC;IAEQ,2BAAU,GAAnB,UAAoB,GAAsB,EAAE,GAAc;QACxD,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,GAAG,CAAM,CAAC;IACvC,CAAC;IA8UH,aAAC;AAAD,CAAC,AArVD,CAA4E,SAAG,GAqV9E;AArVY,wBAAM"}
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
- var SegmentTreeNode = (function () {
5
- function SegmentTreeNode(start, end, sum, val) {
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
- Object.defineProperty(SegmentTreeNode.prototype, "start", {
18
- get: function () {
19
- return this._start;
20
- },
21
- set: function (v) {
22
- this._start = v;
23
- },
24
- enumerable: false,
25
- configurable: true
26
- });
27
- Object.defineProperty(SegmentTreeNode.prototype, "end", {
28
- get: function () {
29
- return this._end;
30
- },
31
- set: function (v) {
32
- this._end = v;
33
- },
34
- enumerable: false,
35
- configurable: true
36
- });
37
- Object.defineProperty(SegmentTreeNode.prototype, "val", {
38
- get: function () {
39
- return this._val;
40
- },
41
- set: function (v) {
42
- this._val = v;
43
- },
44
- enumerable: false,
45
- configurable: true
46
- });
47
- Object.defineProperty(SegmentTreeNode.prototype, "sum", {
48
- get: function () {
49
- return this._sum;
50
- },
51
- set: function (v) {
52
- this._sum = v;
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
- var SegmentTree = (function () {
81
- function SegmentTree(values, start, end) {
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
- Object.defineProperty(SegmentTree.prototype, "values", {
98
- get: function () {
99
- return this._values;
100
- },
101
- enumerable: false,
102
- configurable: true
103
- });
104
- Object.defineProperty(SegmentTree.prototype, "start", {
105
- get: function () {
106
- return this._start;
107
- },
108
- enumerable: false,
109
- configurable: true
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
- var mid = start + Math.floor((end - start) / 2);
132
- var left = this.build(start, mid);
133
- var right = this.build(mid + 1, end);
134
- var cur = new SegmentTreeNode(start, end, left.sum + right.sum);
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
- SegmentTree.prototype.updateNode = function (index, sum, val) {
140
- var root = this.root || null;
97
+ }
98
+ updateNode(index, sum, val) {
99
+ const root = this.root || null;
141
100
  if (!root) {
142
101
  return;
143
102
  }
144
- var dfs = function (cur, index, sum, val) {
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
- var mid = cur.start + Math.floor((cur.end - cur.start) / 2);
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
- SegmentTree.prototype.querySumByRange = function (indexA, indexB) {
169
- var root = this.root || null;
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
- var dfs = function (cur, i, j) {
135
+ const dfs = (cur, i, j) => {
177
136
  if (i <= cur.start && j >= cur.end) {
178
137
  return cur.sum;
179
138
  }
180
- var mid = cur.start + Math.floor((cur.end - cur.start) / 2);
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
- var leftSum = 0;
199
- var rightSum = 0;
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
- SegmentTree.prototype._setValues = function (value) {
169
+ }
170
+ _setValues(value) {
212
171
  this._values = value;
213
- };
214
- SegmentTree.prototype._setStart = function (value) {
172
+ }
173
+ _setStart(value) {
215
174
  this._start = value;
216
- };
217
- SegmentTree.prototype._setEnd = function (value) {
175
+ }
176
+ _setEnd(value) {
218
177
  this._end = value;
219
- };
220
- SegmentTree.prototype._setRoot = function (v) {
178
+ }
179
+ _setRoot(v) {
221
180
  this._root = v;
222
- };
223
- return SegmentTree;
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;IACE,yBAAY,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,sBAAI,kCAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;aAED,UAAU,CAAS;YACjB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,CAAC;;;OAJA;IAQD,sBAAI,gCAAG;aAAP;YACE,OAAO,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;aAED,UAAQ,CAAS;YACf,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QAChB,CAAC;;;OAJA;IAQD,sBAAI,gCAAG;aAAP;YACE,OAAO,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;aAED,UAAQ,CAA4B;YAClC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QAChB,CAAC;;;OAJA;IAQD,sBAAI,gCAAG;aAAP;YACE,OAAO,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;aAED,UAAQ,CAAS;YACf,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QAChB,CAAC;;;OAJA;IAQD,sBAAI,iCAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;aAED,UAAS,CAAyB;YAChC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACjB,CAAC;;;OAJA;IAQD,sBAAI,kCAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;aAED,UAAU,CAAyB;YACjC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,CAAC;;;OAJA;IAKH,sBAAC;AAAD,CAAC,AAlED,IAkEC;AAlEY,0CAAe;AAoE5B;IAUE,qBAAY,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,sBAAI,+BAAM;aAAV;YACE,OAAO,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;;;OAAA;IAGD,sBAAI,8BAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;;;OAAA;IAID,sBAAI,4BAAG;aAAP;YACE,OAAO,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;;;OAAA;IAID,sBAAI,6BAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;;;OAAA;IAWD,2BAAK,GAAL,UAAM,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,IAAM,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,IAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACpC,IAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACvC,IAAM,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,gCAAU,GAAV,UAAW,KAAa,EAAE,GAAW,EAAE,GAAwB;QAC7D,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE;YACT,OAAO;SACR;QACD,IAAM,GAAG,GAAG,UAAC,GAAoB,EAAE,KAAa,EAAE,GAAW,EAAE,GAAwB;YACrF,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,IAAM,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,qCAAe,GAAf,UAAgB,MAAc,EAAE,MAAc;QAC5C,IAAM,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,IAAM,GAAG,GAAG,UAAC,GAAoB,EAAE,CAAS,EAAE,CAAS;YACrD,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE;gBAElC,OAAO,GAAG,CAAC,GAAG,CAAC;aAChB;YACD,IAAM,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,gCAAU,GAApB,UAAqB,KAAe;QAClC,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;IACvB,CAAC;IAES,+BAAS,GAAnB,UAAoB,KAAa;QAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAES,6BAAO,GAAjB,UAAkB,KAAa;QAC7B,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;IACpB,CAAC;IAES,8BAAQ,GAAlB,UAAmB,CAAyB;QAC1C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IACH,kBAAC;AAAD,CAAC,AAlLD,IAkLC;AAlLY,kCAAW"}
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
- var SplayTree = (function () {
5
- function SplayTree() {
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;IAAA;IAAwB,CAAC;IAAD,gBAAC;AAAD,CAAC,AAAzB,IAAyB;AAAZ,8BAAS"}
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"}