expressive-charts 0.3.0 → 0.5.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 (46) hide show
  1. package/CHANGELOG.md +73 -1
  2. package/README.md +7 -7
  3. package/dist/define-DeZLs1h7.js +95 -0
  4. package/dist/define-DeZLs1h7.js.map +1 -0
  5. package/dist/drawing-Ypmq-2h6.d.cts +214 -0
  6. package/dist/drawing-Ypmq-2h6.d.ts +214 -0
  7. package/dist/effect-C786hGyJ.d.cts +232 -0
  8. package/dist/effect-CMo-2gPf.d.ts +232 -0
  9. package/dist/expressive-charts.css +5 -2
  10. package/dist/expressive-charts.css.d.cts +1 -2
  11. package/dist/expressive-charts.css.d.ts +1 -2
  12. package/dist/expressive-charts.global.js +47 -48
  13. package/dist/expressive-charts.global.js.map +1 -1
  14. package/dist/icons/sport.cjs +211 -156
  15. package/dist/icons/sport.cjs.map +1 -1
  16. package/dist/icons/sport.d.cts +5 -7
  17. package/dist/icons/sport.d.ts +5 -7
  18. package/dist/icons/sport.js +122 -71
  19. package/dist/icons/sport.js.map +1 -1
  20. package/dist/index.cjs +13203 -9982
  21. package/dist/index.cjs.map +1 -1
  22. package/dist/index.d.cts +953 -871
  23. package/dist/index.d.ts +953 -871
  24. package/dist/index.js +11000 -8234
  25. package/dist/index.js.map +1 -1
  26. package/dist/path-data-DnEckjY8.js +123 -0
  27. package/dist/path-data-DnEckjY8.js.map +1 -0
  28. package/dist/testing.cjs +2047 -1255
  29. package/dist/testing.cjs.map +1 -1
  30. package/dist/testing.d.cts +135 -139
  31. package/dist/testing.d.ts +135 -139
  32. package/dist/testing.js +696 -499
  33. package/dist/testing.js.map +1 -1
  34. package/dist/transition-Bu1NsQor.js +2067 -0
  35. package/dist/transition-Bu1NsQor.js.map +1 -0
  36. package/package.json +6 -6
  37. package/dist/chunk-7A7LXXT4.js +0 -70
  38. package/dist/chunk-7A7LXXT4.js.map +0 -1
  39. package/dist/chunk-CJUQHEX6.js +0 -618
  40. package/dist/chunk-CJUQHEX6.js.map +0 -1
  41. package/dist/chunk-N2BLUETM.js +0 -1194
  42. package/dist/chunk-N2BLUETM.js.map +0 -1
  43. package/dist/drawing-CdTgixMY.d.cts +0 -206
  44. package/dist/drawing-CdTgixMY.d.ts +0 -206
  45. package/dist/effect-Bu3MHHeg.d.ts +0 -247
  46. package/dist/effect-D4vmdYP4.d.cts +0 -247
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/core/geometry/segment.ts","../src/core/geometry/path-data.ts","../src/core/geometry/walk.ts","../src/core/geometry/outline.ts","../src/core/geometry/describe/mark.ts","../src/core/geometry/describe/arc.ts","../src/core/geometry/describe/bar.ts","../src/core/geometry/describe/line.ts","../src/core/geometry/describe/point.ts","../src/core/geometry/describe/index.ts","../src/core/geometry/matrix.ts","../src/core/geometry/samples.ts"],"sourcesContent":["// Path segments: straight lines and circular arcs, with exact lengths.\n//\n// Angles are screen angles: radians, 0 along +x, increasing clockwise on screen (y points down).\n// That is the convention of Math.atan2 in chart pixels, and of the walk's `angle(t)`.\n\nimport type { Point, Rect } from \"../contracts/geometry\";\n\nexport const TAU = 2 * Math.PI;\n\nexport interface LineSegment {\n readonly kind: \"line\";\n readonly from: Point;\n readonly to: Point;\n readonly length: number;\n /** Direction from `from` to `to`, or the fallback given to `line()` when they coincide. */\n readonly angle: number;\n}\n\nexport interface ArcSegment {\n readonly kind: \"arc\";\n readonly center: Point;\n readonly radius: number;\n /** Screen angle of the first point. */\n readonly start: number;\n /** Signed: positive is clockwise on screen. */\n readonly sweep: number;\n /** Exact: radius × |sweep|. */\n readonly length: number;\n}\n\nexport type PathSegment = LineSegment | ArcSegment;\n\n/** A straight segment. `fallbackAngle` is its direction if `from` and `to` coincide. */\nexport function line(from: Point, to: Point, fallbackAngle = 0): LineSegment {\n const dx = to.x - from.x;\n const dy = to.y - from.y;\n const length = Math.hypot(dx, dy);\n return { kind: \"line\", from, to, length, angle: length > 0 ? Math.atan2(dy, dx) : normalizeAngle(fallbackAngle) };\n}\n\n/** A circular arc from screen angle `start`, turning `sweep` radians (positive = clockwise on screen). */\nexport function arc(center: Point, radius: number, start: number, sweep: number): ArcSegment {\n return { kind: \"arc\", center, radius, start, sweep, length: radius * Math.abs(sweep) };\n}\n\n/** The point a fraction `u` (0–1) of the way along the segment, by distance. Exact at both ends of a line. */\nexport function pointOn(segment: PathSegment, u: number): Point {\n if (segment.kind === \"line\") {\n const { from, to } = segment;\n return { x: from.x * (1 - u) + to.x * u, y: from.y * (1 - u) + to.y * u };\n }\n return polar(segment.center, segment.radius, segment.start + segment.sweep * u);\n}\n\n/** Direction of travel at fraction `u`, in (-PI, PI]. */\nexport function angleOn(segment: PathSegment, u: number): number {\n if (segment.kind === \"line\") return segment.angle;\n const quarter = segment.sweep < 0 ? -Math.PI / 2 : Math.PI / 2;\n return normalizeAngle(segment.start + segment.sweep * u + quarter);\n}\n\nexport function polar(center: Point, radius: number, angle: number): Point {\n return { x: center.x + radius * Math.cos(angle), y: center.y + radius * Math.sin(angle) };\n}\n\n/** The same angle in (-PI, PI]. */\nexport function normalizeAngle(angle: number): number {\n return angle - TAU * Math.ceil((angle - Math.PI) / TAU);\n}\n\n/** The points that bound a segment: its ends, plus an arc's extremes in x and y. */\nexport function extremes(segment: PathSegment): Point[] {\n if (segment.kind === \"line\") return [segment.from, segment.to];\n const points = [pointOn(segment, 0), pointOn(segment, 1)];\n for (let k = 0; k < 4; k++) {\n const angle = (k * Math.PI) / 2;\n if (sweeps(segment, angle)) points.push(polar(segment.center, segment.radius, angle));\n }\n return points;\n}\n\nexport function boundsOf(points: readonly Point[]): Rect {\n let minX = Infinity;\n let minY = Infinity;\n let maxX = -Infinity;\n let maxY = -Infinity;\n for (const { x, y } of points) {\n if (x < minX) minX = x;\n if (x > maxX) maxX = x;\n if (y < minY) minY = y;\n if (y > maxY) maxY = y;\n }\n return { x: minX, y: minY, width: maxX - minX, height: maxY - minY };\n}\n\n/** True if the arc passes through screen angle `angle`. */\nfunction sweeps(segment: ArcSegment, angle: number): boolean {\n const extent = Math.abs(segment.sweep);\n if (extent >= TAU) return true;\n const turned = segment.sweep >= 0 ? angle - segment.start : segment.start - angle;\n return ((turned % TAU) + TAU) % TAU <= extent;\n}\n","// SVG path data for segments: M, L, A and Z only, with numbers rounded to 0.001 px.\n\nimport type { Point } from \"../contracts/geometry\";\nimport { pointOn, polar, type PathSegment } from \"./segment\";\n\n/** A coordinate for path data: rounded to 0.001, with no \"-0\". */\nexport function formatNumber(value: number): string {\n const rounded = Math.round(value * 1000) / 1000;\n return rounded === 0 ? \"0\" : String(rounded);\n}\n\nexport function moveTo(point: Point): string {\n return `M${formatNumber(point.x)},${formatNumber(point.y)}`;\n}\n\n/**\n * Commands that draw a segment from fraction `u0` to `u1` of its length, assuming the pen is already\n * at the `u0` point. Arcs are split into pieces of at most half a turn, so the large-arc flag is\n * always 0 and a full circle still draws.\n */\nexport function drawTo(segment: PathSegment, u0 = 0, u1 = 1): string {\n if (segment.kind === \"line\") {\n const p = u1 === 1 ? segment.to : pointOn(segment, u1);\n return `L${formatNumber(p.x)},${formatNumber(p.y)}`;\n }\n const from = segment.start + segment.sweep * u0;\n const turn = segment.sweep * (u1 - u0);\n const pieces = Math.max(1, Math.ceil(Math.abs(turn) / Math.PI - 1e-9));\n const r = formatNumber(segment.radius);\n const clockwise = turn >= 0 ? 1 : 0;\n let d = \"\";\n for (let i = 1; i <= pieces; i++) {\n const p = polar(segment.center, segment.radius, from + (turn * i) / pieces);\n d += `A${r},${r} 0 0 ${clockwise} ${formatNumber(p.x)},${formatNumber(p.y)}`;\n }\n return d;\n}\n\n/**\n * Path data for a run of connected segments. Zero-length segments draw nothing. A closed run ends\n * with Z, which also replaces a final straight segment back to the start.\n */\nexport function pathData(segments: readonly PathSegment[], closed = false): string {\n const first = segments[0];\n if (!first) return \"\";\n let count = segments.length;\n if (closed) {\n while (count > 0 && segments[count - 1]!.length <= 0) count--;\n if (count > 0 && segments[count - 1]!.kind === \"line\") count--;\n }\n let d = moveTo(pointOn(first, 0));\n for (let i = 0; i < count; i++) {\n const segment = segments[i]!;\n if (segment.length > 0) d += drawTo(segment);\n }\n return closed ? `${d}Z` : d;\n}\n","// A walk: connected segments parameterised by distance, so t = 0.5 is halfway along on screen. It can\n// have gaps, stretches with no data that its path data leaves out.\n\nimport type { Point } from \"../contracts/geometry\";\nimport { drawTo, moveTo, pathData } from \"./path-data\";\nimport { angleOn, pointOn, type PathSegment } from \"./segment\";\n\n/** Stretches of a walk with no data, as [from, to] values of t: in order, apart, each with 0 ≤ from < to ≤ 1. */\nexport type Gaps = readonly (readonly [from: number, to: number])[];\n\nexport interface Walk {\n readonly segments: readonly PathSegment[];\n readonly length: number;\n readonly start: Point;\n readonly end: Point;\n /** The stretches slice() and d leave out; empty when there are none. */\n readonly gaps: Gaps;\n /** t in [0, 1], proportional to distance. Values outside are clamped. */\n point(t: number): Point;\n /** Direction of travel in (-PI, PI]. At a joint, the segment ahead wins, except at t = 1. */\n angle(t: number): number;\n /**\n * Path data from t0 to t1, in either order. Just a move when they're equal. It leaves out the gaps:\n * each part between them starts with its own move, and a part with no length isn't written.\n */\n slice(t0: number, t1: number): string;\n /** Path data for the whole walk, less its gaps. */\n readonly d: string;\n}\n\nconst clamp01 = (t: number): number => (t > 0 ? (t < 1 ? t : 1) : 0);\nconst NONE: Gaps = Object.freeze([]);\n\n/** The segments must connect: each starts where the one before ends. The gaps are taken as given. */\nexport function createWalk(segments: readonly PathSegment[], gaps: Gaps = NONE): Walk {\n const first = segments[0];\n const last = segments[segments.length - 1];\n if (!first || !last) throw new RangeError(\"A walk needs at least one segment.\");\n\n // cumulative[i] is the distance to the start of segment i.\n const cumulative = [0];\n for (const segment of segments) cumulative.push(cumulative[cumulative.length - 1]! + segment.length);\n const length = cumulative[segments.length]!;\n const start = pointOn(first, 0);\n const end = pointOn(last, 1);\n\n // The segment at distance d, and the fraction along it. Zero-length segments are never picked\n // unless the whole walk has zero length.\n const locate = (d: number): { readonly index: number; readonly u: number } => {\n if (!(length > 0)) return { index: 0, u: 0 };\n if (d >= length) {\n let index = segments.length - 1;\n while (index > 0 && !(segments[index]!.length > 0)) index--;\n return { index, u: 1 };\n }\n // The first segment that ends beyond d.\n let lo = 0;\n let hi = segments.length - 1;\n while (lo < hi) {\n const mid = (lo + hi) >> 1;\n if (cumulative[mid + 1]! > d) hi = mid;\n else lo = mid + 1;\n }\n return { index: lo, u: Math.min(1, (d - cumulative[lo]!) / segments[lo]!.length) };\n };\n\n const point = (t: number): Point => {\n const at = clamp01(t);\n if (at === 0) return start;\n if (at === 1) return end;\n const { index, u } = locate(at * length);\n return pointOn(segments[index]!, u);\n };\n\n /** Path data from t `from` to `to` (from ≤ to, both in [0, 1]), gaps and all. */\n const draw = (from: number, to: number): string => {\n let d = moveTo(point(from));\n const a = from * length;\n const b = to * length;\n if (!(b > a)) return d;\n const first = locate(a);\n for (let i = first.index; i < segments.length && cumulative[i]! < b; i++) {\n const segment = segments[i]!;\n if (!(segment.length > 0)) continue;\n const u0 = i === first.index ? first.u : 0;\n const u1 = cumulative[i + 1]! > b ? Math.min(1, (b - cumulative[i]!) / segment.length) : 1;\n if (u1 > u0) d += drawTo(segment, u0, u1);\n }\n return d;\n };\n\n const slice = (t0: number, t1: number): string => {\n const from = clamp01(Math.min(t0, t1));\n const to = clamp01(Math.max(t0, t1));\n if (gaps.length === 0) return draw(from, to);\n // The parts between the gaps, each drawn from its own move. All in a gap: a move where it starts.\n let d = \"\";\n let at = from;\n for (const [a, b] of gaps) {\n if (a >= to) break;\n if (a > at) d += draw(at, a);\n if (b > at) at = b;\n }\n if (to > at) d += draw(at, to);\n return d === \"\" ? moveTo(point(from)) : d;\n };\n\n return {\n segments,\n length,\n start,\n end,\n gaps,\n point,\n angle(t) {\n const { index, u } = locate(clamp01(t) * length);\n return angleOn(segments[index]!, u);\n },\n slice,\n d: gaps.length === 0 ? pathData(segments) : slice(0, 1)\n };\n}\n","// Outlines with canonical sampling, so morph can match corners and winding between any two marks.\n\nimport type { Outline, Point } from \"../contracts/geometry\";\nimport { pathData } from \"./path-data\";\nimport type { PathSegment } from \"./segment\";\nimport { createWalk, type Walk } from \"./walk\";\n\n/** The four sides of a closed outline, in order. Each must start where the one before ends. */\nexport type Sides = readonly [\n left: readonly PathSegment[],\n end: readonly PathSegment[],\n right: readonly PathSegment[],\n start: readonly PathSegment[]\n];\n\n/**\n * A closed outline from its sides: left (the up side, walked in the direction of travel), end,\n * right (walked back) and start. That order runs clockwise on screen from the start-left corner.\n */\nexport function closedOutline(sides: Sides): Outline {\n const walks = sides.map((side) => createWalk(side));\n return {\n d: pathData(sides.flat(), true),\n closed: true,\n sample(n) {\n checkCount(n, 4);\n const perSide = n / 4;\n const points: Point[] = [];\n for (const walk of walks) {\n for (let j = 0; j < perSide; j++) points.push(walk.point(j / perSide));\n }\n return points;\n }\n };\n}\n\n/** An open outline: the stroke along a walk, less its gaps. Its samples run along the whole walk, gaps and all. */\nexport function openOutline(walk: Walk): Outline {\n return {\n d: walk.d,\n closed: false,\n sample(n) {\n checkCount(n, 1);\n if (n === 1) return [walk.start];\n const points: Point[] = [];\n for (let j = 0; j < n; j++) points.push(walk.point(j / (n - 1)));\n return points;\n }\n };\n}\n\nfunction checkCount(n: number, multiple: number): void {\n if (!Number.isInteger(n) || n < 0 || n % multiple !== 0) {\n const what = multiple === 1 ? \"a whole number ≥ 0\" : `a whole multiple of ${multiple}`;\n throw new RangeError(`outline.sample(n): n must be ${what}, got ${n}.`);\n }\n}\n","// Shared by the builders: assembling a MarkGeometry from a walk and a body, and checking input.\n\nimport type { MarkGeometry, Outline, Point, Rect } from \"../../contracts/geometry\";\nimport type { Walk } from \"../walk\";\n\nexport interface MarkParts {\n readonly key: string;\n readonly series?: string | undefined;\n readonly walk: Walk;\n readonly thickness: number;\n readonly outline: Outline;\n readonly bounds: Rect;\n readonly center: Point;\n readonly pivot: Point;\n readonly labelBounds?: readonly Rect[] | undefined;\n readonly segments?: readonly MarkGeometry[];\n}\n\nexport function assemble({ key, series, walk, thickness, outline, bounds, center, pivot, labelBounds, segments }: MarkParts): MarkGeometry {\n return {\n key,\n ...(series === undefined ? {} : { series }),\n start: walk.start,\n end: walk.end,\n length: walk.length,\n path: (t) => walk.point(t),\n angle: (t) => walk.angle(t),\n slice: (t0, t1) => walk.slice(t0, t1),\n ...(walk.gaps.length === 0 ? {} : { gaps: walk.gaps }),\n thickness,\n outline,\n bounds,\n center,\n pivot,\n ...(labelBounds === undefined ? {} : { labelBounds }),\n ...(segments === undefined ? {} : { segments })\n };\n}\n\n/** Throws a RangeError naming the builder and field unless `value` is a finite number. */\nexport function finite(builder: string, field: string, value: number): number {\n if (!Number.isFinite(value)) throw new RangeError(`describe.${builder}: ${field} must be a finite number, got ${value}.`);\n return value;\n}\n\n/** A spec's `labelBounds`, checked: each box's numbers finite, its sizes ≥ 0. Charts give them every frame, so a good box costs four comparisons. */\nexport function labelBoxes(builder: string, boxes: readonly Rect[] | undefined): readonly Rect[] | undefined {\n if (!boxes) return boxes;\n for (let i = 0; i < boxes.length; i++) {\n const { x, y, width, height } = boxes[i]!;\n if (Number.isFinite(x) && Number.isFinite(y) && Number.isFinite(width) && width >= 0 && Number.isFinite(height) && height >= 0) continue;\n finite(builder, `labelBounds[${i}].x`, x);\n finite(builder, `labelBounds[${i}].y`, y);\n size(builder, `labelBounds[${i}].width`, width);\n size(builder, `labelBounds[${i}].height`, height);\n }\n return boxes;\n}\n\n/** Throws a RangeError unless `value` is a finite number ≥ 0. */\nexport function size(builder: string, field: string, value: number): number {\n if (!(Number.isFinite(value) && value >= 0)) {\n throw new RangeError(`describe.${builder}: ${field} must be a finite number ≥ 0, got ${value}.`);\n }\n return value;\n}\n","// describe.arc: donut and pie slices, in d3.pie()'s angle convention.\n\nimport type { MarkGeometry, Rect } from \"../../contracts/geometry\";\nimport { closedOutline } from \"../outline\";\nimport { arc, boundsOf, extremes, line, polar, TAU } from \"../segment\";\nimport { createWalk } from \"../walk\";\nimport { assemble, finite, labelBoxes, size } from \"./mark\";\n\nexport interface ArcSpec {\n readonly key: string;\n readonly series?: string;\n /** The donut's centre. */\n readonly cx: number;\n readonly cy: number;\n /** Radii in px; 0 inner makes a pie slice. They're swapped if inner > outer, as d3.arc() does. */\n readonly inner: number;\n readonly outer: number;\n /** Radians, 0 at 12 o'clock, clockwise: the d3.pie() convention. end < start walks anticlockwise. */\n readonly start: number;\n readonly end: number;\n /** The boxes of the text drawn for the mark, in the same px: passed through as `labelBounds`. */\n readonly labelBounds?: readonly Rect[];\n}\n\n/**\n * The walk runs along the mid-radius arc from the start angle to the end angle, so for a slice\n * walked clockwise \"up\" is outward. The angle of travel equals the d3 angle (normalised).\n */\nexport function describeArc(spec: ArcSpec): MarkGeometry {\n const { key, series } = spec;\n const center = { x: finite(\"arc\", \"cx\", spec.cx), y: finite(\"arc\", \"cy\", spec.cy) };\n const r0 = Math.min(size(\"arc\", \"inner\", spec.inner), size(\"arc\", \"outer\", spec.outer));\n const r1 = Math.max(spec.inner, spec.outer);\n finite(\"arc\", \"start\", spec.start);\n finite(\"arc\", \"end\", spec.end);\n // More than a full turn draws the same ring, as with d3.arc().\n const sweep = Math.max(-TAU, Math.min(TAU, spec.end - spec.start));\n // d3 measures from 12 o'clock; screen angles from 3 o'clock.\n const from = spec.start - Math.PI / 2;\n const to = from + sweep;\n\n // The up side is outward when walking clockwise, inward when walking anticlockwise.\n const [left, right] = sweep >= 0 ? [r1, r0] : [r0, r1];\n const sides = [\n [arc(center, left, from, sweep)],\n [line(polar(center, left, to), polar(center, right, to), to + (left > right ? Math.PI : 0))],\n [arc(center, right, to, -sweep)],\n [line(polar(center, right, from), polar(center, left, from), from + (left > right ? 0 : Math.PI))]\n ] as const;\n\n const walk = createWalk([arc(center, (r0 + r1) / 2, from, sweep)]);\n return assemble({\n key,\n series,\n walk,\n thickness: r1 - r0,\n outline: closedOutline(sides),\n bounds: boundsOf(sides.flat().flatMap(extremes)),\n center: walk.point(0.5),\n pivot: center,\n labelBounds: labelBoxes(\"arc\", spec.labelBounds)\n });\n}\n","// describe.bar: horizontal bars and vertical columns, plain or stacked, with an optional rounded tip.\n\nimport type { MarkGeometry, Point, Rect } from \"../../contracts/geometry\";\nimport { closedOutline } from \"../outline\";\nimport { arc, boundsOf, line } from \"../segment\";\nimport { createWalk } from \"../walk\";\nimport { assemble, finite, labelBoxes, size } from \"./mark\";\n\n/** The edge a bar grows from. */\nexport type Baseline = \"left\" | \"right\" | \"top\" | \"bottom\";\n\nexport interface BarSegmentSpec {\n readonly series: string;\n /** Px along the walk, gap included. */\n readonly size: number;\n}\n\nexport interface BarSpec {\n readonly key: string;\n readonly series?: string;\n /** The whole bar's rectangle, in chart px. */\n readonly x: number;\n readonly y: number;\n readonly width: number;\n readonly height: number;\n readonly baseline: Baseline;\n /** Corner radius at the tip. The baseline end stays square. Default 0. */\n readonly radius?: number;\n /**\n * Ordered parts, from the baseline. Default: one segment named after `series`, covering the bar.\n * Sizes normally add up to the bar's length; anything past the tip is cut off.\n */\n readonly segments?: readonly BarSegmentSpec[];\n /**\n * Px left empty between segments (the prototype uses 2). It comes out of the start of the later\n * segment, so every segment still ends at its value, and it shrinks to fit when what comes\n * before is shorter. Default 0.\n */\n readonly gap?: number;\n /** The boxes of the text drawn for the bar, its segments having none, in the same px: passed through as `labelBounds`. */\n readonly labelBounds?: readonly Rect[];\n}\n\nconst ANGLE: Readonly<Record<Baseline, number>> = { left: 0, right: Math.PI, top: Math.PI / 2, bottom: -Math.PI / 2 };\n\n/**\n * The walk runs along the centre line from the middle of the baseline edge to the middle of the\n * tip. A plain bar has one segment, so `travel(…, { along: \"goals\" })` works stacked or not.\n */\nexport function describeBar(spec: BarSpec): MarkGeometry {\n const { key, series, baseline, x, y, width, height } = spec;\n if (!Object.prototype.hasOwnProperty.call(ANGLE, baseline)) {\n throw new RangeError(`describe.bar: baseline must be left, right, top or bottom, got ${String(baseline)}.`);\n }\n finite(\"bar\", \"x\", x);\n finite(\"bar\", \"y\", y);\n size(\"bar\", \"width\", width);\n size(\"bar\", \"height\", height);\n const radius = size(\"bar\", \"radius\", spec.radius ?? 0);\n const gap = size(\"bar\", \"gap\", spec.gap ?? 0);\n const labelBounds = labelBoxes(\"bar\", spec.labelBounds);\n\n const horizontal = baseline === \"left\" || baseline === \"right\";\n const length = horizontal ? width : height;\n const thickness = horizontal ? height : width;\n const T = thickness;\n const angle = ANGLE[baseline];\n const at = frame(spec);\n\n // The bar or segment covering [p0, p1] along the walk. The tip is rounded by up to `tip` px.\n const part = (\n p0: number,\n p1: number,\n tip: number,\n rest: { key: string; series: string | undefined; bounds?: Rect; labelBounds?: readonly Rect[] | undefined; segments?: readonly MarkGeometry[] }\n ): MarkGeometry => {\n const rr = Math.max(0, Math.min(tip, p1 - p0, T / 2));\n const outline = closedOutline([\n [line(at(p0, 0), at(p1 - rr, 0), angle)],\n rr > 0\n ? [\n arc(at(p1 - rr, rr), rr, angle - Math.PI / 2, Math.PI / 2),\n line(at(p1, rr), at(p1, T - rr), angle + Math.PI / 2),\n arc(at(p1 - rr, T - rr), rr, angle, Math.PI / 2)\n ]\n : [line(at(p1, 0), at(p1, T), angle + Math.PI / 2)],\n [line(at(p1 - rr, T), at(p0, T), angle + Math.PI)],\n [line(at(p0, T), at(p0, 0), angle - Math.PI / 2)]\n ]);\n const walk = createWalk([line(at(p0, T / 2), at(p1, T / 2), angle)]);\n return assemble({\n ...rest,\n walk,\n thickness,\n outline,\n bounds: rest.bounds ?? boundsOf([at(p0, 0), at(p1, T)]),\n center: at((p0 + p1) / 2, T / 2),\n pivot: walk.start\n });\n };\n\n const specs: readonly { readonly series?: string | undefined; readonly size: number }[] = spec.segments ?? [{ series, size: length }];\n const seen = new Set<string>();\n let cursor = 0;\n const spans = specs.map((segment, index) => {\n size(\"bar\", `segments[${index}].size`, segment.size);\n if (segment.series !== undefined) {\n if (seen.has(segment.series)) throw new Error(`describe.bar: series \"${segment.series}\" appears twice in the segments of \"${key}\".`);\n seen.add(segment.series);\n }\n const from = Math.min(cursor, length);\n cursor += segment.size;\n const to = Math.min(cursor, length);\n return { segment, index, p0: Math.min(from + Math.min(gap, from), to), p1: to };\n });\n\n const segments = spans.map(({ segment, index, p0, p1 }) =>\n // The rounding fades in as a segment nears the tip, so a growing stack never pops.\n part(p0, p1, radius - (length - p1), {\n key: segment.series === undefined ? `${key}/${index}` : `${key}/${segment.series}`,\n series: segment.series\n })\n );\n // The whole bar keeps the exact rectangle it was given.\n return part(0, length, radius, { key, series, bounds: { x, y, width, height }, labelBounds, segments });\n}\n\n/** Chart px at distance p along the walk and s across it, measured from the left (up) edge. */\nfunction frame({ x, y, width: w, height: h, baseline }: BarSpec): (p: number, s: number) => Point {\n switch (baseline) {\n case \"left\":\n return (p, s) => ({ x: x + p, y: y + s });\n case \"right\":\n return (p, s) => ({ x: x + w - p, y: y + h - s });\n case \"top\":\n return (p, s) => ({ x: x + w - s, y: y + p });\n case \"bottom\":\n return (p, s) => ({ x: x + s, y: y + h - p });\n }\n}\n","// describe.line: a straight-segment polyline, as d3.line() draws with its default curve, with gaps\n// where a run of points ends and the next begins.\n\nimport type { MarkGeometry, Point, Rect } from \"../../contracts/geometry\";\nimport { openOutline } from \"../outline\";\nimport { boundsOf, line, type LineSegment } from \"../segment\";\nimport { createWalk, type Gaps } from \"../walk\";\nimport { assemble, finite, labelBoxes, size } from \"./mark\";\n\nexport interface LineSpec {\n readonly key: string;\n readonly series?: string;\n /** At least one point, in chart px. */\n readonly points: readonly Point[];\n /**\n * The indices of the points that start a new run, so there's a gap from `points[i - 1]` to\n * `points[i]`: each a whole number from 1 to the last index, in order, with no repeats. A line\n * drawn with d3's `.defined()` is described by its defined points and where they break. Default none.\n */\n readonly breaks?: readonly number[];\n /** Stroke width in px. Default 1, SVG's default. */\n readonly width?: number;\n /** The boxes of the text drawn for the mark, in the same px: passed through as `labelBounds`. */\n readonly labelBounds?: readonly Rect[];\n}\n\n/**\n * The walk is the line itself, first point to last, running straight across each break. Its outline\n * is open: the stroke, with the breaks left out. A break between two points in the same place leaves\n * no gap, since there's nothing between them to leave out.\n */\nexport function describeLine(spec: LineSpec): MarkGeometry {\n const { key, series, points } = spec;\n const width = size(\"line\", \"width\", spec.width ?? 1);\n const first = points[0];\n if (!first) throw new RangeError(`describe.line: \"${key}\" needs at least one point.`);\n points.forEach((p, i) => {\n finite(\"line\", `points[${i}].x`, p.x);\n finite(\"line\", `points[${i}].y`, p.y);\n });\n const breaks = checkBreaks(spec.breaks, points.length);\n\n const segments: LineSegment[] = [];\n for (let i = 1; i < points.length; i++) {\n // A repeated point keeps the direction so far.\n segments.push(line(points[i - 1]!, points[i]!, segments[segments.length - 1]?.angle ?? 0));\n }\n if (segments.length === 0) segments.push(line(first, first));\n\n const walk = createWalk(segments, gapsAt(breaks, segments));\n const box = boundsOf(points);\n const pad = width / 2;\n return assemble({\n key,\n series,\n walk,\n thickness: width,\n outline: openOutline(walk),\n bounds: { x: box.x - pad, y: box.y - pad, width: box.width + width, height: box.height + width },\n center: walk.point(0.5),\n pivot: first,\n labelBounds: labelBoxes(\"line\", spec.labelBounds)\n });\n}\n\n/** The walk's gaps, in t: from the point before each break to the point at it, where they're apart. */\nfunction gapsAt(breaks: readonly number[], segments: readonly LineSegment[]): Gaps {\n // The distance to each point, summed as createWalk sums it, so the last point is at t = 1 exactly.\n const along = [0];\n for (const segment of segments) along.push(along[along.length - 1]! + segment.length);\n const length = along[along.length - 1]!;\n return breaks.filter((i) => along[i]! > along[i - 1]!).map((i) => [along[i - 1]! / length, along[i]! / length]);\n}\n\n/** `breaks`, checked: whole numbers from 1 to the last index, in order, with no repeats. */\nfunction checkBreaks(breaks: readonly number[] | undefined, count: number): readonly number[] {\n if (breaks === undefined) return [];\n if (!Array.isArray(breaks)) throw new RangeError(`describe.line: breaks must be an array of point indices, got ${show(breaks)}.`);\n let after = 0;\n breaks.forEach((index: unknown, i) => {\n if (!(Number.isInteger(index) && (index as number) > after && (index as number) < count)) {\n throw new RangeError(`describe.line: breaks[${i}] must be a whole number more than ${after} and less than ${count}, the number of points, got ${show(index)}.`);\n }\n after = index as number;\n });\n return breaks;\n}\n\nconst show = (value: unknown): string => (typeof value === \"string\" ? JSON.stringify(value) : String(value));\n","// describe.point: a dot with no direction (a scatter point or a marker).\n\nimport type { MarkGeometry, Rect } from \"../../contracts/geometry\";\nimport { closedOutline } from \"../outline\";\nimport { arc, line } from \"../segment\";\nimport { createWalk } from \"../walk\";\nimport { assemble, finite, labelBoxes, size } from \"./mark\";\n\nexport interface PointSpec {\n readonly key: string;\n readonly series?: string;\n readonly x: number;\n readonly y: number;\n /** Radius in px. */\n readonly r: number;\n /** The boxes of the text drawn for the mark, in the same px: passed through as `labelBounds`. */\n readonly labelBounds?: readonly Rect[];\n}\n\n/**\n * Length 0, with start = end = centre, so travel does nothing while wiggle, pulse and flash still\n * work. Faces +x: the outline's sides are the quarter circles top, right, bottom and left.\n */\nexport function describePoint(spec: PointSpec): MarkGeometry {\n const { key, series } = spec;\n const center = { x: finite(\"point\", \"x\", spec.x), y: finite(\"point\", \"y\", spec.y) };\n const r = size(\"point\", \"r\", spec.r);\n const quarter = Math.PI / 2;\n return assemble({\n key,\n series,\n walk: createWalk([line(center, center)]),\n thickness: 2 * r,\n outline: closedOutline([\n [arc(center, r, (-3 * quarter) / 2, quarter)],\n [arc(center, r, -quarter / 2, quarter)],\n [arc(center, r, quarter / 2, quarter)],\n [arc(center, r, (3 * quarter) / 2, quarter)]\n ]),\n bounds: { x: center.x - r, y: center.y - r, width: 2 * r, height: 2 * r },\n center,\n pivot: center,\n labelBounds: labelBoxes(\"point\", spec.labelBounds)\n });\n}\n","// The public geometry builders. Reference charts and adapters share these, so a bar is described\n// the same way whoever drew it.\n\nimport { describeArc } from \"./arc\";\nimport { describeBar } from \"./bar\";\nimport { describeLine } from \"./line\";\nimport { describePoint } from \"./point\";\n\nexport const describe = {\n bar: describeBar,\n arc: describeArc,\n line: describeLine,\n point: describePoint\n};\n\nexport type { ArcSpec } from \"./arc\";\nexport type { BarSegmentSpec, BarSpec, Baseline } from \"./bar\";\nexport type { LineSpec } from \"./line\";\nexport type { PointSpec } from \"./point\";\n","// Transform helpers for effect authors: matrix and offset are public (docs/effects-guide.md).\n\nimport type { Matrix } from \"../contracts/drawing\";\nimport type { Point } from \"../contracts/geometry\";\n\nfunction translate(x: number, y: number): Matrix {\n return [1, 0, 0, 1, x, y];\n}\n\n/** Positive radians turn clockwise on screen, like SVG's rotate(). */\nfunction rotate(radians: number, about?: Point): Matrix {\n const cos = Math.cos(radians);\n const sin = Math.sin(radians);\n return around([cos, sin, -sin, cos, 0, 0], about);\n}\n\nfunction scale(sx: number, sy: number = sx, about?: Point): Matrix {\n return around([sx, 0, 0, sy, 0, 0], about);\n}\n\n/** Composes like an SVG transform list: multiply(a, b) applies b first, then a. No arguments gives the identity. */\nfunction multiply(...matrices: Matrix[]): Matrix {\n let result: Matrix = [1, 0, 0, 1, 0, 0];\n for (const m of matrices) result = product(result, m);\n return result;\n}\n\n/** Where the transform takes a point. */\nfunction apply(m: Matrix, point: Point): Point {\n const [a, b, c, d, e, f] = m;\n return { x: a * point.x + c * point.y + e, y: b * point.x + d * point.y + f };\n}\n\nfunction product(l: Matrix, r: Matrix): Matrix {\n const [a1, b1, c1, d1, e1, f1] = l;\n const [a2, b2, c2, d2, e2, f2] = r;\n return [\n a1 * a2 + c1 * b2,\n b1 * a2 + d1 * b2,\n a1 * c2 + c1 * d2,\n b1 * c2 + d1 * d2,\n a1 * e2 + c1 * f2 + e1,\n b1 * e2 + d1 * f2 + f1\n ];\n}\n\n/** A linear transform (no translation) moved so it keeps `about` fixed. */\nfunction around(m: Matrix, about: Point | undefined): Matrix {\n if (!about) return m;\n const [a, b, c, d] = m;\n return [a, b, c, d, about.x - a * about.x - c * about.y, about.y - b * about.x - d * about.y];\n}\n\n/** Builds and applies 2D transforms in SVG order, for `mark.set({ transform })` and `IconHandle.place()`. */\nexport const matrix = { translate, rotate, scale, multiply, apply };\n\n// Internal: iconFromSvg and the adapter read SVG transforms with these.\n\n/** The inverse transform. A singular matrix (it squashes everything onto a line) throws a RangeError. */\nexport function invert(m: Matrix): Matrix {\n const [a, b, c, d, e, f] = m;\n const det = a * d - b * c;\n if (!Number.isFinite(det) || Math.abs(det) < 1e-12) throw new RangeError(\"This transform can't be inverted: it has no area.\");\n return [d / det, -b / det, -c / det, a / det, (c * f - d * e) / det, (b * e - a * f) / det];\n}\n\n/** An SVG transform list, as in the transform attribute. An unknown or malformed function is skipped. */\nexport function parseTransform(source: string): Matrix {\n const parts: Matrix[] = [];\n for (const [, name, rawArgs = \"\"] of source.matchAll(/(matrix|translate|scale|rotate|skewX|skewY)\\s*\\(([^)]*)\\)/g)) {\n const args = rawArgs.trim().split(/[\\s,]+/).filter(Boolean).map(Number);\n if (!args.every(Number.isFinite)) continue;\n const [a = 0, b, c, d = 0, e = 0, f = 0] = args;\n const radians = (degrees: number): number => (degrees * Math.PI) / 180;\n switch (name) {\n case \"matrix\":\n if (args.length === 6) parts.push([a, b!, c!, d, e, f]);\n break;\n case \"translate\":\n parts.push(translate(a, b ?? 0));\n break;\n case \"scale\":\n parts.push(scale(a, b ?? a));\n break;\n case \"rotate\":\n parts.push(rotate(radians(a), b !== undefined && c !== undefined ? { x: b, y: c } : undefined));\n break;\n case \"skewX\":\n parts.push([1, 0, Math.tan(radians(a)), 1, 0, 0]);\n break;\n case \"skewY\":\n parts.push([1, Math.tan(radians(a)), 0, 1, 0, 0]);\n break;\n }\n }\n return multiply(...parts);\n}\n\n/** A point `distance` px from `point` in direction `angle` (screen radians). */\nexport function offset(point: Point, angle: number, distance: number): Point {\n return { x: point.x + distance * Math.cos(angle), y: point.y + distance * Math.sin(angle) };\n}\n","// samplesAlong: data points placed on a mark's walk, as data effects' samples. A page gives a host's\n// line its values this way: the points that drew it, projected onto the walk that describes it.\n// It reads only the MarkGeometry contract (path and length), so it works on any mark.\n\nimport type { Sample } from \"../contracts/data\";\nimport type { MarkGeometry, Point } from \"../contracts/geometry\";\n\n/** A data point in the mark's coordinates, with its value and, optionally, the x value behind it. */\nexport interface SamplePoint {\n readonly x: number;\n readonly y: number;\n readonly value: number;\n readonly at?: string | number | Date;\n}\n\n/** The grid that finds each point's nearest stretch of the walk: a point every px, up to this many. */\nconst MAX_GRID = 4096;\n/**\n * Golden-section steps that narrow a stretch of 2 grid steps down: to about 1e-12 px for a point on\n * the walk, and to well under 1e-6 px for one off it, where the nearest point is a flat minimum.\n */\nconst REFINE = 48;\nconst GOLDEN = (Math.sqrt(5) - 1) / 2;\n\n/**\n * Projects each point onto the nearest point of the mark's walk and returns the samples in `t` order\n * (points at the same `t` keep their order). A point on the walk, such as a vertex of the polyline it\n * drew, lands exactly where it is. Where the mark has gaps, the first sample past each gap's middle\n * has `gapBefore`, so a data effect doesn't join it to the one before. Throws a RangeError on a point\n * whose x, y or value isn't finite.\n */\nexport function samplesAlong(mark: MarkGeometry, points: readonly SamplePoint[]): Sample[] {\n if (typeof mark !== \"object\" || mark === null || typeof mark.path !== \"function\" || !Number.isFinite(mark.length)) {\n throw new TypeError(\"samplesAlong needs a MarkGeometry, as describe builds it.\");\n }\n if (!Array.isArray(points)) throw new TypeError(\"samplesAlong needs an array of points { x, y, value, at? }.\");\n points.forEach((p, i) => {\n for (const field of [\"x\", \"y\", \"value\"] as const) {\n const value: unknown = (p as Partial<SamplePoint> | null)?.[field];\n if (typeof value !== \"number\" || !Number.isFinite(value)) throw new RangeError(`samplesAlong: points[${i}].${field} must be a finite number, got ${String(value)}.`);\n }\n });\n\n const n = mark.length > 0 ? Math.min(MAX_GRID, Math.ceil(mark.length) + 1) : 1;\n const grid = Array.from({ length: n }, (_, i): Point => mark.path(n === 1 ? 0 : i / (n - 1)));\n const samples = points\n .map((p, index) => ({ index, sample: { t: nearest(mark, grid, p), value: p.value, ...(p.at === undefined ? {} : { at: p.at }) } }))\n .sort((a, b) => a.sample.t - b.sample.t || a.index - b.index)\n .map(({ sample }): Sample => sample);\n return mark.gaps && mark.gaps.length > 0 ? gapped(samples, mark.gaps) : samples;\n}\n\n/**\n * The samples with `gapBefore` on each that a gap's middle lies before, past the sample before it. A\n * gap's ends are values, so samples there project to within float noise of them, either side: its\n * middle is far from both.\n */\nfunction gapped(samples: readonly Sample[], gaps: NonNullable<MarkGeometry[\"gaps\"]>): Sample[] {\n const middles = gaps.map(([from, to]) => (from + to) / 2).sort((a, b) => a - b);\n let next = 0;\n return samples.map((sample, k) => {\n if (k === 0) return sample;\n const before = samples[k - 1]!.t;\n while (next < middles.length && middles[next]! <= before) next++;\n return next < middles.length && middles[next]! <= sample.t ? { ...sample, gapBefore: true } : sample;\n });\n}\n\n/** The t of the walk's nearest point to `p`: the nearest grid point, then a golden-section search on the stretch either side of it. */\nfunction nearest(mark: MarkGeometry, grid: readonly Point[], p: Point): number {\n const n = grid.length;\n if (n === 1) return 0;\n let best = 0;\n let bestDistance = Infinity;\n grid.forEach((q, i) => {\n const d = squared(q, p);\n if (d < bestDistance) {\n best = i;\n bestDistance = d;\n }\n });\n const f = (t: number): number => squared(mark.path(t), p);\n let lo = Math.max(0, best - 1) / (n - 1);\n let hi = Math.min(n - 1, best + 1) / (n - 1);\n let a = hi - GOLDEN * (hi - lo);\n let b = lo + GOLDEN * (hi - lo);\n let fa = f(a);\n let fb = f(b);\n for (let step = 0; step < REFINE; step++) {\n if (fa <= fb) {\n hi = b;\n b = a;\n fb = fa;\n a = hi - GOLDEN * (hi - lo);\n fa = f(a);\n } else {\n lo = a;\n a = b;\n fa = fb;\n b = lo + GOLDEN * (hi - lo);\n fb = f(b);\n }\n }\n const t = (lo + hi) / 2;\n // The grid point itself unless the search found somewhere nearer, so a point at either end lands\n // on exactly 0 or 1, and a stretch that isn't one dip can't make it worse.\n const found = f(t) < bestDistance ? t : best / (n - 1);\n return found > 0 ? (found < 1 ? found : 1) : 0;\n}\n\nfunction squared(a: Point, b: Point): number {\n return (a.x - b.x) ** 2 + (a.y - b.y) ** 2;\n}\n"],"mappings":";AAOO,IAAM,MAAM,IAAI,KAAK;AA0BrB,SAAS,KAAK,MAAa,IAAW,gBAAgB,GAAgB;AAC3E,QAAM,KAAK,GAAG,IAAI,KAAK;AACvB,QAAM,KAAK,GAAG,IAAI,KAAK;AACvB,QAAM,SAAS,KAAK,MAAM,IAAI,EAAE;AAChC,SAAO,EAAE,MAAM,QAAQ,MAAM,IAAI,QAAQ,OAAO,SAAS,IAAI,KAAK,MAAM,IAAI,EAAE,IAAI,eAAe,aAAa,EAAE;AAClH;AAGO,SAAS,IAAI,QAAe,QAAgB,OAAe,OAA2B;AAC3F,SAAO,EAAE,MAAM,OAAO,QAAQ,QAAQ,OAAO,OAAO,QAAQ,SAAS,KAAK,IAAI,KAAK,EAAE;AACvF;AAGO,SAAS,QAAQ,SAAsB,GAAkB;AAC9D,MAAI,QAAQ,SAAS,QAAQ;AAC3B,UAAM,EAAE,MAAM,GAAG,IAAI;AACrB,WAAO,EAAE,GAAG,KAAK,KAAK,IAAI,KAAK,GAAG,IAAI,GAAG,GAAG,KAAK,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE;AAAA,EAC1E;AACA,SAAO,MAAM,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,CAAC;AAChF;AAGO,SAAS,QAAQ,SAAsB,GAAmB;AAC/D,MAAI,QAAQ,SAAS,OAAQ,QAAO,QAAQ;AAC5C,QAAM,UAAU,QAAQ,QAAQ,IAAI,CAAC,KAAK,KAAK,IAAI,KAAK,KAAK;AAC7D,SAAO,eAAe,QAAQ,QAAQ,QAAQ,QAAQ,IAAI,OAAO;AACnE;AAEO,SAAS,MAAM,QAAe,QAAgB,OAAsB;AACzE,SAAO,EAAE,GAAG,OAAO,IAAI,SAAS,KAAK,IAAI,KAAK,GAAG,GAAG,OAAO,IAAI,SAAS,KAAK,IAAI,KAAK,EAAE;AAC1F;AAGO,SAAS,eAAe,OAAuB;AACpD,SAAO,QAAQ,MAAM,KAAK,MAAM,QAAQ,KAAK,MAAM,GAAG;AACxD;AAGO,SAAS,SAAS,SAA+B;AACtD,MAAI,QAAQ,SAAS,OAAQ,QAAO,CAAC,QAAQ,MAAM,QAAQ,EAAE;AAC7D,QAAM,SAAS,CAAC,QAAQ,SAAS,CAAC,GAAG,QAAQ,SAAS,CAAC,CAAC;AACxD,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,QAAS,IAAI,KAAK,KAAM;AAC9B,QAAI,OAAO,SAAS,KAAK,EAAG,QAAO,KAAK,MAAM,QAAQ,QAAQ,QAAQ,QAAQ,KAAK,CAAC;AAAA,EACtF;AACA,SAAO;AACT;AAEO,SAAS,SAAS,QAAgC;AACvD,MAAI,OAAO;AACX,MAAI,OAAO;AACX,MAAI,OAAO;AACX,MAAI,OAAO;AACX,aAAW,EAAE,GAAG,EAAE,KAAK,QAAQ;AAC7B,QAAI,IAAI,KAAM,QAAO;AACrB,QAAI,IAAI,KAAM,QAAO;AACrB,QAAI,IAAI,KAAM,QAAO;AACrB,QAAI,IAAI,KAAM,QAAO;AAAA,EACvB;AACA,SAAO,EAAE,GAAG,MAAM,GAAG,MAAM,OAAO,OAAO,MAAM,QAAQ,OAAO,KAAK;AACrE;AAGA,SAAS,OAAO,SAAqB,OAAwB;AAC3D,QAAM,SAAS,KAAK,IAAI,QAAQ,KAAK;AACrC,MAAI,UAAU,IAAK,QAAO;AAC1B,QAAM,SAAS,QAAQ,SAAS,IAAI,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ;AAC5E,UAAS,SAAS,MAAO,OAAO,OAAO;AACzC;;;AC/FO,SAAS,aAAa,OAAuB;AAClD,QAAM,UAAU,KAAK,MAAM,QAAQ,GAAI,IAAI;AAC3C,SAAO,YAAY,IAAI,MAAM,OAAO,OAAO;AAC7C;AAEO,SAAS,OAAO,OAAsB;AAC3C,SAAO,IAAI,aAAa,MAAM,CAAC,CAAC,IAAI,aAAa,MAAM,CAAC,CAAC;AAC3D;AAOO,SAAS,OAAO,SAAsB,KAAK,GAAG,KAAK,GAAW;AACnE,MAAI,QAAQ,SAAS,QAAQ;AAC3B,UAAM,IAAI,OAAO,IAAI,QAAQ,KAAK,QAAQ,SAAS,EAAE;AACrD,WAAO,IAAI,aAAa,EAAE,CAAC,CAAC,IAAI,aAAa,EAAE,CAAC,CAAC;AAAA,EACnD;AACA,QAAM,OAAO,QAAQ,QAAQ,QAAQ,QAAQ;AAC7C,QAAM,OAAO,QAAQ,SAAS,KAAK;AACnC,QAAM,SAAS,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,IAAI,IAAI,IAAI,KAAK,KAAK,IAAI,CAAC;AACrE,QAAM,IAAI,aAAa,QAAQ,MAAM;AACrC,QAAM,YAAY,QAAQ,IAAI,IAAI;AAClC,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,KAAK,QAAQ,KAAK;AAChC,UAAM,IAAI,MAAM,QAAQ,QAAQ,QAAQ,QAAQ,OAAQ,OAAO,IAAK,MAAM;AAC1E,SAAK,IAAI,CAAC,IAAI,CAAC,QAAQ,SAAS,IAAI,aAAa,EAAE,CAAC,CAAC,IAAI,aAAa,EAAE,CAAC,CAAC;AAAA,EAC5E;AACA,SAAO;AACT;AAMO,SAAS,SAAS,UAAkC,SAAS,OAAe;AACjF,QAAM,QAAQ,SAAS,CAAC;AACxB,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,QAAQ,SAAS;AACrB,MAAI,QAAQ;AACV,WAAO,QAAQ,KAAK,SAAS,QAAQ,CAAC,EAAG,UAAU,EAAG;AACtD,QAAI,QAAQ,KAAK,SAAS,QAAQ,CAAC,EAAG,SAAS,OAAQ;AAAA,EACzD;AACA,MAAI,IAAI,OAAO,QAAQ,OAAO,CAAC,CAAC;AAChC,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAM,UAAU,SAAS,CAAC;AAC1B,QAAI,QAAQ,SAAS,EAAG,MAAK,OAAO,OAAO;AAAA,EAC7C;AACA,SAAO,SAAS,GAAG,CAAC,MAAM;AAC5B;;;AC1BA,IAAM,UAAU,CAAC,MAAuB,IAAI,IAAK,IAAI,IAAI,IAAI,IAAK;AAClE,IAAM,OAAa,OAAO,OAAO,CAAC,CAAC;AAG5B,SAAS,WAAW,UAAkC,OAAa,MAAY;AACpF,QAAM,QAAQ,SAAS,CAAC;AACxB,QAAM,OAAO,SAAS,SAAS,SAAS,CAAC;AACzC,MAAI,CAAC,SAAS,CAAC,KAAM,OAAM,IAAI,WAAW,oCAAoC;AAG9E,QAAM,aAAa,CAAC,CAAC;AACrB,aAAW,WAAW,SAAU,YAAW,KAAK,WAAW,WAAW,SAAS,CAAC,IAAK,QAAQ,MAAM;AACnG,QAAM,SAAS,WAAW,SAAS,MAAM;AACzC,QAAM,QAAQ,QAAQ,OAAO,CAAC;AAC9B,QAAM,MAAM,QAAQ,MAAM,CAAC;AAI3B,QAAM,SAAS,CAAC,MAA8D;AAC5E,QAAI,EAAE,SAAS,GAAI,QAAO,EAAE,OAAO,GAAG,GAAG,EAAE;AAC3C,QAAI,KAAK,QAAQ;AACf,UAAI,QAAQ,SAAS,SAAS;AAC9B,aAAO,QAAQ,KAAK,EAAE,SAAS,KAAK,EAAG,SAAS,GAAI;AACpD,aAAO,EAAE,OAAO,GAAG,EAAE;AAAA,IACvB;AAEA,QAAI,KAAK;AACT,QAAI,KAAK,SAAS,SAAS;AAC3B,WAAO,KAAK,IAAI;AACd,YAAM,MAAO,KAAK,MAAO;AACzB,UAAI,WAAW,MAAM,CAAC,IAAK,EAAG,MAAK;AAAA,UAC9B,MAAK,MAAM;AAAA,IAClB;AACA,WAAO,EAAE,OAAO,IAAI,GAAG,KAAK,IAAI,IAAI,IAAI,WAAW,EAAE,KAAM,SAAS,EAAE,EAAG,MAAM,EAAE;AAAA,EACnF;AAEA,QAAM,QAAQ,CAAC,MAAqB;AAClC,UAAM,KAAK,QAAQ,CAAC;AACpB,QAAI,OAAO,EAAG,QAAO;AACrB,QAAI,OAAO,EAAG,QAAO;AACrB,UAAM,EAAE,OAAO,EAAE,IAAI,OAAO,KAAK,MAAM;AACvC,WAAO,QAAQ,SAAS,KAAK,GAAI,CAAC;AAAA,EACpC;AAGA,QAAM,OAAO,CAAC,MAAc,OAAuB;AACjD,QAAI,IAAI,OAAO,MAAM,IAAI,CAAC;AAC1B,UAAM,IAAI,OAAO;AACjB,UAAM,IAAI,KAAK;AACf,QAAI,EAAE,IAAI,GAAI,QAAO;AACrB,UAAMA,SAAQ,OAAO,CAAC;AACtB,aAAS,IAAIA,OAAM,OAAO,IAAI,SAAS,UAAU,WAAW,CAAC,IAAK,GAAG,KAAK;AACxE,YAAM,UAAU,SAAS,CAAC;AAC1B,UAAI,EAAE,QAAQ,SAAS,GAAI;AAC3B,YAAM,KAAK,MAAMA,OAAM,QAAQA,OAAM,IAAI;AACzC,YAAM,KAAK,WAAW,IAAI,CAAC,IAAK,IAAI,KAAK,IAAI,IAAI,IAAI,WAAW,CAAC,KAAM,QAAQ,MAAM,IAAI;AACzF,UAAI,KAAK,GAAI,MAAK,OAAO,SAAS,IAAI,EAAE;AAAA,IAC1C;AACA,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,CAAC,IAAY,OAAuB;AAChD,UAAM,OAAO,QAAQ,KAAK,IAAI,IAAI,EAAE,CAAC;AACrC,UAAM,KAAK,QAAQ,KAAK,IAAI,IAAI,EAAE,CAAC;AACnC,QAAI,KAAK,WAAW,EAAG,QAAO,KAAK,MAAM,EAAE;AAE3C,QAAI,IAAI;AACR,QAAI,KAAK;AACT,eAAW,CAAC,GAAG,CAAC,KAAK,MAAM;AACzB,UAAI,KAAK,GAAI;AACb,UAAI,IAAI,GAAI,MAAK,KAAK,IAAI,CAAC;AAC3B,UAAI,IAAI,GAAI,MAAK;AAAA,IACnB;AACA,QAAI,KAAK,GAAI,MAAK,KAAK,IAAI,EAAE;AAC7B,WAAO,MAAM,KAAK,OAAO,MAAM,IAAI,CAAC,IAAI;AAAA,EAC1C;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAM,GAAG;AACP,YAAM,EAAE,OAAO,EAAE,IAAI,OAAO,QAAQ,CAAC,IAAI,MAAM;AAC/C,aAAO,QAAQ,SAAS,KAAK,GAAI,CAAC;AAAA,IACpC;AAAA,IACA;AAAA,IACA,GAAG,KAAK,WAAW,IAAI,SAAS,QAAQ,IAAI,MAAM,GAAG,CAAC;AAAA,EACxD;AACF;;;ACtGO,SAAS,cAAc,OAAuB;AACnD,QAAM,QAAQ,MAAM,IAAI,CAAC,SAAS,WAAW,IAAI,CAAC;AAClD,SAAO;AAAA,IACL,GAAG,SAAS,MAAM,KAAK,GAAG,IAAI;AAAA,IAC9B,QAAQ;AAAA,IACR,OAAO,GAAG;AACR,iBAAW,GAAG,CAAC;AACf,YAAM,UAAU,IAAI;AACpB,YAAM,SAAkB,CAAC;AACzB,iBAAW,QAAQ,OAAO;AACxB,iBAAS,IAAI,GAAG,IAAI,SAAS,IAAK,QAAO,KAAK,KAAK,MAAM,IAAI,OAAO,CAAC;AAAA,MACvE;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAGO,SAAS,YAAY,MAAqB;AAC/C,SAAO;AAAA,IACL,GAAG,KAAK;AAAA,IACR,QAAQ;AAAA,IACR,OAAO,GAAG;AACR,iBAAW,GAAG,CAAC;AACf,UAAI,MAAM,EAAG,QAAO,CAAC,KAAK,KAAK;AAC/B,YAAM,SAAkB,CAAC;AACzB,eAAS,IAAI,GAAG,IAAI,GAAG,IAAK,QAAO,KAAK,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC;AAC/D,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,WAAW,GAAW,UAAwB;AACrD,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI,KAAK,IAAI,aAAa,GAAG;AACvD,UAAM,OAAO,aAAa,IAAI,4BAAuB,uBAAuB,QAAQ;AACpF,UAAM,IAAI,WAAW,gCAAgC,IAAI,SAAS,CAAC,GAAG;AAAA,EACxE;AACF;;;ACtCO,SAAS,SAAS,EAAE,KAAK,QAAQ,MAAM,WAAW,SAAS,QAAQ,QAAQ,OAAO,aAAa,SAAS,GAA4B;AACzI,SAAO;AAAA,IACL;AAAA,IACA,GAAI,WAAW,SAAY,CAAC,IAAI,EAAE,OAAO;AAAA,IACzC,OAAO,KAAK;AAAA,IACZ,KAAK,KAAK;AAAA,IACV,QAAQ,KAAK;AAAA,IACb,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC;AAAA,IACzB,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC;AAAA,IAC1B,OAAO,CAAC,IAAI,OAAO,KAAK,MAAM,IAAI,EAAE;AAAA,IACpC,GAAI,KAAK,KAAK,WAAW,IAAI,CAAC,IAAI,EAAE,MAAM,KAAK,KAAK;AAAA,IACpD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAI,gBAAgB,SAAY,CAAC,IAAI,EAAE,YAAY;AAAA,IACnD,GAAI,aAAa,SAAY,CAAC,IAAI,EAAE,SAAS;AAAA,EAC/C;AACF;AAGO,SAAS,OAAO,SAAiB,OAAe,OAAuB;AAC5E,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,OAAM,IAAI,WAAW,YAAY,OAAO,KAAK,KAAK,iCAAiC,KAAK,GAAG;AACxH,SAAO;AACT;AAGO,SAAS,WAAW,SAAiB,OAAiE;AAC3G,MAAI,CAAC,MAAO,QAAO;AACnB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,EAAE,GAAG,GAAG,OAAO,OAAO,IAAI,MAAM,CAAC;AACvC,QAAI,OAAO,SAAS,CAAC,KAAK,OAAO,SAAS,CAAC,KAAK,OAAO,SAAS,KAAK,KAAK,SAAS,KAAK,OAAO,SAAS,MAAM,KAAK,UAAU,EAAG;AAChI,WAAO,SAAS,eAAe,CAAC,OAAO,CAAC;AACxC,WAAO,SAAS,eAAe,CAAC,OAAO,CAAC;AACxC,SAAK,SAAS,eAAe,CAAC,WAAW,KAAK;AAC9C,SAAK,SAAS,eAAe,CAAC,YAAY,MAAM;AAAA,EAClD;AACA,SAAO;AACT;AAGO,SAAS,KAAK,SAAiB,OAAe,OAAuB;AAC1E,MAAI,EAAE,OAAO,SAAS,KAAK,KAAK,SAAS,IAAI;AAC3C,UAAM,IAAI,WAAW,YAAY,OAAO,KAAK,KAAK,0CAAqC,KAAK,GAAG;AAAA,EACjG;AACA,SAAO;AACT;;;ACrCO,SAAS,YAAY,MAA6B;AACvD,QAAM,EAAE,KAAK,OAAO,IAAI;AACxB,QAAM,SAAS,EAAE,GAAG,OAAO,OAAO,MAAM,KAAK,EAAE,GAAG,GAAG,OAAO,OAAO,MAAM,KAAK,EAAE,EAAE;AAClF,QAAM,KAAK,KAAK,IAAI,KAAK,OAAO,SAAS,KAAK,KAAK,GAAG,KAAK,OAAO,SAAS,KAAK,KAAK,CAAC;AACtF,QAAM,KAAK,KAAK,IAAI,KAAK,OAAO,KAAK,KAAK;AAC1C,SAAO,OAAO,SAAS,KAAK,KAAK;AACjC,SAAO,OAAO,OAAO,KAAK,GAAG;AAE7B,QAAM,QAAQ,KAAK,IAAI,CAAC,KAAK,KAAK,IAAI,KAAK,KAAK,MAAM,KAAK,KAAK,CAAC;AAEjE,QAAM,OAAO,KAAK,QAAQ,KAAK,KAAK;AACpC,QAAM,KAAK,OAAO;AAGlB,QAAM,CAAC,MAAM,KAAK,IAAI,SAAS,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE;AACrD,QAAM,QAAQ;AAAA,IACZ,CAAC,IAAI,QAAQ,MAAM,MAAM,KAAK,CAAC;AAAA,IAC/B,CAAC,KAAK,MAAM,QAAQ,MAAM,EAAE,GAAG,MAAM,QAAQ,OAAO,EAAE,GAAG,MAAM,OAAO,QAAQ,KAAK,KAAK,EAAE,CAAC;AAAA,IAC3F,CAAC,IAAI,QAAQ,OAAO,IAAI,CAAC,KAAK,CAAC;AAAA,IAC/B,CAAC,KAAK,MAAM,QAAQ,OAAO,IAAI,GAAG,MAAM,QAAQ,MAAM,IAAI,GAAG,QAAQ,OAAO,QAAQ,IAAI,KAAK,GAAG,CAAC;AAAA,EACnG;AAEA,QAAM,OAAO,WAAW,CAAC,IAAI,SAAS,KAAK,MAAM,GAAG,MAAM,KAAK,CAAC,CAAC;AACjE,SAAO,SAAS;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW,KAAK;AAAA,IAChB,SAAS,cAAc,KAAK;AAAA,IAC5B,QAAQ,SAAS,MAAM,KAAK,EAAE,QAAQ,QAAQ,CAAC;AAAA,IAC/C,QAAQ,KAAK,MAAM,GAAG;AAAA,IACtB,OAAO;AAAA,IACP,aAAa,WAAW,OAAO,KAAK,WAAW;AAAA,EACjD,CAAC;AACH;;;ACnBA,IAAM,QAA4C,EAAE,MAAM,GAAG,OAAO,KAAK,IAAI,KAAK,KAAK,KAAK,GAAG,QAAQ,CAAC,KAAK,KAAK,EAAE;AAM7G,SAAS,YAAY,MAA6B;AACvD,QAAM,EAAE,KAAK,QAAQ,UAAU,GAAG,GAAG,OAAO,OAAO,IAAI;AACvD,MAAI,CAAC,OAAO,UAAU,eAAe,KAAK,OAAO,QAAQ,GAAG;AAC1D,UAAM,IAAI,WAAW,kEAAkE,OAAO,QAAQ,CAAC,GAAG;AAAA,EAC5G;AACA,SAAO,OAAO,KAAK,CAAC;AACpB,SAAO,OAAO,KAAK,CAAC;AACpB,OAAK,OAAO,SAAS,KAAK;AAC1B,OAAK,OAAO,UAAU,MAAM;AAC5B,QAAM,SAAS,KAAK,OAAO,UAAU,KAAK,UAAU,CAAC;AACrD,QAAM,MAAM,KAAK,OAAO,OAAO,KAAK,OAAO,CAAC;AAC5C,QAAM,cAAc,WAAW,OAAO,KAAK,WAAW;AAEtD,QAAM,aAAa,aAAa,UAAU,aAAa;AACvD,QAAM,SAAS,aAAa,QAAQ;AACpC,QAAM,YAAY,aAAa,SAAS;AACxC,QAAM,IAAI;AACV,QAAM,QAAQ,MAAM,QAAQ;AAC5B,QAAM,KAAK,MAAM,IAAI;AAGrB,QAAM,OAAO,CACX,IACA,IACA,KACA,SACiB;AACjB,UAAM,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC;AACpD,UAAM,UAAU,cAAc;AAAA,MAC5B,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC;AAAA,MACvC,KAAK,IACD;AAAA,QACE,IAAI,GAAG,KAAK,IAAI,EAAE,GAAG,IAAI,QAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,CAAC;AAAA,QACzD,KAAK,GAAG,IAAI,EAAE,GAAG,GAAG,IAAI,IAAI,EAAE,GAAG,QAAQ,KAAK,KAAK,CAAC;AAAA,QACpD,IAAI,GAAG,KAAK,IAAI,IAAI,EAAE,GAAG,IAAI,OAAO,KAAK,KAAK,CAAC;AAAA,MACjD,IACA,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,QAAQ,KAAK,KAAK,CAAC,CAAC;AAAA,MACpD,CAAC,KAAK,GAAG,KAAK,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,QAAQ,KAAK,EAAE,CAAC;AAAA,MACjD,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,QAAQ,KAAK,KAAK,CAAC,CAAC;AAAA,IAClD,CAAC;AACD,UAAM,OAAO,WAAW,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;AACnE,WAAO,SAAS;AAAA,MACd,GAAG;AAAA,MACH;AAAA,MACA;AAAA,MACA;AAAA,MACA,QAAQ,KAAK,UAAU,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC;AAAA,MACtD,QAAQ,IAAI,KAAK,MAAM,GAAG,IAAI,CAAC;AAAA,MAC/B,OAAO,KAAK;AAAA,IACd,CAAC;AAAA,EACH;AAEA,QAAM,QAAoF,KAAK,YAAY,CAAC,EAAE,QAAQ,MAAM,OAAO,CAAC;AACpI,QAAM,OAAO,oBAAI,IAAY;AAC7B,MAAI,SAAS;AACb,QAAM,QAAQ,MAAM,IAAI,CAAC,SAAS,UAAU;AAC1C,SAAK,OAAO,YAAY,KAAK,UAAU,QAAQ,IAAI;AACnD,QAAI,QAAQ,WAAW,QAAW;AAChC,UAAI,KAAK,IAAI,QAAQ,MAAM,EAAG,OAAM,IAAI,MAAM,yBAAyB,QAAQ,MAAM,uCAAuC,GAAG,IAAI;AACnI,WAAK,IAAI,QAAQ,MAAM;AAAA,IACzB;AACA,UAAM,OAAO,KAAK,IAAI,QAAQ,MAAM;AACpC,cAAU,QAAQ;AAClB,UAAM,KAAK,KAAK,IAAI,QAAQ,MAAM;AAClC,WAAO,EAAE,SAAS,OAAO,IAAI,KAAK,IAAI,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,GAAG,IAAI,GAAG;AAAA,EAChF,CAAC;AAED,QAAM,WAAW,MAAM;AAAA,IAAI,CAAC,EAAE,SAAS,OAAO,IAAI,GAAG;AAAA;AAAA,MAEnD,KAAK,IAAI,IAAI,UAAU,SAAS,KAAK;AAAA,QACnC,KAAK,QAAQ,WAAW,SAAY,GAAG,GAAG,IAAI,KAAK,KAAK,GAAG,GAAG,IAAI,QAAQ,MAAM;AAAA,QAChF,QAAQ,QAAQ;AAAA,MAClB,CAAC;AAAA;AAAA,EACH;AAEA,SAAO,KAAK,GAAG,QAAQ,QAAQ,EAAE,KAAK,QAAQ,QAAQ,EAAE,GAAG,GAAG,OAAO,OAAO,GAAG,aAAa,SAAS,CAAC;AACxG;AAGA,SAAS,MAAM,EAAE,GAAG,GAAG,OAAO,GAAG,QAAQ,GAAG,SAAS,GAA6C;AAChG,UAAQ,UAAU;AAAA,IAChB,KAAK;AACH,aAAO,CAAC,GAAG,OAAO,EAAE,GAAG,IAAI,GAAG,GAAG,IAAI,EAAE;AAAA,IACzC,KAAK;AACH,aAAO,CAAC,GAAG,OAAO,EAAE,GAAG,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,EAAE;AAAA,IACjD,KAAK;AACH,aAAO,CAAC,GAAG,OAAO,EAAE,GAAG,IAAI,IAAI,GAAG,GAAG,IAAI,EAAE;AAAA,IAC7C,KAAK;AACH,aAAO,CAAC,GAAG,OAAO,EAAE,GAAG,IAAI,GAAG,GAAG,IAAI,IAAI,EAAE;AAAA,EAC/C;AACF;;;AC5GO,SAAS,aAAa,MAA8B;AACzD,QAAM,EAAE,KAAK,QAAQ,OAAO,IAAI;AAChC,QAAM,QAAQ,KAAK,QAAQ,SAAS,KAAK,SAAS,CAAC;AACnD,QAAM,QAAQ,OAAO,CAAC;AACtB,MAAI,CAAC,MAAO,OAAM,IAAI,WAAW,mBAAmB,GAAG,6BAA6B;AACpF,SAAO,QAAQ,CAAC,GAAG,MAAM;AACvB,WAAO,QAAQ,UAAU,CAAC,OAAO,EAAE,CAAC;AACpC,WAAO,QAAQ,UAAU,CAAC,OAAO,EAAE,CAAC;AAAA,EACtC,CAAC;AACD,QAAM,SAAS,YAAY,KAAK,QAAQ,OAAO,MAAM;AAErD,QAAM,WAA0B,CAAC;AACjC,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AAEtC,aAAS,KAAK,KAAK,OAAO,IAAI,CAAC,GAAI,OAAO,CAAC,GAAI,SAAS,SAAS,SAAS,CAAC,GAAG,SAAS,CAAC,CAAC;AAAA,EAC3F;AACA,MAAI,SAAS,WAAW,EAAG,UAAS,KAAK,KAAK,OAAO,KAAK,CAAC;AAE3D,QAAM,OAAO,WAAW,UAAU,OAAO,QAAQ,QAAQ,CAAC;AAC1D,QAAM,MAAM,SAAS,MAAM;AAC3B,QAAM,MAAM,QAAQ;AACpB,SAAO,SAAS;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW;AAAA,IACX,SAAS,YAAY,IAAI;AAAA,IACzB,QAAQ,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,OAAO,IAAI,QAAQ,OAAO,QAAQ,IAAI,SAAS,MAAM;AAAA,IAC/F,QAAQ,KAAK,MAAM,GAAG;AAAA,IACtB,OAAO;AAAA,IACP,aAAa,WAAW,QAAQ,KAAK,WAAW;AAAA,EAClD,CAAC;AACH;AAGA,SAAS,OAAO,QAA2B,UAAwC;AAEjF,QAAM,QAAQ,CAAC,CAAC;AAChB,aAAW,WAAW,SAAU,OAAM,KAAK,MAAM,MAAM,SAAS,CAAC,IAAK,QAAQ,MAAM;AACpF,QAAM,SAAS,MAAM,MAAM,SAAS,CAAC;AACrC,SAAO,OAAO,OAAO,CAAC,MAAM,MAAM,CAAC,IAAK,MAAM,IAAI,CAAC,CAAE,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,IAAK,QAAQ,MAAM,CAAC,IAAK,MAAM,CAAC;AAChH;AAGA,SAAS,YAAY,QAAuC,OAAkC;AAC5F,MAAI,WAAW,OAAW,QAAO,CAAC;AAClC,MAAI,CAAC,MAAM,QAAQ,MAAM,EAAG,OAAM,IAAI,WAAW,gEAAgE,KAAK,MAAM,CAAC,GAAG;AAChI,MAAI,QAAQ;AACZ,SAAO,QAAQ,CAAC,OAAgB,MAAM;AACpC,QAAI,EAAE,OAAO,UAAU,KAAK,KAAM,QAAmB,SAAU,QAAmB,QAAQ;AACxF,YAAM,IAAI,WAAW,yBAAyB,CAAC,sCAAsC,KAAK,kBAAkB,KAAK,+BAA+B,KAAK,KAAK,CAAC,GAAG;AAAA,IAChK;AACA,YAAQ;AAAA,EACV,CAAC;AACD,SAAO;AACT;AAEA,IAAM,OAAO,CAAC,UAA4B,OAAO,UAAU,WAAW,KAAK,UAAU,KAAK,IAAI,OAAO,KAAK;;;ACjEnG,SAAS,cAAc,MAA+B;AAC3D,QAAM,EAAE,KAAK,OAAO,IAAI;AACxB,QAAM,SAAS,EAAE,GAAG,OAAO,SAAS,KAAK,KAAK,CAAC,GAAG,GAAG,OAAO,SAAS,KAAK,KAAK,CAAC,EAAE;AAClF,QAAM,IAAI,KAAK,SAAS,KAAK,KAAK,CAAC;AACnC,QAAM,UAAU,KAAK,KAAK;AAC1B,SAAO,SAAS;AAAA,IACd;AAAA,IACA;AAAA,IACA,MAAM,WAAW,CAAC,KAAK,QAAQ,MAAM,CAAC,CAAC;AAAA,IACvC,WAAW,IAAI;AAAA,IACf,SAAS,cAAc;AAAA,MACrB,CAAC,IAAI,QAAQ,GAAI,KAAK,UAAW,GAAG,OAAO,CAAC;AAAA,MAC5C,CAAC,IAAI,QAAQ,GAAG,CAAC,UAAU,GAAG,OAAO,CAAC;AAAA,MACtC,CAAC,IAAI,QAAQ,GAAG,UAAU,GAAG,OAAO,CAAC;AAAA,MACrC,CAAC,IAAI,QAAQ,GAAI,IAAI,UAAW,GAAG,OAAO,CAAC;AAAA,IAC7C,CAAC;AAAA,IACD,QAAQ,EAAE,GAAG,OAAO,IAAI,GAAG,GAAG,OAAO,IAAI,GAAG,OAAO,IAAI,GAAG,QAAQ,IAAI,EAAE;AAAA,IACxE;AAAA,IACA,OAAO;AAAA,IACP,aAAa,WAAW,SAAS,KAAK,WAAW;AAAA,EACnD,CAAC;AACH;;;ACpCO,IAAM,WAAW;AAAA,EACtB,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,OAAO;AACT;;;ACRA,SAAS,UAAU,GAAW,GAAmB;AAC/C,SAAO,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC1B;AAGA,SAAS,OAAO,SAAiB,OAAuB;AACtD,QAAM,MAAM,KAAK,IAAI,OAAO;AAC5B,QAAM,MAAM,KAAK,IAAI,OAAO;AAC5B,SAAO,OAAO,CAAC,KAAK,KAAK,CAAC,KAAK,KAAK,GAAG,CAAC,GAAG,KAAK;AAClD;AAEA,SAAS,MAAM,IAAY,KAAa,IAAI,OAAuB;AACjE,SAAO,OAAO,CAAC,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,KAAK;AAC3C;AAGA,SAAS,YAAY,UAA4B;AAC/C,MAAI,SAAiB,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACtC,aAAW,KAAK,SAAU,UAAS,QAAQ,QAAQ,CAAC;AACpD,SAAO;AACT;AAGA,SAAS,MAAM,GAAW,OAAqB;AAC7C,QAAM,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI;AAC3B,SAAO,EAAE,GAAG,IAAI,MAAM,IAAI,IAAI,MAAM,IAAI,GAAG,GAAG,IAAI,MAAM,IAAI,IAAI,MAAM,IAAI,EAAE;AAC9E;AAEA,SAAS,QAAQ,GAAW,GAAmB;AAC7C,QAAM,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,IAAI;AACjC,QAAM,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,IAAI;AACjC,SAAO;AAAA,IACL,KAAK,KAAK,KAAK;AAAA,IACf,KAAK,KAAK,KAAK;AAAA,IACf,KAAK,KAAK,KAAK;AAAA,IACf,KAAK,KAAK,KAAK;AAAA,IACf,KAAK,KAAK,KAAK,KAAK;AAAA,IACpB,KAAK,KAAK,KAAK,KAAK;AAAA,EACtB;AACF;AAGA,SAAS,OAAO,GAAW,OAAkC;AAC3D,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI;AACrB,SAAO,CAAC,GAAG,GAAG,GAAG,GAAG,MAAM,IAAI,IAAI,MAAM,IAAI,IAAI,MAAM,GAAG,MAAM,IAAI,IAAI,MAAM,IAAI,IAAI,MAAM,CAAC;AAC9F;AAGO,IAAM,SAAS,EAAE,WAAW,QAAQ,OAAO,UAAU,MAAM;AAK3D,SAAS,OAAO,GAAmB;AACxC,QAAM,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI;AAC3B,QAAM,MAAM,IAAI,IAAI,IAAI;AACxB,MAAI,CAAC,OAAO,SAAS,GAAG,KAAK,KAAK,IAAI,GAAG,IAAI,MAAO,OAAM,IAAI,WAAW,mDAAmD;AAC5H,SAAO,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,MAAM,IAAI,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,IAAI,KAAK,GAAG;AAC5F;AAGO,SAAS,eAAe,QAAwB;AACrD,QAAM,QAAkB,CAAC;AACzB,aAAW,CAAC,EAAE,MAAM,UAAU,EAAE,KAAK,OAAO,SAAS,4DAA4D,GAAG;AAClH,UAAM,OAAO,QAAQ,KAAK,EAAE,MAAM,QAAQ,EAAE,OAAO,OAAO,EAAE,IAAI,MAAM;AACtE,QAAI,CAAC,KAAK,MAAM,OAAO,QAAQ,EAAG;AAClC,UAAM,CAAC,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI;AAC3C,UAAM,UAAU,CAAC,YAA6B,UAAU,KAAK,KAAM;AACnE,YAAQ,MAAM;AAAA,MACZ,KAAK;AACH,YAAI,KAAK,WAAW,EAAG,OAAM,KAAK,CAAC,GAAG,GAAI,GAAI,GAAG,GAAG,CAAC,CAAC;AACtD;AAAA,MACF,KAAK;AACH,cAAM,KAAK,UAAU,GAAG,KAAK,CAAC,CAAC;AAC/B;AAAA,MACF,KAAK;AACH,cAAM,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC;AAC3B;AAAA,MACF,KAAK;AACH,cAAM,KAAK,OAAO,QAAQ,CAAC,GAAG,MAAM,UAAa,MAAM,SAAY,EAAE,GAAG,GAAG,GAAG,EAAE,IAAI,MAAS,CAAC;AAC9F;AAAA,MACF,KAAK;AACH,cAAM,KAAK,CAAC,GAAG,GAAG,KAAK,IAAI,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;AAChD;AAAA,MACF,KAAK;AACH,cAAM,KAAK,CAAC,GAAG,KAAK,IAAI,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;AAChD;AAAA,IACJ;AAAA,EACF;AACA,SAAO,SAAS,GAAG,KAAK;AAC1B;AAGO,SAAS,OAAO,OAAc,OAAe,UAAyB;AAC3E,SAAO,EAAE,GAAG,MAAM,IAAI,WAAW,KAAK,IAAI,KAAK,GAAG,GAAG,MAAM,IAAI,WAAW,KAAK,IAAI,KAAK,EAAE;AAC5F;;;ACrFA,IAAM,WAAW;AAKjB,IAAM,SAAS;AACf,IAAM,UAAU,KAAK,KAAK,CAAC,IAAI,KAAK;AAS7B,SAAS,aAAa,MAAoB,QAA0C;AACzF,MAAI,OAAO,SAAS,YAAY,SAAS,QAAQ,OAAO,KAAK,SAAS,cAAc,CAAC,OAAO,SAAS,KAAK,MAAM,GAAG;AACjH,UAAM,IAAI,UAAU,2DAA2D;AAAA,EACjF;AACA,MAAI,CAAC,MAAM,QAAQ,MAAM,EAAG,OAAM,IAAI,UAAU,6DAA6D;AAC7G,SAAO,QAAQ,CAAC,GAAG,MAAM;AACvB,eAAW,SAAS,CAAC,KAAK,KAAK,OAAO,GAAY;AAChD,YAAM,QAAkB,IAAoC,KAAK;AACjE,UAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,EAAG,OAAM,IAAI,WAAW,wBAAwB,CAAC,KAAK,KAAK,iCAAiC,OAAO,KAAK,CAAC,GAAG;AAAA,IACrK;AAAA,EACF,CAAC;AAED,QAAM,IAAI,KAAK,SAAS,IAAI,KAAK,IAAI,UAAU,KAAK,KAAK,KAAK,MAAM,IAAI,CAAC,IAAI;AAC7E,QAAM,OAAO,MAAM,KAAK,EAAE,QAAQ,EAAE,GAAG,CAAC,GAAG,MAAa,KAAK,KAAK,MAAM,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;AAC5F,QAAM,UAAU,OACb,IAAI,CAAC,GAAG,WAAW,EAAE,OAAO,QAAQ,EAAE,GAAG,QAAQ,MAAM,MAAM,CAAC,GAAG,OAAO,EAAE,OAAO,GAAI,EAAE,OAAO,SAAY,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAG,EAAE,EAAE,EACjI,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,IAAI,EAAE,OAAO,KAAK,EAAE,QAAQ,EAAE,KAAK,EAC3D,IAAI,CAAC,EAAE,OAAO,MAAc,MAAM;AACrC,SAAO,KAAK,QAAQ,KAAK,KAAK,SAAS,IAAI,OAAO,SAAS,KAAK,IAAI,IAAI;AAC1E;AAOA,SAAS,OAAO,SAA4B,MAAmD;AAC7F,QAAM,UAAU,KAAK,IAAI,CAAC,CAAC,MAAM,EAAE,OAAO,OAAO,MAAM,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC9E,MAAI,OAAO;AACX,SAAO,QAAQ,IAAI,CAAC,QAAQ,MAAM;AAChC,QAAI,MAAM,EAAG,QAAO;AACpB,UAAM,SAAS,QAAQ,IAAI,CAAC,EAAG;AAC/B,WAAO,OAAO,QAAQ,UAAU,QAAQ,IAAI,KAAM,OAAQ;AAC1D,WAAO,OAAO,QAAQ,UAAU,QAAQ,IAAI,KAAM,OAAO,IAAI,EAAE,GAAG,QAAQ,WAAW,KAAK,IAAI;AAAA,EAChG,CAAC;AACH;AAGA,SAAS,QAAQ,MAAoB,MAAwB,GAAkB;AAC7E,QAAM,IAAI,KAAK;AACf,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,OAAO;AACX,MAAI,eAAe;AACnB,OAAK,QAAQ,CAAC,GAAG,MAAM;AACrB,UAAM,IAAI,QAAQ,GAAG,CAAC;AACtB,QAAI,IAAI,cAAc;AACpB,aAAO;AACP,qBAAe;AAAA,IACjB;AAAA,EACF,CAAC;AACD,QAAM,IAAI,CAACC,OAAsB,QAAQ,KAAK,KAAKA,EAAC,GAAG,CAAC;AACxD,MAAI,KAAK,KAAK,IAAI,GAAG,OAAO,CAAC,KAAK,IAAI;AACtC,MAAI,KAAK,KAAK,IAAI,IAAI,GAAG,OAAO,CAAC,KAAK,IAAI;AAC1C,MAAI,IAAI,KAAK,UAAU,KAAK;AAC5B,MAAI,IAAI,KAAK,UAAU,KAAK;AAC5B,MAAI,KAAK,EAAE,CAAC;AACZ,MAAI,KAAK,EAAE,CAAC;AACZ,WAAS,OAAO,GAAG,OAAO,QAAQ,QAAQ;AACxC,QAAI,MAAM,IAAI;AACZ,WAAK;AACL,UAAI;AACJ,WAAK;AACL,UAAI,KAAK,UAAU,KAAK;AACxB,WAAK,EAAE,CAAC;AAAA,IACV,OAAO;AACL,WAAK;AACL,UAAI;AACJ,WAAK;AACL,UAAI,KAAK,UAAU,KAAK;AACxB,WAAK,EAAE,CAAC;AAAA,IACV;AAAA,EACF;AACA,QAAM,KAAK,KAAK,MAAM;AAGtB,QAAM,QAAQ,EAAE,CAAC,IAAI,eAAe,IAAI,QAAQ,IAAI;AACpD,SAAO,QAAQ,IAAK,QAAQ,IAAI,QAAQ,IAAK;AAC/C;AAEA,SAAS,QAAQ,GAAU,GAAkB;AAC3C,UAAQ,EAAE,IAAI,EAAE,MAAM,KAAK,EAAE,IAAI,EAAE,MAAM;AAC3C;","names":["first","t"]}