data-structure-typed 1.35.1 → 1.40.0-rc

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 (163) hide show
  1. package/dist/data-structures/binary-tree/aa-tree.d.ts +2 -0
  2. package/dist/data-structures/binary-tree/abstract-binary-tree.d.ts +527 -0
  3. package/dist/data-structures/binary-tree/abstract-binary-tree.js +323 -0
  4. package/dist/data-structures/binary-tree/abstract-binary-tree.js.map +1 -1
  5. package/dist/data-structures/binary-tree/avl-tree.d.ts +94 -0
  6. package/dist/data-structures/binary-tree/avl-tree.js +90 -3
  7. package/dist/data-structures/binary-tree/avl-tree.js.map +1 -1
  8. package/dist/data-structures/binary-tree/b-tree.d.ts +2 -0
  9. package/dist/data-structures/binary-tree/binary-indexed-tree.d.ts +46 -0
  10. package/dist/data-structures/binary-tree/binary-indexed-tree.js +36 -0
  11. package/dist/data-structures/binary-tree/binary-indexed-tree.js.map +1 -1
  12. package/dist/data-structures/binary-tree/binary-tree.d.ts +31 -0
  13. package/dist/data-structures/binary-tree/binary-tree.js +21 -0
  14. package/dist/data-structures/binary-tree/binary-tree.js.map +1 -1
  15. package/dist/data-structures/binary-tree/bst.d.ts +133 -0
  16. package/dist/data-structures/binary-tree/bst.js +114 -0
  17. package/dist/data-structures/binary-tree/bst.js.map +1 -1
  18. package/dist/data-structures/binary-tree/index.d.ts +12 -0
  19. package/dist/data-structures/binary-tree/rb-tree.d.ts +13 -0
  20. package/dist/data-structures/binary-tree/segment-tree.d.ts +83 -0
  21. package/dist/data-structures/binary-tree/segment-tree.js +45 -0
  22. package/dist/data-structures/binary-tree/segment-tree.js.map +1 -1
  23. package/dist/data-structures/binary-tree/splay-tree.d.ts +2 -0
  24. package/dist/data-structures/binary-tree/tree-multiset.d.ts +209 -0
  25. package/dist/data-structures/binary-tree/tree-multiset.js +178 -0
  26. package/dist/data-structures/binary-tree/tree-multiset.js.map +1 -1
  27. package/dist/data-structures/binary-tree/two-three-tree.d.ts +2 -0
  28. package/dist/data-structures/graph/abstract-graph.d.ts +332 -0
  29. package/dist/data-structures/graph/abstract-graph.js +269 -4
  30. package/dist/data-structures/graph/abstract-graph.js.map +1 -1
  31. package/dist/data-structures/graph/directed-graph.d.ts +200 -0
  32. package/dist/data-structures/graph/directed-graph.js +167 -0
  33. package/dist/data-structures/graph/directed-graph.js.map +1 -1
  34. package/dist/data-structures/graph/index.d.ts +4 -0
  35. package/dist/data-structures/graph/map-graph.d.ts +79 -0
  36. package/dist/data-structures/graph/map-graph.js +54 -0
  37. package/dist/data-structures/graph/map-graph.js.map +1 -1
  38. package/dist/data-structures/graph/undirected-graph.d.ts +127 -0
  39. package/dist/data-structures/graph/undirected-graph.js +105 -0
  40. package/dist/data-structures/graph/undirected-graph.js.map +1 -1
  41. package/dist/data-structures/hash/coordinate-map.d.ts +45 -0
  42. package/dist/data-structures/hash/coordinate-map.js +35 -0
  43. package/dist/data-structures/hash/coordinate-map.js.map +1 -1
  44. package/dist/data-structures/hash/coordinate-set.d.ts +37 -0
  45. package/dist/data-structures/hash/coordinate-set.js +28 -0
  46. package/dist/data-structures/hash/coordinate-set.js.map +1 -1
  47. package/dist/data-structures/hash/hash-map.d.ts +56 -0
  48. package/dist/data-structures/hash/hash-map.js +29 -1
  49. package/dist/data-structures/hash/hash-map.js.map +1 -1
  50. package/dist/data-structures/hash/hash-table.d.ts +106 -0
  51. package/dist/data-structures/hash/hash-table.js +88 -6
  52. package/dist/data-structures/hash/hash-table.js.map +1 -1
  53. package/dist/data-structures/hash/index.d.ts +7 -0
  54. package/dist/data-structures/hash/pair.d.ts +2 -0
  55. package/dist/data-structures/hash/tree-map.d.ts +2 -0
  56. package/dist/data-structures/hash/tree-set.d.ts +2 -0
  57. package/dist/data-structures/heap/heap.d.ts +83 -0
  58. package/dist/data-structures/heap/heap.js +62 -0
  59. package/dist/data-structures/heap/heap.js.map +1 -1
  60. package/dist/data-structures/heap/index.d.ts +3 -0
  61. package/dist/data-structures/heap/max-heap.d.ts +23 -0
  62. package/dist/data-structures/heap/max-heap.js +16 -0
  63. package/dist/data-structures/heap/max-heap.js.map +1 -1
  64. package/dist/data-structures/heap/min-heap.d.ts +24 -0
  65. package/dist/data-structures/heap/min-heap.js +17 -0
  66. package/dist/data-structures/heap/min-heap.js.map +1 -1
  67. package/dist/data-structures/index.d.ts +11 -0
  68. package/dist/data-structures/linked-list/doubly-linked-list.d.ts +234 -0
  69. package/dist/data-structures/linked-list/doubly-linked-list.js +202 -0
  70. package/dist/data-structures/linked-list/doubly-linked-list.js.map +1 -1
  71. package/dist/data-structures/linked-list/index.d.ts +3 -0
  72. package/dist/data-structures/linked-list/singly-linked-list.d.ts +157 -0
  73. package/dist/data-structures/linked-list/singly-linked-list.js +135 -0
  74. package/dist/data-structures/linked-list/singly-linked-list.js.map +1 -1
  75. package/dist/data-structures/linked-list/skip-linked-list.d.ts +61 -0
  76. package/dist/data-structures/linked-list/skip-linked-list.js +36 -0
  77. package/dist/data-structures/linked-list/skip-linked-list.js.map +1 -1
  78. package/dist/data-structures/matrix/index.d.ts +4 -0
  79. package/dist/data-structures/matrix/matrix.d.ts +21 -0
  80. package/dist/data-structures/matrix/matrix.js +15 -0
  81. package/dist/data-structures/matrix/matrix.js.map +1 -1
  82. package/dist/data-structures/matrix/matrix2d.d.ts +108 -0
  83. package/dist/data-structures/matrix/matrix2d.js +91 -2
  84. package/dist/data-structures/matrix/matrix2d.js.map +1 -1
  85. package/dist/data-structures/matrix/navigator.d.ts +52 -0
  86. package/dist/data-structures/matrix/navigator.js +28 -0
  87. package/dist/data-structures/matrix/navigator.js.map +1 -1
  88. package/dist/data-structures/matrix/vector2d.d.ts +201 -0
  89. package/dist/data-structures/matrix/vector2d.js +188 -1
  90. package/dist/data-structures/matrix/vector2d.js.map +1 -1
  91. package/dist/data-structures/priority-queue/index.d.ts +3 -0
  92. package/dist/data-structures/priority-queue/max-priority-queue.d.ts +15 -0
  93. package/dist/data-structures/priority-queue/max-priority-queue.js +18 -0
  94. package/dist/data-structures/priority-queue/max-priority-queue.js.map +1 -1
  95. package/dist/data-structures/priority-queue/min-priority-queue.d.ts +15 -0
  96. package/dist/data-structures/priority-queue/min-priority-queue.js +19 -0
  97. package/dist/data-structures/priority-queue/min-priority-queue.js.map +1 -1
  98. package/dist/data-structures/priority-queue/priority-queue.d.ts +180 -0
  99. package/dist/data-structures/priority-queue/priority-queue.js +141 -0
  100. package/dist/data-structures/priority-queue/priority-queue.js.map +1 -1
  101. package/dist/data-structures/queue/deque.d.ts +165 -0
  102. package/dist/data-structures/queue/deque.js +124 -0
  103. package/dist/data-structures/queue/deque.js.map +1 -1
  104. package/dist/data-structures/queue/index.d.ts +2 -0
  105. package/dist/data-structures/queue/queue.d.ts +107 -0
  106. package/dist/data-structures/queue/queue.js +80 -0
  107. package/dist/data-structures/queue/queue.js.map +1 -1
  108. package/dist/data-structures/stack/index.d.ts +1 -0
  109. package/dist/data-structures/stack/stack.d.ts +63 -0
  110. package/dist/data-structures/stack/stack.js +50 -0
  111. package/dist/data-structures/stack/stack.js.map +1 -1
  112. package/dist/data-structures/tree/index.d.ts +1 -0
  113. package/dist/data-structures/tree/tree.d.ts +14 -0
  114. package/dist/data-structures/tree/tree.js +1 -0
  115. package/dist/data-structures/tree/tree.js.map +1 -1
  116. package/dist/data-structures/trie/index.d.ts +1 -0
  117. package/dist/data-structures/trie/trie.d.ts +61 -0
  118. package/dist/data-structures/trie/trie.js +36 -0
  119. package/dist/data-structures/trie/trie.js.map +1 -1
  120. package/dist/index.d.ts +4 -0
  121. package/dist/interfaces/abstract-binary-tree.d.ts +7 -0
  122. package/dist/interfaces/abstract-graph.d.ts +5 -0
  123. package/dist/interfaces/avl-tree.d.ts +7 -0
  124. package/dist/interfaces/binary-tree.d.ts +6 -0
  125. package/dist/interfaces/bst.d.ts +6 -0
  126. package/dist/interfaces/directed-graph.d.ts +3 -0
  127. package/dist/interfaces/doubly-linked-list.d.ts +1 -0
  128. package/dist/interfaces/heap.d.ts +1 -0
  129. package/dist/interfaces/index.d.ts +15 -0
  130. package/dist/interfaces/navigator.d.ts +1 -0
  131. package/dist/interfaces/priority-queue.d.ts +1 -0
  132. package/dist/interfaces/rb-tree.d.ts +6 -0
  133. package/dist/interfaces/segment-tree.d.ts +1 -0
  134. package/dist/interfaces/singly-linked-list.d.ts +1 -0
  135. package/dist/interfaces/tree-multiset.d.ts +6 -0
  136. package/dist/interfaces/undirected-graph.d.ts +3 -0
  137. package/dist/types/data-structures/abstract-binary-tree.d.ts +34 -0
  138. package/dist/types/data-structures/abstract-binary-tree.js +6 -0
  139. package/dist/types/data-structures/abstract-binary-tree.js.map +1 -1
  140. package/dist/types/data-structures/abstract-graph.d.ts +11 -0
  141. package/dist/types/data-structures/avl-tree.d.ts +4 -0
  142. package/dist/types/data-structures/binary-tree.d.ts +4 -0
  143. package/dist/types/data-structures/bst.d.ts +13 -0
  144. package/dist/types/data-structures/directed-graph.d.ts +6 -0
  145. package/dist/types/data-structures/doubly-linked-list.d.ts +1 -0
  146. package/dist/types/data-structures/hash.d.ts +1 -0
  147. package/dist/types/data-structures/heap.d.ts +3 -0
  148. package/dist/types/data-structures/index.d.ts +16 -0
  149. package/dist/types/data-structures/map-graph.d.ts +1 -0
  150. package/dist/types/data-structures/navigator.d.ts +14 -0
  151. package/dist/types/data-structures/priority-queue.d.ts +7 -0
  152. package/dist/types/data-structures/rb-tree.d.ts +8 -0
  153. package/dist/types/data-structures/segment-tree.d.ts +1 -0
  154. package/dist/types/data-structures/singly-linked-list.d.ts +1 -0
  155. package/dist/types/data-structures/tree-multiset.d.ts +4 -0
  156. package/dist/types/helpers.d.ts +1 -0
  157. package/dist/types/index.d.ts +3 -0
  158. package/dist/types/utils/index.d.ts +2 -0
  159. package/dist/types/utils/utils.d.ts +7 -0
  160. package/dist/types/utils/validate-type.d.ts +19 -0
  161. package/dist/utils/index.d.ts +1 -0
  162. package/dist/utils/utils.d.ts +19 -0
  163. package/package.json +10 -6
