archimaid 0.0.0-stage → 0.1.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 (154) hide show
  1. package/CHANGELOG.md +32 -0
  2. package/FOUNDATION.md +108 -0
  3. package/LICENSE +21 -0
  4. package/README.md +271 -2
  5. package/dist/archimate/catalogue.d.ts +106 -0
  6. package/dist/archimate/catalogue.js +219 -0
  7. package/dist/archimate/catalogue.js.map +1 -0
  8. package/dist/archimate/diagnostics.d.ts +48 -0
  9. package/dist/archimate/diagnostics.js +64 -0
  10. package/dist/archimate/diagnostics.js.map +1 -0
  11. package/dist/archimate/frontmatter.d.ts +13 -0
  12. package/dist/archimate/frontmatter.js +62 -0
  13. package/dist/archimate/frontmatter.js.map +1 -0
  14. package/dist/archimate/grammar.d.ts +60 -0
  15. package/dist/archimate/grammar.js +273 -0
  16. package/dist/archimate/grammar.js.map +1 -0
  17. package/dist/archimate/lexer.d.ts +91 -0
  18. package/dist/archimate/lexer.js +215 -0
  19. package/dist/archimate/lexer.js.map +1 -0
  20. package/dist/archimate/model.d.ts +46 -0
  21. package/dist/archimate/model.js +2 -0
  22. package/dist/archimate/model.js.map +1 -0
  23. package/dist/archimate/nesting.d.ts +14 -0
  24. package/dist/archimate/nesting.js +84 -0
  25. package/dist/archimate/nesting.js.map +1 -0
  26. package/dist/archimate/parser.d.ts +14 -0
  27. package/dist/archimate/parser.js +53 -0
  28. package/dist/archimate/parser.js.map +1 -0
  29. package/dist/archimate/suggestions.d.ts +1 -0
  30. package/dist/archimate/suggestions.js +44 -0
  31. package/dist/archimate/suggestions.js.map +1 -0
  32. package/dist/archimate/validate.d.ts +4 -0
  33. package/dist/archimate/validate.js +402 -0
  34. package/dist/archimate/validate.js.map +1 -0
  35. package/dist/bundle/archimaid.esm.min.mjs +1 -0
  36. package/dist/bundle/chunks/archimateDiagram-WUCF6KHR.mjs +132 -0
  37. package/dist/bundle/chunks/chunk-QBMRZFD3.mjs +1 -0
  38. package/dist/bundle/chunks/elk.bundled-2VSLVJGB.mjs +26 -0
  39. package/dist/cli/render.d.ts +10 -0
  40. package/dist/cli/render.js +102 -0
  41. package/dist/cli/render.js.map +1 -0
  42. package/dist/cli/report.d.ts +20 -0
  43. package/dist/cli/report.js +39 -0
  44. package/dist/cli/report.js.map +1 -0
  45. package/dist/cli/sources.d.ts +19 -0
  46. package/dist/cli/sources.js +86 -0
  47. package/dist/cli/sources.js.map +1 -0
  48. package/dist/cli.d.ts +2 -0
  49. package/dist/cli.js +137 -0
  50. package/dist/cli.js.map +1 -0
  51. package/dist/index.d.ts +2 -0
  52. package/dist/index.js +2 -0
  53. package/dist/index.js.map +1 -0
  54. package/dist/language.d.ts +5 -0
  55. package/dist/language.js +3 -0
  56. package/dist/language.js.map +1 -0
  57. package/dist/mermaid/archimateDetector.d.ts +12 -0
  58. package/dist/mermaid/archimateDetector.js +29 -0
  59. package/dist/mermaid/archimateDetector.js.map +1 -0
  60. package/dist/mermaid/archimateDiagram.d.ts +9 -0
  61. package/dist/mermaid/archimateDiagram.js +75 -0
  62. package/dist/mermaid/archimateDiagram.js.map +1 -0
  63. package/dist/mermaid/archimateRenderer.d.ts +6 -0
  64. package/dist/mermaid/archimateRenderer.js +40 -0
  65. package/dist/mermaid/archimateRenderer.js.map +1 -0
  66. package/dist/mermaid/architectureLayout.d.ts +50 -0
  67. package/dist/mermaid/architectureLayout.js +144 -0
  68. package/dist/mermaid/architectureLayout.js.map +1 -0
  69. package/dist/mermaid/geometry.d.ts +3 -0
  70. package/dist/mermaid/geometry.js +20 -0
  71. package/dist/mermaid/geometry.js.map +1 -0
  72. package/dist/mermaid/hierarchy.d.ts +1 -0
  73. package/dist/mermaid/hierarchy.js +8 -0
  74. package/dist/mermaid/hierarchy.js.map +1 -0
  75. package/dist/mermaid/invariant.d.ts +1 -0
  76. package/dist/mermaid/invariant.js +7 -0
  77. package/dist/mermaid/invariant.js.map +1 -0
  78. package/dist/mermaid/orthogonalRouter.d.ts +4 -0
  79. package/dist/mermaid/orthogonalRouter.js +249 -0
  80. package/dist/mermaid/orthogonalRouter.js.map +1 -0
  81. package/dist/mermaid/relationshipPlacement.d.ts +3 -0
  82. package/dist/mermaid/relationshipPlacement.js +350 -0
  83. package/dist/mermaid/relationshipPlacement.js.map +1 -0
  84. package/dist/mermaid/render/draw.d.ts +17 -0
  85. package/dist/mermaid/render/draw.js +275 -0
  86. package/dist/mermaid/render/draw.js.map +1 -0
  87. package/dist/mermaid/render/elkRoutes.d.ts +6 -0
  88. package/dist/mermaid/render/elkRoutes.js +216 -0
  89. package/dist/mermaid/render/elkRoutes.js.map +1 -0
  90. package/dist/mermaid/render/graph.d.ts +17 -0
  91. package/dist/mermaid/render/graph.js +200 -0
  92. package/dist/mermaid/render/graph.js.map +1 -0
  93. package/dist/mermaid/render/labels.d.ts +12 -0
  94. package/dist/mermaid/render/labels.js +148 -0
  95. package/dist/mermaid/render/labels.js.map +1 -0
  96. package/dist/mermaid/render/layout.d.ts +12 -0
  97. package/dist/mermaid/render/layout.js +60 -0
  98. package/dist/mermaid/render/layout.js.map +1 -0
  99. package/dist/mermaid/render/measure.d.ts +16 -0
  100. package/dist/mermaid/render/measure.js +96 -0
  101. package/dist/mermaid/render/measure.js.map +1 -0
  102. package/dist/mermaid/render/place.d.ts +20 -0
  103. package/dist/mermaid/render/place.js +63 -0
  104. package/dist/mermaid/render/place.js.map +1 -0
  105. package/dist/mermaid/render/route.d.ts +29 -0
  106. package/dist/mermaid/render/route.js +113 -0
  107. package/dist/mermaid/render/route.js.map +1 -0
  108. package/dist/mermaid/render/shared.d.ts +83 -0
  109. package/dist/mermaid/render/shared.js +52 -0
  110. package/dist/mermaid/render/shared.js.map +1 -0
  111. package/dist/mermaid/render/svg.d.ts +6 -0
  112. package/dist/mermaid/render/svg.js +33 -0
  113. package/dist/mermaid/render/svg.js.map +1 -0
  114. package/dist/mermaid/render/viewport.d.ts +14 -0
  115. package/dist/mermaid/render/viewport.js +58 -0
  116. package/dist/mermaid/render/viewport.js.map +1 -0
  117. package/dist/mermaid/routing/anchors.d.ts +14 -0
  118. package/dist/mermaid/routing/anchors.js +134 -0
  119. package/dist/mermaid/routing/anchors.js.map +1 -0
  120. package/dist/mermaid/routing/bundles.d.ts +14 -0
  121. package/dist/mermaid/routing/bundles.js +94 -0
  122. package/dist/mermaid/routing/bundles.js.map +1 -0
  123. package/dist/mermaid/routing/congestion.d.ts +8 -0
  124. package/dist/mermaid/routing/congestion.js +70 -0
  125. package/dist/mermaid/routing/congestion.js.map +1 -0
  126. package/dist/mermaid/routing/constants.d.ts +13 -0
  127. package/dist/mermaid/routing/constants.js +17 -0
  128. package/dist/mermaid/routing/constants.js.map +1 -0
  129. package/dist/mermaid/routing/primitives.d.ts +33 -0
  130. package/dist/mermaid/routing/primitives.js +110 -0
  131. package/dist/mermaid/routing/primitives.js.map +1 -0
  132. package/dist/mermaid/routing/search.d.ts +4 -0
  133. package/dist/mermaid/routing/search.js +171 -0
  134. package/dist/mermaid/routing/search.js.map +1 -0
  135. package/dist/mermaid/routing/shapes.d.ts +8 -0
  136. package/dist/mermaid/routing/shapes.js +82 -0
  137. package/dist/mermaid/routing/shapes.js.map +1 -0
  138. package/dist/mermaid/routing/types.d.ts +37 -0
  139. package/dist/mermaid/routing/types.js +14 -0
  140. package/dist/mermaid/routing/types.js.map +1 -0
  141. package/dist/mermaid/styles.d.ts +89 -0
  142. package/dist/mermaid/styles.js +166 -0
  143. package/dist/mermaid/styles.js.map +1 -0
  144. package/docs/reference.md +86 -0
  145. package/examples/cross-layer-relationships.mmd +79 -0
  146. package/examples/cross-layer-relationships.svg +33 -0
  147. package/examples/element-preview.svg +1 -0
  148. package/examples/nested-components.mmd +21 -0
  149. package/examples/nested-components.svg +4 -0
  150. package/examples/order-fulfilment.mmd +10 -0
  151. package/examples/order-management.mmd +15 -0
  152. package/examples/order-management.svg +2 -0
  153. package/package.json +91 -4
  154. package/skills/archimaid/SKILL.md +123 -0
