@pixerate/editor 0.126.0 → 0.127.0

package/dist/chunk-GLWZXQ4Q.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/canvas/gradient.ts","../src/canvas/curveFit.ts","../src/canvas/shapeGeometry.ts"],"sourcesContent":["/**\n * Canvas gradient models, parsing, presets, and SVG defs generation.\n * Supports linear and radial gradients for shape fills, strokes, and freehand drawing.\n */\n\nexport interface GradientStop {\n\toffset: number; // 0 to 1\n\tcolor: string;\n\topacity?: number;\n}\n\nexport interface CanvasLinearGradient {\n\ttype: 'linear';\n\tangle?: number; // degrees clockwise, default 90 (top-to-bottom) or custom\n\tstops: GradientStop[];\n}\n\nexport interface CanvasRadialGradient {\n\ttype: 'radial';\n\tcx?: number; // 0 to 1 (default 0.5)\n\tcy?: number; // 0 to 1 (default 0.5)\n\tr?: number; // 0 to 1 (default 0.5)\n\tstops: GradientStop[];\n}\n\nexport type CanvasGradientDef = CanvasLinearGradient | CanvasRadialGradient;\n\nexport interface SvgGradientStop {\n\toffset: string;\n\tstopColor: string;\n\tstopOpacity?: number;\n}\n\nexport interface SvgGradientDef {\n\tid: string;\n\ttype: 'linear' | 'radial';\n\tattrs: Record<string, string | number>;\n\tstops: SvgGradientStop[];\n}\n\nexport const PIXERATE_BRAND_GRADIENT: CanvasLinearGradient = {\n\ttype: 'linear',\n\tangle: 135,\n\tstops: [\n\t\t{ offset: 0, color: '#8E51FF' },\n\t\t{ offset: 1, color: '#e12afb' }\n\t]\n};\n\nexport const CANVAS_GRADIENT_PRESETS: Record<string, CanvasLinearGradient> = {\n\tpixerate: PIXERATE_BRAND_GRADIENT,\n\tsunset: {\n\t\ttype: 'linear',\n\t\tangle: 90,\n\t\tstops: [\n\t\t\t{ offset: 0, color: '#f97316' },\n\t\t\t{ offset: 1, color: '#ec4899' }\n\t\t]\n\t},\n\tocean: {\n\t\ttype: 'linear',\n\t\tangle: 90,\n\t\tstops: [\n\t\t\t{ offset: 0, color: '#06b6d4' },\n\t\t\t{ offset: 1, color: '#3b82f6' }\n\t\t]\n\t},\n\taurora: {\n\t\ttype: 'linear',\n\t\tangle: 90,\n\t\tstops: [\n\t\t\t{ offset: 0, color: '#10b981' },\n\t\t\t{ offset: 1, color: '#6366f1' }\n\t\t]\n\t},\n\tneon: {\n\t\ttype: 'linear',\n\t\tangle: 90,\n\t\tstops: [\n\t\t\t{ offset: 0, color: '#a855f7' },\n\t\t\t{ offset: 1, color: '#ec4899' }\n\t\t]\n\t},\n\tamber: {\n\t\ttype: 'linear',\n\t\tangle: 90,\n\t\tstops: [\n\t\t\t{ offset: 0, color: '#f59e0b' },\n\t\t\t{ offset: 1, color: '#ef4444' }\n\t\t]\n\t},\n\tcosmic: {\n\t\ttype: 'linear',\n\t\tangle: 90,\n\t\tstops: [\n\t\t\t{ offset: 0, color: '#3b82f6' },\n\t\t\t{ offset: 0.5, color: '#8b5cf6' },\n\t\t\t{ offset: 1, color: '#ec4899' }\n\t\t]\n\t}\n};\n\n/** Whether an arbitrary value matches a CanvasGradientDef object. */\nexport function isCanvasGradient(value: unknown): value is CanvasGradientDef {\n\tif (!value || typeof value !== 'object') return false;\n\tconst val = value as Partial<CanvasGradientDef>;\n\tif (val.type !== 'linear' && val.type !== 'radial') return false;\n\tif (!Array.isArray(val.stops)) return false;\n\treturn true;\n}\n\n/**\n * Splits CSS function arguments respecting nested parentheses.\n * e.g. \"rgba(255, 0, 0, 0.5) 0%, #00f 100%\" -> [\"rgba(255, 0, 0, 0.5) 0%\", \"#00f 100%\"]\n */\nfunction splitCssArgs(str: string): string[] {\n\tconst parts: string[] = [];\n\tlet depth = 0;\n\tlet current = '';\n\tfor (let i = 0; i < str.length; i++) {\n\t\tconst char = str[i];\n\t\tif (char === '(') depth++;\n\t\telse if (char === ')') depth = Math.max(0, depth - 1);\n\t\tif (char === ',' && depth === 0) {\n\t\t\tif (current.trim()) parts.push(current.trim());\n\t\t\tcurrent = '';\n\t\t} else {\n\t\t\tcurrent += char;\n\t\t}\n\t}\n\tif (current.trim()) parts.push(current.trim());\n\treturn parts;\n}\n\n/** Parses CSS angle strings like \"90deg\", \"0.25turn\", \"1.57rad\" or named directions like \"to bottom\" */\nfunction parseCssAngle(val: string): number {\n\tconst trimmed = val.trim().toLowerCase();\n\tif (trimmed.endsWith('deg')) {\n\t\treturn parseFloat(trimmed);\n\t}\n\tif (trimmed.endsWith('turn')) {\n\t\treturn parseFloat(trimmed) * 360;\n\t}\n\tif (trimmed.endsWith('rad')) {\n\t\treturn (parseFloat(trimmed) * 180) / Math.PI;\n\t}\n\tif (trimmed.startsWith('to ')) {\n\t\tconst dir = trimmed.slice(3).trim();\n\t\tif (dir === 'bottom') return 180;\n\t\tif (dir === 'top') return 0;\n\t\tif (dir === 'right') return 90;\n\t\tif (dir === 'left') return 270;\n\t\tif (dir === 'bottom right' || dir === 'right bottom') return 135;\n\t\tif (dir === 'bottom left' || dir === 'left bottom') return 225;\n\t\tif (dir === 'top right' || dir === 'right top') return 45;\n\t\tif (dir === 'top left' || dir === 'left top') return 315;\n\t}\n\tconst n = parseFloat(trimmed);\n\treturn Number.isFinite(n) ? n : 180;\n}\n\n/**\n * Parses CSS linear-gradient or radial-gradient strings into CanvasGradientDef.\n * Supports forms like:\n * - linear-gradient(90deg, #ff0000 0%, #0000ff 100%)\n * - linear-gradient(to right, red, blue)\n * - radial-gradient(circle, red 0%, blue 100%)\n */\nexport function parseCssGradient(css: string): CanvasGradientDef | null {\n\tconst trimmed = css.trim();\n\tconst linearMatch = trimmed.match(/^linear-gradient\\s*\\((.*)\\)$/is);\n\tif (linearMatch) {\n\t\tconst rawArgs = splitCssArgs(linearMatch[1]);\n\t\tif (rawArgs.length === 0) return null;\n\t\tlet angle = 180; // default in CSS linear-gradient without direction is to bottom (180deg)\n\t\tlet stopStartIndex = 0;\n\n\t\tconst first = rawArgs[0].trim().toLowerCase();\n\t\tif (first.endsWith('deg') || first.endsWith('turn') || first.endsWith('rad') || first.startsWith('to ')) {\n\t\t\tangle = parseCssAngle(first);\n\t\t\tstopStartIndex = 1;\n\t\t}\n\n\t\tconst stopStrings = rawArgs.slice(stopStartIndex);\n\t\tif (stopStrings.length === 0) return null;\n\t\tconst stops = parseStopStrings(stopStrings);\n\t\tif (stops.length === 0) return null;\n\t\treturn {\n\t\t\ttype: 'linear',\n\t\t\tangle,\n\t\t\tstops\n\t\t};\n\t}\n\n\tconst radialMatch = trimmed.match(/^radial-gradient\\s*\\((.*)\\)$/is);\n\tif (radialMatch) {\n\t\tconst rawArgs = splitCssArgs(radialMatch[1]);\n\t\tif (rawArgs.length === 0) return null;\n\t\tlet stopStartIndex = 0;\n\t\tconst first = rawArgs[0].trim().toLowerCase();\n\t\tif (first.startsWith('circle') || first.startsWith('ellipse') || first.includes('at ')) {\n\t\t\tstopStartIndex = 1;\n\t\t}\n\t\tconst stopStrings = rawArgs.slice(stopStartIndex);\n\t\tif (stopStrings.length === 0) return null;\n\t\tconst stops = parseStopStrings(stopStrings);\n\t\tif (stops.length === 0) return null;\n\t\treturn {\n\t\t\ttype: 'radial',\n\t\t\tcx: 0.5,\n\t\t\tcy: 0.5,\n\t\t\tr: 0.5,\n\t\t\tstops\n\t\t};\n\t}\n\n\treturn null;\n}\n\nfunction parseStopStrings(stopStrings: string[]): GradientStop[] {\n\tconst count = stopStrings.length;\n\treturn stopStrings.map((str, idx) => {\n\t\tconst parts = str.trim().split(/\\s+(?=[0-9%])/);\n\t\tconst color = parts[0];\n\t\tlet offset = count === 1 ? 0 : idx / (count - 1);\n\t\tif (parts.length > 1) {\n\t\t\tconst posStr = parts[1].trim();\n\t\t\tif (posStr.endsWith('%')) {\n\t\t\t\toffset = parseFloat(posStr) / 100;\n\t\t\t} else {\n\t\t\t\tconst val = parseFloat(posStr);\n\t\t\t\tif (Number.isFinite(val)) offset = val;\n\t\t\t}\n\t\t}\n\t\treturn {\n\t\t\toffset: Math.min(1, Math.max(0, offset)),\n\t\t\tcolor\n\t\t};\n\t});\n}\n\n/**\n * Resolves a paint value (which could be a CSS color, preset name, CSS gradient string, or CanvasGradientDef)\n * into either a CanvasGradientDef (if gradient) or null (if solid color or invalid).\n */\nexport function resolveCanvasGradient(value: unknown): CanvasGradientDef | null {\n\tif (!value) return null;\n\tif (isCanvasGradient(value)) return value;\n\tif (typeof value === 'string') {\n\t\tconst lower = value.trim().toLowerCase();\n\t\tif (CANVAS_GRADIENT_PRESETS[lower]) {\n\t\t\treturn CANVAS_GRADIENT_PRESETS[lower];\n\t\t}\n\t\tif (lower.startsWith('linear-gradient') || lower.startsWith('radial-gradient')) {\n\t\t\treturn parseCssGradient(value);\n\t\t}\n\t}\n\treturn null;\n}\n\n/**\n * Converts degrees clockwise (CSS angle: 0 = top, 90 = right, 180 = bottom, 270 = left)\n * to SVG linearGradient vector coordinates (x1, y1, x2, y2) normalized [0, 1].\n */\nexport function angleToSvgLinearCoords(angleDeg: number = 180): { x1: number; y1: number; x2: number; y2: number } {\n\t// Standard CSS angle: 0deg points UP (towards -Y in standard canvas coordinates)\n\t// Convert to standard mathematical angle in radians (0 at +X, counterclockwise)\n\t// CSS 0deg = Math 90deg (up)\n\t// CSS angle A -> Math theta = 90 - A\n\tconst rad = ((90 - angleDeg) * Math.PI) / 180;\n\t// Vector direction\n\tconst dx = Math.cos(rad);\n\tconst dy = -Math.sin(rad); // invert for SVG/screen y-down coords\n\n\t// Project from center (0.5, 0.5) to edges\n\tconst half = 0.5;\n\treturn {\n\t\tx1: Math.round((half - dx * half) * 1000) / 1000,\n\t\ty1: Math.round((half - dy * half) * 1000) / 1000,\n\t\tx2: Math.round((half + dx * half) * 1000) / 1000,\n\t\ty2: Math.round((half + dy * half) * 1000) / 1000\n\t};\n}\n\n/**\n * Converts a CanvasGradientDef to an SvgGradientDef descriptor ready for rendering `<linearGradient>` / `<radialGradient>`.\n */\nexport function gradientToSvgDef(gradient: CanvasGradientDef, id: string): SvgGradientDef {\n\tconst stops: SvgGradientStop[] = (gradient.stops ?? []).map((s) => ({\n\t\toffset: `${Math.round(s.offset * 1000) / 10}%`,\n\t\tstopColor: s.color,\n\t\tstopOpacity: s.opacity\n\t}));\n\n\tif (gradient.type === 'radial') {\n\t\treturn {\n\t\t\tid,\n\t\t\ttype: 'radial',\n\t\t\tattrs: {\n\t\t\t\tcx: gradient.cx !== undefined ? `${gradient.cx * 100}%` : '50%',\n\t\t\t\tcy: gradient.cy !== undefined ? `${gradient.cy * 100}%` : '50%',\n\t\t\t\tr: gradient.r !== undefined ? `${gradient.r * 100}%` : '50%'\n\t\t\t},\n\t\t\tstops\n\t\t};\n\t}\n\n\tconst coords = angleToSvgLinearCoords(gradient.angle ?? 180);\n\treturn {\n\t\tid,\n\t\ttype: 'linear',\n\t\tattrs: {\n\t\t\tx1: `${coords.x1 * 100}%`,\n\t\t\ty1: `${coords.y1 * 100}%`,\n\t\t\tx2: `${coords.x2 * 100}%`,\n\t\t\ty2: `${coords.y2 * 100}%`\n\t\t},\n\t\tstops\n\t};\n}\n","/**\n * Least-squares cubic Bézier fitting of point sequences (Schneider-style: fit one cubic with\n * fixed end tangents, reparameterise with Newton steps, split at the worst point), with\n * corner preservation by a turning-angle test.\n *\n * Portions ported from vectorcraft-main/crates/pathops/src/fit.rs and\n * vectorcraft-main/crates/pathops/src/edit.rs (MIT OR Apache-2.0, © ArtCraft Team and\n * contributors). See THIRD_PARTY_NOTICES.md.\n */\nimport type { Point } from './types.js';\n\n/** Same as `formatNumber` in shapeGeometry (kept local to avoid an import cycle). */\nfunction formatNumber(value: number, precision: number): string {\n\tconst factor = 10 ** precision;\n\tconst rounded = Math.round(value * factor) / factor;\n\treturn Object.is(rounded, -0) ? '0' : String(rounded);\n}\n\n/** One cubic Bézier segment. */\nexport interface CubicSegment {\n\tp0: Point;\n\tp1: Point;\n\tp2: Point;\n\tp3: Point;\n}\n\nexport interface FitCubicsOptions {\n\t/**\n\t * Vertices where the polyline turns by more than this many degrees stay sharp corners\n\t * (default 30). Use 180 to smooth through every vertex.\n\t */\n\tcornerAngleDeg?: number;\n\t/** Treat the points as a closed ring (the last point connects back to the first). */\n\tclosed?: boolean;\n}\n\n/** Maximum Newton reparameterisation rounds per fit. */\nconst MAX_REPARAM = 6;\n\ntype Vec = [number, number];\n\nconst sub = (a: Point, b: Point): Vec => [a[0] - b[0], a[1] - b[1]];\nconst add = (a: Point, v: Vec, s = 1): Vec => [a[0] + v[0] * s, a[1] + v[1] * s];\nconst dot = (a: Vec, b: Vec) => a[0] * b[0] + a[1] * b[1];\nconst dist = (a: Point, b: Point) => Math.hypot(a[0] - b[0], a[1] - b[1]);\n\nfunction unit(v: Vec): Vec | null {\n\tconst l = Math.hypot(v[0], v[1]);\n\treturn l > 1e-12 && Number.isFinite(l) ? [v[0] / l, v[1] / l] : null;\n}\n\nfunction evalCubic(c: CubicSegment, t: number): Vec {\n\tconst s = 1 - t;\n\tconst b0 = s * s * s;\n\tconst b1 = 3 * s * s * t;\n\tconst b2 = 3 * s * t * t;\n\tconst b3 = t * t * t;\n\treturn [\n\t\tb0 * c.p0[0] + b1 * c.p1[0] + b2 * c.p2[0] + b3 * c.p3[0],\n\t\tb0 * c.p0[1] + b1 * c.p1[1] + b2 * c.p2[1] + b3 * c.p3[1]\n\t];\n}\n\n/** Evaluates a cubic segment at `t` ∈ [0, 1]. */\nexport function cubicPointAt(c: CubicSegment, t: number): Point {\n\treturn evalCubic(c, t);\n}\n\nfunction dedup(points: readonly Point[]): Point[] {\n\tconst out: Point[] = [];\n\tfor (const p of points) {\n\t\tif (!Number.isFinite(p[0]) || !Number.isFinite(p[1])) continue;\n\t\tif (out.length === 0 || dist(out[out.length - 1], p) > 1e-12) out.push(p);\n\t}\n\treturn out;\n}\n\n/** Chord-length parameters (0 to 1), one per point. */\nfunction chordParams(pts: Point[]): number[] {\n\tconst u = [0];\n\tlet acc = 0;\n\tfor (let i = 1; i < pts.length; i++) {\n\t\tacc += dist(pts[i - 1], pts[i]);\n\t\tu.push(acc);\n\t}\n\treturn acc > 0 ? u.map((x) => x / acc) : u;\n}\n\n/** Solves the 2×2 normal equations for the handle lengths along the fixed tangents. */\nfunction generate(pts: Point[], u: number[], t0: Vec, t1: Vec): CubicSegment {\n\tconst p0 = pts[0];\n\tconst p3 = pts[pts.length - 1];\n\tconst dirIn: Vec = [-t1[0], -t1[1]];\n\tlet c00 = 0;\n\tlet c01 = 0;\n\tlet c11 = 0;\n\tlet x0 = 0;\n\tlet x1 = 0;\n\tfor (let i = 0; i < pts.length; i++) {\n\t\tconst t = u[i];\n\t\tconst s = 1 - t;\n\t\tconst b0 = s * s * s;\n\t\tconst b1 = 3 * s * s * t;\n\t\tconst b2 = 3 * s * t * t;\n\t\tconst b3 = t * t * t;\n\t\tconst a0: Vec = [t0[0] * b1, t0[1] * b1];\n\t\tconst a1: Vec = [dirIn[0] * b2, dirIn[1] * b2];\n\t\tc00 += dot(a0, a0);\n\t\tc01 += dot(a0, a1);\n\t\tc11 += dot(a1, a1);\n\t\tconst tmp: Vec = [\n\t\t\tpts[i][0] - (p0[0] * (b0 + b1) + p3[0] * (b2 + b3)),\n\t\t\tpts[i][1] - (p0[1] * (b0 + b1) + p3[1] * (b2 + b3))\n\t\t];\n\t\tx0 += dot(a0, tmp);\n\t\tx1 += dot(a1, tmp);\n\t}\n\tconst det = c00 * c11 - c01 * c01;\n\tconst seg = dist(p0, p3);\n\tconst eps = 1e-6 * seg;\n\tlet al = seg / 3;\n\tlet ar = seg / 3;\n\tif (Math.abs(det) > 1e-12) {\n\t\tal = (x0 * c11 - x1 * c01) / det;\n\t\tar = (c00 * x1 - c01 * x0) / det;\n\t}\n\tif (!Number.isFinite(al) || !Number.isFinite(ar) || al < eps || ar < eps) {\n\t\tal = seg / 3;\n\t\tar = seg / 3;\n\t}\n\t// Guard against wild handles on nearly degenerate data.\n\tconst cap = seg * 4 + 1e-9;\n\tal = Math.min(al, cap);\n\tar = Math.min(ar, cap);\n\treturn { p0, p1: add(p0, t0, al), p2: add(p3, dirIn, ar), p3 };\n}\n\n/** Largest distance between a point and the curve at its parameter, and that point's index. */\nfunction maxError(pts: Point[], c: CubicSegment, u: number[]): [number, number] {\n\tlet e = 0;\n\tlet idx = pts.length >> 1;\n\tfor (let i = 0; i < pts.length; i++) {\n\t\tconst d = dist(evalCubic(c, u[i]), pts[i]);\n\t\tif (d > e) {\n\t\t\te = d;\n\t\t\tidx = i;\n\t\t}\n\t}\n\treturn [e, idx];\n}\n\n/** One Newton–Raphson step towards the parameter of the point on `c` nearest `p`. */\nfunction newton(c: CubicSegment, p: Point, t: number): number {\n\tconst s = 1 - t;\n\tconst q = evalCubic(c, t);\n\tconst d1: Vec = [\n\t\t3 * (s * s * (c.p1[0] - c.p0[0]) + 2 * s * t * (c.p2[0] - c.p1[0]) + t * t * (c.p3[0] - c.p2[0])),\n\t\t3 * (s * s * (c.p1[1] - c.p0[1]) + 2 * s * t * (c.p2[1] - c.p1[1]) + t * t * (c.p3[1] - c.p2[1]))\n\t];\n\tconst d2: Vec = [\n\t\t6 * (s * (c.p2[0] - 2 * c.p1[0] + c.p0[0]) + t * (c.p3[0] - 2 * c.p2[0] + c.p1[0])),\n\t\t6 * (s * (c.p2[1] - 2 * c.p1[1] + c.p0[1]) + t * (c.p3[1] - 2 * c.p2[1] + c.p1[1]))\n\t];\n\tconst diff: Vec = [q[0] - p[0], q[1] - p[1]];\n\tconst num = dot(diff, d1);\n\tconst den = dot(d1, d1) + dot(diff, d2);\n\tif (Math.abs(den) < 1e-12) return t;\n\tconst nt = t - num / den;\n\treturn Number.isFinite(nt) ? Math.min(1, Math.max(0, nt)) : t;\n}\n\n/**\n * Best single cubic through `pts` with the given unit end tangents (`t1` points forward at\n * the end), starting from parameters `u`. Returns the curve, its max error and the index of\n * the worst point.\n */\nfunction fitSingleFrom(pts: Point[], u: number[], t0: Vec, t1: Vec): [CubicSegment, number, number] {\n\tlet best = generate(pts, u, t0, t1);\n\tlet [bestErr, bestSplit] = maxError(pts, best, u);\n\tconst params = u.slice();\n\tfor (let round = 0; round < MAX_REPARAM; round++) {\n\t\tfor (let i = 0; i < params.length; i++) params[i] = newton(best, pts[i], params[i]);\n\t\tconst c = generate(pts, params, t0, t1);\n\t\tconst [e, s] = maxError(pts, c, params);\n\t\tif (e < bestErr) {\n\t\t\tbest = c;\n\t\t\tbestErr = e;\n\t\t\tbestSplit = s;\n\t\t} else break;\n\t}\n\treturn [best, bestErr, bestSplit];\n}\n\n/**\n * The best single cubic from the first to the last of `points`, leaving along the unit tangent\n * `t0` and arriving along `t1` (forward), with the points starting at parameters `params`\n * (refined by Newton steps). Returns the curve and its largest point error.\n */\nexport function fitCubicWithTangents(points: readonly Point[], params: readonly number[], t0: Point, t1: Point): { curve: CubicSegment; error: number } {\n\tconst [curve, error] = fitSingleFrom(points.slice(), params.slice(), [t0[0], t0[1]], [t1[0], t1[1]]);\n\treturn { curve, error };\n}\n\nfunction fitRec(pts: Point[], t0: Vec, t1: Vec, tol: number, out: CubicSegment[], depth: number) {\n\tconst n = pts.length;\n\tif (n === 2) {\n\t\tconst d = dist(pts[0], pts[1]) / 3;\n\t\tout.push({ p0: pts[0], p1: add(pts[0], t0, d), p2: add(pts[1], t1, -d), p3: pts[1] });\n\t\treturn;\n\t}\n\tconst [c, err, splitAt] = fitSingleFrom(pts, chordParams(pts), t0, t1);\n\tif (err <= tol || depth > 40) {\n\t\tout.push(c);\n\t\treturn;\n\t}\n\t// Split at the worst point with a centre tangent estimated from its neighbours.\n\tconst split = Math.min(n - 2, Math.max(1, splitAt));\n\tconst tc = unit(sub(pts[split + 1], pts[split - 1])) ?? t0;\n\tfitRec(pts.slice(0, split + 1), t0, tc, tol, out, depth + 1);\n\tfitRec(pts.slice(split), tc, t1, tol, out, depth + 1);\n}\n\n/**\n * Unit tangent at `a` estimated from the parabola through `a`, `b`, `c` (chord-length\n * parameters): second-order accurate, so polylines sampled from curves get their true end\n * direction rather than the first chord's.\n */\nfunction tangentFrom(a: Point, b: Point, c: Point | undefined): Vec | null {\n\tconst chord = unit(sub(b, a));\n\tif (!c) return chord;\n\tconst d1 = dist(a, b);\n\tconst d2 = dist(b, c);\n\tif (!(d1 > 0) || !(d2 > 0)) return chord;\n\tconst ka = -(2 * d1 + d2) / (d1 * (d1 + d2));\n\tconst kb = (d1 + d2) / (d1 * d2);\n\tconst kc = -d1 / (d2 * (d1 + d2));\n\tconst est = unit([ka * a[0] + kb * b[0] + kc * c[0], ka * a[1] + kb * b[1] + kc * c[1]]);\n\t// Fall back to the chord when the estimate swings too far (noisy or sharp data).\n\treturn est && chord && dot(est, chord) > Math.cos(Math.PI / 4) ? est : chord;\n}\n\n/**\n * Fits a G1-continuous chain of cubics through `points` (an open run) with the unit\n * tangents `t0` (leaving the first point) and `t1` (arriving at the last point, forward);\n * both are estimated from the end points when omitted. Every point lies within `tolerance`\n * of the curve at its fitted parameter.\n */\nexport function fitCubicRun(points: readonly Point[], tolerance: number, t0?: Point, t1?: Point): CubicSegment[] {\n\tconst pts = dedup(points);\n\tconst out: CubicSegment[] = [];\n\tif (pts.length < 2) return out;\n\tconst n = pts.length;\n\tconst start = (t0 && unit([t0[0], t0[1]])) ?? tangentFrom(pts[0], pts[1], pts[2]) ?? [1, 0];\n\tconst back = tangentFrom(pts[n - 1], pts[n - 2], pts[n - 3]);\n\tconst end = (t1 && unit([t1[0], t1[1]])) ?? (back ? ([-back[0], -back[1]] as Vec) : [1, 0]);\n\tfitRec(pts, start, end, Math.max(tolerance, 1e-9), out, 0);\n\treturn out;\n}\n\n/** Turning angle in degrees between the directions `a`→`b` and `b`→`c`. */\nfunction turnDeg(a: Point, b: Point, c: Point): number {\n\tconst u = unit(sub(b, a));\n\tconst v = unit(sub(c, b));\n\tif (!u || !v) return 0;\n\treturn (Math.acos(Math.min(1, Math.max(-1, dot(u, v)))) * 180) / Math.PI;\n}\n\n/**\n * Corner vertices of a polyline. The turn at each vertex is measured to the nearest\n * neighbours at least `span` away on each side (so sample noise smaller than the fitting\n * tolerance does not read as corners), and only the sharpest vertex of a neighbourhood is\n * kept. End points of open polylines are not included.\n */\nfunction findCorners(pts: Point[], closed: boolean, cornerAngle: number, span: number): number[] {\n\tconst n = pts.length;\n\tconst at = (i: number) => pts[closed ? ((i % n) + n) % n : i];\n\tconst reach = (i: number, step: 1 | -1): number | null => {\n\t\tfor (let k = 1; k < (closed ? n : Infinity); k++) {\n\t\t\tconst j = i + step * k;\n\t\t\tif (!closed && (j < 0 || j >= n)) return k > 1 ? j - step : null;\n\t\t\tif (dist(at(j), pts[i]) >= span) return j;\n\t\t}\n\t\treturn null;\n\t};\n\tconst turns = new Float64Array(n);\n\tconst windows: [number, number][] = [];\n\tfor (let i = 0; i < n; i++) {\n\t\twindows.push([i, i]);\n\t\tif (!closed && (i === 0 || i === n - 1)) continue;\n\t\tconst prev = reach(i, -1);\n\t\tconst next = reach(i, 1);\n\t\tif (prev === null || next === null) continue;\n\t\twindows[i] = [prev, next];\n\t\tturns[i] = turnDeg(at(prev), pts[i], at(next));\n\t}\n\tconst corners: number[] = [];\n\tfor (let i = 0; i < n; i++) {\n\t\tif (!(turns[i] > cornerAngle)) continue;\n\t\tconst [lo, hi] = windows[i];\n\t\tlet sharpest = true;\n\t\tfor (let j = lo; j <= hi && sharpest; j++) {\n\t\t\tconst k = closed ? ((j % n) + n) % n : j;\n\t\t\tif (k === i || dist(pts[k], pts[i]) >= span) continue;\n\t\t\tif (turns[k] > turns[i] || (turns[k] === turns[i] && k < i)) sharpest = false;\n\t\t}\n\t\tif (sharpest) corners.push(i);\n\t}\n\treturn corners;\n}\n\n/**\n * Points to fit for a run of polyline vertices: the vertices, plus extra samples along edges\n * much longer than the run's typical edge so straight stretches stay straight.\n */\nfunction densify(run: Point[]): Point[] {\n\tif (run.length < 3) return run;\n\tconst lengths: number[] = [];\n\tfor (let i = 1; i < run.length; i++) lengths.push(dist(run[i - 1], run[i]));\n\tconst sorted = [...lengths].sort((a, b) => a - b);\n\tconst median = sorted[sorted.length >> 1];\n\tif (!(median > 0)) return run;\n\tconst out: Point[] = [run[0]];\n\tfor (let i = 1; i < run.length; i++) {\n\t\tconst len = lengths[i - 1];\n\t\tif (len > 2 * median) {\n\t\t\tconst steps = Math.min(64, Math.ceil(len / median));\n\t\t\tconst a = run[i - 1];\n\t\t\tconst b = run[i];\n\t\t\tfor (let k = 1; k < steps; k++) {\n\t\t\t\tconst t = k / steps;\n\t\t\t\tout.push([a[0] + (b[0] - a[0]) * t, a[1] + (b[1] - a[1]) * t]);\n\t\t\t}\n\t\t}\n\t\tout.push(run[i]);\n\t}\n\treturn out;\n}\n\n/**\n * Fits cubic Bézier segments to a polyline (`closed` for a ring), keeping vertices that turn\n * by more than `cornerAngleDeg` (default 30°) as sharp corners. Each stretch between corners\n * is fitted Schneider-style so that every input point is within `tolerance` of the result.\n *\n * Returns the segments in order (consecutive segments share end points; a closed result ends\n * where it starts). Fewer than two distinct points give an empty array.\n */\nexport function fitCubics(points: readonly Point[], tolerance: number, options: FitCubicsOptions = {}): CubicSegment[] {\n\tlet pts = dedup(points);\n\tconst closed = options.closed === true;\n\tif (closed && pts.length > 1 && dist(pts[0], pts[pts.length - 1]) <= 1e-12) pts = pts.slice(0, -1);\n\tif (pts.length < 2) return [];\n\tconst tol = Math.max(tolerance, 1e-6);\n\tconst cornerAngle = options.cornerAngleDeg ?? 30;\n\tconst n = pts.length;\n\tconst span = 4 * tol;\n\n\tif (!closed || n < 3) {\n\t\tconst corners = [0, ...(n > 2 ? findCorners(pts, false, cornerAngle, span) : []), n - 1];\n\t\tconst out: CubicSegment[] = [];\n\t\tfor (let k = 1; k < corners.length; k++) {\n\t\t\tconst run = pts.slice(corners[k - 1], corners[k] + 1);\n\t\t\tout.push(...fitCubicRun(densify(run), tol));\n\t\t}\n\t\tif (closed && n === 2) out.push(...fitCubicRun([pts[1], pts[0]], tol));\n\t\treturn out;\n\t}\n\n\tconst corners = findCorners(pts, true, cornerAngle, span);\n\tif (corners.length === 0) {\n\t\t// Smooth ring: start anywhere, with the same tangent leaving and arriving.\n\t\tconst ring = [...pts, pts[0]];\n\t\tconst t = unit(sub(pts[1], pts[n - 1])) ?? [1, 0];\n\t\t// (A central difference: already second-order accurate at the seam.)\n\t\treturn fitCubicRun(densify(ring), tol, t, t);\n\t}\n\tconst out: CubicSegment[] = [];\n\tfor (let k = 0; k < corners.length; k++) {\n\t\tconst from = corners[k];\n\t\tconst to = corners[(k + 1) % corners.length];\n\t\tconst run: Point[] = [];\n\t\tfor (let i = from; ; i = (i + 1) % n) {\n\t\t\trun.push(pts[i]);\n\t\t\tif (run.length > 1 && i === to) break;\n\t\t}\n\t\tout.push(...fitCubicRun(densify(run), tol));\n\t}\n\treturn out;\n}\n\n/** Whether a cubic is (within `tol`) the straight line from `p0` to `p3`. */\nexport function isStraightCubic(c: CubicSegment, tol: number): boolean {\n\tconst chord = sub(c.p3, c.p0);\n\tconst len = Math.hypot(chord[0], chord[1]);\n\tif (len < 1e-12) return dist(c.p1, c.p0) <= tol && dist(c.p2, c.p0) <= tol;\n\tconst dir: Vec = [chord[0] / len, chord[1] / len];\n\treturn [c.p1, c.p2].every((h) => {\n\t\tconst v = sub(h, c.p0);\n\t\tconst along = dot(v, dir);\n\t\tconst across = Math.abs(v[0] * dir[1] - v[1] * dir[0]);\n\t\treturn across <= tol && along >= -tol && along <= len + tol;\n\t});\n}\n\nexport interface FitPathDataOptions extends FitCubicsOptions {\n\t/** Fitting tolerance in path units (default 0.5). */\n\ttolerance?: number;\n\t/** Decimal places (default 3). */\n\tprecision?: number;\n\t/** Added to every point before formatting. */\n\toffset?: { x: number; y: number };\n\t/**\n\t * Keep the original polyline when fitting would need more segments than it has edges\n\t * (default `true`), so fitting never makes a path heavier.\n\t */\n\tnoWorse?: boolean;\n}\n\n/** SVG `d` for fitted segments (`L` for straight ones, `C` otherwise). */\nexport function cubicsToPathData(\n\tsegments: readonly CubicSegment[],\n\toptions: { precision?: number; offset?: { x: number; y: number }; closed?: boolean; straightTolerance?: number } = {}\n): string {\n\tif (segments.length === 0) return '';\n\tconst f = (n: number) => formatNumber(n, options.precision ?? 3);\n\tconst dx = options.offset?.x ?? 0;\n\tconst dy = options.offset?.y ?? 0;\n\tconst pt = (p: Point) => `${f(p[0] + dx)} ${f(p[1] + dy)}`;\n\tconst straight = options.straightTolerance ?? 1e-3;\n\tlet d = `M${pt(segments[0].p0)}`;\n\tsegments.forEach((c, i) => {\n\t\tconst last = options.closed && i === segments.length - 1;\n\t\tif (isStraightCubic(c, straight)) {\n\t\t\tif (!last) d += `L${pt(c.p3)}`;\n\t\t} else d += `C${pt(c.p1)} ${pt(c.p2)} ${pt(c.p3)}`;\n\t});\n\treturn options.closed ? `${d}Z` : d;\n}\n\nfunction polylineToPathData(points: readonly Point[], closed: boolean, options: FitPathDataOptions): string {\n\tif (points.length < 2) return '';\n\tconst f = (n: number) => formatNumber(n, options.precision ?? 3);\n\tconst dx = options.offset?.x ?? 0;\n\tconst dy = options.offset?.y ?? 0;\n\tlet d = `M${f(points[0][0] + dx)} ${f(points[0][1] + dy)}`;\n\tfor (let i = 1; i < points.length; i++) d += `L${f(points[i][0] + dx)} ${f(points[i][1] + dy)}`;\n\treturn closed ? `${d}Z` : d;\n}\n\n/**\n * Fits smooth curves to a polygon ring (closed by default) and returns SVG path data with\n * `C` curves for smooth stretches, `L` lines for straight ones and sharp corners kept.\n * Use it for boolean results of curved shapes or to smooth freehand strokes\n * (`{ closed: false }`, see `fitFreehandPath`).\n */\nexport function fitPathData(ring: readonly Point[], options: FitPathDataOptions = {}): string {\n\tconst closed = options.closed ?? true;\n\tconst tolerance = options.tolerance ?? 0.5;\n\tconst pts = dedup(ring);\n\tconst segments = fitCubics(pts, tolerance, { ...options, closed });\n\tif (segments.length === 0) return '';\n\tconst edges = closed ? pts.length : pts.length - 1;\n\tif (options.noWorse !== false) {\n\t\tconst straight = segments.filter((c) => isStraightCubic(c, tolerance * 0.02)).length;\n\t\t// Fitting only pays off when it removes vertices.\n\t\tif (segments.length >= edges && straight === segments.length) return polylineToPathData(pts, closed, options);\n\t\tif (segments.length > edges) return polylineToPathData(pts, closed, options);\n\t}\n\treturn cubicsToPathData(segments, {\n\t\tprecision: options.precision,\n\t\toffset: options.offset,\n\t\tclosed,\n\t\tstraightTolerance: tolerance * 0.02\n\t});\n}\n\n/**\n * Smooths a freehand stroke (pointer samples) into an open SVG path of cubic curves.\n * `tolerance` is the largest distance (in the points' units) a sample may be from the\n * curve (default 1); sharp turns above `cornerAngleDeg` (default 30) stay corners.\n */\nexport function fitFreehandPath(\n\tpoints: readonly Point[],\n\toptions: Omit<FitPathDataOptions, 'closed'> = {}\n): string {\n\treturn fitPathData(points, { tolerance: 1, ...options, closed: false });\n}\n","/**\n * Shape geometry: shape descriptions (rect, rounded rect, ellipse, regular polygon, star and\n * SVG path data) to polygons, SVG path parsing / flattening, and polygons back to path data.\n */\nimport type { Point } from './types.js';\nimport type { MultiPolygon, PolygonFillRule, PolygonRing } from './polygonBoolean.js';\nimport { fitPathData } from './curveFit.js';\n\n// ---------------------------------------------------------------------------\n// Shape descriptions\n// ---------------------------------------------------------------------------\n\nimport type { CanvasGradientDef, SvgGradientDef } from './gradient.js';\nimport type { CanvasBrushstroke } from './brushTypes.js';\nimport { gradientToSvgDef, resolveCanvasGradient } from './gradient.js';\n\n/** Paint shared by every shape kind. Colours are any CSS colour, preset name, or gradient definition. */\nexport interface ShapePaint {\n\tfill?: string | CanvasGradientDef;\n\tstroke?: string | CanvasGradientDef;\n\tstrokeWidth?: number;\n\topacity?: number;\n\tstrokeLinecap?: 'round' | 'butt' | 'square';\n\tstrokeLinejoin?: 'round' | 'bevel' | 'miter';\n\tfillGradient?: CanvasGradientDef;\n\tstrokeGradient?: CanvasGradientDef;\n}\n\ninterface ShapeBase extends ShapePaint {\n\t/** Clockwise rotation in degrees (on a y-down canvas) about the centre of the node box. */\n\trotation?: number;\n}\n\n/** Rectangle filling the node box, optionally with rounded corners. */\nexport interface RectShape extends ShapeBase {\n\tkind: 'rect';\n\t/** One radius, or `[topLeft, topRight, bottomRight, bottomLeft]`. Clamped to fit. */\n\tcornerRadius?: number | readonly [number, number, number, number];\n}\n\n/** Ellipse (circle when the node is square) inscribed in the node box. */\nexport interface EllipseShape extends ShapeBase {\n\tkind: 'ellipse';\n}\n\n/** Regular polygon, stretched so its bounding box fills the node box. */\nexport interface RegularPolygonShape extends ShapeBase {\n\tkind: 'polygon';\n\t/** Number of sides (at least 3, default 6). The first vertex points up. */\n\tsides?: number;\n}\n\n/** Star, stretched so its bounding box fills the node box. */\nexport interface StarShape extends ShapeBase {\n\tkind: 'star';\n\t/** Number of points (at least 3, default 5). The first point points up. */\n\tpoints?: number;\n\t/** Inner radius as a fraction of the outer radius (default 0.5). */\n\tinnerRadius?: number;\n}\n\n/** Arbitrary SVG path data. */\nexport interface PathShape extends ShapeBase {\n\tkind: 'path';\n\td: string;\n\t/**\n\t * `[minX, minY, width, height]` of the path's coordinate space, scaled to the node box.\n\t * Without it the path coordinates are node-local pixels.\n\t */\n\tviewBox?: readonly [number, number, number, number];\n\t/** Fill rule (default `nonzero`, as in SVG). */\n\tfillRule?: PolygonFillRule;\n\t/**\n\t * Draw the path with a dry paint brush instead of an SVG stroke (a brushed freehand stroke):\n\t * the brush and pen profiles along the path. Rendered by `renderShapeBrushstroke`.\n\t */\n\tbrush?: CanvasBrushstroke;\n}\n\n/**\n * Shape description stored on a node as `data.shape`. Geometry is relative to the node\n * box (`0,0` to `width,height`), so resizing the node resizes the shape.\n */\nexport type ShapeDescription = RectShape | EllipseShape | RegularPolygonShape | StarShape | PathShape;\n\nexport type ShapeKind = ShapeDescription['kind'];\n\nexport const SHAPE_KINDS: readonly ShapeKind[] = ['rect', 'ellipse', 'polygon', 'star', 'path'];\n\n/** Whether a value is a supported shape description. */\nexport function isShapeDescription(value: unknown): value is ShapeDescription {\n\tif (!value || typeof value !== 'object') return false;\n\tconst kind = (value as { kind?: unknown }).kind;\n\tif (!SHAPE_KINDS.includes(kind as ShapeKind)) return false;\n\treturn kind !== 'path' || typeof (value as PathShape).d === 'string';\n}\n\nexport interface ShapeSize {\n\twidth: number;\n\theight: number;\n}\n\nexport interface FlattenOptions {\n\t/** Maximum distance between a curve and its polyline, in output units (default 0.25). */\n\ttolerance?: number;\n\t/** Upper bound on the segments one curve is split into (default 512). */\n\tmaxSegments?: number;\n}\n\n// ---------------------------------------------------------------------------\n// SVG path parsing\n// ---------------------------------------------------------------------------\n\n/** Normalised absolute path command produced by `parseSvgPath`. */\nexport type PathCommand =\n\t| { type: 'M'; x: number; y: number }\n\t| { type: 'L'; x: number; y: number }\n\t| { type: 'C'; x1: number; y1: number; x2: number; y2: number; x: number; y: number }\n\t| { type: 'Q'; x1: number; y1: number; x: number; y: number }\n\t| {\n\t\t\ttype: 'A';\n\t\t\trx: number;\n\t\t\try: number;\n\t\t\trotation: number;\n\t\t\tlargeArc: boolean;\n\t\t\tsweep: boolean;\n\t\t\tx: number;\n\t\t\ty: number;\n\t  }\n\t| { type: 'Z' };\n\nconst PARAM_COUNTS: Record<string, number> = { m: 2, l: 2, h: 1, v: 1, c: 6, s: 4, q: 4, t: 2, a: 7, z: 0 };\n\n/** Character scanner for path data (handles `1.5.5`, `1e-3`, `-1-2` and compact arc flags). */\nclass PathScanner {\n\tprivate pos = 0;\n\tconstructor(private readonly text: string) {}\n\n\tprivate skip() {\n\t\twhile (this.pos < this.text.length && /[\\s,]/.test(this.text[this.pos])) this.pos++;\n\t}\n\n\t/** The next command letter, or `null` when a number (or the end) follows. */\n\tcommand(): string | null {\n\t\tthis.skip();\n\t\tconst ch = this.text[this.pos];\n\t\tif (ch && /[MmLlHhVvCcSsQqTtAaZz]/.test(ch)) {\n\t\t\tthis.pos++;\n\t\t\treturn ch;\n\t\t}\n\t\treturn null;\n\t}\n\n\tdone(): boolean {\n\t\tthis.skip();\n\t\treturn this.pos >= this.text.length;\n\t}\n\n\tnumber(): number | null {\n\t\tthis.skip();\n\t\tconst match = /^[+-]?(?:\\d+\\.?\\d*|\\.\\d+)(?:[eE][+-]?\\d+)?/.exec(this.text.slice(this.pos, this.pos + 64));\n\t\tif (!match) return null;\n\t\tthis.pos += match[0].length;\n\t\tconst value = Number(match[0]);\n\t\treturn Number.isFinite(value) ? value : null;\n\t}\n\n\tflag(): number | null {\n\t\tthis.skip();\n\t\tconst ch = this.text[this.pos];\n\t\tif (ch === '0' || ch === '1') {\n\t\t\tthis.pos++;\n\t\t\treturn ch === '1' ? 1 : 0;\n\t\t}\n\t\treturn null;\n\t}\n}\n\n/**\n * Parses SVG path data into absolute `M`, `L`, `C`, `Q`, `A` and `Z` commands. Relative\n * commands, `H` / `V`, smooth curves (`S` / `T`) and implicit repeated commands are\n * normalised. Parsing stops at the first malformed command (as browsers do).\n */\nexport function parseSvgPath(d: string): PathCommand[] {\n\tconst scanner = new PathScanner(d ?? '');\n\tconst commands: PathCommand[] = [];\n\tlet cx = 0;\n\tlet cy = 0;\n\tlet startX = 0;\n\tlet startY = 0;\n\tlet lastControl: { x: number; y: number; type: 'C' | 'Q' } | null = null;\n\tlet command = '';\n\n\twhile (!scanner.done()) {\n\t\tconst letter = scanner.command();\n\t\tif (letter) {\n\t\t\tcommand = letter;\n\t\t\tif (command === 'z' || command === 'Z') {\n\t\t\t\tcommands.push({ type: 'Z' });\n\t\t\t\tcx = startX;\n\t\t\t\tcy = startY;\n\t\t\t\tlastControl = null;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t} else if (!command || command === 'z' || command === 'Z') {\n\t\t\tbreak;\n\t\t}\n\t\tconst lower = command.toLowerCase();\n\t\tconst count = PARAM_COUNTS[lower];\n\t\tconst args: number[] = [];\n\t\tfor (let k = 0; k < count; k++) {\n\t\t\tconst value = lower === 'a' && (k === 3 || k === 4) ? scanner.flag() : scanner.number();\n\t\t\tif (value === null) return commands;\n\t\t\targs.push(value);\n\t\t}\n\t\tconst rel = command !== command.toUpperCase();\n\t\tconst ox = rel ? cx : 0;\n\t\tconst oy = rel ? cy : 0;\n\t\tswitch (lower) {\n\t\t\tcase 'm': {\n\t\t\t\tcx = args[0] + ox;\n\t\t\t\tcy = args[1] + oy;\n\t\t\t\tstartX = cx;\n\t\t\t\tstartY = cy;\n\t\t\t\tcommands.push({ type: 'M', x: cx, y: cy });\n\t\t\t\tlastControl = null;\n\t\t\t\t// Extra coordinate pairs after a moveto are implicit linetos.\n\t\t\t\tcommand = rel ? 'l' : 'L';\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'l':\n\t\t\t\tcx = args[0] + ox;\n\t\t\t\tcy = args[1] + oy;\n\t\t\t\tcommands.push({ type: 'L', x: cx, y: cy });\n\t\t\t\tlastControl = null;\n\t\t\t\tbreak;\n\t\t\tcase 'h':\n\t\t\t\tcx = args[0] + (rel ? cx : 0);\n\t\t\t\tcommands.push({ type: 'L', x: cx, y: cy });\n\t\t\t\tlastControl = null;\n\t\t\t\tbreak;\n\t\t\tcase 'v':\n\t\t\t\tcy = args[0] + (rel ? cy : 0);\n\t\t\t\tcommands.push({ type: 'L', x: cx, y: cy });\n\t\t\t\tlastControl = null;\n\t\t\t\tbreak;\n\t\t\tcase 'c': {\n\t\t\t\tconst c: PathCommand = {\n\t\t\t\t\ttype: 'C',\n\t\t\t\t\tx1: args[0] + ox,\n\t\t\t\t\ty1: args[1] + oy,\n\t\t\t\t\tx2: args[2] + ox,\n\t\t\t\t\ty2: args[3] + oy,\n\t\t\t\t\tx: args[4] + ox,\n\t\t\t\t\ty: args[5] + oy\n\t\t\t\t};\n\t\t\t\tcommands.push(c);\n\t\t\t\tlastControl = { x: c.x2, y: c.y2, type: 'C' };\n\t\t\t\tcx = c.x;\n\t\t\t\tcy = c.y;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 's': {\n\t\t\t\tconst x1: number = lastControl?.type === 'C' ? 2 * cx - lastControl.x : cx;\n\t\t\t\tconst y1: number = lastControl?.type === 'C' ? 2 * cy - lastControl.y : cy;\n\t\t\t\tconst c: PathCommand = {\n\t\t\t\t\ttype: 'C',\n\t\t\t\t\tx1,\n\t\t\t\t\ty1,\n\t\t\t\t\tx2: args[0] + ox,\n\t\t\t\t\ty2: args[1] + oy,\n\t\t\t\t\tx: args[2] + ox,\n\t\t\t\t\ty: args[3] + oy\n\t\t\t\t};\n\t\t\t\tcommands.push(c);\n\t\t\t\tlastControl = { x: c.x2, y: c.y2, type: 'C' };\n\t\t\t\tcx = c.x;\n\t\t\t\tcy = c.y;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'q': {\n\t\t\t\tconst c: PathCommand = { type: 'Q', x1: args[0] + ox, y1: args[1] + oy, x: args[2] + ox, y: args[3] + oy };\n\t\t\t\tcommands.push(c);\n\t\t\t\tlastControl = { x: c.x1, y: c.y1, type: 'Q' };\n\t\t\t\tcx = c.x;\n\t\t\t\tcy = c.y;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 't': {\n\t\t\t\tconst x1: number = lastControl?.type === 'Q' ? 2 * cx - lastControl.x : cx;\n\t\t\t\tconst y1: number = lastControl?.type === 'Q' ? 2 * cy - lastControl.y : cy;\n\t\t\t\tconst c: PathCommand = { type: 'Q', x1, y1, x: args[0] + ox, y: args[1] + oy };\n\t\t\t\tcommands.push(c);\n\t\t\t\tlastControl = { x: x1, y: y1, type: 'Q' };\n\t\t\t\tcx = c.x;\n\t\t\t\tcy = c.y;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'a': {\n\t\t\t\tconst c: PathCommand = {\n\t\t\t\t\ttype: 'A',\n\t\t\t\t\trx: Math.abs(args[0]),\n\t\t\t\t\try: Math.abs(args[1]),\n\t\t\t\t\trotation: args[2],\n\t\t\t\t\tlargeArc: args[3] !== 0,\n\t\t\t\t\tsweep: args[4] !== 0,\n\t\t\t\t\tx: args[5] + ox,\n\t\t\t\t\ty: args[6] + oy\n\t\t\t\t};\n\t\t\t\tcommands.push(c);\n\t\t\t\tlastControl = null;\n\t\t\t\tcx = c.x;\n\t\t\t\tcy = c.y;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn commands;\n}\n\n// ---------------------------------------------------------------------------\n// Curve flattening\n// ---------------------------------------------------------------------------\n\nfunction segmentCount(curvature: number, tolerance: number, max: number): number {\n\tif (!(curvature > 0)) return 1;\n\treturn Math.max(1, Math.min(max, Math.ceil(Math.sqrt(curvature / tolerance))));\n}\n\nfunction flattenCubic(\n\tout: Point[],\n\tp0: Point,\n\tx1: number,\n\ty1: number,\n\tx2: number,\n\ty2: number,\n\tx: number,\n\ty: number,\n\ttolerance: number,\n\tmax: number\n) {\n\t// Uniform subdivision error <= max|B''| / (8 n²) with |B''| <= 6 * max second difference.\n\tconst dd = Math.max(\n\t\tMath.hypot(p0[0] - 2 * x1 + x2, p0[1] - 2 * y1 + y2),\n\t\tMath.hypot(x1 - 2 * x2 + x, y1 - 2 * y2 + y)\n\t);\n\tconst n = segmentCount((6 * dd) / 8, tolerance, max);\n\tfor (let k = 1; k <= n; k++) {\n\t\tconst t = k / n;\n\t\tconst mt = 1 - t;\n\t\tconst a = mt * mt * mt;\n\t\tconst b = 3 * mt * mt * t;\n\t\tconst c = 3 * mt * t * t;\n\t\tconst e = t * t * t;\n\t\tout.push([a * p0[0] + b * x1 + c * x2 + e * x, a * p0[1] + b * y1 + c * y2 + e * y]);\n\t}\n}\n\nfunction flattenQuadratic(\n\tout: Point[],\n\tp0: Point,\n\tx1: number,\n\ty1: number,\n\tx: number,\n\ty: number,\n\ttolerance: number,\n\tmax: number\n) {\n\tconst dd = Math.hypot(p0[0] - 2 * x1 + x, p0[1] - 2 * y1 + y);\n\tconst n = segmentCount((2 * dd) / 8, tolerance, max);\n\tfor (let k = 1; k <= n; k++) {\n\t\tconst t = k / n;\n\t\tconst mt = 1 - t;\n\t\tout.push([mt * mt * p0[0] + 2 * mt * t * x1 + t * t * x, mt * mt * p0[1] + 2 * mt * t * y1 + t * t * y]);\n\t}\n}\n\nfunction arcSteps(radius: number, sweep: number, tolerance: number, max: number): number {\n\tif (radius <= tolerance) return Math.max(1, Math.ceil(Math.abs(sweep) / (Math.PI / 2)));\n\tconst step = 2 * Math.acos(1 - tolerance / radius);\n\treturn Math.max(1, Math.min(max, Math.ceil(Math.abs(sweep) / step)));\n}\n\n/** Flattens an SVG elliptical arc (endpoint parameterisation, SVG 1.1 F.6.5). */\nfunction flattenArc(\n\tout: Point[],\n\tp0: Point,\n\tcmd: Extract<PathCommand, { type: 'A' }>,\n\ttolerance: number,\n\tmax: number\n) {\n\tconst [x0, y0] = p0;\n\tlet { rx, ry } = cmd;\n\tconst { x, y } = cmd;\n\tif (x0 === x && y0 === y) return;\n\tif (rx === 0 || ry === 0) {\n\t\tout.push([x, y]);\n\t\treturn;\n\t}\n\tconst phi = (cmd.rotation * Math.PI) / 180;\n\tconst cos = Math.cos(phi);\n\tconst sin = Math.sin(phi);\n\tconst dx = (x0 - x) / 2;\n\tconst dy = (y0 - y) / 2;\n\tconst x1p = cos * dx + sin * dy;\n\tconst y1p = -sin * dx + cos * dy;\n\tconst lambda = (x1p * x1p) / (rx * rx) + (y1p * y1p) / (ry * ry);\n\tif (lambda > 1) {\n\t\tconst s = Math.sqrt(lambda);\n\t\trx *= s;\n\t\try *= s;\n\t}\n\tconst num = rx * rx * ry * ry - rx * rx * y1p * y1p - ry * ry * x1p * x1p;\n\tconst den = rx * rx * y1p * y1p + ry * ry * x1p * x1p;\n\tlet coef = den === 0 ? 0 : Math.sqrt(Math.max(0, num / den));\n\tif (cmd.largeArc === cmd.sweep) coef = -coef;\n\tconst cxp = (coef * rx * y1p) / ry;\n\tconst cyp = (-coef * ry * x1p) / rx;\n\tconst cx = cos * cxp - sin * cyp + (x0 + x) / 2;\n\tconst cy = sin * cxp + cos * cyp + (y0 + y) / 2;\n\tconst angle = (ux: number, uy: number, vx: number, vy: number) => {\n\t\tconst a = Math.atan2(ux * vy - uy * vx, ux * vx + uy * vy);\n\t\treturn a;\n\t};\n\tconst theta1 = angle(1, 0, (x1p - cxp) / rx, (y1p - cyp) / ry);\n\tlet delta = angle((x1p - cxp) / rx, (y1p - cyp) / ry, (-x1p - cxp) / rx, (-y1p - cyp) / ry);\n\tif (!cmd.sweep && delta > 0) delta -= 2 * Math.PI;\n\telse if (cmd.sweep && delta < 0) delta += 2 * Math.PI;\n\tconst n = arcSteps(Math.max(rx, ry), delta, tolerance, max);\n\tfor (let k = 1; k < n; k++) {\n\t\tconst t = theta1 + (delta * k) / n;\n\t\tconst ex = rx * Math.cos(t);\n\t\tconst ey = ry * Math.sin(t);\n\t\tout.push([cos * ex - sin * ey + cx, sin * ex + cos * ey + cy]);\n\t}\n\tout.push([x, y]);\n}\n\n/**\n * Flattens SVG path data into closed rings (one per subpath; open subpaths are closed the\n * way SVG fills them). Curves are approximated within `tolerance`.\n */\nexport function flattenSvgPath(d: string | PathCommand[], options: FlattenOptions = {}): PolygonRing[] {\n\tconst tolerance = options.tolerance && options.tolerance > 0 ? options.tolerance : 0.25;\n\tconst max = options.maxSegments ?? 512;\n\tconst commands = typeof d === 'string' ? parseSvgPath(d) : d;\n\tconst rings: PolygonRing[] = [];\n\tlet current: Point[] = [];\n\tlet start: Point = [0, 0];\n\tconst flush = () => {\n\t\tif (current.length >= 3) rings.push(current);\n\t\tcurrent = [];\n\t};\n\tconst last = (): Point => current[current.length - 1] ?? start;\n\tfor (const cmd of commands) {\n\t\tswitch (cmd.type) {\n\t\t\tcase 'M':\n\t\t\t\tflush();\n\t\t\t\tstart = [cmd.x, cmd.y];\n\t\t\t\tcurrent = [start];\n\t\t\t\tbreak;\n\t\t\tcase 'L':\n\t\t\t\tif (current.length === 0) current = [start];\n\t\t\t\tcurrent.push([cmd.x, cmd.y]);\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tif (current.length === 0) current = [start];\n\t\t\t\tflattenCubic(current, last(), cmd.x1, cmd.y1, cmd.x2, cmd.y2, cmd.x, cmd.y, tolerance, max);\n\t\t\t\tbreak;\n\t\t\tcase 'Q':\n\t\t\t\tif (current.length === 0) current = [start];\n\t\t\t\tflattenQuadratic(current, last(), cmd.x1, cmd.y1, cmd.x, cmd.y, tolerance, max);\n\t\t\t\tbreak;\n\t\t\tcase 'A':\n\t\t\t\tif (current.length === 0) current = [start];\n\t\t\t\tflattenArc(current, last(), cmd, tolerance, max);\n\t\t\t\tbreak;\n\t\t\tcase 'Z':\n\t\t\t\tflush();\n\t\t\t\t// A command after Z without a moveto starts at the subpath start.\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tflush();\n\treturn rings.map(dedupeRing).filter((r) => r.length >= 3);\n}\n\nfunction dedupeRing(ring: Point[]): Point[] {\n\tconst out: Point[] = [];\n\tfor (const p of ring) {\n\t\tconst prev = out[out.length - 1];\n\t\tif (!prev || prev[0] !== p[0] || prev[1] !== p[1]) out.push(p);\n\t}\n\twhile (out.length > 1 && out[0][0] === out[out.length - 1][0] && out[0][1] === out[out.length - 1][1]) out.pop();\n\treturn out;\n}\n\n// ---------------------------------------------------------------------------\n// Shapes to polygons\n// ---------------------------------------------------------------------------\n\nfunction cornerRadii(shape: RectShape, width: number, height: number): [number, number, number, number] {\n\tconst raw = shape.cornerRadius ?? 0;\n\tlet radii = (typeof raw === 'number' ? [raw, raw, raw, raw] : [...raw]).map((r) =>\n\t\tNumber.isFinite(r) && r > 0 ? r : 0\n\t) as [number, number, number, number];\n\t// Scale all radii down together when adjacent corners would overlap (CSS rule).\n\tconst factor = Math.min(\n\t\t1,\n\t\twidth / Math.max(radii[0] + radii[1], 1e-12),\n\t\theight / Math.max(radii[1] + radii[2], 1e-12),\n\t\twidth / Math.max(radii[2] + radii[3], 1e-12),\n\t\theight / Math.max(radii[3] + radii[0], 1e-12)\n\t);\n\tif (factor < 1) radii = radii.map((r) => r * factor) as [number, number, number, number];\n\treturn radii;\n}\n\n/** Unit vertices of a regular polygon / star, stretched to fill the box. */\nfunction polygonVertices(count: number, inner: number | null, width: number, height: number): Point[] {\n\tconst raw: Point[] = [];\n\tconst total = inner === null ? count : count * 2;\n\tfor (let k = 0; k < total; k++) {\n\t\tconst angle = -Math.PI / 2 + (k * 2 * Math.PI) / total;\n\t\tconst r = inner !== null && k % 2 === 1 ? inner : 1;\n\t\traw.push([r * Math.cos(angle), r * Math.sin(angle)]);\n\t}\n\tlet minX = Infinity;\n\tlet minY = Infinity;\n\tlet maxX = -Infinity;\n\tlet maxY = -Infinity;\n\tfor (const [x, y] of raw) {\n\t\tminX = Math.min(minX, x);\n\t\tminY = Math.min(minY, y);\n\t\tmaxX = Math.max(maxX, x);\n\t\tmaxY = Math.max(maxY, y);\n\t}\n\tconst sx = width / (maxX - minX || 1);\n\tconst sy = height / (maxY - minY || 1);\n\treturn raw.map(([x, y]) => [(x - minX) * sx, (y - minY) * sy]);\n}\n\nfunction rotationTransform(shape: ShapeDescription, size: ShapeSize): ((p: Point) => Point) | null {\n\tconst deg = shape.rotation ?? 0;\n\tif (!deg || !Number.isFinite(deg)) return null;\n\tconst rad = (deg * Math.PI) / 180;\n\tconst cos = Math.cos(rad);\n\tconst sin = Math.sin(rad);\n\tconst cx = size.width / 2;\n\tconst cy = size.height / 2;\n\treturn ([x, y]) => [cx + (x - cx) * cos - (y - cy) * sin, cy + (x - cx) * sin + (y - cy) * cos];\n}\n\n/**\n * SVG path data for a shape in node-local pixels (exact curves: arcs for rounded corners\n * and ellipses), plus the fill rule and a `transform` for rotation / path view boxes.\n * Use it to render a shape; use `shapeToPolygon` for geometry.\n */\nexport function getShapeSvg(\n\tshape: ShapeDescription,\n\tsize: ShapeSize\n): { d: string; transform?: string; fillRule: PolygonFillRule } {\n\tconst { width: w, height: h } = size;\n\tconst f = (n: number) => formatNumber(n, 3);\n\tconst transforms: string[] = [];\n\tif (shape.rotation) transforms.push(`rotate(${f(shape.rotation)} ${f(w / 2)} ${f(h / 2)})`);\n\tlet d = '';\n\tlet fillRule: PolygonFillRule = 'nonzero';\n\tswitch (shape.kind) {\n\t\tcase 'rect': {\n\t\t\tconst [tl, tr, br, bl] = cornerRadii(shape, w, h);\n\t\t\tif (tl + tr + br + bl === 0) {\n\t\t\t\td = `M0 0H${f(w)}V${f(h)}H0Z`;\n\t\t\t} else {\n\t\t\t\tconst arc = (r: number, x: number, y: number) => (r > 0 ? `A${f(r)} ${f(r)} 0 0 1 ${f(x)} ${f(y)}` : '');\n\t\t\t\td =\n\t\t\t\t\t`M${f(tl)} 0H${f(w - tr)}${arc(tr, w, tr)}V${f(h - br)}${arc(br, w - br, h)}` +\n\t\t\t\t\t`H${f(bl)}${arc(bl, 0, h - bl)}V${f(tl)}${arc(tl, tl, 0)}Z`;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase 'ellipse': {\n\t\t\tconst rx = w / 2;\n\t\t\tconst ry = h / 2;\n\t\t\td = `M0 ${f(ry)}A${f(rx)} ${f(ry)} 0 1 1 ${f(w)} ${f(ry)}A${f(rx)} ${f(ry)} 0 1 1 0 ${f(ry)}Z`;\n\t\t\tbreak;\n\t\t}\n\t\tcase 'polygon':\n\t\tcase 'star': {\n\t\t\tconst points =\n\t\t\t\tshape.kind === 'polygon'\n\t\t\t\t\t? polygonVertices(Math.max(3, Math.floor(shape.sides ?? 6)), null, w, h)\n\t\t\t\t\t: polygonVertices(Math.max(3, Math.floor(shape.points ?? 5)), clampRatio(shape.innerRadius), w, h);\n\t\t\td = ringsToPath([points], f);\n\t\t\tbreak;\n\t\t}\n\t\tcase 'path': {\n\t\t\td = shape.d;\n\t\t\tfillRule = shape.fillRule ?? 'nonzero';\n\t\t\tconst vb = validViewBox(shape.viewBox);\n\t\t\tif (vb) {\n\t\t\t\ttransforms.push(\n\t\t\t\t\t`scale(${f(w / vb[2])} ${f(h / vb[3])})`,\n\t\t\t\t\t`translate(${f(-vb[0])} ${f(-vb[1])})`\n\t\t\t\t);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn transforms.length > 0 ? { d, transform: transforms.join(' '), fillRule } : { d, fillRule };\n}\n\n/** Everything a renderer needs to draw a shape as one SVG `<path>`. */\nexport interface ShapeRenderData {\n\t/** SVG `viewBox` (`0 0 width height`): node-local pixels. */\n\tviewBox: string;\n\twidth: number;\n\theight: number;\n\td: string;\n\ttransform?: string;\n\tfillRule: PolygonFillRule;\n\tfill: string;\n\tstroke: string;\n\tstrokeWidth: number;\n\topacity?: number;\n\tstrokeLinecap?: 'round' | 'butt' | 'square';\n\tstrokeLinejoin?: 'round' | 'bevel' | 'miter';\n\t/** Gradient def for the fill, when fill uses a gradient. */\n\tfillGradient?: SvgGradientDef;\n\t/** Gradient def for the stroke, when stroke uses a gradient. */\n\tstrokeGradient?: SvgGradientDef;\n}\n\nexport interface GetShapeRenderDataOptions {\n\t/** Unique ID suffix or base ID used when generating SVG gradient IDs (default: auto random). */\n\tid?: string;\n}\n\n/**\n * Resolves the SVG drawing of a shape for a node size. Without a size, a path's view box\n * size (or 100x100) is used. Paint defaults: `fill: currentColor`, `stroke: none`,\n * `strokeWidth: 1`. Supports solid colors, CSS gradients, presets, and CanvasGradientDef.\n */\nexport function getShapeRenderData(\n\tshape: ShapeDescription,\n\tsize: Partial<ShapeSize> = {},\n\toptions: GetShapeRenderDataOptions = {}\n): ShapeRenderData {\n\tconst vb = shape.kind === 'path' ? validViewBox(shape.viewBox) : null;\n\tconst width = size.width && size.width > 0 ? size.width : vb ? vb[2] : 100;\n\tconst height = size.height && size.height > 0 ? size.height : vb ? vb[3] : 100;\n\tconst svg = getShapeSvg(shape, { width, height });\n\n\tconst baseId = options.id || Math.random().toString(36).slice(2, 9);\n\n\t// Resolve fill (gradient or solid)\n\tlet fillStr = 'currentColor';\n\tlet fillGradientDef: SvgGradientDef | undefined;\n\tconst rawFill = shape.fillGradient ?? shape.fill;\n\tconst resolvedFillGradient = resolveCanvasGradient(rawFill);\n\tif (resolvedFillGradient) {\n\t\tconst gradId = `shape-fill-${baseId}`;\n\t\tfillGradientDef = gradientToSvgDef(resolvedFillGradient, gradId);\n\t\tfillStr = `url(#${gradId})`;\n\t} else if (typeof shape.fill === 'string') {\n\t\tfillStr = shape.fill;\n\t} else if (shape.fill === undefined) {\n\t\tfillStr = 'currentColor';\n\t}\n\n\t// Resolve stroke (gradient or solid)\n\tlet strokeStr = 'none';\n\tlet strokeGradientDef: SvgGradientDef | undefined;\n\tconst rawStroke = shape.strokeGradient ?? shape.stroke;\n\tconst resolvedStrokeGradient = resolveCanvasGradient(rawStroke);\n\tif (resolvedStrokeGradient) {\n\t\tconst gradId = `shape-stroke-${baseId}`;\n\t\tstrokeGradientDef = gradientToSvgDef(resolvedStrokeGradient, gradId);\n\t\tstrokeStr = `url(#${gradId})`;\n\t} else if (typeof shape.stroke === 'string') {\n\t\tstrokeStr = shape.stroke;\n\t} else if (shape.stroke === undefined) {\n\t\tstrokeStr = 'none';\n\t}\n\n\tconst data: ShapeRenderData = {\n\t\tviewBox: `0 0 ${formatNumber(width, 3)} ${formatNumber(height, 3)}`,\n\t\twidth,\n\t\theight,\n\t\td: svg.d,\n\t\tfillRule: svg.fillRule,\n\t\tfill: fillStr,\n\t\tstroke: strokeStr,\n\t\tstrokeWidth: shape.strokeWidth ?? 1\n\t};\n\tif (svg.transform) data.transform = svg.transform;\n\tif (shape.opacity !== undefined) data.opacity = shape.opacity;\n\tif (shape.strokeLinecap) data.strokeLinecap = shape.strokeLinecap;\n\tif (shape.strokeLinejoin) data.strokeLinejoin = shape.strokeLinejoin;\n\tif (fillGradientDef) data.fillGradient = fillGradientDef;\n\tif (strokeGradientDef) data.strokeGradient = strokeGradientDef;\n\treturn data;\n}\n\nfunction clampRatio(value: number | undefined): number {\n\tif (value === undefined || !Number.isFinite(value)) return 0.5;\n\treturn Math.min(1, Math.max(0.01, value));\n}\n\nfunction validViewBox(vb: PathShape['viewBox']): readonly [number, number, number, number] | null {\n\tif (!vb || vb.length !== 4 || !vb.every(Number.isFinite) || vb[2] <= 0 || vb[3] <= 0) return null;\n\treturn vb;\n}\n\n/**\n * Converts a shape to rings in node-local pixels (rotation applied), flattening curves at\n * `tolerance`. Returns the rings with the fill rule they must be read with.\n */\nexport function shapeToPolygon(\n\tshape: ShapeDescription,\n\tsize: ShapeSize,\n\toptions: FlattenOptions = {}\n): { rings: PolygonRing[]; fillRule: PolygonFillRule } {\n\tconst { width: w, height: h } = size;\n\tif (!(w > 0) || !(h > 0)) return { rings: [], fillRule: 'nonzero' };\n\tlet rings: PolygonRing[];\n\tlet fillRule: PolygonFillRule = 'nonzero';\n\tif (shape.kind === 'path') {\n\t\tfillRule = shape.fillRule ?? 'nonzero';\n\t\tconst vb = validViewBox(shape.viewBox);\n\t\tif (vb) {\n\t\t\tconst sx = w / vb[2];\n\t\t\tconst sy = h / vb[3];\n\t\t\t// Flatten in path units with the tolerance scaled to stay within `tolerance` px.\n\t\t\tconst tolerance = (options.tolerance ?? 0.25) / Math.max(sx, sy);\n\t\t\trings = flattenSvgPath(shape.d, { ...options, tolerance }).map((ring) =>\n\t\t\t\tring.map(([x, y]) => [(x - vb[0]) * sx, (y - vb[1]) * sy] as Point)\n\t\t\t);\n\t\t} else {\n\t\t\trings = flattenSvgPath(shape.d, options);\n\t\t}\n\t} else {\n\t\tconst { d } = getShapeSvg({ ...shape, rotation: 0 }, size);\n\t\trings = flattenSvgPath(d, options);\n\t}\n\tconst rotate = rotationTransform(shape, size);\n\tif (rotate) rings = rings.map((ring) => ring.map(rotate));\n\treturn { rings, fillRule };\n}\n\n// ---------------------------------------------------------------------------\n// Polygons to path data\n// ---------------------------------------------------------------------------\n\n/** Formats a number with at most `precision` decimals, without trailing zeros. */\nexport function formatNumber(value: number, precision = 3): string {\n\tconst factor = 10 ** precision;\n\tconst rounded = Math.round(value * factor) / factor;\n\treturn Object.is(rounded, -0) ? '0' : String(rounded);\n}\n\nfunction ringsToPath(rings: readonly (readonly Point[])[], f: (n: number) => string): string {\n\tlet d = '';\n\tfor (const ring of rings) {\n\t\tif (ring.length < 2) continue;\n\t\td += `M${f(ring[0][0])} ${f(ring[0][1])}`;\n\t\tfor (let i = 1; i < ring.length; i++) d += `L${f(ring[i][0])} ${f(ring[i][1])}`;\n\t\td += 'Z';\n\t}\n\treturn d;\n}\n\n/** Perpendicular distance from `p` to the segment `a`–`b`. */\nfunction segmentDistance(p: Point, a: Point, b: Point): number {\n\tconst dx = b[0] - a[0];\n\tconst dy = b[1] - a[1];\n\tconst len2 = dx * dx + dy * dy;\n\tif (len2 === 0) return Math.hypot(p[0] - a[0], p[1] - a[1]);\n\tconst t = Math.max(0, Math.min(1, ((p[0] - a[0]) * dx + (p[1] - a[1]) * dy) / len2));\n\treturn Math.hypot(p[0] - (a[0] + t * dx), p[1] - (a[1] + t * dy));\n}\n\nfunction rdp(points: Point[], tolerance: number): Point[] {\n\tif (points.length <= 2) return points;\n\tconst keep = new Uint8Array(points.length);\n\tkeep[0] = 1;\n\tkeep[points.length - 1] = 1;\n\tconst stack: [number, number][] = [[0, points.length - 1]];\n\twhile (stack.length) {\n\t\tconst [s, e] = stack.pop()!;\n\t\tlet maxDist = -1;\n\t\tlet index = -1;\n\t\tfor (let i = s + 1; i < e; i++) {\n\t\t\tconst dist = segmentDistance(points[i], points[s], points[e]);\n\t\t\tif (dist > maxDist) {\n\t\t\t\tmaxDist = dist;\n\t\t\t\tindex = i;\n\t\t\t}\n\t\t}\n\t\tif (index !== -1 && maxDist > tolerance) {\n\t\t\tkeep[index] = 1;\n\t\t\tstack.push([s, index], [index, e]);\n\t\t}\n\t}\n\treturn points.filter((_, i) => keep[i]);\n}\n\n/**\n * Simplifies a closed ring with Ramer–Douglas–Peucker at `tolerance`. Returns an empty\n * ring when fewer than three points survive.\n */\nexport function simplifyRing(ring: readonly Point[], tolerance: number): Point[] {\n\tif (ring.length <= 3 || !(tolerance > 0)) return [...ring];\n\t// Anchor on the point farthest from the first one so the closing seam is not lost.\n\tlet far = 0;\n\tlet farDist = -1;\n\tfor (let i = 1; i < ring.length; i++) {\n\t\tconst dist = Math.hypot(ring[i][0] - ring[0][0], ring[i][1] - ring[0][1]);\n\t\tif (dist > farDist) {\n\t\t\tfarDist = dist;\n\t\t\tfar = i;\n\t\t}\n\t}\n\tconst first = rdp(ring.slice(0, far + 1) as Point[], tolerance);\n\tconst second = rdp([...ring.slice(far), ring[0]] as Point[], tolerance);\n\tconst out = [...first.slice(0, -1), ...second.slice(0, -1)];\n\treturn out.length >= 3 ? out : [];\n}\n\nexport interface PolygonToPathOptions {\n\t/** Decimal places in the output (default 3). */\n\tprecision?: number;\n\t/** Ramer–Douglas–Peucker tolerance; `0` (default) keeps every vertex. */\n\tsimplify?: number;\n\t/** Added to every point before formatting (e.g. to make coordinates node-local). */\n\toffset?: { x: number; y: number };\n\t/**\n\t * `'lines'` (default) writes every ring as `M`/`L`/`Z`. `'fit'` fits cubic Béziers to each\n\t * ring (`fitPathData`), so flattened curves come back as smooth `C` curves while sharp\n\t * corners (turning more than `cornerAngleDeg`) and straight edges stay as they are.\n\t */\n\tcurves?: 'lines' | 'fit';\n\t/** Curve-fitting tolerance in path units for `curves: 'fit'` (default 0.25). */\n\tcurveTolerance?: number;\n\t/** Corner threshold in degrees for `curves: 'fit'` (default 30). */\n\tcornerAngleDeg?: number;\n}\n\n/**\n * Converts a multi-polygon (or a list of rings) to SVG path data using `M`/`L`/`Z`. Holes\n * keep their opposite orientation, so the path fills correctly with either fill rule.\n */\nexport function polygonToSvgPath(input: MultiPolygon | PolygonRing[], options: PolygonToPathOptions = {}): string {\n\tconst precision = options.precision ?? 3;\n\tconst f = (n: number) => formatNumber(n, precision);\n\tconst dx = options.offset?.x ?? 0;\n\tconst dy = options.offset?.y ?? 0;\n\tconst rings: Point[][] = [];\n\tconst fit = options.curves === 'fit';\n\tlet fitted = '';\n\tfor (const item of input as any[]) {\n\t\tconst list: Point[][] =\n\t\t\titem.length > 0 && Array.isArray(item[0]) && Array.isArray(item[0][0]) ? item : [item];\n\t\tfor (const ring of list) {\n\t\t\tlet r = ring;\n\t\t\tif (options.simplify && options.simplify > 0) r = simplifyRing(r, options.simplify);\n\t\t\tif (r.length < 3) continue;\n\t\t\tif (fit) {\n\t\t\t\tfitted += fitPathData(r, {\n\t\t\t\t\ttolerance: options.curveTolerance ?? 0.25,\n\t\t\t\t\tcornerAngleDeg: options.cornerAngleDeg,\n\t\t\t\t\tprecision,\n\t\t\t\t\toffset: { x: dx, y: dy }\n\t\t\t\t});\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\trings.push(dx || dy ? r.map(([x, y]) => [x + dx, y + dy] as Point) : r);\n\t\t}\n\t}\n\treturn fit ? fitted : ringsToPath(rings, f);\n}\n"],"mappings":";AAwCO,IAAM,0BAAgD;AAAA,EAC5D,MAAM;AAAA,EACN,OAAO;AAAA,EACP,OAAO;AAAA,IACN,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,IAC9B,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,EAC/B;AACD;AAEO,IAAM,0BAAgE;AAAA,EAC5E,UAAU;AAAA,EACV,QAAQ;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,OAAO;AAAA,MACN,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,MAC9B,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,IAC/B;AAAA,EACD;AAAA,EACA,OAAO;AAAA,IACN,MAAM;AAAA,IACN,OAAO;AAAA,IACP,OAAO;AAAA,MACN,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,MAC9B,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,IAC/B;AAAA,EACD;AAAA,EACA,QAAQ;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,OAAO;AAAA,MACN,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,MAC9B,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,IAC/B;AAAA,EACD;AAAA,EACA,MAAM;AAAA,IACL,MAAM;AAAA,IACN,OAAO;AAAA,IACP,OAAO;AAAA,MACN,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,MAC9B,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,IAC/B;AAAA,EACD;AAAA,EACA,OAAO;AAAA,IACN,MAAM;AAAA,IACN,OAAO;AAAA,IACP,OAAO;AAAA,MACN,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,MAC9B,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,IAC/B;AAAA,EACD;AAAA,EACA,QAAQ;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,OAAO;AAAA,MACN,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,MAC9B,EAAE,QAAQ,KAAK,OAAO,UAAU;AAAA,MAChC,EAAE,QAAQ,GAAG,OAAO,UAAU;AAAA,IAC/B;AAAA,EACD;AACD;AAGO,SAAS,iBAAiB,OAA4C;AAC5E,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,QAAM,MAAM;AACZ,MAAI,IAAI,SAAS,YAAY,IAAI,SAAS,SAAU,QAAO;AAC3D,MAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,EAAG,QAAO;AACtC,SAAO;AACR;AAMA,SAAS,aAAa,KAAuB;AAC5C,QAAM,QAAkB,CAAC;AACzB,MAAI,QAAQ;AACZ,MAAI,UAAU;AACd,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACpC,UAAM,OAAO,IAAI,CAAC;AAClB,QAAI,SAAS,IAAK;AAAA,aACT,SAAS,IAAK,SAAQ,KAAK,IAAI,GAAG,QAAQ,CAAC;AACpD,QAAI,SAAS,OAAO,UAAU,GAAG;AAChC,UAAI,QAAQ,KAAK,EAAG,OAAM,KAAK,QAAQ,KAAK,CAAC;AAC7C,gBAAU;AAAA,IACX,OAAO;AACN,iBAAW;AAAA,IACZ;AAAA,EACD;AACA,MAAI,QAAQ,KAAK,EAAG,OAAM,KAAK,QAAQ,KAAK,CAAC;AAC7C,SAAO;AACR;AAGA,SAAS,cAAc,KAAqB;AAC3C,QAAM,UAAU,IAAI,KAAK,EAAE,YAAY;AACvC,MAAI,QAAQ,SAAS,KAAK,GAAG;AAC5B,WAAO,WAAW,OAAO;AAAA,EAC1B;AACA,MAAI,QAAQ,SAAS,MAAM,GAAG;AAC7B,WAAO,WAAW,OAAO,IAAI;AAAA,EAC9B;AACA,MAAI,QAAQ,SAAS,KAAK,GAAG;AAC5B,WAAQ,WAAW,OAAO,IAAI,MAAO,KAAK;AAAA,EAC3C;AACA,MAAI,QAAQ,WAAW,KAAK,GAAG;AAC9B,UAAM,MAAM,QAAQ,MAAM,CAAC,EAAE,KAAK;AAClC,QAAI,QAAQ,SAAU,QAAO;AAC7B,QAAI,QAAQ,MAAO,QAAO;AAC1B,QAAI,QAAQ,QAAS,QAAO;AAC5B,QAAI,QAAQ,OAAQ,QAAO;AAC3B,QAAI,QAAQ,kBAAkB,QAAQ,eAAgB,QAAO;AAC7D,QAAI,QAAQ,iBAAiB,QAAQ,cAAe,QAAO;AAC3D,QAAI,QAAQ,eAAe,QAAQ,YAAa,QAAO;AACvD,QAAI,QAAQ,cAAc,QAAQ,WAAY,QAAO;AAAA,EACtD;AACA,QAAM,IAAI,WAAW,OAAO;AAC5B,SAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AACjC;AASO,SAAS,iBAAiB,KAAuC;AACvE,QAAM,UAAU,IAAI,KAAK;AACzB,QAAM,cAAc,QAAQ,MAAM,gCAAgC;AAClE,MAAI,aAAa;AAChB,UAAM,UAAU,aAAa,YAAY,CAAC,CAAC;AAC3C,QAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,QAAI,QAAQ;AACZ,QAAI,iBAAiB;AAErB,UAAM,QAAQ,QAAQ,CAAC,EAAE,KAAK,EAAE,YAAY;AAC5C,QAAI,MAAM,SAAS,KAAK,KAAK,MAAM,SAAS,MAAM,KAAK,MAAM,SAAS,KAAK,KAAK,MAAM,WAAW,KAAK,GAAG;AACxG,cAAQ,cAAc,KAAK;AAC3B,uBAAiB;AAAA,IAClB;AAEA,UAAM,cAAc,QAAQ,MAAM,cAAc;AAChD,QAAI,YAAY,WAAW,EAAG,QAAO;AACrC,UAAM,QAAQ,iBAAiB,WAAW;AAC1C,QAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,WAAO;AAAA,MACN,MAAM;AAAA,MACN;AAAA,MACA;AAAA,IACD;AAAA,EACD;AAEA,QAAM,cAAc,QAAQ,MAAM,gCAAgC;AAClE,MAAI,aAAa;AAChB,UAAM,UAAU,aAAa,YAAY,CAAC,CAAC;AAC3C,QAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,QAAI,iBAAiB;AACrB,UAAM,QAAQ,QAAQ,CAAC,EAAE,KAAK,EAAE,YAAY;AAC5C,QAAI,MAAM,WAAW,QAAQ,KAAK,MAAM,WAAW,SAAS,KAAK,MAAM,SAAS,KAAK,GAAG;AACvF,uBAAiB;AAAA,IAClB;AACA,UAAM,cAAc,QAAQ,MAAM,cAAc;AAChD,QAAI,YAAY,WAAW,EAAG,QAAO;AACrC,UAAM,QAAQ,iBAAiB,WAAW;AAC1C,QAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,WAAO;AAAA,MACN,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,GAAG;AAAA,MACH;AAAA,IACD;AAAA,EACD;AAEA,SAAO;AACR;AAEA,SAAS,iBAAiB,aAAuC;AAChE,QAAM,QAAQ,YAAY;AAC1B,SAAO,YAAY,IAAI,CAAC,KAAK,QAAQ;AACpC,UAAM,QAAQ,IAAI,KAAK,EAAE,MAAM,eAAe;AAC9C,UAAM,QAAQ,MAAM,CAAC;AACrB,QAAI,SAAS,UAAU,IAAI,IAAI,OAAO,QAAQ;AAC9C,QAAI,MAAM,SAAS,GAAG;AACrB,YAAM,SAAS,MAAM,CAAC,EAAE,KAAK;AAC7B,UAAI,OAAO,SAAS,GAAG,GAAG;AACzB,iBAAS,WAAW,MAAM,IAAI;AAAA,MAC/B,OAAO;AACN,cAAM,MAAM,WAAW,MAAM;AAC7B,YAAI,OAAO,SAAS,GAAG,EAAG,UAAS;AAAA,MACpC;AAAA,IACD;AACA,WAAO;AAAA,MACN,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,MAAM,CAAC;AAAA,MACvC;AAAA,IACD;AAAA,EACD,CAAC;AACF;AAMO,SAAS,sBAAsB,OAA0C;AAC/E,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,iBAAiB,KAAK,EAAG,QAAO;AACpC,MAAI,OAAO,UAAU,UAAU;AAC9B,UAAM,QAAQ,MAAM,KAAK,EAAE,YAAY;AACvC,QAAI,wBAAwB,KAAK,GAAG;AACnC,aAAO,wBAAwB,KAAK;AAAA,IACrC;AACA,QAAI,MAAM,WAAW,iBAAiB,KAAK,MAAM,WAAW,iBAAiB,GAAG;AAC/E,aAAO,iBAAiB,KAAK;AAAA,IAC9B;AAAA,EACD;AACA,SAAO;AACR;AAMO,SAAS,uBAAuB,WAAmB,KAAyD;AAKlH,QAAM,OAAQ,KAAK,YAAY,KAAK,KAAM;AAE1C,QAAM,KAAK,KAAK,IAAI,GAAG;AACvB,QAAM,KAAK,CAAC,KAAK,IAAI,GAAG;AAGxB,QAAM,OAAO;AACb,SAAO;AAAA,IACN,IAAI,KAAK,OAAO,OAAO,KAAK,QAAQ,GAAI,IAAI;AAAA,IAC5C,IAAI,KAAK,OAAO,OAAO,KAAK,QAAQ,GAAI,IAAI;AAAA,IAC5C,IAAI,KAAK,OAAO,OAAO,KAAK,QAAQ,GAAI,IAAI;AAAA,IAC5C,IAAI,KAAK,OAAO,OAAO,KAAK,QAAQ,GAAI,IAAI;AAAA,EAC7C;AACD;AAKO,SAAS,iBAAiB,UAA6B,IAA4B;AACzF,QAAM,SAA4B,SAAS,SAAS,CAAC,GAAG,IAAI,CAAC,OAAO;AAAA,IACnE,QAAQ,GAAG,KAAK,MAAM,EAAE,SAAS,GAAI,IAAI,EAAE;AAAA,IAC3C,WAAW,EAAE;AAAA,IACb,aAAa,EAAE;AAAA,EAChB,EAAE;AAEF,MAAI,SAAS,SAAS,UAAU;AAC/B,WAAO;AAAA,MACN;AAAA,MACA,MAAM;AAAA,MACN,OAAO;AAAA,QACN,IAAI,SAAS,OAAO,SAAY,GAAG,SAAS,KAAK,GAAG,MAAM;AAAA,QAC1D,IAAI,SAAS,OAAO,SAAY,GAAG,SAAS,KAAK,GAAG,MAAM;AAAA,QAC1D,GAAG,SAAS,MAAM,SAAY,GAAG,SAAS,IAAI,GAAG,MAAM;AAAA,MACxD;AAAA,MACA;AAAA,IACD;AAAA,EACD;AAEA,QAAM,SAAS,uBAAuB,SAAS,SAAS,GAAG;AAC3D,SAAO;AAAA,IACN;AAAA,IACA,MAAM;AAAA,IACN,OAAO;AAAA,MACN,IAAI,GAAG,OAAO,KAAK,GAAG;AAAA,MACtB,IAAI,GAAG,OAAO,KAAK,GAAG;AAAA,MACtB,IAAI,GAAG,OAAO,KAAK,GAAG;AAAA,MACtB,IAAI,GAAG,OAAO,KAAK,GAAG;AAAA,IACvB;AAAA,IACA;AAAA,EACD;AACD;;;ACnTA,SAAS,aAAa,OAAe,WAA2B;AAC/D,QAAM,SAAS,MAAM;AACrB,QAAM,UAAU,KAAK,MAAM,QAAQ,MAAM,IAAI;AAC7C,SAAO,OAAO,GAAG,SAAS,EAAE,IAAI,MAAM,OAAO,OAAO;AACrD;AAqBA,IAAM,cAAc;AAIpB,IAAM,MAAM,CAAC,GAAU,MAAkB,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAClE,IAAM,MAAM,CAAC,GAAU,GAAQ,IAAI,MAAW,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC;AAC/E,IAAM,MAAM,CAAC,GAAQ,MAAW,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AACxD,IAAM,OAAO,CAAC,GAAU,MAAa,KAAK,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAExE,SAAS,KAAK,GAAoB;AACjC,QAAM,IAAI,KAAK,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAC/B,SAAO,IAAI,SAAS,OAAO,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI;AACjE;AAEA,SAAS,UAAU,GAAiB,GAAgB;AACnD,QAAM,IAAI,IAAI;AACd,QAAM,KAAK,IAAI,IAAI;AACnB,QAAM,KAAK,IAAI,IAAI,IAAI;AACvB,QAAM,KAAK,IAAI,IAAI,IAAI;AACvB,QAAM,KAAK,IAAI,IAAI;AACnB,SAAO;AAAA,IACN,KAAK,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,GAAG,CAAC;AAAA,IACxD,KAAK,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,GAAG,CAAC;AAAA,EACzD;AACD;AAGO,SAAS,aAAa,GAAiB,GAAkB;AAC/D,SAAO,UAAU,GAAG,CAAC;AACtB;AAEA,SAAS,MAAM,QAAmC;AACjD,QAAM,MAAe,CAAC;AACtB,aAAW,KAAK,QAAQ;AACvB,QAAI,CAAC,OAAO,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,SAAS,EAAE,CAAC,CAAC,EAAG;AACtD,QAAI,IAAI,WAAW,KAAK,KAAK,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,MAAO,KAAI,KAAK,CAAC;AAAA,EACzE;AACA,SAAO;AACR;AAGA,SAAS,YAAY,KAAwB;AAC5C,QAAM,IAAI,CAAC,CAAC;AACZ,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACpC,WAAO,KAAK,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AAC9B,MAAE,KAAK,GAAG;AAAA,EACX;AACA,SAAO,MAAM,IAAI,EAAE,IAAI,CAAC,MAAM,IAAI,GAAG,IAAI;AAC1C;AAGA,SAAS,SAAS,KAAc,GAAa,IAAS,IAAuB;AAC5E,QAAM,KAAK,IAAI,CAAC;AAChB,QAAM,KAAK,IAAI,IAAI,SAAS,CAAC;AAC7B,QAAM,QAAa,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAClC,MAAI,MAAM;AACV,MAAI,MAAM;AACV,MAAI,MAAM;AACV,MAAI,KAAK;AACT,MAAI,KAAK;AACT,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACpC,UAAM,IAAI,EAAE,CAAC;AACb,UAAM,IAAI,IAAI;AACd,UAAM,KAAK,IAAI,IAAI;AACnB,UAAM,KAAK,IAAI,IAAI,IAAI;AACvB,UAAM,KAAK,IAAI,IAAI,IAAI;AACvB,UAAM,KAAK,IAAI,IAAI;AACnB,UAAM,KAAU,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE;AACvC,UAAM,KAAU,CAAC,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,EAAE;AAC7C,WAAO,IAAI,IAAI,EAAE;AACjB,WAAO,IAAI,IAAI,EAAE;AACjB,WAAO,IAAI,IAAI,EAAE;AACjB,UAAM,MAAW;AAAA,MAChB,IAAI,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,KAAK,KAAK,MAAM,GAAG,CAAC,KAAK,KAAK;AAAA,MAC/C,IAAI,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,KAAK,KAAK,MAAM,GAAG,CAAC,KAAK,KAAK;AAAA,IAChD;AACA,UAAM,IAAI,IAAI,GAAG;AACjB,UAAM,IAAI,IAAI,GAAG;AAAA,EAClB;AACA,QAAM,MAAM,MAAM,MAAM,MAAM;AAC9B,QAAM,MAAM,KAAK,IAAI,EAAE;AACvB,QAAM,MAAM,OAAO;AACnB,MAAI,KAAK,MAAM;AACf,MAAI,KAAK,MAAM;AACf,MAAI,KAAK,IAAI,GAAG,IAAI,OAAO;AAC1B,UAAM,KAAK,MAAM,KAAK,OAAO;AAC7B,UAAM,MAAM,KAAK,MAAM,MAAM;AAAA,EAC9B;AACA,MAAI,CAAC,OAAO,SAAS,EAAE,KAAK,CAAC,OAAO,SAAS,EAAE,KAAK,KAAK,OAAO,KAAK,KAAK;AACzE,SAAK,MAAM;AACX,SAAK,MAAM;AAAA,EACZ;AAEA,QAAM,MAAM,MAAM,IAAI;AACtB,OAAK,KAAK,IAAI,IAAI,GAAG;AACrB,OAAK,KAAK,IAAI,IAAI,GAAG;AACrB,SAAO,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG,IAAI,IAAI,IAAI,OAAO,EAAE,GAAG,GAAG;AAC9D;AAGA,SAAS,SAAS,KAAc,GAAiB,GAA+B;AAC/E,MAAI,IAAI;AACR,MAAI,MAAM,IAAI,UAAU;AACxB,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACpC,UAAM,IAAI,KAAK,UAAU,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AACzC,QAAI,IAAI,GAAG;AACV,UAAI;AACJ,YAAM;AAAA,IACP;AAAA,EACD;AACA,SAAO,CAAC,GAAG,GAAG;AACf;AAGA,SAAS,OAAO,GAAiB,GAAU,GAAmB;AAC7D,QAAM,IAAI,IAAI;AACd,QAAM,IAAI,UAAU,GAAG,CAAC;AACxB,QAAM,KAAU;AAAA,IACf,KAAK,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,IAAI,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;AAAA,IAC9F,KAAK,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,IAAI,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;AAAA,EAC/F;AACA,QAAM,KAAU;AAAA,IACf,KAAK,KAAK,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,KAAK,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;AAAA,IAChF,KAAK,KAAK,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,KAAK,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;AAAA,EACjF;AACA,QAAM,OAAY,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAC3C,QAAM,MAAM,IAAI,MAAM,EAAE;AACxB,QAAM,MAAM,IAAI,IAAI,EAAE,IAAI,IAAI,MAAM,EAAE;AACtC,MAAI,KAAK,IAAI,GAAG,IAAI,MAAO,QAAO;AAClC,QAAM,KAAK,IAAI,MAAM;AACrB,SAAO,OAAO,SAAS,EAAE,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,EAAE,CAAC,IAAI;AAC7D;AAOA,SAAS,cAAc,KAAc,GAAa,IAAS,IAAyC;AACnG,MAAI,OAAO,SAAS,KAAK,GAAG,IAAI,EAAE;AAClC,MAAI,CAAC,SAAS,SAAS,IAAI,SAAS,KAAK,MAAM,CAAC;AAChD,QAAM,SAAS,EAAE,MAAM;AACvB,WAAS,QAAQ,GAAG,QAAQ,aAAa,SAAS;AACjD,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAK,QAAO,CAAC,IAAI,OAAO,MAAM,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;AAClF,UAAM,IAAI,SAAS,KAAK,QAAQ,IAAI,EAAE;AACtC,UAAM,CAAC,GAAG,CAAC,IAAI,SAAS,KAAK,GAAG,MAAM;AACtC,QAAI,IAAI,SAAS;AAChB,aAAO;AACP,gBAAU;AACV,kBAAY;AAAA,IACb,MAAO;AAAA,EACR;AACA,SAAO,CAAC,MAAM,SAAS,SAAS;AACjC;AAOO,SAAS,qBAAqB,QAA0B,QAA2B,IAAW,IAAmD;AACvJ,QAAM,CAAC,OAAO,KAAK,IAAI,cAAc,OAAO,MAAM,GAAG,OAAO,MAAM,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AACnG,SAAO,EAAE,OAAO,MAAM;AACvB;AAEA,SAAS,OAAO,KAAc,IAAS,IAAS,KAAa,KAAqB,OAAe;AAChG,QAAM,IAAI,IAAI;AACd,MAAI,MAAM,GAAG;AACZ,UAAM,IAAI,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI;AACjC,QAAI,KAAK,EAAE,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;AACpF;AAAA,EACD;AACA,QAAM,CAAC,GAAG,KAAK,OAAO,IAAI,cAAc,KAAK,YAAY,GAAG,GAAG,IAAI,EAAE;AACrE,MAAI,OAAO,OAAO,QAAQ,IAAI;AAC7B,QAAI,KAAK,CAAC;AACV;AAAA,EACD;AAEA,QAAM,QAAQ,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,GAAG,OAAO,CAAC;AAClD,QAAM,KAAK,KAAK,IAAI,IAAI,QAAQ,CAAC,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK;AACxD,SAAO,IAAI,MAAM,GAAG,QAAQ,CAAC,GAAG,IAAI,IAAI,KAAK,KAAK,QAAQ,CAAC;AAC3D,SAAO,IAAI,MAAM,KAAK,GAAG,IAAI,IAAI,KAAK,KAAK,QAAQ,CAAC;AACrD;AAOA,SAAS,YAAY,GAAU,GAAU,GAAkC;AAC1E,QAAM,QAAQ,KAAK,IAAI,GAAG,CAAC,CAAC;AAC5B,MAAI,CAAC,EAAG,QAAO;AACf,QAAM,KAAK,KAAK,GAAG,CAAC;AACpB,QAAM,KAAK,KAAK,GAAG,CAAC;AACpB,MAAI,EAAE,KAAK,MAAM,EAAE,KAAK,GAAI,QAAO;AACnC,QAAM,KAAK,EAAE,IAAI,KAAK,OAAO,MAAM,KAAK;AACxC,QAAM,MAAM,KAAK,OAAO,KAAK;AAC7B,QAAM,KAAK,CAAC,MAAM,MAAM,KAAK;AAC7B,QAAM,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC;AAEvF,SAAO,OAAO,SAAS,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM;AACxE;AAQO,SAAS,YAAY,QAA0B,WAAmB,IAAY,IAA4B;AAChH,QAAM,MAAM,MAAM,MAAM;AACxB,QAAM,MAAsB,CAAC;AAC7B,MAAI,IAAI,SAAS,EAAG,QAAO;AAC3B,QAAM,IAAI,IAAI;AACd,QAAM,SAAS,MAAM,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,YAAY,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;AAC1F,QAAM,OAAO,YAAY,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC;AAC3D,QAAM,OAAO,MAAM,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,OAAQ,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAY,CAAC,GAAG,CAAC;AACzF,SAAO,KAAK,OAAO,KAAK,KAAK,IAAI,WAAW,IAAI,GAAG,KAAK,CAAC;AACzD,SAAO;AACR;AAGA,SAAS,QAAQ,GAAU,GAAU,GAAkB;AACtD,QAAM,IAAI,KAAK,IAAI,GAAG,CAAC,CAAC;AACxB,QAAM,IAAI,KAAK,IAAI,GAAG,CAAC,CAAC;AACxB,MAAI,CAAC,KAAK,CAAC,EAAG,QAAO;AACrB,SAAQ,KAAK,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,MAAO,KAAK;AACvE;AAQA,SAAS,YAAY,KAAc,QAAiB,aAAqB,MAAwB;AAChG,QAAM,IAAI,IAAI;AACd,QAAM,KAAK,CAAC,MAAc,IAAI,UAAW,IAAI,IAAK,KAAK,IAAI,CAAC;AAC5D,QAAM,QAAQ,CAAC,GAAW,SAAgC;AACzD,aAAS,IAAI,GAAG,KAAK,SAAS,IAAI,WAAW,KAAK;AACjD,YAAM,IAAI,IAAI,OAAO;AACrB,UAAI,CAAC,WAAW,IAAI,KAAK,KAAK,GAAI,QAAO,IAAI,IAAI,IAAI,OAAO;AAC5D,UAAI,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,KAAM,QAAO;AAAA,IACzC;AACA,WAAO;AAAA,EACR;AACA,QAAM,QAAQ,IAAI,aAAa,CAAC;AAChC,QAAM,UAA8B,CAAC;AACrC,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,YAAQ,KAAK,CAAC,GAAG,CAAC,CAAC;AACnB,QAAI,CAAC,WAAW,MAAM,KAAK,MAAM,IAAI,GAAI;AACzC,UAAM,OAAO,MAAM,GAAG,EAAE;AACxB,UAAM,OAAO,MAAM,GAAG,CAAC;AACvB,QAAI,SAAS,QAAQ,SAAS,KAAM;AACpC,YAAQ,CAAC,IAAI,CAAC,MAAM,IAAI;AACxB,UAAM,CAAC,IAAI,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC;AAAA,EAC9C;AACA,QAAM,UAAoB,CAAC;AAC3B,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,QAAI,EAAE,MAAM,CAAC,IAAI,aAAc;AAC/B,UAAM,CAAC,IAAI,EAAE,IAAI,QAAQ,CAAC;AAC1B,QAAI,WAAW;AACf,aAAS,IAAI,IAAI,KAAK,MAAM,UAAU,KAAK;AAC1C,YAAM,IAAI,UAAW,IAAI,IAAK,KAAK,IAAI;AACvC,UAAI,MAAM,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,KAAM;AAC7C,UAAI,MAAM,CAAC,IAAI,MAAM,CAAC,KAAM,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,IAAI,EAAI,YAAW;AAAA,IACzE;AACA,QAAI,SAAU,SAAQ,KAAK,CAAC;AAAA,EAC7B;AACA,SAAO;AACR;AAMA,SAAS,QAAQ,KAAuB;AACvC,MAAI,IAAI,SAAS,EAAG,QAAO;AAC3B,QAAM,UAAoB,CAAC;AAC3B,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,IAAK,SAAQ,KAAK,KAAK,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAC1E,QAAM,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAChD,QAAM,SAAS,OAAO,OAAO,UAAU,CAAC;AACxC,MAAI,EAAE,SAAS,GAAI,QAAO;AAC1B,QAAM,MAAe,CAAC,IAAI,CAAC,CAAC;AAC5B,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACpC,UAAM,MAAM,QAAQ,IAAI,CAAC;AACzB,QAAI,MAAM,IAAI,QAAQ;AACrB,YAAM,QAAQ,KAAK,IAAI,IAAI,KAAK,KAAK,MAAM,MAAM,CAAC;AAClD,YAAM,IAAI,IAAI,IAAI,CAAC;AACnB,YAAM,IAAI,IAAI,CAAC;AACf,eAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC/B,cAAM,IAAI,IAAI;AACd,YAAI,KAAK,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC;AAAA,MAC9D;AAAA,IACD;AACA,QAAI,KAAK,IAAI,CAAC,CAAC;AAAA,EAChB;AACA,SAAO;AACR;AAUO,SAAS,UAAU,QAA0B,WAAmB,UAA4B,CAAC,GAAmB;AACtH,MAAI,MAAM,MAAM,MAAM;AACtB,QAAM,SAAS,QAAQ,WAAW;AAClC,MAAI,UAAU,IAAI,SAAS,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,SAAS,CAAC,CAAC,KAAK,MAAO,OAAM,IAAI,MAAM,GAAG,EAAE;AACjG,MAAI,IAAI,SAAS,EAAG,QAAO,CAAC;AAC5B,QAAM,MAAM,KAAK,IAAI,WAAW,IAAI;AACpC,QAAM,cAAc,QAAQ,kBAAkB;AAC9C,QAAM,IAAI,IAAI;AACd,QAAM,OAAO,IAAI;AAEjB,MAAI,CAAC,UAAU,IAAI,GAAG;AACrB,UAAMA,WAAU,CAAC,GAAG,GAAI,IAAI,IAAI,YAAY,KAAK,OAAO,aAAa,IAAI,IAAI,CAAC,GAAI,IAAI,CAAC;AACvF,UAAMC,OAAsB,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAID,SAAQ,QAAQ,KAAK;AACxC,YAAM,MAAM,IAAI,MAAMA,SAAQ,IAAI,CAAC,GAAGA,SAAQ,CAAC,IAAI,CAAC;AACpD,MAAAC,KAAI,KAAK,GAAG,YAAY,QAAQ,GAAG,GAAG,GAAG,CAAC;AAAA,IAC3C;AACA,QAAI,UAAU,MAAM,EAAG,CAAAA,KAAI,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;AACrE,WAAOA;AAAA,EACR;AAEA,QAAM,UAAU,YAAY,KAAK,MAAM,aAAa,IAAI;AACxD,MAAI,QAAQ,WAAW,GAAG;AAEzB,UAAM,OAAO,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;AAC5B,UAAM,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;AAEhD,WAAO,YAAY,QAAQ,IAAI,GAAG,KAAK,GAAG,CAAC;AAAA,EAC5C;AACA,QAAM,MAAsB,CAAC;AAC7B,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACxC,UAAM,OAAO,QAAQ,CAAC;AACtB,UAAM,KAAK,SAAS,IAAI,KAAK,QAAQ,MAAM;AAC3C,UAAM,MAAe,CAAC;AACtB,aAAS,IAAI,QAAQ,KAAK,IAAI,KAAK,GAAG;AACrC,UAAI,KAAK,IAAI,CAAC,CAAC;AACf,UAAI,IAAI,SAAS,KAAK,MAAM,GAAI;AAAA,IACjC;AACA,QAAI,KAAK,GAAG,YAAY,QAAQ,GAAG,GAAG,GAAG,CAAC;AAAA,EAC3C;AACA,SAAO;AACR;AAGO,SAAS,gBAAgB,GAAiB,KAAsB;AACtE,QAAM,QAAQ,IAAI,EAAE,IAAI,EAAE,EAAE;AAC5B,QAAM,MAAM,KAAK,MAAM,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AACzC,MAAI,MAAM,MAAO,QAAO,KAAK,EAAE,IAAI,EAAE,EAAE,KAAK,OAAO,KAAK,EAAE,IAAI,EAAE,EAAE,KAAK;AACvE,QAAM,MAAW,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,GAAG;AAChD,SAAO,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,CAAC,MAAM;AAChC,UAAM,IAAI,IAAI,GAAG,EAAE,EAAE;AACrB,UAAM,QAAQ,IAAI,GAAG,GAAG;AACxB,UAAM,SAAS,KAAK,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC;AACrD,WAAO,UAAU,OAAO,SAAS,CAAC,OAAO,SAAS,MAAM;AAAA,EACzD,CAAC;AACF;AAiBO,SAAS,iBACf,UACA,UAAmH,CAAC,GAC3G;AACT,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,QAAM,IAAI,CAAC,MAAc,aAAa,GAAG,QAAQ,aAAa,CAAC;AAC/D,QAAM,KAAK,QAAQ,QAAQ,KAAK;AAChC,QAAM,KAAK,QAAQ,QAAQ,KAAK;AAChC,QAAM,KAAK,CAAC,MAAa,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC;AACxD,QAAM,WAAW,QAAQ,qBAAqB;AAC9C,MAAI,IAAI,IAAI,GAAG,SAAS,CAAC,EAAE,EAAE,CAAC;AAC9B,WAAS,QAAQ,CAAC,GAAG,MAAM;AAC1B,UAAM,OAAO,QAAQ,UAAU,MAAM,SAAS,SAAS;AACvD,QAAI,gBAAgB,GAAG,QAAQ,GAAG;AACjC,UAAI,CAAC,KAAM,MAAK,IAAI,GAAG,EAAE,EAAE,CAAC;AAAA,IAC7B,MAAO,MAAK,IAAI,GAAG,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,EAAE,CAAC;AAAA,EACjD,CAAC;AACD,SAAO,QAAQ,SAAS,GAAG,CAAC,MAAM;AACnC;AAEA,SAAS,mBAAmB,QAA0B,QAAiB,SAAqC;AAC3G,MAAI,OAAO,SAAS,EAAG,QAAO;AAC9B,QAAM,IAAI,CAAC,MAAc,aAAa,GAAG,QAAQ,aAAa,CAAC;AAC/D,QAAM,KAAK,QAAQ,QAAQ,KAAK;AAChC,QAAM,KAAK,QAAQ,QAAQ,KAAK;AAChC,MAAI,IAAI,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AACxD,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAK,MAAK,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AAC7F,SAAO,SAAS,GAAG,CAAC,MAAM;AAC3B;AAQO,SAAS,YAAY,MAAwB,UAA8B,CAAC,GAAW;AAC7F,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,MAAM,MAAM,IAAI;AACtB,QAAM,WAAW,UAAU,KAAK,WAAW,EAAE,GAAG,SAAS,OAAO,CAAC;AACjE,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,QAAM,QAAQ,SAAS,IAAI,SAAS,IAAI,SAAS;AACjD,MAAI,QAAQ,YAAY,OAAO;AAC9B,UAAM,WAAW,SAAS,OAAO,CAAC,MAAM,gBAAgB,GAAG,YAAY,IAAI,CAAC,EAAE;AAE9E,QAAI,SAAS,UAAU,SAAS,aAAa,SAAS,OAAQ,QAAO,mBAAmB,KAAK,QAAQ,OAAO;AAC5G,QAAI,SAAS,SAAS,MAAO,QAAO,mBAAmB,KAAK,QAAQ,OAAO;AAAA,EAC5E;AACA,SAAO,iBAAiB,UAAU;AAAA,IACjC,WAAW,QAAQ;AAAA,IACnB,QAAQ,QAAQ;AAAA,IAChB;AAAA,IACA,mBAAmB,YAAY;AAAA,EAChC,CAAC;AACF;AAOO,SAAS,gBACf,QACA,UAA8C,CAAC,GACtC;AACT,SAAO,YAAY,QAAQ,EAAE,WAAW,GAAG,GAAG,SAAS,QAAQ,MAAM,CAAC;AACvE;;;AC9YO,IAAM,cAAoC,CAAC,QAAQ,WAAW,WAAW,QAAQ,MAAM;AAGvF,SAAS,mBAAmB,OAA2C;AAC7E,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,QAAM,OAAQ,MAA6B;AAC3C,MAAI,CAAC,YAAY,SAAS,IAAiB,EAAG,QAAO;AACrD,SAAO,SAAS,UAAU,OAAQ,MAAoB,MAAM;AAC7D;AAoCA,IAAM,eAAuC,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE;AAG1G,IAAM,cAAN,MAAkB;AAAA,EAEjB,YAA6B,MAAc;AAAd;AAAA,EAAe;AAAA,EAAf;AAAA,EADrB,MAAM;AAAA,EAGN,OAAO;AACd,WAAO,KAAK,MAAM,KAAK,KAAK,UAAU,QAAQ,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,EAAG,MAAK;AAAA,EAC/E;AAAA;AAAA,EAGA,UAAyB;AACxB,SAAK,KAAK;AACV,UAAM,KAAK,KAAK,KAAK,KAAK,GAAG;AAC7B,QAAI,MAAM,yBAAyB,KAAK,EAAE,GAAG;AAC5C,WAAK;AACL,aAAO;AAAA,IACR;AACA,WAAO;AAAA,EACR;AAAA,EAEA,OAAgB;AACf,SAAK,KAAK;AACV,WAAO,KAAK,OAAO,KAAK,KAAK;AAAA,EAC9B;AAAA,EAEA,SAAwB;AACvB,SAAK,KAAK;AACV,UAAM,QAAQ,6CAA6C,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM,EAAE,CAAC;AACxG,QAAI,CAAC,MAAO,QAAO;AACnB,SAAK,OAAO,MAAM,CAAC,EAAE;AACrB,UAAM,QAAQ,OAAO,MAAM,CAAC,CAAC;AAC7B,WAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;AAAA,EACzC;AAAA,EAEA,OAAsB;AACrB,SAAK,KAAK;AACV,UAAM,KAAK,KAAK,KAAK,KAAK,GAAG;AAC7B,QAAI,OAAO,OAAO,OAAO,KAAK;AAC7B,WAAK;AACL,aAAO,OAAO,MAAM,IAAI;AAAA,IACzB;AACA,WAAO;AAAA,EACR;AACD;AAOO,SAAS,aAAa,GAA0B;AACtD,QAAM,UAAU,IAAI,YAAY,KAAK,EAAE;AACvC,QAAM,WAA0B,CAAC;AACjC,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,cAAgE;AACpE,MAAI,UAAU;AAEd,SAAO,CAAC,QAAQ,KAAK,GAAG;AACvB,UAAM,SAAS,QAAQ,QAAQ;AAC/B,QAAI,QAAQ;AACX,gBAAU;AACV,UAAI,YAAY,OAAO,YAAY,KAAK;AACvC,iBAAS,KAAK,EAAE,MAAM,IAAI,CAAC;AAC3B,aAAK;AACL,aAAK;AACL,sBAAc;AACd;AAAA,MACD;AAAA,IACD,WAAW,CAAC,WAAW,YAAY,OAAO,YAAY,KAAK;AAC1D;AAAA,IACD;AACA,UAAM,QAAQ,QAAQ,YAAY;AAClC,UAAM,QAAQ,aAAa,KAAK;AAChC,UAAM,OAAiB,CAAC;AACxB,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC/B,YAAM,QAAQ,UAAU,QAAQ,MAAM,KAAK,MAAM,KAAK,QAAQ,KAAK,IAAI,QAAQ,OAAO;AACtF,UAAI,UAAU,KAAM,QAAO;AAC3B,WAAK,KAAK,KAAK;AAAA,IAChB;AACA,UAAM,MAAM,YAAY,QAAQ,YAAY;AAC5C,UAAM,KAAK,MAAM,KAAK;AACtB,UAAM,KAAK,MAAM,KAAK;AACtB,YAAQ,OAAO;AAAA,MACd,KAAK,KAAK;AACT,aAAK,KAAK,CAAC,IAAI;AACf,aAAK,KAAK,CAAC,IAAI;AACf,iBAAS;AACT,iBAAS;AACT,iBAAS,KAAK,EAAE,MAAM,KAAK,GAAG,IAAI,GAAG,GAAG,CAAC;AACzC,sBAAc;AAEd,kBAAU,MAAM,MAAM;AACtB;AAAA,MACD;AAAA,MACA,KAAK;AACJ,aAAK,KAAK,CAAC,IAAI;AACf,aAAK,KAAK,CAAC,IAAI;AACf,iBAAS,KAAK,EAAE,MAAM,KAAK,GAAG,IAAI,GAAG,GAAG,CAAC;AACzC,sBAAc;AACd;AAAA,MACD,KAAK;AACJ,aAAK,KAAK,CAAC,KAAK,MAAM,KAAK;AAC3B,iBAAS,KAAK,EAAE,MAAM,KAAK,GAAG,IAAI,GAAG,GAAG,CAAC;AACzC,sBAAc;AACd;AAAA,MACD,KAAK;AACJ,aAAK,KAAK,CAAC,KAAK,MAAM,KAAK;AAC3B,iBAAS,KAAK,EAAE,MAAM,KAAK,GAAG,IAAI,GAAG,GAAG,CAAC;AACzC,sBAAc;AACd;AAAA,MACD,KAAK,KAAK;AACT,cAAM,IAAiB;AAAA,UACtB,MAAM;AAAA,UACN,IAAI,KAAK,CAAC,IAAI;AAAA,UACd,IAAI,KAAK,CAAC,IAAI;AAAA,UACd,IAAI,KAAK,CAAC,IAAI;AAAA,UACd,IAAI,KAAK,CAAC,IAAI;AAAA,UACd,GAAG,KAAK,CAAC,IAAI;AAAA,UACb,GAAG,KAAK,CAAC,IAAI;AAAA,QACd;AACA,iBAAS,KAAK,CAAC;AACf,sBAAc,EAAE,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,MAAM,IAAI;AAC5C,aAAK,EAAE;AACP,aAAK,EAAE;AACP;AAAA,MACD;AAAA,MACA,KAAK,KAAK;AACT,cAAM,KAAa,aAAa,SAAS,MAAM,IAAI,KAAK,YAAY,IAAI;AACxE,cAAM,KAAa,aAAa,SAAS,MAAM,IAAI,KAAK,YAAY,IAAI;AACxE,cAAM,IAAiB;AAAA,UACtB,MAAM;AAAA,UACN;AAAA,UACA;AAAA,UACA,IAAI,KAAK,CAAC,IAAI;AAAA,UACd,IAAI,KAAK,CAAC,IAAI;AAAA,UACd,GAAG,KAAK,CAAC,IAAI;AAAA,UACb,GAAG,KAAK,CAAC,IAAI;AAAA,QACd;AACA,iBAAS,KAAK,CAAC;AACf,sBAAc,EAAE,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,MAAM,IAAI;AAC5C,aAAK,EAAE;AACP,aAAK,EAAE;AACP;AAAA,MACD;AAAA,MACA,KAAK,KAAK;AACT,cAAM,IAAiB,EAAE,MAAM,KAAK,IAAI,KAAK,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,GAAG;AACzG,iBAAS,KAAK,CAAC;AACf,sBAAc,EAAE,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,MAAM,IAAI;AAC5C,aAAK,EAAE;AACP,aAAK,EAAE;AACP;AAAA,MACD;AAAA,MACA,KAAK,KAAK;AACT,cAAM,KAAa,aAAa,SAAS,MAAM,IAAI,KAAK,YAAY,IAAI;AACxE,cAAM,KAAa,aAAa,SAAS,MAAM,IAAI,KAAK,YAAY,IAAI;AACxE,cAAM,IAAiB,EAAE,MAAM,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,GAAG;AAC7E,iBAAS,KAAK,CAAC;AACf,sBAAc,EAAE,GAAG,IAAI,GAAG,IAAI,MAAM,IAAI;AACxC,aAAK,EAAE;AACP,aAAK,EAAE;AACP;AAAA,MACD;AAAA,MACA,KAAK,KAAK;AACT,cAAM,IAAiB;AAAA,UACtB,MAAM;AAAA,UACN,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC;AAAA,UACpB,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC;AAAA,UACpB,UAAU,KAAK,CAAC;AAAA,UAChB,UAAU,KAAK,CAAC,MAAM;AAAA,UACtB,OAAO,KAAK,CAAC,MAAM;AAAA,UACnB,GAAG,KAAK,CAAC,IAAI;AAAA,UACb,GAAG,KAAK,CAAC,IAAI;AAAA,QACd;AACA,iBAAS,KAAK,CAAC;AACf,sBAAc;AACd,aAAK,EAAE;AACP,aAAK,EAAE;AACP;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACA,SAAO;AACR;AAMA,SAAS,aAAa,WAAmB,WAAmB,KAAqB;AAChF,MAAI,EAAE,YAAY,GAAI,QAAO;AAC7B,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,YAAY,SAAS,CAAC,CAAC,CAAC;AAC9E;AAEA,SAAS,aACR,KACA,IACA,IACA,IACA,IACA,IACA,GACA,GACA,WACA,KACC;AAED,QAAM,KAAK,KAAK;AAAA,IACf,KAAK,MAAM,GAAG,CAAC,IAAI,IAAI,KAAK,IAAI,GAAG,CAAC,IAAI,IAAI,KAAK,EAAE;AAAA,IACnD,KAAK,MAAM,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,KAAK,CAAC;AAAA,EAC5C;AACA,QAAM,IAAI,aAAc,IAAI,KAAM,GAAG,WAAW,GAAG;AACnD,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC5B,UAAM,IAAI,IAAI;AACd,UAAM,KAAK,IAAI;AACf,UAAM,IAAI,KAAK,KAAK;AACpB,UAAM,IAAI,IAAI,KAAK,KAAK;AACxB,UAAM,IAAI,IAAI,KAAK,IAAI;AACvB,UAAM,IAAI,IAAI,IAAI;AAClB,QAAI,KAAK,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,CAAC,CAAC;AAAA,EACpF;AACD;AAEA,SAAS,iBACR,KACA,IACA,IACA,IACA,GACA,GACA,WACA,KACC;AACD,QAAM,KAAK,KAAK,MAAM,GAAG,CAAC,IAAI,IAAI,KAAK,GAAG,GAAG,CAAC,IAAI,IAAI,KAAK,CAAC;AAC5D,QAAM,IAAI,aAAc,IAAI,KAAM,GAAG,WAAW,GAAG;AACnD,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC5B,UAAM,IAAI,IAAI;AACd,UAAM,KAAK,IAAI;AACf,QAAI,KAAK,CAAC,KAAK,KAAK,GAAG,CAAC,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,KAAK,KAAK,GAAG,CAAC,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC;AAAA,EACxG;AACD;AAEA,SAAS,SAAS,QAAgB,OAAe,WAAmB,KAAqB;AACxF,MAAI,UAAU,UAAW,QAAO,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,EAAE,CAAC;AACtF,QAAM,OAAO,IAAI,KAAK,KAAK,IAAI,YAAY,MAAM;AACjD,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC;AACpE;AAGA,SAAS,WACR,KACA,IACA,KACA,WACA,KACC;AACD,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,MAAI,EAAE,IAAI,GAAG,IAAI;AACjB,QAAM,EAAE,GAAG,EAAE,IAAI;AACjB,MAAI,OAAO,KAAK,OAAO,EAAG;AAC1B,MAAI,OAAO,KAAK,OAAO,GAAG;AACzB,QAAI,KAAK,CAAC,GAAG,CAAC,CAAC;AACf;AAAA,EACD;AACA,QAAM,MAAO,IAAI,WAAW,KAAK,KAAM;AACvC,QAAM,MAAM,KAAK,IAAI,GAAG;AACxB,QAAM,MAAM,KAAK,IAAI,GAAG;AACxB,QAAM,MAAM,KAAK,KAAK;AACtB,QAAM,MAAM,KAAK,KAAK;AACtB,QAAM,MAAM,MAAM,KAAK,MAAM;AAC7B,QAAM,MAAM,CAAC,MAAM,KAAK,MAAM;AAC9B,QAAM,SAAU,MAAM,OAAQ,KAAK,MAAO,MAAM,OAAQ,KAAK;AAC7D,MAAI,SAAS,GAAG;AACf,UAAM,IAAI,KAAK,KAAK,MAAM;AAC1B,UAAM;AACN,UAAM;AAAA,EACP;AACA,QAAM,MAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM;AACtE,QAAM,MAAM,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM;AAClD,MAAI,OAAO,QAAQ,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,MAAM,GAAG,CAAC;AAC3D,MAAI,IAAI,aAAa,IAAI,MAAO,QAAO,CAAC;AACxC,QAAM,MAAO,OAAO,KAAK,MAAO;AAChC,QAAM,MAAO,CAAC,OAAO,KAAK,MAAO;AACjC,QAAM,KAAK,MAAM,MAAM,MAAM,OAAO,KAAK,KAAK;AAC9C,QAAM,KAAK,MAAM,MAAM,MAAM,OAAO,KAAK,KAAK;AAC9C,QAAM,QAAQ,CAAC,IAAY,IAAY,IAAY,OAAe;AACjE,UAAM,IAAI,KAAK,MAAM,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE;AACzD,WAAO;AAAA,EACR;AACA,QAAM,SAAS,MAAM,GAAG,IAAI,MAAM,OAAO,KAAK,MAAM,OAAO,EAAE;AAC7D,MAAI,QAAQ,OAAO,MAAM,OAAO,KAAK,MAAM,OAAO,KAAK,CAAC,MAAM,OAAO,KAAK,CAAC,MAAM,OAAO,EAAE;AAC1F,MAAI,CAAC,IAAI,SAAS,QAAQ,EAAG,UAAS,IAAI,KAAK;AAAA,WACtC,IAAI,SAAS,QAAQ,EAAG,UAAS,IAAI,KAAK;AACnD,QAAM,IAAI,SAAS,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,WAAW,GAAG;AAC1D,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,UAAM,IAAI,SAAU,QAAQ,IAAK;AACjC,UAAM,KAAK,KAAK,KAAK,IAAI,CAAC;AAC1B,UAAM,KAAK,KAAK,KAAK,IAAI,CAAC;AAC1B,QAAI,KAAK,CAAC,MAAM,KAAK,MAAM,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK,EAAE,CAAC;AAAA,EAC9D;AACA,MAAI,KAAK,CAAC,GAAG,CAAC,CAAC;AAChB;AAMO,SAAS,eAAe,GAA2B,UAA0B,CAAC,GAAkB;AACtG,QAAM,YAAY,QAAQ,aAAa,QAAQ,YAAY,IAAI,QAAQ,YAAY;AACnF,QAAM,MAAM,QAAQ,eAAe;AACnC,QAAM,WAAW,OAAO,MAAM,WAAW,aAAa,CAAC,IAAI;AAC3D,QAAM,QAAuB,CAAC;AAC9B,MAAI,UAAmB,CAAC;AACxB,MAAI,QAAe,CAAC,GAAG,CAAC;AACxB,QAAM,QAAQ,MAAM;AACnB,QAAI,QAAQ,UAAU,EAAG,OAAM,KAAK,OAAO;AAC3C,cAAU,CAAC;AAAA,EACZ;AACA,QAAM,OAAO,MAAa,QAAQ,QAAQ,SAAS,CAAC,KAAK;AACzD,aAAW,OAAO,UAAU;AAC3B,YAAQ,IAAI,MAAM;AAAA,MACjB,KAAK;AACJ,cAAM;AACN,gBAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;AACrB,kBAAU,CAAC,KAAK;AAChB;AAAA,MACD,KAAK;AACJ,YAAI,QAAQ,WAAW,EAAG,WAAU,CAAC,KAAK;AAC1C,gBAAQ,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;AAC3B;AAAA,MACD,KAAK;AACJ,YAAI,QAAQ,WAAW,EAAG,WAAU,CAAC,KAAK;AAC1C,qBAAa,SAAS,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,WAAW,GAAG;AAC1F;AAAA,MACD,KAAK;AACJ,YAAI,QAAQ,WAAW,EAAG,WAAU,CAAC,KAAK;AAC1C,yBAAiB,SAAS,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,WAAW,GAAG;AAC9E;AAAA,MACD,KAAK;AACJ,YAAI,QAAQ,WAAW,EAAG,WAAU,CAAC,KAAK;AAC1C,mBAAW,SAAS,KAAK,GAAG,KAAK,WAAW,GAAG;AAC/C;AAAA,MACD,KAAK;AACJ,cAAM;AAEN;AAAA,IACF;AAAA,EACD;AACA,QAAM;AACN,SAAO,MAAM,IAAI,UAAU,EAAE,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC;AACzD;AAEA,SAAS,WAAW,MAAwB;AAC3C,QAAM,MAAe,CAAC;AACtB,aAAW,KAAK,MAAM;AACrB,UAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QAAI,CAAC,QAAQ,KAAK,CAAC,MAAM,EAAE,CAAC,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC,EAAG,KAAI,KAAK,CAAC;AAAA,EAC9D;AACA,SAAO,IAAI,SAAS,KAAK,IAAI,CAAC,EAAE,CAAC,MAAM,IAAI,IAAI,SAAS,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,MAAM,IAAI,IAAI,SAAS,CAAC,EAAE,CAAC,EAAG,KAAI,IAAI;AAC/G,SAAO;AACR;AAMA,SAAS,YAAY,OAAkB,OAAe,QAAkD;AACvG,QAAM,MAAM,MAAM,gBAAgB;AAClC,MAAI,SAAS,OAAO,QAAQ,WAAW,CAAC,KAAK,KAAK,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG,GAAG;AAAA,IAAI,CAAC,MAC5E,OAAO,SAAS,CAAC,KAAK,IAAI,IAAI,IAAI;AAAA,EACnC;AAEA,QAAM,SAAS,KAAK;AAAA,IACnB;AAAA,IACA,QAAQ,KAAK,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,KAAK;AAAA,IAC3C,SAAS,KAAK,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,KAAK;AAAA,IAC5C,QAAQ,KAAK,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,KAAK;AAAA,IAC3C,SAAS,KAAK,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,KAAK;AAAA,EAC7C;AACA,MAAI,SAAS,EAAG,SAAQ,MAAM,IAAI,CAAC,MAAM,IAAI,MAAM;AACnD,SAAO;AACR;AAGA,SAAS,gBAAgB,OAAe,OAAsB,OAAe,QAAyB;AACrG,QAAM,MAAe,CAAC;AACtB,QAAM,QAAQ,UAAU,OAAO,QAAQ,QAAQ;AAC/C,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC/B,UAAM,QAAQ,CAAC,KAAK,KAAK,IAAK,IAAI,IAAI,KAAK,KAAM;AACjD,UAAM,IAAI,UAAU,QAAQ,IAAI,MAAM,IAAI,QAAQ;AAClD,QAAI,KAAK,CAAC,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC;AAAA,EACpD;AACA,MAAI,OAAO;AACX,MAAI,OAAO;AACX,MAAI,OAAO;AACX,MAAI,OAAO;AACX,aAAW,CAAC,GAAG,CAAC,KAAK,KAAK;AACzB,WAAO,KAAK,IAAI,MAAM,CAAC;AACvB,WAAO,KAAK,IAAI,MAAM,CAAC;AACvB,WAAO,KAAK,IAAI,MAAM,CAAC;AACvB,WAAO,KAAK,IAAI,MAAM,CAAC;AAAA,EACxB;AACA,QAAM,KAAK,SAAS,OAAO,QAAQ;AACnC,QAAM,KAAK,UAAU,OAAO,QAAQ;AACpC,SAAO,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,QAAQ,KAAK,IAAI,QAAQ,EAAE,CAAC;AAC9D;AAEA,SAAS,kBAAkB,OAAyB,MAA+C;AAClG,QAAM,MAAM,MAAM,YAAY;AAC9B,MAAI,CAAC,OAAO,CAAC,OAAO,SAAS,GAAG,EAAG,QAAO;AAC1C,QAAM,MAAO,MAAM,KAAK,KAAM;AAC9B,QAAM,MAAM,KAAK,IAAI,GAAG;AACxB,QAAM,MAAM,KAAK,IAAI,GAAG;AACxB,QAAM,KAAK,KAAK,QAAQ;AACxB,QAAM,KAAK,KAAK,SAAS;AACzB,SAAO,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,OAAO,IAAI,MAAM,KAAK,MAAM,IAAI,MAAM,OAAO,IAAI,MAAM,GAAG;AAC/F;AAOO,SAAS,YACf,OACA,MAC+D;AAC/D,QAAM,EAAE,OAAO,GAAG,QAAQ,EAAE,IAAI;AAChC,QAAM,IAAI,CAAC,MAAcC,cAAa,GAAG,CAAC;AAC1C,QAAM,aAAuB,CAAC;AAC9B,MAAI,MAAM,SAAU,YAAW,KAAK,UAAU,EAAE,MAAM,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG;AAC1F,MAAI,IAAI;AACR,MAAI,WAA4B;AAChC,UAAQ,MAAM,MAAM;AAAA,IACnB,KAAK,QAAQ;AACZ,YAAM,CAAC,IAAI,IAAI,IAAI,EAAE,IAAI,YAAY,OAAO,GAAG,CAAC;AAChD,UAAI,KAAK,KAAK,KAAK,OAAO,GAAG;AAC5B,YAAI,QAAQ,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AAAA,MACzB,OAAO;AACN,cAAM,MAAM,CAAC,GAAW,GAAW,MAAe,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK;AACrG,YACC,IAAI,EAAE,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,IACvE,EAAE,EAAE,CAAC,GAAG,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,CAAC;AAAA,MAC1D;AACA;AAAA,IACD;AAAA,IACA,KAAK,WAAW;AACf,YAAM,KAAK,IAAI;AACf,YAAM,KAAK,IAAI;AACf,UAAI,MAAM,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,EAAE,EAAE,CAAC;AAC3F;AAAA,IACD;AAAA,IACA,KAAK;AAAA,IACL,KAAK,QAAQ;AACZ,YAAM,SACL,MAAM,SAAS,YACZ,gBAAgB,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM,SAAS,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,IACrE,gBAAgB,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM,UAAU,CAAC,CAAC,GAAG,WAAW,MAAM,WAAW,GAAG,GAAG,CAAC;AACnG,UAAI,YAAY,CAAC,MAAM,GAAG,CAAC;AAC3B;AAAA,IACD;AAAA,IACA,KAAK,QAAQ;AACZ,UAAI,MAAM;AACV,iBAAW,MAAM,YAAY;AAC7B,YAAM,KAAK,aAAa,MAAM,OAAO;AACrC,UAAI,IAAI;AACP,mBAAW;AAAA,UACV,SAAS,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;AAAA,UACrC,aAAa,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAAA,QACpC;AAAA,MACD;AACA;AAAA,IACD;AAAA,EACD;AACA,SAAO,WAAW,SAAS,IAAI,EAAE,GAAG,WAAW,WAAW,KAAK,GAAG,GAAG,SAAS,IAAI,EAAE,GAAG,SAAS;AACjG;AAiCO,SAAS,mBACf,OACA,OAA2B,CAAC,GAC5B,UAAqC,CAAC,GACpB;AAClB,QAAM,KAAK,MAAM,SAAS,SAAS,aAAa,MAAM,OAAO,IAAI;AACjE,QAAM,QAAQ,KAAK,SAAS,KAAK,QAAQ,IAAI,KAAK,QAAQ,KAAK,GAAG,CAAC,IAAI;AACvE,QAAM,SAAS,KAAK,UAAU,KAAK,SAAS,IAAI,KAAK,SAAS,KAAK,GAAG,CAAC,IAAI;AAC3E,QAAM,MAAM,YAAY,OAAO,EAAE,OAAO,OAAO,CAAC;AAEhD,QAAM,SAAS,QAAQ,MAAM,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,CAAC;AAGlE,MAAI,UAAU;AACd,MAAI;AACJ,QAAM,UAAU,MAAM,gBAAgB,MAAM;AAC5C,QAAM,uBAAuB,sBAAsB,OAAO;AAC1D,MAAI,sBAAsB;AACzB,UAAM,SAAS,cAAc,MAAM;AACnC,sBAAkB,iBAAiB,sBAAsB,MAAM;AAC/D,cAAU,QAAQ,MAAM;AAAA,EACzB,WAAW,OAAO,MAAM,SAAS,UAAU;AAC1C,cAAU,MAAM;AAAA,EACjB,WAAW,MAAM,SAAS,QAAW;AACpC,cAAU;AAAA,EACX;AAGA,MAAI,YAAY;AAChB,MAAI;AACJ,QAAM,YAAY,MAAM,kBAAkB,MAAM;AAChD,QAAM,yBAAyB,sBAAsB,SAAS;AAC9D,MAAI,wBAAwB;AAC3B,UAAM,SAAS,gBAAgB,MAAM;AACrC,wBAAoB,iBAAiB,wBAAwB,MAAM;AACnE,gBAAY,QAAQ,MAAM;AAAA,EAC3B,WAAW,OAAO,MAAM,WAAW,UAAU;AAC5C,gBAAY,MAAM;AAAA,EACnB,WAAW,MAAM,WAAW,QAAW;AACtC,gBAAY;AAAA,EACb;AAEA,QAAM,OAAwB;AAAA,IAC7B,SAAS,OAAOA,cAAa,OAAO,CAAC,CAAC,IAAIA,cAAa,QAAQ,CAAC,CAAC;AAAA,IACjE;AAAA,IACA;AAAA,IACA,GAAG,IAAI;AAAA,IACP,UAAU,IAAI;AAAA,IACd,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,aAAa,MAAM,eAAe;AAAA,EACnC;AACA,MAAI,IAAI,UAAW,MAAK,YAAY,IAAI;AACxC,MAAI,MAAM,YAAY,OAAW,MAAK,UAAU,MAAM;AACtD,MAAI,MAAM,cAAe,MAAK,gBAAgB,MAAM;AACpD,MAAI,MAAM,eAAgB,MAAK,iBAAiB,MAAM;AACtD,MAAI,gBAAiB,MAAK,eAAe;AACzC,MAAI,kBAAmB,MAAK,iBAAiB;AAC7C,SAAO;AACR;AAEA,SAAS,WAAW,OAAmC;AACtD,MAAI,UAAU,UAAa,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AAC3D,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,MAAM,KAAK,CAAC;AACzC;AAEA,SAAS,aAAa,IAA4E;AACjG,MAAI,CAAC,MAAM,GAAG,WAAW,KAAK,CAAC,GAAG,MAAM,OAAO,QAAQ,KAAK,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,EAAG,QAAO;AAC7F,SAAO;AACR;AAMO,SAAS,eACf,OACA,MACA,UAA0B,CAAC,GAC2B;AACtD,QAAM,EAAE,OAAO,GAAG,QAAQ,EAAE,IAAI;AAChC,MAAI,EAAE,IAAI,MAAM,EAAE,IAAI,GAAI,QAAO,EAAE,OAAO,CAAC,GAAG,UAAU,UAAU;AAClE,MAAI;AACJ,MAAI,WAA4B;AAChC,MAAI,MAAM,SAAS,QAAQ;AAC1B,eAAW,MAAM,YAAY;AAC7B,UAAM,KAAK,aAAa,MAAM,OAAO;AACrC,QAAI,IAAI;AACP,YAAM,KAAK,IAAI,GAAG,CAAC;AACnB,YAAM,KAAK,IAAI,GAAG,CAAC;AAEnB,YAAM,aAAa,QAAQ,aAAa,QAAQ,KAAK,IAAI,IAAI,EAAE;AAC/D,cAAQ,eAAe,MAAM,GAAG,EAAE,GAAG,SAAS,UAAU,CAAC,EAAE;AAAA,QAAI,CAAC,SAC/D,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,KAAK,KAAK,IAAI,GAAG,CAAC,KAAK,EAAE,CAAU;AAAA,MACnE;AAAA,IACD,OAAO;AACN,cAAQ,eAAe,MAAM,GAAG,OAAO;AAAA,IACxC;AAAA,EACD,OAAO;AACN,UAAM,EAAE,EAAE,IAAI,YAAY,EAAE,GAAG,OAAO,UAAU,EAAE,GAAG,IAAI;AACzD,YAAQ,eAAe,GAAG,OAAO;AAAA,EAClC;AACA,QAAM,SAAS,kBAAkB,OAAO,IAAI;AAC5C,MAAI,OAAQ,SAAQ,MAAM,IAAI,CAAC,SAAS,KAAK,IAAI,MAAM,CAAC;AACxD,SAAO,EAAE,OAAO,SAAS;AAC1B;AAOO,SAASA,cAAa,OAAe,YAAY,GAAW;AAClE,QAAM,SAAS,MAAM;AACrB,QAAM,UAAU,KAAK,MAAM,QAAQ,MAAM,IAAI;AAC7C,SAAO,OAAO,GAAG,SAAS,EAAE,IAAI,MAAM,OAAO,OAAO;AACrD;AAEA,SAAS,YAAY,OAAsC,GAAkC;AAC5F,MAAI,IAAI;AACR,aAAW,QAAQ,OAAO;AACzB,QAAI,KAAK,SAAS,EAAG;AACrB,SAAK,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;AACvC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,MAAK,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;AAC7E,SAAK;AAAA,EACN;AACA,SAAO;AACR;AAGA,SAAS,gBAAgB,GAAU,GAAU,GAAkB;AAC9D,QAAM,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AACrB,QAAM,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AACrB,QAAM,OAAO,KAAK,KAAK,KAAK;AAC5B,MAAI,SAAS,EAAG,QAAO,KAAK,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAC1D,QAAM,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,IAAI,CAAC;AACnF,SAAO,KAAK,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,IAAI,IAAI,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC,IAAI,IAAI,GAAG;AACjE;AAEA,SAAS,IAAI,QAAiB,WAA4B;AACzD,MAAI,OAAO,UAAU,EAAG,QAAO;AAC/B,QAAM,OAAO,IAAI,WAAW,OAAO,MAAM;AACzC,OAAK,CAAC,IAAI;AACV,OAAK,OAAO,SAAS,CAAC,IAAI;AAC1B,QAAM,QAA4B,CAAC,CAAC,GAAG,OAAO,SAAS,CAAC,CAAC;AACzD,SAAO,MAAM,QAAQ;AACpB,UAAM,CAAC,GAAG,CAAC,IAAI,MAAM,IAAI;AACzB,QAAI,UAAU;AACd,QAAI,QAAQ;AACZ,aAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC/B,YAAMC,QAAO,gBAAgB,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AAC5D,UAAIA,QAAO,SAAS;AACnB,kBAAUA;AACV,gBAAQ;AAAA,MACT;AAAA,IACD;AACA,QAAI,UAAU,MAAM,UAAU,WAAW;AACxC,WAAK,KAAK,IAAI;AACd,YAAM,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;AAAA,IAClC;AAAA,EACD;AACA,SAAO,OAAO,OAAO,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC;AACvC;AAMO,SAAS,aAAa,MAAwB,WAA4B;AAChF,MAAI,KAAK,UAAU,KAAK,EAAE,YAAY,GAAI,QAAO,CAAC,GAAG,IAAI;AAEzD,MAAI,MAAM;AACV,MAAI,UAAU;AACd,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACrC,UAAMA,QAAO,KAAK,MAAM,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC;AACxE,QAAIA,QAAO,SAAS;AACnB,gBAAUA;AACV,YAAM;AAAA,IACP;AAAA,EACD;AACA,QAAM,QAAQ,IAAI,KAAK,MAAM,GAAG,MAAM,CAAC,GAAc,SAAS;AAC9D,QAAM,SAAS,IAAI,CAAC,GAAG,KAAK,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,GAAc,SAAS;AACtE,QAAM,MAAM,CAAC,GAAG,MAAM,MAAM,GAAG,EAAE,GAAG,GAAG,OAAO,MAAM,GAAG,EAAE,CAAC;AAC1D,SAAO,IAAI,UAAU,IAAI,MAAM,CAAC;AACjC;AAyBO,SAAS,iBAAiB,OAAqC,UAAgC,CAAC,GAAW;AACjH,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,IAAI,CAAC,MAAcD,cAAa,GAAG,SAAS;AAClD,QAAM,KAAK,QAAQ,QAAQ,KAAK;AAChC,QAAM,KAAK,QAAQ,QAAQ,KAAK;AAChC,QAAM,QAAmB,CAAC;AAC1B,QAAM,MAAM,QAAQ,WAAW;AAC/B,MAAI,SAAS;AACb,aAAW,QAAQ,OAAgB;AAClC,UAAM,OACL,KAAK,SAAS,KAAK,MAAM,QAAQ,KAAK,CAAC,CAAC,KAAK,MAAM,QAAQ,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,CAAC,IAAI;AACtF,eAAW,QAAQ,MAAM;AACxB,UAAI,IAAI;AACR,UAAI,QAAQ,YAAY,QAAQ,WAAW,EAAG,KAAI,aAAa,GAAG,QAAQ,QAAQ;AAClF,UAAI,EAAE,SAAS,EAAG;AAClB,UAAI,KAAK;AACR,kBAAU,YAAY,GAAG;AAAA,UACxB,WAAW,QAAQ,kBAAkB;AAAA,UACrC,gBAAgB,QAAQ;AAAA,UACxB;AAAA,UACA,QAAQ,EAAE,GAAG,IAAI,GAAG,GAAG;AAAA,QACxB,CAAC;AACD;AAAA,MACD;AACA,YAAM,KAAK,MAAM,KAAK,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,EAAE,CAAU,IAAI,CAAC;AAAA,IACvE;AAAA,EACD;AACA,SAAO,MAAM,SAAS,YAAY,OAAO,CAAC;AAC3C;","names":["corners","out","formatNumber","dist"]}

package/dist/evaluate-2S3vSPLy.d.cts

@@ -1,55 +0,0 @@
-import { b as AnimationEasing } from './easing-lM0Xo9Ni.cjs';
-
-/**
- * Keyframe tracks, independent of what they animate: each track is a list of keyframes
- * `{ time (ms), value, easing }`, where the easing governs the segment *leaving* the keyframe
- * (filmcraft / After Effects convention).
- */
-/** Keyframe times closer than this (ms) are the same time. */
-declare const ANIMATION_TIME_EPSILON = 0.000001;
-/** A keyframe value: a number, or a CSS colour for colour properties. */
-type AnimationValue = number | string;
-interface AnimationKeyframe {
-    /** Time in milliseconds from the start of the timeline. */
-    time: number;
-    value: AnimationValue;
-    /** Easing of the segment from this keyframe to the next (default `linear`). */
-    easing?: AnimationEasing;
-}
-interface AnimationTrack {
-    keyframes: AnimationKeyframe[];
-    /** Disabled tracks keep their keyframes but do not animate (default `true`). */
-    enabled?: boolean;
-}
-/** How a track's values interpolate: numbers linearly, colours in OKLab. */
-type AnimationValueType = 'number' | 'color';
-/** Whether `value` is a well-formed keyframe. */
-declare function isAnimationKeyframe(value: unknown): value is AnimationKeyframe;
-/**
- * Keyframes sorted by time, invalid entries dropped and duplicate times merged (the *later*
- * entry in the array wins, so appending a keyframe replaces one at the same time). Cached per
- * array (revalidated by element identity), so evaluating every frame does not re-sort; treat
- * keyframe objects as immutable.
- */
-declare function normalizeKeyframes(keyframes: readonly AnimationKeyframe[] | undefined | null): AnimationKeyframe[];
-
-/** How time past the end of the timeline maps back into it. */
-type AnimationLoopMode = 'none' | 'loop' | 'ping-pong';
-/**
- * Interpolates between two keyframe values: numbers linearly, colours in OKLab (premultiplied
- * alpha). Mismatched or unreadable values hold `from` until `t` reaches 1.
- */
-declare function interpolateAnimationValue(from: AnimationValue, to: AnimationValue, t: number, type?: AnimationValueType): AnimationValue;
-/**
- * A track's value at `time`. Before the first keyframe it holds the first value, after the
- * last the last value. Keyframes may be unsorted or share times (see `normalizeKeyframes`).
- * Returns `undefined` for a track without valid keyframes.
- */
-declare function evaluateTrack(track: AnimationTrack | readonly AnimationKeyframe[] | undefined | null, time: number, type?: AnimationValueType): AnimationValue | undefined;
-/**
- * Maps a running time onto the timeline `[0, duration]`: clamped (`none`), wrapped (`loop`)
- * or bounced (`ping-pong`).
- */
-declare function wrapAnimationTime(time: number, duration: number, loop?: AnimationLoopMode): number;
-
-export { ANIMATION_TIME_EPSILON as A, type AnimationKeyframe as a, type AnimationLoopMode as b, type AnimationTrack as c, type AnimationValue as d, type AnimationValueType as e, evaluateTrack as f, isAnimationKeyframe as g, interpolateAnimationValue as i, normalizeKeyframes as n, wrapAnimationTime as w };

package/dist/evaluate-CfmT6xA3.d.ts

@@ -1,55 +0,0 @@
-import { b as AnimationEasing } from './easing-lM0Xo9Ni.js';
-
-/**
- * Keyframe tracks, independent of what they animate: each track is a list of keyframes
- * `{ time (ms), value, easing }`, where the easing governs the segment *leaving* the keyframe
- * (filmcraft / After Effects convention).
- */
-/** Keyframe times closer than this (ms) are the same time. */
-declare const ANIMATION_TIME_EPSILON = 0.000001;
-/** A keyframe value: a number, or a CSS colour for colour properties. */
-type AnimationValue = number | string;
-interface AnimationKeyframe {
-    /** Time in milliseconds from the start of the timeline. */
-    time: number;
-    value: AnimationValue;
-    /** Easing of the segment from this keyframe to the next (default `linear`). */
-    easing?: AnimationEasing;
-}
-interface AnimationTrack {
-    keyframes: AnimationKeyframe[];
-    /** Disabled tracks keep their keyframes but do not animate (default `true`). */
-    enabled?: boolean;
-}
-/** How a track's values interpolate: numbers linearly, colours in OKLab. */
-type AnimationValueType = 'number' | 'color';
-/** Whether `value` is a well-formed keyframe. */
-declare function isAnimationKeyframe(value: unknown): value is AnimationKeyframe;
-/**
- * Keyframes sorted by time, invalid entries dropped and duplicate times merged (the *later*
- * entry in the array wins, so appending a keyframe replaces one at the same time). Cached per
- * array (revalidated by element identity), so evaluating every frame does not re-sort; treat
- * keyframe objects as immutable.
- */
-declare function normalizeKeyframes(keyframes: readonly AnimationKeyframe[] | undefined | null): AnimationKeyframe[];
-
-/** How time past the end of the timeline maps back into it. */
-type AnimationLoopMode = 'none' | 'loop' | 'ping-pong';
-/**
- * Interpolates between two keyframe values: numbers linearly, colours in OKLab (premultiplied
- * alpha). Mismatched or unreadable values hold `from` until `t` reaches 1.
- */
-declare function interpolateAnimationValue(from: AnimationValue, to: AnimationValue, t: number, type?: AnimationValueType): AnimationValue;
-/**
- * A track's value at `time`. Before the first keyframe it holds the first value, after the
- * last the last value. Keyframes may be unsorted or share times (see `normalizeKeyframes`).
- * Returns `undefined` for a track without valid keyframes.
- */
-declare function evaluateTrack(track: AnimationTrack | readonly AnimationKeyframe[] | undefined | null, time: number, type?: AnimationValueType): AnimationValue | undefined;
-/**
- * Maps a running time onto the timeline `[0, duration]`: clamped (`none`), wrapped (`loop`)
- * or bounced (`ping-pong`).
- */
-declare function wrapAnimationTime(time: number, duration: number, loop?: AnimationLoopMode): number;
-
-export { ANIMATION_TIME_EPSILON as A, type AnimationKeyframe as a, type AnimationLoopMode as b, type AnimationTrack as c, type AnimationValue as d, type AnimationValueType as e, evaluateTrack as f, isAnimationKeyframe as g, interpolateAnimationValue as i, normalizeKeyframes as n, wrapAnimationTime as w };

package/dist/gradient-KDfCvhuj.d.cts

@@ -1,66 +0,0 @@
-/**
- * Canvas gradient models, parsing, presets, and SVG defs generation.
- * Supports linear and radial gradients for shape fills, strokes, and freehand drawing.
- */
-interface GradientStop {
-    offset: number;
-    color: string;
-    opacity?: number;
-}
-interface CanvasLinearGradient {
-    type: 'linear';
-    angle?: number;
-    stops: GradientStop[];
-}
-interface CanvasRadialGradient {
-    type: 'radial';
-    cx?: number;
-    cy?: number;
-    r?: number;
-    stops: GradientStop[];
-}
-type CanvasGradientDef = CanvasLinearGradient | CanvasRadialGradient;
-interface SvgGradientStop {
-    offset: string;
-    stopColor: string;
-    stopOpacity?: number;
-}
-interface SvgGradientDef {
-    id: string;
-    type: 'linear' | 'radial';
-    attrs: Record<string, string | number>;
-    stops: SvgGradientStop[];
-}
-declare const PIXERATE_BRAND_GRADIENT: CanvasLinearGradient;
-declare const CANVAS_GRADIENT_PRESETS: Record<string, CanvasLinearGradient>;
-/** Whether an arbitrary value matches a CanvasGradientDef object. */
-declare function isCanvasGradient(value: unknown): value is CanvasGradientDef;
-/**
- * Parses CSS linear-gradient or radial-gradient strings into CanvasGradientDef.
- * Supports forms like:
- * - linear-gradient(90deg, #ff0000 0%, #0000ff 100%)
- * - linear-gradient(to right, red, blue)
- * - radial-gradient(circle, red 0%, blue 100%)
- */
-declare function parseCssGradient(css: string): CanvasGradientDef | null;
-/**
- * Resolves a paint value (which could be a CSS color, preset name, CSS gradient string, or CanvasGradientDef)
- * into either a CanvasGradientDef (if gradient) or null (if solid color or invalid).
- */
-declare function resolveCanvasGradient(value: unknown): CanvasGradientDef | null;
-/**
- * Converts degrees clockwise (CSS angle: 0 = top, 90 = right, 180 = bottom, 270 = left)
- * to SVG linearGradient vector coordinates (x1, y1, x2, y2) normalized [0, 1].
- */
-declare function angleToSvgLinearCoords(angleDeg?: number): {
-    x1: number;
-    y1: number;
-    x2: number;
-    y2: number;
-};
-/**
- * Converts a CanvasGradientDef to an SvgGradientDef descriptor ready for rendering `<linearGradient>` / `<radialGradient>`.
- */
-declare function gradientToSvgDef(gradient: CanvasGradientDef, id: string): SvgGradientDef;
-
-export { type CanvasGradientDef as C, type GradientStop as G, PIXERATE_BRAND_GRADIENT as P, type SvgGradientDef as S, CANVAS_GRADIENT_PRESETS as a, type CanvasLinearGradient as b, type CanvasRadialGradient as c, type SvgGradientStop as d, angleToSvgLinearCoords as e, gradientToSvgDef as g, isCanvasGradient as i, parseCssGradient as p, resolveCanvasGradient as r };

package/dist/gradient-KDfCvhuj.d.ts

@@ -1,66 +0,0 @@
-/**
- * Canvas gradient models, parsing, presets, and SVG defs generation.
- * Supports linear and radial gradients for shape fills, strokes, and freehand drawing.
- */
-interface GradientStop {
-    offset: number;
-    color: string;
-    opacity?: number;
-}
-interface CanvasLinearGradient {
-    type: 'linear';
-    angle?: number;
-    stops: GradientStop[];
-}
-interface CanvasRadialGradient {
-    type: 'radial';
-    cx?: number;
-    cy?: number;
-    r?: number;
-    stops: GradientStop[];
-}
-type CanvasGradientDef = CanvasLinearGradient | CanvasRadialGradient;
-interface SvgGradientStop {
-    offset: string;
-    stopColor: string;
-    stopOpacity?: number;
-}
-interface SvgGradientDef {
-    id: string;
-    type: 'linear' | 'radial';
-    attrs: Record<string, string | number>;
-    stops: SvgGradientStop[];
-}
-declare const PIXERATE_BRAND_GRADIENT: CanvasLinearGradient;
-declare const CANVAS_GRADIENT_PRESETS: Record<string, CanvasLinearGradient>;
-/** Whether an arbitrary value matches a CanvasGradientDef object. */
-declare function isCanvasGradient(value: unknown): value is CanvasGradientDef;
-/**
- * Parses CSS linear-gradient or radial-gradient strings into CanvasGradientDef.
- * Supports forms like:
- * - linear-gradient(90deg, #ff0000 0%, #0000ff 100%)
- * - linear-gradient(to right, red, blue)
- * - radial-gradient(circle, red 0%, blue 100%)
- */
-declare function parseCssGradient(css: string): CanvasGradientDef | null;
-/**
- * Resolves a paint value (which could be a CSS color, preset name, CSS gradient string, or CanvasGradientDef)
- * into either a CanvasGradientDef (if gradient) or null (if solid color or invalid).
- */
-declare function resolveCanvasGradient(value: unknown): CanvasGradientDef | null;
-/**
- * Converts degrees clockwise (CSS angle: 0 = top, 90 = right, 180 = bottom, 270 = left)
- * to SVG linearGradient vector coordinates (x1, y1, x2, y2) normalized [0, 1].
- */
-declare function angleToSvgLinearCoords(angleDeg?: number): {
-    x1: number;
-    y1: number;
-    x2: number;
-    y2: number;
-};
-/**
- * Converts a CanvasGradientDef to an SvgGradientDef descriptor ready for rendering `<linearGradient>` / `<radialGradient>`.
- */
-declare function gradientToSvgDef(gradient: CanvasGradientDef, id: string): SvgGradientDef;
-
-export { type CanvasGradientDef as C, type GradientStop as G, PIXERATE_BRAND_GRADIENT as P, type SvgGradientDef as S, CANVAS_GRADIENT_PRESETS as a, type CanvasLinearGradient as b, type CanvasRadialGradient as c, type SvgGradientStop as d, angleToSvgLinearCoords as e, gradientToSvgDef as g, isCanvasGradient as i, parseCssGradient as p, resolveCanvasGradient as r };