@@ -1,9 +1,23 @@
1
1
  "use strict";
2
2
  Object.defineProperty(exports, "__esModule", { value: true });
3
3
  exports.AbstractGraph = exports.AbstractEdge = exports.AbstractVertex = void 0;
4
+ /**
5
+ * data-structure-typed
6
+ *
7
+ * @author Tyler Zeng
8
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
9
+ * @license MIT License
10
+ */
4
11
  const utils_1 = require("../../utils");
5
12
  const priority_queue_1 = require("../priority-queue");
6
13
  class AbstractVertex {
14
+ /**
15
+ * The function is a protected constructor that takes an key and an optional value as parameters.
16
+ * @param {VertexKey} key - The `key` parameter is of type `VertexKey` and represents the identifier of the vertex. It is
17
+ * used to uniquely identify the vertex object.
18
+ * @param {V} [val] - The parameter "val" is an optional parameter of type V. It is used to assign a value to the
19
+ * vertex. If no value is provided, it will be set to undefined.
20
+ */
7
21
  constructor(key, val) {
8
22
  this._key = key;
9
23
  this._val = val;
@@ -23,6 +37,15 @@ class AbstractVertex {
23
37
  }
24
38
  exports.AbstractVertex = AbstractVertex;
25
39
  class AbstractEdge {
40
+ /**
41
+ * The above function is a protected constructor that initializes the weight, value, and hash code properties of an
42
+ * object.
43
+ * @param {number} [weight] - The `weight` parameter is an optional number that represents the weight of the object. If
44
+ * a value is provided, it will be assigned to the `_weight` property. If no value is provided, the default value of 1
45
+ * will be assigned.
46
+ * @param {V} [val] - The `val` parameter is of type `V`, which means it can be any type. It is an optional parameter,
47
+ * meaning it can be omitted when creating an instance of the class.
48
+ */
26
49
  constructor(weight, val) {
27
50
  this._weight = weight !== undefined ? weight : 1;
28
51
  this._val = val;
@@ -43,6 +66,15 @@ class AbstractEdge {
43
66
  get hashCode() {
44
67
  return this._hashCode;
45
68
  }
69
+ /**
70
+ * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
71
+ * This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.
72
+ */
73
+ /**
74
+ * The function sets the value of the _hashCode property to the provided string.
75
+ * @param {string} v - The parameter "v" is of type string and represents the value that will be assigned to the
76
+ * "_hashCode" property.
77
+ */
46
78
  _setHashCode(v) {
47
79
  this._hashCode = v;
48
80
  }
@@ -55,9 +87,22 @@ class AbstractGraph {
55
87
  get vertices() {
56
88
  return this._vertices;
57
89
  }
90
+ /**
91
+ * The function "getVertex" returns the vertex with the specified ID or null if it doesn't exist.
92
+ * @param {VertexKey} vertexKey - The `vertexKey` parameter is the identifier of the vertex that you want to retrieve from
93
+ * the `_vertices` map.
94
+ * @returns The method `getVertex` returns the vertex with the specified `vertexKey` if it exists in the `_vertices`
95
+ * map. If the vertex does not exist, it returns `null`.
96
+ */
58
97
  getVertex(vertexKey) {
59
98
  return this._vertices.get(vertexKey) || null;
60
99
  }
100
+ /**
101
+ * The function checks if a vertex exists in a graph.
102
+ * @param {V | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`V`) or a vertex ID
103
+ * (`VertexKey`).
104
+ * @returns a boolean value.
105
+ */
61
106
  hasVertex(vertexOrKey) {
62
107
  return this._vertices.has(this._getVertexKey(vertexOrKey));
63
108
  }
@@ -70,10 +115,23 @@ class AbstractGraph {
70
115
  return this._addVertexOnly(newVertex);
71
116
  }
72
117
  }
118
+ /**
119
+ * The `removeVertex` function removes a vertex from a graph by its ID or by the vertex object itself.
120
+ * @param {V | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`V`) or a vertex ID
121
+ * (`VertexKey`).
122
+ * @returns The method is returning a boolean value.
123
+ */
73
124
  removeVertex(vertexOrKey) {
74
125
  const vertexKey = this._getVertexKey(vertexOrKey);
75
126
  return this._vertices.delete(vertexKey);
76
127
  }
128
+ /**
129
+ * The function removes all vertices from a graph and returns a boolean indicating if any vertices were removed.
130
+ * @param {V[] | VertexKey[]} vertices - The `vertices` parameter can be either an array of vertices (`V[]`) or an array
131
+ * of vertex IDs (`VertexKey[]`).
132
+ * @returns a boolean value. It returns true if at least one vertex was successfully removed, and false if no vertices
133
+ * were removed.
134
+ */
77
135
  removeAllVertices(vertices) {
78
136
  const removed = [];
79
137
  for (const v of vertices) {
@@ -81,6 +139,14 @@ class AbstractGraph {
81
139
  }
82
140
  return removed.length > 0;
83
141
  }
142
+ /**
143
+ * The function checks if there is an edge between two vertices and returns a boolean value indicating the result.
144
+ * @param {VertexKey | V} v1 - The parameter v1 can be either a VertexKey or a V. A VertexKey represents the unique
145
+ * identifier of a vertex in a graph, while V represents the type of the vertex object itself.
146
+ * @param {VertexKey | V} v2 - The parameter `v2` represents the second vertex in the edge. It can be either a
147
+ * `VertexKey` or a `V` type, which represents the type of the vertex.
148
+ * @returns A boolean value is being returned.
149
+ */
84
150
  hasEdge(v1, v2) {
85
151
  const edge = this.getEdge(v1, v2);
86
152
  return !!edge;
@@ -105,6 +171,17 @@ class AbstractGraph {
105
171
  }
106
172
  }
107
173
  }
174
+ /**
175
+ * The function sets the weight of an edge between two vertices in a graph.
176
+ * @param {VertexKey | V} srcOrKey - The `srcOrKey` parameter can be either a `VertexKey` or a `V` object. It represents
177
+ * the source vertex of the edge.
178
+ * @param {VertexKey | V} destOrKey - The `destOrKey` parameter represents the destination vertex of the edge. It can be
179
+ * either a `VertexKey` or a vertex object `V`.
180
+ * @param {number} weight - The weight parameter represents the weight of the edge between the source vertex (srcOrKey)
181
+ * and the destination vertex (destOrKey).
182
+ * @returns a boolean value. If the edge exists between the source and destination vertices, the function will update
183
+ * the weight of the edge and return true. If the edge does not exist, the function will return false.
184
+ */
108
185
  setEdgeWeight(srcOrKey, destOrKey, weight) {
109
186
  const edge = this.getEdge(srcOrKey, destOrKey);
110
187
  if (edge) {
@@ -115,6 +192,13 @@ class AbstractGraph {
115
192
  return false;
116
193
  }
117
194
  }
195
+ /**
196
+ * The function `getAllPathsBetween` finds all paths between two vertices in a graph using depth-first search.
197
+ * @param {V | VertexKey} v1 - The parameter `v1` represents either a vertex object (`V`) or a vertex ID (`VertexKey`).
198
+ * It is the starting vertex for finding paths.
199
+ * @param {V | VertexKey} v2 - The parameter `v2` represents either a vertex object (`V`) or a vertex ID (`VertexKey`).
200
+ * @returns The function `getAllPathsBetween` returns an array of arrays of vertices (`V[][]`).
201
+ */
118
202
  getAllPathsBetween(v1, v2) {
119
203
  const paths = [];
120
204
  const vertex1 = this._getVertex(v1);
@@ -140,6 +224,11 @@ class AbstractGraph {
140
224
  dfs(vertex1, vertex2, new Map(), []);
141
225
  return paths;
142
226
  }
227
+ /**
228
+ * The function calculates the sum of weights along a given path.
229
+ * @param {V[]} path - An array of vertices (V) representing a path in a graph.
230
+ * @returns The function `getPathSumWeight` returns the sum of the weights of the edges in the given path.
231
+ */
143
232
  getPathSumWeight(path) {
144
233
  var _a;
145
234
  let sum = 0;
@@ -148,6 +237,20 @@ class AbstractGraph {
148
237
  }
149
238
  return sum;
150
239
  }
240
+ /**
241
+ * The function `getMinCostBetween` calculates the minimum cost between two vertices in a graph, either based on edge
242
+ * weights or using a breadth-first search algorithm.
243
+ * @param {V | VertexKey} v1 - The parameter `v1` represents the starting vertex or its ID.
244
+ * @param {V | VertexKey} v2 - The parameter `v2` represents the destination vertex or its ID. It is the vertex to which
245
+ * you want to find the minimum cost or weight from the source vertex `v1`.
246
+ * @param {boolean} [isWeight] - isWeight is an optional parameter that indicates whether the graph edges have weights.
247
+ * If isWeight is set to true, the function will calculate the minimum cost between v1 and v2 based on the weights of
248
+ * the edges. If isWeight is set to false or not provided, the function will calculate the
249
+ * @returns The function `getMinCostBetween` returns a number representing the minimum cost between two vertices (`v1`
250
+ * and `v2`). If the `isWeight` parameter is `true`, it calculates the minimum weight among all paths between the
251
+ * vertices. If `isWeight` is `false` or not provided, it uses a breadth-first search (BFS) algorithm to calculate the
252
+ * minimum number of
253
+ */
151
254
  getMinCostBetween(v1, v2, isWeight) {
152
255
  if (isWeight === undefined)
153
256
  isWeight = false;
@@ -160,6 +263,7 @@ class AbstractGraph {
160
263
  return min;
161
264
  }
162
265
  else {
266
+ // BFS
163
267
  const vertex2 = this._getVertex(v2);
164
268
  const vertex1 = this._getVertex(v1);
165
269
  if (!(vertex1 && vertex2)) {
@@ -175,6 +279,7 @@ class AbstractGraph {
175
279
  if (cur === vertex2) {
176
280
  return cost;
177
281
  }
282
+ // TODO consider optimizing to AbstractGraph
178
283
  if (cur !== undefined) {
179
284
  const neighbors = this.getNeighbors(cur);
180
285
  for (const neighbor of neighbors) {
@@ -190,6 +295,19 @@ class AbstractGraph {
190
295
  return null;
191
296
  }
192
297
  }
298
+ /**
299
+ * The function `getMinPathBetween` returns the minimum path between two vertices in a graph, either based on weight or
300
+ * using a breadth-first search algorithm.
301
+ * @param {V | VertexKey} v1 - The parameter `v1` represents the starting vertex of the path. It can be either a vertex
302
+ * object (`V`) or a vertex ID (`VertexKey`).
303
+ * @param {V | VertexKey} v2 - V | VertexKey - The second vertex or vertex ID between which we want to find the minimum
304
+ * path.
305
+ * @param {boolean} [isWeight] - A boolean flag indicating whether to consider the weight of edges in finding the
306
+ * minimum path. If set to true, the function will use Dijkstra's algorithm to find the minimum weighted path. If set
307
+ * to false, the function will use breadth-first search (BFS) to find the minimum path.
308
+ * @returns The function `getMinPathBetween` returns an array of vertices (`V[]`) representing the minimum path between
309
+ * two vertices (`v1` and `v2`). If there is no path between the vertices, it returns `null`.
310
+ */
193
311
  getMinPathBetween(v1, v2, isWeight) {
194
312
  if (isWeight === undefined)
195
313
  isWeight = false;
@@ -209,6 +327,7 @@ class AbstractGraph {
209
327
  return allPaths[minIndex] || null;
210
328
  }
211
329
  else {
330
+ // BFS
212
331
  let minPath = [];
213
332
  const vertex1 = this._getVertex(v1);
214
333
  const vertex2 = this._getVertex(v2);
@@ -235,6 +354,27 @@ class AbstractGraph {
235
354
  return minPath;
236
355
  }
237
356
  }
357
+ /**
358
+ * Dijkstra algorithm time: O(VE) space: O(V + E)
359
+ * /
360
+
361
+ /**
362
+ * Dijkstra algorithm time: O(VE) space: O(V + E)
363
+ * The function `dijkstraWithoutHeap` implements Dijkstra's algorithm to find the shortest path between two vertices in
364
+ * a graph without using a heap data structure.
365
+ * @param {V | VertexKey} src - The source vertex from which to start the Dijkstra's algorithm. It can be either a
366
+ * vertex object or a vertex ID.
367
+ * @param {V | VertexKey | null} [dest] - The `dest` parameter in the `dijkstraWithoutHeap` function is an optional
368
+ * parameter that specifies the destination vertex for the Dijkstra algorithm. It can be either a vertex object or its
369
+ * identifier. If no destination is provided, the value is set to `null`.
370
+ * @param {boolean} [getMinDist] - The `getMinDist` parameter is a boolean flag that determines whether the minimum
371
+ * distance from the source vertex to the destination vertex should be calculated and returned in the result. If
372
+ * `getMinDist` is set to `true`, the `minDist` property in the result will contain the minimum distance
373
+ * @param {boolean} [genPaths] - The `genPaths` parameter is a boolean flag that determines whether or not to generate
374
+ * paths in the Dijkstra algorithm. If `genPaths` is set to `true`, the algorithm will calculate and return the
375
+ * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
376
+ * @returns The function `dijkstraWithoutHeap` returns an object of type `DijkstraResult<V>`.
377
+ */
238
378
  dijkstraWithoutHeap(src, dest, getMinDist, genPaths) {
239
379
  if (getMinDist === undefined)
240
380
  getMinDist = false;
@@ -249,7 +389,7 @@ class AbstractGraph {
249
389
  const vertices = this._vertices;
250
390
  const distMap = new Map();
251
391
  const seen = new Set();
252
- const preMap = new Map();
392
+ const preMap = new Map(); // predecessor
253
393
  const srcVertex = this._getVertex(src);
254
394
  const destVertex = dest ? this._getVertex(dest) : null;
255
395
  if (!srcVertex) {
@@ -312,6 +452,7 @@ class AbstractGraph {
312
452
  if (edge) {
313
453
  const curFromMap = distMap.get(cur);
314
454
  const neighborFromMap = distMap.get(neighbor);
455
+ // TODO after no-non-null-assertion not ensure the logic
315
456
  if (curFromMap !== undefined && neighborFromMap !== undefined) {
316
457
  if (edge.weight + curFromMap < neighborFromMap) {
317
458
  distMap.set(neighbor, edge.weight + curFromMap);
@@ -336,6 +477,32 @@ class AbstractGraph {
336
477
  genPaths && getPaths(minDest);
337
478
  return { distMap, preMap, seen, paths, minDist, minPath };
338
479
  }
480
+ /**
481
+ * Dijkstra algorithm time: O(logVE) space: O(V + E)
482
+ *
483
+ * Dijkstra's algorithm only solves the single-source shortest path problem, while the Bellman-Ford algorithm and Floyd-Warshall algorithm can address shortest paths between all pairs of nodes.
484
+ * Dijkstra's algorithm is suitable for graphs with non-negative edge weights, whereas the Bellman-Ford algorithm and Floyd-Warshall algorithm can handle negative-weight edges.
485
+ * The time complexity of Dijkstra's algorithm and the Bellman-Ford algorithm depends on the size of the graph, while the time complexity of the Floyd-Warshall algorithm is O(V^3), where V is the number of nodes. For dense graphs, Floyd-Warshall might become slower.
486
+ *
487
+ * /
488
+
489
+ /**
490
+ * Dijkstra's algorithm is used to find the shortest paths from a source node to all other nodes in a graph. Its basic idea is to repeatedly choose the node closest to the source node and update the distances of other nodes using this node as an intermediary. Dijkstra's algorithm requires that the edge weights in the graph are non-negative.
491
+ * The `dijkstra` function implements Dijkstra's algorithm to find the shortest path between a source vertex and an
492
+ * optional destination vertex, and optionally returns the minimum distance, the paths, and other information.
493
+ * @param {V | VertexKey} src - The `src` parameter represents the source vertex from which the Dijkstra algorithm will
494
+ * start. It can be either a vertex object or a vertex ID.
495
+ * @param {V | VertexKey | null} [dest] - The `dest` parameter is the destination vertex or vertex ID. It specifies the
496
+ * vertex to which the shortest path is calculated from the source vertex. If no destination is provided, the algorithm
497
+ * will calculate the shortest paths to all other vertices from the source vertex.
498
+ * @param {boolean} [getMinDist] - The `getMinDist` parameter is a boolean flag that determines whether the minimum
499
+ * distance from the source vertex to the destination vertex should be calculated and returned in the result. If
500
+ * `getMinDist` is set to `true`, the `minDist` property in the result will contain the minimum distance
501
+ * @param {boolean} [genPaths] - The `genPaths` parameter is a boolean flag that determines whether or not to generate
502
+ * paths in the Dijkstra algorithm. If `genPaths` is set to `true`, the algorithm will calculate and return the
503
+ * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
504
+ * @returns The function `dijkstra` returns an object of type `DijkstraResult<V>`.
505
+ */
339
506
  dijkstra(src, dest, getMinDist, genPaths) {
340
507
  var _a;
341
508
  if (getMinDist === undefined)
@@ -351,7 +518,7 @@ class AbstractGraph {
351
518
  const vertices = this._vertices;
352
519
  const distMap = new Map();
353
520
  const seen = new Set();
354
- const preMap = new Map();
521
+ const preMap = new Map(); // predecessor
355
522
  const srcVertex = this._getVertex(src);
356
523
  const destVertex = dest ? this._getVertex(dest) : null;
357
524
  if (!srcVertex)
@@ -367,6 +534,11 @@ class AbstractGraph {
367
534
  heap.add({ key: 0, val: srcVertex });
368
535
  distMap.set(srcVertex, 0);
369
536
  preMap.set(srcVertex, null);
537
+ /**
538
+ * The function `getPaths` retrieves all paths from vertices to a specified minimum vertex.
539
+ * @param {V | null} minV - The parameter `minV` is of type `V | null`. It represents the minimum vertex value or
540
+ * null.
541
+ */
370
542
  const getPaths = (minV) => {
371
543
  for (const vertex of vertices) {
372
544
  const vertexOrKey = vertex[1];
@@ -435,6 +607,27 @@ class AbstractGraph {
435
607
  }
436
608
  return { distMap, preMap, seen, paths, minDist, minPath };
437
609
  }
610
+ /**
611
+ * BellmanFord time:O(VE) space:O(V)
612
+ * one to rest pairs
613
+ * /
614
+
615
+ /**
616
+ * BellmanFord time:O(VE) space:O(V)
617
+ * one to rest pairs
618
+ * The Bellman-Ford algorithm is also used to find the shortest paths from a source node to all other nodes in a graph. Unlike Dijkstra's algorithm, it can handle edge weights that are negative. Its basic idea involves iterative relaxation of all edges for several rounds to gradually approximate the shortest paths. Due to its ability to handle negative-weight edges, the Bellman-Ford algorithm is more flexible in some scenarios.
619
+ * The `bellmanFord` function implements the Bellman-Ford algorithm to find the shortest path from a source vertex to
620
+ * all other vertices in a graph, and optionally detects negative cycles and generates the minimum path.
621
+ * @param {V | VertexKey} src - The `src` parameter is the source vertex from which the Bellman-Ford algorithm will
622
+ * start calculating the shortest paths. It can be either a vertex object or a vertex ID.
623
+ * @param {boolean} [scanNegativeCycle] - A boolean flag indicating whether to scan for negative cycles in the graph.
624
+ * @param {boolean} [getMin] - The `getMin` parameter is a boolean flag that determines whether the algorithm should
625
+ * calculate the minimum distance from the source vertex to all other vertices in the graph. If `getMin` is set to
626
+ * `true`, the algorithm will find the minimum distance and update the `min` variable with the minimum
627
+ * @param {boolean} [genPath] - A boolean flag indicating whether to generate paths for all vertices from the source
628
+ * vertex.
629
+ * @returns The function `bellmanFord` returns an object with the following properties:
630
+ */
438
631
  bellmanFord(src, scanNegativeCycle, getMin, genPath) {
439
632
  if (getMin === undefined)
440
633
  getMin = false;
@@ -443,9 +636,10 @@ class AbstractGraph {
443
636
  const srcVertex = this._getVertex(src);
444
637
  const paths = [];
445
638
  const distMap = new Map();
446
- const preMap = new Map();
639
+ const preMap = new Map(); // predecessor
447
640
  let min = Infinity;
448
641
  let minPath = [];
642
+ // TODO
449
643
  let hasNegativeCycle;
450
644
  if (scanNegativeCycle)
451
645
  hasNegativeCycle = false;
@@ -519,12 +713,48 @@ class AbstractGraph {
519
713
  }
520
714
  return { hasNegativeCycle, distMap, preMap, paths, min, minPath };
521
715
  }
716
+ /**
717
+ * Dijkstra algorithm time: O(logVE) space: O(V + E)
718
+ * /
719
+
720
+ /**
721
+ * Dijkstra algorithm time: O(logVE) space: O(V + E)
722
+ * Dijkstra's algorithm is used to find the shortest paths from a source node to all other nodes in a graph. Its basic idea is to repeatedly choose the node closest to the source node and update the distances of other nodes using this node as an intermediary. Dijkstra's algorithm requires that the edge weights in the graph are non-negative.
723
+ */
724
+ /**
725
+ * BellmanFord time:O(VE) space:O(V)
726
+ * one to rest pairs
727
+ * The Bellman-Ford algorithm is also used to find the shortest paths from a source node to all other nodes in a graph. Unlike Dijkstra's algorithm, it can handle edge weights that are negative. Its basic idea involves iterative relaxation of all edges for several rounds to gradually approximate the shortest paths. Due to its ability to handle negative-weight edges, the Bellman-Ford algorithm is more flexible in some scenarios.
728
+ * The `bellmanFord` function implements the Bellman-Ford algorithm to find the shortest path from a source vertex to
729
+ */
730
+ /**
731
+ * Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle
732
+ * all pairs
733
+ * The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edges, and it can simultaneously compute shortest paths between any two nodes.
734
+ */
735
+ /**
736
+ * Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle
737
+ * all pairs
738
+ * /
739
+
740
+ /**
741
+ * Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle
742
+ * all pairs
743
+ * The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edges, and it can simultaneously compute shortest paths between any two nodes.
744
+ * The function implements the Floyd-Warshall algorithm to find the shortest path between all pairs of vertices in a
745
+ * graph.
746
+ * @returns The function `floyd()` returns an object with two properties: `costs` and `predecessor`. The `costs`
747
+ * property is a 2D array of numbers representing the shortest path costs between vertices in a graph. The
748
+ * `predecessor` property is a 2D array of vertices (or `null`) representing the predecessor vertices in the shortest
749
+ * path between vertices in the
750
+ */
522
751
  floyd() {
523
752
  var _a;
524
753
  const idAndVertices = [...this._vertices];
525
754
  const n = idAndVertices.length;
526
755
  const costs = [];
527
756
  const predecessor = [];
757
+ // successors
528
758
  for (let i = 0; i < n; i++) {
529
759
  costs[i] = [];
530
760
  predecessor[i] = [];
@@ -549,7 +779,39 @@ class AbstractGraph {
549
779
  }
550
780
  return { costs, predecessor };
551
781
  }
782
+ /**
783
+ * Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
784
+ * Tarjan can find cycles in directed or undirected graph
785
+ * Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time,
786
+ * Tarjan solve the bi-connected components of undirected graphs;
787
+ * Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs.
788
+ * /
789
+
790
+ /**
791
+ * Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
792
+ * Tarjan can find cycles in directed or undirected graph
793
+ * Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time,
794
+ * Tarjan solve the bi-connected components of undirected graphs;
795
+ * Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs.
796
+ * The `tarjan` function is used to perform various graph analysis tasks such as finding articulation points, bridges,
797
+ * strongly connected components (SCCs), and cycles in a graph.
798
+ * @param {boolean} [needArticulationPoints] - A boolean value indicating whether or not to calculate and return the
799
+ * articulation points in the graph. Articulation points are the vertices in a graph whose removal would increase the
800
+ * number of connected components in the graph.
801
+ * @param {boolean} [needBridges] - A boolean flag indicating whether the algorithm should find and return the bridges
802
+ * (edges whose removal would increase the number of connected components in the graph).
803
+ * @param {boolean} [needSCCs] - A boolean value indicating whether the Strongly Connected Components (SCCs) of the
804
+ * graph are needed. If set to true, the function will calculate and return the SCCs of the graph. If set to false, the
805
+ * SCCs will not be calculated or returned.
806
+ * @param {boolean} [needCycles] - A boolean flag indicating whether the algorithm should find cycles in the graph. If
807
+ * set to true, the algorithm will return a map of cycles, where the keys are the low values of the SCCs and the values
808
+ * are arrays of vertices that form cycles within the SCCs.
809
+ * @returns The function `tarjan` returns an object with the following properties:
810
+ */
552
811
  tarjan(needArticulationPoints, needBridges, needSCCs, needCycles) {
812
+ // !! in undirected graph we will not let child visit parent when dfs
813
+ // !! articulation point(in dfs search tree not in graph): (cur !== root && cur.has(child)) && (low(child) >= dfn(cur)) || (cur === root && cur.children() >= 2)
814
+ // !! bridge: low(child) > dfn(cur)
553
815
  const defaultConfig = false;
554
816
  if (needArticulationPoints === undefined)
555
817
  needArticulationPoints = defaultConfig;
@@ -575,7 +837,7 @@ class AbstractGraph {
575
837
  dfnMap.set(cur, dfn);
576
838
  lowMap.set(cur, dfn);
577
839
  const neighbors = this.getNeighbors(cur);
578
- let childCount = 0;
840
+ let childCount = 0; // child in dfs tree not child in graph
579
841
  for (const neighbor of neighbors) {
580
842
  if (neighbor !== parent) {
581
843
  if (dfnMap.get(neighbor) === -1) {
@@ -584,6 +846,7 @@ class AbstractGraph {
584
846
  }
585
847
  const childLow = lowMap.get(neighbor);
586
848
  const curLow = lowMap.get(cur);
849
+ // TODO after no-non-null-assertion not ensure the logic
587
850
  if (curLow !== undefined && childLow !== undefined) {
588
851
  lowMap.set(cur, Math.min(curLow, childLow));
589
852
  }
@@ -591,6 +854,7 @@ class AbstractGraph {
591
854
  if (childLow !== undefined && curFromMap !== undefined) {
592
855
  if (needArticulationPoints) {
593
856
  if ((cur === root && childCount >= 2) || (cur !== root && childLow >= curFromMap)) {
857
+ // todo not ensure the logic if (cur === root && childCount >= 2 || ((cur !== root) && (childLow >= curFromMap))) {
594
858
  articulationPoints.push(cur);
595
859
  }
596
860
  }
@@ -641,6 +905,7 @@ class AbstractGraph {
641
905
  _addVertexOnly(newVertex) {
642
906
  if (this.hasVertex(newVertex)) {
643
907
  return false;
908
+ // throw (new Error('Duplicated vertex key is not allowed'));
644
909
  }
645
910
  this._vertices.set(newVertex.key, newVertex);
646
911
  return true;
@@ -1 +1 @@
1
- {"version":3,"file":"abstract-graph.js","sourceRoot":"","sources":["../../../src/data-structures/graph/abstract-graph.ts"],"names":[],"mappings":";;;AAOA,uCAAgD;AAChD,sDAAgD;AAIhD,MAAsB,cAAc;IAQlC,YAAsB,GAAc,EAAE,GAAO;QAC3C,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;IAID,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED,IAAI,GAAG,CAAC,CAAY;QAClB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;IAChB,CAAC;IAID,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED,IAAI,GAAG,CAAC,KAAoB;QAC1B,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;IACpB,CAAC;CACF;AAhCD,wCAgCC;AAED,MAAsB,YAAY;IAUhC,YAAsB,MAAe,EAAE,GAAO;QAC5C,IAAI,CAAC,OAAO,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,SAAS,GAAG,IAAA,cAAM,GAAE,CAAC;IAC5B,CAAC;IAID,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED,IAAI,GAAG,CAAC,KAAoB;QAC1B,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;IACpB,CAAC;IAID,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,IAAI,MAAM,CAAC,CAAS;QAClB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IAID,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAYS,YAAY,CAAC,CAAS;QAC9B,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;CACF;AAvDD,oCAuDC;AAED,MAAsB,aAAa;IAAnC;QAKU,cAAS,GAAsB,IAAI,GAAG,EAAgB,CAAC;IAw6BjE,CAAC;IAt6BC,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAyCD,SAAS,CAAC,SAAoB;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC;IAC/C,CAAC;IAQD,SAAS,CAAC,WAA0B;QAClC,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,CAAC;IAC7D,CAAC;IAMD,SAAS,CAAC,WAA0B,EAAE,GAAc;QAClD,IAAI,WAAW,YAAY,cAAc,EAAE;YACzC,OAAO,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;SACzC;aAAM;YACL,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;YACtD,OAAO,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SACvC;IACH,CAAC;IAQD,YAAY,CAAC,WAA0B;QACrC,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IASD,iBAAiB,CAAC,QAA2B;QAC3C,MAAM,OAAO,GAAc,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE;YACxB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;SACpC;QACD,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5B,CAAC;IAUD,OAAO,CAAC,EAAiB,EAAE,EAAiB;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAClC,OAAO,CAAC,CAAC,IAAI,CAAC;IAChB,CAAC;IAMD,OAAO,CAAC,SAA4B,EAAE,IAAoB,EAAE,MAAe,EAAE,GAAc;QACzF,IAAI,SAAS,YAAY,YAAY,EAAE;YACrC,OAAO,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;SACrC;aAAM;YACL,IAAI,IAAI,YAAY,cAAc,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;gBAC1F,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACvE,IAAI,SAAS,YAAY,cAAc;oBAAE,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC;gBACnE,IAAI,IAAI,YAAY,cAAc;oBAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC;gBACpD,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;gBAC9D,OAAO,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;aACnC;iBAAM;gBACL,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC,CAAC;aACnF;SACF;IACH,CAAC;IAaD,aAAa,CAAC,QAAuB,EAAE,SAAwB,EAAE,MAAc;QAC7E,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC/C,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;YACrB,OAAO,IAAI,CAAC;SACb;aAAM;YACL,OAAO,KAAK,CAAC;SACd;IACH,CAAC;IASD,kBAAkB,CAAC,EAAiB,EAAE,EAAiB;QACrD,MAAM,KAAK,GAAU,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC,EAAE;YACzB,OAAO,EAAE,CAAC;SACX;QAED,MAAM,GAAG,GAAG,CAAC,GAAM,EAAE,IAAO,EAAE,QAAyB,EAAE,IAAS,EAAE,EAAE;YACpE,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAExB,IAAI,GAAG,KAAK,IAAI,EAAE;gBAChB,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;aAChC;YAED,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;YACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;oBAC3B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACpB,GAAG,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;oBACpC,IAAA,mBAAW,EAAC,IAAI,EAAE,CAAC,MAAS,EAAE,EAAE,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;iBACvD;aACF;YAED,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC3B,CAAC,CAAC;QAEF,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAc,EAAE,EAAE,CAAC,CAAC;QACjD,OAAO,KAAK,CAAC;IACf,CAAC;IAOD,gBAAgB,CAAC,IAAS;;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,GAAG,IAAI,CAAA,MAAA,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,0CAAE,MAAM,KAAI,CAAC,CAAC;SACxD;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAgBD,iBAAiB,CAAC,EAAiB,EAAE,EAAiB,EAAE,QAAkB;QACxE,IAAI,QAAQ,KAAK,SAAS;YAAE,QAAQ,GAAG,KAAK,CAAC;QAE7C,IAAI,QAAQ,EAAE;YACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACjD,IAAI,GAAG,GAAG,QAAQ,CAAC;YACnB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;gBAC3B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;aAClD;YACD,OAAO,GAAG,CAAC;SACZ;aAAM;YAEL,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACpC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACpC,IAAI,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC,EAAE;gBACzB,OAAO,IAAI,CAAC;aACb;YAED,MAAM,OAAO,GAAoB,IAAI,GAAG,EAAE,CAAC;YAC3C,MAAM,KAAK,GAAQ,CAAC,OAAO,CAAC,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC3B,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;gBACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACrC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;oBAC1B,IAAI,GAAG,KAAK,OAAO,EAAE;wBACnB,OAAO,IAAI,CAAC;qBACb;oBAED,IAAI,GAAG,KAAK,SAAS,EAAE;wBACrB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;wBACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;4BAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;gCAC1B,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gCAC5B,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;6BACtB;yBACF;qBACF;iBACF;gBACD,IAAI,EAAE,CAAC;aACR;YACD,OAAO,IAAI,CAAC;SACb;IACH,CAAC;IAeD,iBAAiB,CAAC,EAAiB,EAAE,EAAiB,EAAE,QAAkB;QACxE,IAAI,QAAQ,KAAK,SAAS;YAAE,QAAQ,GAAG,KAAK,CAAC;QAE7C,IAAI,QAAQ,EAAE;YACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACjD,IAAI,GAAG,GAAG,QAAQ,CAAC;YACnB,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;YAClB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;gBAC3B,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBAClD,IAAI,aAAa,GAAG,GAAG,EAAE;oBACvB,GAAG,GAAG,aAAa,CAAC;oBACpB,QAAQ,GAAG,KAAK,CAAC;iBAClB;gBACD,KAAK,EAAE,CAAC;aACT;YACD,OAAO,QAAQ,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC;SACnC;aAAM;YAEL,IAAI,OAAO,GAAQ,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACpC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACpC,IAAI,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC,EAAE;gBACzB,OAAO,EAAE,CAAC;aACX;YAED,MAAM,GAAG,GAAG,CAAC,GAAM,EAAE,IAAO,EAAE,QAAyB,EAAE,IAAS,EAAE,EAAE;gBACpE,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBAExB,IAAI,GAAG,KAAK,IAAI,EAAE;oBAChB,OAAO,GAAG,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,CAAC;oBAC7B,OAAO;iBACR;gBAED,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;gBACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;oBAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;wBAC3B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBACpB,GAAG,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;wBACpC,IAAA,mBAAW,EAAC,IAAI,EAAE,CAAC,MAAS,EAAE,EAAE,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;qBACvD;iBACF;gBAED,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC3B,CAAC,CAAC;YAEF,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAc,EAAE,EAAE,CAAC,CAAC;YACjD,OAAO,OAAO,CAAC;SAChB;IACH,CAAC;IAuBD,mBAAmB,CACjB,GAAkB,EAClB,IAA2B,EAC3B,UAAoB,EACpB,QAAkB;QAElB,IAAI,UAAU,KAAK,SAAS;YAAE,UAAU,GAAG,KAAK,CAAC;QACjD,IAAI,QAAQ,KAAK,SAAS;YAAE,QAAQ,GAAG,KAAK,CAAC;QAE7C,IAAI,IAAI,KAAK,SAAS;YAAE,IAAI,GAAG,IAAI,CAAC;QACpC,IAAI,OAAO,GAAG,QAAQ,CAAC;QACvB,IAAI,OAAO,GAAa,IAAI,CAAC;QAC7B,IAAI,OAAO,GAAQ,EAAE,CAAC;QACtB,MAAM,KAAK,GAAU,EAAE,CAAC;QAExB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,MAAM,OAAO,GAAmB,IAAI,GAAG,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAW,IAAI,GAAG,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAqB,IAAI,GAAG,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAEvC,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAEvD,IAAI,CAAC,SAAS,EAAE;YACd,OAAO,IAAI,CAAC;SACb;QAED,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;YAC7B,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,WAAW,YAAY,cAAc;gBAAE,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;SAC/E;QACD,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAE5B,MAAM,cAAc,GAAG,GAAG,EAAE;YAC1B,IAAI,GAAG,GAAG,QAAQ,CAAC;YACnB,IAAI,IAAI,GAAa,IAAI,CAAC;YAC1B,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE;gBAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;oBAClB,IAAI,GAAG,GAAG,GAAG,EAAE;wBACb,GAAG,GAAG,GAAG,CAAC;wBACV,IAAI,GAAG,GAAG,CAAC;qBACZ;iBACF;aACF;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,MAAM,QAAQ,GAAG,CAAC,IAAc,EAAE,EAAE;YAClC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;gBAC7B,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAE9B,IAAI,WAAW,YAAY,cAAc,EAAE;oBACzC,MAAM,IAAI,GAAQ,CAAC,WAAW,CAAC,CAAC;oBAChC,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBACrC,OAAO,MAAM,EAAE;wBACb,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAClB,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;qBAC7B;oBACD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;oBAChC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI;wBAAE,OAAO,GAAG,QAAQ,CAAC;oBAC3C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBACtB;aACF;QACH,CAAC,CAAC;QAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,GAAG,GAAG,cAAc,EAAE,CAAC;YAC7B,IAAI,GAAG,EAAE;gBACP,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,IAAI,UAAU,IAAI,UAAU,KAAK,GAAG,EAAE;oBACpC,IAAI,UAAU,EAAE;wBACd,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,QAAQ,CAAC;qBAC/C;oBACD,IAAI,QAAQ,EAAE;wBACZ,QAAQ,CAAC,UAAU,CAAC,CAAC;qBACtB;oBACD,OAAO,EAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAC,CAAC;iBACzD;gBACD,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;gBACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;oBAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;wBACvB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;wBACzC,IAAI,IAAI,EAAE;4BACR,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;4BACpC,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;4BAE9C,IAAI,UAAU,KAAK,SAAS,IAAI,eAAe,KAAK,SAAS,EAAE;gCAC7D,IAAI,IAAI,CAAC,MAAM,GAAG,UAAU,GAAG,eAAe,EAAE;oCAC9C,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC;oCAChD,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;iCAC3B;6BACF;yBACF;qBACF;iBACF;aACF;SACF;QAED,UAAU;YACR,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACvB,IAAI,CAAC,KAAK,SAAS,EAAE;oBACnB,IAAI,CAAC,GAAG,OAAO,EAAE;wBACf,OAAO,GAAG,CAAC,CAAC;wBACZ,IAAI,QAAQ;4BAAE,OAAO,GAAG,CAAC,CAAC;qBAC3B;iBACF;YACH,CAAC,CAAC,CAAC;QAEL,QAAQ,IAAI,QAAQ,CAAC,OAAO,CAAC,CAAC;QAE9B,OAAO,EAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAC,CAAC;IAC1D,CAAC;IA4BD,QAAQ,CACN,GAAkB,EAClB,IAA2B,EAC3B,UAAoB,EACpB,QAAkB;;QAElB,IAAI,UAAU,KAAK,SAAS;YAAE,UAAU,GAAG,KAAK,CAAC;QACjD,IAAI,QAAQ,KAAK,SAAS;YAAE,QAAQ,GAAG,KAAK,CAAC;QAE7C,IAAI,IAAI,KAAK,SAAS;YAAE,IAAI,GAAG,IAAI,CAAC;QACpC,IAAI,OAAO,GAAG,QAAQ,CAAC;QACvB,IAAI,OAAO,GAAa,IAAI,CAAC;QAC7B,IAAI,OAAO,GAAQ,EAAE,CAAC;QACtB,MAAM,KAAK,GAAU,EAAE,CAAC;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,MAAM,OAAO,GAAmB,IAAI,GAAG,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAW,IAAI,GAAG,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAqB,IAAI,GAAG,EAAE,CAAC;QAE3C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAEvD,IAAI,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC;QAE5B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;YAC7B,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,WAAW,YAAY,cAAc;gBAAE,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;SAC/E;QAED,MAAM,IAAI,GAAG,IAAI,8BAAa,CAAwB;YACpD,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG;SACpC,CAAC,CAAC;QACH,IAAI,CAAC,GAAG,CAAC,EAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,SAAS,EAAC,CAAC,CAAC;QAEnC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAO5B,MAAM,QAAQ,GAAG,CAAC,IAAc,EAAE,EAAE;YAClC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;gBAC7B,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,WAAW,YAAY,cAAc,EAAE;oBACzC,MAAM,IAAI,GAAQ,CAAC,WAAW,CAAC,CAAC;oBAChC,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBACrC,OAAO,MAAM,EAAE;wBACb,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAClB,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;qBAC7B;oBACD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;oBAChC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI;wBAAE,OAAO,GAAG,QAAQ,CAAC;oBAC3C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBACtB;aACF;QACH,CAAC,CAAC;QAEF,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE;YACpB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,GAAG,CAAC;YAC9B,MAAM,GAAG,GAAG,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,GAAG,CAAC;YAC7B,IAAI,IAAI,KAAK,SAAS,EAAE;gBACtB,IAAI,GAAG,EAAE;oBACP,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACd,IAAI,UAAU,IAAI,UAAU,KAAK,GAAG,EAAE;wBACpC,IAAI,UAAU,EAAE;4BACd,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,QAAQ,CAAC;yBAC/C;wBACD,IAAI,QAAQ,EAAE;4BACZ,QAAQ,CAAC,UAAU,CAAC,CAAC;yBACtB;wBACD,OAAO,EAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAC,CAAC;qBACzD;oBACD,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;oBACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;wBAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;4BACvB,MAAM,MAAM,GAAG,MAAA,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,0CAAE,MAAM,CAAC;4BACnD,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;gCAC9B,MAAM,iBAAiB,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gCAChD,IAAI,iBAAiB,EAAE;oCACrB,IAAI,IAAI,GAAG,MAAM,GAAG,iBAAiB,EAAE;wCACrC,IAAI,CAAC,GAAG,CAAC,EAAC,GAAG,EAAE,IAAI,GAAG,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAC,CAAC,CAAC;wCAC9C,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;wCAC1B,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC;qCACtC;iCACF;6BACF;yBACF;qBACF;iBACF;aACF;SACF;QAED,IAAI,UAAU,EAAE;YACd,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACvB,IAAI,CAAC,KAAK,SAAS,EAAE;oBACnB,IAAI,CAAC,GAAG,OAAO,EAAE;wBACf,OAAO,GAAG,CAAC,CAAC;wBACZ,IAAI,QAAQ;4BAAE,OAAO,GAAG,CAAC,CAAC;qBAC3B;iBACF;YACH,CAAC,CAAC,CAAC;SACJ;QAED,IAAI,QAAQ,EAAE;YACZ,QAAQ,CAAC,OAAO,CAAC,CAAC;SACnB;QAED,OAAO,EAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAC,CAAC;IAC1D,CAAC;IAuBD,WAAW,CAAC,GAAkB,EAAE,iBAA2B,EAAE,MAAgB,EAAE,OAAiB;QAC9F,IAAI,MAAM,KAAK,SAAS;YAAE,MAAM,GAAG,KAAK,CAAC;QACzC,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,GAAG,KAAK,CAAC;QAE3C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,KAAK,GAAU,EAAE,CAAC;QACxB,MAAM,OAAO,GAAmB,IAAI,GAAG,EAAE,CAAC;QAC1C,MAAM,MAAM,GAAc,IAAI,GAAG,EAAE,CAAC;QACpC,IAAI,GAAG,GAAG,QAAQ,CAAC;QACnB,IAAI,OAAO,GAAQ,EAAE,CAAC;QAEtB,IAAI,gBAAqC,CAAC;QAC1C,IAAI,iBAAiB;YAAE,gBAAgB,GAAG,KAAK,CAAC;QAChD,IAAI,CAAC,SAAS;YAAE,OAAO,EAAC,gBAAgB,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAC,CAAC;QAEhF,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,MAAM,aAAa,GAAG,QAAQ,CAAC,IAAI,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;QAEhC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YAC9B,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,EAAE,CAAC,EAAE;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,EAAE,CAAC,EAAE;gBACnC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,IAAI,EAAE;oBACR,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;oBACpB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;oBAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC/B,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE;wBAClD,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,IAAI,OAAO,GAAG,MAAM,GAAG,OAAO,EAAE;4BAC7D,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC,CAAC;4BACjC,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;yBAC7B;qBACF;iBACF;aACF;SACF;QAED,IAAI,OAAO,GAAa,IAAI,CAAC;QAC7B,IAAI,MAAM,EAAE;YACV,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACvB,IAAI,CAAC,KAAK,SAAS,EAAE;oBACnB,IAAI,CAAC,GAAG,GAAG,EAAE;wBACX,GAAG,GAAG,CAAC,CAAC;wBACR,IAAI,OAAO;4BAAE,OAAO,GAAG,CAAC,CAAC;qBAC1B;iBACF;YACH,CAAC,CAAC,CAAC;SACJ;QAED,IAAI,OAAO,EAAE;YACX,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;gBAC7B,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,WAAW,YAAY,cAAc,EAAE;oBACzC,MAAM,IAAI,GAAQ,CAAC,WAAW,CAAC,CAAC;oBAChC,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBACrC,OAAO,MAAM,KAAK,SAAS,EAAE;wBAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAClB,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;qBAC7B;oBACD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;oBAChC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO;wBAAE,OAAO,GAAG,QAAQ,CAAC;oBAC9C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBACtB;aACF;SACF;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,EAAE,CAAC,EAAE;YACnC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,IAAI,EAAE;gBACR,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACjB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC/B,IAAI,OAAO,EAAE;oBACX,IAAI,OAAO,KAAK,QAAQ,IAAI,OAAO,GAAG,MAAM,GAAG,OAAO;wBAAE,gBAAgB,GAAG,IAAI,CAAC;iBACjF;aACF;SACF;QAED,OAAO,EAAC,gBAAgB,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAC,CAAC;IAClE,CAAC;IAwCD,KAAK;;QACH,MAAM,aAAa,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;QAE/B,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAmB,EAAE,CAAC;QAGvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACd,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;aAC1B;SACF;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA,MAAA,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,0CAAE,MAAM,KAAI,QAAQ,CAAC;aAC1F;SACF;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;wBAC3C,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;qBACzC;iBACF;aACF;SACF;QACD,OAAO,EAAC,KAAK,EAAE,WAAW,EAAC,CAAC;IAC9B,CAAC;IA+BD,MAAM,CAAC,sBAAgC,EAAE,WAAqB,EAAE,QAAkB,EAAE,UAAoB;QAKtG,MAAM,aAAa,GAAG,KAAK,CAAC;QAC5B,IAAI,sBAAsB,KAAK,SAAS;YAAE,sBAAsB,GAAG,aAAa,CAAC;QACjF,IAAI,WAAW,KAAK,SAAS;YAAE,WAAW,GAAG,aAAa,CAAC;QAC3D,IAAI,QAAQ,KAAK,SAAS;YAAE,QAAQ,GAAG,aAAa,CAAC;QACrD,IAAI,UAAU,KAAK,SAAS;YAAE,UAAU,GAAG,aAAa,CAAC;QAEzD,MAAM,MAAM,GAAmB,IAAI,GAAG,EAAE,CAAC;QACzC,MAAM,MAAM,GAAmB,IAAI,GAAG,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACnB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAEjC,MAAM,kBAAkB,GAAQ,EAAE,CAAC;QACnC,MAAM,OAAO,GAAQ,EAAE,CAAC;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,GAAG,GAAG,CAAC,GAAM,EAAE,MAAgB,EAAE,EAAE;YACvC,GAAG,EAAE,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAErB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;YACzC,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,KAAK,MAAM,EAAE;oBACvB,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE;wBAC/B,UAAU,EAAE,CAAC;wBACb,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;qBACpB;oBACD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAE/B,IAAI,MAAM,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAAE;wBAClD,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC;qBAC7C;oBACD,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACnC,IAAI,QAAQ,KAAK,SAAS,IAAI,UAAU,KAAK,SAAS,EAAE;wBACtD,IAAI,sBAAsB,EAAE;4BAC1B,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,UAAU,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,QAAQ,IAAI,UAAU,CAAC,EAAE;gCAEjF,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;6BAC9B;yBACF;wBAED,IAAI,WAAW,EAAE;4BACf,IAAI,QAAQ,GAAG,UAAU,EAAE;gCACzB,MAAM,iBAAiB,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;gCACtD,IAAI,iBAAiB,EAAE;oCACrB,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;iCACjC;6BACF;yBACF;qBACF;iBACF;aACF;QACH,CAAC,CAAC;QAEF,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAEhB,IAAI,IAAI,GAAqB,IAAI,GAAG,EAAE,CAAC;QAEvC,MAAM,OAAO,GAAG,GAAG,EAAE;YACnB,MAAM,IAAI,GAAqB,IAAI,GAAG,EAAE,CAAC;YACzC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE;;gBAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;oBAClB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;iBACzB;qBAAM;oBACL,MAAA,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,0CAAE,IAAI,CAAC,MAAM,CAAC,CAAC;iBAC7B;YACH,CAAC,CAAC,CAAC;YACH,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,IAAI,QAAQ,EAAE;YACZ,IAAI,GAAG,OAAO,EAAE,CAAC;SAClB;QAED,MAAM,MAAM,GAAqB,IAAI,GAAG,EAAE,CAAC;QAC3C,IAAI,UAAU,EAAE;YACd,IAAI,IAAI,GAAqB,IAAI,GAAG,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE;gBACjB,IAAI,GAAG,OAAO,EAAE,CAAC;aAClB;YAED,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;gBACxB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;oBAClB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;iBACtB;YACH,CAAC,CAAC,CAAC;SACJ;QAED,OAAO,EAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,kBAAkB,EAAE,IAAI,EAAE,MAAM,EAAC,CAAC;IACrE,CAAC;IAIS,cAAc,CAAC,SAAY;QACnC,IAAI,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;YAC7B,OAAO,KAAK,CAAC;SAEd;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IAES,UAAU,CAAC,WAA0B;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC;IAC/C,CAAC;IAES,aAAa,CAAC,WAA0B;QAChD,OAAO,WAAW,YAAY,cAAc,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC;IAC/E,CAAC;IAES,YAAY,CAAC,KAAwB;QAC7C,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;CACF;AA76BD,sCA66BC"}
1
+ {"version":3,"file":"abstract-graph.js","sourceRoot":"","sources":["../../../src/data-structures/graph/abstract-graph.ts"],"names":[],"mappings":";;;AAAA;;;;;;GAMG;AACH,uCAAgD;AAChD,sDAAgD;AAIhD,MAAsB,cAAc;IAClC;;;;;;OAMG;IACH,YAAsB,GAAc,EAAE,GAAO;QAC3C,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;IAID,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED,IAAI,GAAG,CAAC,CAAY;QAClB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;IAChB,CAAC;IAID,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED,IAAI,GAAG,CAAC,KAAoB;QAC1B,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;IACpB,CAAC;CACF;AAhCD,wCAgCC;AAED,MAAsB,YAAY;IAChC;;;;;;;;OAQG;IACH,YAAsB,MAAe,EAAE,GAAO;QAC5C,IAAI,CAAC,OAAO,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,SAAS,GAAG,IAAA,cAAM,GAAE,CAAC;IAC5B,CAAC;IAID,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED,IAAI,GAAG,CAAC,KAAoB;QAC1B,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;IACpB,CAAC;IAID,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,IAAI,MAAM,CAAC,CAAS;QAClB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IAID,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;OAGG;IAEH;;;;OAIG;IACO,YAAY,CAAC,CAAS;QAC9B,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;CACF;AAvDD,oCAuDC;AAED,MAAsB,aAAa;IAAnC;QAKU,cAAS,GAAsB,IAAI,GAAG,EAAgB,CAAC;IAw6BjE,CAAC;IAt6BC,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAkCD;;;;;;OAMG;IACH,SAAS,CAAC,SAAoB;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC;IAC/C,CAAC;IAED;;;;;OAKG;IACH,SAAS,CAAC,WAA0B;QAClC,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,CAAC;IAC7D,CAAC;IAMD,SAAS,CAAC,WAA0B,EAAE,GAAc;QAClD,IAAI,WAAW,YAAY,cAAc,EAAE;YACzC,OAAO,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;SACzC;aAAM;YACL,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;YACtD,OAAO,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SACvC;IACH,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,WAA0B;QACrC,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;;OAMG;IACH,iBAAiB,CAAC,QAA2B;QAC3C,MAAM,OAAO,GAAc,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE;YACxB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;SACpC;QACD,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED;;;;;;;OAOG;IACH,OAAO,CAAC,EAAiB,EAAE,EAAiB;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAClC,OAAO,CAAC,CAAC,IAAI,CAAC;IAChB,CAAC;IAMD,OAAO,CAAC,SAA4B,EAAE,IAAoB,EAAE,MAAe,EAAE,GAAc;QACzF,IAAI,SAAS,YAAY,YAAY,EAAE;YACrC,OAAO,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;SACrC;aAAM;YACL,IAAI,IAAI,YAAY,cAAc,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;gBAC1F,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACvE,IAAI,SAAS,YAAY,cAAc;oBAAE,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC;gBACnE,IAAI,IAAI,YAAY,cAAc;oBAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC;gBACpD,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;gBAC9D,OAAO,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;aACnC;iBAAM;gBACL,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC,CAAC;aACnF;SACF;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACH,aAAa,CAAC,QAAuB,EAAE,SAAwB,EAAE,MAAc;QAC7E,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC/C,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;YACrB,OAAO,IAAI,CAAC;SACb;aAAM;YACL,OAAO,KAAK,CAAC;SACd;IACH,CAAC;IAED;;;;;;OAMG;IACH,kBAAkB,CAAC,EAAiB,EAAE,EAAiB;QACrD,MAAM,KAAK,GAAU,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC,EAAE;YACzB,OAAO,EAAE,CAAC;SACX;QAED,MAAM,GAAG,GAAG,CAAC,GAAM,EAAE,IAAO,EAAE,QAAyB,EAAE,IAAS,EAAE,EAAE;YACpE,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAExB,IAAI,GAAG,KAAK,IAAI,EAAE;gBAChB,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;aAChC;YAED,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;YACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;oBAC3B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACpB,GAAG,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;oBACpC,IAAA,mBAAW,EAAC,IAAI,EAAE,CAAC,MAAS,EAAE,EAAE,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;iBACvD;aACF;YAED,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC3B,CAAC,CAAC;QAEF,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAc,EAAE,EAAE,CAAC,CAAC;QACjD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,IAAS;;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,GAAG,IAAI,CAAA,MAAA,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,0CAAE,MAAM,KAAI,CAAC,CAAC;SACxD;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,iBAAiB,CAAC,EAAiB,EAAE,EAAiB,EAAE,QAAkB;QACxE,IAAI,QAAQ,KAAK,SAAS;YAAE,QAAQ,GAAG,KAAK,CAAC;QAE7C,IAAI,QAAQ,EAAE;YACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACjD,IAAI,GAAG,GAAG,QAAQ,CAAC;YACnB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;gBAC3B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;aAClD;YACD,OAAO,GAAG,CAAC;SACZ;aAAM;YACL,MAAM;YACN,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACpC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACpC,IAAI,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC,EAAE;gBACzB,OAAO,IAAI,CAAC;aACb;YAED,MAAM,OAAO,GAAoB,IAAI,GAAG,EAAE,CAAC;YAC3C,MAAM,KAAK,GAAQ,CAAC,OAAO,CAAC,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC3B,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;gBACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACrC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;oBAC1B,IAAI,GAAG,KAAK,OAAO,EAAE;wBACnB,OAAO,IAAI,CAAC;qBACb;oBACD,4CAA4C;oBAC5C,IAAI,GAAG,KAAK,SAAS,EAAE;wBACrB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;wBACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;4BAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;gCAC1B,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gCAC5B,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;6BACtB;yBACF;qBACF;iBACF;gBACD,IAAI,EAAE,CAAC;aACR;YACD,OAAO,IAAI,CAAC;SACb;IACH,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,iBAAiB,CAAC,EAAiB,EAAE,EAAiB,EAAE,QAAkB;QACxE,IAAI,QAAQ,KAAK,SAAS;YAAE,QAAQ,GAAG,KAAK,CAAC;QAE7C,IAAI,QAAQ,EAAE;YACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACjD,IAAI,GAAG,GAAG,QAAQ,CAAC;YACnB,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;YAClB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;gBAC3B,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBAClD,IAAI,aAAa,GAAG,GAAG,EAAE;oBACvB,GAAG,GAAG,aAAa,CAAC;oBACpB,QAAQ,GAAG,KAAK,CAAC;iBAClB;gBACD,KAAK,EAAE,CAAC;aACT;YACD,OAAO,QAAQ,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC;SACnC;aAAM;YACL,MAAM;YACN,IAAI,OAAO,GAAQ,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACpC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACpC,IAAI,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC,EAAE;gBACzB,OAAO,EAAE,CAAC;aACX;YAED,MAAM,GAAG,GAAG,CAAC,GAAM,EAAE,IAAO,EAAE,QAAyB,EAAE,IAAS,EAAE,EAAE;gBACpE,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBAExB,IAAI,GAAG,KAAK,IAAI,EAAE;oBAChB,OAAO,GAAG,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,CAAC;oBAC7B,OAAO;iBACR;gBAED,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;gBACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;oBAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;wBAC3B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBACpB,GAAG,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;wBACpC,IAAA,mBAAW,EAAC,IAAI,EAAE,CAAC,MAAS,EAAE,EAAE,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;qBACvD;iBACF;gBAED,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC3B,CAAC,CAAC;YAEF,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAc,EAAE,EAAE,CAAC,CAAC;YACjD,OAAO,OAAO,CAAC;SAChB;IACH,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,mBAAmB,CACjB,GAAkB,EAClB,IAA2B,EAC3B,UAAoB,EACpB,QAAkB;QAElB,IAAI,UAAU,KAAK,SAAS;YAAE,UAAU,GAAG,KAAK,CAAC;QACjD,IAAI,QAAQ,KAAK,SAAS;YAAE,QAAQ,GAAG,KAAK,CAAC;QAE7C,IAAI,IAAI,KAAK,SAAS;YAAE,IAAI,GAAG,IAAI,CAAC;QACpC,IAAI,OAAO,GAAG,QAAQ,CAAC;QACvB,IAAI,OAAO,GAAa,IAAI,CAAC;QAC7B,IAAI,OAAO,GAAQ,EAAE,CAAC;QACtB,MAAM,KAAK,GAAU,EAAE,CAAC;QAExB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,MAAM,OAAO,GAAmB,IAAI,GAAG,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAW,IAAI,GAAG,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAqB,IAAI,GAAG,EAAE,CAAC,CAAC,cAAc;QAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAEvC,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAEvD,IAAI,CAAC,SAAS,EAAE;YACd,OAAO,IAAI,CAAC;SACb;QAED,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;YAC7B,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,WAAW,YAAY,cAAc;gBAAE,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;SAC/E;QACD,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAE5B,MAAM,cAAc,GAAG,GAAG,EAAE;YAC1B,IAAI,GAAG,GAAG,QAAQ,CAAC;YACnB,IAAI,IAAI,GAAa,IAAI,CAAC;YAC1B,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE;gBAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;oBAClB,IAAI,GAAG,GAAG,GAAG,EAAE;wBACb,GAAG,GAAG,GAAG,CAAC;wBACV,IAAI,GAAG,GAAG,CAAC;qBACZ;iBACF;aACF;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,MAAM,QAAQ,GAAG,CAAC,IAAc,EAAE,EAAE;YAClC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;gBAC7B,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAE9B,IAAI,WAAW,YAAY,cAAc,EAAE;oBACzC,MAAM,IAAI,GAAQ,CAAC,WAAW,CAAC,CAAC;oBAChC,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBACrC,OAAO,MAAM,EAAE;wBACb,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAClB,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;qBAC7B;oBACD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;oBAChC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI;wBAAE,OAAO,GAAG,QAAQ,CAAC;oBAC3C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBACtB;aACF;QACH,CAAC,CAAC;QAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,GAAG,GAAG,cAAc,EAAE,CAAC;YAC7B,IAAI,GAAG,EAAE;gBACP,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,IAAI,UAAU,IAAI,UAAU,KAAK,GAAG,EAAE;oBACpC,IAAI,UAAU,EAAE;wBACd,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,QAAQ,CAAC;qBAC/C;oBACD,IAAI,QAAQ,EAAE;wBACZ,QAAQ,CAAC,UAAU,CAAC,CAAC;qBACtB;oBACD,OAAO,EAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAC,CAAC;iBACzD;gBACD,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;gBACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;oBAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;wBACvB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;wBACzC,IAAI,IAAI,EAAE;4BACR,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;4BACpC,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;4BAC9C,wDAAwD;4BACxD,IAAI,UAAU,KAAK,SAAS,IAAI,eAAe,KAAK,SAAS,EAAE;gCAC7D,IAAI,IAAI,CAAC,MAAM,GAAG,UAAU,GAAG,eAAe,EAAE;oCAC9C,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC;oCAChD,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;iCAC3B;6BACF;yBACF;qBACF;iBACF;aACF;SACF;QAED,UAAU;YACR,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACvB,IAAI,CAAC,KAAK,SAAS,EAAE;oBACnB,IAAI,CAAC,GAAG,OAAO,EAAE;wBACf,OAAO,GAAG,CAAC,CAAC;wBACZ,IAAI,QAAQ;4BAAE,OAAO,GAAG,CAAC,CAAC;qBAC3B;iBACF;YACH,CAAC,CAAC,CAAC;QAEL,QAAQ,IAAI,QAAQ,CAAC,OAAO,CAAC,CAAC;QAE9B,OAAO,EAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAC,CAAC;IAC1D,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACH,QAAQ,CACN,GAAkB,EAClB,IAA2B,EAC3B,UAAoB,EACpB,QAAkB;;QAElB,IAAI,UAAU,KAAK,SAAS;YAAE,UAAU,GAAG,KAAK,CAAC;QACjD,IAAI,QAAQ,KAAK,SAAS;YAAE,QAAQ,GAAG,KAAK,CAAC;QAE7C,IAAI,IAAI,KAAK,SAAS;YAAE,IAAI,GAAG,IAAI,CAAC;QACpC,IAAI,OAAO,GAAG,QAAQ,CAAC;QACvB,IAAI,OAAO,GAAa,IAAI,CAAC;QAC7B,IAAI,OAAO,GAAQ,EAAE,CAAC;QACtB,MAAM,KAAK,GAAU,EAAE,CAAC;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,MAAM,OAAO,GAAmB,IAAI,GAAG,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAW,IAAI,GAAG,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAqB,IAAI,GAAG,EAAE,CAAC,CAAC,cAAc;QAE1D,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAEvD,IAAI,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC;QAE5B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;YAC7B,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,WAAW,YAAY,cAAc;gBAAE,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;SAC/E;QAED,MAAM,IAAI,GAAG,IAAI,8BAAa,CAAwB;YACpD,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG;SACpC,CAAC,CAAC;QACH,IAAI,CAAC,GAAG,CAAC,EAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,SAAS,EAAC,CAAC,CAAC;QAEnC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAE5B;;;;WAIG;QACH,MAAM,QAAQ,GAAG,CAAC,IAAc,EAAE,EAAE;YAClC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;gBAC7B,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,WAAW,YAAY,cAAc,EAAE;oBACzC,MAAM,IAAI,GAAQ,CAAC,WAAW,CAAC,CAAC;oBAChC,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBACrC,OAAO,MAAM,EAAE;wBACb,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAClB,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;qBAC7B;oBACD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;oBAChC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI;wBAAE,OAAO,GAAG,QAAQ,CAAC;oBAC3C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBACtB;aACF;QACH,CAAC,CAAC;QAEF,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE;YACpB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,GAAG,CAAC;YAC9B,MAAM,GAAG,GAAG,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,GAAG,CAAC;YAC7B,IAAI,IAAI,KAAK,SAAS,EAAE;gBACtB,IAAI,GAAG,EAAE;oBACP,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACd,IAAI,UAAU,IAAI,UAAU,KAAK,GAAG,EAAE;wBACpC,IAAI,UAAU,EAAE;4BACd,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,QAAQ,CAAC;yBAC/C;wBACD,IAAI,QAAQ,EAAE;4BACZ,QAAQ,CAAC,UAAU,CAAC,CAAC;yBACtB;wBACD,OAAO,EAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAC,CAAC;qBACzD;oBACD,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;oBACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;wBAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;4BACvB,MAAM,MAAM,GAAG,MAAA,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,0CAAE,MAAM,CAAC;4BACnD,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;gCAC9B,MAAM,iBAAiB,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gCAChD,IAAI,iBAAiB,EAAE;oCACrB,IAAI,IAAI,GAAG,MAAM,GAAG,iBAAiB,EAAE;wCACrC,IAAI,CAAC,GAAG,CAAC,EAAC,GAAG,EAAE,IAAI,GAAG,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAC,CAAC,CAAC;wCAC9C,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;wCAC1B,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC;qCACtC;iCACF;6BACF;yBACF;qBACF;iBACF;aACF;SACF;QAED,IAAI,UAAU,EAAE;YACd,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACvB,IAAI,CAAC,KAAK,SAAS,EAAE;oBACnB,IAAI,CAAC,GAAG,OAAO,EAAE;wBACf,OAAO,GAAG,CAAC,CAAC;wBACZ,IAAI,QAAQ;4BAAE,OAAO,GAAG,CAAC,CAAC;qBAC3B;iBACF;YACH,CAAC,CAAC,CAAC;SACJ;QAED,IAAI,QAAQ,EAAE;YACZ,QAAQ,CAAC,OAAO,CAAC,CAAC;SACnB;QAED,OAAO,EAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAC,CAAC;IAC1D,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,WAAW,CAAC,GAAkB,EAAE,iBAA2B,EAAE,MAAgB,EAAE,OAAiB;QAC9F,IAAI,MAAM,KAAK,SAAS;YAAE,MAAM,GAAG,KAAK,CAAC;QACzC,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,GAAG,KAAK,CAAC;QAE3C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,KAAK,GAAU,EAAE,CAAC;QACxB,MAAM,OAAO,GAAmB,IAAI,GAAG,EAAE,CAAC;QAC1C,MAAM,MAAM,GAAc,IAAI,GAAG,EAAE,CAAC,CAAC,cAAc;QACnD,IAAI,GAAG,GAAG,QAAQ,CAAC;QACnB,IAAI,OAAO,GAAQ,EAAE,CAAC;QACtB,OAAO;QACP,IAAI,gBAAqC,CAAC;QAC1C,IAAI,iBAAiB;YAAE,gBAAgB,GAAG,KAAK,CAAC;QAChD,IAAI,CAAC,SAAS;YAAE,OAAO,EAAC,gBAAgB,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAC,CAAC;QAEhF,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,MAAM,aAAa,GAAG,QAAQ,CAAC,IAAI,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;QAEhC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YAC9B,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,EAAE,CAAC,EAAE;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,EAAE,CAAC,EAAE;gBACnC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,IAAI,EAAE;oBACR,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;oBACpB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;oBAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC/B,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE;wBAClD,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,IAAI,OAAO,GAAG,MAAM,GAAG,OAAO,EAAE;4BAC7D,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC,CAAC;4BACjC,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;yBAC7B;qBACF;iBACF;aACF;SACF;QAED,IAAI,OAAO,GAAa,IAAI,CAAC;QAC7B,IAAI,MAAM,EAAE;YACV,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACvB,IAAI,CAAC,KAAK,SAAS,EAAE;oBACnB,IAAI,CAAC,GAAG,GAAG,EAAE;wBACX,GAAG,GAAG,CAAC,CAAC;wBACR,IAAI,OAAO;4BAAE,OAAO,GAAG,CAAC,CAAC;qBAC1B;iBACF;YACH,CAAC,CAAC,CAAC;SACJ;QAED,IAAI,OAAO,EAAE;YACX,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;gBAC7B,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,WAAW,YAAY,cAAc,EAAE;oBACzC,MAAM,IAAI,GAAQ,CAAC,WAAW,CAAC,CAAC;oBAChC,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBACrC,OAAO,MAAM,KAAK,SAAS,EAAE;wBAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAClB,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;qBAC7B;oBACD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;oBAChC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO;wBAAE,OAAO,GAAG,QAAQ,CAAC;oBAC9C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBACtB;aACF;SACF;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,EAAE,CAAC,EAAE;YACnC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,IAAI,EAAE;gBACR,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACjB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC/B,IAAI,OAAO,EAAE;oBACX,IAAI,OAAO,KAAK,QAAQ,IAAI,OAAO,GAAG,MAAM,GAAG,OAAO;wBAAE,gBAAgB,GAAG,IAAI,CAAC;iBACjF;aACF;SACF;QAED,OAAO,EAAC,gBAAgB,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAC,CAAC;IAClE,CAAC;IAED;;;;;;;OAOG;IAEH;;;;;OAKG;IAEH;;;;OAIG;IAEH;;;;;;;;;;;;;;;OAeG;IACH,KAAK;;QACH,MAAM,aAAa,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;QAE/B,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAmB,EAAE,CAAC;QACvC,aAAa;QAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACd,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;aAC1B;SACF;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA,MAAA,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,0CAAE,MAAM,KAAI,QAAQ,CAAC;aAC1F;SACF;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;wBAC3C,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;qBACzC;iBACF;aACF;SACF;QACD,OAAO,EAAC,KAAK,EAAE,WAAW,EAAC,CAAC;IAC9B,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACH,MAAM,CAAC,sBAAgC,EAAE,WAAqB,EAAE,QAAkB,EAAE,UAAoB;QACtG,qEAAqE;QACrE,gKAAgK;QAChK,mCAAmC;QAEnC,MAAM,aAAa,GAAG,KAAK,CAAC;QAC5B,IAAI,sBAAsB,KAAK,SAAS;YAAE,sBAAsB,GAAG,aAAa,CAAC;QACjF,IAAI,WAAW,KAAK,SAAS;YAAE,WAAW,GAAG,aAAa,CAAC;QAC3D,IAAI,QAAQ,KAAK,SAAS;YAAE,QAAQ,GAAG,aAAa,CAAC;QACrD,IAAI,UAAU,KAAK,SAAS;YAAE,UAAU,GAAG,aAAa,CAAC;QAEzD,MAAM,MAAM,GAAmB,IAAI,GAAG,EAAE,CAAC;QACzC,MAAM,MAAM,GAAmB,IAAI,GAAG,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACnB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAEjC,MAAM,kBAAkB,GAAQ,EAAE,CAAC;QACnC,MAAM,OAAO,GAAQ,EAAE,CAAC;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,GAAG,GAAG,CAAC,GAAM,EAAE,MAAgB,EAAE,EAAE;YACvC,GAAG,EAAE,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAErB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;YACzC,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,uCAAuC;YAC3D,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,KAAK,MAAM,EAAE;oBACvB,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE;wBAC/B,UAAU,EAAE,CAAC;wBACb,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;qBACpB;oBACD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAC/B,wDAAwD;oBACxD,IAAI,MAAM,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAAE;wBAClD,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC;qBAC7C;oBACD,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACnC,IAAI,QAAQ,KAAK,SAAS,IAAI,UAAU,KAAK,SAAS,EAAE;wBACtD,IAAI,sBAAsB,EAAE;4BAC1B,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,UAAU,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,QAAQ,IAAI,UAAU,CAAC,EAAE;gCACjF,mHAAmH;gCACnH,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;6BAC9B;yBACF;wBAED,IAAI,WAAW,EAAE;4BACf,IAAI,QAAQ,GAAG,UAAU,EAAE;gCACzB,MAAM,iBAAiB,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;gCACtD,IAAI,iBAAiB,EAAE;oCACrB,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;iCACjC;6BACF;yBACF;qBACF;iBACF;aACF;QACH,CAAC,CAAC;QAEF,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAEhB,IAAI,IAAI,GAAqB,IAAI,GAAG,EAAE,CAAC;QAEvC,MAAM,OAAO,GAAG,GAAG,EAAE;YACnB,MAAM,IAAI,GAAqB,IAAI,GAAG,EAAE,CAAC;YACzC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE;;gBAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;oBAClB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;iBACzB;qBAAM;oBACL,MAAA,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,0CAAE,IAAI,CAAC,MAAM,CAAC,CAAC;iBAC7B;YACH,CAAC,CAAC,CAAC;YACH,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,IAAI,QAAQ,EAAE;YACZ,IAAI,GAAG,OAAO,EAAE,CAAC;SAClB;QAED,MAAM,MAAM,GAAqB,IAAI,GAAG,EAAE,CAAC;QAC3C,IAAI,UAAU,EAAE;YACd,IAAI,IAAI,GAAqB,IAAI,GAAG,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE;gBACjB,IAAI,GAAG,OAAO,EAAE,CAAC;aAClB;YAED,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;gBACxB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;oBAClB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;iBACtB;YACH,CAAC,CAAC,CAAC;SACJ;QAED,OAAO,EAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,kBAAkB,EAAE,IAAI,EAAE,MAAM,EAAC,CAAC;IACrE,CAAC;IAIS,cAAc,CAAC,SAAY;QACnC,IAAI,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;YAC7B,OAAO,KAAK,CAAC;YACb,6DAA6D;SAC9D;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IAES,UAAU,CAAC,WAA0B;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC;IAC/C,CAAC;IAES,aAAa,CAAC,WAA0B;QAChD,OAAO,WAAW,YAAY,cAAc,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC;IAC/E,CAAC;IAES,YAAY,CAAC,KAAwB;QAC7C,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;CACF;AA76BD,sCA66BC"}