@@ -0,0 +1,350 @@
1
+ import { required } from './invariant.js';
2
+ function project(nodes, relationships) {
3
+ const endpoints = new Map();
4
+ for (const owner of nodes) {
5
+ function visit(node, left) {
6
+ endpoints.set(node.id, {
7
+ owner,
8
+ offset: left + node.width / 2 - owner.node.width / 2,
9
+ nested: node !== owner.node,
10
+ });
11
+ for (const child of node.children ?? [])
12
+ visit(child, left + child.x);
13
+ }
14
+ visit(owner.node, 0);
15
+ }
16
+ return relationships.flatMap(({ source, target, type }) => {
17
+ const from = endpoints.get(source);
18
+ const to = endpoints.get(target);
19
+ return from && to && from !== to ? [{ source: from, target: to, type }] : [];
20
+ });
21
+ }
22
+ function layerRanks(nodes, links) {
23
+ const groups = new Map();
24
+ function root(node) {
25
+ let member = node;
26
+ for (let parent = groups.get(member); parent; parent = groups.get(member))
27
+ member = parent;
28
+ if (node !== member)
29
+ groups.set(node, member);
30
+ return member;
31
+ }
32
+ for (const { source, target, type } of links) {
33
+ if (type !== 'triggering')
34
+ continue;
35
+ const a = root(source.owner);
36
+ const b = root(target.owner);
37
+ if (a !== b)
38
+ groups.set(b, a);
39
+ }
40
+ const members = [...new Set(nodes.map(root))];
41
+ const incoming = new Map(members.map((node) => [node, 0]));
42
+ const outgoing = new Map();
43
+ const values = new Map();
44
+ const adjacent = new Map();
45
+ function connect(a, b) {
46
+ const neighbors = adjacent.get(a);
47
+ if (neighbors)
48
+ neighbors.push(b);
49
+ else
50
+ adjacent.set(a, [b]);
51
+ }
52
+ for (const { source, target, type } of links) {
53
+ const a = root(source.owner);
54
+ const b = root(target.owner);
55
+ if (a === b)
56
+ continue;
57
+ connect(a, b);
58
+ connect(b, a);
59
+ const deployment = type === 'assignment' && a.row === 'technology' && target.owner.column === 'passiveStructure';
60
+ const ordered = type === 'realization' || type === 'serving' || deployment
61
+ ? [b, a]
62
+ : type === 'assignment' && a.row !== 'technology'
63
+ ? [a, b]
64
+ : undefined;
65
+ if (!ordered)
66
+ continue;
67
+ const [above, below] = ordered;
68
+ let targets = outgoing.get(above);
69
+ if (!targets) {
70
+ targets = new Set();
71
+ outgoing.set(above, targets);
72
+ }
73
+ if (!targets.has(below)) {
74
+ targets.add(below);
75
+ incoming.set(below, (incoming.get(below) ?? 0) + 1);
76
+ }
77
+ }
78
+ const unranked = new Set(members);
79
+ function assign(ready) {
80
+ for (const node of ready) {
81
+ if (!unranked.delete(node))
82
+ continue;
83
+ for (const target of outgoing.get(node) ?? []) {
84
+ if (!unranked.has(target))
85
+ continue;
86
+ values.set(target, Math.max(values.get(target) ?? 0, (values.get(node) ?? 0) + 1));
87
+ const remaining = (incoming.get(target) ?? 0) - 1;
88
+ incoming.set(target, remaining);
89
+ if (remaining === 0)
90
+ ready.push(target);
91
+ }
92
+ }
93
+ }
94
+ assign(members.filter((node) => incoming.get(node) === 0));
95
+ for (const node of members)
96
+ if (unranked.has(node))
97
+ assign([node]);
98
+ const ranks = new Map();
99
+ for (const node of nodes) {
100
+ const owner = root(node);
101
+ const neighbors = adjacent.get(owner) ?? [];
102
+ const rank = values.get(owner) ??
103
+ (outgoing.has(owner)
104
+ ? 0
105
+ : neighbors.reduce((deepest, neighbor) => Math.max(deepest, values.get(neighbor) ?? 0), 0));
106
+ const siblings = ranks.get(rank);
107
+ if (siblings)
108
+ siblings.push(node);
109
+ else
110
+ ranks.set(rank, [node]);
111
+ }
112
+ return [...ranks].sort(([a], [b]) => a - b).map(([, nodes]) => nodes);
113
+ }
114
+ function preferredCenter(preferences) {
115
+ preferences.sort((a, b) => a.center - b.center);
116
+ const weight = preferences.reduce((sum, preference) => sum + preference.weight, 0);
117
+ let accumulated = 0;
118
+ for (const [index, preference] of preferences.entries()) {
119
+ accumulated += preference.weight;
120
+ if (accumulated < weight / 2)
121
+ continue;
122
+ const next = preferences[index + 1];
123
+ const center = accumulated === weight / 2 && next ? (preference.center + next.center) / 2 : preference.center;
124
+ return { center, weight };
125
+ }
126
+ return { center: 0, weight: 1 };
127
+ }
128
+ function pack(nodes, preferred, gap) {
129
+ let offset = 0;
130
+ const offsets = nodes.map((node) => {
131
+ const center = offset + node.width / 2;
132
+ offset += node.width + gap;
133
+ return center;
134
+ });
135
+ const blocks = [];
136
+ for (const [index, node] of nodes.entries()) {
137
+ const position = offsets[index] ?? 0;
138
+ const { center, weight } = preferred.get(node) ?? { center: position, weight: 1 };
139
+ const block = { first: index, last: index, mean: center - position, weight };
140
+ // Merge conflicting positions, keeping the ordered boxes at least one gap apart.
141
+ while (true) {
142
+ const previous = blocks.at(-1);
143
+ if (!previous || previous.mean <= block.mean)
144
+ break;
145
+ blocks.pop();
146
+ block.first = previous.first;
147
+ block.mean = (previous.mean * previous.weight + block.mean * block.weight) / (previous.weight + block.weight);
148
+ block.weight += previous.weight;
149
+ }
150
+ blocks.push(block);
151
+ }
152
+ for (const { first, last, mean } of blocks) {
153
+ for (let index = first; index <= last; index++) {
154
+ const node = nodes[index];
155
+ if (node)
156
+ node.x = (offsets[index] ?? 0) + mean - node.width / 2;
157
+ }
158
+ }
159
+ }
160
+ function rowWidth(nodes, gap) {
161
+ return nodes.reduce((sum, { node }) => sum + node.width + gap, -gap);
162
+ }
163
+ function initialOrder(nodes, triggers) {
164
+ return sequence([...nodes].sort((a, b) => Number(b.column === 'passiveStructure') - Number(a.column === 'passiveStructure')), triggers);
165
+ }
166
+ function wrapRank(rank, ordered, gap, maxWidth) {
167
+ const width = rowWidth(rank.nodes, gap);
168
+ if (width <= maxWidth)
169
+ return [rank];
170
+ const owners = new Map(rank.nodes.map((owner) => [owner.node, owner]));
171
+ const count = Math.ceil((width + gap) / (maxWidth + gap));
172
+ // Balance the rows around an equal share instead of filling each row to the limit.
173
+ const share = (width + gap) / count;
174
+ const rows = [];
175
+ let row = [];
176
+ let used = 0;
177
+ for (const node of ordered) {
178
+ const owner = required(owners.get(node), 'the ranked node of a wrapped row');
179
+ const size = node.width + gap;
180
+ if (row.length && (used + size > share + size / 2 || used + node.width > maxWidth)) {
181
+ rows.push(row);
182
+ row = [];
183
+ used = 0;
184
+ }
185
+ row.push(owner);
186
+ used += size;
187
+ }
188
+ rows.push(row);
189
+ return rows.map((nodes) => ({ layer: rank.layer, nodes }));
190
+ }
191
+ export function placeConnectedLayers(nodes, layers, relationships, gap, layerGap, maxRowWidth) {
192
+ const projected = project(nodes, relationships);
193
+ const links = projected.filter(({ source, target }) => source.owner !== target.owner);
194
+ const incident = new Map();
195
+ const triggers = new Map();
196
+ for (const link of links) {
197
+ const { source, target, type } = link;
198
+ for (const { owner } of [source, target]) {
199
+ const edges = incident.get(owner);
200
+ if (edges)
201
+ edges.push(link);
202
+ else
203
+ incident.set(owner, [link]);
204
+ }
205
+ if (type === 'triggering') {
206
+ const outgoing = triggers.get(source.owner.node.id);
207
+ if (outgoing)
208
+ outgoing.push(target.owner.node.id);
209
+ else
210
+ triggers.set(source.owner.node.id, [target.owner.node.id]);
211
+ }
212
+ }
213
+ const ranks = layers.flatMap((layer) => layerRanks(nodes.filter(({ row }) => row === layer), links.filter(({ source, target }) => source.owner.row === layer && target.owner.row === layer)).flatMap((nodes) => {
214
+ const rank = { layer, nodes };
215
+ return wrapRank(rank, initialOrder(nodes, triggers), gap, maxRowWidth);
216
+ }));
217
+ const rankByNode = new Map(ranks.flatMap((rank) => rank.nodes.map((node) => [node, rank])));
218
+ const processRanks = new Set();
219
+ for (const { source, target, type } of projected) {
220
+ const rank = rankByNode.get(source.owner);
221
+ if (type === 'triggering' && rank && rank === rankByNode.get(target.owner))
222
+ processRanks.add(rank);
223
+ }
224
+ let anchor = 0;
225
+ let anchorWidth = 0;
226
+ let anchorHasProcess = false;
227
+ const original = new Map();
228
+ for (const [index, rank] of ranks.entries()) {
229
+ const ordered = initialOrder(rank.nodes, triggers);
230
+ const width = rowWidth(rank.nodes, gap);
231
+ const hasProcess = processRanks.has(rank);
232
+ if ((hasProcess && !anchorHasProcess) || (hasProcess === anchorHasProcess && width > anchorWidth)) {
233
+ anchor = index;
234
+ anchorWidth = width;
235
+ anchorHasProcess = hasProcess;
236
+ }
237
+ let left = -width / 2;
238
+ for (const node of ordered) {
239
+ node.x = left;
240
+ original.set(node, left + node.width / 2);
241
+ left += node.width + gap;
242
+ }
243
+ }
244
+ const nearby = new Set();
245
+ const anchored = ranks[anchor];
246
+ if (anchored)
247
+ nearby.add(anchored);
248
+ function align(rank) {
249
+ const preferred = new Map();
250
+ for (const owner of rank.nodes) {
251
+ const node = owner.node;
252
+ const positions = [{ center: original.get(node) ?? 0, weight: 0.25 }];
253
+ for (const { source, target, type } of incident.get(owner) ?? []) {
254
+ const here = source.owner === owner ? source : target;
255
+ const there = source.owner === owner ? target : source;
256
+ const other = rankByNode.get(there.owner);
257
+ if (!other || !nearby.has(other))
258
+ continue;
259
+ const neighbor = there.owner.node;
260
+ const vertical = type === 'realization' || type === 'serving';
261
+ const hostingPeer = type === 'assignment' && rank.layer === 'technology' && here === source;
262
+ if (other === rank && type !== 'access' && !hostingPeer)
263
+ continue;
264
+ const separation = type === 'access' ? (neighbor.width + node.width) / 2 + gap : 0;
265
+ const weight = vertical ? (here.nested || there.nested ? 10 : 5) : type === 'access' ? 2 : 1;
266
+ positions.push({
267
+ center: neighbor.x + neighbor.width / 2 + there.offset - here.offset + (here === source ? separation : -separation),
268
+ weight,
269
+ });
270
+ }
271
+ preferred.set(node, preferredCenter(positions));
272
+ }
273
+ const ordered = sequence([...rank.nodes].sort((a, b) => (preferred.get(a.node)?.center ?? 0) - (preferred.get(b.node)?.center ?? 0)), triggers);
274
+ pack(ordered, preferred, gap);
275
+ nearby.add(rank);
276
+ }
277
+ for (let distance = 1; distance < ranks.length; distance++) {
278
+ const above = ranks[anchor - distance];
279
+ const below = ranks[anchor + distance];
280
+ if (above)
281
+ align(above);
282
+ if (below)
283
+ align(below);
284
+ }
285
+ for (const sweep of [ranks, ranks.toReversed()]) {
286
+ for (const rank of sweep)
287
+ if (rank !== anchored)
288
+ align(rank);
289
+ }
290
+ let left = 0;
291
+ let right = 0;
292
+ let height = 0;
293
+ let previousLayer;
294
+ for (const rank of ranks) {
295
+ if (previousLayer !== undefined)
296
+ height += previousLayer === rank.layer ? gap : layerGap;
297
+ const rowHeight = rank.nodes.reduce((maximum, { node }) => Math.max(maximum, node.height), 0);
298
+ for (const { node } of rank.nodes) {
299
+ node.y = height + (rowHeight - node.height) / 2;
300
+ left = Math.min(left, node.x);
301
+ right = Math.max(right, node.x + node.width);
302
+ }
303
+ height += rowHeight;
304
+ previousLayer = rank.layer;
305
+ }
306
+ const children = nodes.map(({ node }) => node);
307
+ for (const node of children)
308
+ node.x -= left;
309
+ return { width: right - left, height, children };
310
+ }
311
+ export function sequence(nodes, flows) {
312
+ const pending = new Map(nodes.map(({ node }) => [node.id, 0]));
313
+ for (const { node } of nodes) {
314
+ for (const target of flows.get(node.id) ?? []) {
315
+ const count = pending.get(target);
316
+ if (count !== undefined)
317
+ pending.set(target, count + 1);
318
+ }
319
+ }
320
+ const byId = new Map(nodes.map(({ node }) => [node.id, node]));
321
+ const ready = nodes.filter(({ node }) => pending.get(node.id) === 0).map(({ node }) => node);
322
+ const ordered = [];
323
+ function drainReady() {
324
+ for (const member of ready) {
325
+ if (!pending.delete(member.id))
326
+ continue;
327
+ ordered.push(member);
328
+ for (const target of flows.get(member.id) ?? []) {
329
+ const count = pending.get(target);
330
+ const next = byId.get(target);
331
+ if (count === undefined || !next)
332
+ continue;
333
+ pending.set(target, count - 1);
334
+ if (count === 1)
335
+ ready.push(next);
336
+ }
337
+ }
338
+ ready.length = 0;
339
+ }
340
+ drainReady();
341
+ for (const { node } of nodes) {
342
+ // When every remaining node has a predecessor, break the cycle in declaration order.
343
+ if (!pending.has(node.id))
344
+ continue;
345
+ ready.push(node);
346
+ drainReady();
347
+ }
348
+ return ordered;
349
+ }
350
+ //# sourceMappingURL=relationshipPlacement.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"relationshipPlacement.js","sourceRoot":"","sources":["../../src/mermaid/relationshipPlacement.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAmB1C,SAAS,OAAO,CAAC,KAA2B,EAAE,aAA4C;IACxF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,SAAS,KAAK,CAAC,IAAgB,EAAE,IAAY;YAC3C,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;gBACrB,KAAK;gBACL,MAAM,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC;gBACpD,MAAM,EAAE,IAAI,KAAK,KAAK,CAAC,IAAI;aAC5B,CAAC,CAAC;YACH,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,IAAI,EAAE;gBAAE,KAAK,CAAC,KAAK,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;QACD,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,aAAa,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE;QACxD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjC,OAAO,IAAI,IAAI,EAAE,IAAI,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/E,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,UAAU,CAAC,KAA2B,EAAE,KAAsB;IACrE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC/C,SAAS,IAAI,CAAC,IAAe;QAC3B,IAAI,MAAM,GAAG,IAAI,CAAC;QAClB,KAAK,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,MAAM,GAAG,MAAM,CAAC;QAC3F,IAAI,IAAI,KAAK,MAAM;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC9C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,CAAC;QAC7C,IAAI,IAAI,KAAK,YAAY;YAAE,SAAS;QACpC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA6B,CAAC;IACtD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA0B,CAAC;IACnD,SAAS,OAAO,CAAC,CAAY,EAAE,CAAY;QACzC,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,SAAS;YAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YAC5B,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IACD,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QACtB,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACd,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACd,MAAM,UAAU,GAAG,IAAI,KAAK,YAAY,IAAI,CAAC,CAAC,GAAG,KAAK,YAAY,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,kBAAkB,CAAC;QACjH,MAAM,OAAO,GACX,IAAI,KAAK,aAAa,IAAI,IAAI,KAAK,SAAS,IAAI,UAAU;YACxD,CAAC,CAAE,CAAC,CAAC,EAAE,CAAC,CAAW;YACnB,CAAC,CAAC,IAAI,KAAK,YAAY,IAAI,CAAC,CAAC,GAAG,KAAK,YAAY;gBAC/C,CAAC,CAAE,CAAC,CAAC,EAAE,CAAC,CAAW;gBACnB,CAAC,CAAC,SAAS,CAAC;QAClB,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,OAAO,CAAC;QAC/B,IAAI,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;YACpB,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC/B,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACnB,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAClC,SAAS,MAAM,CAAC,KAAkB;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC;gBAAE,SAAS;YACrC,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC9C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,SAAS;gBACpC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACnF,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAClD,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAChC,IAAI,SAAS,KAAK,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3D,KAAK,MAAM,IAAI,IAAI,OAAO;QAAE,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAEnE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QAC5C,MAAM,IAAI,GACR,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;YACjB,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;gBAClB,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChG,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,QAAQ;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAC7B,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;AACxE,CAAC;AAOD,SAAS,eAAe,CAAC,WAAyB;IAChD,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAChD,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,UAAU,EAAE,EAAE,CAAC,GAAG,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACnF,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;QACxD,WAAW,IAAI,UAAU,CAAC,MAAM,CAAC;QACjC,IAAI,WAAW,GAAG,MAAM,GAAG,CAAC;YAAE,SAAS;QACvC,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,WAAW,KAAK,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QAC9G,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IAC5B,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;AAClC,CAAC;AAED,SAAS,IAAI,CAAC,KAA4B,EAAE,SAA8C,EAAE,GAAW;IACrG,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACjC,MAAM,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACvC,MAAM,IAAI,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;QAC3B,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC,CAAC;IACH,MAAM,MAAM,GAAoE,EAAE,CAAC;IACnF,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAClF,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,QAAQ,EAAE,MAAM,EAAE,CAAC;QAC7E,iFAAiF;QACjF,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,QAAQ,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI;gBAAE,MAAM;YACpD,MAAM,CAAC,GAAG,EAAE,CAAC;YACb,KAAK,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;YAC7B,KAAK,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9G,KAAK,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC;QAClC,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC;IACD,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,MAAM,EAAE,CAAC;QAC3C,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAC1B,IAAI,IAAI;gBAAE,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,KAA2B,EAAE,GAAW;IACxD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;AACvE,CAAC;AAED,SAAS,YAAY,CAAC,KAA2B,EAAE,QAAgD;IACjG,OAAO,QAAQ,CACb,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,KAAK,kBAAkB,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,KAAK,kBAAkB,CAAC,CAAC,EAC5G,QAAQ,CACT,CAAC;AACJ,CAAC;AAED,SAAS,QAAQ,CAAC,IAAU,EAAE,OAA8B,EAAE,GAAW,EAAE,QAAgB;IACzF,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACxC,IAAI,KAAK,IAAI,QAAQ;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC;IAC1D,mFAAmF;IACnF,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;IACpC,MAAM,IAAI,GAAkB,EAAE,CAAC;IAC/B,IAAI,GAAG,GAAgB,EAAE,CAAC;IAC1B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,kCAAkC,CAAC,CAAC;QAC7E,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;QAC9B,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC;YACnF,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,GAAG,GAAG,EAAE,CAAC;YACT,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChB,IAAI,IAAI,IAAI,CAAC;IACf,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACf,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,MAAM,UAAU,oBAAoB,CAClC,KAA2B,EAC3B,MAAyB,EACzB,aAA4C,EAC5C,GAAW,EACX,QAAgB,EAChB,WAAmB;IAEnB,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,CAAC,CAAC;IACtF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtC,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;gBACvB,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,IAAI,KAAK,YAAY,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpD,IAAI,QAAQ;gBAAE,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;;gBAC7C,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAW,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAC7C,UAAU,CACR,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,KAAK,CAAC,EACxC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,CAC/F,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAClB,MAAM,IAAI,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QAC9B,OAAO,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IACzE,CAAC,CAAC,CACH,CAAC;IACF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAU,CAAC,CAAC,CAAC,CAAC;IACrG,MAAM,YAAY,GAAG,IAAI,GAAG,EAAQ,CAAC;IACrC,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,SAAS,EAAE,CAAC;QACjD,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,IAAI,KAAK,YAAY,IAAI,IAAI,IAAI,IAAI,KAAK,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC;YAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACrG,CAAC;IAED,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,gBAAgB,GAAG,KAAK,CAAC;IAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC/C,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACnD,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACxC,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,UAAU,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,KAAK,gBAAgB,IAAI,KAAK,GAAG,WAAW,CAAC,EAAE,CAAC;YAClG,MAAM,GAAG,KAAK,CAAC;YACf,WAAW,GAAG,KAAK,CAAC;YACpB,gBAAgB,GAAG,UAAU,CAAC;QAChC,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;YACd,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC1C,IAAI,IAAI,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAQ,CAAC;IAC/B,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;IAC/B,IAAI,QAAQ;QAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACnC,SAAS,KAAK,CAAC,IAAU;QACvB,MAAM,SAAS,GAAG,IAAI,GAAG,EAA0B,CAAC;QACpD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;YACxB,MAAM,SAAS,GAAG,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;YACtE,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjE,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;gBACtD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;gBACvD,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBAC1C,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAC3C,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;gBAClC,MAAM,QAAQ,GAAG,IAAI,KAAK,aAAa,IAAI,IAAI,KAAK,SAAS,CAAC;gBAC9D,MAAM,WAAW,GAAG,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY,IAAI,IAAI,KAAK,MAAM,CAAC;gBAC5F,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,WAAW;oBAAE,SAAS;gBAClE,MAAM,UAAU,GAAG,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnF,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7F,SAAS,CAAC,IAAI,CAAC;oBACb,MAAM,EACJ,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;oBAC7G,MAAM;iBACP,CAAC,CAAC;YACL,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,MAAM,OAAO,GAAG,QAAQ,CACtB,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC,EAC3G,QAAQ,CACT,CAAC;QACF,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC;QAC3D,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;QACvC,IAAI,KAAK;YAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QACxB,IAAI,KAAK;YAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC,EAAE,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,IAAI,IAAI,KAAK,QAAQ;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC;IAED,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,aAAiC,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,aAAa,KAAK,SAAS;YAAE,MAAM,IAAI,aAAa,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;QACzF,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9F,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAChD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC;QACD,MAAM,IAAI,SAAS,CAAC;QACpB,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC;IAC7B,CAAC;IACD,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,QAAQ;QAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;IAC5C,OAAO,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;AACnD,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,KAA2B,EAAE,KAA6C;IACjG,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/D,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAC7F,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,SAAS,UAAU;QACjB,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;gBAAE,SAAS;YACzC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBAChD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAClC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC9B,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,IAAI;oBAAE,SAAS;gBAC3C,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBAC/B,IAAI,KAAK,KAAK,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QACD,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACnB,CAAC;IACD,UAAU,EAAE,CAAC;IACb,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,CAAC;QAC7B,qFAAqF;QACrF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QACpC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,UAAU,EAAE,CAAC;IACf,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC","sourcesContent":["import type { Arrangement, LayoutRelationship, PlacedNode, SizedNode } from './architectureLayout.js';\nimport { required } from './invariant.js';\n\ninterface Endpoint {\n owner: SizedNode;\n offset: number;\n nested: boolean;\n}\n\ninterface Link {\n source: Endpoint;\n target: Endpoint;\n type: string;\n}\n\ninterface Rank {\n layer: string;\n nodes: SizedNode[];\n}\n\nfunction project(nodes: readonly SizedNode[], relationships: readonly LayoutRelationship[]): Link[] {\n const endpoints = new Map<string, Endpoint>();\n for (const owner of nodes) {\n function visit(node: PlacedNode, left: number): void {\n endpoints.set(node.id, {\n owner,\n offset: left + node.width / 2 - owner.node.width / 2,\n nested: node !== owner.node,\n });\n for (const child of node.children ?? []) visit(child, left + child.x);\n }\n visit(owner.node, 0);\n }\n return relationships.flatMap(({ source, target, type }) => {\n const from = endpoints.get(source);\n const to = endpoints.get(target);\n return from && to && from !== to ? [{ source: from, target: to, type }] : [];\n });\n}\n\nfunction layerRanks(nodes: readonly SizedNode[], links: readonly Link[]): SizedNode[][] {\n const groups = new Map<SizedNode, SizedNode>();\n function root(node: SizedNode): SizedNode {\n let member = node;\n for (let parent = groups.get(member); parent; parent = groups.get(member)) member = parent;\n if (node !== member) groups.set(node, member);\n return member;\n }\n for (const { source, target, type } of links) {\n if (type !== 'triggering') continue;\n const a = root(source.owner);\n const b = root(target.owner);\n if (a !== b) groups.set(b, a);\n }\n const members = [...new Set(nodes.map(root))];\n const incoming = new Map(members.map((node) => [node, 0]));\n const outgoing = new Map<SizedNode, Set<SizedNode>>();\n const values = new Map<SizedNode, number>();\n const adjacent = new Map<SizedNode, SizedNode[]>();\n function connect(a: SizedNode, b: SizedNode): void {\n const neighbors = adjacent.get(a);\n if (neighbors) neighbors.push(b);\n else adjacent.set(a, [b]);\n }\n for (const { source, target, type } of links) {\n const a = root(source.owner);\n const b = root(target.owner);\n if (a === b) continue;\n connect(a, b);\n connect(b, a);\n const deployment = type === 'assignment' && a.row === 'technology' && target.owner.column === 'passiveStructure';\n const ordered =\n type === 'realization' || type === 'serving' || deployment\n ? ([b, a] as const)\n : type === 'assignment' && a.row !== 'technology'\n ? ([a, b] as const)\n : undefined;\n if (!ordered) continue;\n const [above, below] = ordered;\n let targets = outgoing.get(above);\n if (!targets) {\n targets = new Set();\n outgoing.set(above, targets);\n }\n if (!targets.has(below)) {\n targets.add(below);\n incoming.set(below, (incoming.get(below) ?? 0) + 1);\n }\n }\n const unranked = new Set(members);\n function assign(ready: SizedNode[]): void {\n for (const node of ready) {\n if (!unranked.delete(node)) continue;\n for (const target of outgoing.get(node) ?? []) {\n if (!unranked.has(target)) continue;\n values.set(target, Math.max(values.get(target) ?? 0, (values.get(node) ?? 0) + 1));\n const remaining = (incoming.get(target) ?? 0) - 1;\n incoming.set(target, remaining);\n if (remaining === 0) ready.push(target);\n }\n }\n }\n assign(members.filter((node) => incoming.get(node) === 0));\n for (const node of members) if (unranked.has(node)) assign([node]);\n\n const ranks = new Map<number, SizedNode[]>();\n for (const node of nodes) {\n const owner = root(node);\n const neighbors = adjacent.get(owner) ?? [];\n const rank =\n values.get(owner) ??\n (outgoing.has(owner)\n ? 0\n : neighbors.reduce((deepest, neighbor) => Math.max(deepest, values.get(neighbor) ?? 0), 0));\n const siblings = ranks.get(rank);\n if (siblings) siblings.push(node);\n else ranks.set(rank, [node]);\n }\n return [...ranks].sort(([a], [b]) => a - b).map(([, nodes]) => nodes);\n}\n\ninterface Preference {\n center: number;\n weight: number;\n}\n\nfunction preferredCenter(preferences: Preference[]): Preference {\n preferences.sort((a, b) => a.center - b.center);\n const weight = preferences.reduce((sum, preference) => sum + preference.weight, 0);\n let accumulated = 0;\n for (const [index, preference] of preferences.entries()) {\n accumulated += preference.weight;\n if (accumulated < weight / 2) continue;\n const next = preferences[index + 1];\n const center = accumulated === weight / 2 && next ? (preference.center + next.center) / 2 : preference.center;\n return { center, weight };\n }\n return { center: 0, weight: 1 };\n}\n\nfunction pack(nodes: readonly PlacedNode[], preferred: ReadonlyMap<PlacedNode, Preference>, gap: number): void {\n let offset = 0;\n const offsets = nodes.map((node) => {\n const center = offset + node.width / 2;\n offset += node.width + gap;\n return center;\n });\n const blocks: { first: number; last: number; mean: number; weight: number }[] = [];\n for (const [index, node] of nodes.entries()) {\n const position = offsets[index] ?? 0;\n const { center, weight } = preferred.get(node) ?? { center: position, weight: 1 };\n const block = { first: index, last: index, mean: center - position, weight };\n // Merge conflicting positions, keeping the ordered boxes at least one gap apart.\n while (true) {\n const previous = blocks.at(-1);\n if (!previous || previous.mean <= block.mean) break;\n blocks.pop();\n block.first = previous.first;\n block.mean = (previous.mean * previous.weight + block.mean * block.weight) / (previous.weight + block.weight);\n block.weight += previous.weight;\n }\n blocks.push(block);\n }\n for (const { first, last, mean } of blocks) {\n for (let index = first; index <= last; index++) {\n const node = nodes[index];\n if (node) node.x = (offsets[index] ?? 0) + mean - node.width / 2;\n }\n }\n}\n\nfunction rowWidth(nodes: readonly SizedNode[], gap: number): number {\n return nodes.reduce((sum, { node }) => sum + node.width + gap, -gap);\n}\n\nfunction initialOrder(nodes: readonly SizedNode[], triggers: ReadonlyMap<string, readonly string[]>): PlacedNode[] {\n return sequence(\n [...nodes].sort((a, b) => Number(b.column === 'passiveStructure') - Number(a.column === 'passiveStructure')),\n triggers,\n );\n}\n\nfunction wrapRank(rank: Rank, ordered: readonly PlacedNode[], gap: number, maxWidth: number): Rank[] {\n const width = rowWidth(rank.nodes, gap);\n if (width <= maxWidth) return [rank];\n const owners = new Map(rank.nodes.map((owner) => [owner.node, owner]));\n const count = Math.ceil((width + gap) / (maxWidth + gap));\n // Balance the rows around an equal share instead of filling each row to the limit.\n const share = (width + gap) / count;\n const rows: SizedNode[][] = [];\n let row: SizedNode[] = [];\n let used = 0;\n for (const node of ordered) {\n const owner = required(owners.get(node), 'the ranked node of a wrapped row');\n const size = node.width + gap;\n if (row.length && (used + size > share + size / 2 || used + node.width > maxWidth)) {\n rows.push(row);\n row = [];\n used = 0;\n }\n row.push(owner);\n used += size;\n }\n rows.push(row);\n return rows.map((nodes) => ({ layer: rank.layer, nodes }));\n}\n\nexport function placeConnectedLayers(\n nodes: readonly SizedNode[],\n layers: readonly string[],\n relationships: readonly LayoutRelationship[],\n gap: number,\n layerGap: number,\n maxRowWidth: number,\n): Arrangement {\n const projected = project(nodes, relationships);\n const links = projected.filter(({ source, target }) => source.owner !== target.owner);\n const incident = new Map<SizedNode, Link[]>();\n const triggers = new Map<string, string[]>();\n for (const link of links) {\n const { source, target, type } = link;\n for (const { owner } of [source, target]) {\n const edges = incident.get(owner);\n if (edges) edges.push(link);\n else incident.set(owner, [link]);\n }\n if (type === 'triggering') {\n const outgoing = triggers.get(source.owner.node.id);\n if (outgoing) outgoing.push(target.owner.node.id);\n else triggers.set(source.owner.node.id, [target.owner.node.id]);\n }\n }\n const ranks: Rank[] = layers.flatMap((layer) =>\n layerRanks(\n nodes.filter(({ row }) => row === layer),\n links.filter(({ source, target }) => source.owner.row === layer && target.owner.row === layer),\n ).flatMap((nodes) => {\n const rank = { layer, nodes };\n return wrapRank(rank, initialOrder(nodes, triggers), gap, maxRowWidth);\n }),\n );\n const rankByNode = new Map(ranks.flatMap((rank) => rank.nodes.map((node) => [node, rank] as const)));\n const processRanks = new Set<Rank>();\n for (const { source, target, type } of projected) {\n const rank = rankByNode.get(source.owner);\n if (type === 'triggering' && rank && rank === rankByNode.get(target.owner)) processRanks.add(rank);\n }\n\n let anchor = 0;\n let anchorWidth = 0;\n let anchorHasProcess = false;\n const original = new Map<PlacedNode, number>();\n for (const [index, rank] of ranks.entries()) {\n const ordered = initialOrder(rank.nodes, triggers);\n const width = rowWidth(rank.nodes, gap);\n const hasProcess = processRanks.has(rank);\n if ((hasProcess && !anchorHasProcess) || (hasProcess === anchorHasProcess && width > anchorWidth)) {\n anchor = index;\n anchorWidth = width;\n anchorHasProcess = hasProcess;\n }\n let left = -width / 2;\n for (const node of ordered) {\n node.x = left;\n original.set(node, left + node.width / 2);\n left += node.width + gap;\n }\n }\n\n const nearby = new Set<Rank>();\n const anchored = ranks[anchor];\n if (anchored) nearby.add(anchored);\n function align(rank: Rank): void {\n const preferred = new Map<PlacedNode, Preference>();\n for (const owner of rank.nodes) {\n const node = owner.node;\n const positions = [{ center: original.get(node) ?? 0, weight: 0.25 }];\n for (const { source, target, type } of incident.get(owner) ?? []) {\n const here = source.owner === owner ? source : target;\n const there = source.owner === owner ? target : source;\n const other = rankByNode.get(there.owner);\n if (!other || !nearby.has(other)) continue;\n const neighbor = there.owner.node;\n const vertical = type === 'realization' || type === 'serving';\n const hostingPeer = type === 'assignment' && rank.layer === 'technology' && here === source;\n if (other === rank && type !== 'access' && !hostingPeer) continue;\n const separation = type === 'access' ? (neighbor.width + node.width) / 2 + gap : 0;\n const weight = vertical ? (here.nested || there.nested ? 10 : 5) : type === 'access' ? 2 : 1;\n positions.push({\n center:\n neighbor.x + neighbor.width / 2 + there.offset - here.offset + (here === source ? separation : -separation),\n weight,\n });\n }\n preferred.set(node, preferredCenter(positions));\n }\n const ordered = sequence(\n [...rank.nodes].sort((a, b) => (preferred.get(a.node)?.center ?? 0) - (preferred.get(b.node)?.center ?? 0)),\n triggers,\n );\n pack(ordered, preferred, gap);\n nearby.add(rank);\n }\n for (let distance = 1; distance < ranks.length; distance++) {\n const above = ranks[anchor - distance];\n const below = ranks[anchor + distance];\n if (above) align(above);\n if (below) align(below);\n }\n for (const sweep of [ranks, ranks.toReversed()]) {\n for (const rank of sweep) if (rank !== anchored) align(rank);\n }\n\n let left = 0;\n let right = 0;\n let height = 0;\n let previousLayer: string | undefined;\n for (const rank of ranks) {\n if (previousLayer !== undefined) height += previousLayer === rank.layer ? gap : layerGap;\n const rowHeight = rank.nodes.reduce((maximum, { node }) => Math.max(maximum, node.height), 0);\n for (const { node } of rank.nodes) {\n node.y = height + (rowHeight - node.height) / 2;\n left = Math.min(left, node.x);\n right = Math.max(right, node.x + node.width);\n }\n height += rowHeight;\n previousLayer = rank.layer;\n }\n const children = nodes.map(({ node }) => node);\n for (const node of children) node.x -= left;\n return { width: right - left, height, children };\n}\n\nexport function sequence(nodes: readonly SizedNode[], flows: ReadonlyMap<string, readonly string[]>): PlacedNode[] {\n const pending = new Map(nodes.map(({ node }) => [node.id, 0]));\n for (const { node } of nodes) {\n for (const target of flows.get(node.id) ?? []) {\n const count = pending.get(target);\n if (count !== undefined) pending.set(target, count + 1);\n }\n }\n const byId = new Map(nodes.map(({ node }) => [node.id, node]));\n const ready = nodes.filter(({ node }) => pending.get(node.id) === 0).map(({ node }) => node);\n const ordered: PlacedNode[] = [];\n function drainReady(): void {\n for (const member of ready) {\n if (!pending.delete(member.id)) continue;\n ordered.push(member);\n for (const target of flows.get(member.id) ?? []) {\n const count = pending.get(target);\n const next = byId.get(target);\n if (count === undefined || !next) continue;\n pending.set(target, count - 1);\n if (count === 1) ready.push(next);\n }\n }\n ready.length = 0;\n }\n drainReady();\n for (const { node } of nodes) {\n // When every remaining node has a predecessor, break the cycle in declaration order.\n if (!pending.has(node.id)) continue;\n ready.push(node);\n drainReady();\n }\n return ordered;\n}\n"]}
@@ -0,0 +1,17 @@
1
+ import type { ArchiMatePluginOptions } from '../archimateDetector.js';
2
+ import type { DiagramColours, PaletteColours } from '../styles.js';
3
+ import type { PlacedEdge } from './labels.js';
4
+ import type { Placement } from './place.js';
5
+ import { type TextMetrics } from './shared.js';
6
+ import type { Viewport } from './viewport.js';
7
+ export interface DrawInputs {
8
+ readonly id: string;
9
+ readonly viewport: Viewport;
10
+ readonly placement: Placement;
11
+ readonly edges: readonly PlacedEdge[];
12
+ readonly title: TextMetrics | undefined;
13
+ readonly palette: PaletteColours;
14
+ readonly colours: DiagramColours;
15
+ readonly background: Required<ArchiMatePluginOptions>['background'];
16
+ }
17
+ export declare function drawDiagram(svg: SVGSVGElement, { id, viewport, placement, edges, title, palette, colours, background }: DrawInputs): void;