@cardenelabs/dragon 0.43.0 → 0.45.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.
- package/README.md +21 -0
- package/dist/cli.cjs +6804 -5032
- package/dist/cli.cjs.map +1 -1
- package/dist/cli.js +6804 -5032
- package/dist/cli.js.map +1 -1
- package/dist/export.cjs +7172 -5536
- package/dist/export.cjs.map +1 -1
- package/dist/export.d.cts +1 -1
- package/dist/export.d.ts +1 -1
- package/dist/export.js +7171 -5537
- package/dist/export.js.map +1 -1
- package/dist/index.cjs +12244 -10449
- package/dist/index.cjs.map +1 -1
- package/dist/index.d.cts +55 -3
- package/dist/index.d.ts +55 -3
- package/dist/index.js +12244 -10449
- package/dist/index.js.map +1 -1
- package/dist/{ink-B6s_SMXG.d.cts → ink-DeDtzaTL.d.cts} +27 -3
- package/dist/{ink-B6s_SMXG.d.ts → ink-DeDtzaTL.d.ts} +27 -3
- package/dist/light/chunk-6ZUKJ3VO.js +489 -0
- package/dist/light/chunk-6ZUKJ3VO.js.map +1 -0
- package/dist/light/chunk-CLS6JVKK.cjs +84 -0
- package/dist/light/chunk-CLS6JVKK.cjs.map +1 -0
- package/dist/light/chunk-JNSHZTPF.js +1141 -0
- package/dist/light/chunk-JNSHZTPF.js.map +1 -0
- package/dist/light/chunk-OUQ44P45.cjs +489 -0
- package/dist/light/chunk-OUQ44P45.cjs.map +1 -0
- package/dist/light/chunk-VRAW7VAQ.cjs +1141 -0
- package/dist/light/chunk-VRAW7VAQ.cjs.map +1 -0
- package/dist/light/chunk-YDKPEKGZ.js +84 -0
- package/dist/light/chunk-YDKPEKGZ.js.map +1 -0
- package/dist/light/git-C4RVNFT6.js +637 -0
- package/dist/light/git-C4RVNFT6.js.map +1 -0
- package/dist/light/git-I7D7RIW2.cjs +637 -0
- package/dist/light/git-I7D7RIW2.cjs.map +1 -0
- package/dist/light/index.cjs +9885 -0
- package/dist/light/index.cjs.map +1 -0
- package/dist/light/index.d.cts +976 -0
- package/dist/light/index.d.ts +976 -0
- package/dist/light/index.js +9885 -0
- package/dist/light/index.js.map +1 -0
- package/dist/light/lineup-FAIKTH3Y.cjs +283 -0
- package/dist/light/lineup-FAIKTH3Y.cjs.map +1 -0
- package/dist/light/lineup-YEG4HHEI.js +283 -0
- package/dist/light/lineup-YEG4HHEI.js.map +1 -0
- package/dist/light/state-P3LIVI3K.js +335 -0
- package/dist/light/state-P3LIVI3K.js.map +1 -0
- package/dist/light/state-ZZUK6AQT.cjs +335 -0
- package/dist/light/state-ZZUK6AQT.cjs.map +1 -0
- package/dist/light/time-64DJKYAL.cjs +719 -0
- package/dist/light/time-64DJKYAL.cjs.map +1 -0
- package/dist/light/time-B5WUQOFP.js +719 -0
- package/dist/light/time-B5WUQOFP.js.map +1 -0
- package/dist/light/tree-5HPREYW2.js +478 -0
- package/dist/light/tree-5HPREYW2.js.map +1 -0
- package/dist/light/tree-66EH4QVI.cjs +478 -0
- package/dist/light/tree-66EH4QVI.cjs.map +1 -0
- package/dist/node.cjs +1932 -680
- package/dist/node.cjs.map +1 -1
- package/dist/node.js +1932 -680
- package/dist/node.js.map +1 -1
- package/dist/player.global.js +3 -3
- package/package.json +14 -2
- package/src/api.ts +71 -0
- package/src/field-messages.ts +6 -0
- package/src/figure-text.ts +4 -0
- package/src/index.ts +6 -65
- package/src/kinds/all.ts +16 -0
- package/src/kinds/git.ts +3 -0
- package/src/kinds/lineup.ts +3 -0
- package/src/kinds/registry.ts +46 -0
- package/src/kinds/state.ts +2 -0
- package/src/kinds/time.ts +3 -0
- package/src/kinds/tree.ts +3 -0
- package/src/layout/git.ts +0 -1
- package/src/layout/lineup.ts +218 -0
- package/src/layout/time.ts +0 -1
- package/src/layout/tree.ts +0 -1
- package/src/light.ts +31 -0
- package/src/look/values.ts +31 -2
- package/src/messages.ts +54 -0
- package/src/parser.ts +123 -1
- package/src/player-global.ts +3 -0
- package/src/player.ts +1 -1
- package/src/printer.ts +30 -1
- package/src/render/draw.ts +731 -0
- package/src/render/lineup.ts +184 -0
- package/src/render/parts.ts +19 -7
- package/src/render/svg.ts +4 -697
- package/src/render/time.ts +1 -4
- package/src/render/tree.ts +3 -2
- package/src/schema.ts +52 -4
- package/src/schemas/diagram.schema.json +145 -22
- package/src/schemas/validate-diagram.js +1 -1
- package/src/timeline.ts +14 -0
- package/src/view.ts +1 -1
- package/src/words.ts +15 -2
|
@@ -0,0 +1,478 @@
|
|
|
1
|
+
import {
|
|
2
|
+
ALWAYS,
|
|
3
|
+
activeKf,
|
|
4
|
+
arrowHead,
|
|
5
|
+
cs,
|
|
6
|
+
esc,
|
|
7
|
+
glyph,
|
|
8
|
+
pathOf,
|
|
9
|
+
write
|
|
10
|
+
} from "./chunk-6ZUKJ3VO.js";
|
|
11
|
+
import {
|
|
12
|
+
EASE,
|
|
13
|
+
LOOK,
|
|
14
|
+
MOTION,
|
|
15
|
+
TYPE,
|
|
16
|
+
along,
|
|
17
|
+
badgeOnPath,
|
|
18
|
+
badgeRect,
|
|
19
|
+
boxColors,
|
|
20
|
+
boxWidth,
|
|
21
|
+
carrierHalf,
|
|
22
|
+
edgeColor,
|
|
23
|
+
edgesOf,
|
|
24
|
+
gapBetween,
|
|
25
|
+
labelStyle,
|
|
26
|
+
layoutStrip,
|
|
27
|
+
loopUnder,
|
|
28
|
+
pathLength,
|
|
29
|
+
placeLabel,
|
|
30
|
+
placeSlot,
|
|
31
|
+
replaceSameSpot,
|
|
32
|
+
seatCarriers,
|
|
33
|
+
slotBoxWidth,
|
|
34
|
+
slotRooms,
|
|
35
|
+
stripNeed,
|
|
36
|
+
textWidth
|
|
37
|
+
} from "./chunk-JNSHZTPF.js";
|
|
38
|
+
|
|
39
|
+
// src/layout/tree.ts
|
|
40
|
+
function grow(diagram) {
|
|
41
|
+
const boxes = new Set(diagram.boxes.map((b) => b.id));
|
|
42
|
+
const byId = /* @__PURE__ */ new Set();
|
|
43
|
+
const parents = /* @__PURE__ */ new Map();
|
|
44
|
+
const grown = [];
|
|
45
|
+
diagram.steps.forEach((step, s) => {
|
|
46
|
+
step.events.forEach((e, k) => {
|
|
47
|
+
if (e.type !== "leaf" && e.type !== "node" || byId.has(e.id) || boxes.has(e.id)) return;
|
|
48
|
+
const children = e.type === "node" ? [...new Set(e.children)].filter((c) => byId.has(c) && !parents.has(c)) : [];
|
|
49
|
+
for (const c of children) parents.set(c, e.id);
|
|
50
|
+
grown.push({ id: e.id, kind: e.type, children, step: s, event: k, ...e.hash !== void 0 ? { hash: e.hash } : {} });
|
|
51
|
+
byId.add(e.id);
|
|
52
|
+
});
|
|
53
|
+
});
|
|
54
|
+
return { grown, parents };
|
|
55
|
+
}
|
|
56
|
+
function linesOf(g, root) {
|
|
57
|
+
if (g.hash === void 0) return [{ text: g.id, style: TYPE.boxName }];
|
|
58
|
+
if (root)
|
|
59
|
+
return [
|
|
60
|
+
{ text: g.id, style: TYPE.rootName },
|
|
61
|
+
{ text: g.hash, style: TYPE.rootHash }
|
|
62
|
+
];
|
|
63
|
+
if (g.kind === "leaf") return [{ text: g.hash, style: TYPE.treeHash }];
|
|
64
|
+
return [
|
|
65
|
+
{ text: g.hash, style: TYPE.treeHash },
|
|
66
|
+
{ text: g.id, style: TYPE.treeName }
|
|
67
|
+
];
|
|
68
|
+
}
|
|
69
|
+
function route(a, b) {
|
|
70
|
+
const i = LOOK.edge.inset;
|
|
71
|
+
const top = Math.max(a.y, b.y);
|
|
72
|
+
const bottom = Math.min(a.y + a.h, b.y + b.h);
|
|
73
|
+
if (bottom > top) {
|
|
74
|
+
const y = (top + bottom) / 2;
|
|
75
|
+
return b.x >= a.x + a.w ? [
|
|
76
|
+
[a.x + a.w + i, y],
|
|
77
|
+
[b.x - i, y]
|
|
78
|
+
] : [
|
|
79
|
+
[a.x - i, y],
|
|
80
|
+
[b.x + b.w + i, y]
|
|
81
|
+
];
|
|
82
|
+
}
|
|
83
|
+
const left = Math.max(a.x, b.x);
|
|
84
|
+
const right = Math.min(a.x + a.w, b.x + b.w);
|
|
85
|
+
if (right > left) {
|
|
86
|
+
const x = (left + right) / 2;
|
|
87
|
+
return b.y >= a.y + a.h ? [
|
|
88
|
+
[x, a.y + a.h + i],
|
|
89
|
+
[x, b.y - i]
|
|
90
|
+
] : [
|
|
91
|
+
[x, a.y - i],
|
|
92
|
+
[x, b.y + b.h + i]
|
|
93
|
+
];
|
|
94
|
+
}
|
|
95
|
+
const ax = a.x + a.w / 2;
|
|
96
|
+
const ty = b.y + b.h / 2;
|
|
97
|
+
return [
|
|
98
|
+
[ax, b.y > a.y ? a.y + a.h + i : a.y - i],
|
|
99
|
+
[ax, ty],
|
|
100
|
+
[b.x > ax ? b.x - i : b.x + b.w + i, ty]
|
|
101
|
+
];
|
|
102
|
+
}
|
|
103
|
+
function layoutTree(diagram) {
|
|
104
|
+
const { margin, gap, box: B, tree: T, badge: BD } = LOOK;
|
|
105
|
+
const { grown, parents } = grow(diagram);
|
|
106
|
+
const tops = grown.filter((g) => !parents.has(g.id));
|
|
107
|
+
const rootId = tops[tops.length - 1]?.id;
|
|
108
|
+
const byId = new Map(grown.map((g) => [g.id, g]));
|
|
109
|
+
const depth = /* @__PURE__ */ new Map();
|
|
110
|
+
const walk = (id, d) => {
|
|
111
|
+
depth.set(id, d);
|
|
112
|
+
for (const c of byId.get(id)?.children ?? []) walk(c, d + 1);
|
|
113
|
+
};
|
|
114
|
+
for (const t of tops) walk(t.id, 0);
|
|
115
|
+
const texts = new Map(grown.map((g) => [g.id, linesOf(g, g.id === rootId)]));
|
|
116
|
+
const widest = (id) => Math.max(0, ...(texts.get(id) ?? []).map((line) => textWidth(line.text, line.style)));
|
|
117
|
+
const widthOf = (g) => g.id === rootId ? Math.max(T.root.w, T.root.textX + widest(g.id) + T.root.padR) : Math.max(T.w, widest(g.id) + T.padX * 2);
|
|
118
|
+
const cardW = (g) => Math.max(T.card.minW, T.card.padX * 2 + T.card.icon + T.card.gap + textWidth(g.id, TYPE.treeCard));
|
|
119
|
+
const hasCard = (g) => g.kind === "leaf" && g.hash !== void 0;
|
|
120
|
+
const slots = grown.filter((g) => g.children.length === 0);
|
|
121
|
+
const pitch = Math.max(...grown.filter((g) => g.id !== rootId || g.children.length === 0).map((g) => Math.max(widthOf(g), hasCard(g) ? cardW(g) : 0)), T.w) + T.slotGap;
|
|
122
|
+
const x0 = margin + BD.r * 2 + BD.inset;
|
|
123
|
+
const xs = /* @__PURE__ */ new Map();
|
|
124
|
+
slots.forEach((g, i) => xs.set(g.id, x0 + pitch * (i + 0.5)));
|
|
125
|
+
const xOf = (id) => {
|
|
126
|
+
const known = xs.get(id);
|
|
127
|
+
if (known !== void 0) return known;
|
|
128
|
+
const kids = byId.get(id)?.children ?? [];
|
|
129
|
+
const x = (xOf(kids[0]) + xOf(kids[kids.length - 1])) / 2;
|
|
130
|
+
xs.set(id, x);
|
|
131
|
+
return x;
|
|
132
|
+
};
|
|
133
|
+
const top0 = margin + T.top;
|
|
134
|
+
const yOf = (d) => top0 + T.root.h / 2 + d * T.row;
|
|
135
|
+
const colors = boxColors(diagram);
|
|
136
|
+
const nodes = grown.map((g) => {
|
|
137
|
+
const root = g.id === rootId;
|
|
138
|
+
const d = depth.get(g.id) ?? 0;
|
|
139
|
+
const cx = xOf(g.id);
|
|
140
|
+
const cy = yOf(d);
|
|
141
|
+
const w = widthOf(g);
|
|
142
|
+
const h = root ? T.root.h : T.h;
|
|
143
|
+
const lines = texts.get(g.id) ?? [];
|
|
144
|
+
const baselines = lines.length === 1 ? [cy + T.oneY] : root ? [cy + T.root.nameY, cy + T.root.hashY] : [cy + T.hashY, cy + T.nameY];
|
|
145
|
+
const parent = parents.get(g.id);
|
|
146
|
+
const color = root ? T.rootColor : T.color;
|
|
147
|
+
colors.set(g.id, color);
|
|
148
|
+
const cw = cardW(g);
|
|
149
|
+
return {
|
|
150
|
+
id: g.id,
|
|
151
|
+
kind: g.kind,
|
|
152
|
+
depth: d,
|
|
153
|
+
...parent !== void 0 ? { parent } : {},
|
|
154
|
+
children: g.children,
|
|
155
|
+
step: g.step,
|
|
156
|
+
event: g.event,
|
|
157
|
+
...g.hash !== void 0 ? { hash: g.hash } : {},
|
|
158
|
+
root,
|
|
159
|
+
x: cx - w / 2,
|
|
160
|
+
y: cy - h / 2,
|
|
161
|
+
w,
|
|
162
|
+
h,
|
|
163
|
+
cx,
|
|
164
|
+
cy,
|
|
165
|
+
color,
|
|
166
|
+
lines: lines.map((line) => line.text),
|
|
167
|
+
baselines,
|
|
168
|
+
styles: lines.map((line) => line.style),
|
|
169
|
+
...hasCard(g) ? { card: { x: cx - cw / 2, y: cy + T.card.drop - T.card.h / 2, w: cw, h: T.card.h, text: g.id } } : {}
|
|
170
|
+
};
|
|
171
|
+
});
|
|
172
|
+
const placed = new Map(nodes.map((n) => [n.id, n]));
|
|
173
|
+
const links = nodes.flatMap(
|
|
174
|
+
(p) => p.children.flatMap((id) => {
|
|
175
|
+
const c = placed.get(id);
|
|
176
|
+
if (!c) return [];
|
|
177
|
+
const mid = (c.y + p.y + p.h) / 2;
|
|
178
|
+
const points2 = [
|
|
179
|
+
[c.cx, c.y - LOOK.edge.inset],
|
|
180
|
+
[c.cx, mid],
|
|
181
|
+
[p.cx, mid],
|
|
182
|
+
[p.cx, p.y + p.h + LOOK.edge.inset]
|
|
183
|
+
];
|
|
184
|
+
return [{ from: c.id, to: p.id, step: p.step, event: p.event, points: points2 }];
|
|
185
|
+
})
|
|
186
|
+
);
|
|
187
|
+
const rooms = slotRooms(diagram);
|
|
188
|
+
const treeRight = Math.max(x0, ...nodes.flatMap((n) => [n.x + n.w, ...n.card ? [n.card.x + n.card.w] : []]));
|
|
189
|
+
const rootBox = nodes.find((n) => n.root);
|
|
190
|
+
const ids = new Set(diagram.boxes.map((b) => b.id));
|
|
191
|
+
const named = edgesOf(diagram).flatMap(({ edge }) => edge.label !== void 0 && (ids.has(edge.from) || ids.has(edge.to)) ? [textWidth(edge.label, labelStyle(edge.label)) + LOOK.label.padX * 2] : []);
|
|
192
|
+
const boxX = Math.max(treeRight + T.boxGap, (rootBox ? rootBox.x + rootBox.w : x0) + Math.max(0, ...named) + gap * 2);
|
|
193
|
+
let by = rootBox?.y ?? top0;
|
|
194
|
+
const boxes = diagram.boxes.map((b) => {
|
|
195
|
+
const w = Math.max(boxWidth(diagram, b.id, true), slotBoxWidth(rooms.get(b.id), b.icon !== void 0, B.padX));
|
|
196
|
+
const y = by;
|
|
197
|
+
by += B.h + gap;
|
|
198
|
+
const box = {
|
|
199
|
+
id: b.id,
|
|
200
|
+
name: b.name,
|
|
201
|
+
...b.sub !== void 0 ? { sub: b.sub } : {},
|
|
202
|
+
...b.icon !== void 0 ? { icon: b.icon } : {},
|
|
203
|
+
color: colors.get(b.id) ?? "slate",
|
|
204
|
+
x: boxX,
|
|
205
|
+
y,
|
|
206
|
+
w,
|
|
207
|
+
h: B.h,
|
|
208
|
+
cx: boxX + w / 2,
|
|
209
|
+
cy: y + B.h / 2
|
|
210
|
+
};
|
|
211
|
+
placeSlot(box, rooms.get(b.id));
|
|
212
|
+
return box;
|
|
213
|
+
});
|
|
214
|
+
const boxById = new Map(boxes.map((b) => [b.id, b]));
|
|
215
|
+
const runs = [];
|
|
216
|
+
const edges = diagram.steps.flatMap(
|
|
217
|
+
(step, s) => step.events.flatMap((e, k) => {
|
|
218
|
+
if (e.type !== "edge") return [];
|
|
219
|
+
const a = placed.get(e.from) ?? boxById.get(e.from);
|
|
220
|
+
const b = placed.get(e.to) ?? boxById.get(e.to);
|
|
221
|
+
if (!a || !b) return [];
|
|
222
|
+
const up = links.find((l) => l.from === e.from && l.to === e.to);
|
|
223
|
+
const down = links.find((l) => l.from === e.to && l.to === e.from);
|
|
224
|
+
const link = up ?? down;
|
|
225
|
+
if (link) runs.push({ step: s, event: k, link: link.from });
|
|
226
|
+
const points2 = up ? up.points : down ? [...down.points].reverse() : e.from === e.to ? loopUnder({ cx: a.x + a.w / 2, y: a.y, h: a.h }) : route(a, b);
|
|
227
|
+
return [{ step: s, event: k, from: e.from, to: e.to, points: points2, color: edgeColor(e, colors), carry: e.carry }];
|
|
228
|
+
})
|
|
229
|
+
);
|
|
230
|
+
seatCarriers(edges, boxById, rooms);
|
|
231
|
+
const layout = {
|
|
232
|
+
kind: "tree",
|
|
233
|
+
width: 0,
|
|
234
|
+
height: 0,
|
|
235
|
+
regions: [],
|
|
236
|
+
boxes,
|
|
237
|
+
lifelines: [],
|
|
238
|
+
edges,
|
|
239
|
+
labels: [],
|
|
240
|
+
actions: [],
|
|
241
|
+
badges: [],
|
|
242
|
+
paths: [],
|
|
243
|
+
ends: [],
|
|
244
|
+
nodes,
|
|
245
|
+
links,
|
|
246
|
+
runs
|
|
247
|
+
};
|
|
248
|
+
layout.badges = badgesOf(diagram, layout);
|
|
249
|
+
layout.labels = labelsOf(diagram, layout);
|
|
250
|
+
const cards = nodes.flatMap((n) => n.card ? [n.card] : []);
|
|
251
|
+
const solids = [...nodes, ...cards, ...boxes, ...layout.labels];
|
|
252
|
+
const points = edges.flatMap((e) => e.points);
|
|
253
|
+
const right = Math.max(...solids.map((r) => r.x + r.w), ...points.map(([x]) => x), x0);
|
|
254
|
+
const bottom = Math.max(...solids.map((r) => r.y + r.h), ...points.map(([, y]) => y), top0);
|
|
255
|
+
const width = Math.max(right + margin, stripNeed(diagram) + margin * 2);
|
|
256
|
+
const strip = layoutStrip(diagram, margin, bottom + gap, width - margin * 2);
|
|
257
|
+
layout.width = width;
|
|
258
|
+
layout.height = (strip ? strip.y + strip.h : bottom) + margin;
|
|
259
|
+
if (strip) layout.strip = strip;
|
|
260
|
+
layout.badges = badgesOf(diagram, layout);
|
|
261
|
+
return layout;
|
|
262
|
+
}
|
|
263
|
+
function badgesOf(diagram, layout) {
|
|
264
|
+
const { r, inset } = LOOK.badge;
|
|
265
|
+
const apart = r * 2 + inset;
|
|
266
|
+
const taken = [];
|
|
267
|
+
const out = [];
|
|
268
|
+
const solids = [...layout.nodes, ...layout.nodes.flatMap((n) => n.card ? [n.card] : []), ...layout.boxes];
|
|
269
|
+
const free = (p) => taken.every(([x, y]) => Math.hypot(p[0] - x, p[1] - y) >= apart) && solids.every((s) => gapBetween(badgeRect(p), s) >= LOOK.label.touch);
|
|
270
|
+
const put = (s, p, color) => {
|
|
271
|
+
taken.push(p);
|
|
272
|
+
out.push({ step: s, x: p[0], y: p[1], color });
|
|
273
|
+
};
|
|
274
|
+
const passed = /* @__PURE__ */ new Map();
|
|
275
|
+
diagram.steps.forEach((step, s) => {
|
|
276
|
+
const k = step.events.findIndex((e2) => e2.type === "leaf" || e2.type === "node" || e2.type === "edge");
|
|
277
|
+
const first = step.events[k];
|
|
278
|
+
const n = layout.nodes.find((x) => x.step === s && x.event === k);
|
|
279
|
+
if (first && first.type !== "edge" && n) {
|
|
280
|
+
const spots = [
|
|
281
|
+
[n.x - inset - r, n.cy],
|
|
282
|
+
[n.x, n.y],
|
|
283
|
+
[n.x + n.w + inset + r, n.cy],
|
|
284
|
+
[n.x + n.w, n.y]
|
|
285
|
+
];
|
|
286
|
+
put(s, spots.find(free) ?? spots[0], n.color);
|
|
287
|
+
return;
|
|
288
|
+
}
|
|
289
|
+
const e = layout.edges.find((x) => x.step === s && x.event === k);
|
|
290
|
+
if (first?.type === "edge" && e) {
|
|
291
|
+
const key = [e.from, e.to].sort().join("\n");
|
|
292
|
+
const run = layout.runs.some((x) => x.step === s && x.event === k);
|
|
293
|
+
const lines = layout.edges.filter((x) => x !== e).map((x) => x.points);
|
|
294
|
+
const point = passed.get(key) ?? (run ? onLink(e.points, free) : midway(e, free)) ?? badgeOnPath(e.points, taken, lines);
|
|
295
|
+
passed.set(key, point);
|
|
296
|
+
put(s, point, e.color);
|
|
297
|
+
return;
|
|
298
|
+
}
|
|
299
|
+
const box = step.events.flatMap((ev) => ev.type === "swap" || ev.type === "action" ? [ev.box] : []).flatMap((id) => layout.boxes.filter((b) => b.id === id))[0];
|
|
300
|
+
if (box) {
|
|
301
|
+
out.push({ step: s, x: box.x, y: box.y, color: box.color });
|
|
302
|
+
return;
|
|
303
|
+
}
|
|
304
|
+
if (layout.strip && step.events.some((ev) => ev.type === "strip")) {
|
|
305
|
+
out.push({ step: s, x: layout.strip.x + inset, y: layout.strip.y + inset, color: "slate" });
|
|
306
|
+
return;
|
|
307
|
+
}
|
|
308
|
+
const before = out[out.length - 1];
|
|
309
|
+
const root = layout.nodes.find((x) => x.root);
|
|
310
|
+
out.push(before ? { ...before, step: s } : { step: s, x: root?.x ?? LOOK.margin, y: root?.y ?? LOOK.margin, color: root?.color ?? "slate" });
|
|
311
|
+
});
|
|
312
|
+
return replaceSameSpot(out);
|
|
313
|
+
}
|
|
314
|
+
function onLink(points, free) {
|
|
315
|
+
const [p0, p1, p2] = points;
|
|
316
|
+
const flat = Math.abs(p2[0] - p1[0]);
|
|
317
|
+
const { r, inset } = LOOK.badge;
|
|
318
|
+
if (flat >= LOOK.tree.badgeAlong + r) {
|
|
319
|
+
const p = along(points, pathLength([p0, p1]) + LOOK.tree.badgeAlong);
|
|
320
|
+
if (free(p)) return p;
|
|
321
|
+
}
|
|
322
|
+
const side = [p1[0] + r + inset, p1[1]];
|
|
323
|
+
return free(side) ? side : void 0;
|
|
324
|
+
}
|
|
325
|
+
function midway(e, free) {
|
|
326
|
+
const length = pathLength(e.points);
|
|
327
|
+
const room = carrierHalf(e.carry)[0] + LOOK.badge.r + LOOK.badge.inset;
|
|
328
|
+
for (let d = 0; d <= length / 2 - room; d += 1) {
|
|
329
|
+
for (const at of [length / 2 - d, length / 2 + d]) {
|
|
330
|
+
const p = along(e.points, at);
|
|
331
|
+
if (free(p)) return p;
|
|
332
|
+
}
|
|
333
|
+
}
|
|
334
|
+
return void 0;
|
|
335
|
+
}
|
|
336
|
+
function labelsOf(diagram, layout) {
|
|
337
|
+
const labels = [];
|
|
338
|
+
const cards = layout.nodes.flatMap((n) => n.card ? [n.card] : []);
|
|
339
|
+
for (const e of layout.edges) {
|
|
340
|
+
const source = diagram.steps[e.step]?.events[e.event];
|
|
341
|
+
if (source?.type !== "edge" || source.label === void 0) continue;
|
|
342
|
+
const seen = layout.badges.filter((b) => b.step <= e.step).map((b) => badgeRect([b.x, b.y]));
|
|
343
|
+
labels.push(
|
|
344
|
+
placeLabel(
|
|
345
|
+
{ step: e.step, event: e.event, text: source.label, points: e.points, color: e.color, ...source.labelSide ? { side: source.labelSide } : {}, flip: true },
|
|
346
|
+
{ hard: [...layout.nodes, ...layout.boxes], soft: [...cards, ...labels.filter((l) => l.step === e.step)], touch: seen }
|
|
347
|
+
)
|
|
348
|
+
);
|
|
349
|
+
}
|
|
350
|
+
return labels;
|
|
351
|
+
}
|
|
352
|
+
|
|
353
|
+
// src/render/tree.ts
|
|
354
|
+
var r1 = (v) => Math.round(v * 100) / 100;
|
|
355
|
+
function drawTree(layout, diagram, timeline, ctx) {
|
|
356
|
+
const { m } = ctx;
|
|
357
|
+
const T = LOOK.tree;
|
|
358
|
+
const B = LOOK.box;
|
|
359
|
+
const timeOf = (step, event) => timeline.edges.find((t) => t.step === step && t.event === event);
|
|
360
|
+
const active = /* @__PURE__ */ new Map();
|
|
361
|
+
const touched = /* @__PURE__ */ new Map();
|
|
362
|
+
diagram.steps.forEach((step, s) => {
|
|
363
|
+
for (const e of step.events) {
|
|
364
|
+
if (e.type !== "edge") continue;
|
|
365
|
+
for (const id of [e.from, e.to]) {
|
|
366
|
+
active.set(id, (active.get(id) ?? /* @__PURE__ */ new Set()).add(s));
|
|
367
|
+
if (e.carry.kind !== "none" && !touched.has(id)) touched.set(id, s);
|
|
368
|
+
}
|
|
369
|
+
}
|
|
370
|
+
});
|
|
371
|
+
const carries = (step, event) => {
|
|
372
|
+
const e = diagram.steps[step]?.events[event];
|
|
373
|
+
return e?.type === "edge" && e.carry.kind !== "none";
|
|
374
|
+
};
|
|
375
|
+
const fadeStep = layout.runs.filter((run) => carries(run.step, run.event)).reduce((s, run) => s === void 0 ? run.step : Math.min(s, run.step), void 0);
|
|
376
|
+
const fadeAt = fadeStep === void 0 ? void 0 : timeline.steps[fadeStep]?.start;
|
|
377
|
+
const fadeOf = (id) => {
|
|
378
|
+
if (fadeStep === void 0 || fadeAt === void 0) return void 0;
|
|
379
|
+
const t = touched.get(id);
|
|
380
|
+
if (t !== void 0 && t <= fadeStep) return void 0;
|
|
381
|
+
const back = t === void 0 ? void 0 : timeline.steps[t]?.start;
|
|
382
|
+
const frames = [
|
|
383
|
+
[0, { opacity: 1 }],
|
|
384
|
+
[fadeAt, { opacity: 1 }, EASE.inOut],
|
|
385
|
+
[fadeAt + MOTION.fade, { opacity: T.faint }]
|
|
386
|
+
];
|
|
387
|
+
if (back !== void 0) frames.push([back, { opacity: T.faint }, EASE.inOut], [back + MOTION.fade, { opacity: 1 }]);
|
|
388
|
+
frames.push([m.last, { opacity: back === void 0 ? T.faint : 1 }, EASE.inOut], [m.total, { opacity: 1 }]);
|
|
389
|
+
return m.kf(frames);
|
|
390
|
+
};
|
|
391
|
+
const faded = (id, markup, attrs = "") => {
|
|
392
|
+
const fade = fadeOf(id);
|
|
393
|
+
return fade ? `<g class="dg-a"${attrs} style="${fade}">${markup}</g>` : attrs === "" ? markup : `<g${attrs}>${markup}</g>`;
|
|
394
|
+
};
|
|
395
|
+
const drawnAt = new Map(layout.nodes.map((n) => [n.id, timeOf(n.step, n.event)?.drawn ?? 0]));
|
|
396
|
+
const links = layout.links.map((l) => {
|
|
397
|
+
const time = timeOf(l.step, l.event);
|
|
398
|
+
if (!time) return "";
|
|
399
|
+
ctx.traces.push({ from: l.from, to: l.to, points: l.points, shown: [[time.start, Number.POSITIVE_INFINITY]] });
|
|
400
|
+
const kf = m.kf([
|
|
401
|
+
[0, { opacity: 0, "stroke-dashoffset": 1 }],
|
|
402
|
+
[time.start, { opacity: 0, "stroke-dashoffset": 1 }, EASE.inOut],
|
|
403
|
+
[time.start + 0.05, { opacity: 1 }],
|
|
404
|
+
[time.drawn, { "stroke-dashoffset": 0 }],
|
|
405
|
+
[m.last, { opacity: 1, "stroke-dashoffset": 0 }, EASE.inOut],
|
|
406
|
+
[m.total, { opacity: 0, "stroke-dashoffset": 0 }]
|
|
407
|
+
]);
|
|
408
|
+
return faded(l.from, `<path class="dg-tree-l dg-a" data-tree-link="${esc(l.from)}" pathLength="1" d="${pathOf(l.points)}" style="${kf}"/>`);
|
|
409
|
+
}).join("");
|
|
410
|
+
const ties = layout.nodes.flatMap((n) => {
|
|
411
|
+
if (!n.card) return [];
|
|
412
|
+
const at = drawnAt.get(n.id) ?? 0;
|
|
413
|
+
const d = `M ${r1(n.cx)} ${r1(n.y + n.h + LOOK.edge.inset)} V ${r1(n.card.y - LOOK.edge.inset)}`;
|
|
414
|
+
return [faded(n.id, `<path class="dg-tree-con dg-a" d="${d}" style="${m.vis(at)}"/>`)];
|
|
415
|
+
}).join("");
|
|
416
|
+
const traced = /* @__PURE__ */ new Set();
|
|
417
|
+
const trails = layout.runs.flatMap((run) => {
|
|
418
|
+
const e = layout.edges.find((x) => x.step === run.step && x.event === run.event);
|
|
419
|
+
if (!e || traced.has(run.link)) return [];
|
|
420
|
+
const carried = timeline.carriers.find((c) => c.step === run.step && c.event === run.event);
|
|
421
|
+
const time = timeOf(run.step, run.event);
|
|
422
|
+
const a = carried?.depart ?? time?.start;
|
|
423
|
+
const b = carried?.arrive ?? time?.drawn;
|
|
424
|
+
if (a === void 0 || b === void 0) return [];
|
|
425
|
+
traced.add(run.link);
|
|
426
|
+
const kf = m.kf([
|
|
427
|
+
[0, { opacity: 0, "stroke-dashoffset": 1 }],
|
|
428
|
+
[a, { opacity: 0, "stroke-dashoffset": 1 }, EASE.inOut],
|
|
429
|
+
[a + 0.05, { opacity: 1 }],
|
|
430
|
+
[b, { "stroke-dashoffset": 0 }],
|
|
431
|
+
[m.last, { opacity: 1, "stroke-dashoffset": 0 }, EASE.inOut],
|
|
432
|
+
[m.total, { opacity: 0, "stroke-dashoffset": 0 }]
|
|
433
|
+
]);
|
|
434
|
+
const d = pathOf(e.points);
|
|
435
|
+
return [
|
|
436
|
+
`<g style="${cs(e.color)}"><path class="dg-tree-tr dg-a" data-tree-trail="${esc(run.link)}" pathLength="1" d="${d}" style="${kf}"/><path class="dg-tree-h dg-a" d="${arrowHead(e.points)}" style="${m.vis(b)}"/></g>`
|
|
437
|
+
];
|
|
438
|
+
}).join("");
|
|
439
|
+
const cards = layout.nodes.flatMap((n) => {
|
|
440
|
+
const c = n.card;
|
|
441
|
+
if (!c) return [];
|
|
442
|
+
const gx = c.x + T.card.padX + T.card.icon / 2;
|
|
443
|
+
const cy = c.y + c.h / 2;
|
|
444
|
+
const text = write(ctx.ink, "dg-tree-ct", c.x + T.card.padX + T.card.icon + T.card.gap, cy + LOOK.baseline.label, c.text, TYPE.treeCard, ALWAYS);
|
|
445
|
+
return [
|
|
446
|
+
faded(
|
|
447
|
+
n.id,
|
|
448
|
+
`<rect class="dg-tree-card" x="${r1(c.x)}" y="${r1(c.y)}" width="${r1(c.w)}" height="${c.h}" rx="${T.card.radius}"/>${glyph("doc", gx, cy, T.card.glyph, "dg-tree-cg")}${text}`,
|
|
449
|
+
` data-tree-card="${esc(n.id)}"`
|
|
450
|
+
)
|
|
451
|
+
];
|
|
452
|
+
}).join("");
|
|
453
|
+
const nodes = layout.nodes.map((n) => {
|
|
454
|
+
const at = drawnAt.get(n.id) ?? 0;
|
|
455
|
+
const on = [...active.get(n.id) ?? []].sort((x, y) => x - y);
|
|
456
|
+
const act = on.length > 0 ? activeKf(ctx, on) : void 0;
|
|
457
|
+
const radius = n.root ? T.root.radius : T.radius;
|
|
458
|
+
const rect = (cls, extra = "") => `<rect class="${cls}" x="${r1(n.x)}" y="${r1(n.y)}" width="${r1(n.w)}" height="${n.h}" rx="${radius}"${extra}/>`;
|
|
459
|
+
const frame = `${act ? `<g class="dg-a" style="${act}">${rect("dg-halo")}</g>` : ""}${rect("dg-st", ` ${ctx.sh}`)}${act ? `<g class="dg-a" style="${act}">${rect("dg-on")}</g>` : ""}`;
|
|
460
|
+
const ix = n.x + T.root.iconX + B.icon / 2;
|
|
461
|
+
const mark = n.root ? `<rect class="dg-ic" x="${r1(ix - B.icon / 2)}" y="${r1(n.cy - B.icon / 2)}" width="${B.icon}" height="${B.icon}" rx="${B.iconRadius}"/>${glyph("tree", ix, n.cy, B.iconScale)}` : "";
|
|
462
|
+
const shown = [[at, Number.POSITIVE_INFINITY]];
|
|
463
|
+
const texts = n.lines.map((line, k) => {
|
|
464
|
+
const style = n.styles[k] ?? TYPE.boxName;
|
|
465
|
+
const cls = style === TYPE.treeHash ? "dg-tree-hash" : style === TYPE.treeName ? "dg-tree-name" : style === TYPE.rootHash ? "dg-tree-rh" : style === TYPE.rootName ? "dg-tree-rn" : "dg-tree-one";
|
|
466
|
+
const baseline = n.baselines[k] ?? n.cy;
|
|
467
|
+
return n.root ? write(ctx.ink, cls, n.x + T.root.textX, baseline, line, style, shown) : write(ctx.ink, cls, n.cx, baseline, line, style, shown, "middle");
|
|
468
|
+
}).join("");
|
|
469
|
+
const inner = faded(n.id, `${frame}${mark}${texts}`, ` data-tree-node="${esc(n.id)}"${n.root ? ` data-tree-root="${esc(n.id)}"` : ""}`);
|
|
470
|
+
return `<g class="dg-popc dg-a" style="${cs(n.color)};${m.pop(at)}">${inner}</g>`;
|
|
471
|
+
}).join("");
|
|
472
|
+
return { links: links + ties, trails, nodes: cards + nodes, appear: drawnAt };
|
|
473
|
+
}
|
|
474
|
+
export {
|
|
475
|
+
drawTree,
|
|
476
|
+
layoutTree
|
|
477
|
+
};
|
|
478
|
+
//# sourceMappingURL=tree-5HPREYW2.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../../src/layout/tree.ts","../../src/render/tree.ts"],"sourcesContent":["/**\n * 木の図の置き場所 (#3233)。見た目の元は step 2 で本人が選んだ「根を上」の試作 (`.context/propose/merkle-look/`)。\n *\n * 葉 (`leaf`) と親 (`node`) の出来事を書いた順に辿り、親を持たない最後の箱を根にする。根を上に置き、根からの深さごとに段を下げて並べる。\n * 子を持たない箱 (葉) は書いた順に左から同じ間で並べ、親は最初の子と最後の子の真ん中の上に置く。\n * 子から親への木の線は、子の上端から縦に出て、子の段と親の段の間の高さで横に渡り、親の下端へ縦に入る。\n * 値を持つ葉は箱に値だけを出し、名札を葉の下の札に出す。値を持つ親は値を大きく、名札を小さく出す。値を持たない箱は名札だけを出す。\n * 根の箱は左に枝の絵柄を持ち、ほかの木の箱より大きい。\n *\n * 木でない箱 (`box`) は木の右に、根の上端の高さから縦に並べる。中身の帯は図の下に置く。\n * 親子の箱どうしの線は木の線の上を走り、ほかの線は箱の向き合う辺どうしを結ぶ。\n * 段の番号は、箱が現れる段では最初に現れた箱の左に、線を引く段では最初の線の上に置く。\n *\n * 原本の JSON が書く前の名札を子に持つ時や、もう親を持つ箱を子にする時は、その子を除いて描く。箱と同じ名札の木の箱は描かない。\n */\nimport { type ColorKey, LOOK, type TextStyle, TYPE } from \"../look/values\";\nimport type { Diagram } from \"../schema\";\nimport { textWidth } from \"./measure\";\nimport {\n along,\n badgeOnPath,\n badgeRect,\n boxColors,\n boxWidth,\n carrierHalf,\n edgeColor,\n edgesOf,\n gapBetween,\n labelStyle,\n type Layout,\n layoutStrip,\n loopUnder,\n pathLength,\n placeLabel,\n placeSlot,\n type Point,\n type Rect,\n replaceSameSpot,\n type SceneBadge,\n type SceneBox,\n type SceneEdge,\n type SceneLabel,\n seatCarriers,\n slotBoxWidth,\n slotRooms,\n stripNeed,\n} from \"./scene\";\n\n/** 木の箱。`lines` は箱の中の字を上から並べた行で、`baselines` と `styles` は行ごとの基準線の高さと字の形 */\nexport interface TreePlaced extends Rect {\n id: string;\n kind: \"leaf\" | \"node\";\n /** 根からの深さ。根が 0 */\n depth: number;\n parent?: string;\n children: string[];\n /** 箱を書いた段と、段の中の出来事の番号 */\n step: number;\n event: number;\n hash?: string;\n root: boolean;\n cx: number;\n cy: number;\n color: ColorKey;\n lines: string[];\n baselines: number[];\n styles: TextStyle[];\n /** 値を持つ葉の下に置く、名札の札 */\n card?: Rect & { text: string };\n}\n\n/** 子 (`from`) から親 (`to`) への木の線。親を書いた段と出来事で現れる */\nexport interface TreeLink {\n from: string;\n to: string;\n step: number;\n event: number;\n points: Point[];\n}\n\n/** 木の線の上を走る線。`link` は走る木の線の子の名札 */\nexport interface TreeRun {\n step: number;\n event: number;\n link: string;\n}\n\nexport interface TreeLayout extends Layout {\n kind: \"tree\";\n nodes: TreePlaced[];\n links: TreeLink[];\n runs: TreeRun[];\n}\n\n\n/** 書いた順の木の箱。子は書いた後の、まだ親を持たない木の箱だけを残す */\ninterface Grown {\n id: string;\n kind: \"leaf\" | \"node\";\n children: string[];\n step: number;\n event: number;\n hash?: string;\n}\n\nfunction grow(diagram: Diagram): { grown: Grown[]; parents: Map<string, string> } {\n const boxes = new Set(diagram.boxes.map((b) => b.id));\n const byId = new Set<string>();\n const parents = new Map<string, string>();\n const grown: Grown[] = [];\n diagram.steps.forEach((step, s) => {\n step.events.forEach((e, k) => {\n if ((e.type !== \"leaf\" && e.type !== \"node\") || byId.has(e.id) || boxes.has(e.id)) return;\n const children = e.type === \"node\" ? [...new Set(e.children)].filter((c) => byId.has(c) && !parents.has(c)) : [];\n for (const c of children) parents.set(c, e.id);\n grown.push({ id: e.id, kind: e.type, children, step: s, event: k, ...(e.hash !== undefined ? { hash: e.hash } : {}) });\n byId.add(e.id);\n });\n });\n return { grown, parents };\n}\n\n/** 箱の中の字の行と、行ごとの字の形。根は名札を上に値を下に、ほかの箱は値を上に名札を下に置く */\nfunction linesOf(g: Grown, root: boolean): { text: string; style: TextStyle }[] {\n if (g.hash === undefined) return [{ text: g.id, style: TYPE.boxName }];\n if (root)\n return [\n { text: g.id, style: TYPE.rootName },\n { text: g.hash, style: TYPE.rootHash },\n ];\n if (g.kind === \"leaf\") return [{ text: g.hash, style: TYPE.treeHash }];\n return [\n { text: g.hash, style: TYPE.treeHash },\n { text: g.id, style: TYPE.treeName },\n ];\n}\n\n/** 箱どうしの線。縦の範囲が重なれば横に、横の範囲が重なれば縦に、どちらも重ならなければ送る側から縦に出て受ける側の高さで横に入る */\nfunction route(a: Rect, b: Rect): Point[] {\n const i = LOOK.edge.inset;\n const top = Math.max(a.y, b.y);\n const bottom = Math.min(a.y + a.h, b.y + b.h);\n if (bottom > top) {\n const y = (top + bottom) / 2;\n return b.x >= a.x + a.w\n ? [\n [a.x + a.w + i, y],\n [b.x - i, y],\n ]\n : [\n [a.x - i, y],\n [b.x + b.w + i, y],\n ];\n }\n const left = Math.max(a.x, b.x);\n const right = Math.min(a.x + a.w, b.x + b.w);\n if (right > left) {\n const x = (left + right) / 2;\n return b.y >= a.y + a.h\n ? [\n [x, a.y + a.h + i],\n [x, b.y - i],\n ]\n : [\n [x, a.y - i],\n [x, b.y + b.h + i],\n ];\n }\n const ax = a.x + a.w / 2;\n const ty = b.y + b.h / 2;\n return [\n [ax, b.y > a.y ? a.y + a.h + i : a.y - i],\n [ax, ty],\n [b.x > ax ? b.x - i : b.x + b.w + i, ty],\n ];\n}\n\nexport function layoutTree(diagram: Diagram): TreeLayout {\n const { margin, gap, box: B, tree: T, badge: BD } = LOOK;\n const { grown, parents } = grow(diagram);\n const tops = grown.filter((g) => !parents.has(g.id));\n const rootId = tops[tops.length - 1]?.id;\n const byId = new Map(grown.map((g) => [g.id, g]));\n\n // 根からの深さ。親を持たない箱から子へ辿る\n const depth = new Map<string, number>();\n const walk = (id: string, d: number): void => {\n depth.set(id, d);\n for (const c of byId.get(id)?.children ?? []) walk(c, d + 1);\n };\n for (const t of tops) walk(t.id, 0);\n\n const texts = new Map(grown.map((g) => [g.id, linesOf(g, g.id === rootId)]));\n const widest = (id: string): number => Math.max(0, ...(texts.get(id) ?? []).map((line) => textWidth(line.text, line.style)));\n const widthOf = (g: Grown): number =>\n g.id === rootId ? Math.max(T.root.w, T.root.textX + widest(g.id) + T.root.padR) : Math.max(T.w, widest(g.id) + T.padX * 2);\n const cardW = (g: Grown): number => Math.max(T.card.minW, T.card.padX * 2 + T.card.icon + T.card.gap + textWidth(g.id, TYPE.treeCard));\n const hasCard = (g: Grown): boolean => g.kind === \"leaf\" && g.hash !== undefined;\n\n // 子を持たない箱を書いた順に左から並べる。間は一番広い箱か札の幅に、隣の箱との間を足した長さ\n const slots = grown.filter((g) => g.children.length === 0);\n const pitch = Math.max(...grown.filter((g) => g.id !== rootId || g.children.length === 0).map((g) => Math.max(widthOf(g), hasCard(g) ? cardW(g) : 0)), T.w) + T.slotGap;\n const x0 = margin + BD.r * 2 + BD.inset;\n const xs = new Map<string, number>();\n slots.forEach((g, i) => xs.set(g.id, x0 + pitch * (i + 0.5)));\n const xOf = (id: string): number => {\n const known = xs.get(id);\n if (known !== undefined) return known;\n const kids = byId.get(id)?.children ?? [];\n const x = (xOf(kids[0] as string) + xOf(kids[kids.length - 1] as string)) / 2;\n xs.set(id, x);\n return x;\n };\n const top0 = margin + T.top;\n const yOf = (d: number): number => top0 + T.root.h / 2 + d * T.row;\n\n const colors = boxColors(diagram);\n const nodes: TreePlaced[] = grown.map((g) => {\n const root = g.id === rootId;\n const d = depth.get(g.id) ?? 0;\n const cx = xOf(g.id);\n const cy = yOf(d);\n const w = widthOf(g);\n const h = root ? T.root.h : T.h;\n const lines = texts.get(g.id) ?? [];\n const baselines =\n lines.length === 1 ? [cy + T.oneY] : root ? [cy + T.root.nameY, cy + T.root.hashY] : [cy + T.hashY, cy + T.nameY];\n const parent = parents.get(g.id);\n const color: ColorKey = root ? T.rootColor : T.color;\n colors.set(g.id, color);\n const cw = cardW(g);\n return {\n id: g.id,\n kind: g.kind,\n depth: d,\n ...(parent !== undefined ? { parent } : {}),\n children: g.children,\n step: g.step,\n event: g.event,\n ...(g.hash !== undefined ? { hash: g.hash } : {}),\n root,\n x: cx - w / 2,\n y: cy - h / 2,\n w,\n h,\n cx,\n cy,\n color,\n lines: lines.map((line) => line.text),\n baselines,\n styles: lines.map((line) => line.style),\n ...(hasCard(g) ? { card: { x: cx - cw / 2, y: cy + T.card.drop - T.card.h / 2, w: cw, h: T.card.h, text: g.id } } : {}),\n };\n });\n const placed = new Map(nodes.map((n) => [n.id, n]));\n\n // 子から親への木の線。子の段と親の段の間の高さで横に渡る\n const links: TreeLink[] = nodes.flatMap((p) =>\n p.children.flatMap((id): TreeLink[] => {\n const c = placed.get(id);\n if (!c) return [];\n const mid = (c.y + p.y + p.h) / 2;\n const points: Point[] = [\n [c.cx, c.y - LOOK.edge.inset],\n [c.cx, mid],\n [p.cx, mid],\n [p.cx, p.y + p.h + LOOK.edge.inset],\n ];\n return [{ from: c.id, to: p.id, step: p.step, event: p.event, points }];\n }),\n );\n\n // 木でない箱は、木の右に根の上端の高さから縦に並べる。根と箱の間の線に名前を書く時は、名前の分だけ根から離す\n const rooms = slotRooms(diagram);\n const treeRight = Math.max(x0, ...nodes.flatMap((n) => [n.x + n.w, ...(n.card ? [n.card.x + n.card.w] : [])]));\n const rootBox = nodes.find((n) => n.root);\n const ids = new Set(diagram.boxes.map((b) => b.id));\n const named = edgesOf(diagram).flatMap(({ edge }) => (edge.label !== undefined && (ids.has(edge.from) || ids.has(edge.to)) ? [textWidth(edge.label, labelStyle(edge.label)) + LOOK.label.padX * 2] : []));\n const boxX = Math.max(treeRight + T.boxGap, (rootBox ? rootBox.x + rootBox.w : x0) + Math.max(0, ...named) + gap * 2);\n let by = rootBox?.y ?? top0;\n const boxes: SceneBox[] = diagram.boxes.map((b) => {\n const w = Math.max(boxWidth(diagram, b.id, true), slotBoxWidth(rooms.get(b.id), b.icon !== undefined, B.padX));\n const y = by;\n by += B.h + gap;\n const box: SceneBox = {\n id: b.id,\n name: b.name,\n ...(b.sub !== undefined ? { sub: b.sub } : {}),\n ...(b.icon !== undefined ? { icon: b.icon } : {}),\n color: colors.get(b.id) ?? \"slate\",\n x: boxX,\n y,\n w,\n h: B.h,\n cx: boxX + w / 2,\n cy: y + B.h / 2,\n };\n placeSlot(box, rooms.get(b.id));\n return box;\n });\n const boxById = new Map(boxes.map((b) => [b.id, b]));\n\n // 線。親子の箱どうしの線は木の線の上を、向きに合わせて走る\n const runs: TreeRun[] = [];\n const edges: SceneEdge[] = diagram.steps.flatMap((step, s) =>\n step.events.flatMap((e, k): SceneEdge[] => {\n if (e.type !== \"edge\") return [];\n const a: Rect | undefined = placed.get(e.from) ?? boxById.get(e.from);\n const b: Rect | undefined = placed.get(e.to) ?? boxById.get(e.to);\n if (!a || !b) return [];\n const up = links.find((l) => l.from === e.from && l.to === e.to);\n const down = links.find((l) => l.from === e.to && l.to === e.from);\n const link = up ?? down;\n if (link) runs.push({ step: s, event: k, link: link.from });\n const points = up ? up.points : down ? [...down.points].reverse() : e.from === e.to ? loopUnder({ cx: a.x + a.w / 2, y: a.y, h: a.h }) : route(a, b);\n return [{ step: s, event: k, from: e.from, to: e.to, points, color: edgeColor(e, colors), carry: e.carry }];\n }),\n );\n seatCarriers(edges, boxById, rooms);\n\n const layout: TreeLayout = {\n kind: \"tree\",\n width: 0,\n height: 0,\n regions: [],\n boxes,\n lifelines: [],\n edges,\n labels: [],\n actions: [],\n badges: [],\n paths: [],\n ends: [],\n nodes,\n links,\n runs,\n };\n layout.badges = badgesOf(diagram, layout);\n layout.labels = labelsOf(diagram, layout);\n\n const cards = nodes.flatMap((n) => (n.card ? [n.card] : []));\n const solids: Rect[] = [...nodes, ...cards, ...boxes, ...layout.labels];\n const points = edges.flatMap((e) => e.points);\n const right = Math.max(...solids.map((r) => r.x + r.w), ...points.map(([x]) => x), x0);\n const bottom = Math.max(...solids.map((r) => r.y + r.h), ...points.map(([, y]) => y), top0);\n const width = Math.max(right + margin, stripNeed(diagram) + margin * 2);\n const strip = layoutStrip(diagram, margin, bottom + gap, width - margin * 2);\n layout.width = width;\n layout.height = (strip ? strip.y + strip.h : bottom) + margin;\n if (strip) layout.strip = strip;\n // 中身の帯だけを書き換える段の番号は帯の左上に置くので、帯を置いた後に決め直す\n layout.badges = badgesOf(diagram, layout);\n return layout;\n}\n\n/**\n * 段の番号。箱が現れる段は最初に現れた木の箱の左に置き、左が埋まっていれば左上の角、右、右上の角の順に空きを探す。\n * 線を引く段は最初の線の上に置く。木の線を走る線は、子の側の曲がり角から横の線に沿って `LOOK.tree.badgeAlong` 進めた所に、ほかの線は真ん中に置き、\n * 運ぶ物が出発を待つ所と着いた所を空ける。同じ 2 つの箱を結ぶ線を前の段が通っていれば、前の段の番号と同じ所に置く (#3184)。\n * どちらも無い段は、書き換える箱か帯の左上の角に置き、それも無ければ前の段の番号と入れ替える\n */\nfunction badgesOf(diagram: Diagram, layout: TreeLayout): SceneBadge[] {\n const { r, inset } = LOOK.badge;\n const apart = r * 2 + inset;\n const taken: Point[] = [];\n const out: SceneBadge[] = [];\n const solids: Rect[] = [...layout.nodes, ...layout.nodes.flatMap((n) => (n.card ? [n.card] : [])), ...layout.boxes];\n const free = (p: Point): boolean =>\n taken.every(([x, y]) => Math.hypot(p[0] - x, p[1] - y) >= apart) && solids.every((s) => gapBetween(badgeRect(p), s) >= LOOK.label.touch);\n const put = (s: number, p: Point, color: ColorKey): void => {\n taken.push(p);\n out.push({ step: s, x: p[0], y: p[1], color });\n };\n const passed = new Map<string, Point>();\n diagram.steps.forEach((step, s) => {\n const k = step.events.findIndex((e) => e.type === \"leaf\" || e.type === \"node\" || e.type === \"edge\");\n const first = step.events[k];\n const n = layout.nodes.find((x) => x.step === s && x.event === k);\n if (first && first.type !== \"edge\" && n) {\n const spots: Point[] = [\n [n.x - inset - r, n.cy],\n [n.x, n.y],\n [n.x + n.w + inset + r, n.cy],\n [n.x + n.w, n.y],\n ];\n put(s, spots.find(free) ?? (spots[0] as Point), n.color);\n return;\n }\n const e = layout.edges.find((x) => x.step === s && x.event === k);\n if (first?.type === \"edge\" && e) {\n const key = [e.from, e.to].sort().join(\"\\n\");\n const run = layout.runs.some((x) => x.step === s && x.event === k);\n const lines = layout.edges.filter((x) => x !== e).map((x) => x.points);\n const point = passed.get(key) ?? (run ? onLink(e.points, free) : midway(e, free)) ?? badgeOnPath(e.points, taken, lines);\n passed.set(key, point);\n put(s, point, e.color);\n return;\n }\n const box = step.events.flatMap((ev) => (ev.type === \"swap\" || ev.type === \"action\" ? [ev.box] : [])).flatMap((id) => layout.boxes.filter((b) => b.id === id))[0];\n if (box) {\n out.push({ step: s, x: box.x, y: box.y, color: box.color });\n return;\n }\n if (layout.strip && step.events.some((ev) => ev.type === \"strip\")) {\n out.push({ step: s, x: layout.strip.x + inset, y: layout.strip.y + inset, color: \"slate\" });\n return;\n }\n const before = out[out.length - 1];\n const root = layout.nodes.find((x) => x.root);\n out.push(before ? { ...before, step: s } : { step: s, x: root?.x ?? LOOK.margin, y: root?.y ?? LOOK.margin, color: root?.color ?? \"slate\" });\n });\n return replaceSameSpot(out);\n}\n\n/** 木の線の上の段の番号の点。最初の曲がり角から横の線に沿って進め、横の線が短い時は縦の線の真ん中の脇に置く */\nfunction onLink(points: Point[], free: (p: Point) => boolean): Point | undefined {\n const [p0, p1, p2] = points as [Point, Point, Point];\n const flat = Math.abs(p2[0] - p1[0]);\n const { r, inset } = LOOK.badge;\n if (flat >= LOOK.tree.badgeAlong + r) {\n const p = along(points, pathLength([p0, p1]) + LOOK.tree.badgeAlong);\n if (free(p)) return p;\n }\n const side: Point = [p1[0] + r + inset, p1[1]];\n return free(side) ? side : undefined;\n}\n\n/** 木の線でない線の段の番号の点。運ぶ物が待つ線の両端を空け、真ん中から外へ空きを探す。線が短くて空かない時は返さない */\nfunction midway(e: SceneEdge, free: (p: Point) => boolean): Point | undefined {\n const length = pathLength(e.points);\n const room = carrierHalf(e.carry)[0] + LOOK.badge.r + LOOK.badge.inset;\n for (let d = 0; d <= length / 2 - room; d += 1) {\n for (const at of [length / 2 - d, length / 2 + d]) {\n const p = along(e.points, at);\n if (free(p)) return p;\n }\n }\n return undefined;\n}\n\n/** 線の名前。箱と木の箱から離し、葉の下の札と同じ段の名前に重ねず、同じ時刻に見える段の番号に食い込ませない */\nfunction labelsOf(diagram: Diagram, layout: TreeLayout): SceneLabel[] {\n const labels: SceneLabel[] = [];\n const cards = layout.nodes.flatMap((n) => (n.card ? [n.card] : []));\n for (const e of layout.edges) {\n const source = diagram.steps[e.step]?.events[e.event];\n if (source?.type !== \"edge\" || source.label === undefined) continue;\n const seen = layout.badges.filter((b) => b.step <= e.step).map((b) => badgeRect([b.x, b.y]));\n labels.push(\n placeLabel(\n { step: e.step, event: e.event, text: source.label, points: e.points, color: e.color, ...(source.labelSide ? { side: source.labelSide } : {}), flip: true },\n { hard: [...layout.nodes, ...layout.boxes], soft: [...cards, ...labels.filter((l) => l.step === e.step)], touch: seen },\n ),\n );\n }\n return labels;\n}\n","/**\n * 木の図 (#3233) を描く部品。見た目の元は step 2 で本人が選んだ「根を上」の試作 (`.context/propose/merkle-look/`)。\n *\n * 木の箱は書いた段で、親から子への木の線を引き終えた時に弾んで出る。木の線は親を書いた段で引き、最後まで残す。\n * 値を持つ葉の下の名札の札は、葉より前の最初の段から出しておき、葉が出た時に葉と札を点線で結ぶ。\n * 木の線を走る運ぶ物は着いた所で消え、通った木の線を運ぶ物の色で最後まで残す (`data-tree-trail`)。\n * 木の線を運ぶ物が初めて通った段から後は、それまでに運ぶ物を送るか受けた木の箱だけを濃く出し、ほかの木の箱と札と木の線を薄く出す。\n * 線の両端になった木の箱は、その段の間だけ縁に色を付ける。\n * 木の箱が現れる時刻 (`appear`) を返し、木の線を走らない線の点線はその時刻から出す (#3240)。\n */\nimport type { TreeLayout } from \"../layout/tree\";\nimport { EASE, LOOK, MOTION, TYPE } from \"../look/values\";\nimport type { Diagram } from \"../schema\";\nimport type { EdgeTime, Timeline } from \"../timeline\";\nimport type { Frame } from \"./motion\";\nimport { ALWAYS } from \"./ink\";\nimport { activeKf, arrowHead, type Ctx, cs, esc, glyph, pathOf, write } from \"./parts\";\n\nconst r1 = (v: number): number => Math.round(v * 100) / 100;\n\nexport function drawTree(layout: TreeLayout, diagram: Diagram, timeline: Timeline, ctx: Ctx): { links: string; trails: string; nodes: string; appear: Map<string, number> } {\n const { m } = ctx;\n const T = LOOK.tree;\n const B = LOOK.box;\n const timeOf = (step: number, event: number): EdgeTime | undefined => timeline.edges.find((t) => t.step === step && t.event === event);\n\n // 木の箱ごとの、線の両端になる段と、運ぶ物を初めて送るか受けた段\n const active = new Map<string, Set<number>>();\n const touched = new Map<string, number>();\n diagram.steps.forEach((step, s) => {\n for (const e of step.events) {\n if (e.type !== \"edge\") continue;\n for (const id of [e.from, e.to]) {\n active.set(id, (active.get(id) ?? new Set()).add(s));\n if (e.carry.kind !== \"none\" && !touched.has(id)) touched.set(id, s);\n }\n }\n });\n const carries = (step: number, event: number): boolean => {\n const e = diagram.steps[step]?.events[event];\n return e?.type === \"edge\" && e.carry.kind !== \"none\";\n };\n const fadeStep = layout.runs.filter((run) => carries(run.step, run.event)).reduce<number | undefined>((s, run) => (s === undefined ? run.step : Math.min(s, run.step)), undefined);\n const fadeAt = fadeStep === undefined ? undefined : timeline.steps[fadeStep]?.start;\n\n /** 木の箱 `id` の薄くなる動き。薄くしない箱は `undefined` */\n const fadeOf = (id: string): string | undefined => {\n if (fadeStep === undefined || fadeAt === undefined) return undefined;\n const t = touched.get(id);\n if (t !== undefined && t <= fadeStep) return undefined;\n const back = t === undefined ? undefined : timeline.steps[t]?.start;\n const frames: Frame[] = [\n [0, { opacity: 1 }],\n [fadeAt, { opacity: 1 }, EASE.inOut],\n [fadeAt + MOTION.fade, { opacity: T.faint }],\n ];\n if (back !== undefined) frames.push([back, { opacity: T.faint }, EASE.inOut], [back + MOTION.fade, { opacity: 1 }]);\n frames.push([m.last, { opacity: back === undefined ? T.faint : 1 }, EASE.inOut], [m.total, { opacity: 1 }]);\n return m.kf(frames);\n };\n const faded = (id: string, markup: string, attrs = \"\"): string => {\n const fade = fadeOf(id);\n return fade ? `<g class=\"dg-a\"${attrs} style=\"${fade}\">${markup}</g>` : attrs === \"\" ? markup : `<g${attrs}>${markup}</g>`;\n };\n\n const drawnAt = new Map(layout.nodes.map((n) => [n.id, timeOf(n.step, n.event)?.drawn ?? 0]));\n\n // 木の線と、葉と札を結ぶ点線。木の線は親を書いた段で引き始め、引き終えた後も残す\n const links = layout.links\n .map((l) => {\n const time = timeOf(l.step, l.event);\n if (!time) return \"\";\n ctx.traces.push({ from: l.from, to: l.to, points: l.points, shown: [[time.start, Number.POSITIVE_INFINITY]] });\n const kf = m.kf([\n [0, { opacity: 0, \"stroke-dashoffset\": 1 }],\n [time.start, { opacity: 0, \"stroke-dashoffset\": 1 }, EASE.inOut],\n [time.start + 0.05, { opacity: 1 }],\n [time.drawn, { \"stroke-dashoffset\": 0 }],\n [m.last, { opacity: 1, \"stroke-dashoffset\": 0 }, EASE.inOut],\n [m.total, { opacity: 0, \"stroke-dashoffset\": 0 }],\n ]);\n return faded(l.from, `<path class=\"dg-tree-l dg-a\" data-tree-link=\"${esc(l.from)}\" pathLength=\"1\" d=\"${pathOf(l.points)}\" style=\"${kf}\"/>`);\n })\n .join(\"\");\n const ties = layout.nodes\n .flatMap((n) => {\n if (!n.card) return [];\n const at = drawnAt.get(n.id) ?? 0;\n const d = `M ${r1(n.cx)} ${r1(n.y + n.h + LOOK.edge.inset)} V ${r1(n.card.y - LOOK.edge.inset)}`;\n return [faded(n.id, `<path class=\"dg-tree-con dg-a\" d=\"${d}\" style=\"${m.vis(at)}\"/>`)];\n })\n .join(\"\");\n\n // 木の線を運ぶ物が通った跡。運ぶ物が走るのに合わせて引き、最後まで残す。同じ木の線は最初に通った段の跡だけを描く\n const traced = new Set<string>();\n const trails = layout.runs\n .flatMap((run) => {\n const e = layout.edges.find((x) => x.step === run.step && x.event === run.event);\n if (!e || traced.has(run.link)) return [];\n const carried = timeline.carriers.find((c) => c.step === run.step && c.event === run.event);\n const time = timeOf(run.step, run.event);\n const a = carried?.depart ?? time?.start;\n const b = carried?.arrive ?? time?.drawn;\n if (a === undefined || b === undefined) return [];\n traced.add(run.link);\n const kf = m.kf([\n [0, { opacity: 0, \"stroke-dashoffset\": 1 }],\n [a, { opacity: 0, \"stroke-dashoffset\": 1 }, EASE.inOut],\n [a + 0.05, { opacity: 1 }],\n [b, { \"stroke-dashoffset\": 0 }],\n [m.last, { opacity: 1, \"stroke-dashoffset\": 0 }, EASE.inOut],\n [m.total, { opacity: 0, \"stroke-dashoffset\": 0 }],\n ]);\n const d = pathOf(e.points);\n return [\n `<g style=\"${cs(e.color)}\"><path class=\"dg-tree-tr dg-a\" data-tree-trail=\"${esc(run.link)}\" pathLength=\"1\" d=\"${d}\" style=\"${kf}\"/><path class=\"dg-tree-h dg-a\" d=\"${arrowHead(e.points)}\" style=\"${m.vis(b)}\"/></g>`,\n ];\n })\n .join(\"\");\n\n // 葉の下の名札の札。最初の段から出しておく\n const cards = layout.nodes\n .flatMap((n) => {\n const c = n.card;\n if (!c) return [];\n const gx = c.x + T.card.padX + T.card.icon / 2;\n const cy = c.y + c.h / 2;\n const text = write(ctx.ink, \"dg-tree-ct\", c.x + T.card.padX + T.card.icon + T.card.gap, cy + LOOK.baseline.label, c.text, TYPE.treeCard, ALWAYS);\n return [\n faded(\n n.id,\n `<rect class=\"dg-tree-card\" x=\"${r1(c.x)}\" y=\"${r1(c.y)}\" width=\"${r1(c.w)}\" height=\"${c.h}\" rx=\"${T.card.radius}\"/>${glyph(\"doc\", gx, cy, T.card.glyph, \"dg-tree-cg\")}${text}`,\n ` data-tree-card=\"${esc(n.id)}\"`,\n ),\n ];\n })\n .join(\"\");\n\n // 木の箱。親から子への線を引き終えた時に弾んで出る。根は左に枝の絵柄を持ち、字を絵柄の右に左揃えで並べる\n const nodes = layout.nodes\n .map((n) => {\n const at = drawnAt.get(n.id) ?? 0;\n const on = [...(active.get(n.id) ?? [])].sort((x, y) => x - y);\n const act = on.length > 0 ? activeKf(ctx, on) : undefined;\n const radius = n.root ? T.root.radius : T.radius;\n const rect = (cls: string, extra = \"\"): string => `<rect class=\"${cls}\" x=\"${r1(n.x)}\" y=\"${r1(n.y)}\" width=\"${r1(n.w)}\" height=\"${n.h}\" rx=\"${radius}\"${extra}/>`;\n const frame = `${act ? `<g class=\"dg-a\" style=\"${act}\">${rect(\"dg-halo\")}</g>` : \"\"}${rect(\"dg-st\", ` ${ctx.sh}`)}${act ? `<g class=\"dg-a\" style=\"${act}\">${rect(\"dg-on\")}</g>` : \"\"}`;\n const ix = n.x + T.root.iconX + B.icon / 2;\n const mark = n.root ? `<rect class=\"dg-ic\" x=\"${r1(ix - B.icon / 2)}\" y=\"${r1(n.cy - B.icon / 2)}\" width=\"${B.icon}\" height=\"${B.icon}\" rx=\"${B.iconRadius}\"/>${glyph(\"tree\", ix, n.cy, B.iconScale)}` : \"\";\n const shown: [number, number][] = [[at, Number.POSITIVE_INFINITY]];\n const texts = n.lines\n .map((line, k) => {\n const style = n.styles[k] ?? TYPE.boxName;\n const cls = style === TYPE.treeHash ? \"dg-tree-hash\" : style === TYPE.treeName ? \"dg-tree-name\" : style === TYPE.rootHash ? \"dg-tree-rh\" : style === TYPE.rootName ? \"dg-tree-rn\" : \"dg-tree-one\";\n const baseline = n.baselines[k] ?? n.cy;\n return n.root ? write(ctx.ink, cls, n.x + T.root.textX, baseline, line, style, shown) : write(ctx.ink, cls, n.cx, baseline, line, style, shown, \"middle\");\n })\n .join(\"\");\n const inner = faded(n.id, `${frame}${mark}${texts}`, ` data-tree-node=\"${esc(n.id)}\"${n.root ? ` data-tree-root=\"${esc(n.id)}\"` : \"\"}`);\n return `<g class=\"dg-popc dg-a\" style=\"${cs(n.color)};${m.pop(at)}\">${inner}</g>`;\n })\n .join(\"\");\n\n return { links: links + ties, trails, nodes: cards + nodes, appear: drawnAt };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyGA,SAAS,KAAK,SAAoE;AAChF,QAAM,QAAQ,IAAI,IAAI,QAAQ,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AACpD,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,UAAU,oBAAI,IAAoB;AACxC,QAAM,QAAiB,CAAC;AACxB,UAAQ,MAAM,QAAQ,CAAC,MAAM,MAAM;AACjC,SAAK,OAAO,QAAQ,CAAC,GAAG,MAAM;AAC5B,UAAK,EAAE,SAAS,UAAU,EAAE,SAAS,UAAW,KAAK,IAAI,EAAE,EAAE,KAAK,MAAM,IAAI,EAAE,EAAE,EAAG;AACnF,YAAM,WAAW,EAAE,SAAS,SAAS,CAAC,GAAG,IAAI,IAAI,EAAE,QAAQ,CAAC,EAAE,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC;AAC/G,iBAAW,KAAK,SAAU,SAAQ,IAAI,GAAG,EAAE,EAAE;AAC7C,YAAM,KAAK,EAAE,IAAI,EAAE,IAAI,MAAM,EAAE,MAAM,UAAU,MAAM,GAAG,OAAO,GAAG,GAAI,EAAE,SAAS,SAAY,EAAE,MAAM,EAAE,KAAK,IAAI,CAAC,EAAG,CAAC;AACrH,WAAK,IAAI,EAAE,EAAE;AAAA,IACf,CAAC;AAAA,EACH,CAAC;AACD,SAAO,EAAE,OAAO,QAAQ;AAC1B;AAGA,SAAS,QAAQ,GAAU,MAAqD;AAC9E,MAAI,EAAE,SAAS,OAAW,QAAO,CAAC,EAAE,MAAM,EAAE,IAAI,OAAO,KAAK,QAAQ,CAAC;AACrE,MAAI;AACF,WAAO;AAAA,MACL,EAAE,MAAM,EAAE,IAAI,OAAO,KAAK,SAAS;AAAA,MACnC,EAAE,MAAM,EAAE,MAAM,OAAO,KAAK,SAAS;AAAA,IACvC;AACF,MAAI,EAAE,SAAS,OAAQ,QAAO,CAAC,EAAE,MAAM,EAAE,MAAM,OAAO,KAAK,SAAS,CAAC;AACrE,SAAO;AAAA,IACL,EAAE,MAAM,EAAE,MAAM,OAAO,KAAK,SAAS;AAAA,IACrC,EAAE,MAAM,EAAE,IAAI,OAAO,KAAK,SAAS;AAAA,EACrC;AACF;AAGA,SAAS,MAAM,GAAS,GAAkB;AACxC,QAAM,IAAI,KAAK,KAAK;AACpB,QAAM,MAAM,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;AAC7B,QAAM,SAAS,KAAK,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;AAC5C,MAAI,SAAS,KAAK;AAChB,UAAM,KAAK,MAAM,UAAU;AAC3B,WAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAClB;AAAA,MACE,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC;AAAA,MACjB,CAAC,EAAE,IAAI,GAAG,CAAC;AAAA,IACb,IACA;AAAA,MACE,CAAC,EAAE,IAAI,GAAG,CAAC;AAAA,MACX,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC;AAAA,IACnB;AAAA,EACN;AACA,QAAM,OAAO,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;AAC9B,QAAM,QAAQ,KAAK,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;AAC3C,MAAI,QAAQ,MAAM;AAChB,UAAM,KAAK,OAAO,SAAS;AAC3B,WAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAClB;AAAA,MACE,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC;AAAA,MACjB,CAAC,GAAG,EAAE,IAAI,CAAC;AAAA,IACb,IACA;AAAA,MACE,CAAC,GAAG,EAAE,IAAI,CAAC;AAAA,MACX,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC;AAAA,IACnB;AAAA,EACN;AACA,QAAM,KAAK,EAAE,IAAI,EAAE,IAAI;AACvB,QAAM,KAAK,EAAE,IAAI,EAAE,IAAI;AACvB,SAAO;AAAA,IACL,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,CAAC;AAAA,IACxC,CAAC,IAAI,EAAE;AAAA,IACP,CAAC,EAAE,IAAI,KAAK,EAAE,IAAI,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,EAAE;AAAA,EACzC;AACF;AAEO,SAAS,WAAW,SAA8B;AACvD,QAAM,EAAE,QAAQ,KAAK,KAAK,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI;AACpD,QAAM,EAAE,OAAO,QAAQ,IAAI,KAAK,OAAO;AACvC,QAAM,OAAO,MAAM,OAAO,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC;AACnD,QAAM,SAAS,KAAK,KAAK,SAAS,CAAC,GAAG;AACtC,QAAM,OAAO,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAGhD,QAAM,QAAQ,oBAAI,IAAoB;AACtC,QAAM,OAAO,CAAC,IAAY,MAAoB;AAC5C,UAAM,IAAI,IAAI,CAAC;AACf,eAAW,KAAK,KAAK,IAAI,EAAE,GAAG,YAAY,CAAC,EAAG,MAAK,GAAG,IAAI,CAAC;AAAA,EAC7D;AACA,aAAW,KAAK,KAAM,MAAK,EAAE,IAAI,CAAC;AAElC,QAAM,QAAQ,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,QAAQ,GAAG,EAAE,OAAO,MAAM,CAAC,CAAC,CAAC;AAC3E,QAAM,SAAS,CAAC,OAAuB,KAAK,IAAI,GAAG,IAAI,MAAM,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,UAAU,KAAK,MAAM,KAAK,KAAK,CAAC,CAAC;AAC3H,QAAM,UAAU,CAAC,MACf,EAAE,OAAO,SAAS,KAAK,IAAI,EAAE,KAAK,GAAG,EAAE,KAAK,QAAQ,OAAO,EAAE,EAAE,IAAI,EAAE,KAAK,IAAI,IAAI,KAAK,IAAI,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC;AAC3H,QAAM,QAAQ,CAAC,MAAqB,KAAK,IAAI,EAAE,KAAK,MAAM,EAAE,KAAK,OAAO,IAAI,EAAE,KAAK,OAAO,EAAE,KAAK,MAAM,UAAU,EAAE,IAAI,KAAK,QAAQ,CAAC;AACrI,QAAM,UAAU,CAAC,MAAsB,EAAE,SAAS,UAAU,EAAE,SAAS;AAGvE,QAAM,QAAQ,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,WAAW,CAAC;AACzD,QAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,OAAO,CAAC,MAAM,EAAE,OAAO,UAAU,EAAE,SAAS,WAAW,CAAC,EAAE,IAAI,CAAC,MAAM,KAAK,IAAI,QAAQ,CAAC,GAAG,QAAQ,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE;AAChK,QAAM,KAAK,SAAS,GAAG,IAAI,IAAI,GAAG;AAClC,QAAM,KAAK,oBAAI,IAAoB;AACnC,QAAM,QAAQ,CAAC,GAAG,MAAM,GAAG,IAAI,EAAE,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC;AAC5D,QAAM,MAAM,CAAC,OAAuB;AAClC,UAAM,QAAQ,GAAG,IAAI,EAAE;AACvB,QAAI,UAAU,OAAW,QAAO;AAChC,UAAM,OAAO,KAAK,IAAI,EAAE,GAAG,YAAY,CAAC;AACxC,UAAM,KAAK,IAAI,KAAK,CAAC,CAAW,IAAI,IAAI,KAAK,KAAK,SAAS,CAAC,CAAW,KAAK;AAC5E,OAAG,IAAI,IAAI,CAAC;AACZ,WAAO;AAAA,EACT;AACA,QAAM,OAAO,SAAS,EAAE;AACxB,QAAM,MAAM,CAAC,MAAsB,OAAO,EAAE,KAAK,IAAI,IAAI,IAAI,EAAE;AAE/D,QAAM,SAAS,UAAU,OAAO;AAChC,QAAM,QAAsB,MAAM,IAAI,CAAC,MAAM;AAC3C,UAAM,OAAO,EAAE,OAAO;AACtB,UAAM,IAAI,MAAM,IAAI,EAAE,EAAE,KAAK;AAC7B,UAAM,KAAK,IAAI,EAAE,EAAE;AACnB,UAAM,KAAK,IAAI,CAAC;AAChB,UAAM,IAAI,QAAQ,CAAC;AACnB,UAAM,IAAI,OAAO,EAAE,KAAK,IAAI,EAAE;AAC9B,UAAM,QAAQ,MAAM,IAAI,EAAE,EAAE,KAAK,CAAC;AAClC,UAAM,YACJ,MAAM,WAAW,IAAI,CAAC,KAAK,EAAE,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,KAAK,OAAO,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,OAAO,KAAK,EAAE,KAAK;AAClH,UAAM,SAAS,QAAQ,IAAI,EAAE,EAAE;AAC/B,UAAM,QAAkB,OAAO,EAAE,YAAY,EAAE;AAC/C,WAAO,IAAI,EAAE,IAAI,KAAK;AACtB,UAAM,KAAK,MAAM,CAAC;AAClB,WAAO;AAAA,MACL,IAAI,EAAE;AAAA,MACN,MAAM,EAAE;AAAA,MACR,OAAO;AAAA,MACP,GAAI,WAAW,SAAY,EAAE,OAAO,IAAI,CAAC;AAAA,MACzC,UAAU,EAAE;AAAA,MACZ,MAAM,EAAE;AAAA,MACR,OAAO,EAAE;AAAA,MACT,GAAI,EAAE,SAAS,SAAY,EAAE,MAAM,EAAE,KAAK,IAAI,CAAC;AAAA,MAC/C;AAAA,MACA,GAAG,KAAK,IAAI;AAAA,MACZ,GAAG,KAAK,IAAI;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,MAAM,IAAI,CAAC,SAAS,KAAK,IAAI;AAAA,MACpC;AAAA,MACA,QAAQ,MAAM,IAAI,CAAC,SAAS,KAAK,KAAK;AAAA,MACtC,GAAI,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,KAAK,KAAK,GAAG,GAAG,KAAK,EAAE,KAAK,OAAO,EAAE,KAAK,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,KAAK,GAAG,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC;AAAA,IACvH;AAAA,EACF,CAAC;AACD,QAAM,SAAS,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAGlD,QAAM,QAAoB,MAAM;AAAA,IAAQ,CAAC,MACvC,EAAE,SAAS,QAAQ,CAAC,OAAmB;AACrC,YAAM,IAAI,OAAO,IAAI,EAAE;AACvB,UAAI,CAAC,EAAG,QAAO,CAAC;AAChB,YAAM,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;AAChC,YAAMA,UAAkB;AAAA,QACtB,CAAC,EAAE,IAAI,EAAE,IAAI,KAAK,KAAK,KAAK;AAAA,QAC5B,CAAC,EAAE,IAAI,GAAG;AAAA,QACV,CAAC,EAAE,IAAI,GAAG;AAAA,QACV,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,KAAK,KAAK;AAAA,MACpC;AACA,aAAO,CAAC,EAAE,MAAM,EAAE,IAAI,IAAI,EAAE,IAAI,MAAM,EAAE,MAAM,OAAO,EAAE,OAAO,QAAAA,QAAO,CAAC;AAAA,IACxE,CAAC;AAAA,EACH;AAGA,QAAM,QAAQ,UAAU,OAAO;AAC/B,QAAM,YAAY,KAAK,IAAI,IAAI,GAAG,MAAM,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,GAAG,GAAI,EAAE,OAAO,CAAC,EAAE,KAAK,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC;AAC7G,QAAM,UAAU,MAAM,KAAK,CAAC,MAAM,EAAE,IAAI;AACxC,QAAM,MAAM,IAAI,IAAI,QAAQ,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAClD,QAAM,QAAQ,QAAQ,OAAO,EAAE,QAAQ,CAAC,EAAE,KAAK,MAAO,KAAK,UAAU,WAAc,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,KAAK,EAAE,KAAK,CAAC,UAAU,KAAK,OAAO,WAAW,KAAK,KAAK,CAAC,IAAI,KAAK,MAAM,OAAO,CAAC,IAAI,CAAC,CAAE;AACxM,QAAM,OAAO,KAAK,IAAI,YAAY,EAAE,SAAS,UAAU,QAAQ,IAAI,QAAQ,IAAI,MAAM,KAAK,IAAI,GAAG,GAAG,KAAK,IAAI,MAAM,CAAC;AACpH,MAAI,KAAK,SAAS,KAAK;AACvB,QAAM,QAAoB,QAAQ,MAAM,IAAI,CAAC,MAAM;AACjD,UAAM,IAAI,KAAK,IAAI,SAAS,SAAS,EAAE,IAAI,IAAI,GAAG,aAAa,MAAM,IAAI,EAAE,EAAE,GAAG,EAAE,SAAS,QAAW,EAAE,IAAI,CAAC;AAC7G,UAAM,IAAI;AACV,UAAM,EAAE,IAAI;AACZ,UAAM,MAAgB;AAAA,MACpB,IAAI,EAAE;AAAA,MACN,MAAM,EAAE;AAAA,MACR,GAAI,EAAE,QAAQ,SAAY,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC;AAAA,MAC5C,GAAI,EAAE,SAAS,SAAY,EAAE,MAAM,EAAE,KAAK,IAAI,CAAC;AAAA,MAC/C,OAAO,OAAO,IAAI,EAAE,EAAE,KAAK;AAAA,MAC3B,GAAG;AAAA,MACH;AAAA,MACA;AAAA,MACA,GAAG,EAAE;AAAA,MACL,IAAI,OAAO,IAAI;AAAA,MACf,IAAI,IAAI,EAAE,IAAI;AAAA,IAChB;AACA,cAAU,KAAK,MAAM,IAAI,EAAE,EAAE,CAAC;AAC9B,WAAO;AAAA,EACT,CAAC;AACD,QAAM,UAAU,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAGnD,QAAM,OAAkB,CAAC;AACzB,QAAM,QAAqB,QAAQ,MAAM;AAAA,IAAQ,CAAC,MAAM,MACtD,KAAK,OAAO,QAAQ,CAAC,GAAG,MAAmB;AACzC,UAAI,EAAE,SAAS,OAAQ,QAAO,CAAC;AAC/B,YAAM,IAAsB,OAAO,IAAI,EAAE,IAAI,KAAK,QAAQ,IAAI,EAAE,IAAI;AACpE,YAAM,IAAsB,OAAO,IAAI,EAAE,EAAE,KAAK,QAAQ,IAAI,EAAE,EAAE;AAChE,UAAI,CAAC,KAAK,CAAC,EAAG,QAAO,CAAC;AACtB,YAAM,KAAK,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE;AAC/D,YAAM,OAAO,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI;AACjE,YAAM,OAAO,MAAM;AACnB,UAAI,KAAM,MAAK,KAAK,EAAE,MAAM,GAAG,OAAO,GAAG,MAAM,KAAK,KAAK,CAAC;AAC1D,YAAMA,UAAS,KAAK,GAAG,SAAS,OAAO,CAAC,GAAG,KAAK,MAAM,EAAE,QAAQ,IAAI,EAAE,SAAS,EAAE,KAAK,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,CAAC,IAAI,MAAM,GAAG,CAAC;AACnJ,aAAO,CAAC,EAAE,MAAM,GAAG,OAAO,GAAG,MAAM,EAAE,MAAM,IAAI,EAAE,IAAI,QAAAA,SAAQ,OAAO,UAAU,GAAG,MAAM,GAAG,OAAO,EAAE,MAAM,CAAC;AAAA,IAC5G,CAAC;AAAA,EACH;AACA,eAAa,OAAO,SAAS,KAAK;AAElC,QAAM,SAAqB;AAAA,IACzB,MAAM;AAAA,IACN,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,SAAS,CAAC;AAAA,IACV;AAAA,IACA,WAAW,CAAC;AAAA,IACZ;AAAA,IACA,QAAQ,CAAC;AAAA,IACT,SAAS,CAAC;AAAA,IACV,QAAQ,CAAC;AAAA,IACT,OAAO,CAAC;AAAA,IACR,MAAM,CAAC;AAAA,IACP;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,SAAS,SAAS,SAAS,MAAM;AACxC,SAAO,SAAS,SAAS,SAAS,MAAM;AAExC,QAAM,QAAQ,MAAM,QAAQ,CAAC,MAAO,EAAE,OAAO,CAAC,EAAE,IAAI,IAAI,CAAC,CAAE;AAC3D,QAAM,SAAiB,CAAC,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,MAAM;AACtE,QAAM,SAAS,MAAM,QAAQ,CAAC,MAAM,EAAE,MAAM;AAC5C,QAAM,QAAQ,KAAK,IAAI,GAAG,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE;AACrF,QAAM,SAAS,KAAK,IAAI,GAAG,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,OAAO,IAAI,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,IAAI;AAC1F,QAAM,QAAQ,KAAK,IAAI,QAAQ,QAAQ,UAAU,OAAO,IAAI,SAAS,CAAC;AACtE,QAAM,QAAQ,YAAY,SAAS,QAAQ,SAAS,KAAK,QAAQ,SAAS,CAAC;AAC3E,SAAO,QAAQ;AACf,SAAO,UAAU,QAAQ,MAAM,IAAI,MAAM,IAAI,UAAU;AACvD,MAAI,MAAO,QAAO,QAAQ;AAE1B,SAAO,SAAS,SAAS,SAAS,MAAM;AACxC,SAAO;AACT;AAQA,SAAS,SAAS,SAAkB,QAAkC;AACpE,QAAM,EAAE,GAAG,MAAM,IAAI,KAAK;AAC1B,QAAM,QAAQ,IAAI,IAAI;AACtB,QAAM,QAAiB,CAAC;AACxB,QAAM,MAAoB,CAAC;AAC3B,QAAM,SAAiB,CAAC,GAAG,OAAO,OAAO,GAAG,OAAO,MAAM,QAAQ,CAAC,MAAO,EAAE,OAAO,CAAC,EAAE,IAAI,IAAI,CAAC,CAAE,GAAG,GAAG,OAAO,KAAK;AAClH,QAAM,OAAO,CAAC,MACZ,MAAM,MAAM,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,KAAK,KAAK,OAAO,MAAM,CAAC,MAAM,WAAW,UAAU,CAAC,GAAG,CAAC,KAAK,KAAK,MAAM,KAAK;AACzI,QAAM,MAAM,CAAC,GAAW,GAAU,UAA0B;AAC1D,UAAM,KAAK,CAAC;AACZ,QAAI,KAAK,EAAE,MAAM,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;AAAA,EAC/C;AACA,QAAM,SAAS,oBAAI,IAAmB;AACtC,UAAQ,MAAM,QAAQ,CAAC,MAAM,MAAM;AACjC,UAAM,IAAI,KAAK,OAAO,UAAU,CAACC,OAAMA,GAAE,SAAS,UAAUA,GAAE,SAAS,UAAUA,GAAE,SAAS,MAAM;AAClG,UAAM,QAAQ,KAAK,OAAO,CAAC;AAC3B,UAAM,IAAI,OAAO,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,UAAU,CAAC;AAChE,QAAI,SAAS,MAAM,SAAS,UAAU,GAAG;AACvC,YAAM,QAAiB;AAAA,QACrB,CAAC,EAAE,IAAI,QAAQ,GAAG,EAAE,EAAE;AAAA,QACtB,CAAC,EAAE,GAAG,EAAE,CAAC;AAAA,QACT,CAAC,EAAE,IAAI,EAAE,IAAI,QAAQ,GAAG,EAAE,EAAE;AAAA,QAC5B,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;AAAA,MACjB;AACA,UAAI,GAAG,MAAM,KAAK,IAAI,KAAM,MAAM,CAAC,GAAa,EAAE,KAAK;AACvD;AAAA,IACF;AACA,UAAM,IAAI,OAAO,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,UAAU,CAAC;AAChE,QAAI,OAAO,SAAS,UAAU,GAAG;AAC/B,YAAM,MAAM,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,IAAI;AAC3C,YAAM,MAAM,OAAO,KAAK,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,UAAU,CAAC;AACjE,YAAM,QAAQ,OAAO,MAAM,OAAO,CAAC,MAAM,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM;AACrE,YAAM,QAAQ,OAAO,IAAI,GAAG,MAAM,MAAM,OAAO,EAAE,QAAQ,IAAI,IAAI,OAAO,GAAG,IAAI,MAAM,YAAY,EAAE,QAAQ,OAAO,KAAK;AACvH,aAAO,IAAI,KAAK,KAAK;AACrB,UAAI,GAAG,OAAO,EAAE,KAAK;AACrB;AAAA,IACF;AACA,UAAM,MAAM,KAAK,OAAO,QAAQ,CAAC,OAAQ,GAAG,SAAS,UAAU,GAAG,SAAS,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,CAAE,EAAE,QAAQ,CAAC,OAAO,OAAO,MAAM,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;AAChK,QAAI,KAAK;AACP,UAAI,KAAK,EAAE,MAAM,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,OAAO,IAAI,MAAM,CAAC;AAC1D;AAAA,IACF;AACA,QAAI,OAAO,SAAS,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,OAAO,GAAG;AACjE,UAAI,KAAK,EAAE,MAAM,GAAG,GAAG,OAAO,MAAM,IAAI,OAAO,GAAG,OAAO,MAAM,IAAI,OAAO,OAAO,QAAQ,CAAC;AAC1F;AAAA,IACF;AACA,UAAM,SAAS,IAAI,IAAI,SAAS,CAAC;AACjC,UAAM,OAAO,OAAO,MAAM,KAAK,CAAC,MAAM,EAAE,IAAI;AAC5C,QAAI,KAAK,SAAS,EAAE,GAAG,QAAQ,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,GAAG,MAAM,KAAK,KAAK,QAAQ,GAAG,MAAM,KAAK,KAAK,QAAQ,OAAO,MAAM,SAAS,QAAQ,CAAC;AAAA,EAC7I,CAAC;AACD,SAAO,gBAAgB,GAAG;AAC5B;AAGA,SAAS,OAAO,QAAiB,MAAgD;AAC/E,QAAM,CAAC,IAAI,IAAI,EAAE,IAAI;AACrB,QAAM,OAAO,KAAK,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;AACnC,QAAM,EAAE,GAAG,MAAM,IAAI,KAAK;AAC1B,MAAI,QAAQ,KAAK,KAAK,aAAa,GAAG;AACpC,UAAM,IAAI,MAAM,QAAQ,WAAW,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK,UAAU;AACnE,QAAI,KAAK,CAAC,EAAG,QAAO;AAAA,EACtB;AACA,QAAM,OAAc,CAAC,GAAG,CAAC,IAAI,IAAI,OAAO,GAAG,CAAC,CAAC;AAC7C,SAAO,KAAK,IAAI,IAAI,OAAO;AAC7B;AAGA,SAAS,OAAO,GAAc,MAAgD;AAC5E,QAAM,SAAS,WAAW,EAAE,MAAM;AAClC,QAAM,OAAO,YAAY,EAAE,KAAK,EAAE,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM;AACjE,WAAS,IAAI,GAAG,KAAK,SAAS,IAAI,MAAM,KAAK,GAAG;AAC9C,eAAW,MAAM,CAAC,SAAS,IAAI,GAAG,SAAS,IAAI,CAAC,GAAG;AACjD,YAAM,IAAI,MAAM,EAAE,QAAQ,EAAE;AAC5B,UAAI,KAAK,CAAC,EAAG,QAAO;AAAA,IACtB;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,SAAS,SAAkB,QAAkC;AACpE,QAAM,SAAuB,CAAC;AAC9B,QAAM,QAAQ,OAAO,MAAM,QAAQ,CAAC,MAAO,EAAE,OAAO,CAAC,EAAE,IAAI,IAAI,CAAC,CAAE;AAClE,aAAW,KAAK,OAAO,OAAO;AAC5B,UAAM,SAAS,QAAQ,MAAM,EAAE,IAAI,GAAG,OAAO,EAAE,KAAK;AACpD,QAAI,QAAQ,SAAS,UAAU,OAAO,UAAU,OAAW;AAC3D,UAAM,OAAO,OAAO,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,UAAU,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;AAC3F,WAAO;AAAA,MACL;AAAA,QACE,EAAE,MAAM,EAAE,MAAM,OAAO,EAAE,OAAO,MAAM,OAAO,OAAO,QAAQ,EAAE,QAAQ,OAAO,EAAE,OAAO,GAAI,OAAO,YAAY,EAAE,MAAM,OAAO,UAAU,IAAI,CAAC,GAAI,MAAM,KAAK;AAAA,QAC1J,EAAE,MAAM,CAAC,GAAG,OAAO,OAAO,GAAG,OAAO,KAAK,GAAG,MAAM,CAAC,GAAG,OAAO,GAAG,OAAO,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,OAAO,KAAK;AAAA,MACxH;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;ACtbA,IAAM,KAAK,CAAC,MAAsB,KAAK,MAAM,IAAI,GAAG,IAAI;AAEjD,SAAS,SAAS,QAAoB,SAAkB,UAAoB,KAAyF;AAC1K,QAAM,EAAE,EAAE,IAAI;AACd,QAAM,IAAI,KAAK;AACf,QAAM,IAAI,KAAK;AACf,QAAM,SAAS,CAAC,MAAc,UAAwC,SAAS,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,UAAU,KAAK;AAGrI,QAAM,SAAS,oBAAI,IAAyB;AAC5C,QAAM,UAAU,oBAAI,IAAoB;AACxC,UAAQ,MAAM,QAAQ,CAAC,MAAM,MAAM;AACjC,eAAW,KAAK,KAAK,QAAQ;AAC3B,UAAI,EAAE,SAAS,OAAQ;AACvB,iBAAW,MAAM,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG;AAC/B,eAAO,IAAI,KAAK,OAAO,IAAI,EAAE,KAAK,oBAAI,IAAI,GAAG,IAAI,CAAC,CAAC;AACnD,YAAI,EAAE,MAAM,SAAS,UAAU,CAAC,QAAQ,IAAI,EAAE,EAAG,SAAQ,IAAI,IAAI,CAAC;AAAA,MACpE;AAAA,IACF;AAAA,EACF,CAAC;AACD,QAAM,UAAU,CAAC,MAAc,UAA2B;AACxD,UAAM,IAAI,QAAQ,MAAM,IAAI,GAAG,OAAO,KAAK;AAC3C,WAAO,GAAG,SAAS,UAAU,EAAE,MAAM,SAAS;AAAA,EAChD;AACA,QAAM,WAAW,OAAO,KAAK,OAAO,CAAC,QAAQ,QAAQ,IAAI,MAAM,IAAI,KAAK,CAAC,EAAE,OAA2B,CAAC,GAAG,QAAS,MAAM,SAAY,IAAI,OAAO,KAAK,IAAI,GAAG,IAAI,IAAI,GAAI,MAAS;AACjL,QAAM,SAAS,aAAa,SAAY,SAAY,SAAS,MAAM,QAAQ,GAAG;AAG9E,QAAM,SAAS,CAAC,OAAmC;AACjD,QAAI,aAAa,UAAa,WAAW,OAAW,QAAO;AAC3D,UAAM,IAAI,QAAQ,IAAI,EAAE;AACxB,QAAI,MAAM,UAAa,KAAK,SAAU,QAAO;AAC7C,UAAM,OAAO,MAAM,SAAY,SAAY,SAAS,MAAM,CAAC,GAAG;AAC9D,UAAM,SAAkB;AAAA,MACtB,CAAC,GAAG,EAAE,SAAS,EAAE,CAAC;AAAA,MAClB,CAAC,QAAQ,EAAE,SAAS,EAAE,GAAG,KAAK,KAAK;AAAA,MACnC,CAAC,SAAS,OAAO,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC;AAAA,IAC7C;AACA,QAAI,SAAS,OAAW,QAAO,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,KAAK,KAAK,GAAG,CAAC,OAAO,OAAO,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;AAClH,WAAO,KAAK,CAAC,EAAE,MAAM,EAAE,SAAS,SAAS,SAAY,EAAE,QAAQ,EAAE,GAAG,KAAK,KAAK,GAAG,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;AAC1G,WAAO,EAAE,GAAG,MAAM;AAAA,EACpB;AACA,QAAM,QAAQ,CAAC,IAAY,QAAgB,QAAQ,OAAe;AAChE,UAAM,OAAO,OAAO,EAAE;AACtB,WAAO,OAAO,kBAAkB,KAAK,WAAW,IAAI,KAAK,MAAM,SAAS,UAAU,KAAK,SAAS,KAAK,KAAK,IAAI,MAAM;AAAA,EACtH;AAEA,QAAM,UAAU,IAAI,IAAI,OAAO,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,OAAO,EAAE,MAAM,EAAE,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;AAG5F,QAAM,QAAQ,OAAO,MAClB,IAAI,CAAC,MAAM;AACV,UAAM,OAAO,OAAO,EAAE,MAAM,EAAE,KAAK;AACnC,QAAI,CAAC,KAAM,QAAO;AAClB,QAAI,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,IAAI,EAAE,IAAI,QAAQ,EAAE,QAAQ,OAAO,CAAC,CAAC,KAAK,OAAO,OAAO,iBAAiB,CAAC,EAAE,CAAC;AAC7G,UAAM,KAAK,EAAE,GAAG;AAAA,MACd,CAAC,GAAG,EAAE,SAAS,GAAG,qBAAqB,EAAE,CAAC;AAAA,MAC1C,CAAC,KAAK,OAAO,EAAE,SAAS,GAAG,qBAAqB,EAAE,GAAG,KAAK,KAAK;AAAA,MAC/D,CAAC,KAAK,QAAQ,MAAM,EAAE,SAAS,EAAE,CAAC;AAAA,MAClC,CAAC,KAAK,OAAO,EAAE,qBAAqB,EAAE,CAAC;AAAA,MACvC,CAAC,EAAE,MAAM,EAAE,SAAS,GAAG,qBAAqB,EAAE,GAAG,KAAK,KAAK;AAAA,MAC3D,CAAC,EAAE,OAAO,EAAE,SAAS,GAAG,qBAAqB,EAAE,CAAC;AAAA,IAClD,CAAC;AACD,WAAO,MAAM,EAAE,MAAM,gDAAgD,IAAI,EAAE,IAAI,CAAC,uBAAuB,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,KAAK;AAAA,EAC5I,CAAC,EACA,KAAK,EAAE;AACV,QAAM,OAAO,OAAO,MACjB,QAAQ,CAAC,MAAM;AACd,QAAI,CAAC,EAAE,KAAM,QAAO,CAAC;AACrB,UAAM,KAAK,QAAQ,IAAI,EAAE,EAAE,KAAK;AAChC,UAAM,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,IAAI,EAAE,IAAI,KAAK,KAAK,KAAK,CAAC,MAAM,GAAG,EAAE,KAAK,IAAI,KAAK,KAAK,KAAK,CAAC;AAC9F,WAAO,CAAC,MAAM,EAAE,IAAI,qCAAqC,CAAC,YAAY,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC;AAAA,EACvF,CAAC,EACA,KAAK,EAAE;AAGV,QAAM,SAAS,oBAAI,IAAY;AAC/B,QAAM,SAAS,OAAO,KACnB,QAAQ,CAAC,QAAQ;AAChB,UAAM,IAAI,OAAO,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI,QAAQ,EAAE,UAAU,IAAI,KAAK;AAC/E,QAAI,CAAC,KAAK,OAAO,IAAI,IAAI,IAAI,EAAG,QAAO,CAAC;AACxC,UAAM,UAAU,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI,QAAQ,EAAE,UAAU,IAAI,KAAK;AAC1F,UAAM,OAAO,OAAO,IAAI,MAAM,IAAI,KAAK;AACvC,UAAM,IAAI,SAAS,UAAU,MAAM;AACnC,UAAM,IAAI,SAAS,UAAU,MAAM;AACnC,QAAI,MAAM,UAAa,MAAM,OAAW,QAAO,CAAC;AAChD,WAAO,IAAI,IAAI,IAAI;AACnB,UAAM,KAAK,EAAE,GAAG;AAAA,MACd,CAAC,GAAG,EAAE,SAAS,GAAG,qBAAqB,EAAE,CAAC;AAAA,MAC1C,CAAC,GAAG,EAAE,SAAS,GAAG,qBAAqB,EAAE,GAAG,KAAK,KAAK;AAAA,MACtD,CAAC,IAAI,MAAM,EAAE,SAAS,EAAE,CAAC;AAAA,MACzB,CAAC,GAAG,EAAE,qBAAqB,EAAE,CAAC;AAAA,MAC9B,CAAC,EAAE,MAAM,EAAE,SAAS,GAAG,qBAAqB,EAAE,GAAG,KAAK,KAAK;AAAA,MAC3D,CAAC,EAAE,OAAO,EAAE,SAAS,GAAG,qBAAqB,EAAE,CAAC;AAAA,IAClD,CAAC;AACD,UAAM,IAAI,OAAO,EAAE,MAAM;AACzB,WAAO;AAAA,MACL,aAAa,GAAG,EAAE,KAAK,CAAC,oDAAoD,IAAI,IAAI,IAAI,CAAC,uBAAuB,CAAC,YAAY,EAAE,sCAAsC,UAAU,EAAE,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;AAAA,IAC9M;AAAA,EACF,CAAC,EACA,KAAK,EAAE;AAGV,QAAM,QAAQ,OAAO,MAClB,QAAQ,CAAC,MAAM;AACd,UAAM,IAAI,EAAE;AACZ,QAAI,CAAC,EAAG,QAAO,CAAC;AAChB,UAAM,KAAK,EAAE,IAAI,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO;AAC7C,UAAM,KAAK,EAAE,IAAI,EAAE,IAAI;AACvB,UAAM,OAAO,MAAM,IAAI,KAAK,cAAc,EAAE,IAAI,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,KAAK,KAAK,KAAK,SAAS,OAAO,EAAE,MAAM,KAAK,UAAU,MAAM;AAC/I,WAAO;AAAA,MACL;AAAA,QACE,EAAE;AAAA,QACF,iCAAiC,GAAG,EAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC,SAAS,EAAE,KAAK,MAAM,MAAM,MAAM,OAAO,IAAI,IAAI,EAAE,KAAK,OAAO,YAAY,CAAC,GAAG,IAAI;AAAA,QAC7K,oBAAoB,IAAI,EAAE,EAAE,CAAC;AAAA,MAC/B;AAAA,IACF;AAAA,EACF,CAAC,EACA,KAAK,EAAE;AAGV,QAAM,QAAQ,OAAO,MAClB,IAAI,CAAC,MAAM;AACV,UAAM,KAAK,QAAQ,IAAI,EAAE,EAAE,KAAK;AAChC,UAAM,KAAK,CAAC,GAAI,OAAO,IAAI,EAAE,EAAE,KAAK,CAAC,CAAE,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC7D,UAAM,MAAM,GAAG,SAAS,IAAI,SAAS,KAAK,EAAE,IAAI;AAChD,UAAM,SAAS,EAAE,OAAO,EAAE,KAAK,SAAS,EAAE;AAC1C,UAAM,OAAO,CAAC,KAAa,QAAQ,OAAe,gBAAgB,GAAG,QAAQ,GAAG,EAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC,SAAS,MAAM,IAAI,KAAK;AAC9J,UAAM,QAAQ,GAAG,MAAM,0BAA0B,GAAG,KAAK,KAAK,SAAS,CAAC,SAAS,EAAE,GAAG,KAAK,SAAS,IAAI,IAAI,EAAE,EAAE,CAAC,GAAG,MAAM,0BAA0B,GAAG,KAAK,KAAK,OAAO,CAAC,SAAS,EAAE;AACpL,UAAM,KAAK,EAAE,IAAI,EAAE,KAAK,QAAQ,EAAE,OAAO;AACzC,UAAM,OAAO,EAAE,OAAO,0BAA0B,GAAG,KAAK,EAAE,OAAO,CAAC,CAAC,QAAQ,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,YAAY,EAAE,IAAI,aAAa,EAAE,IAAI,SAAS,EAAE,UAAU,MAAM,MAAM,QAAQ,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,KAAK;AACzM,UAAM,QAA4B,CAAC,CAAC,IAAI,OAAO,iBAAiB,CAAC;AACjE,UAAM,QAAQ,EAAE,MACb,IAAI,CAAC,MAAM,MAAM;AAChB,YAAM,QAAQ,EAAE,OAAO,CAAC,KAAK,KAAK;AAClC,YAAM,MAAM,UAAU,KAAK,WAAW,iBAAiB,UAAU,KAAK,WAAW,iBAAiB,UAAU,KAAK,WAAW,eAAe,UAAU,KAAK,WAAW,eAAe;AACpL,YAAM,WAAW,EAAE,UAAU,CAAC,KAAK,EAAE;AACrC,aAAO,EAAE,OAAO,MAAM,IAAI,KAAK,KAAK,EAAE,IAAI,EAAE,KAAK,OAAO,UAAU,MAAM,OAAO,KAAK,IAAI,MAAM,IAAI,KAAK,KAAK,EAAE,IAAI,UAAU,MAAM,OAAO,OAAO,QAAQ;AAAA,IAC1J,CAAC,EACA,KAAK,EAAE;AACV,UAAM,QAAQ,MAAM,EAAE,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,IAAI,oBAAoB,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,OAAO,oBAAoB,IAAI,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE;AACtI,WAAO,kCAAkC,GAAG,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,KAAK,KAAK;AAAA,EAC7E,CAAC,EACA,KAAK,EAAE;AAEV,SAAO,EAAE,OAAO,QAAQ,MAAM,QAAQ,OAAO,QAAQ,OAAO,QAAQ,QAAQ;AAC9E;","names":["points","e"]}
|