domflax 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +214 -0
- package/dist/chunk-4HHISSMR.js +2227 -0
- package/dist/chunk-4HHISSMR.js.map +1 -0
- package/dist/chunk-6WVVF6AD.js +55 -0
- package/dist/chunk-6WVVF6AD.js.map +1 -0
- package/dist/chunk-77SLHRN6.js +2047 -0
- package/dist/chunk-77SLHRN6.js.map +1 -0
- package/dist/chunk-ZJ2S36GY.js +175 -0
- package/dist/chunk-ZJ2S36GY.js.map +1 -0
- package/dist/cli.cjs +5207 -0
- package/dist/cli.cjs.map +1 -0
- package/dist/cli.d.cts +1 -0
- package/dist/cli.d.ts +1 -0
- package/dist/cli.js +1310 -0
- package/dist/cli.js.map +1 -0
- package/dist/index.cjs +4383 -0
- package/dist/index.cjs.map +1 -0
- package/dist/index.d.cts +539 -0
- package/dist/index.d.ts +539 -0
- package/dist/index.js +110 -0
- package/dist/index.js.map +1 -0
- package/dist/pattern-CX6iBzTD.d.ts +237 -0
- package/dist/pattern-P4FIKAUB.d.cts +237 -0
- package/dist/pattern-kit.cjs +630 -0
- package/dist/pattern-kit.cjs.map +1 -0
- package/dist/pattern-kit.d.cts +80 -0
- package/dist/pattern-kit.d.ts +80 -0
- package/dist/pattern-kit.js +55 -0
- package/dist/pattern-kit.js.map +1 -0
- package/dist/types-BQ7l6dVe.d.cts +749 -0
- package/dist/types-BQ7l6dVe.d.ts +749 -0
- package/dist/verify.cjs +2747 -0
- package/dist/verify.cjs.map +1 -0
- package/dist/verify.d.cts +245 -0
- package/dist/verify.d.ts +245 -0
- package/dist/verify.js +2700 -0
- package/dist/verify.js.map +1 -0
- package/dist/webpack-loader.cjs +4149 -0
- package/dist/webpack-loader.cjs.map +1 -0
- package/dist/webpack-loader.d.cts +21 -0
- package/dist/webpack-loader.d.ts +21 -0
- package/dist/webpack-loader.js +30 -0
- package/dist/webpack-loader.js.map +1 -0
- package/package.json +99 -0
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../src/index.ts","../../../node_modules/tsup/assets/cjs_shims.js","../../core/src/builders.ts","../../core/src/ops.ts","../../core/src/pass-manager.ts","../../core/src/pipeline.ts","../../core/src/reverse-emit.ts","../../pattern-kit/src/define.ts","../../pattern-kit/src/normalize.ts","../../pattern-kit/src/combinators.ts","../../pattern-kit/src/pattern.ts","../../patterns/src/flatten/empty-style-div.pattern.ts","../../patterns/src/flatten/flex-center-wrapper.pattern.ts","../../patterns/src/flatten/nested-flex-merge.pattern.ts","../../patterns/src/flatten/passthrough-wrapper.pattern.ts","../../patterns/src/flatten/redundant-fragment.pattern.ts","../../patterns/src/compress/dedupe-classes.pattern.ts","../../patterns/src/compress/inset-shorthand.pattern.ts","../../patterns/src/compress/margin-shorthand.pattern.ts","../../patterns/src/compress/padding-shorthand.pattern.ts","../../patterns/src/compress/size-shorthand.pattern.ts","../../patterns/src/_registry.generated.ts","../../frontend-jsx/src/frontend.ts","../../frontend-jsx/src/backend.ts","../../resolver-tailwind/src/index.ts","../../resolver-css/src/index.ts"],"sourcesContent":["/**\n * domflax — public meta package.\n *\n * Re-exports the entire `@domflax/core` public API (types + reference runtime) and the built-in\n * `@domflax/patterns` library, then layers thin, framework-agnostic build adapters on top\n * (`vite()` / `webpack()`) plus a programmatic `createDomflax()` factory.\n *\n * Each adapter runs the SAME single-file engine as {@link createDomflax} (JSX/TSX frontend + lazy\n * Tailwind/CSS resolver → core pass manager → reverse-emit → JSX backend). The adapters are\n * structurally typed against their bundlers — they never hard-depend on `vite` or `webpack`.\n *\n * Future deps (intentionally NOT imported yet — they land in a later stage):\n * - `@domflax/frontend-html` — HTML / Astro-static frontend feeding the pipeline.\n * - `@domflax/backend-*` — additional surgical codegen backends.\n */\n\nimport {\n buildSelectorIndex,\n createPipeline,\n createSyntheticSink,\n runPasses,\n syncClassesFromComputed,\n} from '@domflax/core';\nimport type {\n ApplyContext,\n EncodedSourceMap,\n FileKind,\n IRDocument,\n Pass,\n PassCategory,\n PassPhase,\n Pattern,\n Pipeline,\n SafetyLevel,\n StyleResolver,\n} from '@domflax/core';\nimport { builtinPatterns } from '@domflax/patterns';\nimport { createJsxBackend, createJsxFrontend } from '@domflax/frontend-jsx';\nimport { normalizer } from '@domflax/pattern-kit';\nimport { createTailwindResolver } from '@domflax/resolver-tailwind';\nimport { createCssResolver } from '@domflax/resolver-css';\nimport { dirname, join } from 'node:path';\nimport { fileURLToPath } from 'node:url';\n\n// ── Re-export the public surface ──────────────────────────────────────────────────────────────\nexport * from '@domflax/core';\nexport * from '@domflax/patterns';\n\n/* ────────────────────────────────────────────────────────────────────────── *\n * Options\n * ────────────────────────────────────────────────────────────────────────── */\n\n/** How class names resolve to computed styles. */\nexport type DomflaxProvider = 'auto' | 'tailwind' | 'custom';\n\n/** Public adapter/factory options (mirrors the documented `domflax({...})` surface). */\nexport interface DomflaxOptions {\n /** Resolution strategy. Defaults to `'auto'`. */\n readonly provider?: DomflaxProvider;\n /** Stylesheets to parse when `provider` is `'custom'`. */\n readonly cssFiles?: readonly string[];\n /** Preview changes without rewriting source. */\n readonly dryRun?: boolean;\n /** Optimization aggressiveness handed to the pass manager (0 lint … 3 aggressive). */\n readonly safety?: SafetyLevel;\n /** File globs/extensions the adapters should consider. Defaults to jsx/tsx/html. */\n readonly include?: readonly string[];\n}\n\n/** Fully-resolved options with defaults applied. */\nexport interface ResolvedDomflaxOptions {\n readonly provider: DomflaxProvider;\n readonly cssFiles: readonly string[];\n readonly dryRun: boolean;\n readonly safety: SafetyLevel;\n readonly include: readonly string[];\n}\n\nconst DEFAULT_INCLUDE: readonly string[] = ['.jsx', '.tsx', '.html'];\n\nfunction resolveOptions(options: DomflaxOptions): ResolvedDomflaxOptions {\n return {\n provider: options.provider ?? 'auto',\n cssFiles: options.cssFiles ?? [],\n dryRun: options.dryRun ?? false,\n safety: options.safety ?? 2,\n include: options.include ?? DEFAULT_INCLUDE,\n };\n}\n\n/** True when `id` is a file domflax knows how to transform. */\nfunction isSupported(id: string, include: readonly string[]): boolean {\n // Strip query suffixes bundlers append (e.g. `App.tsx?used`).\n const clean = id.split('?', 1)[0] ?? id;\n return include.some((ext) => clean.endsWith(ext));\n}\n\n/* ────────────────────────────────────────────────────────────────────────── *\n * Programmatic instance\n * ────────────────────────────────────────────────────────────────────────── */\n\n/** Result of a single-file transform. `map` is null until codegen lands. */\nexport interface DomflaxTransformResult {\n readonly code: string;\n readonly map: EncodedSourceMap | null;\n}\n\n/**\n * A configured domflax engine. Holds the wired core {@link Pipeline}, the passthrough\n * {@link StyleResolver}, and the built-in {@link Pattern} set, and exposes a single-file\n * `transform`.\n */\nexport interface Domflax {\n readonly options: ResolvedDomflaxOptions;\n readonly pipeline: Pipeline;\n readonly resolver: StyleResolver;\n readonly patterns: readonly Pattern[];\n /**\n * Transform one file. For `.jsx`/`.tsx` this runs the full pipeline (parse → resolve → flatten →\n * reverse-emit → print); every other (or unsupported) file is returned unchanged.\n */\n transform(code: string, id: string): DomflaxTransformResult;\n}\n\n/** `.tsx`/`.jsx` ⇒ the matching {@link FileKind}; anything else ⇒ null (no JSX frontend). */\nfunction jsxKindOf(id: string): FileKind | null {\n const clean = id.split('?', 1)[0] ?? id;\n if (clean.endsWith('.tsx')) return 'tsx';\n if (clean.endsWith('.jsx')) return 'jsx';\n return null;\n}\n\n/** First registered source's EOL, defaulting to `\\n`. */\nfunction eolOf(doc: IRDocument): '\\n' | '\\r\\n' {\n for (const src of doc.sources.values()) return src.eol;\n return '\\n';\n}\n\n/** Group the flat pattern list into one {@link Pass} per {@link PassPhase} (derived from category). */\nfunction buildPasses(patterns: readonly Pattern[]): Pass[] {\n const byPhase = new Map<PassPhase, Pattern[]>();\n for (const p of patterns) {\n const phase = (p.category.split('/', 1)[0] ?? 'flatten') as PassPhase;\n let bucket = byPhase.get(phase);\n if (!bucket) {\n bucket = [];\n byPhase.set(phase, bucket);\n }\n bucket.push(p);\n }\n const passes: Pass[] = [];\n for (const [phase, pats] of byPhase) {\n passes.push({ phase, category: `${phase}/builtin` as PassCategory, patterns: pats });\n }\n return passes;\n}\n\n/** Run the full JSX/TSX pipeline and return the re-printed source. */\nfunction runJsxPipeline(\n code: string,\n id: string,\n kind: FileKind,\n resolver: StyleResolver,\n patterns: readonly Pattern[],\n safety: SafetyLevel,\n): string {\n // 1. PARSE — the frontend lowers JSX → IR and resolves each element's static classes through the\n // injected resolver into `el.computed` (so the \"resolve styles onto each element\" step is done\n // here, via createTailwindResolver().resolve(classTokens)).\n const parsed = createJsxFrontend().parse(code, {\n id,\n kind,\n resolver,\n normalizer,\n config: {},\n onDiagnostic: () => {},\n });\n const doc = parsed.doc;\n\n // 2. AUTHORIZE — the JSX frontend defaults every node's safety floor to 0 (no optimization). The\n // orchestrator opens the floor to the max; the configured ceiling + each pattern's own opacity\n // predicates are the real gate.\n for (const node of doc.nodes.values()) node.meta.safetyFloor = 3;\n\n // 3. PASSES — drive the built-in patterns to a fixpoint via the core pass manager.\n const ctx: ApplyContext = {\n doc,\n safetyCeiling: safety,\n normalizer,\n // Real CSS-selector-safety index from the active resolver: a wrapper a combinator/structural\n // selector depends on is flagged so the flatten guards refuse to flatten it. Tailwind (no\n // complexSelectors) degrades to the null index — behaviour unchanged.\n selectors: buildSelectorIndex(doc, resolver),\n resolver,\n };\n const { doc: optimized } = runPasses(doc, buildPasses(patterns), ctx);\n\n // 4. REVERSE-EMIT — fold optimized computed styles back into class tokens for the backend.\n syncClassesFromComputed(optimized, resolver, normalizer);\n\n // 5. PRINT — IR → JSX/TSX text.\n const printed = createJsxBackend().print(\n optimized,\n { moduleId: id, ops: [], provenance: new Map() },\n {\n normalizer,\n resolver,\n sink: createSyntheticSink(),\n eol: eolOf(optimized),\n onDiagnostic: () => {},\n },\n );\n return printed.code;\n}\n\n/**\n * Build a configured domflax engine.\n *\n * Wires a real single-file pipeline: the JSX/TSX frontend + a Tailwind resolver feed the core pass\n * manager (running {@link builtinPatterns}), whose output is reverse-emitted back to class tokens\n * and re-printed by the JSX backend. Non-jsx/tsx files pass through unchanged.\n */\n/**\n * Build the {@link StyleResolver} for the chosen provider. The heavy engine each resolver wraps\n * (Tailwind v3 / postcss) is loaded LAZILY — at the moment this factory runs — and resolved from the\n * CONSUMER'S project, NOT from domflax's (possibly bundled) location. Both engines are OPTIONAL peer\n * dependencies of the published `domflax`: a Tailwind-only user never triggers a postcss load, and a\n * custom-CSS-only user never triggers a Tailwind load, because only the selected branch constructs.\n */\nfunction createResolver(resolved: ResolvedDomflaxOptions): StyleResolver {\n if (resolved.provider === 'custom') {\n return createCssResolver([], { files: resolved.cssFiles });\n }\n // 'auto' and 'tailwind' both resolve against the project's Tailwind engine.\n return createTailwindResolver();\n}\n\nexport function createDomflax(options: DomflaxOptions = {}): Domflax {\n const resolved = resolveOptions(options);\n const pipeline = createPipeline();\n const patterns = builtinPatterns;\n\n // Construct the resolver lazily so neither optional engine (Tailwind / postcss) is loaded until a\n // file is actually transformed (and only the engine for the selected provider is ever loaded).\n let cachedResolver: StyleResolver | null = null;\n const getResolver = (): StyleResolver => (cachedResolver ??= createResolver(resolved));\n\n return {\n options: resolved,\n pipeline,\n get resolver(): StyleResolver {\n return getResolver();\n },\n patterns,\n transform(code: string, id: string): DomflaxTransformResult {\n if (!isSupported(id, resolved.include)) return { code, map: null };\n const kind = jsxKindOf(id);\n // Non-jsx/tsx supported files (e.g. .html) stay passthrough — no HTML frontend wired yet.\n if (kind === null) return { code, map: null };\n const out = runJsxPipeline(code, id, kind, getResolver(), patterns, resolved.safety);\n return { code: out, map: null };\n },\n };\n}\n\n/* ────────────────────────────────────────────────────────────────────────── *\n * Build adapters (framework-agnostic, structurally-typed shapes)\n * ────────────────────────────────────────────────────────────────────────── */\n\n/**\n * Minimal Vite-plugin shape. Declared locally so this adapter does NOT depend on `vite`'s types\n * (an optional, type-only peer). Structurally compatible with Vite's `Plugin` for the hooks domflax\n * uses: `enforce: 'pre'` runs domflax before Vite's JSX→`createElement` transform, and `transform`\n * is Vite's per-file source hook. Returning `null` is Vite's \"no change\" signal.\n */\nexport interface DomflaxVitePlugin {\n readonly name: string;\n readonly enforce: 'pre';\n transform(code: string, id: string): DomflaxTransformResult | null;\n}\n\n/**\n * Vite adapter. Returns a real Vite `Plugin` (`enforce: 'pre'`) whose `transform` runs the domflax\n * engine on `.jsx`/`.tsx` modules — strips any bundler query suffix (e.g. `App.tsx?used`) before\n * matching, returns `{ code, map }` when the source changed, and `null` (Vite's unchanged signal)\n * for unchanged sources and for any non-jsx/tsx module.\n *\n * @example\n * ```js\n * // vite.config.js\n * import domflax from 'domflax';\n * export default { plugins: [domflax.vite({ provider: 'tailwind' })] };\n * ```\n */\nexport function vite(options: DomflaxOptions = {}): DomflaxVitePlugin {\n const engine = createDomflax(options);\n return {\n name: 'domflax',\n enforce: 'pre',\n transform(code: string, id: string): DomflaxTransformResult | null {\n if (!isSupported(id, engine.options.include)) return null;\n const out = engine.transform(code, id);\n // Signal \"no change\" to Vite when the source round-tripped unchanged.\n return out.code === code ? null : out;\n },\n };\n}\n\n/* ── webpack / Next.js ──────────────────────────────────────────────────────────────────────── */\n\n/** A `module.rule` `use` entry: an absolute loader path plus the options forwarded to it. */\ninterface DomflaxRuleUse {\n readonly loader: string;\n readonly options: DomflaxOptions;\n}\n\n/** The slice of a webpack `module.rule` domflax appends. */\ninterface DomflaxModuleRule {\n readonly test: RegExp;\n readonly enforce: 'pre';\n readonly exclude: RegExp;\n readonly use: readonly DomflaxRuleUse[];\n}\n\n/** Anything carrying a `module.rules` array — both a webpack `Compiler.options` and Next's bare config. */\ninterface DomflaxWebpackModuleHost {\n module?: { rules?: unknown[] };\n}\n\n/**\n * Minimal webpack-compiler shape. Declared locally so this adapter does NOT depend on `webpack`'s\n * types. domflax only needs to push a rule onto the host's `module.rules`.\n *\n * `apply` accepts BOTH shapes: a real webpack `Compiler` (rules live under `compiler.options.module`)\n * AND the bare `config` object Next.js hands you from `webpack(config)` (rules live directly under\n * `config.module`). It duck-types `compiler.options ?? compiler` to find the right host.\n */\nexport interface DomflaxWebpackCompiler extends DomflaxWebpackModuleHost {\n options?: DomflaxWebpackModuleHost;\n}\n\n/**\n * Minimal webpack-plugin shape. `apply(compiler)` is the webpack plugin entry point.\n */\nexport interface DomflaxWebpackPlugin {\n readonly name: string;\n apply(compiler: DomflaxWebpackCompiler): void;\n}\n\n/** `.jsx`/`.tsx` modules only (combinator-free with the JSX frontend; `.js`/`.ts` are skipped). */\nconst WEBPACK_JSX_TEST = /\\.[jt]sx$/;\n\n/**\n * Absolute path to the bundled webpack loader (`./webpack-loader`). Resolved lazily against THIS\n * module's location so it works whether `domflax` is loaded as ESM (`dist/index.js`) or CJS\n * (`dist/index.cjs`) — both sit beside `dist/webpack-loader.cjs`. webpack requires loaders via\n * CommonJS, so we always point at the `.cjs` output.\n */\nfunction webpackLoaderPath(): string {\n const here = dirname(fileURLToPath(import.meta.url));\n return join(here, 'webpack-loader.cjs');\n}\n\n/**\n * webpack adapter (also the Next.js path). Returns a plugin whose `apply(compiler)` injects a\n * pre-enforced `module.rule` that invokes the domflax {@link ./webpack-loader loader} on every\n * `.jsx`/`.tsx` module. The loader runs the SAME lazy engine as {@link createDomflax} (no eager\n * Tailwind/postcss load).\n *\n * Next.js wiring (`next.config.js`) — Next exposes the underlying webpack config via `webpack(config)`:\n * ```js\n * // next.config.js\n * const domflax = require('domflax');\n * module.exports = {\n * webpack(config) {\n * domflax.webpack({ provider: 'tailwind' }).apply(config);\n * return config;\n * },\n * };\n * ```\n * `apply(compiler)` is intentionally duck-typed on `compiler.options.module.rules`, so it accepts\n * both a real webpack `Compiler` and the bare `config` object Next.js hands you.\n *\n * Caveat: this targets the webpack builder only. **Turbopack is not yet supported** — it does not\n * accept arbitrary webpack loaders, so the `next.config.js` wiring above is a no-op under\n * `next dev --turbopack`. Run domflax through the webpack builder until Turbopack exposes a loader API.\n */\nexport function webpack(options: DomflaxOptions = {}): DomflaxWebpackPlugin {\n // Validate options eagerly (parity with the other adapters); the resolver stays lazy.\n createDomflax(options);\n return {\n name: 'domflax',\n apply(compiler: DomflaxWebpackCompiler): void {\n // Real webpack passes a `Compiler` (rules under `.options.module`); Next's `webpack(config)`\n // passes the bare config (rules under `.module`). Duck-type to the right host.\n const host: DomflaxWebpackModuleHost = compiler.options ?? compiler;\n const mod = (host.module ??= {});\n const rules = (mod.rules ??= []);\n const rule: DomflaxModuleRule = {\n test: WEBPACK_JSX_TEST,\n enforce: 'pre',\n exclude: /node_modules/,\n use: [{ loader: webpackLoaderPath(), options }],\n };\n rules.push(rule);\n },\n };\n}\n\n/**\n * The default-export namespace. Exposes the build adapters and the programmatic factory as an OBJECT\n * so the documented `import domflax from 'domflax'; domflax.vite()` / `domflax.webpack()` works (and a\n * CommonJS `const domflax = require('domflax'); domflax.vite()` too). The named exports\n * (`createDomflax`, `vite`, `webpack`, …) remain available for direct import.\n */\nexport interface DomflaxDefault {\n createDomflax(options?: DomflaxOptions): Domflax;\n vite(options?: DomflaxOptions): DomflaxVitePlugin;\n webpack(options?: DomflaxOptions): DomflaxWebpackPlugin;\n}\n\n/** Default export: an object exposing `vite`, `webpack`, and the programmatic `createDomflax`. */\nconst domflax: DomflaxDefault = { createDomflax, vite, webpack };\nexport default domflax;\n","// Shim globals in cjs bundle\n// There's a weird bug that esbuild will always inject importMetaUrl\n// if we export it as `const importMetaUrl = ... __filename ...`\n// But using a function will not cause this issue\n\nconst getImportMetaUrl = () => \n typeof document === \"undefined\" \n ? new URL(`file:${__filename}`).href \n : (document.currentScript && document.currentScript.tagName.toUpperCase() === 'SCRIPT') \n ? document.currentScript.src \n : new URL(\"main.js\", document.baseURI).href;\n\nexport const importMetaUrl = /* @__PURE__ */ getImportMetaUrl()\n","/**\n * @domflax/core — runtime builders + traversal.\n *\n * Pure, dependency-free helpers to construct IR nodes, assemble an {@link IRDocument},\n * and walk the tree honouring {@link VisitSignal}. No heavy third-party deps: only the\n * type contract in `./types`.\n */\n\nimport type {\n AttrMap,\n Backref,\n BackrefTable,\n ClassList,\n ConditionKey,\n CssProperty,\n ExprRecord,\n ExprRef,\n ExprRegistry,\n FrontendKind,\n IdAllocator,\n IRComment,\n IRDocument,\n IRElement,\n IRExpr,\n IRFragment,\n IRNamespace,\n IRNode,\n IRNodeId,\n IRText,\n InlineStyle,\n NodeMeta,\n SafetyLevel,\n SourceSpan,\n StyleBlock,\n StyleCondition,\n StyleMap,\n Visitor,\n VisitContext,\n VisitSignal,\n} from './types';\n\n/* ───────────────────────── id / registry primitives ───────────────────────── */\n\n/** Monotonic IRNodeId allocator. `peek` reports the id `next()` would return. */\nexport function createIdAllocator(start = 1): IdAllocator {\n let n = start;\n return {\n next(): IRNodeId {\n const id = n;\n n += 1;\n return id as IRNodeId;\n },\n get peek(): IRNodeId {\n return n as IRNodeId;\n },\n };\n}\n\n/** Minimal in-memory ExprRegistry. */\nexport function createExprRegistry(start = 1): ExprRegistry {\n const map = new Map<ExprRef, ExprRecord>();\n let n = start;\n return {\n get(r: ExprRef): ExprRecord | undefined {\n return map.get(r);\n },\n intern(rec: Omit<ExprRecord, 'ref'>): ExprRef {\n const ref = n as ExprRef;\n n += 1;\n map.set(ref, { ...rec, ref });\n return ref;\n },\n releasePayloads(): void {\n for (const [k, v] of map) map.set(k, { ...v, payload: undefined });\n },\n };\n}\n\n/** Mutable BackrefTable: frontends register backrefs as they parse. */\nexport interface MutableBackrefTable extends BackrefTable {\n set(id: IRNodeId, backref: Backref): void;\n}\n\nexport function createBackrefTable(): MutableBackrefTable {\n const map = new Map<IRNodeId, Backref>();\n return {\n get(id: IRNodeId): Backref | undefined {\n return map.get(id);\n },\n span(id: IRNodeId): SourceSpan | null {\n return map.get(id)?.span ?? null;\n },\n childrenSpan(id: IRNodeId): SourceSpan | null {\n return map.get(id)?.innerSpan ?? null;\n },\n set(id: IRNodeId, backref: Backref): void {\n map.set(id, backref);\n },\n };\n}\n\n/* ───────────────────────── default sub-structures ───────────────────────── */\n\n/** A NodeMeta with every barrier/flag cleared. */\nexport function defaultMeta(safetyFloor: SafetyLevel = 0): NodeMeta {\n return {\n hasRef: false,\n hasEventHandlers: false,\n hasKey: false,\n hasSpreadAttrs: false,\n hasDynamicChildren: false,\n isComponent: false,\n hasDangerousHtml: false,\n targetedByCombinator: false,\n targetedByStructuralPseudo: false,\n selectorDependents: 0,\n hasOwnVisualStyle: false,\n establishesBox: false,\n establishesStackingContext: false,\n isContainingBlock: false,\n establishesFormattingContext: false,\n declaresCustomProperties: false,\n whitespaceSensitive: false,\n touched: false,\n synthetic: false,\n safetyFloor,\n };\n}\n\n/** Canonical base style condition (`media:'' states:[] pseudoElement:''`). */\nexport const BASE_CONDITION: StyleCondition = { media: '', states: [], pseudoElement: '' };\n\n/** Stable serialization of a StyleCondition into a ConditionKey. */\nexport function conditionKey(c: StyleCondition): ConditionKey {\n const states = [...c.states].sort().join(',');\n return `${c.media}|${states}|${c.pseudoElement}` as ConditionKey;\n}\n\nexport const BASE_CONDITION_KEY: ConditionKey = conditionKey(BASE_CONDITION);\n\n/** An empty StyleMap (no blocks). */\nexport function emptyStyleMap(): StyleMap {\n return { blocks: new Map<ConditionKey, StyleBlock>() };\n}\n\n/** An empty (absent) ClassList. */\nexport function emptyClassList(): ClassList {\n return {\n form: 'absent',\n segments: [],\n valueSpan: null,\n hasDynamic: false,\n opaque: false,\n rewritable: false,\n };\n}\n\n/** An empty AttrMap. */\nexport function emptyAttrMap(): AttrMap {\n return { entries: new Map(), spreads: [], order: [] };\n}\n\n/** An empty InlineStyle. */\nexport function emptyInlineStyle(): InlineStyle {\n return { decls: new Map<CssProperty, never>() as InlineStyle['decls'], dynamic: null };\n}\n\n/* ───────────────────────── node factories ───────────────────────── */\n\nexport interface ElementInit {\n readonly tag: string;\n readonly namespace?: IRNamespace;\n readonly isComponent?: boolean;\n readonly selfClosing?: boolean;\n readonly classes?: ClassList;\n readonly inlineStyle?: InlineStyle;\n readonly computed?: StyleMap;\n readonly attrs?: AttrMap;\n readonly children?: IRNodeId[];\n readonly parent?: IRNodeId | null;\n readonly span?: SourceSpan | null;\n readonly meta?: NodeMeta;\n}\n\nexport function createElement(id: IRNodeId, init: ElementInit): IRElement {\n return {\n id,\n kind: 'element',\n parent: init.parent ?? null,\n span: init.span ?? null,\n meta: init.meta ?? defaultMeta(),\n tag: init.tag,\n namespace: init.namespace ?? 'html',\n isComponent: init.isComponent ?? false,\n selfClosing: init.selfClosing ?? false,\n classes: init.classes ?? emptyClassList(),\n inlineStyle: init.inlineStyle ?? emptyInlineStyle(),\n computed: init.computed ?? emptyStyleMap(),\n attrs: init.attrs ?? emptyAttrMap(),\n children: init.children ?? [],\n };\n}\n\nexport function createText(\n id: IRNodeId,\n value: string,\n opts?: { collapsible?: boolean; parent?: IRNodeId | null; span?: SourceSpan | null },\n): IRText {\n return {\n id,\n kind: 'text',\n parent: opts?.parent ?? null,\n span: opts?.span ?? null,\n meta: defaultMeta(),\n value,\n collapsible: opts?.collapsible ?? true,\n };\n}\n\nexport function createExpr(\n id: IRNodeId,\n expr: ExprRef,\n opts?: { parent?: IRNodeId | null; span?: SourceSpan | null },\n): IRExpr {\n return {\n id,\n kind: 'expr',\n parent: opts?.parent ?? null,\n span: opts?.span ?? null,\n meta: defaultMeta(),\n expr,\n };\n}\n\nexport function createFragment(\n id: IRNodeId,\n opts?: { children?: IRNodeId[]; parent?: IRNodeId | null; span?: SourceSpan | null },\n): IRFragment {\n return {\n id,\n kind: 'fragment',\n parent: opts?.parent ?? null,\n span: opts?.span ?? null,\n meta: defaultMeta(),\n children: opts?.children ?? [],\n };\n}\n\nexport function createComment(\n id: IRNodeId,\n value: string,\n opts?: { parent?: IRNodeId | null; span?: SourceSpan | null },\n): IRComment {\n return {\n id,\n kind: 'comment',\n parent: opts?.parent ?? null,\n span: opts?.span ?? null,\n meta: defaultMeta(),\n value,\n };\n}\n\n/** Build an empty document whose root is a fresh fragment. */\nexport function createDocument(frontend: FrontendKind): IRDocument {\n const alloc = createIdAllocator();\n const rootId = alloc.next();\n const root = createFragment(rootId);\n const nodes = new Map<IRNodeId, IRNode>([[rootId, root]]);\n return {\n root: rootId,\n nodes,\n exprs: createExprRegistry(),\n sources: new Map(),\n backref: createBackrefTable(),\n frontend,\n alloc,\n };\n}\n\n/* ───────────────────────── tree accessors ───────────────────────── */\n\n/** Returns the child id list for container nodes, or an empty array. */\nexport function childIds(node: IRNode): readonly IRNodeId[] {\n return node.kind === 'element' || node.kind === 'fragment' ? node.children : [];\n}\n\n/** Returns the node, or undefined. */\nexport function getNode(doc: IRDocument, id: IRNodeId): IRNode | undefined {\n return doc.nodes.get(id);\n}\n\n/** Returns the node iff it is an element. */\nexport function getElement(doc: IRDocument, id: IRNodeId): IRElement | undefined {\n const n = doc.nodes.get(id);\n return n && n.kind === 'element' ? n : undefined;\n}\n\n/** Pre-order list of every element id reachable from the root. */\nexport function elementIds(doc: IRDocument): IRNodeId[] {\n const out: IRNodeId[] = [];\n const visit = (id: IRNodeId): void => {\n const n = doc.nodes.get(id);\n if (!n) return;\n if (n.kind === 'element') out.push(id);\n for (const c of childIds(n)) visit(c);\n };\n visit(doc.root);\n return out;\n}\n\n/* ───────────────────────── traversal ───────────────────────── */\n\n/**\n * Depth-first pre/post-order walk. `enter` may return `'skip'` (don't descend) or `'stop'`\n * (abort the whole walk); `exit` may return `'stop'`. The visitor receives a live {@link IRNode}\n * plus a {@link VisitContext} exposing depth and the parent node.\n */\nexport function walk(doc: IRDocument, visitor: Visitor): void {\n const roDoc = doc as unknown as VisitContext['doc'];\n let stopped = false;\n\n const visit = (id: IRNodeId, depth: number): void => {\n if (stopped) return;\n const node = doc.nodes.get(id);\n if (!node) return;\n\n const ctx: VisitContext = {\n doc: roDoc,\n depth,\n parent(): IRNode | null {\n return node.parent == null ? null : doc.nodes.get(node.parent) ?? null;\n },\n };\n\n const entered: VisitSignal = visitor.enter ? visitor.enter(node, ctx) : undefined;\n if (entered === 'stop') {\n stopped = true;\n return;\n }\n if (entered !== 'skip') {\n for (const child of childIds(node)) {\n visit(child, depth + 1);\n if (stopped) return;\n }\n }\n\n const exited: VisitSignal = visitor.exit ? visitor.exit(node, ctx) : undefined;\n if (exited === 'stop') stopped = true;\n };\n\n visit(doc.root, 0);\n}\n","/**\n * @domflax/core — the pure applier (the one trusted mutator).\n *\n * {@link applyOps} takes an {@link IRDocument} plus a flat list of {@link RewriteOp}s and returns\n * a NEW, mutated document (the input document is left untouched — \"pure\" in the input-immutability\n * sense). Every op is validated against the safety ceiling and node-local safety floor before it\n * runs; rejected ops are collected into {@link ApplyResult.skipped} with {@link Diagnostic}s rather\n * than throwing. Dependency-free: only the `./types` contract and `./builders` runtime helpers.\n */\n\nimport type {\n ApplyContext,\n ApplyResult,\n AttrMap,\n AttrValue,\n ConditionKey,\n CssProperty,\n Diagnostic,\n DiagnosticCode,\n ElementSpec,\n IRDocument,\n IRElement,\n IRNode,\n IRNodeId,\n NodeSpec,\n RewriteGroup,\n RewriteOp,\n SkippedOpGroup,\n StyleBlock,\n StyleDecl,\n StyleMap,\n StyleConflictPolicy,\n} from './types';\n\nimport {\n BASE_CONDITION_KEY,\n createComment,\n createElement,\n createExpr,\n createFragment,\n createText,\n defaultMeta,\n} from './builders';\n\n/* ───────────────────────── result of an apply run ───────────────────────── */\n\nexport interface ApplyOutcome {\n /** The new document (the input doc is never mutated). */\n readonly doc: IRDocument;\n readonly result: ApplyResult;\n}\n\ninterface MutState {\n readonly doc: IRDocument;\n readonly touched: Set<IRNodeId>;\n readonly removed: Set<IRNodeId>;\n readonly created: Set<IRNodeId>;\n readonly diagnostics: Diagnostic[];\n readonly skipped: SkippedOpGroup[];\n appliedGroups: number;\n readonly ceiling: number;\n readonly ctx: ApplyContext;\n}\n\n/* ───────────────────────── cloning (keep input pure) ───────────────────────── */\n\nfunction cloneStyleMap(sm: StyleMap): StyleMap {\n const blocks = new Map<ConditionKey, StyleBlock>();\n for (const [key, block] of sm.blocks) {\n blocks.set(key, {\n condition: block.condition,\n decls: new Map<CssProperty, StyleDecl>(block.decls),\n });\n }\n return { blocks };\n}\n\nfunction cloneNode(node: IRNode): IRNode {\n const meta = { ...node.meta };\n switch (node.kind) {\n case 'element':\n return {\n ...node,\n meta,\n children: [...node.children],\n computed: cloneStyleMap(node.computed),\n };\n case 'fragment':\n return { ...node, meta, children: [...node.children] };\n default:\n return { ...node, meta };\n }\n}\n\n/** Shallow-immutable clone: input doc and its node objects are never mutated. */\nexport function cloneDocument(doc: IRDocument): IRDocument {\n const nodes = new Map<IRNodeId, IRNode>();\n for (const [id, n] of doc.nodes) nodes.set(id, cloneNode(n));\n return {\n root: doc.root,\n nodes,\n exprs: doc.exprs,\n sources: doc.sources,\n backref: doc.backref,\n frontend: doc.frontend,\n alloc: doc.alloc,\n };\n}\n\n/* ───────────────────────── small helpers ───────────────────────── */\n\nfunction diag(\n code: DiagnosticCode,\n message: string,\n extra?: Partial<Diagnostic>,\n): Diagnostic {\n return { code, severity: 'warn', message, ...extra };\n}\n\nfunction getParentChildren(doc: IRDocument, id: IRNodeId): IRNodeId[] | null {\n const node = doc.nodes.get(id);\n if (!node || node.parent == null) return null;\n const parent = doc.nodes.get(node.parent);\n if (!parent) return null;\n if (parent.kind === 'element' || parent.kind === 'fragment') return parent.children;\n return null;\n}\n\nfunction indexInParent(doc: IRDocument, id: IRNodeId): number {\n const siblings = getParentChildren(doc, id);\n return siblings ? siblings.indexOf(id) : -1;\n}\n\nfunction markTouched(state: MutState, id: IRNodeId): void {\n const n = state.doc.nodes.get(id);\n if (n) {\n n.meta.touched = true;\n state.touched.add(id);\n }\n}\n\nfunction removeSubtree(state: MutState, id: IRNodeId): void {\n const node = state.doc.nodes.get(id);\n if (!node) return;\n if (node.kind === 'element' || node.kind === 'fragment') {\n for (const child of [...node.children]) removeSubtree(state, child);\n }\n state.doc.nodes.delete(id);\n state.removed.add(id);\n}\n\n/* ───────────────────────── spec materialization ───────────────────────── */\n\nfunction specToAttrs(map: ReadonlyMap<string, string | boolean> | undefined): AttrMap {\n if (!map || map.size === 0) return { entries: new Map(), spreads: [], order: [] };\n const entries = new Map<string, AttrValue>();\n const order: string[] = [];\n for (const [k, v] of map) {\n entries.set(k, { kind: 'static', value: v });\n order.push(k);\n }\n return { entries, spreads: [], order };\n}\n\n/** Materialize a detached {@link NodeSpec} into live nodes; returns the new (or reused) id. */\nfunction materialize(state: MutState, spec: NodeSpec, parent: IRNodeId | null): IRNodeId {\n const { doc } = state;\n if (spec.kind === 'ref') {\n const existing = doc.nodes.get(spec.ref);\n if (existing) existing.parent = parent;\n return spec.ref;\n }\n\n const id = doc.alloc.next();\n state.created.add(id);\n switch (spec.kind) {\n case 'element': {\n const childIds: IRNodeId[] = [];\n const el = createElement(id, {\n tag: spec.tag,\n namespace: spec.namespace,\n selfClosing: spec.selfClosing,\n attrs: specToAttrs(spec.attrs),\n parent,\n meta: { ...defaultMeta(), synthetic: true },\n });\n if (spec.classes) el.computed = cloneStyleMap(spec.classes);\n doc.nodes.set(id, el);\n for (const child of spec.children ?? []) {\n childIds.push(materialize(state, child, id));\n }\n el.children = childIds;\n return id;\n }\n case 'text': {\n const t = createText(id, spec.value, { parent });\n t.meta.synthetic = true;\n doc.nodes.set(id, t);\n return id;\n }\n case 'expr': {\n const e = createExpr(id, spec.expr, { parent });\n e.meta.synthetic = true;\n doc.nodes.set(id, e);\n return id;\n }\n case 'comment': {\n const c = createComment(id, spec.value, { parent });\n c.meta.synthetic = true;\n doc.nodes.set(id, c);\n return id;\n }\n case 'fragment': {\n const frag = createFragment(id, { parent });\n frag.meta.synthetic = true;\n doc.nodes.set(id, frag);\n const childIds: IRNodeId[] = [];\n for (const child of spec.children) childIds.push(materialize(state, child, id));\n frag.children = childIds;\n return id;\n }\n }\n}\n\nfunction elementSpecToNode(state: MutState, spec: ElementSpec, parent: IRNodeId | null): IRNodeId {\n return materialize(state, spec, parent);\n}\n\n/* ───────────────────────── style merging ───────────────────────── */\n\nfunction isInherited(state: MutState, decl: StyleDecl): boolean {\n if (decl.inherited) return true;\n const table = state.ctx.normalizer?.inherited;\n if (table) {\n try {\n return table.isInherited(decl.property);\n } catch {\n return decl.inherited;\n }\n }\n return decl.inherited;\n}\n\ninterface MergeReport {\n readonly map: StyleMap;\n readonly conflict: boolean;\n}\n\n/** Merge `source` decls into `target`, condition-by-condition, per the conflict policy. */\nfunction mergeStyleMaps(\n target: StyleMap,\n source: StyleMap,\n policy: StyleConflictPolicy,\n): MergeReport {\n // Mutable working copy; returned (widened) as an immutable StyleMap.\n const blocks = new Map<ConditionKey, StyleBlock>(cloneStyleMap(target).blocks);\n let conflict = false;\n\n for (const [key, srcBlock] of source.blocks) {\n const existing = blocks.get(key);\n if (!existing) {\n blocks.set(key, {\n condition: srcBlock.condition,\n decls: new Map<CssProperty, StyleDecl>(srcBlock.decls),\n });\n continue;\n }\n const decls = new Map<CssProperty, StyleDecl>(existing.decls);\n for (const [prop, srcDecl] of srcBlock.decls) {\n const had = decls.get(prop);\n if (had && had.value !== srcDecl.value) {\n conflict = true;\n if (policy === 'target-wins') continue;\n // 'abort' is handled by the caller before commit; 'source-wins' falls through.\n }\n if (policy === 'target-wins' && had) continue;\n decls.set(prop, srcDecl);\n }\n blocks.set(key, { condition: existing.condition, decls });\n }\n return { map: { blocks }, conflict };\n}\n\n/* ───────────────────────── per-op handlers ───────────────────────── */\n\nfunction safetyOk(state: MutState, op: RewriteOp, targetId: IRNodeId): Diagnostic | null {\n const opSafety = op.origin.safety;\n if (opSafety > state.ceiling) {\n return diag(\n 'DF_SAFETY_CEILING_EXCEEDED',\n `op '${op.op}' safety ${opSafety} exceeds ceiling ${state.ceiling}`,\n { nodeId: targetId, pattern: op.origin.pattern, severity: 'error' },\n );\n }\n const node = state.doc.nodes.get(targetId);\n if (node && opSafety > node.meta.safetyFloor) {\n return diag(\n 'DF_SAFETY_CEILING_EXCEEDED',\n `op '${op.op}' safety ${opSafety} exceeds node ${targetId} floor ${node.meta.safetyFloor}`,\n { nodeId: targetId, pattern: op.origin.pattern, severity: 'error' },\n );\n }\n return null;\n}\n\n/** Returns a list of validation issues; empty ⇒ the op was applied. */\nfunction applyOne(state: MutState, op: RewriteOp): Diagnostic[] {\n const { doc } = state;\n\n const primary = primaryTarget(op);\n if (primary != null) {\n if (!doc.nodes.get(primary)) {\n return [\n diag('DF_OP_PRECONDITION_FAILED', `target node ${primary} not found`, {\n nodeId: primary,\n pattern: op.origin.pattern,\n severity: 'error',\n }),\n ];\n }\n const safety = safetyOk(state, op, primary);\n if (safety) return [safety];\n }\n\n switch (op.op) {\n case 'removeNode': {\n const siblings = getParentChildren(doc, op.target);\n if (siblings) {\n const i = siblings.indexOf(op.target);\n if (i >= 0) siblings.splice(i, 1);\n }\n removeSubtree(state, op.target);\n return [];\n }\n\n case 'unwrap': {\n const node = doc.nodes.get(op.target);\n if (!node || (node.kind !== 'element' && node.kind !== 'fragment')) {\n return [precond(op, op.target, 'unwrap target is not a container')];\n }\n const siblings = getParentChildren(doc, op.target);\n if (!siblings) return [precond(op, op.target, 'unwrap target has no parent')];\n const at = siblings.indexOf(op.target);\n const kids = node.children;\n for (const k of kids) {\n const kn = doc.nodes.get(k);\n if (kn) kn.parent = node.parent;\n }\n siblings.splice(at, 1, ...kids);\n doc.nodes.delete(op.target);\n state.removed.add(op.target);\n if (node.parent != null) markTouched(state, node.parent);\n return [];\n }\n\n case 'replaceWith': {\n const siblings = getParentChildren(doc, op.target);\n if (!siblings) return [precond(op, op.target, 'replaceWith target has no parent')];\n const at = siblings.indexOf(op.target);\n const parentId = doc.nodes.get(op.target)?.parent ?? null;\n const newId = materialize(state, op.replacement, parentId);\n siblings.splice(at, 1, newId);\n removeSubtree(state, op.target);\n if (parentId != null) markTouched(state, parentId);\n return [];\n }\n\n case 'wrap': {\n const siblings = getParentChildren(doc, op.target);\n if (!siblings) return [precond(op, op.target, 'wrap target has no parent')];\n const at = siblings.indexOf(op.target);\n const parentId = doc.nodes.get(op.target)?.parent ?? null;\n const wrapperId = elementSpecToNode(state, op.wrapper, parentId);\n const wrapper = doc.nodes.get(wrapperId);\n const targetNode = doc.nodes.get(op.target);\n if (wrapper && (wrapper.kind === 'element' || wrapper.kind === 'fragment')) {\n wrapper.children.push(op.target);\n }\n if (targetNode) targetNode.parent = wrapperId;\n siblings.splice(at, 1, wrapperId);\n return [];\n }\n\n case 'insertBefore':\n case 'insertAfter': {\n const siblings = getParentChildren(doc, op.anchor);\n if (!siblings) return [precond(op, op.anchor, 'insert anchor has no parent')];\n const at = siblings.indexOf(op.anchor);\n const parentId = doc.nodes.get(op.anchor)?.parent ?? null;\n const newId = materialize(state, op.node, parentId);\n siblings.splice(op.op === 'insertBefore' ? at : at + 1, 0, newId);\n if (parentId != null) markTouched(state, parentId);\n return [];\n }\n\n case 'moveNode': {\n const newParent = doc.nodes.get(op.newParent);\n if (!newParent || (newParent.kind !== 'element' && newParent.kind !== 'fragment')) {\n return [precond(op, op.newParent, 'moveNode newParent is not a container')];\n }\n const siblings = getParentChildren(doc, op.target);\n if (siblings) {\n const i = siblings.indexOf(op.target);\n if (i >= 0) siblings.splice(i, 1);\n }\n const target = doc.nodes.get(op.target);\n if (target) target.parent = op.newParent;\n const idx = Math.max(0, Math.min(op.index, newParent.children.length));\n newParent.children.splice(idx, 0, op.target);\n markTouched(state, op.newParent);\n return [];\n }\n\n case 'mergeSiblings': {\n const first = doc.nodes.get(op.first);\n const second = doc.nodes.get(op.second);\n if (!first || !second) return [precond(op, op.first, 'mergeSiblings node missing')];\n if (\n (first.kind === 'element' || first.kind === 'fragment') &&\n (second.kind === 'element' || second.kind === 'fragment')\n ) {\n for (const c of second.children) {\n const cn = doc.nodes.get(c);\n if (cn) cn.parent = op.first;\n first.children.push(c);\n }\n second.children = [];\n }\n const siblings = getParentChildren(doc, op.second);\n if (siblings) {\n const i = siblings.indexOf(op.second);\n if (i >= 0) siblings.splice(i, 1);\n }\n doc.nodes.delete(op.second);\n state.removed.add(op.second);\n markTouched(state, op.first);\n return [];\n }\n\n case 'setClassList': {\n const el = doc.nodes.get(op.target);\n if (!el || el.kind !== 'element') {\n return [precond(op, op.target, 'setClassList target is not an element')];\n }\n el.computed = cloneStyleMap(op.style);\n markTouched(state, op.target);\n return [];\n }\n\n case 'mergeStyle': {\n const el = doc.nodes.get(op.target);\n if (!el || el.kind !== 'element') {\n return [precond(op, op.target, 'mergeStyle target is not an element')];\n }\n const report = mergeStyleMaps(el.computed, op.style, op.onConflict);\n if (report.conflict && op.onConflict === 'abort') {\n return [\n diag('DF_STYLE_CONFLICT_UNRESOLVED', `mergeStyle aborted on conflict at ${op.target}`, {\n nodeId: op.target,\n pattern: op.origin.pattern,\n severity: 'error',\n }),\n ];\n }\n el.computed = report.map;\n if (op.source != null) {\n const src = doc.nodes.get(op.source);\n if (src) markTouched(state, op.source);\n }\n markTouched(state, op.target);\n return [];\n }\n\n case 'foldInheritedStyles':\n return applyFold(state, op);\n }\n}\n\nfunction applyFold(\n state: MutState,\n op: Extract<RewriteOp, { op: 'foldInheritedStyles' }>,\n): Diagnostic[] {\n const { doc } = state;\n const from = doc.nodes.get(op.from);\n if (!from || from.kind !== 'element') {\n return [precond(op, op.from, 'fold source is not an element')];\n }\n const issues: Diagnostic[] = [];\n const onlyProps: ReadonlySet<CssProperty> | null =\n op.properties === 'all-inherited' ? null : new Set(op.properties);\n\n const conditionKeys =\n op.conditions === 'all'\n ? [...from.computed.blocks.keys()]\n : [BASE_CONDITION_KEY];\n\n for (const intoId of op.into) {\n const into = doc.nodes.get(intoId);\n if (!into || into.kind !== 'element') {\n issues.push(precond(op, intoId, 'fold target is not an element'));\n continue;\n }\n // Mutable working copy; assigned back (widened) as an immutable StyleMap.\n const nextBlocks = new Map<ConditionKey, StyleBlock>(cloneStyleMap(into.computed).blocks);\n let folded = false;\n\n for (const key of conditionKeys) {\n const srcBlock = from.computed.blocks.get(key);\n if (!srcBlock) continue;\n const dstBlock = nextBlocks.get(key);\n const decls = dstBlock\n ? new Map<CssProperty, StyleDecl>(dstBlock.decls)\n : new Map<CssProperty, StyleDecl>();\n\n for (const [prop, decl] of srcBlock.decls) {\n if (onlyProps && !onlyProps.has(prop)) continue;\n if (!isInherited(state, decl)) continue;\n if (decl.relativeToParent) {\n issues.push(\n diag(\n 'DF_RELATIVE_UNIT_FOLD',\n `refused to fold relative-unit declaration '${decl.property}' onto ${intoId}`,\n { nodeId: intoId, pattern: op.origin.pattern, severity: 'warn' },\n ),\n );\n continue;\n }\n if (!decls.has(prop)) {\n decls.set(prop, decl);\n folded = true;\n }\n }\n nextBlocks.set(key, { condition: srcBlock.condition, decls });\n }\n\n if (folded) {\n into.computed = { blocks: nextBlocks };\n markTouched(state, intoId);\n }\n }\n // Non-blocking (DF_RELATIVE_UNIT_FOLD) diagnostics are recorded but do not skip the op.\n for (const d of issues) state.diagnostics.push(d);\n return [];\n}\n\nfunction precond(op: RewriteOp, nodeId: IRNodeId, message: string): Diagnostic {\n return diag('DF_OP_PRECONDITION_FAILED', message, {\n nodeId,\n pattern: op.origin.pattern,\n severity: 'error',\n });\n}\n\nfunction primaryTarget(op: RewriteOp): IRNodeId | null {\n switch (op.op) {\n case 'removeNode':\n case 'unwrap':\n case 'replaceWith':\n case 'wrap':\n case 'moveNode':\n case 'setClassList':\n case 'mergeStyle':\n return op.target;\n case 'insertBefore':\n case 'insertAfter':\n return op.anchor;\n case 'mergeSiblings':\n return op.first;\n case 'foldInheritedStyles':\n return op.from;\n }\n}\n\n/* ───────────────────────── public entry points ───────────────────────── */\n\n/**\n * Apply a flat list of ops to a copy of `doc`. The input document is never mutated.\n * Each op is independently validated; failing ops are skipped (collected in\n * {@link ApplyResult.skipped}) instead of throwing.\n */\nexport function applyOps(\n doc: IRDocument,\n ops: readonly RewriteOp[],\n ctx?: Partial<ApplyContext>,\n): ApplyOutcome {\n const cloned = cloneDocument(doc);\n const state: MutState = {\n doc: cloned,\n touched: new Set(),\n removed: new Set(),\n created: new Set(),\n diagnostics: [],\n skipped: [],\n appliedGroups: 0,\n ceiling: ctx?.safetyCeiling ?? 3,\n ctx: { doc: cloned, safetyCeiling: ctx?.safetyCeiling ?? 3, ...ctx } as ApplyContext,\n };\n\n for (const op of ops) {\n const issues = applyOne(state, op);\n if (issues.length > 0) {\n state.skipped.push({\n group: { pattern: op.origin.pattern, anchor: primaryTarget(op) ?? doc.root, ops: [op] },\n issues: issues.map((d) => ({ op, code: d.code, message: d.message })),\n });\n for (const d of issues) state.diagnostics.push(d);\n } else {\n state.appliedGroups += 1;\n }\n }\n\n return { doc: cloned, result: finalize(state) };\n}\n\n/**\n * Apply pre-grouped ops (each {@link RewriteGroup} is committed atomically: if ANY op in the group\n * fails validation, the whole group is skipped and none of its ops mutate the tree).\n */\nexport function applyGroups(\n doc: IRDocument,\n groups: readonly RewriteGroup[],\n ctx?: Partial<ApplyContext>,\n): ApplyOutcome {\n // Group-atomicity is realized by working on a throwaway clone per group, then committing.\n let current = cloneDocument(doc);\n const touched = new Set<IRNodeId>();\n const removed = new Set<IRNodeId>();\n const created = new Set<IRNodeId>();\n const diagnostics: Diagnostic[] = [];\n const skipped: SkippedOpGroup[] = [];\n let appliedGroups = 0;\n\n for (const group of groups) {\n const attempt = applyOps(current, group.ops, ctx);\n if (attempt.result.skipped.length > 0) {\n skipped.push({\n group,\n issues: attempt.result.skipped.flatMap((s) => s.issues),\n });\n for (const s of attempt.result.skipped) for (const i of s.issues) {\n diagnostics.push(diag(i.code, i.message, { pattern: group.pattern }));\n }\n continue; // discard the attempt — group is atomic\n }\n current = attempt.doc;\n appliedGroups += 1;\n for (const id of attempt.result.touched) touched.add(id);\n for (const id of attempt.result.removed) removed.add(id);\n for (const id of attempt.result.created) created.add(id);\n for (const d of attempt.result.diagnostics) diagnostics.push(d);\n }\n\n const result: ApplyResult = {\n touched,\n removed,\n created,\n appliedGroups,\n skipped,\n journal: [],\n diagnostics,\n };\n return { doc: current, result };\n}\n\nfunction finalize(state: MutState): ApplyResult {\n return {\n touched: state.touched,\n removed: state.removed,\n created: state.created,\n appliedGroups: state.appliedGroups,\n skipped: state.skipped,\n journal: [],\n diagnostics: state.diagnostics,\n };\n}\n","/**\n * @domflax/core — pass manager + supporting contexts.\n *\n * Runs {@link Pattern}s grouped by {@link PassCategory} in declared order, driving the `flatten`\n * phase to a fixpoint under a max-iteration budget, and isolating per-node pattern errors into\n * {@link Diagnostic}s (a thrown pattern never aborts the run — it becomes `DF_PATTERN_THREW`).\n *\n * Dependency-free: only the `./types` contract plus `./builders` + `./ops` runtime helpers.\n */\n\nimport type {\n ApplyContext,\n Captures,\n DeepReadonly,\n Diagnostic,\n ElementSpec,\n FixpointConfig,\n HaltReason,\n IRDocument,\n IRElement,\n IRNode,\n IRNodeId,\n MatchContext,\n NodeLike,\n NodeSpec,\n Pass,\n PassManager,\n PassPhase,\n Pattern,\n PhaseRunResult,\n ResolveInput,\n ResolveResult,\n RewriteFactory,\n RewriteOp,\n RewriteOpDraft,\n SelectorIndex,\n StyleConflictPolicy,\n StyleMap,\n StyleNormalizer,\n StyleResolver,\n SyntheticSink,\n ElementLike,\n SelectorUsage,\n EmitContext,\n EmitResult,\n} from './types';\n\nimport { childIds, elementIds, emptyStyleMap, getElement } from './builders';\nimport { applyOps } from './ops';\n\n/* ───────────────────────── defaults ───────────────────────── */\n\nexport const DEFAULT_FIXPOINT: FixpointConfig = {\n maxIterations: 16,\n phases: { flatten: 16, compress: 8, extract: 4 },\n onBudgetExhausted: 'warn',\n detectOscillation: true,\n};\n\nconst PHASE_ORDER: readonly PassPhase[] = ['flatten', 'compress', 'extract'];\n\n/** A no-op resolver: owns nothing, resolves to empty styles. Useful as an injection default. */\nexport function createNullResolver(): StyleResolver {\n const empty: ResolveResult = {\n styles: emptyStyleMap(),\n resolved: [],\n unknown: [],\n opaque: [],\n warnings: [],\n };\n const usage: SelectorUsage = {\n asSubject: false,\n asAncestor: false,\n asCompound: false,\n asSibling: false,\n asHasArgument: false,\n asStructural: false,\n droppable: true,\n };\n return {\n id: 'null',\n provider: 'null@0.0.0',\n fingerprint: 'null',\n owns(): boolean {\n return false;\n },\n resolve(_input: ResolveInput): ResolveResult {\n return empty;\n },\n emit(_styles: StyleMap, _ctx: EmitContext): EmitResult {\n return { classes: [], exact: true, warnings: [] };\n },\n selectorUsage(): SelectorUsage {\n return usage;\n },\n };\n}\n\n/** A SelectorIndex that reports zero CSS-targeting (no combinator/structural coupling). */\nexport function createNullSelectorIndex(): SelectorIndex {\n const none: ReadonlySet<IRNodeId> = new Set();\n return {\n targetedByCombinator(): boolean {\n return false;\n },\n targetedByStructuralPseudo(): boolean {\n return false;\n },\n reparentImpact(): ReadonlySet<IRNodeId> {\n return none;\n },\n };\n}\n\n/** Resolvers that can enumerate the project's COMPLEX selectors (the custom-CSS resolver) expose this. */\ninterface ComplexSelectorCapable {\n complexSelectors(): readonly string[];\n}\n\nfunction hasComplexSelectors(r: StyleResolver): r is StyleResolver & ComplexSelectorCapable {\n return typeof (r as Partial<ComplexSelectorCapable>).complexSelectors === 'function';\n}\n\n/**\n * Build a real {@link SelectorIndex} from the active resolver.\n *\n * For a resolver that reports project COMPLEX selectors — anything with a combinator (`>`/`+`/`~`/\n * descendant) or a structural pseudo, i.e. the custom-CSS resolver — every element whose static class\n * participates in such a selector is flagged so the flatten/compress guards (`targetedByCombinator` /\n * `affectsSelectorMatching`) fire and a wrapper a selector depends on is NOT flattened. An element is\n * combinator-coupled when one of its classes is used as a descendant/child ancestor, as a sibling\n * subject, or as a `:has()` argument; structural-coupled when used in `:nth-child(...)` etc.\n *\n * For a combinator-free resolver (Tailwind utilities — no `complexSelectors()`), this degrades to the\n * null index so behaviour is unchanged.\n */\nexport function buildSelectorIndex(doc: IRDocument, resolver: StyleResolver): SelectorIndex {\n if (!hasComplexSelectors(resolver) || resolver.complexSelectors().length === 0) {\n return createNullSelectorIndex();\n }\n\n const combinator = new Set<IRNodeId>();\n const structural = new Set<IRNodeId>();\n\n for (const id of elementIds(doc)) {\n const el = getElement(doc, id);\n if (!el) continue;\n for (const seg of el.classes.segments) {\n if (seg.kind !== 'static') continue;\n for (const t of seg.tokens) {\n const u = resolver.selectorUsage(t.value);\n // Combinator coupling: descendant/child ancestor, sibling subject, or `:has()` argument —\n // reparenting/removing the element would change a combinator match-set.\n if (u.asAncestor || u.asSibling || u.asHasArgument) combinator.add(id);\n if (u.asStructural) structural.add(id);\n }\n }\n }\n\n // reparentImpact(id): non-empty when removing/unwrapping `id` would change a combinator/structural\n // match-set — `id` itself is coupled (its own match), or it is the matched ancestor of a child\n // (removing it reparents that child out of the relation). Self + element children is conservative\n // and sufficient for the flatten guard.\n const impact = new Map<IRNodeId, Set<IRNodeId>>();\n for (const id of elementIds(doc)) {\n const el = getElement(doc, id);\n if (!el) continue;\n if (!combinator.has(id) && !structural.has(id)) continue;\n const set = new Set<IRNodeId>([id]);\n for (const c of el.children) {\n const cn = doc.nodes.get(c);\n if (cn && cn.kind === 'element') set.add(c);\n }\n impact.set(id, set);\n }\n\n const empty: ReadonlySet<IRNodeId> = new Set();\n return {\n targetedByCombinator: (id: IRNodeId): boolean => combinator.has(id),\n targetedByStructuralPseudo: (id: IRNodeId): boolean => structural.has(id),\n reparentImpact: (id: IRNodeId): ReadonlySet<IRNodeId> => impact.get(id) ?? empty,\n };\n}\n\n/* ───────────────────────── rewrite factory (emits origin-free drafts) ───────────────────────── */\n\n/** Every {@link NodeLike}/{@link ElementLike} carries a readonly `id`. */\nfunction idOf(n: ElementLike | NodeLike): IRNodeId {\n return (n as IRElement).id;\n}\n\n/** The pattern-kit factory: produces op DRAFTS and detached NodeSpecs without any allocation. */\nexport function createRewriteFactory(): RewriteFactory {\n return {\n unwrap(target: ElementLike): RewriteOpDraft {\n return { op: 'unwrap', target: idOf(target) };\n },\n removeNode(target: NodeLike): RewriteOpDraft {\n return { op: 'removeNode', target: idOf(target) };\n },\n replaceWith(target: NodeLike, replacement: NodeSpec): RewriteOpDraft {\n return { op: 'replaceWith', target: idOf(target), replacement };\n },\n wrap(target: NodeLike, wrapper: ElementSpec): RewriteOpDraft {\n return { op: 'wrap', target: idOf(target), wrapper };\n },\n insertBefore(anchor: NodeLike, node: NodeSpec): RewriteOpDraft {\n return { op: 'insertBefore', anchor: idOf(anchor), node };\n },\n insertAfter(anchor: NodeLike, node: NodeSpec): RewriteOpDraft {\n return { op: 'insertAfter', anchor: idOf(anchor), node };\n },\n moveNode(target: NodeLike, newParent: ElementLike, index: number): RewriteOpDraft {\n return { op: 'moveNode', target: idOf(target), newParent: idOf(newParent), index };\n },\n mergeSiblings(first: NodeLike, second: NodeLike): RewriteOpDraft {\n return { op: 'mergeSiblings', first: idOf(first), second: idOf(second) };\n },\n setClassList(target: ElementLike, style: StyleMap, preserveOpaque = true): RewriteOpDraft {\n return { op: 'setClassList', target: idOf(target), style, preserveOpaque };\n },\n mergeStyle(\n target: ElementLike,\n source: ElementLike | null,\n style: StyleMap,\n onConflict: StyleConflictPolicy = 'abort',\n ): RewriteOpDraft {\n return {\n op: 'mergeStyle',\n target: idOf(target),\n source: source ? idOf(source) : null,\n style,\n onConflict,\n };\n },\n foldInheritedStyles(\n from: ElementLike,\n into: ElementLike | readonly ElementLike[],\n opts?: { only?: readonly import('./types').CssProperty[]; conditions?: 'base' | 'all' },\n ): RewriteOpDraft {\n const list: readonly ElementLike[] = Array.isArray(into)\n ? (into as readonly ElementLike[])\n : [into as ElementLike];\n return {\n op: 'foldInheritedStyles',\n from: idOf(from),\n into: list.map((t) => idOf(t)),\n properties: opts?.only ?? 'all-inherited',\n conditions: opts?.conditions ?? 'base',\n };\n },\n element(spec: ElementSpec): NodeSpec {\n return spec;\n },\n text(value: string): NodeSpec {\n return { kind: 'text', value };\n },\n keep(node: NodeLike): NodeSpec {\n return { kind: 'ref', ref: idOf(node) };\n },\n };\n}\n\n/* ───────────────────────── match context ───────────────────────── */\n\nfunction ro<T>(v: T): DeepReadonly<T> {\n return v as DeepReadonly<T>;\n}\n\nfunction buildMatchContext(\n doc: IRDocument,\n elementId: IRNodeId,\n resolver: StyleResolver,\n selectors: SelectorIndex,\n safety: import('./types').SafetyLevel,\n phase: PassPhase,\n iteration: number,\n): MatchContext {\n const self = getElement(doc, elementId)!;\n\n const parentEl = (): DeepReadonly<IRElement> | null => {\n if (self.parent == null) return null;\n const p = doc.nodes.get(self.parent);\n return p && p.kind === 'element' ? ro(p) : null;\n };\n\n const elementChildren = (): readonly DeepReadonly<IRElement>[] => {\n const out: DeepReadonly<IRElement>[] = [];\n for (const c of self.children) {\n const cn = doc.nodes.get(c);\n if (cn && cn.kind === 'element') out.push(ro(cn));\n }\n return out;\n };\n\n const ancestors = (): readonly DeepReadonly<IRElement>[] => {\n const out: DeepReadonly<IRElement>[] = [];\n let cur: IRNodeId | null = self.parent;\n while (cur != null) {\n const n: IRNode | undefined = doc.nodes.get(cur);\n if (!n) break;\n if (n.kind === 'element') out.push(ro(n));\n cur = n.parent;\n }\n return out;\n };\n\n const siblingAt = (delta: number): DeepReadonly<IRNode> | null => {\n if (self.parent == null) return null;\n const p = doc.nodes.get(self.parent);\n if (!p || (p.kind !== 'element' && p.kind !== 'fragment')) return null;\n const i = p.children.indexOf(elementId);\n const sib = p.children[i + delta];\n if (sib == null) return null;\n const sn = doc.nodes.get(sib);\n return sn ? ro(sn) : null;\n };\n\n const computedOf = (n: NodeLike): StyleMap => {\n const node = doc.nodes.get((n as IRNode).id);\n return node && node.kind === 'element' ? node.computed : emptyStyleMap();\n };\n\n return {\n node: ro(self),\n doc: ro(doc),\n resolver,\n selectors,\n safety,\n phase,\n iteration,\n parent: parentEl,\n elementChildren,\n onlyElementChild(): DeepReadonly<IRElement> | null {\n const els = elementChildren();\n return els.length === 1 ? els[0]! : null;\n },\n computed(): StyleMap {\n return self.computed;\n },\n computedOf,\n isOpaque(n?: ElementLike): boolean {\n const target = n ? doc.nodes.get((n as IRElement).id) : self;\n if (!target || target.kind !== 'element') return true;\n return target.classes.opaque || target.meta.hasSpreadAttrs;\n },\n ancestors,\n closest(pred): DeepReadonly<IRElement> | null {\n for (const a of ancestors()) if (pred(a)) return a;\n return null;\n },\n prevSibling(): DeepReadonly<IRNode> | null {\n return siblingAt(-1);\n },\n nextSibling(): DeepReadonly<IRNode> | null {\n return siblingAt(1);\n },\n nthChildIndex(): number {\n if (self.parent == null) return 1;\n const p = doc.nodes.get(self.parent);\n if (!p || (p.kind !== 'element' && p.kind !== 'fragment')) return 1;\n let idx = 0;\n for (const c of p.children) {\n const cn = doc.nodes.get(c);\n if (cn && cn.kind === 'element') {\n idx += 1;\n if (c === elementId) return idx;\n }\n }\n return idx;\n },\n };\n}\n\n/* ───────────────────────── the pass manager ───────────────────────── */\n\nfunction stampOrigin(draft: RewriteOpDraft, pattern: Pattern): RewriteOp {\n return {\n ...draft,\n origin: { pattern: pattern.name, category: pattern.category, safety: pattern.safety },\n } as RewriteOp;\n}\n\nfunction patternsForPhase(passes: readonly Pass[], phase: PassPhase): Pattern[] {\n const out: Pattern[] = [];\n for (const pass of passes) {\n if (pass.phase !== phase) continue;\n for (const p of pass.patterns) out.push(p);\n }\n out.sort((a, b) => (b.priority ?? 0) - (a.priority ?? 0));\n return out;\n}\n\ninterface RunState {\n doc: IRDocument;\n}\n\n/* ───────────────────────── flatten residual-skip (never drop an unreproducible style) ───────────────────────── */\n\n/** A throwaway {@link SyntheticSink} for the emit exactness probe (registrations are discarded). */\nfunction probeSink(): SyntheticSink {\n return {\n register(s): string {\n return s.className;\n },\n drain(): readonly never[] {\n return [];\n },\n };\n}\n\n/** Nodes a group writes STYLE onto (the survivors a flatten transfers declarations to). */\nfunction styleWriteTargets(ops: readonly RewriteOp[]): IRNodeId[] {\n const ids: IRNodeId[] = [];\n for (const op of ops) {\n if (op.op === 'mergeStyle' || op.op === 'setClassList') ids.push(op.target);\n else if (op.op === 'foldInheritedStyles') ids.push(...op.into);\n }\n return ids;\n}\n\n/** True iff the resolver can EXACTLY reverse-emit `sm` (no residual). An empty map is trivially exact. */\nfunction emitIsExact(resolver: StyleResolver, normalizer: StyleNormalizer, sm: StyleMap): boolean {\n if (sm.blocks.size === 0) return true;\n try {\n const ctx: EmitContext = { normalizer, sink: probeSink() };\n const r = resolver.emit(sm, ctx);\n return r.exact && r.residual == null;\n } catch {\n return true; // a throwing resolver must never block a flatten\n }\n}\n\n/**\n * T5 — flatten must never DROP a style it can't reproduce. After a flatten transfers declarations onto\n * a surviving (rewritable) element, if the resolver can no longer EXACTLY reverse-emit that element's\n * computed style — and it could before — the flatten would silently lose the residual declarations\n * during reverse-emit, so the whole flatten is reverted (the wrapper is kept). Pre-existing residue\n * (already non-exact before the flatten) is not blamed on the flatten and does not trigger a revert.\n */\nfunction flattenWouldDropStyle(\n before: IRDocument,\n after: IRDocument,\n ops: readonly RewriteOp[],\n resolver: StyleResolver,\n normalizer: StyleNormalizer,\n): boolean {\n for (const id of styleWriteTargets(ops)) {\n const newEl = getElement(after, id);\n if (!newEl) continue; // target was itself removed — its style lives on the survivor we also check\n // Opaque / dynamic class lists are kept verbatim by reverse-emit, so no style is dropped there.\n if (newEl.classes.opaque || newEl.classes.hasDynamic) continue;\n if (emitIsExact(resolver, normalizer, newEl.computed)) continue;\n const oldEl = getElement(before, id);\n const wasExact = !oldEl || emitIsExact(resolver, normalizer, oldEl.computed);\n if (wasExact) return true; // the flatten introduced an unreproducible style → revert\n }\n return false;\n}\n\n/**\n * One sweep of a phase: evaluate every pattern against every live element, collect op drafts,\n * stamp origin, apply. Returns the number of ops successfully applied (0 ⇒ fixpoint for this\n * phase). Pattern throws are isolated into `DF_PATTERN_THREW` diagnostics.\n */\nfunction runSweep(\n state: RunState,\n patterns: readonly Pattern[],\n ctx: ApplyContext,\n factory: RewriteFactory,\n phase: PassPhase,\n iteration: number,\n touched: Set<IRNodeId>,\n diagnostics: Diagnostic[],\n flattenBarred: Set<IRNodeId>,\n): number {\n let appliedOps = 0;\n const resolver = ctx.resolver;\n const selectors = ctx.selectors;\n\n for (const elId of elementIds(state.doc)) {\n const el = getElement(state.doc, elId);\n if (!el) continue; // removed earlier in this sweep\n // T5: a wrapper whose specialized flatten had to revert (its compensating style is not\n // reproducible by the resolver) is barred from ALL further flattening — otherwise a generic\n // pattern (e.g. passthrough-wrapper) would strip it anyway and silently drop the very style the\n // revert preserved. Compress/extract phases are unaffected.\n if (phase === 'flatten' && flattenBarred.has(elId)) continue;\n\n for (const pattern of patterns) {\n if (pattern.safety > ctx.safetyCeiling) continue;\n let drafts: readonly RewriteOpDraft[] = [];\n try {\n const mctx = buildMatchContext(\n state.doc,\n elId,\n resolver,\n selectors,\n ctx.safetyCeiling,\n phase,\n iteration,\n );\n const result = pattern.evaluate(mctx, factory);\n if (!result) continue;\n drafts = result.ops;\n if (result.diagnostics) for (const d of result.diagnostics) diagnostics.push(d);\n } catch (err) {\n diagnostics.push({\n code: 'DF_PATTERN_THREW',\n severity: 'error',\n message: `pattern '${pattern.name}' threw: ${String((err as Error)?.message ?? err)}`,\n nodeId: elId,\n pattern: pattern.name,\n phase,\n iteration,\n cause: err,\n });\n continue;\n }\n\n if (drafts.length === 0) continue;\n const ops = drafts.map((d) => stampOrigin(d, pattern));\n const outcome = applyOps(state.doc, ops, ctx);\n for (const d of outcome.result.diagnostics) diagnostics.push(d);\n if (outcome.result.appliedGroups > 0) {\n // T5: a flatten must never drop a style the resolver can't re-emit — revert on residual.\n if (\n phase === 'flatten' &&\n flattenWouldDropStyle(state.doc, outcome.doc, ops, resolver, ctx.normalizer)\n ) {\n diagnostics.push({\n code: 'DF_VERIFY_REVERTED',\n severity: 'warn',\n message:\n `flatten '${pattern.name}' reverted on node ${elId}: residual style is not ` +\n `reproducible by resolver '${resolver.id}', so flattening would drop it`,\n nodeId: elId,\n pattern: pattern.name,\n phase,\n iteration,\n });\n // Discard the outcome (keep the wrapper) AND bar this node from any further flatten this\n // run, so no other flatten pattern can strip the wrapper after the specialized one bailed.\n flattenBarred.add(elId);\n break;\n }\n state.doc = outcome.doc;\n appliedOps += outcome.result.appliedGroups;\n for (const id of outcome.result.touched) touched.add(id);\n for (const id of outcome.result.created) touched.add(id);\n // tree changed → restart pattern evaluation for this element next iteration\n break;\n }\n }\n }\n return appliedOps;\n}\n\n/** Cheap structural fingerprint of the document for oscillation detection. */\nfunction docFingerprint(doc: IRDocument): string {\n const parts: string[] = [];\n const visit = (id: IRNodeId): void => {\n const n = doc.nodes.get(id);\n if (!n) return;\n parts.push(`${id}:${n.kind}`);\n for (const c of childIds(n)) visit(c);\n };\n visit(doc.root);\n return parts.join('|');\n}\n\n/**\n * Runs `passes` over `doc` to a per-phase fixpoint. This is the concrete entry the pipeline calls\n * (the {@link PassManager} interface keeps passes on the call site; we accept them explicitly here\n * so the manager stays stateless).\n */\nexport function runPasses(\n doc: IRDocument,\n passes: readonly Pass[],\n ctx: ApplyContext,\n config?: FixpointConfig,\n): { readonly doc: IRDocument; readonly results: readonly PhaseRunResult[] } {\n const cfg: FixpointConfig = { ...DEFAULT_FIXPOINT, ...config };\n const factory = createRewriteFactory();\n const state: RunState = { doc };\n const results: PhaseRunResult[] = [];\n // Nodes barred from flattening after an emittability revert (T5) — persists across sweeps/phases.\n const flattenBarred = new Set<IRNodeId>();\n\n for (const phase of PHASE_ORDER) {\n const patterns = patternsForPhase(passes, phase);\n const phaseTouched = new Set<IRNodeId>();\n const diagnostics: Diagnostic[] = [];\n const budget = cfg.phases[phase] ?? cfg.maxIterations;\n\n let iterations = 0;\n let converged = false;\n let haltReason: HaltReason = 'converged';\n const seen = new Set<string>();\n\n if (patterns.length === 0) {\n results.push({\n phase,\n iterations: 0,\n converged: true,\n haltReason: 'converged',\n touched: phaseTouched,\n diagnostics,\n });\n continue;\n }\n\n while (iterations < budget) {\n iterations += 1;\n const applied = runSweep(\n state,\n patterns,\n ctx,\n factory,\n phase,\n iterations,\n phaseTouched,\n diagnostics,\n flattenBarred,\n );\n\n if (applied === 0) {\n converged = true;\n haltReason = 'converged';\n break;\n }\n\n if (cfg.detectOscillation) {\n const fp = docFingerprint(state.doc);\n if (seen.has(fp)) {\n haltReason = 'oscillation';\n diagnostics.push({\n code: 'DF_FIXPOINT_OSCILLATION',\n severity: 'warn',\n message: `phase '${phase}' oscillated; halting`,\n phase,\n iteration: iterations,\n });\n break;\n }\n seen.add(fp);\n }\n }\n\n if (!converged && haltReason !== 'oscillation') {\n haltReason = 'budget';\n diagnostics.push({\n code: 'DF_FIXPOINT_BUDGET',\n severity: cfg.onBudgetExhausted === 'error' ? 'error' : 'warn',\n message: `phase '${phase}' exhausted ${budget}-iteration budget`,\n phase,\n iteration: iterations,\n });\n }\n\n results.push({\n phase,\n iterations,\n converged,\n haltReason,\n touched: phaseTouched,\n diagnostics,\n });\n }\n\n return { doc: state.doc, results };\n}\n\n/** A {@link PassManager} that runs the given passes (carried on the manager instance). */\nexport function createPassManager(passes: readonly Pass[]): PassManager {\n return {\n run(doc: IRDocument, ctx: ApplyContext, config?: FixpointConfig): readonly PhaseRunResult[] {\n return runPasses(doc, passes, ctx, config).results;\n },\n };\n}\n","/**\n * @domflax/core — the pure, single-file pipeline.\n *\n * Wires injected interfaces together: {@link Frontend} → resolve → {@link PassManager} →\n * {@link Backend}. Core itself stays dependency-free; the resolver, frontend, and backend are all\n * supplied by the caller, so no heavy third-party libs ever reach this package.\n */\n\nimport type {\n ApplyContext,\n Backend,\n BackendContext,\n CodegenResult,\n Diagnostic,\n EditPlan,\n Frontend,\n FrontendParseContext,\n IRDocument,\n IRElement,\n PassPhase,\n Pipeline,\n PipelineInput,\n PipelineOutput,\n PipelineStats,\n SourceSpan,\n StyleMap,\n SyntheticClass,\n SyntheticSink,\n} from './types';\n\nimport { elementIds, getElement } from './builders';\nimport { createNullSelectorIndex, runPasses } from './pass-manager';\n\n/* ───────────────────────── synthetic sink ───────────────────────── */\n\n/** A minimal in-memory {@link SyntheticSink}: dedupes by className, drains in insertion order. */\nexport function createSyntheticSink(): SyntheticSink {\n const map = new Map<string, SyntheticClass>();\n return {\n register(s: SyntheticClass): string {\n if (!map.has(s.className)) map.set(s.className, s);\n return s.className;\n },\n drain(): readonly SyntheticClass[] {\n return [...map.values()];\n },\n };\n}\n\n/* ───────────────────────── resolve step ───────────────────────── */\n\nfunction staticClassTokens(el: IRElement): string[] {\n const out: string[] = [];\n for (const seg of el.classes.segments) {\n if (seg.kind === 'static') for (const t of seg.tokens) out.push(t.value);\n }\n return out;\n}\n\n/**\n * Populate each element's `computed` StyleMap from its author classes via the injected resolver.\n * Opaque/spread elements and elements without static classes are left untouched. Resolver throws\n * are isolated into diagnostics (a stub resolver may legitimately be NotImplemented).\n */\nfunction resolveStyles(\n doc: IRDocument,\n input: PipelineInput,\n diagnostics: Diagnostic[],\n): void {\n const { resolver, normalizer } = input;\n for (const id of elementIds(doc)) {\n const el = getElement(doc, id);\n if (!el || el.classes.opaque) continue;\n const tokens = staticClassTokens(el);\n if (tokens.length === 0) continue;\n try {\n const result = resolver.resolve({\n classes: tokens,\n element: {\n tagName: el.tag,\n namespace: el.namespace === 'svg' ? 'svg' : 'html',\n },\n });\n let styles: StyleMap = result.styles;\n try {\n styles = normalizer.normalizeStyleMap(styles);\n } catch {\n /* normalizer is optional/stubbed — keep raw styles */\n }\n el.computed = styles;\n for (const w of result.warnings) {\n diagnostics.push({\n code: 'DF_STYLE_CONFLICT_UNRESOLVED',\n severity: w.severity,\n message: w.message,\n nodeId: id,\n });\n }\n } catch (err) {\n diagnostics.push({\n code: 'DF_OP_PRECONDITION_FAILED',\n severity: 'debug',\n message: `resolve skipped for <${el.tag}>: ${String((err as Error)?.message ?? err)}`,\n nodeId: id,\n cause: err,\n });\n }\n }\n}\n\n/* ───────────────────────── the pipeline ───────────────────────── */\n\nconst ZERO_ITERATIONS: Readonly<Record<PassPhase, number>> = {\n flatten: 0,\n compress: 0,\n extract: 0,\n};\n\nclass DefaultPipeline implements Pipeline {\n run(input: PipelineInput): PipelineOutput {\n const startedAt = now();\n const diagnostics: Diagnostic[] = [];\n const report = (d: Diagnostic): void => {\n diagnostics.push(d);\n input.reporter?.report(d);\n };\n\n // 1. PARSE ────────────────────────────────────────────────────────────\n const parseCtx: FrontendParseContext = {\n id: input.id,\n kind: input.kind,\n resolver: input.resolver,\n normalizer: input.normalizer,\n config: { preserveComments: input.config?.preserveComments ?? true },\n onDiagnostic: report,\n };\n if (input.babelAst !== undefined) parseCtx.babelAst = input.babelAst;\n\n const parsed = input.frontend.parse(input.code, parseCtx);\n for (const d of parsed.diagnostics) report(d);\n const doc = parsed.doc;\n const nodesIn = doc.nodes.size;\n\n // 2. RESOLVE ──────────────────────────────────────────────────────────\n resolveStyles(doc, input, diagnostics);\n\n // 3. PASSES (fixpoint per phase) ──────────────────────────────────────\n const ctx: ApplyContext = {\n doc,\n safetyCeiling: input.config?.safety ?? 2,\n normalizer: input.normalizer,\n selectors: createNullSelectorIndex(),\n resolver: input.resolver,\n };\n const { doc: optimized, results } = runPasses(doc, input.passes, ctx, fixpointFrom(input));\n\n let opsApplied = 0;\n const iterations: Record<PassPhase, number> = { ...ZERO_ITERATIONS };\n for (const r of results) {\n iterations[r.phase] = r.iterations;\n for (const d of r.diagnostics) {\n diagnostics.push(d);\n input.reporter?.report(d);\n }\n opsApplied += r.touched.size;\n }\n\n // 4. PRINT ────────────────────────────────────────────────────────────\n const editPlan: EditPlan = {\n moduleId: input.id,\n ops: [],\n provenance: new Map(),\n };\n const backendCtx: BackendContext = {\n normalizer: input.normalizer,\n resolver: input.resolver,\n sink: createSyntheticSink(),\n eol: eolOf(optimized),\n onDiagnostic: report,\n };\n const printed: CodegenResult = input.backend.print(optimized, editPlan, backendCtx);\n for (const d of printed.diagnostics) {\n diagnostics.push(d);\n input.reporter?.report(d);\n }\n\n // 5. ASSEMBLE OUTPUT ──────────────────────────────────────────────────\n const stats: PipelineStats = {\n nodesIn,\n nodesOut: optimized.nodes.size,\n opsApplied,\n iterations,\n durationMs: now() - startedAt,\n };\n const touched: readonly SourceSpan[] = printed.edits.map((e) => e.span);\n\n return {\n code: printed.code,\n map: printed.map,\n changed: printed.code !== input.code,\n touched,\n diagnostics,\n stats,\n doc: optimized,\n editPlan,\n };\n }\n}\n\nfunction fixpointFrom(input: PipelineInput): import('./types').FixpointConfig | undefined {\n const fp = input.config?.fixpoint;\n if (!fp) return undefined;\n return {\n maxIterations: fp.maxIterations ?? 16,\n phases: fp.phases ?? {},\n onBudgetExhausted: fp.onBudgetExhausted ?? 'warn',\n detectOscillation: fp.detectOscillation ?? true,\n };\n}\n\nfunction eolOf(doc: IRDocument): '\\n' | '\\r\\n' {\n for (const src of doc.sources.values()) return src.eol;\n return '\\n';\n}\n\n// `performance` is a host global (node20 / browser) not covered by the ES2023 lib;\n// declared minimally so the runtime feature-detection below stays type-safe.\ndeclare const performance: { now(): number } | undefined;\n\nfunction now(): number {\n return typeof performance !== 'undefined' && typeof performance.now === 'function'\n ? performance.now()\n : Date.now();\n}\n\n/** Build the pure single-file {@link Pipeline}. */\nexport function createPipeline(): Pipeline {\n return new DefaultPipeline();\n}\n","/**\n * @domflax/core — the shared reverse-emit step (computed → className).\n *\n * The backend re-prints `className` from each element's {@link ClassList}, but the pass manager\n * records optimized styles on `computed`. This module folds those optimized computed styles back\n * into the element's static class tokens, and is the SINGLE source of truth shared by every\n * orchestrator (the `domflax` meta package, `@domflax/cli`, and the pattern auto-test harness) so\n * their pipelines cannot diverge.\n *\n * ## REPLACE, not append\n *\n * For every TOUCHED, rewritable (non-opaque, non-dynamic) element we ask the resolver for the\n * MINIMAL class set reproducing the element's FULL computed style (`resolver.emit(el.computed)`),\n * then REPLACE the element's static tokens with it — rather than appending. Replacing is what lets\n * a compress pass actually shorten output: `px-4 py-4` collapses to `p-4`, equal `w/h` to `size-*`,\n * the four insets to `inset-0`, and fully-overridden duplicates simply disappear.\n *\n * ## Droppability gate (never lose a load-bearing class)\n *\n * A token is only removed when `resolver.selectorUsage(token).droppable` is true — i.e. it is a\n * plain, resolver-owned utility whose entire contribution is reproducible from `computed`. Tokens\n * that are unknown to the resolver, opaque (combinator/at-rule utilities whose effect never folds\n * onto the element's own box), variant-bound, or referenced by a custom-CSS selector are NOT\n * droppable and are preserved verbatim. As a safety net, if `emit` produces nothing at all we leave\n * the element's tokens untouched (a resolver that failed to load must never erase classes).\n */\n\nimport { elementIds, getElement } from './builders';\nimport { createSyntheticSink } from './pipeline';\nimport type {\n ClassList,\n ClassSegment,\n ClassToken,\n EmitContext,\n IRDocument,\n StyleNormalizer,\n StyleResolver,\n} from './types';\n\n/** All static class tokens of a {@link ClassList}, in source order. */\nfunction staticTokensOf(cl: ClassList): string[] {\n const out: string[] = [];\n for (const seg of cl.segments) {\n if (seg.kind === 'static') for (const t of seg.tokens) out.push(t.value);\n }\n return out;\n}\n\n/** A rewritable static {@link ClassList} over `tokens`, preserving the previous list's spans. */\nfunction staticClassList(prev: ClassList, tokens: readonly string[]): ClassList {\n const classTokens: ClassToken[] = tokens.map((value) => ({ value }));\n const seg: ClassSegment = { kind: 'static', tokens: classTokens };\n return {\n form: 'string-literal',\n segments: [seg],\n valueSpan: prev.valueSpan,\n attrSpan: prev.attrSpan,\n hasDynamic: false,\n opaque: false,\n rewritable: true,\n };\n}\n\n/** Two token lists are equal iff same length and same tokens in the same order. */\nfunction sameTokens(a: readonly string[], b: readonly string[]): boolean {\n if (a.length !== b.length) return false;\n for (let i = 0; i < a.length; i += 1) if (a[i] !== b[i]) return false;\n return true;\n}\n\n/**\n * Fold every TOUCHED, rewritable element's optimized computed style back into the MINIMAL static\n * class-token set (see module docs). Mutates `doc` in place.\n */\nexport function syncClassesFromComputed(\n doc: IRDocument,\n resolver: StyleResolver,\n norm: StyleNormalizer,\n): void {\n const sink = createSyntheticSink();\n for (const id of elementIds(doc)) {\n const el = getElement(doc, id);\n if (!el || !el.meta.touched) continue;\n if (el.classes.opaque || el.classes.hasDynamic) continue;\n\n const tokens = staticTokensOf(el.classes);\n\n // Minimal class set reproducing the FULL computed style.\n const ctx: EmitContext = { normalizer: norm, sink };\n const emitted = resolver.emit(el.computed, ctx).classes;\n // A resolver that reverse-synthesized nothing must never erase the element's classes.\n if (emitted.length === 0) continue;\n\n const emittedSet = new Set(emitted);\n const next: string[] = [];\n const seen = new Set<string>();\n\n // 1. Keep each existing token that is either NOT droppable (unknown / opaque / variant /\n // selector-bound) or still part of the emitted minimal set — preserving source order.\n for (const t of tokens) {\n if (seen.has(t)) continue;\n const keep = emittedSet.has(t) || !resolver.selectorUsage(t).droppable;\n if (keep) {\n next.push(t);\n seen.add(t);\n }\n }\n // 2. Append any newly-emitted classes not already present, in emit order.\n for (const c of emitted) {\n if (seen.has(c)) continue;\n next.push(c);\n seen.add(c);\n }\n\n if (sameTokens(next, tokens)) continue; // no churn when nothing actually changed\n el.classes = staticClassList(el.classes, next);\n }\n}\n","/**\n * @domflax/pattern-kit — `definePattern`.\n *\n * A small, eager validator + identity wrapper that turns an author-supplied {@link Pattern} spec\n * into a frozen, contract-checked Pattern. Catching shape errors here (bad category/phase, missing\n * `evaluate`, out-of-range safety) keeps the pass-manager's hot loop free of defensive checks and\n * gives authors an immediate, actionable error at module-load time.\n */\n\nimport type { PassPhase, Pattern, SafetyLevel } from '@domflax/core';\n\nconst PHASES: ReadonlySet<PassPhase> = new Set<PassPhase>(['flatten', 'compress', 'extract']);\nconst SAFETY_LEVELS: ReadonlySet<SafetyLevel> = new Set<SafetyLevel>([0, 1, 2, 3]);\n\nfunction fail(name: string, why: string): never {\n throw new Error(`definePattern(${name || '<anonymous>'}): ${why}`);\n}\n\n/**\n * Validate and freeze a {@link Pattern}. Throws on any contract violation; otherwise returns the\n * (shallow-frozen) spec unchanged so it can be registered into a {@link Pass}.\n */\nexport function definePattern(spec: Pattern): Pattern {\n if (spec == null || typeof spec !== 'object') {\n throw new Error('definePattern: spec must be an object');\n }\n\n const name = spec.name;\n if (typeof name !== 'string' || name.length === 0) {\n fail(String(name), 'name must be a non-empty string');\n }\n\n if (typeof spec.category !== 'string' || !spec.category.includes('/')) {\n fail(name, `category must be a \"<phase>/<slug>\" string (got ${JSON.stringify(spec.category)})`);\n }\n\n const phase = spec.category.split('/', 1)[0] as PassPhase;\n if (!PHASES.has(phase)) {\n fail(name, `category phase must be one of flatten|compress|extract (got \"${phase}\")`);\n }\n\n if (!SAFETY_LEVELS.has(spec.safety)) {\n fail(name, `safety must be 0|1|2|3 (got ${JSON.stringify(spec.safety)})`);\n }\n\n if (typeof spec.evaluate !== 'function') {\n fail(name, 'evaluate must be a function');\n }\n\n if (spec.priority !== undefined && !Number.isFinite(spec.priority)) {\n fail(name, 'priority must be a finite number when provided');\n }\n\n return Object.freeze({ ...spec });\n}\n","/**\n * @domflax/pattern-kit — the shared StyleMap normalizer.\n *\n * A single, syntactic-only {@link StyleNormalizer} implementation that core, the patterns, and the\n * verifier all reuse so they agree, byte-for-byte, on what two style declarations \"mean\". It NEVER\n * resolves initial/inherited/computed defaults (that is the verifier's job) — it only:\n *\n * • canonicalizes colors (`transparent` ⇒ `rgba(0, 0, 0, 0)`, hex lower-cased + 3→6 expanded,\n * `rgb()/rgba()/hsl()/hsla()` argument spacing normalized),\n * • canonicalizes units (whitespace collapsed, zero-lengths `0px`/`0%`/… ⇒ `0`),\n * • expands a fixed set of box shorthands to longhands (`padding`/`margin`/`inset`/`border-width`\n * into their four sides, `gap` into `row-gap`/`column-gap`),\n * • orders declarations by property for stable comparison.\n *\n * Dependency-free: only `@domflax/core` (types + the StyleMap builder helpers).\n */\n\nimport type {\n CssProperty,\n CssValue,\n ConditionKey,\n InheritedPropertyTable,\n StyleBlock,\n StyleDecl,\n StyleMap,\n StyleNormalizer,\n} from '@domflax/core';\n\nimport { conditionKey, emptyStyleMap } from '@domflax/core';\n\n/* ───────────────────────── inherited-property table ───────────────────────── */\n\n/**\n * Canonical, versioned set of inherited CSS longhands. Any author custom property (`--*`) is\n * also treated as inherited via the `isInherited` predicate.\n */\nconst INHERITED_PROPERTIES: readonly string[] = [\n 'azimuth',\n 'border-collapse',\n 'border-spacing',\n 'caption-side',\n 'color',\n 'cursor',\n 'direction',\n 'empty-cells',\n 'font-family',\n 'font-feature-settings',\n 'font-kerning',\n 'font-size',\n 'font-size-adjust',\n 'font-stretch',\n 'font-style',\n 'font-variant',\n 'font-variant-caps',\n 'font-variant-numeric',\n 'font-weight',\n 'hyphens',\n 'letter-spacing',\n 'line-height',\n 'list-style-image',\n 'list-style-position',\n 'list-style-type',\n 'orphans',\n 'overflow-wrap',\n 'quotes',\n 'tab-size',\n 'text-align',\n 'text-align-last',\n 'text-decoration-color',\n 'text-indent',\n 'text-justify',\n 'text-rendering',\n 'text-shadow',\n 'text-transform',\n 'text-underline-position',\n 'visibility',\n 'white-space',\n 'widows',\n 'word-break',\n 'word-spacing',\n 'writing-mode',\n '-webkit-font-smoothing',\n];\n\nfunction createInheritedTable(): InheritedPropertyTable {\n const properties = new Set<CssProperty>(INHERITED_PROPERTIES as unknown as CssProperty[]);\n return {\n version: 'domflax-inherited@1',\n properties,\n isInherited(property: CssProperty): boolean {\n // Author custom properties (`--*`) inherit by definition.\n return String(property).startsWith('--') || properties.has(property);\n },\n };\n}\n\n/* ───────────────────────── value canonicalization ───────────────────────── */\n\nconst ZERO_LENGTH_RE =\n /\\b0(?:px|em|rem|ex|ch|vh|vw|vmin|vmax|vi|vb|pt|pc|cm|mm|in|q|lh|rlh|fr|deg|rad|turn|s|ms|%)\\b/g;\n\nconst FUNC_ARGS_RE = /\\b(rgba?|hsla?|hwb|lab|lch|oklab|oklch)\\(([^()]*)\\)/gi;\n\nconst RELATIVE_UNIT_RE = /(?:\\d*\\.?\\d+)(?:em|ex|ch|lh)\\b|%/i;\n\n/**\n * Pure, syntactic value canonicalization. Idempotent: `canon(canon(v)) === canon(v)`.\n */\nfunction canonValue(raw: string): string {\n let v = raw.trim().replace(/\\s+/g, ' ');\n\n // Lower-case hex colors (#abc / #aabbcc / #aabbccff).\n v = v.replace(/#([0-9a-fA-F]{3,8})\\b/g, (_m, hex: string) => '#' + hex.toLowerCase());\n\n // Expand 3-digit hex (#abc → #aabbcc) — only when exactly 3 hex digits.\n v = v.replace(\n /#([0-9a-f])([0-9a-f])([0-9a-f])(?![0-9a-f])/g,\n (_m, r: string, g: string, b: string) => `#${r}${r}${g}${g}${b}${b}`,\n );\n\n // Canonical fully-transparent color.\n v = v.replace(/\\btransparent\\b/gi, 'rgba(0, 0, 0, 0)');\n v = v.replace(/#00000000\\b/g, 'rgba(0, 0, 0, 0)');\n\n // Collapse zero lengths/angles/times to a bare `0`.\n v = v.replace(ZERO_LENGTH_RE, '0');\n\n // Normalize the argument spacing of color/space functions: single space after each comma.\n v = v.replace(FUNC_ARGS_RE, (_m, fn: string, args: string) => {\n const parts = args\n .split(',')\n .map((s) => s.trim())\n .filter((s) => s.length > 0);\n return `${fn.toLowerCase()}(${parts.join(', ')})`;\n });\n\n return v;\n}\n\n/** True when the (canonicalized) value uses a parent-relative unit (em/ex/ch/lh/%). */\nfunction isRelativeValue(value: string): boolean {\n return RELATIVE_UNIT_RE.test(value);\n}\n\n/* ───────────────────────── shorthand expansion ───────────────────────── */\n\n/** Box-model shorthands whose 1–4 value form expands to four explicit sides. */\nconst BOX_SIDES: Readonly<Record<string, readonly [string, string, string, string]>> = {\n padding: ['padding-top', 'padding-right', 'padding-bottom', 'padding-left'],\n margin: ['margin-top', 'margin-right', 'margin-bottom', 'margin-left'],\n inset: ['top', 'right', 'bottom', 'left'],\n 'border-width': [\n 'border-top-width',\n 'border-right-width',\n 'border-bottom-width',\n 'border-left-width',\n ],\n 'border-style': [\n 'border-top-style',\n 'border-right-style',\n 'border-bottom-style',\n 'border-left-style',\n ],\n 'border-color': [\n 'border-top-color',\n 'border-right-color',\n 'border-bottom-color',\n 'border-left-color',\n ],\n};\n\n/** Split on top-level whitespace, keeping `fn(a, b)` groups intact. */\nfunction splitTopLevel(value: string): string[] {\n const out: string[] = [];\n let depth = 0;\n let cur = '';\n for (const ch of value) {\n if (ch === '(') depth += 1;\n else if (ch === ')') depth = Math.max(0, depth - 1);\n if (depth === 0 && /\\s/.test(ch)) {\n if (cur.length > 0) {\n out.push(cur);\n cur = '';\n }\n continue;\n }\n cur += ch;\n }\n if (cur.length > 0) out.push(cur);\n return out;\n}\n\n/** Map a 1–4 value box shorthand onto its [top, right, bottom, left] sides. */\nfunction boxFourSides(values: readonly string[]): [string, string, string, string] {\n const [a, b, c, d] = values;\n switch (values.length) {\n case 1:\n return [a!, a!, a!, a!];\n case 2:\n return [a!, b!, a!, b!];\n case 3:\n return [a!, b!, c!, b!];\n default:\n return [a!, b!, c!, d!];\n }\n}\n\n/** Expand one declaration into longhand `[property, value]` pairs (single pair if not shorthand). */\nfunction expandShorthand(prop: string, value: string): Array<[string, string]> {\n const box = BOX_SIDES[prop];\n if (box) {\n const parts = splitTopLevel(value);\n if (parts.length >= 1 && parts.length <= 4) {\n const sides = boxFourSides(parts);\n return box.map((p, i) => [p, sides[i]!] as [string, string]);\n }\n return [[prop, value]];\n }\n\n if (prop === 'gap' || prop === 'grid-gap') {\n const parts = splitTopLevel(value);\n if (parts.length === 1) {\n return [\n ['row-gap', parts[0]!],\n ['column-gap', parts[0]!],\n ];\n }\n if (parts.length === 2) {\n return [\n ['row-gap', parts[0]!],\n ['column-gap', parts[1]!],\n ];\n }\n return [[prop, value]];\n }\n\n return [[prop, value]];\n}\n\n/* ───────────────────────── the normalizer ───────────────────────── */\n\nfunction makeDecl(\n table: InheritedPropertyTable,\n prop: string,\n rawValue: string,\n important: boolean,\n): StyleDecl {\n const property = prop.trim().toLowerCase() as CssProperty;\n const value = canonValue(rawValue) as CssValue;\n return {\n property,\n value,\n important,\n relativeToParent: isRelativeValue(value),\n inherited: table.isInherited(property),\n };\n}\n\nexport function createNormalizer(): StyleNormalizer {\n const inherited = createInheritedTable();\n\n const normalizeDeclaration = (\n prop: string,\n value: string,\n important: boolean,\n ): readonly StyleDecl[] => {\n const p = prop.trim().toLowerCase();\n const expanded = expandShorthand(p, value.trim());\n return expanded.map(([lp, lv]) => makeDecl(inherited, lp, lv, important));\n };\n\n const normalizeValue = (prop: CssProperty, raw: string): CssValue => {\n void prop;\n return canonValue(raw) as CssValue;\n };\n\n const normalizeStyleMap = (sm: StyleMap): StyleMap => {\n const blocks = new Map<ConditionKey, StyleBlock>();\n for (const block of sm.blocks.values()) {\n const decls = new Map<CssProperty, StyleDecl>();\n // Re-canonicalize every value and re-key (the decls are already longhand).\n for (const decl of block.decls.values()) {\n const next: StyleDecl = {\n ...decl,\n value: canonValue(String(decl.value)) as CssValue,\n relativeToParent: isRelativeValue(String(decl.value)),\n inherited: inherited.isInherited(decl.property),\n };\n decls.set(next.property, next);\n }\n // Property-sorted for deterministic iteration/serialization.\n const sorted = new Map<CssProperty, StyleDecl>(\n [...decls.entries()].sort((a, b) => (a[0] < b[0] ? -1 : a[0] > b[0] ? 1 : 0)),\n );\n const key = conditionKey(block.condition);\n blocks.set(key, { condition: block.condition, decls: sorted });\n }\n return { blocks };\n };\n\n const equals = (a: StyleMap, b: StyleMap): boolean => {\n const na = normalizeStyleMap(a);\n const nb = normalizeStyleMap(b);\n if (na.blocks.size !== nb.blocks.size) return false;\n for (const [key, blockA] of na.blocks) {\n const blockB = nb.blocks.get(key);\n if (!blockB) return false;\n if (blockA.decls.size !== blockB.decls.size) return false;\n for (const [prop, declA] of blockA.decls) {\n const declB = blockB.decls.get(prop);\n if (!declB) return false;\n if (declA.value !== declB.value || declA.important !== declB.important) return false;\n }\n }\n return true;\n };\n\n return {\n version: 'domflax-normalizer@1',\n normalizeDeclaration,\n normalizeValue,\n normalizeStyleMap,\n equals,\n inherited,\n };\n}\n\n/** The shared, process-wide normalizer instance reused by core / patterns / verify. */\nexport const normalizer: StyleNormalizer = createNormalizer();\n\n/* ───────────────────────── superset helper (used by `computed()` matcher) ───────────────────────── */\n\n/**\n * True when `full` contains every declaration of `partial` with an equal normalized value\n * (a per-condition, per-declaration superset test). Both maps are normalized first so the\n * comparison is meaning-based, not string-based. Empty `partial` ⇒ always `true`.\n */\nexport function isStyleSuperset(\n full: StyleMap,\n partial: StyleMap,\n norm: StyleNormalizer = normalizer,\n): boolean {\n const nf = norm.normalizeStyleMap(full);\n const np = norm.normalizeStyleMap(partial);\n for (const [key, want] of np.blocks) {\n const have = nf.blocks.get(key) ?? nf.blocks.get(conditionKey(want.condition));\n if (!have) return false;\n for (const [prop, decl] of want.decls) {\n const got = have.decls.get(prop);\n if (!got || got.value !== decl.value) return false;\n }\n }\n return true;\n}\n\n/** Re-exported for callers that want to (de)construct keys without importing core directly. */\nexport { emptyStyleMap };\n","/**\n * @domflax/pattern-kit — composable matcher vocabulary.\n *\n * A {@link Matcher} is a PURE predicate over a node + its {@link MatchContext}. Matchers never\n * mutate; they only read the (DeepReadonly) IR and the precomputed targeting/selector facts the\n * context exposes. Authors compose them with {@link and}/{@link or}/{@link not} and feed the\n * result into a pattern's `evaluate`.\n *\n * Style-aware matchers (`computed`, `hasOwnVisualStyle`) reason over the NORMALIZED StyleMap via\n * the shared normalizer in `./normalize`, so they query meaning, not raw CSS strings.\n */\n\nimport type {\n DeepReadonly,\n IRElement,\n IRNode,\n IRNodeId,\n MatchContext,\n NodeLike,\n StyleMap,\n} from '@domflax/core';\n\nimport { isStyleSuperset, normalizer } from './normalize';\n\n/** A pure predicate: does `node` satisfy this condition in the given match context? */\nexport type Matcher = (node: NodeLike, ctx: MatchContext) => boolean;\n\n/* ───────────────────────── internal helpers ───────────────────────── */\n\nfunction asElement(node: NodeLike): DeepReadonly<IRElement> | null {\n const n = node as DeepReadonly<IRNode>;\n return n.kind === 'element' ? (n as DeepReadonly<IRElement>) : null;\n}\n\nfunction elementChildrenOf(\n el: DeepReadonly<IRElement>,\n ctx: MatchContext,\n): DeepReadonly<IRElement>[] {\n const out: DeepReadonly<IRElement>[] = [];\n for (const childId of el.children) {\n const child = ctx.doc.nodes.get(childId);\n if (child && child.kind === 'element') out.push(child as DeepReadonly<IRElement>);\n }\n return out;\n}\n\n/* ───────────────────────── boolean combinators ───────────────────────── */\n\n/** Logical AND. Empty list ⇒ always matches. Short-circuits on the first failure. */\nexport function and(...matchers: readonly Matcher[]): Matcher {\n return (node, ctx) => matchers.every((m) => m(node, ctx));\n}\n\n/** Logical OR. Empty list ⇒ never matches. Short-circuits on the first success. */\nexport function or(...matchers: readonly Matcher[]): Matcher {\n return (node, ctx) => matchers.some((m) => m(node, ctx));\n}\n\n/** Logical NOT. */\nexport function not(matcher: Matcher): Matcher {\n return (node, ctx) => !matcher(node, ctx);\n}\n\n/* ───────────────────────── structural matchers ───────────────────────── */\n\n/** Matches any element; with `tag`, only elements whose (case-insensitive) tag equals it. */\nexport function isElement(tag?: string): Matcher {\n const want = tag?.toLowerCase();\n return (node) => {\n const el = asElement(node);\n if (!el) return false;\n return want === undefined || el.tag.toLowerCase() === want;\n };\n}\n\n/** Matches an element with exactly one ELEMENT child (text/expr/comment children ignored). */\nexport const hasSingleElementChild: Matcher = (node, ctx) => {\n const el = asElement(node);\n if (!el) return false;\n return elementChildrenOf(el, ctx).length === 1;\n};\n\n/* ───────────────────────── style matchers ───────────────────────── */\n\n/**\n * Matches when the node's computed StyleMap is a SUPERSET of `partial` — i.e. every declaration\n * in `partial` is present in `node.computed` with an equal normalized value. Comparison is\n * meaning-based (both sides normalized first). Empty `partial` always matches.\n */\nexport function computed(partial: StyleMap): Matcher {\n return (node, ctx) => {\n const el = asElement(node);\n if (!el) return false;\n const full = ctx.computedOf(el as unknown as NodeLike) ?? (el.computed as StyleMap);\n return isStyleSuperset(full as StyleMap, partial, normalizer);\n };\n}\n\n/** Visual (paint-establishing) properties that count as \"own visual style\", beyond pure layout. */\nconst VISUAL_PROPERTIES: ReadonlySet<string> = new Set<string>([\n 'background',\n 'background-color',\n 'background-image',\n 'border-top-width',\n 'border-right-width',\n 'border-bottom-width',\n 'border-left-width',\n 'border-top-style',\n 'border-right-style',\n 'border-bottom-style',\n 'border-left-style',\n 'border-top-color',\n 'border-right-color',\n 'border-bottom-color',\n 'border-left-color',\n 'border-radius',\n 'box-shadow',\n 'outline',\n 'outline-width',\n 'outline-style',\n 'outline-color',\n 'text-shadow',\n 'filter',\n 'backdrop-filter',\n 'mix-blend-mode',\n 'opacity',\n]);\n\n/** Values that mean \"no paint\" — a visual property set to one of these does NOT count. */\nconst EMPTY_VISUAL_VALUES: ReadonlySet<string> = new Set<string>([\n 'none',\n '0',\n 'normal',\n 'transparent',\n 'rgba(0, 0, 0, 0)',\n 'initial',\n 'unset',\n 'auto',\n]);\n\n/**\n * Matches when the element paints something of its own: a meaningful background, border, shadow,\n * outline, filter, etc. across ANY style condition. Honours the frontend-set `meta.hasOwnVisualStyle`\n * fast-path, then falls back to scanning the normalized computed StyleMap.\n */\nexport const hasOwnVisualStyle: Matcher = (node, ctx) => {\n const el = asElement(node);\n if (!el) return false;\n if (el.meta.hasOwnVisualStyle) return true;\n\n const computedMap = ctx.computedOf(el as unknown as NodeLike) ?? (el.computed as StyleMap);\n const norm = normalizer.normalizeStyleMap(computedMap as StyleMap);\n for (const block of norm.blocks.values()) {\n for (const decl of block.decls.values()) {\n if (!VISUAL_PROPERTIES.has(String(decl.property))) continue;\n if (!EMPTY_VISUAL_VALUES.has(String(decl.value))) return true;\n }\n }\n return false;\n};\n\n/* ───────────────────────── opacity-barrier / meta matchers ───────────────────────── */\n\n/** Element carries a `ref` (hard opacity barrier). */\nexport const hasRef: Matcher = (node) => asElement(node)?.meta.hasRef ?? false;\n\n/** Element has event handlers (onClick, …). */\nexport const hasEventHandlers: Matcher = (node) => asElement(node)?.meta.hasEventHandlers ?? false;\n\n/** Element has dynamic children (mapped/conditional islands). */\nexport const hasDynamicChildren: Matcher = (node) =>\n asElement(node)?.meta.hasDynamicChildren ?? false;\n\n/** Element's class list contains a dynamic segment (template/expr) → not freely rewritable. */\nexport const hasDynamicClasses: Matcher = (node) => asElement(node)?.classes.hasDynamic ?? false;\n\n/**\n * Element is the subject of a combinator selector (`>`/`+`/`~`). Honours the frontend-set meta\n * flag and the precomputed {@link SelectorIndex} in the context.\n */\nexport const targetedByCombinator: Matcher = (node, ctx) => {\n const el = asElement(node);\n if (!el) return false;\n if (el.meta.targetedByCombinator) return true;\n // `el.id` is a branded number; DeepReadonly widens the brand, so re-narrow for the index call.\n return ctx.selectors.targetedByCombinator(el.id as unknown as IRNodeId);\n};\n","/**\n * @domflax/pattern-kit — `pattern()`: a low-boilerplate, declarative authoring surface.\n *\n * `pattern(config)` is pure authoring SUGAR: it compiles down to the existing\n * {@link definePattern}/{@link Pattern} contract (it never replaces the engine). Authors describe\n * the match as a plain DATA object and the rewrite as a named RECIPE; this module maps each key to\n * the existing matcher combinators and op-draft factories, auto-applies the opacity-barrier and\n * selector-safety guards that every `flatten/*` pattern must carry, and threads `doc`/`examples`\n * through. Two escape hatches — a `match` predicate and a `rewrite` function — keep exotic patterns\n * (e.g. ones anchored on a parent fragment) expressible.\n *\n * `style` blocks in the declarative match (and in `childGains`/`mergeStyle` recipes) are PLAIN\n * objects (camelCase or kebab keys) auto-normalized into a superset StyleMap via the shared\n * normalizer — authors never import the normalizer or hand-build a StyleMap.\n */\n\nimport type {\n Captures,\n ConditionKey,\n CssProperty,\n DeepReadonly,\n IRElement,\n IRNode,\n IRNodeId,\n MatchContext,\n MatchResult,\n NodeLike,\n NodeMeta,\n PassCategory,\n PassPhase,\n Pattern,\n PatternDoc,\n PreconditionSketch,\n RewriteFactory,\n RewriteOpDraft,\n SafetyLevel,\n StyleBlock,\n StyleDecl,\n StyleMap,\n StyleOrigin,\n StyleConflictPolicy,\n} from '@domflax/core';\nimport { BASE_CONDITION, conditionKey } from '@domflax/core';\n\nimport {\n and,\n computed,\n hasDynamicChildren,\n hasEventHandlers,\n hasOwnVisualStyle,\n hasRef,\n hasSingleElementChild,\n isElement,\n not,\n targetedByCombinator,\n type Matcher,\n} from './combinators';\nimport { definePattern } from './define';\nimport { normalizer } from './normalize';\n\n/* ───────────────────────── public config shapes ───────────────────────── */\n\n/** A plain CSS style object: camelCase or kebab-case keys, string or number values. */\nexport type PlainStyle = Readonly<Record<string, string | number>>;\n\n/**\n * Declarative match as DATA. Every key maps to one of the existing matcher combinators; an empty\n * object matches any element. Use the `match` FUNCTION escape hatch for anything not expressible\n * here (relational/ancestor/sibling shapes, parent-anchored patterns, …).\n */\nexport interface DeclarativeMatch {\n /** Restrict to a tag (case-insensitive). Omit to match any element. */\n readonly tag?: string;\n /** Computed style the node must be a SUPERSET of (plain object, auto-normalized). */\n readonly style?: PlainStyle;\n /** Require exactly one ELEMENT child. */\n readonly onlyChild?: 'element';\n /** Require the element to paint nothing of its own (no own visual style). */\n readonly paintsNothing?: boolean;\n /** Extra, hand-written predicate AND-ed into the declarative match. */\n readonly where?: Matcher | readonly Matcher[];\n}\n\n/** Escape hatch: a raw match predicate (no auto-guards are added). */\nexport type MatchFn = (node: NodeLike, ctx: MatchContext) => boolean;\n\n/**\n * Flatten recipe: fold inherited styles onto the sole element child (default on), optionally merge\n * `childGains` onto it, then unwrap the node (id-preserving). Mirrors the flatten exemplars.\n */\nexport interface FlattenIntoRecipe {\n readonly flattenInto: 'child';\n /** Plain style merged onto the surviving child (source-wins) before unwrap. */\n readonly childGains?: PlainStyle;\n /** Fold inheritable declarations onto the child first. Default `true`. */\n readonly foldInherited?: boolean;\n}\n\n/** Compress recipe: rebuild the element's class StyleMap; return `null` to decline. */\nexport interface RewriteClassesRecipe {\n readonly rewriteClasses: (computed: StyleMap, ctx: MatchContext) => StyleMap | null;\n /** Keep opaque/selector-bound tokens verbatim. Default `true`. */\n readonly preserveOpaque?: boolean;\n}\n\n/** Compress recipe: drop fully-overridden class tokens (provenance is pruned automatically). */\nexport interface DropClassesRecipe {\n readonly dropClasses: (computed: StyleMap, ctx: MatchContext) => Iterable<string>;\n /** Keep opaque/selector-bound tokens verbatim. Default `true`. */\n readonly preserveOpaque?: boolean;\n}\n\n/** Merge a literal plain style onto the matched element. */\nexport interface MergeStyleRecipe {\n readonly mergeStyle: PlainStyle;\n readonly onConflict?: StyleConflictPolicy;\n}\n\nexport type RewriteRecipe =\n | FlattenIntoRecipe\n | RewriteClassesRecipe\n | DropClassesRecipe\n | MergeStyleRecipe;\n\n/** Escape hatch: a raw rewrite that returns op drafts (or `null`/`[]` for no-op). */\nexport type RewriteFn = (\n ctx: MatchContext,\n rw: RewriteFactory,\n) => readonly RewriteOpDraft[] | null;\n\n/** A before/after positive example, or a no-match (left-unchanged) example. */\nexport type Example =\n | { readonly before: string; readonly after: string }\n | { readonly name?: string; readonly noMatch: string };\n\nexport interface PatternConfig {\n readonly name: string;\n readonly category: PassCategory;\n readonly safety: SafetyLevel;\n readonly priority?: number;\n readonly precondition?: PreconditionSketch;\n readonly doc?: PatternDoc;\n /** Optional worked examples consumed by the auto-test harness (`./testing`). */\n readonly examples?: readonly Example[];\n /** Declarative match DATA, or a raw predicate escape hatch. Defaults to \"any element\". */\n readonly match?: DeclarativeMatch | MatchFn;\n /** A named rewrite recipe, or a raw op-draft factory escape hatch. */\n readonly rewrite: RewriteRecipe | RewriteFn;\n}\n\n/** A {@link Pattern} that also carries its authored {@link Example}s for the test harness. */\nexport interface AuthoredPattern<C extends Captures = Captures> extends Pattern {\n readonly examples?: readonly Example[];\n evaluate(ctx: MatchContext, rw: RewriteFactory): MatchResult<C> | null;\n}\n\n/* ───────────────────────── plain-style → StyleMap ───────────────────────── */\n\nfunction camelToKebab(key: string): string {\n if (key.startsWith('--')) return key; // custom property — leave verbatim\n return key.replace(/[A-Z]/g, (m) => `-${m.toLowerCase()}`);\n}\n\n/** Build a single-(base-)condition StyleMap from a plain style object via the shared normalizer. */\nfunction plainToStyleMap(style: PlainStyle): StyleMap {\n const decls = new Map<CssProperty, StyleDecl>();\n for (const [rawKey, rawValue] of Object.entries(style)) {\n const prop = camelToKebab(rawKey);\n for (const decl of normalizer.normalizeDeclaration(prop, String(rawValue), false)) {\n decls.set(decl.property, decl);\n }\n }\n const block: StyleBlock = { condition: BASE_CONDITION, decls };\n return { blocks: new Map<ConditionKey, StyleBlock>([[conditionKey(BASE_CONDITION), block]]) };\n}\n\n/* ───────────────────────── local meta / selector matchers ───────────────────────── */\n\nfunction asElement(node: NodeLike): DeepReadonly<IRElement> | null {\n const n = node as DeepReadonly<IRNode>;\n return n.kind === 'element' ? (n as DeepReadonly<IRElement>) : null;\n}\n\nfunction metaFlag(flag: keyof NodeMeta): Matcher {\n return (node) => Boolean(asElement(node)?.meta[flag]);\n}\n\n/** Element renders raw/`dangerouslySetInnerHTML` markup — a hard opacity barrier. */\nconst hasRawHtml: Matcher = metaFlag('hasDangerousHtml');\n\n/**\n * Unwrapping/removing this node would change the combinator / structural-pseudo match-set of itself,\n * its child, or a former sibling. Empty `reparentImpact` ⇒ structurally safe to hoist.\n */\nconst affectsSelectorMatching: Matcher = (node, ctx) => {\n const el = asElement(node);\n if (!el) return false;\n return ctx.selectors.reparentImpact(el.id as unknown as IRNodeId).size > 0;\n};\n\n/**\n * The opacity-barrier + selector-safety guards every `flatten/*` pattern must carry. Auto-applied to\n * the declarative match so authors never hand-write them (the flatten exemplars spell them out).\n */\nconst FLATTEN_GUARDS: Matcher = and(\n not(hasRef),\n not(hasEventHandlers),\n not(hasDynamicChildren),\n not(hasRawHtml),\n not(targetedByCombinator),\n not(affectsSelectorMatching),\n);\n\n/* ───────────────────────── match compilation ───────────────────────── */\n\nfunction isFlattenCategory(category: PassCategory): boolean {\n return (category.split('/', 1)[0] as PassPhase) === 'flatten';\n}\n\nfunction compileDeclarativeMatch(m: DeclarativeMatch): Matcher {\n const parts: Matcher[] = [isElement(m.tag)];\n if (m.style) parts.push(computed(plainToStyleMap(m.style)));\n if (m.onlyChild === 'element') parts.push(hasSingleElementChild);\n if (m.paintsNothing) parts.push(not(hasOwnVisualStyle));\n if (m.where) {\n const extra = Array.isArray(m.where) ? (m.where as readonly Matcher[]) : [m.where as Matcher];\n for (const w of extra) parts.push(w);\n }\n return and(...parts);\n}\n\nfunction compileMatch(\n match: DeclarativeMatch | MatchFn | undefined,\n category: PassCategory,\n): MatchFn {\n // Escape hatch: a raw predicate takes full control (no auto-guards).\n if (typeof match === 'function') return match;\n\n const declarative = compileDeclarativeMatch(match ?? {});\n const guarded = isFlattenCategory(category) ? and(declarative, FLATTEN_GUARDS) : declarative;\n return (node, ctx) => guarded(node, ctx);\n}\n\n/* ───────────────────────── rewrite compilation ───────────────────────── */\n\n/** Clone `sm`, pruning every `shadowed` provenance entry that references a dropped class token. */\nfunction pruneShadowed(sm: StyleMap, drop: ReadonlySet<string>): StyleMap {\n const blocks = new Map<ConditionKey, StyleBlock>();\n for (const [key, block] of sm.blocks) {\n const decls = new Map<CssProperty, StyleDecl>();\n for (const [prop, decl] of block.decls) {\n const filtered = (decl.shadowed ?? []).filter(\n (o) => !(o.kind === 'class' && drop.has(o.className)),\n );\n const rest: StyleDecl = { ...decl };\n delete (rest as { shadowed?: readonly StyleOrigin[] }).shadowed;\n const next: StyleDecl = filtered.length > 0 ? { ...rest, shadowed: filtered } : rest;\n decls.set(prop, next);\n }\n blocks.set(key, { condition: block.condition, decls });\n }\n return { blocks };\n}\n\nfunction compileFlattenInto(recipe: FlattenIntoRecipe): RewriteFn {\n const childGains = recipe.childGains ? plainToStyleMap(recipe.childGains) : null;\n const fold = recipe.foldInherited !== false;\n return (ctx, rw) => {\n const wrapper = ctx.node;\n const child = ctx.onlyElementChild();\n if (!child) return null;\n const ops: RewriteOpDraft[] = [];\n if (fold) ops.push(rw.foldInheritedStyles(wrapper, child, { conditions: 'all' }));\n if (childGains) ops.push(rw.mergeStyle(child, null, childGains, 'source-wins'));\n ops.push(rw.unwrap(wrapper));\n return ops;\n };\n}\n\nfunction compileRewrite(rewrite: RewriteRecipe | RewriteFn): RewriteFn {\n if (typeof rewrite === 'function') return rewrite;\n\n if ('flattenInto' in rewrite) return compileFlattenInto(rewrite);\n\n if ('rewriteClasses' in rewrite) {\n const preserveOpaque = rewrite.preserveOpaque ?? true;\n return (ctx, rw) => {\n const next = rewrite.rewriteClasses(ctx.computed(), ctx);\n if (!next) return null;\n return [rw.setClassList(ctx.node, next, preserveOpaque)];\n };\n }\n\n if ('dropClasses' in rewrite) {\n const preserveOpaque = rewrite.preserveOpaque ?? true;\n return (ctx, rw) => {\n const drop = new Set<string>(rewrite.dropClasses(ctx.computed(), ctx));\n if (drop.size === 0) return null;\n return [rw.setClassList(ctx.node, pruneShadowed(ctx.computed(), drop), preserveOpaque)];\n };\n }\n\n // MergeStyleRecipe\n const style = plainToStyleMap(rewrite.mergeStyle);\n const onConflict = rewrite.onConflict ?? 'abort';\n return (ctx, rw) => [rw.mergeStyle(ctx.node, null, style, onConflict)];\n}\n\n/* ───────────────────────── the public factory ───────────────────────── */\n\n/**\n * Compile a declarative {@link PatternConfig} into a validated {@link AuthoredPattern}. The result\n * is a normal {@link Pattern} (registerable into any {@link import('@domflax/core').Pass}) that also\n * exposes its `examples` for the auto-test harness.\n */\nexport function pattern(config: PatternConfig): AuthoredPattern {\n const matchFn = compileMatch(config.match, config.category);\n const rewriteFn = compileRewrite(config.rewrite);\n\n const spec: AuthoredPattern = {\n name: config.name,\n category: config.category,\n safety: config.safety,\n priority: config.priority,\n precondition: config.precondition,\n doc: config.doc,\n examples: config.examples,\n evaluate(ctx: MatchContext, rw: RewriteFactory): MatchResult | null {\n if (!matchFn(ctx.node as unknown as NodeLike, ctx)) return null;\n const ops = rewriteFn(ctx, rw);\n if (!ops || ops.length === 0) return null;\n return { ops };\n },\n };\n\n // `definePattern` validates + freezes; the spread preserves `examples` at runtime.\n return definePattern(spec) as AuthoredPattern;\n}\n","/**\n * @domflax/patterns — flatten pattern: `empty-style-div`.\n *\n * Collapses the most common piece of structural noise of all: a `<div>` whose ONLY role is to wrap\n * a single child while contributing nothing to layout or paint —\n *\n * <div><Child/></div> (no styles at all)\n * <div style=\"display:block\"><Child/></div> (the default; still a no-op box)\n *\n * Such a div is layout-neutral: it is a plain block box with no own visual style, establishes no\n * box / formatting / stacking context, is not a containing block, and declares no custom properties\n * a descendant might read. Its box is therefore indistinguishable from \"not being there\", so it can\n * be unwrapped into its sole child.\n *\n * Authored with the declarative {@link pattern} API. The opacity-barrier + selector-safety guards\n * (ref/handlers/dynamic-children/raw-html/combinator/reparent-impact) are applied automatically for\n * every `flatten/*` pattern; the `where` predicates below add the LAYOUT-neutrality requirements\n * specific to this pattern (no non-block display, no box/formatting/stacking context, no containing\n * block, no custom-property coupling, no structural-pseudo targeting).\n */\n\nimport type {\n CssProperty,\n DeepReadonly,\n IRElement,\n IRNode,\n IRNodeId,\n NodeLike,\n NodeMeta,\n StyleMap,\n} from '@domflax/core';\n\nimport { not, pattern, type Matcher } from '@domflax/pattern-kit';\n\n/* ───────────────────────── local matcher helpers ───────────────────────── */\n\n/** Narrow a NodeLike to a (readonly) element, or null. */\nfunction asEl(node: NodeLike): DeepReadonly<IRElement> | null {\n const n = node as DeepReadonly<IRNode>;\n return n.kind === 'element' ? (n as DeepReadonly<IRElement>) : null;\n}\n\n/** A boolean `meta` flag, lifted into a {@link Matcher}. Mirrors how core's combinators read meta. */\nfunction metaFlag(flag: keyof NodeMeta): Matcher {\n return (node) => Boolean(asEl(node)?.meta[flag]);\n}\n\n/** Wrapper establishes an intrinsic/explicit box (sizing) — NOT layout-neutral. */\nconst establishesBox = metaFlag('establishesBox');\n/** Wrapper establishes a formatting context (flex/grid/flow-root/…) — NOT layout-neutral. */\nconst establishesFormattingContext = metaFlag('establishesFormattingContext');\n/** Wrapper establishes a stacking context (transform/opacity<1/z-index/…) — NOT layout-neutral. */\nconst establishesStackingContext = metaFlag('establishesStackingContext');\n/** Wrapper is the containing block for abs/fixed descendants — removing it would reposition them. */\nconst isContainingBlock = metaFlag('isContainingBlock');\n/** Wrapper sets `--*` custom properties a descendant reads (author-var coupling). */\nconst declaresCustomProperties = metaFlag('declaresCustomProperties');\n\n/**\n * Wrapper is a structural-pseudo target (:first/:last/:only/:nth-child/-of-type). Honours the\n * frontend-set meta flag and the precomputed {@link SelectorIndex}. Unwrapping such a node would\n * change a selector's match-set.\n */\nconst targetedByStructuralPseudo: Matcher = (node, ctx) => {\n const el = asEl(node);\n if (!el) return false;\n if (el.meta.targetedByStructuralPseudo) return true;\n return ctx.selectors.targetedByStructuralPseudo(el.id as unknown as IRNodeId);\n};\n\nconst DISPLAY = 'display' as CssProperty;\n\n/**\n * True when the wrapper sets `display` to anything other than the block default in ANY condition.\n * An `inline`/`inline-block`/`flex`/`grid`/`contents`/`none` div is NOT layout-neutral — its box (or\n * lack of one) participates in layout differently from its surviving child.\n */\nconst hasNonBlockDisplay: Matcher = (node, ctx) => {\n const el = asEl(node);\n if (!el) return false;\n const sm: StyleMap = ctx.computedOf(el as unknown as NodeLike) ?? (el.computed as StyleMap);\n for (const block of sm.blocks.values()) {\n const decl = block.decls.get(DISPLAY);\n if (decl && String(decl.value) !== 'block') return true;\n }\n return false;\n};\n\n/* ───────────────────────── the pattern ───────────────────────── */\n\n/**\n * Flatten a layout-neutral, style-free `<div>` wrapper into its sole element child.\n */\nexport const emptyStyleDiv = pattern({\n name: 'empty-style-div',\n category: 'flatten/empty-style-div',\n safety: 1,\n doc: {\n title: 'Flatten empty-style div wrapper',\n summary:\n 'A layout-neutral div (display:block default, no box/visual styles) that wraps a single ' +\n 'child is removed; the child is hoisted into its place.',\n before: '<div><Child/></div>',\n after: '<Child/>',\n safetyRationale:\n 'Wrapper is a plain block box that paints nothing, establishes no box/formatting/stacking ' +\n 'context, is no containing block, has no custom-property coupling, carries no ' +\n 'ref/handlers/dynamic children/raw HTML, and is neither a combinator subject nor a ' +\n 'structural-pseudo target; inheritable styles are folded onto the child before removal.',\n },\n match: {\n tag: 'div',\n onlyChild: 'element',\n paintsNothing: true,\n where: [\n not(hasNonBlockDisplay),\n not(establishesBox),\n not(establishesFormattingContext),\n not(establishesStackingContext),\n not(isContainingBlock),\n not(declaresCustomProperties),\n not(targetedByStructuralPseudo),\n ],\n },\n rewrite: { flattenInto: 'child' },\n examples: [\n {\n before: '<div><span className=\"bg-red-200\">Hi</span></div>',\n after: '<span className=\"bg-red-200\">Hi</span>',\n },\n {\n // The wrapper paints its own background (own visual style) → not layout-neutral, kept.\n noMatch: '<div className=\"bg-blue-500\"><span className=\"bg-red-200\">Hi</span></div>',\n },\n ],\n});\n","/**\n * @domflax/patterns — flatten pattern: `flex-center-wrapper`.\n *\n * Collapses the ubiquitous \"centering wrapper\" idiom\n *\n * <div style=\"display:flex; align-items:center; justify-content:center\"><Child/></div>\n *\n * into its sole child, pushing the centering intent down onto the child as `place-self: center`.\n * The wrapper only exists to center one element; once `place-self:center` lives on the child the\n * wrapper is pure structural noise and can go.\n *\n * Authored with the declarative {@link pattern} API: the match is the flex-centering computed-style\n * signature on a single-element-child `<div>` that paints nothing of its own; the recipe folds\n * inheritable styles onto the child, grants it `place-self:center`, then unwraps the wrapper\n * (id-preserving). The opacity-barrier + selector-safety guards are applied automatically by the\n * `pattern()` factory for every `flatten/*` pattern.\n */\n\nimport { pattern } from '@domflax/pattern-kit';\n\n/**\n * Flatten a flex-centering `<div>` wrapper into its sole element child, granting the child\n * `place-self:center`.\n */\nexport const flexCenterWrapper = pattern({\n name: 'flex-center-wrapper',\n category: 'flatten/flex-center-wrapper',\n safety: 2,\n doc: {\n title: 'Flatten flex-centering wrapper',\n summary:\n 'A div that only centers a single child (display:flex; align-items:center; ' +\n 'justify-content:center) is removed; the child gains place-self:center.',\n before: '<div style=\"display:flex;align-items:center;justify-content:center\"><Child/></div>',\n after: '<Child style=\"place-self:center\"/>',\n safetyRationale:\n 'Wrapper paints nothing, carries no ref/handlers/dynamic children, and is not a combinator ' +\n 'subject; inheritable styles are folded onto the child before removal.',\n },\n match: {\n tag: 'div',\n style: { display: 'flex', alignItems: 'center', justifyContent: 'center' },\n onlyChild: 'element',\n paintsNothing: true,\n },\n rewrite: {\n flattenInto: 'child',\n childGains: { placeSelf: 'center' },\n },\n examples: [\n {\n // The wrapper is removed; the surviving child gains `place-self-center` (reverse-emitted\n // from the folded computed style by the resolver).\n before:\n '<div className=\"flex justify-center items-center\">' +\n '<div className=\"bg-red-200\">Hello</div>' +\n '</div>',\n after: '<div className=\"bg-red-200 place-self-center\">Hello</div>',\n },\n {\n // onClick is a hard opacity barrier → the wrapper is load-bearing, no flatten.\n noMatch:\n '<div className=\"flex justify-center items-center\" onClick={handleClick}>' +\n '<div className=\"bg-red-200\">Hello</div>' +\n '</div>',\n },\n ],\n});\n","/**\n * @domflax/patterns — flatten pattern: `nested-flex-merge`.\n *\n * Collapses a redundant nesting of two flex containers\n *\n * <div style=\"display:flex; align-items:center; gap:8px\">\n * <div style=\"display:flex; flex-direction:column\"> … </div>\n * </div>\n *\n * where the OUTER flex container's sole element child is ITSELF a flex container, into a single\n * flex container that carries the union of both elements' flex declarations. The outer wrapper's\n * box is then structural noise (it paints nothing and only establishes a flex context that the\n * merged child now also establishes), so it is removed.\n *\n * Authored with the declarative {@link pattern} API: the match is a flex `<div>` with a single\n * element child painting nothing of its own (auto-guarded against opacity barriers / combinator\n * targeting like every `flatten/*` pattern). The value-relational reasoning — the child must also\n * be a (non-combinator) flex container, the wrapper must carry only transferable flex/inheritable\n * declarations, and the two must not conflict on any shared flex property — lives in the `rewrite`\n * op-draft factory escape hatch, which folds inherited styles, transfers the wrapper's flex\n * declarations onto the child (target-wins), then unwraps the wrapper.\n */\n\nimport type {\n ConditionKey,\n CssProperty,\n MatchContext,\n NodeLike,\n RewriteFactory,\n RewriteOpDraft,\n StyleBlock,\n StyleDecl,\n StyleMap,\n} from '@domflax/core';\nimport { BASE_CONDITION, conditionKey } from '@domflax/core';\n\nimport {\n and,\n computed,\n isElement,\n normalizer,\n not,\n pattern,\n targetedByCombinator,\n type Matcher,\n} from '@domflax/pattern-kit';\n\n/* ───────────────────────── style fixtures ───────────────────────── */\n\n/** Build a single-(base-)condition StyleMap from raw `[property, value]` pairs via the shared normalizer. */\nfunction baseConditionStyleMap(decls: readonly (readonly [string, string])[]): StyleMap {\n const map = new Map<CssProperty, StyleDecl>();\n for (const [prop, value] of decls) {\n for (const decl of normalizer.normalizeDeclaration(prop, value, false)) {\n map.set(decl.property, decl);\n }\n }\n const block: StyleBlock = { condition: BASE_CONDITION, decls: map };\n const blocks = new Map<ConditionKey, StyleBlock>([[conditionKey(BASE_CONDITION), block]]);\n return { blocks };\n}\n\n/** Both containers must declare `display:flex` (the matched signature). */\nconst DISPLAY_FLEX: StyleMap = baseConditionStyleMap([['display', 'flex']]);\n\n/**\n * The flex-CONTAINER property set this pattern is allowed to transfer from the wrapper onto the\n * child. (Longhands only, since the shared normalizer expands `gap` → `row-gap`/`column-gap`.)\n */\nconst FLEX_CONTAINER_PROPERTIES: ReadonlySet<string> = new Set<string>([\n 'display',\n 'flex-direction',\n 'flex-wrap',\n 'justify-content',\n 'align-items',\n 'align-content',\n 'place-content',\n 'place-items',\n 'row-gap',\n 'column-gap',\n]);\n\n/* ───────────────────────── style reasoning helpers (pure) ───────────────────────── */\n\n/**\n * True iff every declaration on the wrapper is either a transferable flex-container property or an\n * inheritable property (which we fold onto the child). If the wrapper carries anything else\n * (padding/margin/sizing/position/…), removing its box would change layout, so the merge is unsafe.\n */\nfunction outerMergeSafe(sm: StyleMap): boolean {\n const norm = normalizer.normalizeStyleMap(sm);\n for (const block of norm.blocks.values()) {\n for (const decl of block.decls.values()) {\n if (FLEX_CONTAINER_PROPERTIES.has(String(decl.property))) continue;\n if (decl.inherited) continue;\n return false;\n }\n }\n return true;\n}\n\n/**\n * True iff the two containers disagree on any shared flex-container property (in any matching\n * condition) — e.g. `flex-direction:row` vs `flex-direction:column`. Such a conflict makes the\n * merge ambiguous, so the pattern skips.\n */\nfunction flexConflict(outer: StyleMap, inner: StyleMap): boolean {\n const a = normalizer.normalizeStyleMap(outer);\n const b = normalizer.normalizeStyleMap(inner);\n for (const [key, blockA] of a.blocks) {\n const blockB = b.blocks.get(key);\n if (!blockB) continue;\n for (const [prop, declA] of blockA.decls) {\n if (!FLEX_CONTAINER_PROPERTIES.has(String(prop))) continue;\n const declB = blockB.decls.get(prop);\n if (declB && declB.value !== declA.value) return true;\n }\n }\n return false;\n}\n\n/** Project the wrapper's transferable flex-container declarations into a fresh StyleMap. */\nfunction extractFlexStyle(sm: StyleMap): StyleMap {\n const blocks = new Map<ConditionKey, StyleBlock>();\n for (const [key, block] of sm.blocks) {\n const decls = new Map<CssProperty, StyleDecl>();\n for (const [prop, decl] of block.decls) {\n if (FLEX_CONTAINER_PROPERTIES.has(String(prop))) decls.set(prop, decl);\n }\n if (decls.size > 0) blocks.set(key, { condition: block.condition, decls });\n }\n return { blocks };\n}\n\n/** The inner (surviving) flex container: also a flex `<div>`, and not a combinator subject (it is reparented). */\nconst isInnerFlex: Matcher = and(\n isElement('div'),\n computed(DISPLAY_FLEX),\n not(targetedByCombinator),\n);\n\n/* ───────────────────────── the pattern ───────────────────────── */\n\n/**\n * Flatten a flex container whose sole child is a compatible flex container into a single container.\n */\nexport const nestedFlexMerge = pattern({\n name: 'nested-flex-merge',\n category: 'flatten/nested-flex-merge',\n safety: 2,\n doc: {\n title: 'Merge nested flex containers',\n summary:\n 'A flex container whose only child is itself a flex container with non-conflicting flex ' +\n 'properties is collapsed into one; the wrapper is removed and its flex declarations merge ' +\n 'onto the surviving child.',\n before:\n '<div style=\"display:flex;align-items:center;gap:8px\">' +\n '<div style=\"display:flex;flex-direction:column\"/></div>',\n after: '<div style=\"display:flex;flex-direction:column;align-items:center;gap:8px\"/>',\n safetyRationale:\n 'The wrapper paints nothing, declares only flex-container/inheritable properties, carries no ' +\n 'ref/handlers/dynamic children, and is not a combinator subject; the two containers do not ' +\n 'conflict on any flex property, so the union is unambiguous and lossless.',\n },\n match: {\n tag: 'div',\n style: { display: 'flex' },\n onlyChild: 'element',\n paintsNothing: true,\n },\n rewrite: (ctx: MatchContext, rw: RewriteFactory): readonly RewriteOpDraft[] | null => {\n const outer = ctx.node;\n const inner = ctx.onlyElementChild();\n if (!inner) return null;\n if (!isInnerFlex(inner as unknown as NodeLike, ctx)) return null;\n\n const outerStyle = ctx.computed();\n const innerStyle = ctx.computedOf(inner as unknown as NodeLike);\n\n // The wrapper must carry nothing that would be lost when its box is removed …\n if (!outerMergeSafe(outerStyle)) return null;\n // … and the two containers must agree on every shared flex property.\n if (flexConflict(outerStyle, innerStyle)) return null;\n\n return [\n // 1. Preserve inheritable values (color/font/…) by folding them onto the child first.\n rw.foldInheritedStyles(outer, inner, { conditions: 'all' }),\n // 2. Transfer the wrapper's flex-container declarations onto the child (target-wins keeps the\n // child's value for any shared property — identical anyway, we proved non-conflict).\n rw.mergeStyle(inner, null, extractFlexStyle(outerStyle), 'target-wins'),\n // 3. Remove the wrapper (structural-safe; hoists the child and preserves its IRNodeId).\n rw.unwrap(outer),\n ];\n },\n examples: [\n {\n // The wrapper's flex declarations (align-items / gap) merge onto the inner flex container,\n // then the wrapper is removed (its own `data-x` here just blocks the more aggressive\n // passthrough-wrapper so this merge is the one that fires).\n before:\n '<div className=\"flex items-center gap-2\" data-x=\"1\">' +\n '<div className=\"flex flex-col\">X</div>' +\n '</div>',\n after: '<div className=\"flex flex-col gap-2 items-center\">X</div>',\n },\n {\n // A non-flex wrapper does not match the flex-container signature → left unchanged.\n noMatch:\n '<div className=\"block bg-blue-500\">' +\n '<div className=\"flex flex-col\">X</div>' +\n '</div>',\n },\n ],\n});\n","/**\n * @domflax/patterns — flatten pattern: `passthrough-wrapper`.\n *\n * Collapses a purely-structural wrapper that exists for no reason at all:\n *\n * <div><Child/></div>\n *\n * The wrapper paints nothing, establishes no box / formatting / stacking context, carries no\n * attributes beyond an (optional) inert class, holds exactly one element child, and is free of every\n * opacity barrier (ref / event-handlers / dynamic children / dangerous html / spread / component).\n * Such a `<div>` is pure DOM noise: removing it and hoisting the child is invisible to both paint\n * and layout.\n *\n * Authored with the declarative {@link pattern} API. The opacity-barrier + selector-safety guards\n * (ref/handlers/dynamic-children/raw-html/combinator/reparent-impact) are applied automatically for\n * every `flatten/*` pattern; the `where` predicates add the passthrough-specific requirements (no\n * box/formatting/stacking context, no own attrs, no dynamic/spread classes, not a component, not a\n * structural-pseudo subject).\n */\n\nimport type {\n DeepReadonly,\n IRElement,\n IRNode,\n IRNodeId,\n NodeLike,\n NodeMeta,\n} from '@domflax/core';\n\nimport { hasDynamicClasses, not, pattern, type Matcher } from '@domflax/pattern-kit';\n\n/* ───────────────────────── local meta/attr/selector matchers ───────────────────────── */\n\nfunction metaOf(node: NodeLike): DeepReadonly<NodeMeta> | null {\n const n = node as DeepReadonly<IRNode>;\n return n.kind === 'element' ? (n as DeepReadonly<IRElement>).meta : null;\n}\n\nfunction elementOf(node: NodeLike): DeepReadonly<IRElement> | null {\n const n = node as DeepReadonly<IRNode>;\n return n.kind === 'element' ? (n as DeepReadonly<IRElement>) : null;\n}\n\n/**\n * Element establishes some box / formatting / stacking context, is a containing block, or exposes\n * custom properties to a descendant — any of which means removing its box could shift layout or\n * break a `var()` coupling, so it is NOT a passthrough.\n */\nconst establishesContext: Matcher = (node) => {\n const m = metaOf(node);\n if (!m) return false;\n return (\n m.establishesBox ||\n m.establishesFormattingContext ||\n m.establishesStackingContext ||\n m.isContainingBlock ||\n m.declaresCustomProperties\n );\n};\n\n/** Hard opacity barriers beyond the auto-applied set: spread attrs, component identity. */\nconst hasSpreadAttrs: Matcher = (node) => metaOf(node)?.hasSpreadAttrs ?? false;\nconst isComponentNode: Matcher = (node) => metaOf(node)?.isComponent ?? false;\n\n/** Element carries own attributes (id / data-* / …) beyond its class list — possible selector/JS hook. */\nconst hasOwnAttrs: Matcher = (node) => {\n const el = elementOf(node);\n if (!el) return false;\n return el.attrs.entries.size > 0 || el.attrs.spreads.length > 0;\n};\n\n/**\n * Element is the subject of a structural pseudo (`:first/:last/:only/:nth-*`). Honours the meta flag\n * and the precomputed {@link SelectorIndex}.\n */\nconst targetedByStructuralPseudo: Matcher = (node, ctx) => {\n const el = elementOf(node);\n if (!el) return false;\n if (el.meta.targetedByStructuralPseudo) return true;\n return ctx.selectors.targetedByStructuralPseudo(el.id as unknown as IRNodeId);\n};\n\n/* ───────────────────────── the pattern ───────────────────────── */\n\n/**\n * Flatten a do-nothing `<div>` wrapper into its sole element child, folding any inheritable styles\n * down first so inherited values survive the box removal.\n */\nexport const passthroughWrapper = pattern({\n name: 'passthrough-wrapper',\n category: 'flatten/passthrough-wrapper',\n safety: 2,\n doc: {\n title: 'Flatten passthrough wrapper',\n summary:\n 'A div with no own visual/box style, no attributes beyond an inert class, exactly one ' +\n 'element child, and no opacity barriers is removed; its sole child is hoisted in its place.',\n before: '<div><Child/></div>',\n after: '<Child/>',\n safetyRationale:\n 'Wrapper paints nothing and establishes no layout/paint/var context, carries no ' +\n 'ref/handlers/dynamic-children/html/spread/component identity, owns no targetable attrs, ' +\n 'and is not a combinator/structural-pseudo subject (reparenting changes no match-set); ' +\n 'inheritable styles are folded onto the child before removal.',\n },\n match: {\n tag: 'div',\n onlyChild: 'element',\n paintsNothing: true,\n where: [\n not(establishesContext),\n not(hasOwnAttrs),\n not(hasDynamicClasses),\n not(hasSpreadAttrs),\n not(isComponentNode),\n not(targetedByStructuralPseudo),\n ],\n },\n rewrite: { flattenInto: 'child' },\n examples: [\n {\n before: '<div className=\"flex\"><a className=\"bg-red-200\">Link</a></div>',\n after: '<a className=\"bg-red-200\">Link</a>',\n },\n {\n // A ref pins the wrapper's element identity (a hard opacity barrier) → not a passthrough.\n noMatch: '<div ref={rootRef}><a className=\"bg-red-200\">Link</a></div>',\n },\n ],\n});\n","/**\n * @domflax/patterns — flatten pattern: `redundant-fragment`.\n *\n * Collapses a fragment that wraps exactly one child\n *\n * <><Child/></> → <Child/>\n *\n * A fragment renders no box of its own, so a fragment whose sole purpose is to wrap a single node\n * is pure structural noise: splicing the child up into the fragment's slot is invisible in both\n * the rendered DOM and the project's CSS cascade.\n *\n * Anchoring: the pass manager only visits ELEMENT nodes (see core's `elementIds`), never fragments,\n * so this pattern is anchored on the fragment's sole *element* child and removes the PARENT fragment.\n * Because the match is PARENT-anchored (and reads a fragment's `meta`, which the element-only\n * combinator vocabulary cannot inspect), it uses the declarative API's two escape hatches: a raw\n * `match` predicate and a raw `rewrite` op-draft factory.\n */\n\nimport type {\n DeepReadonly,\n ElementLike,\n IRNode,\n IRNodeId,\n MatchContext,\n NodeLike,\n RewriteFactory,\n RewriteOpDraft,\n} from '@domflax/core';\n\nimport { pattern } from '@domflax/pattern-kit';\n\n/* ───────────────────────── match predicate (escape hatch) ───────────────────────── */\n\n/**\n * Matches an element whose PARENT is a redundant, unwrappable fragment: a non-root fragment with\n * exactly one child (this element), free of every opacity barrier and CSS-targeting coupling.\n */\nfunction parentIsRedundantFragment(node: NodeLike, ctx: MatchContext): boolean {\n const el = node as DeepReadonly<IRNode>;\n if (el.kind !== 'element') return false;\n\n const parentId = el.parent;\n if (parentId == null) return false;\n\n const parent = ctx.doc.nodes.get(parentId);\n if (!parent || parent.kind !== 'fragment') return false;\n\n // Never unwrap the document root (it must always be a fragment — IRDocument invariant).\n if (parent.parent == null) return false;\n\n // Exactly one child (counting EVERY kind) ⇒ the anchor element is the fragment's sole child.\n if (parent.children.length !== 1) return false;\n\n // Hard opacity barriers on the fragment: keyed `<Fragment key>`, ref/handlers/dynamic children/\n // dangerous HTML/spread/component identity. Any of these means the fragment is load-bearing.\n const m = parent.meta;\n if (\n m.hasKey ||\n m.hasRef ||\n m.hasEventHandlers ||\n m.hasDynamicChildren ||\n m.hasDangerousHtml ||\n m.hasSpreadAttrs ||\n m.isComponent\n ) {\n return false;\n }\n\n // CSS-selector safety: the fragment (or its reparented child) must not move any combinator /\n // structural-pseudo match-set. Honour both the frontend-set meta flags and the SelectorIndex.\n if (m.targetedByCombinator || m.targetedByStructuralPseudo) return false;\n const fid = parentId as unknown as IRNodeId;\n if (ctx.selectors.targetedByCombinator(fid) || ctx.selectors.targetedByStructuralPseudo(fid)) {\n return false;\n }\n if (ctx.selectors.reparentImpact(fid).size > 0) return false;\n\n return true;\n}\n\n/* ───────────────────────── the pattern ───────────────────────── */\n\n/**\n * Flatten a fragment that wraps exactly one child into that child.\n *\n * Safety level 1 (`safe`): a purely structural, style-free, selector-transparent cleanup.\n */\nexport const redundantFragment = pattern({\n name: 'redundant-fragment',\n category: 'flatten/redundant-fragment',\n safety: 1,\n doc: {\n title: 'Flatten redundant single-child fragment',\n summary:\n 'A fragment whose only child is a single node is removed; the child is spliced up into the ' +\n \"fragment's slot, preserving its IRNodeId, siblings, attributes and the CSS cascade.\",\n before: '<><Child/></>',\n after: '<Child/>',\n safetyRationale:\n 'A fragment paints nothing and renders no box; with exactly one child its removal changes ' +\n 'no sibling/structural-pseudo match-set. Keyed fragments and fragments carrying ' +\n 'ref/handlers/dynamic-children/raw-html/spread are excluded as opacity barriers.',\n },\n match: parentIsRedundantFragment,\n rewrite: (ctx: MatchContext, rw: RewriteFactory): readonly RewriteOpDraft[] | null => {\n const parentId = ctx.node.parent;\n if (parentId == null) return null;\n const fragment = ctx.doc.nodes.get(parentId);\n if (!fragment || fragment.kind !== 'fragment') return null;\n // Splice the sole child up into the fragment's slot, deleting ONLY the fragment node.\n return [rw.unwrap(fragment as unknown as ElementLike)];\n },\n examples: [\n {\n before: '<><span className=\"bg-red-200\">Hi</span></>',\n after: '<span className=\"bg-red-200\">Hi</span>',\n },\n {\n // Two children ⇒ not a single-child fragment, so the fragment is load-bearing and stays.\n noMatch:\n '<><span className=\"bg-red-200\">A</span><span className=\"bg-green-200\">B</span></>',\n },\n ],\n});\n","/**\n * @domflax/patterns — compress pattern: `dedupe-classes`.\n *\n * Removes duplicate / fully-overridden class tokens that resolve to the same property where a\n * LATER token wins, leaving the minimal set of tokens with an IDENTICAL computed style. The\n * canonical case:\n *\n * <p class=\"text-sm text-lg\">…</p> → <p class=\"text-lg\">…</p>\n *\n * Both `text-sm` and `text-lg` set `font-size`; resolution already made `text-lg` win, so the\n * computed `font-size` is `text-lg`'s value and `text-sm` contributes NOTHING to the final\n * computed style. The earlier token is pure noise and can be dropped without changing a pixel.\n *\n * How redundancy is detected (purely from the already-resolved, normalized computed StyleMap):\n * • every declaration carries provenance — `origin` (the winning token) and `shadowed`\n * (the tokens it overrode);\n * • a class token is FULLY OVERRIDDEN iff it appears in some declaration's `shadowed` list but\n * is NOT the winning `origin` of any declaration across ANY style condition. Such a token can\n * be deleted with zero effect on the computed style.\n *\n * Authored with the declarative {@link pattern} API: the `where` guards exclude opacity barriers,\n * dynamic/opaque class lists, and combinator subjects; the `dropClasses` recipe returns the set of\n * fully-overridden, resolver-droppable tokens to delete (their `shadowed` provenance is pruned\n * automatically before the minimal class StyleMap is re-installed).\n */\n\nimport type {\n DeepReadonly,\n ElementLike,\n IRElement,\n IRNode,\n MatchContext,\n NodeLike,\n StyleMap,\n} from '@domflax/core';\n\nimport {\n hasDynamicChildren,\n hasDynamicClasses,\n hasEventHandlers,\n hasRef,\n not,\n pattern,\n targetedByCombinator,\n type Matcher,\n} from '@domflax/pattern-kit';\n\n/* ───────────────────────── local matchers (barriers the combinators don't expose) ───────────────────────── */\n\nfunction elementOf(node: NodeLike): DeepReadonly<IRElement> | null {\n const n = node as DeepReadonly<IRNode>;\n return n.kind === 'element' ? (n as DeepReadonly<IRElement>) : null;\n}\n\n/** Element renders raw/`dangerouslySetInnerHTML` markup — a hard opacity barrier. */\nconst hasDangerousHtml: Matcher = (node) => elementOf(node)?.meta.hasDangerousHtml ?? false;\n\n/** Element's class list is wholly dynamic/spread-derived → we cannot see or splice its tokens. */\nconst isOpaque: Matcher = (node, ctx) => ctx.isOpaque(node as ElementLike);\n\n/* ───────────────────────── provenance analysis ───────────────────────── */\n\n/** Winners (tokens that win some declaration) and shadowed (tokens overridden somewhere). */\nfunction findRedundantClasses(computed: StyleMap): {\n winners: ReadonlySet<string>;\n shadowed: ReadonlySet<string>;\n} {\n const winners = new Set<string>();\n const shadowed = new Set<string>();\n for (const block of computed.blocks.values()) {\n for (const decl of block.decls.values()) {\n if (decl.origin && decl.origin.kind === 'class') winners.add(decl.origin.className);\n for (const o of decl.shadowed ?? []) {\n if (o.kind === 'class') shadowed.add(o.className);\n }\n }\n }\n return { winners, shadowed };\n}\n\n/* ───────────────────────── the pattern ───────────────────────── */\n\n/**\n * Collapse a class list to the minimal token set that yields an identical computed style, by\n * dropping tokens whose declarations are fully overridden by later tokens.\n */\nexport const dedupeClasses = pattern({\n name: 'dedupe-classes',\n category: 'compress/dedupe-classes',\n safety: 1,\n doc: {\n title: 'Dedupe fully-overridden class tokens',\n summary:\n 'Drops class tokens whose every declaration is overridden by a later token resolving to the ' +\n 'same property; the surviving token set produces a byte-for-byte identical computed style.',\n before: '<p class=\"text-sm text-lg\" />',\n after: '<p class=\"text-lg\" />',\n safetyRationale:\n 'A fully-overridden token contributes nothing to the computed style in any condition, so ' +\n 'removing it changes no pixels. Dynamic/opaque class lists, ref/handler/dynamic-children/raw-' +\n 'html barriers, combinator subjects, and selector-bound (non-droppable) tokens are excluded.',\n },\n match: {\n where: [\n not(hasRef),\n not(hasEventHandlers),\n not(hasDynamicChildren),\n not(hasDangerousHtml),\n not(hasDynamicClasses),\n not(isOpaque),\n not(targetedByCombinator),\n ],\n },\n rewrite: {\n dropClasses(computed: StyleMap, ctx: MatchContext): Iterable<string> {\n const { winners, shadowed } = findRedundantClasses(computed);\n const drop = new Set<string>();\n for (const cls of shadowed) {\n // A token that still wins SOME property elsewhere is not redundant — keep it.\n if (winners.has(cls)) continue;\n // Selector-membership safety: only drop a token referenced purely as a plain subject.\n if (!ctx.resolver.selectorUsage(cls).droppable) continue;\n drop.add(cls);\n }\n return drop;\n },\n },\n examples: [\n {\n // `text-sm` is fully overridden by `text-lg` (both set font-size + line-height). The resolver\n // records that shadowing in provenance and reports the Tailwind utility as droppable, so the\n // pattern drops `text-sm`; the reverse-emit then re-derives the minimal set (`text-lg`).\n before: '<p className=\"text-sm text-lg\">Hi</p>',\n after: '<p className=\"text-lg\">Hi</p>',\n },\n {\n // Both tokens win a distinct property (no full override) → nothing to dedupe.\n noMatch: '<p className=\"text-lg font-bold\">Hi</p>',\n },\n ],\n});\n","/**\n * @domflax/patterns — compress pattern: `inset-shorthand`.\n *\n * Recompacts the four physical inset longhands (`top`/`right`/`bottom`/`left`) on an element's\n * computed style back into the tightest CSS shorthand the values allow:\n *\n * • all four equal → `inset: <v>`\n * • top == bottom (a matching pair) → `inset-block: <v>` (Tailwind `inset-y-*`)\n * • left == right (a matching pair) → `inset-inline: <v>` (Tailwind `inset-x-*`)\n *\n * The two axis collapses are independent: an element whose `top == bottom` but `left != right`\n * collapses only the block axis and keeps the `left`/`right` longhands verbatim. When nothing\n * collapses (all four distinct, or fewer than a full pair present) the pattern declines.\n *\n * Authored with the declarative {@link pattern} API: the `where` guards exclude opacity barriers,\n * dynamic class lists, and combinator subjects; the `rewriteClasses` recipe rebuilds the class\n * StyleMap, declining (`null`) unless at least one inset axis collapses.\n */\n\nimport type {\n ConditionKey,\n CssProperty,\n DeepReadonly,\n IRElement,\n IRNode,\n NodeLike,\n StyleBlock,\n StyleDecl,\n StyleMap,\n} from '@domflax/core';\nimport { BASE_CONDITION_KEY } from '@domflax/core';\n\nimport {\n hasDynamicChildren,\n hasDynamicClasses,\n hasEventHandlers,\n hasRef,\n normalizer,\n not,\n pattern,\n targetedByCombinator,\n type Matcher,\n} from '@domflax/pattern-kit';\n\n/* ───────────────────────── property handles ───────────────────────── */\n\nconst TOP = 'top' as CssProperty;\nconst RIGHT = 'right' as CssProperty;\nconst BOTTOM = 'bottom' as CssProperty;\nconst LEFT = 'left' as CssProperty;\nconst INSET = 'inset' as CssProperty;\nconst INSET_BLOCK = 'inset-block' as CssProperty; // top + bottom (Tailwind inset-y)\nconst INSET_INLINE = 'inset-inline' as CssProperty; // left + right (Tailwind inset-x)\n\n/* ───────────────────────── match guards ───────────────────────── */\n\n/** Element sets raw/dangerous HTML (`dangerouslySetInnerHTML`) — a hard opacity barrier. */\nconst hasRawHtml: Matcher = (node) => {\n const n = node as DeepReadonly<IRNode>;\n return n.kind === 'element' ? (n as DeepReadonly<IRElement>).meta.hasDangerousHtml : false;\n};\n\n/* ───────────────────────── value helpers ───────────────────────── */\n\n/** Two side-decls collapse only if they agree on BOTH normalized value and `!important`. */\nfunction sameSide(a: StyleDecl | undefined, b: StyleDecl | undefined): boolean {\n return a !== undefined && b !== undefined && a.value === b.value && a.important === b.important;\n}\n\n/** Re-key a decl onto a new property, recomputing its inherited flag for that property. */\nfunction asProperty(src: StyleDecl, property: CssProperty): StyleDecl {\n return { ...src, property, inherited: normalizer.inherited.isInherited(property) };\n}\n\n/** Rebuild `src` with the base block's decls replaced; all other condition blocks pass through. */\nfunction withBaseDecls(src: StyleMap, baseDecls: ReadonlyMap<CssProperty, StyleDecl>): StyleMap {\n const blocks = new Map<ConditionKey, StyleBlock>();\n for (const [key, block] of src.blocks) {\n const decls =\n key === BASE_CONDITION_KEY ? baseDecls : new Map<CssProperty, StyleDecl>(block.decls);\n blocks.set(key, { condition: block.condition, decls });\n }\n return { blocks };\n}\n\n/* ───────────────────────── the pattern ───────────────────────── */\n\n/**\n * Collapse equal/paired physical inset longhands into the `inset` / `inset-block` / `inset-inline`\n * shorthands on an element's computed style.\n */\nexport const insetShorthand = pattern({\n name: 'inset-shorthand',\n category: 'compress/inset-shorthand',\n safety: 2,\n doc: {\n title: 'Compress inset longhands into a shorthand',\n summary:\n 'top/right/bottom/left set to one value collapse to `inset`; a matching top/bottom or ' +\n 'left/right pair collapses to `inset-block` / `inset-inline` (Tailwind inset-y / inset-x).',\n before: '<div style=\"top:10px;right:10px;bottom:10px;left:10px\"/>',\n after: '<div style=\"inset:10px\"/>',\n safetyRationale:\n 'Meaning-preserving shorthand compaction; the element is not a combinator subject and carries ' +\n 'no ref/handlers/dynamic children/raw HTML, so neither selector matching nor behaviour changes.',\n },\n match: {\n where: [\n not(hasRef),\n not(hasEventHandlers),\n not(hasDynamicChildren),\n not(hasRawHtml),\n not(hasDynamicClasses),\n not(targetedByCombinator),\n ],\n },\n rewrite: {\n rewriteClasses(computed: StyleMap): StyleMap | null {\n const base = computed.blocks.get(BASE_CONDITION_KEY);\n if (!base) return null;\n\n const top = base.decls.get(TOP);\n const right = base.decls.get(RIGHT);\n const bottom = base.decls.get(BOTTOM);\n const left = base.decls.get(LEFT);\n\n const next = new Map<CssProperty, StyleDecl>(base.decls);\n\n // 1. All four sides equal → single `inset`.\n if (top && sameSide(top, right) && sameSide(top, bottom) && sameSide(top, left)) {\n next.delete(TOP);\n next.delete(RIGHT);\n next.delete(BOTTOM);\n next.delete(LEFT);\n next.set(INSET, asProperty(top, INSET));\n } else {\n let collapsed = false;\n // 2a. Block axis: top == bottom → `inset-block`.\n if (sameSide(top, bottom)) {\n next.delete(TOP);\n next.delete(BOTTOM);\n next.set(INSET_BLOCK, asProperty(top!, INSET_BLOCK));\n collapsed = true;\n }\n // 2b. Inline axis: left == right → `inset-inline`.\n if (sameSide(left, right)) {\n next.delete(LEFT);\n next.delete(RIGHT);\n next.set(INSET_INLINE, asProperty(left!, INSET_INLINE));\n collapsed = true;\n }\n if (!collapsed) return null; // nothing to compress — decline\n }\n\n return withBaseDecls(computed, next);\n },\n },\n examples: [\n {\n // The four equal inset longhands collapse to an `inset` shorthand at the IR level; the\n // minimizing reverse-emit expands it back to top/right/bottom/left and picks the single utility\n // covering all four (`inset-0`), replacing the four physical-side tokens. `bg-red-200` survives.\n before: '<div className=\"top-0 right-0 bottom-0 left-0 bg-red-200\">box</div>',\n after: '<div className=\"bg-red-200 inset-0\">box</div>',\n },\n {\n // No matching inset pair (all four distinct) → nothing collapses.\n noMatch: '<div className=\"top-0 right-1 bottom-2 left-3 bg-red-200\">box</div>',\n },\n ],\n});\n","/**\n * @domflax/patterns — compress pattern: `margin-shorthand`.\n *\n * Collapses the four explicit margin longhands\n *\n * margin-top / margin-right / margin-bottom / margin-left\n *\n * back into a single CSS `margin` shorthand declaration on the SAME element (the margin analogue of\n * `padding-shorthand`, covering the `m` / `mx` / `my` collapse), choosing the shortest legal\n * 1–4-value form:\n *\n * • all four equal → `margin: <v>` (the `m` case)\n * • top==bottom and left==right → `margin: <y> <x>` (the `my`/`mx` case)\n * • left==right (top!=bottom) → `margin: <t> <x> <b>`\n * • otherwise → `margin: <t> <r> <b> <l>`\n *\n * It is a pure representation change: the resolved box model is identical, only the declaration\n * count shrinks from four to one, which the backend can then re-emit as a single shorthand utility.\n *\n * Authored with the declarative {@link pattern} API: the `where` guards exclude opacity barriers,\n * dynamic class lists, and combinator subjects; the `rewriteClasses` recipe rebuilds the class\n * StyleMap, declining (`null`) unless all four margin longhands are present with a uniform\n * (non-)`!important` flag.\n */\n\nimport type {\n ConditionKey,\n CssProperty,\n CssValue,\n DeepReadonly,\n IRElement,\n IRNode,\n NodeLike,\n StyleBlock,\n StyleDecl,\n StyleMap,\n} from '@domflax/core';\nimport { BASE_CONDITION, conditionKey } from '@domflax/core';\n\nimport {\n hasDynamicChildren,\n hasDynamicClasses,\n hasEventHandlers,\n hasRef,\n not,\n pattern,\n targetedByCombinator,\n type Matcher,\n} from '@domflax/pattern-kit';\n\n/* ───────────────────────── constants / helpers ───────────────────────── */\n\n/** The four margin longhands, in CSS shorthand order (top, right, bottom, left). */\nconst MARGIN_SIDES = [\n 'margin-top',\n 'margin-right',\n 'margin-bottom',\n 'margin-left',\n] as const satisfies readonly string[];\n\nconst MARGIN_SIDE_SET: ReadonlySet<string> = new Set(MARGIN_SIDES);\n\nconst BASE_KEY: ConditionKey = conditionKey(BASE_CONDITION);\n\nfunction asElement(node: NodeLike): DeepReadonly<IRElement> | null {\n const n = node as DeepReadonly<IRNode>;\n return n.kind === 'element' ? (n as DeepReadonly<IRElement>) : null;\n}\n\n/** Raw-html opacity barrier — no combinator exposes this, so narrow + read the meta flag locally. */\nconst hasDangerousHtml: Matcher = (node) => asElement(node)?.meta.hasDangerousHtml ?? false;\n\n/** Collapse four side values into the shortest legal CSS `margin` shorthand value string. */\nfunction collapseMarginValue(top: string, right: string, bottom: string, left: string): string {\n if (right === left) {\n if (top === bottom) {\n return top === right ? top : `${top} ${right}`;\n }\n return `${top} ${right} ${bottom}`;\n }\n return `${top} ${right} ${bottom} ${left}`;\n}\n\n/** Rebuild the computed StyleMap with the four BASE-block margin longhands replaced by `margin`. */\nfunction withFoldedMargin(sm: StyleMap, marginDecl: StyleDecl): StyleMap {\n const blocks = new Map<ConditionKey, StyleBlock>();\n for (const [key, block] of sm.blocks) {\n if (key !== BASE_KEY) {\n blocks.set(key, block);\n continue;\n }\n const decls = new Map<CssProperty, StyleDecl>();\n for (const [prop, decl] of block.decls) {\n if (!MARGIN_SIDE_SET.has(String(prop))) decls.set(prop, decl);\n }\n decls.set(marginDecl.property, marginDecl);\n blocks.set(key, { condition: block.condition, decls });\n }\n return { blocks };\n}\n\n/* ───────────────────────── the pattern ───────────────────────── */\n\n/**\n * Fold four margin longhands into one `margin` shorthand on the element's base style block.\n */\nexport const marginShorthand = pattern({\n name: 'margin-shorthand',\n category: 'compress/margin-shorthand',\n safety: 2,\n doc: {\n title: 'Compress margin longhands into the `margin` shorthand',\n summary:\n 'An element with margin-top/right/bottom/left all set has them collapsed into the shortest ' +\n 'legal `margin` shorthand (the m / mx / my forms); meaning is preserved, declaration count drops.',\n before: '<div style=\"margin-top:8px;margin-right:8px;margin-bottom:8px;margin-left:8px\"/>',\n after: '<div style=\"margin:8px\"/>',\n safetyRationale:\n 'Pure representation change (no pixels move); skips nodes with ref/handlers/dynamic children/' +\n 'raw html, dynamic class segments, or combinator-subject selectors.',\n },\n match: {\n where: [\n not(hasRef),\n not(hasEventHandlers),\n not(hasDynamicChildren),\n not(hasDynamicClasses),\n not(hasDangerousHtml),\n not(targetedByCombinator),\n ],\n },\n rewrite: {\n rewriteClasses(computed: StyleMap): StyleMap | null {\n const base = computed.blocks.get(BASE_KEY);\n if (!base) return null;\n\n // Require all four longhands present in the base block (the `m` collapse only touches base).\n const sides = MARGIN_SIDES.map((p) => base.decls.get(p as CssProperty));\n if (sides.some((d) => d === undefined)) return null;\n const [mt, mr, mb, ml] = sides as readonly StyleDecl[];\n\n // A shorthand can only carry a uniform `!important`; mixing would change cascade behaviour.\n if (mt.important || mr.important || mb.important || ml.important) return null;\n\n const value = collapseMarginValue(\n String(mt.value),\n String(mr.value),\n String(mb.value),\n String(ml.value),\n );\n\n const marginDecl: StyleDecl = {\n property: 'margin' as CssProperty,\n value: value as CssValue,\n important: false,\n relativeToParent:\n mt.relativeToParent || mr.relativeToParent || mb.relativeToParent || ml.relativeToParent,\n inherited: false, // margin is not an inherited property\n };\n\n return withFoldedMargin(computed, marginDecl);\n },\n },\n examples: [\n {\n // The four equal margin longhands collapse to a `margin` shorthand at the IR level, and the\n // minimizing reverse-emit picks the single shortest utility (`m-2`) reproducing it, replacing\n // the four `m{t,r,b,l}-2` tokens. `bg-red-200` is preserved.\n before: '<div className=\"mt-2 mr-2 mb-2 ml-2 bg-red-200\">box</div>',\n after: '<div className=\"bg-red-200 m-2\">box</div>',\n },\n {\n // Only two margin sides set → the four-longhand `margin` collapse does not apply.\n noMatch: '<div className=\"mt-2 mb-2 bg-red-200\">box</div>',\n },\n ],\n});\n","/**\n * @domflax/patterns — compress pattern: `padding-shorthand`.\n *\n * Collapses an element whose four padding sides are expressed as separate longhand declarations\n * back into the shortest equivalent shorthand:\n *\n * padding-top:16px; padding-right:16px; padding-bottom:16px; padding-left:16px\n * ⇒ padding:16px (Tailwind `p-4`)\n *\n * padding-top:8px; padding-bottom:8px; padding-left:16px; padding-right:16px\n * ⇒ padding:8px 16px (Tailwind `px-4 py-2`)\n *\n * The IR's computed StyleMap is canonically LONGHAND (the shared normalizer expands every box\n * shorthand at parse time). This pass runs the expansion in reverse on the computed map ONLY when\n * the four sides fold cleanly into a 1- or 2-value form — i.e. `top===bottom` AND `left===right`.\n *\n * Authored with the declarative {@link pattern} API: the `where` guards exclude opacity barriers,\n * dynamic class lists, spread/component identity, and combinator subjects; the `rewriteClasses`\n * recipe rebuilds the class StyleMap, declining (`null`) unless the four sides fold cleanly.\n */\n\nimport type {\n ConditionKey,\n CssProperty,\n CssValue,\n DeepReadonly,\n IRElement,\n IRNode,\n NodeLike,\n StyleBlock,\n StyleDecl,\n StyleMap,\n} from '@domflax/core';\nimport { BASE_CONDITION, conditionKey } from '@domflax/core';\n\nimport {\n hasDynamicChildren,\n hasDynamicClasses,\n hasEventHandlers,\n hasRef,\n not,\n pattern,\n targetedByCombinator,\n type Matcher,\n} from '@domflax/pattern-kit';\n\n/* ───────────────────────── padding analysis ───────────────────────── */\n\n/** The four padding longhands, in CSS shorthand order: top, right, bottom, left. */\nconst PADDING_SIDES = [\n 'padding-top',\n 'padding-right',\n 'padding-bottom',\n 'padding-left',\n] as const;\n\nconst PADDING_SIDE_SET: ReadonlySet<string> = new Set<string>(PADDING_SIDES);\n\nconst BASE_KEY: ConditionKey = conditionKey(BASE_CONDITION);\n\n/** The collapsed shorthand the four sides fold into (carrying important / relative-unit flags). */\ninterface PaddingFold {\n readonly value: string; // 1-value (`16px`) or 2-value (`8px 16px`) form\n readonly important: boolean;\n readonly relative: boolean;\n}\n\n/**\n * Inspect the BASE-condition block of `sm` and, iff all four padding longhands are present, share a\n * uniform `!important` flag, and form matching x/y pairs (`top===bottom` AND `left===right`), return\n * the shortest equivalent shorthand value. Returns `null` when the sides cannot fold.\n */\nfunction analyzePadding(sm: StyleMap): PaddingFold | null {\n const block = sm.blocks.get(BASE_KEY);\n if (!block) return null;\n\n const sides: StyleDecl[] = [];\n for (const side of PADDING_SIDES) {\n const decl = block.decls.get(side as CssProperty);\n if (!decl) return null;\n sides.push(decl);\n }\n const [top, right, bottom, left] = sides as [StyleDecl, StyleDecl, StyleDecl, StyleDecl];\n\n // A shorthand cannot carry per-side `!important`; only fold a uniform flag.\n if (\n !(\n top.important === right.important &&\n right.important === bottom.important &&\n bottom.important === left.important\n )\n ) {\n return null;\n }\n\n const tv = String(top.value);\n const rv = String(right.value);\n const bv = String(bottom.value);\n const lv = String(left.value);\n\n // Only the `p-*` (all equal) and `px-* py-*` (matching pairs) shapes are in scope.\n if (tv !== bv || lv !== rv) return null;\n\n const value = tv === lv ? tv : `${tv} ${lv}`;\n const relative = sides.some((d) => d.relativeToParent);\n return { value, important: top.important, relative };\n}\n\n/* ───────────────────────── match guards ───────────────────────── */\n\n/** Element carries no hard opacity barrier that rewriting its class list could disturb. */\nconst isInert: Matcher = (node) => {\n const n = node as DeepReadonly<IRNode>;\n if (n.kind !== 'element') return false;\n const el = n as DeepReadonly<IRElement>;\n return !el.meta.hasDangerousHtml && !el.meta.hasSpreadAttrs && !el.isComponent;\n};\n\n/* ───────────────────────── style rebuild ───────────────────────── */\n\n/** Rebuild `sm` with the four BASE-block padding longhands replaced by one `padding` shorthand. */\nfunction withFoldedPadding(sm: StyleMap, fold: PaddingFold): StyleMap {\n const blocks = new Map<ConditionKey, StyleBlock>();\n for (const [key, block] of sm.blocks) {\n if (key !== BASE_KEY) {\n blocks.set(key, block);\n continue;\n }\n const decls = new Map<CssProperty, StyleDecl>();\n for (const [prop, decl] of block.decls) {\n if (PADDING_SIDE_SET.has(String(prop))) continue; // drop the four longhands\n decls.set(prop, decl);\n }\n const shorthand: StyleDecl = {\n property: 'padding' as CssProperty,\n value: fold.value as CssValue,\n important: fold.important,\n relativeToParent: fold.relative,\n inherited: false, // padding is never inherited\n };\n decls.set(shorthand.property, shorthand);\n blocks.set(key, { condition: block.condition, decls });\n }\n return { blocks };\n}\n\n/* ───────────────────────── the pattern ───────────────────────── */\n\n/**\n * Compress an element's four equal/paired padding longhands into the shortest `padding` shorthand.\n */\nexport const paddingShorthand = pattern({\n name: 'padding-shorthand',\n category: 'compress/padding-shorthand',\n safety: 1,\n doc: {\n title: 'Collapse padding longhands to shorthand',\n summary:\n 'Equal padding on all four sides (or matching x/y pairs) expressed as separate longhand ' +\n 'declarations is collapsed to the shortest equivalent padding shorthand (p-* / px-* py-*).',\n before: '<div class=\"pt-4 pr-4 pb-4 pl-4\"/>',\n after: '<div class=\"p-4\"/>',\n safetyRationale:\n 'A value-preserving re-serialization of the same computed styles on the same node; it skips ' +\n 'nodes with ref/handlers/dynamic children/dynamic classes/dangerous html and combinator ' +\n 'subjects, so no JS identity, behaviour, or project selector is disturbed.',\n },\n match: {\n where: [\n not(hasRef),\n not(hasEventHandlers),\n not(hasDynamicChildren),\n not(hasDynamicClasses),\n not(targetedByCombinator),\n isInert,\n ],\n },\n rewrite: {\n rewriteClasses(computed: StyleMap): StyleMap | null {\n const fold = analyzePadding(computed);\n return fold ? withFoldedPadding(computed, fold) : null;\n },\n },\n examples: [\n {\n // The four equal padding longhands collapse to a `padding` shorthand at the IR level, and the\n // minimizing reverse-emit picks the single shortest utility (`p-4`) that reproduces it,\n // replacing the four `p{t,r,b,l}-4` tokens. `bg-red-200` is preserved (its order is stable).\n before: '<div className=\"pt-4 pr-4 pb-4 pl-4 bg-red-200\">box</div>',\n after: '<div className=\"bg-red-200 p-4\">box</div>',\n },\n {\n // Asymmetric padding (top != bottom) cannot fold into a shorthand.\n noMatch: '<div className=\"pt-2 pr-4 pb-8 pl-4 bg-red-200\">box</div>',\n },\n ],\n});\n","/**\n * @domflax/patterns — compress pattern: `size-shorthand`.\n *\n * Collapses an element whose computed `width` and `height` are EQUAL into the single Tailwind\n * `size-*` utility:\n *\n * <div style=\"width:1rem; height:1rem\"/> → <div class=\"size-4\"/>\n *\n * At the IR level we work over the normalized computed StyleMap (CSS longhands), so the pattern\n * recognizes the `width === height` shape in the BASE condition and rebuilds the element's class\n * StyleMap with a single `size` declaration (the resolver reverse-emits the concrete `size-*` token\n * at codegen). Both longhands are removed and replaced by the merged `size` decl, so the rewrite is\n * idempotent — once collapsed there is no `width`+`height` pair left to re-match.\n *\n * Authored with the declarative {@link pattern} API: the `where` guards exclude opacity barriers,\n * dynamic class lists, and combinator subjects (compress patterns get NO auto-guards); the\n * `rewriteClasses` recipe rebuilds the class StyleMap, returning `null` (decline) unless the BASE\n * width/height are equal, concrete, and share an `!important` flag.\n */\n\nimport type {\n ConditionKey,\n CssProperty,\n DeepReadonly,\n IRElement,\n IRNode,\n NodeLike,\n StyleBlock,\n StyleDecl,\n StyleMap,\n} from '@domflax/core';\nimport { BASE_CONDITION, conditionKey } from '@domflax/core';\n\nimport {\n hasDynamicChildren,\n hasDynamicClasses,\n hasEventHandlers,\n hasRef,\n normalizer,\n not,\n pattern,\n targetedByCombinator,\n type Matcher,\n} from '@domflax/pattern-kit';\n\nconst WIDTH = 'width' as CssProperty;\nconst HEIGHT = 'height' as CssProperty;\nconst SIZE = 'size' as CssProperty;\n\n/** Values for which collapsing the two axes is pointless or unsound (no concrete equal extent). */\nconst NON_COLLAPSIBLE_VALUES: ReadonlySet<string> = new Set<string>(['auto', 'initial', 'unset']);\n\n/* ───────────────────────── helpers ───────────────────────── */\n\nfunction asElement(node: NodeLike): DeepReadonly<IRElement> | null {\n const n = node as DeepReadonly<IRNode>;\n return n.kind === 'element' ? (n as DeepReadonly<IRElement>) : null;\n}\n\n/** Read the BASE-condition block of the node's normalized computed StyleMap, if any. */\nfunction baseBlock(sm: StyleMap): StyleBlock | undefined {\n return sm.blocks.get(conditionKey(BASE_CONDITION));\n}\n\n/** Element carries raw/dangerous HTML (e.g. dangerouslySetInnerHTML) — a hard opacity barrier. */\nconst hasDangerousHtml: Matcher = (node) => asElement(node)?.meta.hasDangerousHtml ?? false;\n\n/**\n * Rebuild the computed StyleMap with the BASE block's `width`/`height` pair replaced by a single\n * `size` declaration; all other conditions/blocks are preserved verbatim.\n */\nfunction withSizeShorthand(sm: StyleMap, value: string, important: boolean): StyleMap {\n const baseKey = conditionKey(BASE_CONDITION);\n const blocks = new Map<ConditionKey, StyleBlock>();\n for (const [key, block] of sm.blocks) {\n if (key !== baseKey) {\n blocks.set(key, block);\n continue;\n }\n const decls = new Map<CssProperty, StyleDecl>(block.decls);\n decls.delete(WIDTH);\n decls.delete(HEIGHT);\n for (const decl of normalizer.normalizeDeclaration(String(SIZE), value, important)) {\n decls.set(decl.property, decl);\n }\n blocks.set(key, { condition: block.condition, decls });\n }\n return { blocks };\n}\n\n/* ───────────────────────── the pattern ───────────────────────── */\n\n/** Fold equal `width`/`height` into the `size-*` utility. */\nexport const sizeShorthand = pattern({\n name: 'size-shorthand',\n category: 'compress/size-shorthand',\n safety: 2,\n doc: {\n title: 'Collapse equal width/height into size-*',\n summary:\n 'An element whose computed width and height are equal is rewritten to the single Tailwind ' +\n 'size-* utility (size-* === width + height at the same value).',\n before: '<div style=\"width:1rem;height:1rem\"/>',\n after: '<div class=\"size-4\"/>',\n safetyRationale:\n 'size-* is value-identical to equal width+height; the element carries no ref/handlers/' +\n 'dynamic children/dangerous HTML, no dynamic class segment, and is not a combinator subject.',\n },\n match: {\n where: [\n not(hasRef),\n not(hasEventHandlers),\n not(hasDynamicChildren),\n not(hasDangerousHtml),\n not(hasDynamicClasses),\n not(targetedByCombinator),\n ],\n },\n rewrite: {\n rewriteClasses(computed: StyleMap): StyleMap | null {\n const base = baseBlock(computed);\n const w = base?.decls.get(WIDTH);\n const h = base?.decls.get(HEIGHT);\n if (!w || !h) return null;\n if (w.important !== h.important) return null;\n if (NON_COLLAPSIBLE_VALUES.has(String(w.value))) return null;\n if (w.value !== h.value) return null;\n return withSizeShorthand(computed, String(w.value), w.important);\n },\n },\n examples: [\n {\n // Equal width/height collapse to a `size` decl at the IR level; the minimizing reverse-emit\n // expands `size` back to width+height, finds the single utility covering both (`size-10`), and\n // replaces the `h-10`+`w-10` pair with it. `bg-red-200` is preserved.\n before: '<div className=\"h-10 w-10 bg-red-200\">box</div>',\n after: '<div className=\"bg-red-200 size-10\">box</div>',\n },\n {\n // Width and height differ → no equal-axis collapse.\n noMatch: '<div className=\"h-10 w-20 bg-red-200\">box</div>',\n },\n ],\n});\n","/**\n * AUTO-GENERATED by `scripts/gen-registry.mjs` — DO NOT EDIT BY HAND.\n *\n * Regenerate with `npm run generate` (also runs automatically before build/typecheck/test).\n * Patterns are discovered by the `*.pattern.ts` file convention under `src/flatten` and\n * `src/compress`; the array below is sorted flatten-before-compress.\n */\n\nimport type { Pattern } from '@domflax/core';\n\nimport { emptyStyleDiv } from './flatten/empty-style-div.pattern';\nimport { flexCenterWrapper } from './flatten/flex-center-wrapper.pattern';\nimport { nestedFlexMerge } from './flatten/nested-flex-merge.pattern';\nimport { passthroughWrapper } from './flatten/passthrough-wrapper.pattern';\nimport { redundantFragment } from './flatten/redundant-fragment.pattern';\nimport { dedupeClasses } from './compress/dedupe-classes.pattern';\nimport { insetShorthand } from './compress/inset-shorthand.pattern';\nimport { marginShorthand } from './compress/margin-shorthand.pattern';\nimport { paddingShorthand } from './compress/padding-shorthand.pattern';\nimport { sizeShorthand } from './compress/size-shorthand.pattern';\n\nexport {\n emptyStyleDiv,\n flexCenterWrapper,\n nestedFlexMerge,\n passthroughWrapper,\n redundantFragment,\n dedupeClasses,\n insetShorthand,\n marginShorthand,\n paddingShorthand,\n sizeShorthand,\n};\n\n/** Every built-in pattern, in registration order (flatten patterns before compress). */\nexport const builtinPatterns: readonly Pattern[] = [\n emptyStyleDiv,\n flexCenterWrapper,\n nestedFlexMerge,\n passthroughWrapper,\n redundantFragment,\n dedupeClasses,\n insetShorthand,\n marginShorthand,\n paddingShorthand,\n sizeShorthand,\n];\n\nexport default builtinPatterns;\n","/**\n * @domflax/frontend-jsx — Babel JSX/TSX → IR frontend.\n *\n * Walks a Babel AST (`@babel/parser` → `@babel/traverse`) and lowers JSXElement /\n * JSXFragment / JSXText / JSXExpressionContainer / JSXSpreadChild nodes into the\n * `@domflax/core` IR. ALL dynamic JavaScript stays out of the structural IR: every\n * expression container, spread, and dynamic className/child is interned into the\n * document's {@link ExprRegistry} as an opaque {@link ExprRef} (with its verbatim source\n * slice as payload), and only its source span survives in the tree.\n *\n * Static `class`/`className` literals are split into {@link ClassToken}s on a static\n * {@link ClassSegment}; a non-string-literal className becomes a single dynamic segment\n * (opaque, never optimized). Static classes are resolved through the supplied\n * {@link StyleResolver} + {@link StyleNormalizer} into `element.computed` so downstream\n * patterns can match on resolved style.\n *\n * NodeMeta opacity barriers populated here: hasRef (`ref=`), hasEventHandlers (`on*=`),\n * hasKey (`key=`), hasSpreadAttrs (`{...x}`), hasDangerousHtml\n * (`dangerouslySetInnerHTML=`), hasDynamicChildren (any expression / spread child),\n * isComponent (capitalized / member tag). \"hasDynamicClasses\" is carried on the\n * {@link ClassList} itself (`hasDynamic` / `opaque`), not on NodeMeta.\n */\n\nimport { parse as babelParse } from '@babel/parser';\nimport babelTraverse from '@babel/traverse';\nimport type { NodePath } from '@babel/traverse';\nimport type {\n Expression,\n JSXAttribute,\n JSXElement,\n JSXEmptyExpression,\n JSXFragment,\n JSXIdentifier,\n JSXMemberExpression,\n JSXNamespacedName,\n JSXOpeningElement,\n Node as BabelNode,\n} from '@babel/types';\n\nimport type {\n AttrMap,\n AttrValue,\n ClassList,\n ClassListForm,\n ClassSegment,\n ClassToken,\n Diagnostic,\n ExprKind,\n ExprRef,\n FileKind,\n Frontend,\n FrontendParseContext,\n IRDocument,\n IRElement,\n IRFragment,\n IRNamespace,\n IRNodeId,\n MutableBackrefTable,\n NodeMeta,\n ParseResult,\n SourceFile,\n SourceFileId,\n SourceSpan,\n StyleMap,\n} from '@domflax/core';\nimport {\n createDocument,\n createElement,\n createExpr,\n createFragment,\n createText,\n defaultMeta,\n emptyClassList,\n emptyStyleMap,\n} from '@domflax/core';\n\n/* ───────────────────────── @babel/traverse interop ───────────────────────── */\n\n// `@babel/traverse` is published as CJS (`module.exports = traverse; exports.default = traverse`).\n// Under an ESM default import the value may be the function OR `{ default: fn }` depending on the\n// interop layer (Node ESM vs. esbuild vs. tsup), so normalize defensively.\nconst traverse = (\n typeof babelTraverse === 'function'\n ? babelTraverse\n : (babelTraverse as unknown as { default: typeof babelTraverse }).default\n) as typeof babelTraverse;\n\n/** Languages this frontend claims. JSX/TSX only; HTML is owned by a sibling frontend. */\nconst JSX_LANGS: readonly FileKind[] = ['jsx', 'tsx'];\n\n/** The single registered source file id (one parse == one module). */\nconst FILE_ID = 1 as SourceFileId;\n\n/** Marker payload stored for every interned expression so the backend can re-print it. */\ninterface ExprPayload {\n readonly text: string;\n readonly spread: boolean;\n}\n\n/* ───────────────────────── name + classification helpers ───────────────────────── */\n\ntype JSXName = JSXIdentifier | JSXMemberExpression | JSXNamespacedName;\n\nfunction jsxName(node: JSXName): string {\n switch (node.type) {\n case 'JSXIdentifier':\n return node.name;\n case 'JSXMemberExpression':\n return `${jsxName(node.object)}.${node.property.name}`;\n case 'JSXNamespacedName':\n return `${node.namespace.name}:${node.name.name}`;\n }\n}\n\n/** Component vs. intrinsic: capitalized identifier or member expression ⇒ component. */\nfunction isComponentName(node: JSXName): boolean {\n if (node.type === 'JSXMemberExpression') return true;\n if (node.type === 'JSXNamespacedName') return false;\n return /^[A-Z]/.test(node.name);\n}\n\nfunction attrName(name: JSXAttribute['name']): string {\n return name.type === 'JSXNamespacedName'\n ? `${name.namespace.name}:${name.name.name}`\n : name.name;\n}\n\nfunction exprKind(node: BabelNode): ExprKind {\n switch (node.type) {\n case 'CallExpression':\n case 'OptionalCallExpression':\n return 'call';\n case 'MemberExpression':\n case 'OptionalMemberExpression':\n return 'member';\n case 'ConditionalExpression':\n case 'LogicalExpression':\n return 'conditional';\n case 'TemplateLiteral':\n case 'TaggedTemplateExpression':\n return 'template';\n case 'Identifier':\n return 'identifier';\n case 'SpreadElement':\n return 'spread';\n default:\n return 'other';\n }\n}\n\n/** Map a dynamic className expression to the closest {@link ClassListForm}. */\nfunction classFormOf(node: BabelNode): ClassListForm {\n switch (node.type) {\n case 'TemplateLiteral':\n case 'TaggedTemplateExpression':\n return 'template-literal';\n case 'CallExpression':\n case 'OptionalCallExpression':\n return 'call';\n case 'ConditionalExpression':\n case 'LogicalExpression':\n return 'conditional';\n case 'MemberExpression':\n case 'OptionalMemberExpression':\n case 'Identifier':\n return 'member';\n default:\n return 'call';\n }\n}\n\n/* ───────────────────────── the frontend ───────────────────────── */\n\nfunction looksLikeJsx(id: string, code: string): boolean {\n if (/\\.[jt]sx$/i.test(id)) return true;\n return /<\\/?[A-Za-z][\\w.-]*|<>/.test(code);\n}\n\nfunction doParse(code: string, ctx: FrontendParseContext): ParseResult {\n const diagnostics: Diagnostic[] = [];\n const doc: IRDocument = createDocument('jsx');\n const backref = doc.backref as MutableBackrefTable;\n\n const ast = babelParse(code, {\n sourceType: 'module',\n plugins: ['jsx', 'typescript'],\n });\n\n const eol: '\\n' | '\\r\\n' = code.includes('\\r\\n') ? '\\r\\n' : '\\n';\n const sourceFile: SourceFile = {\n id: FILE_ID,\n path: ctx.id,\n text: code,\n frontend: 'jsx',\n eol,\n indentUnit: ' ',\n native: ast,\n };\n doc.sources.set(FILE_ID, sourceFile);\n\n /* ----- span helpers (close over `code`) ----- */\n\n const spanOf = (node: BabelNode): SourceSpan | null => {\n if (node.start == null || node.end == null) return null;\n const span: SourceSpan = {\n file: FILE_ID,\n start: node.start,\n end: node.end,\n startLoc: node.loc\n ? { line: node.loc.start.line, column: node.loc.start.column }\n : undefined,\n endLoc: node.loc ? { line: node.loc.end.line, column: node.loc.end.column } : undefined,\n };\n return span;\n };\n\n const sliceOf = (node: BabelNode): string =>\n node.start == null || node.end == null ? '' : code.slice(node.start, node.end);\n\n /** Intern an expression as an opaque ExprRef, recording its verbatim source slice. */\n const internExpr = (node: Expression | JSXEmptyExpression, spread: boolean): ExprRef => {\n const payload: ExprPayload = { text: sliceOf(node), spread };\n return doc.exprs.intern({\n span: spanOf(node) ?? { file: FILE_ID, start: 0, end: 0 },\n kind: exprKind(node),\n payload,\n });\n };\n\n /* ----- class list ----- */\n\n const splitTokens = (raw: string): ClassToken[] =>\n raw\n .split(/\\s+/)\n .filter((t) => t.length > 0)\n .map((value) => ({ value }) as ClassToken);\n\n const buildClassList = (attr: JSXAttribute): ClassList => {\n const attrSpan = spanOf(attr) ?? undefined;\n const v = attr.value;\n\n const staticList = (tokens: ClassToken[], valueSpan: SourceSpan | null): ClassList => {\n const seg: ClassSegment = { kind: 'static', span: valueSpan ?? undefined, tokens };\n return {\n form: 'string-literal',\n segments: [seg],\n valueSpan,\n attrSpan,\n hasDynamic: false,\n opaque: false,\n rewritable: true,\n };\n };\n\n if (v == null) return staticList([], null);\n\n if (v.type === 'StringLiteral') {\n return staticList(splitTokens(v.value), spanOf(v));\n }\n\n if (v.type === 'JSXExpressionContainer') {\n const expr = v.expression;\n // `className={\"a b\"}` is still a static string literal.\n if (expr.type === 'StringLiteral') {\n return staticList(splitTokens(expr.value), spanOf(expr));\n }\n if (expr.type === 'JSXEmptyExpression') return staticList([], null);\n const ref = internExpr(expr, false);\n const valueSpan = spanOf(expr);\n const seg: ClassSegment = { kind: 'dynamic', span: valueSpan ?? undefined, expr: ref };\n return {\n form: classFormOf(expr),\n segments: [seg],\n valueSpan,\n attrSpan,\n hasDynamic: true,\n opaque: true,\n rewritable: false,\n };\n }\n\n return emptyClassList();\n };\n\n const staticTokensOf = (classes: ClassList): string[] => {\n const out: string[] = [];\n for (const seg of classes.segments) {\n if (seg.kind === 'static') for (const t of seg.tokens) out.push(t.value);\n }\n return out;\n };\n\n /* ----- attribute value ----- */\n\n const buildAttrValue = (attr: JSXAttribute): AttrValue => {\n const v = attr.value;\n if (v == null) return { kind: 'static', value: true, span: spanOf(attr) ?? undefined };\n if (v.type === 'StringLiteral') {\n return { kind: 'static', value: v.value, span: spanOf(v) ?? undefined };\n }\n if (v.type === 'JSXExpressionContainer') {\n if (v.expression.type === 'JSXEmptyExpression') {\n return { kind: 'static', value: true, span: spanOf(v) ?? undefined };\n }\n return { kind: 'dynamic', expr: internExpr(v.expression, false), span: spanOf(v) ?? undefined };\n }\n // JSXElement / JSXFragment used as an attribute value → opaque expression.\n return { kind: 'dynamic', expr: internExpr(v as Expression, false), span: spanOf(v) ?? undefined };\n };\n\n /* ----- node builders ----- */\n\n const buildChild = (node: JSXElement['children'][number], parentId: IRNodeId): IRNodeId | null => {\n switch (node.type) {\n case 'JSXText': {\n const id = doc.alloc.next();\n doc.nodes.set(\n id,\n createText(id, node.value, {\n parent: parentId,\n span: spanOf(node),\n collapsible: /^\\s*$/.test(node.value),\n }),\n );\n return id;\n }\n case 'JSXExpressionContainer': {\n if (node.expression.type === 'JSXEmptyExpression') return null; // `{/* comment */}`\n const id = doc.alloc.next();\n const ref = internExpr(node.expression, false);\n doc.nodes.set(id, createExpr(id, ref, { parent: parentId, span: spanOf(node) }));\n return id;\n }\n case 'JSXSpreadChild': {\n const id = doc.alloc.next();\n const ref = internExpr(node.expression, true);\n doc.nodes.set(id, createExpr(id, ref, { parent: parentId, span: spanOf(node) }));\n return id;\n }\n case 'JSXElement':\n return buildElement(node, parentId);\n case 'JSXFragment':\n return buildFragment(node, parentId);\n default:\n return null;\n }\n };\n\n const buildFragment = (node: JSXFragment, parentId: IRNodeId): IRNodeId => {\n const id = doc.alloc.next();\n const children: IRNodeId[] = [];\n for (const c of node.children) {\n const cid = buildChild(c, id);\n if (cid != null) children.push(cid);\n }\n doc.nodes.set(id, createFragment(id, { children, parent: parentId, span: spanOf(node) }));\n backref.set(id, {\n nodeId: id,\n span: spanOf(node) ?? { file: FILE_ID, start: 0, end: 0 },\n openTagSpan: spanOf(node.openingFragment),\n closeTagSpan: spanOf(node.closingFragment),\n innerSpan: null,\n selfClosing: false,\n });\n return id;\n };\n\n const buildElement = (node: JSXElement, parentId: IRNodeId): IRNodeId => {\n const id = doc.alloc.next();\n const opening: JSXOpeningElement = node.openingElement;\n const tag = jsxName(opening.name);\n const component = isComponentName(opening.name);\n\n const meta: NodeMeta = defaultMeta();\n meta.isComponent = component;\n\n let classes: ClassList = emptyClassList();\n const entries = new Map<string, AttrValue>();\n const order: string[] = [];\n const spreads: ExprRef[] = [];\n\n for (const attr of opening.attributes) {\n if (attr.type === 'JSXSpreadAttribute') {\n spreads.push(internExpr(attr.argument, true));\n meta.hasSpreadAttrs = true;\n continue;\n }\n const name = attrName(attr.name);\n if (name === 'className' || name === 'class') {\n classes = buildClassList(attr);\n continue;\n }\n if (name === 'ref') meta.hasRef = true;\n else if (name === 'key') meta.hasKey = true;\n else if (name === 'dangerouslySetInnerHTML') meta.hasDangerousHtml = true;\n else if (/^on[A-Z]/.test(name)) meta.hasEventHandlers = true;\n entries.set(name, buildAttrValue(attr));\n order.push(name);\n }\n\n const attrs: AttrMap = { entries, spreads, order };\n\n const children: IRNodeId[] = [];\n for (const c of node.children) {\n const cid = buildChild(c, id);\n if (cid != null) children.push(cid);\n }\n for (const cid of children) {\n const cn = doc.nodes.get(cid);\n if (cn && cn.kind === 'expr') {\n meta.hasDynamicChildren = true;\n break;\n }\n }\n\n // Resolve static classes (+ tag) into computed style via the injected resolver/normalizer.\n let computed: StyleMap = emptyStyleMap();\n if (!classes.hasDynamic) {\n const tokens = staticTokensOf(classes);\n if (tokens.length > 0) {\n const res = ctx.resolver.resolve({\n classes: tokens,\n element: { tagName: tag, namespace: component ? undefined : 'html' },\n });\n computed = ctx.normalizer.normalizeStyleMap(res.styles);\n for (const w of res.warnings) {\n diagnostics.push({\n code: 'DF_STYLE_CONFLICT_UNRESOLVED',\n severity: w.severity,\n message: w.message,\n nodeId: id,\n });\n }\n }\n }\n\n const namespace: IRNamespace = component ? 'component' : 'html';\n const el: IRElement = createElement(id, {\n tag,\n namespace,\n isComponent: component,\n selfClosing: opening.selfClosing,\n classes,\n computed,\n attrs,\n children,\n parent: parentId,\n span: spanOf(node),\n meta,\n });\n doc.nodes.set(id, el);\n\n const inner =\n children.length > 0\n ? spanOf(node.children[0]! as BabelNode) && spanOf(node.children.at(-1)! as BabelNode)\n ? {\n file: FILE_ID,\n start: spanOf(node.children[0]! as BabelNode)!.start,\n end: spanOf(node.children.at(-1)! as BabelNode)!.end,\n }\n : null\n : null;\n backref.set(id, {\n nodeId: id,\n span: spanOf(node) ?? { file: FILE_ID, start: 0, end: 0 },\n openTagSpan: spanOf(opening),\n closeTagSpan: node.closingElement ? spanOf(node.closingElement) : null,\n innerSpan: inner,\n selfClosing: opening.selfClosing,\n });\n return id;\n };\n\n /* ----- collect the outermost JSX islands and attach them to the root fragment ----- */\n\n const roots: (JSXElement | JSXFragment)[] = [];\n traverse(ast, {\n JSXElement(path: NodePath<JSXElement>) {\n roots.push(path.node);\n path.skip();\n },\n JSXFragment(path: NodePath<JSXFragment>) {\n roots.push(path.node);\n path.skip();\n },\n });\n\n const rootFrag = doc.nodes.get(doc.root) as IRFragment;\n for (const r of roots) {\n const id = r.type === 'JSXFragment' ? buildFragment(r, doc.root) : buildElement(r, doc.root);\n rootFrag.children.push(id);\n }\n\n return { doc, diagnostics };\n}\n\nexport const jsxFrontend: Frontend = {\n name: 'babel-jsx',\n langs: JSX_LANGS,\n canParse(id: string, code: string): boolean {\n return looksLikeJsx(id, code);\n },\n parse(code: string, ctx: FrontendParseContext): ParseResult {\n return doParse(code, ctx);\n },\n};\n\n/** Factory mirror — returns a fresh handle to the (stateless) JSX frontend. */\nexport function createJsxFrontend(): Frontend {\n return jsxFrontend;\n}\n","/**\n * @domflax/frontend-jsx — IR → JSX/TSX backend (SURGICAL, full-module round-trip).\n *\n * The pass manager mutates a tree of JSX *islands* that were lowered from a complete module\n * (imports, `export default function`, hooks, `return (…)`, `{expr}` holes, comments, …). The\n * backend's job is to emit a COMPLETE, valid module — not just the JSX subtree. It does this by\n * starting from the element's ORIGINAL verbatim source (retained on {@link SourceFile.text}) and\n * applying ONLY the diffs the passes produced, via `magic-string`:\n *\n * • CLASS CHANGE — for every surviving element whose static class list differs from its source\n * text, overwrite just the `class`/`className` attribute VALUE span (quotes included) with the\n * new tokens. If the element gained classes but had no class attribute, insert one on the\n * opening tag.\n * • UNWRAP (flatten) — when a wrapper element/fragment was removed but its children survived,\n * delete ONLY the wrapper's open- and close-tag spans; the children (and their entire subtrees,\n * including dynamic `{expr}` holes and `key=`) are preserved verbatim.\n * • FULL REMOVAL — when a node was removed with no surviving descendant, delete its whole span.\n *\n * Every other byte — imports, exports, function declarations, returns, hooks, `{expr}` holes,\n * whitespace, comments, attribute ordering — is left exactly as authored. Output is\n * `magicString.toString()`: a complete module.\n *\n * Fallback: a document with no retained source (e.g. a hand-synthesized IR) cannot be spliced, so\n * it falls back to a clean structural re-print ({@link rePrint}).\n */\n\nimport MagicString from 'magic-string';\n\nimport type {\n AttrValue,\n Backend,\n BackendContext,\n Backref,\n ClassList,\n CodegenResult,\n EditPlan,\n ExprRef,\n FileKind,\n IRDocument,\n IRElement,\n IRNode,\n IRNodeId,\n SourceFile,\n SourceSpan,\n} from '@domflax/core';\n\nconst JSX_LANGS: readonly FileKind[] = ['jsx', 'tsx'];\n\ninterface ExprPayload {\n readonly text: string;\n readonly spread: boolean;\n}\n\n/* ───────────────────────── shared expr/class helpers ───────────────────────── */\n\n/** Recover an interned expression's source text (payload first, span-slice fallback). */\nfunction exprText(doc: IRDocument, ref: ExprRef): ExprPayload {\n const rec = doc.exprs.get(ref);\n const payload = rec?.payload as Partial<ExprPayload> | undefined;\n if (payload && typeof payload.text === 'string') {\n return { text: payload.text, spread: payload.spread === true };\n }\n if (rec) {\n const sf = doc.sources.get(rec.span.file);\n if (sf) return { text: sf.text.slice(rec.span.start, rec.span.end), spread: false };\n }\n return { text: '', spread: false };\n}\n\n/** All static class tokens of a {@link ClassList}, in order. */\nfunction staticTokensOf(classes: ClassList): string[] {\n const out: string[] = [];\n for (const seg of classes.segments) {\n if (seg.kind === 'static') for (const t of seg.tokens) out.push(t.value);\n }\n return out;\n}\n\n/* ───────────────────────── surgical (magic-string) codegen ───────────────────────── */\n\n/** Pick the single retained source file this document was parsed from (if any). */\nfunction primarySource(doc: IRDocument): SourceFile | null {\n for (const sf of doc.sources.values()) {\n if (typeof sf.text === 'string' && sf.text.length > 0) return sf;\n }\n return null;\n}\n\n/** Collect every node reachable from the root of the (mutated) tree. */\nfunction collectKept(doc: IRDocument): IRNode[] {\n const out: IRNode[] = [];\n const seen = new Set<IRNodeId>();\n const visit = (id: IRNodeId): void => {\n if (seen.has(id)) return;\n seen.add(id);\n const n = doc.nodes.get(id);\n if (!n) return;\n out.push(n);\n if (n.kind === 'element' || n.kind === 'fragment') for (const c of n.children) visit(c);\n };\n visit(doc.root);\n return out;\n}\n\n/** Span `a` strictly contains span `b` (same file, b nested inside, not identical). */\nfunction strictlyContains(a: SourceSpan, b: SourceSpan): boolean {\n if (a.file !== b.file) return false;\n if (a.start <= b.start && b.end <= a.end) return !(a.start === b.start && a.end === b.end);\n return false;\n}\n\ninterface RemovedRegion {\n readonly backref: Backref;\n /** A surviving node nested inside this region ⇒ this was an UNWRAP (keep inner, drop tags). */\n readonly unwrapped: boolean;\n}\n\n/**\n * Apply the class-list diff for a single surviving element. Returns true if an edit was made.\n */\nfunction editClasses(ms: MagicString, doc: IRDocument, sf: SourceFile, el: IRElement): boolean {\n const classes = el.classes;\n // Wholly dynamic / opaque class lists are never rewritten by the passes — leave verbatim.\n if (classes.hasDynamic || classes.opaque) return false;\n\n const tokens = staticTokensOf(classes);\n const valueSpan = classes.valueSpan;\n\n if (valueSpan && valueSpan.file === sf.id) {\n const current = sf.text.slice(valueSpan.start, valueSpan.end);\n // Preserve the original quote style; default to double quotes when we can't detect one.\n const quote = current.startsWith(\"'\") ? \"'\" : '\"';\n const next = `${quote}${tokens.join(' ')}${quote}`;\n if (current !== next) {\n ms.overwrite(valueSpan.start, valueSpan.end, next);\n return true;\n }\n return false;\n }\n\n // No class attribute originally, but the passes added classes ⇒ insert one on the opening tag.\n if (tokens.length === 0) return false;\n if (el.isComponent) return false; // never synthesize className onto an opaque component\n const back = doc.backref.get(el.id);\n const openTag = back?.openTagSpan;\n if (!openTag || openTag.file !== sf.id) return false;\n // Insert immediately after the tag name: `<tag‸ …`.\n const insertAt = openTag.start + 1 + el.tag.length;\n ms.appendLeft(insertAt, ` className=\"${tokens.join(' ')}\"`);\n return true;\n}\n\n/** Surgical full-module codegen. Returns null when the document has no retained source. */\nfunction surgicalPrint(doc: IRDocument): string | null {\n const sf = primarySource(doc);\n if (!sf) return null;\n\n const ms = new MagicString(sf.text);\n\n const kept = collectKept(doc);\n const keptSpans: SourceSpan[] = [];\n for (const n of kept) if (n.span && n.span.file === sf.id) keptSpans.push(n.span);\n\n // 1) Structural removals. A node present in the backref table but absent from the live node map\n // was removed by the passes. Classify each as an UNWRAP (a surviving node nests inside it) or\n // a FULL removal (nothing survived inside).\n const removed: RemovedRegion[] = [];\n for (const id of backrefIds(doc)) {\n if (doc.nodes.has(id)) continue; // still live\n const back = doc.backref.get(id);\n if (!back || back.span.file !== sf.id) continue;\n const unwrapped = keptSpans.some((k) => strictlyContains(back.span, k));\n removed.push({ backref: back, unwrapped });\n }\n\n // Skip any removed region nested inside a FULL-removal region (its bytes are already deleted by\n // the ancestor) — this keeps every delete disjoint, which magic-string requires.\n const fullRemovals = removed.filter((r) => !r.unwrapped).map((r) => r.backref.span);\n for (const r of removed) {\n const span = r.backref.span;\n const coveredByFull = fullRemovals.some((f) => f !== span && strictlyContains(f, span));\n if (coveredByFull) continue;\n\n if (r.unwrapped) {\n // Delete only the wrapper's tags; keep its (surviving) inner content verbatim.\n const open = r.backref.openTagSpan;\n const close = r.backref.closeTagSpan;\n if (open && open.file === sf.id && open.end > open.start) ms.remove(open.start, open.end);\n if (close && close.file === sf.id && close.end > close.start) {\n ms.remove(close.start, close.end);\n }\n } else {\n ms.remove(span.start, span.end);\n }\n }\n\n // 2) Class-list diffs on every surviving element.\n for (const n of kept) {\n if (n.kind === 'element') editClasses(ms, doc, sf, n);\n }\n\n return ms.toString();\n}\n\n/** All ids the backref table knows about (every originally-parsed element / fragment). */\nfunction backrefIds(doc: IRDocument): IRNodeId[] {\n // The backref table is shared verbatim from parse time; collect ids by scanning original spans we\n // recorded for live + removed nodes. We don't have a public iterator, so reconstruct the universe\n // from the live nodes plus their (now-removed) original ancestry isn't possible directly — instead\n // ask the table for each id we can reach. The table exposes `get`; the set of candidate ids is the\n // contiguous allocation range [1, alloc.peek). Scanning that range is O(n) and dependency-free.\n const out: IRNodeId[] = [];\n const max = doc.alloc.peek as unknown as number;\n for (let i = 1; i < max; i += 1) {\n const id = i as IRNodeId;\n if (doc.backref.get(id)) out.push(id);\n }\n return out;\n}\n\n/* ───────────────────────── structural re-print (fallback) ───────────────────────── */\n\n/** Re-build the `className=…` attribute (or null when the element has no class list). */\nfunction classText(doc: IRDocument, classes: ClassList): string | null {\n if (classes.form === 'absent' || classes.segments.length === 0) return null;\n\n const dynamic = classes.segments.find((s) => s.kind === 'dynamic');\n if (dynamic && dynamic.kind === 'dynamic') {\n return `className={${exprText(doc, dynamic.expr).text}}`;\n }\n\n const tokens = staticTokensOf(classes);\n return `className=\"${tokens.join(' ')}\"`;\n}\n\nfunction attrText(doc: IRDocument, name: string, value: AttrValue): string {\n if (value.kind === 'static') {\n if (value.value === true) return name;\n if (value.value === false) return '';\n return `${name}=\"${String(value.value)}\"`;\n }\n return `${name}={${exprText(doc, value.expr).text}}`;\n}\n\nfunction printElement(doc: IRDocument, el: IRElement): string {\n const parts: string[] = [];\n\n const cls = classText(doc, el.classes);\n if (cls !== null) parts.push(cls);\n\n for (const name of el.attrs.order) {\n const v = el.attrs.entries.get(name);\n if (!v) continue;\n const text = attrText(doc, name, v);\n if (text.length > 0) parts.push(text);\n }\n\n for (const ref of el.attrs.spreads) parts.push(`{...${exprText(doc, ref).text}}`);\n\n const attrStr = parts.length > 0 ? ` ${parts.join(' ')}` : '';\n const tag = el.tag;\n\n if (el.children.length === 0) {\n return el.selfClosing ? `<${tag}${attrStr} />` : `<${tag}${attrStr}></${tag}>`;\n }\n\n const inner = el.children.map((c) => printNode(doc, c)).join('');\n return `<${tag}${attrStr}>${inner}</${tag}>`;\n}\n\nfunction printNode(doc: IRDocument, id: IRNodeId): string {\n const node = doc.nodes.get(id);\n if (!node) return '';\n switch (node.kind) {\n case 'text':\n return node.value;\n case 'comment':\n return `{/*${node.value}*/}`;\n case 'expr': {\n const { text, spread } = exprText(doc, node.expr);\n return spread ? `{...${text}}` : `{${text}}`;\n }\n case 'fragment':\n return `<>${node.children.map((c) => printNode(doc, c)).join('')}</>`;\n case 'element':\n return printElement(doc, node);\n }\n}\n\nfunction rePrint(doc: IRDocument): string {\n const root = doc.nodes.get(doc.root);\n if (!root || root.kind !== 'fragment') return printNode(doc, doc.root);\n return root.children.map((c) => printNode(doc, c)).join('');\n}\n\n/* ───────────────────────── public backend ───────────────────────── */\n\nfunction doPrint(doc: IRDocument): string {\n const surgical = surgicalPrint(doc);\n return surgical ?? rePrint(doc);\n}\n\nexport const jsxBackend: Backend = {\n name: 'babel-jsx',\n langs: JSX_LANGS,\n print(doc: IRDocument, _plan: EditPlan, _ctx: BackendContext): CodegenResult {\n const code = doPrint(doc);\n return { code, map: null, edits: [], diagnostics: [] };\n },\n};\n\n/** Factory mirror — returns a fresh handle to the (stateless) JSX backend. */\nexport function createJsxBackend(): Backend {\n return jsxBackend;\n}\n","/**\n * @domflax/resolver-tailwind — Tailwind-aware {@link StyleResolver}, backed by the REAL Tailwind\n * engine.\n *\n * ## Engine + approach\n *\n * This resolver is backed by **tailwindcss v3** (`resolveConfig` + the JIT context + `generateRules`),\n * NOT v4. The reason is the {@link StyleResolver} contract: `resolve()` is **synchronous**. Tailwind\n * v4's entire programmatic surface (`compile`, `compileAst`, `__unstable__loadDesignSystem`) returns\n * Promises and offers no synchronous design-system constructor, so backing a synchronous resolver\n * with v4 would require blocking-on-promise hacks. Tailwind v3's `createContext(resolveConfig(...))`\n * + `generateRules(candidates, ctx)` pipeline is fully synchronous — it is exactly the path that\n * tooling such as `prettier-plugin-tailwindcss` and the Tailwind IntelliSense engine use — so it\n * backs a synchronous resolver cleanly and is genuinely testable. The task explicitly permits this\n * fallback.\n *\n * ## Forward (`resolve`)\n *\n * `resolve(classes)` feeds each candidate class name to the real engine, reads back the generated\n * CSS rules, and converts them into a normalized, condition-keyed {@link StyleMap}:\n *\n * • a simple `.utility { … }` rule contributes to the unconditional `BASE_CONDITION` block,\n * • a `:hover` / `:focus` / … suffix becomes a `StyleCondition.states` entry,\n * • a `::before` / `::placeholder` / … suffix becomes a `StyleCondition.pseudoElement`,\n * • a wrapping `@media (…)` (responsive variants like `md:`) becomes `StyleCondition.media`.\n *\n * Every declaration is run through the SHARED {@link normalizer} from `@domflax/pattern-kit`, so\n * values are canonical and box shorthands (`p-4`, `gap-4`, `inset-0`, …) expand to longhands exactly\n * the way patterns + verify expect. BASE coverage is the must-have; variant conditions are produced\n * best-effort. Utilities whose selector uses a combinator / compound / attribute selector (e.g.\n * `space-x-4`, `divide-y`) cannot be folded onto the element's own box and are surfaced as\n * {@link OpaqueToken}s rather than contributing misleading declarations. Unknown / unresolvable\n * classes contribute nothing and are reported in `unknown` — `resolve` never throws.\n *\n * ## Reverse (`emit`)\n *\n * `emit(styleMap)` is best-effort reverse synthesis backed by a reverse index built from the engine's\n * own class list (`context.getClassList()`): each indexable utility is generated, its normalized BASE\n * declarations are recorded, and the index is greedily matched against the requested StyleMap\n * (largest declaration-sets first), consuming matched properties so each is mapped to at most one\n * utility. The index is built lazily on first `emit()` and cached.\n *\n * LIMITATION (v0.1.0): `emit` is intentionally less complete than `resolve`. It only matches against\n * the engine's enumerable named utilities and only their unconditional BASE declarations; variant\n * conditions (hover/responsive/pseudo-element) and arbitrary-value utilities are not reverse-synthesized,\n * and no synthetic class is produced for the residual (it is surfaced via `exact:false`). Anything\n * with no matching utility is simply left unmatched — `emit` never throws and never invents a class.\n */\n\nimport { createRequire } from 'node:module';\nimport * as path from 'node:path';\n\nimport type {\n CssProperty,\n EmitContext,\n EmitResult,\n OpaqueToken,\n ResolveInput,\n ResolveResult,\n SelectorUsage,\n StyleBlock,\n StyleCondition,\n StyleDecl,\n StyleMap,\n StyleOrigin,\n StyleResolver,\n SyntheticClass,\n} from '@domflax/core';\nimport { BASE_CONDITION, conditionKey, emptyStyleMap } from '@domflax/core';\nimport { normalizer } from '@domflax/pattern-kit';\n\n/* ───────────────────────── engine loading (synchronous v3 internals) ───────────────────────── */\n\n// The forward/reverse engine lives in tailwindcss' CommonJS internals. We load them through\n// `createRequire` (rather than `import`) so the exact same code path works whether this module is\n// bundled to ESM or CJS, and so the untyped internal subpaths don't need ambient declarations.\n//\n// CRITICAL (bundling): tailwindcss must be resolved from the CONSUMER'S project, NOT from the file\n// this module happens to live in. When `domflax` inlines this resolver into its own bundle\n// (`noExternal: [/^@domflax\\//]`), a require based on the bundle's location (`__filename`) would\n// look for `tailwindcss` next to `domflax/dist`, where it does not exist — so the engine silently\n// failed to load and `emit`'s reverse index came up empty. Instead we root the require in the user's\n// project (an explicit project root, then `process.cwd()`), exactly how prettier-plugin-tailwindcss\n// and the Tailwind IntelliSense engine locate a project's Tailwind. The bundle/source location is\n// kept only as a last-resort fallback (covers the non-bundled / in-repo dev case). The first base\n// from which `tailwindcss/package.json` resolves wins.\n\n/**\n * This module's own location, used as a last-resort require base. esbuild substitutes a real\n * `__filename` in a CJS bundle; in an ESM bundle `__filename` is undefined and we fall back to\n * `import.meta.url` (a `file://` URL, which `createRequire` accepts).\n */\nfunction moduleBase(): string {\n return typeof __filename === 'string' ? __filename : import.meta.url;\n}\n\n/**\n * Build a `require` rooted in the consumer's project so engine resolution is independent of where\n * this (possibly bundled) module physically lives. Returns `null` if `tailwindcss` resolves from no\n * candidate base.\n */\nfunction projectRequire(projectRoot?: string): NodeRequire | null {\n const bases: string[] = [];\n // A real file name is irrelevant — `createRequire` only uses the containing directory for\n // resolution; the file need not exist.\n if (projectRoot) bases.push(path.join(projectRoot, '__domflax__.js'));\n bases.push(path.join(process.cwd(), '__domflax__.js'));\n bases.push(moduleBase());\n for (const base of bases) {\n try {\n const candidate = createRequire(base);\n candidate.resolve('tailwindcss/package.json');\n return candidate;\n } catch {\n /* try the next base */\n }\n }\n return null;\n}\n\ninterface TwGeneratedDecl {\n readonly type: 'decl';\n readonly prop: string;\n readonly value: string;\n readonly important?: boolean;\n}\ninterface TwGeneratedRule {\n readonly type: 'rule';\n readonly selector: string;\n readonly nodes?: readonly TwNode[];\n}\ninterface TwGeneratedAtRule {\n readonly type: 'atrule';\n readonly name: string;\n readonly params: string;\n readonly nodes?: readonly TwNode[];\n}\ntype TwNode = TwGeneratedDecl | TwGeneratedRule | TwGeneratedAtRule | { readonly type: string };\n\ninterface TwContext {\n getClassList(): unknown[];\n}\n\ninterface TwEngine {\n readonly version: string;\n readonly context: TwContext;\n /** Generate the postcss rule nodes Tailwind emits for the given candidate class names. */\n generate(candidates: readonly string[]): TwNode[];\n}\n\n/** Build a synchronous Tailwind v3 engine for the given resolved config; returns `null` on failure. */\nfunction loadEngine(options: TailwindResolverConfig): TwEngine | null {\n const req = projectRequire(options.projectRoot);\n if (!req) return null;\n try {\n const resolveConfig = req('tailwindcss/resolveConfig.js') as (c: unknown) => unknown;\n const { createContext } = req('tailwindcss/lib/lib/setupContextUtils.js') as {\n createContext: (config: unknown) => TwContext;\n };\n const { generateRules } = req('tailwindcss/lib/lib/generateRules.js') as {\n generateRules: (candidates: Set<string>, context: TwContext) => Array<[number, TwNode]>;\n };\n const pkg = req('tailwindcss/package.json') as { version: string };\n\n let userConfig: unknown = options.config ?? { content: [{ raw: '' }] };\n if (options.configPath !== undefined) {\n const loadConfig = req('tailwindcss/loadConfig.js') as (p: string) => unknown;\n userConfig = loadConfig(options.configPath);\n }\n const resolved = resolveConfig(userConfig);\n const context = createContext(resolved);\n\n return {\n version: pkg.version,\n context,\n generate(candidates: readonly string[]): TwNode[] {\n const rules = generateRules(new Set(candidates), context);\n return rules.map(([, node]) => node);\n },\n };\n } catch {\n return null;\n }\n}\n\n/* ───────────────────────── configuration ───────────────────────── */\n\n/** Construction-time configuration for {@link createTailwindResolver}. */\nexport interface TailwindResolverConfig {\n /** Provider tag surfaced via {@link StyleResolver.provider}. Defaults to the engine version. */\n readonly provider?: string;\n /**\n * Cache-busting fingerprint. Defaults to a hash derived from the resolved Tailwind config (theme\n * etc.) combined with the provider tag, so it changes when the theme/config changes.\n */\n readonly fingerprint?: string;\n /**\n * A Tailwind (v3) config object, merged with the framework defaults via `resolveConfig`. Mutually\n * exclusive with {@link configPath} (path wins). Defaults to `{ content: [{ raw: '' }] }`.\n */\n readonly config?: Record<string, unknown>;\n /** Path to a project `tailwind.config.{js,cjs,mjs,ts}` file, loaded synchronously. */\n readonly configPath?: string;\n /**\n * Directory to resolve `tailwindcss` (and its v3 internals) from. Defaults to `process.cwd()`,\n * falling back to this module's location. Set this when the consumer's project root differs from\n * the working directory. Resolution is intentionally independent of where domflax's bundle lives.\n */\n readonly projectRoot?: string;\n}\n\n/* ───────────────────────── selector / condition parsing ───────────────────────── */\n\n/** Pseudo-elements that Tailwind may emit with a legacy single colon. */\nconst LEGACY_PSEUDO_ELEMENTS = new Set([\n ':before',\n ':after',\n ':first-line',\n ':first-letter',\n]);\n\ntype ParsedSelector =\n | { readonly kind: 'simple'; readonly states: readonly string[]; readonly pseudoElement: string }\n | { readonly kind: 'complex' };\n\n/**\n * Parse a generated selector into a {@link StyleCondition} fragment. Accepts ONLY a single class\n * selector optionally followed by pseudo-class / pseudo-element parts (`.x`, `.x:hover`,\n * `.x::before`, `.x:focus:hover`). Anything with a combinator, a second compound class, an attribute\n * selector, or a selector list is `complex` (⇒ opaque) because its declarations do not apply to the\n * element's own box.\n */\nfunction parseSelector(selector: string): ParsedSelector {\n const sel = selector.trim();\n if (sel.length === 0 || sel[0] !== '.') return { kind: 'complex' };\n\n // Consume the class identifier, honoring CSS backslash escapes (`\\:`, `\\/`, `\\[`, …).\n let i = 1;\n for (; i < sel.length; i += 1) {\n const c = sel[i]!;\n if (c === '\\\\') {\n i += 1; // skip the escaped char\n continue;\n }\n if (c === ':' || c === '.' || c === '[' || c === ' ' || c === '>' || c === '+' || c === '~' || c === ',') {\n break;\n }\n }\n\n const remainder = sel.slice(i);\n if (remainder.length === 0) {\n return { kind: 'simple', states: [], pseudoElement: '' };\n }\n // The remainder must be EXCLUSIVELY pseudo parts — no combinator / compound / attribute follows.\n if (!/^(?:::?[-a-z]+(?:\\([^()]*\\))?)+$/i.test(remainder)) {\n return { kind: 'complex' };\n }\n\n const parts = remainder.match(/::?[-a-z]+(?:\\([^()]*\\))?/gi) ?? [];\n const states: string[] = [];\n let pseudoElement = '';\n for (const part of parts) {\n if (part.startsWith('::') || LEGACY_PSEUDO_ELEMENTS.has(part)) {\n pseudoElement = part.startsWith('::') ? part : `:${part}`;\n } else {\n states.push(part);\n }\n }\n return { kind: 'simple', states, pseudoElement };\n}\n\nfunction makeCondition(media: string, states: readonly string[], pseudoElement: string): StyleCondition {\n return {\n media,\n states: [...new Set(states)].sort(),\n pseudoElement,\n };\n}\n\n/* ───────────────────────── rule extraction ───────────────────────── */\n\ninterface ExtractedBlock {\n readonly condition: StyleCondition;\n readonly decls: ReadonlyArray<readonly [string, string, boolean]>;\n}\n\ninterface ExtractedToken {\n /** Usable (BASE + supported-variant) blocks. */\n readonly blocks: readonly ExtractedBlock[];\n /** True if the engine emitted at least one rule for the token (even an opaque one). */\n readonly produced: boolean;\n /** Set when the token only resolves via combinator / unsupported at-rule selectors. */\n readonly opaque?: OpaqueToken;\n}\n\n/** Collect every leaf `rule` node together with the `@media` stack that wraps it. */\nfunction collectRules(\n node: TwNode,\n mediaStack: readonly string[],\n inUnsupportedAtRule: boolean,\n out: Array<{ rule: TwGeneratedRule; media: readonly string[]; unsupported: boolean }>,\n): void {\n if (node.type === 'rule') {\n out.push({ rule: node as TwGeneratedRule, media: mediaStack, unsupported: inUnsupportedAtRule });\n return;\n }\n if (node.type === 'atrule') {\n const at = node as TwGeneratedAtRule;\n const children = at.nodes ?? [];\n if (at.name === 'media') {\n const nextStack = at.params ? [...mediaStack, at.params] : mediaStack;\n for (const child of children) collectRules(child, nextStack, inUnsupportedAtRule, out);\n } else {\n // @supports / @container / etc. — recurse but flag as unsupported (⇒ opaque).\n for (const child of children) collectRules(child, mediaStack, true, out);\n }\n }\n}\n\n/** Extract usable blocks + opacity info for a single candidate token from its generated nodes. */\nfunction extractToken(token: string, nodes: readonly TwNode[]): ExtractedToken {\n if (nodes.length === 0) return { blocks: [], produced: false };\n\n const leaves: Array<{ rule: TwGeneratedRule; media: readonly string[]; unsupported: boolean }> = [];\n for (const node of nodes) collectRules(node, [], false, leaves);\n\n const blocks: ExtractedBlock[] = [];\n let sawComplex = false;\n\n for (const { rule, media, unsupported } of leaves) {\n const parsed = parseSelector(rule.selector);\n if (parsed.kind === 'complex' || unsupported) {\n sawComplex = true;\n continue;\n }\n const decls: Array<readonly [string, string, boolean]> = [];\n for (const child of rule.nodes ?? []) {\n if (child.type !== 'decl') continue; // skip @defaults markers, comments, nested rules\n const d = child as TwGeneratedDecl;\n if (typeof d.value !== 'string') continue;\n decls.push([d.prop, d.value, d.important === true]);\n }\n if (decls.length === 0) continue;\n const mediaQuery = media.join(' and ');\n blocks.push({ condition: makeCondition(mediaQuery, parsed.states, parsed.pseudoElement), decls });\n }\n\n const opaque: OpaqueToken | undefined =\n sawComplex && blocks.length === 0\n ? { token, reason: 'combinator-variant', detail: 'utility targets descendants/siblings, not its own box' }\n : undefined;\n\n return { blocks, produced: true, opaque };\n}\n\n/* ───────────────────────── StyleMap assembly ───────────────────────── */\n\nfunction buildStyleMap(\n blockMaps: Map<string, { condition: StyleCondition; decls: Map<CssProperty, StyleDecl> }>,\n): StyleMap {\n if (blockMaps.size === 0) return emptyStyleMap();\n const blocks = new Map<ReturnType<typeof conditionKey>, StyleBlock>();\n for (const { condition, decls } of blockMaps.values()) {\n if (decls.size === 0) continue;\n blocks.set(conditionKey(condition), { condition, decls });\n }\n if (blocks.size === 0) return emptyStyleMap();\n return normalizer.normalizeStyleMap({ blocks });\n}\n\n/**\n * The shadow chain a newly-winning declaration inherits when it overrides `prev` on the same\n * property: everything `prev` already shadowed, plus `prev`'s own origin (now shadowed too). Deduped\n * by class name and restricted to class origins (the only kind `dedupe-classes` acts on).\n */\nfunction shadowedBy(prev: StyleDecl): readonly StyleOrigin[] | undefined {\n const out: StyleOrigin[] = [];\n const seen = new Set<string>();\n const add = (o: StyleOrigin | undefined): void => {\n if (!o || o.kind !== 'class' || seen.has(o.className)) return;\n seen.add(o.className);\n out.push(o);\n };\n for (const o of prev.shadowed ?? []) add(o);\n add(prev.origin);\n return out.length > 0 ? out : undefined;\n}\n\n/* ───────────────────────── conservative selector usage ───────────────────────── */\n\n/**\n * A conservative, never-droppable {@link SelectorUsage}. Until a real project selector graph exists\n * we must assume a class could be referenced in any unsafe position, so nothing is safe to rewrite.\n */\nconst OPAQUE_USAGE: SelectorUsage = {\n asSubject: true,\n asAncestor: true,\n asCompound: true,\n asSibling: true,\n asHasArgument: true,\n asStructural: true,\n droppable: false,\n};\n\n/**\n * A plain-subject {@link SelectorUsage}: the class is a resolver-owned, base-only utility whose\n * whole effect is reproducible from `computed`, so it is safe to drop/replace during reverse-emit.\n */\nconst DROPPABLE_USAGE: SelectorUsage = {\n asSubject: true,\n asAncestor: false,\n asCompound: false,\n asSibling: false,\n asHasArgument: false,\n asStructural: false,\n droppable: true,\n};\n\n/* ───────────────────────── fingerprint ───────────────────────── */\n\n/** Tiny, dependency-free FNV-1a string hash (hex). Used to derive the cache-busting fingerprint. */\nfunction fnv1a(input: string): string {\n let h = 0x811c9dc5;\n for (let i = 0; i < input.length; i += 1) {\n h ^= input.charCodeAt(i);\n h = Math.imul(h, 0x01000193);\n }\n return (h >>> 0).toString(16).padStart(8, '0');\n}\n\n/* ───────────────────────── the resolver ───────────────────────── */\n\nclass TailwindResolver implements StyleResolver {\n readonly id = 'tailwind';\n readonly provider: string;\n readonly fingerprint: string;\n\n readonly #engine: TwEngine | null;\n /** Per-token extraction cache (engine output is pure for a fixed config). */\n readonly #tokenCache = new Map<string, ExtractedToken>();\n /** Per-class-set forward-resolution cache. */\n readonly #resolveCache = new Map<string, ResolveResult>();\n /** Lazily built reverse index for {@link emit}. */\n #reverseIndex: ReadonlyArray<readonly [string, ReadonlyMap<CssProperty, string>]> | null = null;\n\n constructor(config: TailwindResolverConfig = {}) {\n this.#engine = loadEngine(config);\n this.provider =\n config.provider ?? (this.#engine ? `tailwindcss@${this.#engine.version}` : 'tailwindcss');\n const seed = JSON.stringify(config.config ?? {}) + (config.configPath ?? '');\n this.fingerprint = config.fingerprint ?? `${this.provider}/${fnv1a(seed)}`;\n }\n\n /** Engine-backed, cached single-token extraction. */\n #extract(token: string): ExtractedToken {\n const cached = this.#tokenCache.get(token);\n if (cached) return cached;\n let result: ExtractedToken;\n if (!this.#engine) {\n result = { blocks: [], produced: false };\n } else {\n try {\n result = extractToken(token, this.#engine.generate([token]));\n } catch {\n result = { blocks: [], produced: false };\n }\n }\n this.#tokenCache.set(token, result);\n return result;\n }\n\n owns(token: string): boolean {\n if (token.length === 0) return false;\n return this.#extract(token).produced;\n }\n\n resolve(input: ResolveInput): ResolveResult {\n const key = JSON.stringify(input.classes);\n const cached = this.#resolveCache.get(key);\n if (cached) return cached;\n\n // condition-key → { condition, longhand decls }. Iterating classes in source order means later\n // utilities overwrite earlier ones on the same property (equal-specificity cascade).\n const blockMaps = new Map<\n string,\n { condition: StyleCondition; decls: Map<CssProperty, StyleDecl> }\n >();\n const resolved: string[] = [];\n const unknown: string[] = [];\n const opaque: OpaqueToken[] = [];\n\n input.classes.forEach((token, tokenIndex) => {\n const extracted = this.#extract(token);\n if (!extracted.produced) {\n unknown.push(token);\n return;\n }\n if (extracted.opaque) opaque.push(extracted.opaque);\n if (extracted.blocks.length === 0) return; // produced only opaque rules\n\n const origin: StyleOrigin = { kind: 'class', tokenIndex, className: token };\n let contributed = false;\n for (const block of extracted.blocks) {\n const ck = conditionKey(block.condition);\n let bucket = blockMaps.get(ck);\n if (!bucket) {\n bucket = { condition: block.condition, decls: new Map() };\n blockMaps.set(ck, bucket);\n }\n for (const [prop, value, important] of block.decls) {\n for (const decl of normalizer.normalizeDeclaration(prop, value, important)) {\n // Record provenance: a LATER token on the same property shadows the earlier one. The\n // overridden origin (plus anything it already shadowed) is carried in `shadowed`, which\n // is exactly what the `dedupe-classes` pattern reads to find fully-overridden tokens.\n // This only enriches decl metadata — the resolved VALUES are unchanged.\n const prev = bucket.decls.get(decl.property);\n const shadowed = prev ? shadowedBy(prev) : undefined;\n bucket.decls.set(decl.property, shadowed ? { ...decl, origin, shadowed } : { ...decl, origin });\n contributed = true;\n }\n }\n }\n if (contributed) resolved.push(token);\n });\n\n const result: ResolveResult = {\n styles: buildStyleMap(blockMaps),\n resolved,\n unknown,\n opaque,\n warnings: [],\n };\n this.#resolveCache.set(key, result);\n return result;\n }\n\n /**\n * Lazily build the reverse index from the engine's own enumerable class list. Each indexable\n * utility maps to its NORMALIZED BASE longhand declarations (property → canonical value). Utilities\n * with variant conditions, combinator selectors, or no BASE declarations are skipped. Sorted by\n * declaration count (desc) so greedier (shorthand-like) utilities are tried first.\n */\n #buildReverseIndex(): ReadonlyArray<readonly [string, ReadonlyMap<CssProperty, string>]> {\n if (this.#reverseIndex) return this.#reverseIndex;\n const index: Array<readonly [string, Map<CssProperty, string>]> = [];\n if (this.#engine) {\n try {\n const classes = this.#engine.context\n .getClassList()\n .filter((c): c is string => typeof c === 'string');\n const nodes = this.#engine.generate(classes);\n // Re-extract per class would be costly; instead group decls by their (single) class selector.\n for (const node of nodes) {\n if (node.type !== 'rule') continue; // skip @media / @keyframes wrappers (⇒ variants only)\n const rule = node as TwGeneratedRule;\n const parsed = parseSelector(rule.selector);\n if (parsed.kind !== 'simple' || parsed.states.length > 0 || parsed.pseudoElement !== '') {\n continue; // BASE-only\n }\n const className = unescapeClass(rule.selector);\n if (className === null) continue;\n const decls = new Map<CssProperty, string>();\n for (const child of rule.nodes ?? []) {\n if (child.type !== 'decl') continue;\n const d = child as TwGeneratedDecl;\n if (typeof d.value !== 'string') continue;\n for (const decl of normalizer.normalizeDeclaration(d.prop, d.value, d.important === true)) {\n decls.set(decl.property, String(decl.value));\n }\n }\n if (decls.size > 0) index.push([className, decls]);\n }\n } catch {\n /* leave index empty on failure — emit degrades to a no-op */\n }\n }\n index.sort((a, b) => b[1].size - a[1].size || (a[0] < b[0] ? -1 : a[0] > b[0] ? 1 : 0));\n this.#reverseIndex = index;\n return index;\n }\n\n emit(styles: StyleMap, ctx: EmitContext): EmitResult {\n const norm = ctx.normalizer ?? normalizer;\n const normalized = norm.normalizeStyleMap(styles);\n const base = normalized.blocks.get(conditionKey(BASE_CONDITION));\n if (!base || base.decls.size === 0) return { classes: [], exact: true, warnings: [] };\n\n // Only the BASE block is reverse-synthesized (see module LIMITATION). Any non-base condition\n // present in the target means we cannot be exact.\n const hasNonBase = normalized.blocks.size > 1;\n\n // The target longhand map. The IR's compress passes hand us SHORTHAND properties (`padding`,\n // `margin`, `inset`, `inset-block`, `inset-inline`, `size`); we expand them to the same longhand\n // basis the reverse index is keyed on, so a single shorthand utility (`p-4`, `size-4`, `inset-0`)\n // can cover them.\n const target = new Map<CssProperty, string>();\n for (const [prop, decl] of base.decls) {\n for (const [lp, lv] of expandForEmit(norm, String(prop), String(decl.value), decl.important)) {\n target.set(lp, lv);\n }\n }\n\n // Keep only utilities every one of whose declarations matches the target (an exact-fit subset);\n // emitting a utility that sets an unwanted property/value would change the computed style.\n const candidates: Array<readonly [string, ReadonlyMap<CssProperty, string>]> = [];\n for (const entry of this.#buildReverseIndex()) {\n const [, declMap] = entry;\n if (declMap.size === 0 || declMap.size > target.size) continue;\n let fits = true;\n for (const [prop, value] of declMap) {\n if (target.get(prop) !== value) {\n fits = false;\n break;\n }\n }\n if (fits) candidates.push(entry);\n }\n\n // Greedy set-cover: repeatedly take the candidate covering the MOST still-needed declarations,\n // so a shorthand (`p-4`, 4 decls) beats `px-4`+`py-4`. Ties break toward the tighter decl-set\n // then lexicographically, for deterministic output.\n const remaining = new Map(target);\n const classes: string[] = [];\n while (remaining.size > 0) {\n let best: readonly [string, ReadonlyMap<CssProperty, string>] | null = null;\n let bestCover = 0;\n for (const entry of candidates) {\n const [token, declMap] = entry;\n let cover = 0;\n for (const prop of declMap.keys()) if (remaining.has(prop)) cover += 1;\n if (cover === 0) continue;\n const better =\n best === null ||\n cover > bestCover ||\n (cover === bestCover && declMap.size < best[1].size) ||\n (cover === bestCover && declMap.size === best[1].size && token < best[0]);\n if (better) {\n best = entry;\n bestCover = cover;\n }\n }\n if (!best) break; // nothing covers any still-needed declaration → residual\n classes.push(best[0]);\n for (const prop of best[1].keys()) remaining.delete(prop);\n }\n\n const exact = remaining.size === 0 && !hasNonBase;\n if (remaining.size === 0) return { classes, exact, warnings: [] };\n\n // Surface what no utility could cover as a residual synthetic (never thrown, never invented).\n const residual = synthesizeResidual(remaining, ctx);\n return residual\n ? { classes, residual, exact, warnings: [] }\n : { classes, exact, warnings: [] };\n }\n\n selectorUsage(token: string): SelectorUsage {\n // No project selector graph yet, so we cannot know how a CUSTOM (non-Tailwind) class is\n // referenced — treat it as load-bearing (preserved verbatim). A resolver-OWNED utility, by\n // contrast, is safe to drop/replace iff its whole effect is reproducible from `computed`: it\n // must be a plain (non-opaque) utility contributing ONLY base-condition declarations. Opaque\n // (combinator/at-rule) and variant-bound utilities are kept, because `emit` cannot rebuild them.\n const ex = this.#extract(token);\n if (!ex.produced || ex.opaque) return OPAQUE_USAGE;\n const baseOnly =\n ex.blocks.length > 0 &&\n ex.blocks.every((b) => conditionKey(b.condition) === conditionKey(BASE_CONDITION));\n if (!baseOnly) return OPAQUE_USAGE;\n return DROPPABLE_USAGE;\n }\n}\n\n/* ───────────────────────── emit-side shorthand expansion ───────────────────────── */\n\n/**\n * Expand a single computed declaration into the canonical LONGHAND `[property, value]` pairs the\n * reverse index is keyed on. The shared normalizer already expands the physical box shorthands\n * (`padding`/`margin`/`inset`/`border-*`); we additionally expand the few logical shorthands the\n * compress passes synthesize that the normalizer leaves intact (`size`, `inset-block`,\n * `inset-inline`). Values are re-canonicalized via the normalizer so they match the index exactly.\n */\nfunction expandForEmit(\n norm: { normalizeDeclaration: typeof normalizer.normalizeDeclaration },\n prop: string,\n value: string,\n important: boolean,\n): Array<readonly [CssProperty, string]> {\n const pairsFor = (p: string, v: string): Array<readonly [CssProperty, string]> =>\n norm.normalizeDeclaration(p, v, important).map((d) => [d.property, String(d.value)] as const);\n\n if (prop === 'size') {\n return [...pairsFor('width', value), ...pairsFor('height', value)];\n }\n if (prop === 'inset-block' || prop === 'inset-inline') {\n const parts = value.split(/\\s+/).filter((s) => s.length > 0);\n const a = parts[0] ?? value;\n const b = parts[1] ?? a;\n const sides = prop === 'inset-block' ? (['top', 'bottom'] as const) : (['left', 'right'] as const);\n return [...pairsFor(sides[0], a), ...pairsFor(sides[1], b)];\n }\n return pairsFor(prop, value);\n}\n\n/** Build a residual {@link SyntheticClass} for declarations no utility covered; `null` on failure. */\nfunction synthesizeResidual(\n remaining: ReadonlyMap<CssProperty, string>,\n ctx: EmitContext,\n): SyntheticClass | undefined {\n if (remaining.size === 0) return undefined;\n const norm = ctx.normalizer ?? normalizer;\n const decls = new Map<CssProperty, StyleDecl>();\n for (const [prop, value] of remaining) {\n for (const decl of norm.normalizeDeclaration(String(prop), value, false)) {\n decls.set(decl.property, decl);\n }\n }\n const block: StyleBlock = { condition: BASE_CONDITION, decls };\n const styleMap: StyleMap = { blocks: new Map([[conditionKey(BASE_CONDITION), block]]) };\n const css = [...remaining].map(([p, v]) => `${p}:${v}`).join(';');\n const className = `df-${fnv1a(css)}`;\n const synthetic: SyntheticClass = { className, decls: styleMap, css: `.${className}{${css}}` };\n try {\n ctx.sink.register(synthetic);\n } catch {\n /* a sink that rejects registration must not break emit */\n }\n return synthetic;\n}\n\n/** Recover a class name from a simple `.escaped-class` selector, or `null` if it isn't simple. */\nfunction unescapeClass(selector: string): string | null {\n const sel = selector.trim();\n if (sel[0] !== '.') return null;\n let out = '';\n for (let i = 1; i < sel.length; i += 1) {\n const c = sel[i]!;\n if (c === '\\\\') {\n i += 1;\n if (i < sel.length) out += sel[i];\n continue;\n }\n if (c === ':' || c === '.' || c === '[' || c === ' ' || c === '>' || c === '+' || c === '~' || c === ',') {\n return null; // not a bare single-class selector\n }\n out += c;\n }\n return out.length > 0 ? out : null;\n}\n\n/** Factory: build a Tailwind-backed {@link StyleResolver}. */\nexport function createTailwindResolver(config?: TailwindResolverConfig): StyleResolver {\n return new TailwindResolver(config);\n}\n","/**\n * @domflax/resolver-css — a {@link StyleResolver} backed by the project's own CSS files.\n *\n * Role: parse user-authored stylesheets with postcss, index every selector + declaration block, and\n * answer the resolver contract for plain `class=\"…\"` tokens:\n *\n * • `resolve(classes)` — FORWARD. Union the declarations of every rule whose selector is a simple\n * `.class` selector (optionally qualified by state pseudo-classes / a pseudo-element / wrapped in\n * an `@media`, which become {@link StyleCondition}s) into a normalized, condition-keyed\n * {@link StyleMap}. The shared {@link normalizer} expands shorthands and canonicalizes values so\n * resolver + patterns + verify agree byte-for-byte. Equal-specificity single-class rules cascade\n * by SOURCE order (later wins); BASE is the unconditional must-have block.\n * • `emit(styles)` — REVERSE. Best-effort map a {@link StyleMap} back to the minimal set of existing\n * class names whose own declarations are all present in the target. If nothing matches it returns\n * no classes and `exact:false`; it never throws.\n * • `selectorUsage(token)` — how a class participates in project selectors (subject / ancestor /\n * sibling / compound / `:has()` argument / structural pseudo), driving compress safety. Backed by\n * postcss-selector-parser so combinator and structural-pseudo facts are accurate.\n * • {@link CustomCSSResolver.complexSelectors} — the list of COMPLEX selectors (anything with a\n * combinator or a structural pseudo). This feeds domflax's CSS-selector-safety guard.\n *\n * CSS is accepted as raw sources (id + text) and/or as file paths read synchronously from disk, so\n * the resolver is fully unit-testable without touching the filesystem. Malformed CSS never throws —\n * an unparseable stylesheet simply contributes nothing; only genuine input errors (e.g. an\n * unreadable file path) surface as thrown errors.\n */\n\nimport type {\n ConditionKey,\n CssProperty,\n EmitContext,\n EmitResult,\n ResolveInput,\n ResolveResult,\n SelectorUsage,\n StyleBlock,\n StyleCondition,\n StyleDecl,\n StyleMap,\n StyleOrigin,\n StyleResolver,\n} from '@domflax/core';\nimport { conditionKey, emptyStyleMap } from '@domflax/core';\nimport { normalizer } from '@domflax/pattern-kit';\nimport { readFileSync } from 'node:fs';\nimport { createRequire } from 'node:module';\nimport * as path from 'node:path';\nimport type { AtRule, Root as PostcssRoot, Rule } from 'postcss';\nimport type selectorParser from 'postcss-selector-parser';\n\n/* ────────────────────────────────────────────────────────────────────────── *\n * Lazy engine loading (postcss + postcss-selector-parser)\n * ────────────────────────────────────────────────────────────────────────── *\n *\n * postcss and postcss-selector-parser are OPTIONAL peers of the published `domflax` package: a\n * Tailwind-only user need not install them. They must therefore be loaded LAZILY (only when this\n * resolver is actually constructed) and from the CONSUMER'S project — never via a static top-level\n * `import`, which would (a) crash on module load for a postcss-less install and (b), once this\n * resolver is inlined into domflax's bundle, resolve relative to `domflax/dist` instead of the\n * user's project. We root the require in `process.cwd()` (or an explicit project root), exactly as\n * the Tailwind resolver does, with the bundle/source location as a last-resort fallback.\n */\n\n/** This module's own location — esbuild fills `__filename` in CJS; ESM falls back to `import.meta.url`. */\nfunction moduleBase(): string {\n return typeof __filename === 'string' ? __filename : import.meta.url;\n}\n\n/** The single postcss entry point this resolver calls at runtime. */\ntype PostcssParseApi = (css: string, opts?: { from?: string }) => PostcssRoot;\n\n/** The subset of the postcss-selector-parser API this resolver calls at runtime (guards preserve narrowing). */\ninterface SelectorParserApi {\n (): { astSync(selector: string): selectorParser.Root };\n isClassName(n: selectorParser.Node): n is selectorParser.ClassName;\n isTag(n: selectorParser.Node): n is selectorParser.Tag;\n isIdentifier(n: selectorParser.Node): n is selectorParser.Identifier;\n isAttribute(n: selectorParser.Node): n is selectorParser.Attribute;\n isUniversal(n: selectorParser.Node): n is selectorParser.Universal;\n isNesting(n: selectorParser.Node): n is selectorParser.Nesting;\n isPseudo(n: selectorParser.Node): n is selectorParser.Pseudo;\n isPseudoClass(n: selectorParser.Node): n is selectorParser.Pseudo;\n isPseudoElement(n: selectorParser.Node): n is selectorParser.Pseudo;\n isCombinator(n: selectorParser.Node): n is selectorParser.Combinator;\n}\n\ninterface PostcssEngine {\n readonly parse: PostcssParseApi;\n readonly selectorParser: SelectorParserApi;\n}\n\n/** Resolve postcss + postcss-selector-parser from the consumer's project; `null` if unavailable. */\nfunction loadPostcssEngine(projectRoot?: string): PostcssEngine | null {\n const bases: string[] = [];\n if (projectRoot) bases.push(path.join(projectRoot, '__domflax__.js'));\n bases.push(path.join(process.cwd(), '__domflax__.js'));\n bases.push(moduleBase());\n for (const base of bases) {\n try {\n const req = createRequire(base);\n req.resolve('postcss');\n req.resolve('postcss-selector-parser');\n const postcss = req('postcss') as { parse: PostcssParseApi };\n const raw = req('postcss-selector-parser') as SelectorParserApi & { default?: SelectorParserApi };\n // postcss-selector-parser is CJS with a default export under interop; accept both shapes.\n const selector = raw.default ?? raw;\n return { parse: postcss.parse, selectorParser: selector };\n } catch {\n /* try the next base */\n }\n }\n return null;\n}\n\n/* ────────────────────────────────────────────────────────────────────────── *\n * Public input shapes\n * ────────────────────────────────────────────────────────────────────────── */\n\n/** A single user-authored stylesheet handed to the resolver as raw text. */\nexport interface CssFile {\n /** Stable identifier (usually the absolute path) — also feeds the fingerprint. */\n readonly id: string;\n /** Verbatim stylesheet text. */\n readonly css: string;\n}\n\n/** Construction options for {@link CustomCSSResolver}. */\nexport interface CssResolverOptions {\n /** Overrides the auto-derived cache-busting fingerprint (e.g. a content hash from the caller). */\n readonly fingerprint?: string;\n /**\n * Additional stylesheet paths read synchronously from disk and appended to the raw `cssFiles`.\n * A path that cannot be read is a genuine input error and is rethrown with context.\n */\n readonly files?: readonly string[];\n /**\n * Directory to resolve `postcss` / `postcss-selector-parser` from. Defaults to `process.cwd()`,\n * falling back to this module's location. Resolution is independent of where domflax's bundle lives.\n */\n readonly projectRoot?: string;\n}\n\n/* ────────────────────────────────────────────────────────────────────────── *\n * Lazily-loaded postcss engine (module singleton)\n * ────────────────────────────────────────────────────────────────────────── */\n\n/** Runtime postcss `parse`, populated on first resolver construction. */\nlet pc: PostcssParseApi | null = null;\n/** Runtime postcss-selector-parser, populated on first resolver construction. */\nlet sp: SelectorParserApi | null = null;\n\n/** Ensure the postcss engine is loaded; throws a clear error if the optional peers are absent. */\nfunction ensurePostcss(projectRoot?: string): void {\n if (pc && sp) return;\n const engine = loadPostcssEngine(projectRoot);\n if (!engine) {\n throw new Error(\n '@domflax/resolver-css requires \"postcss\" and \"postcss-selector-parser\" to be installed in ' +\n 'your project (they are optional peer dependencies of domflax, loaded only when the custom-CSS ' +\n 'provider is used). Install them with: npm install postcss postcss-selector-parser',\n );\n }\n pc = engine.parse;\n sp = engine.selectorParser;\n}\n\n/** Stable resolver id surfaced on {@link StyleResolver.id}. */\nexport const CSS_RESOLVER_ID = 'css';\n\n/** Provider tag surfaced on {@link StyleResolver.provider}. */\nexport const CSS_RESOLVER_PROVIDER = 'custom-css';\n\n/** Version stamp for the index/cascade machinery; bump when its semantics change (cache-busting). */\nconst ENGINE_VERSION = 'css-index@1';\n\n/** Structural pseudo-classes — their presence makes a class structurally targeted (review-1 blocker). */\nconst STRUCTURAL_PSEUDOS: ReadonlySet<string> = new Set([\n ':nth-child',\n ':nth-last-child',\n ':first-child',\n ':last-child',\n ':only-child',\n ':nth-of-type',\n ':nth-last-of-type',\n ':first-of-type',\n ':last-of-type',\n ':only-of-type',\n]);\n\n/** Functional pseudos whose argument is itself a selector list — opaque to forward resolution. */\nconst FUNCTIONAL_PSEUDOS: ReadonlySet<string> = new Set([\n ':not',\n ':is',\n ':where',\n ':has',\n ':matches',\n]);\n\n/** Legacy single-colon pseudo-ELEMENTS that the parser may not flag via `isPseudoElement`. */\nconst LEGACY_PSEUDO_ELEMENTS: ReadonlySet<string> = new Set([\n ':before',\n ':after',\n ':first-line',\n ':first-letter',\n]);\n\n/* ────────────────────────────────────────────────────────────────────────── *\n * Internal index shapes\n * ────────────────────────────────────────────────────────────────────────── */\n\ntype RawDecl = readonly [property: string, value: string, important: boolean];\n\n/** One simple-`.class` rule's contribution, tagged with its document position for cascade ordering. */\ninterface RuleEntry {\n readonly order: number;\n readonly token: string;\n readonly condition: StyleCondition;\n readonly decls: readonly RawDecl[];\n}\n\ninterface MutableUsage {\n referenced: boolean;\n asSubject: boolean;\n asAncestor: boolean;\n asCompound: boolean;\n asSibling: boolean;\n asHasArgument: boolean;\n asStructural: boolean;\n /** Appears anywhere other than as the lone subject of a bare `.x {}` selector. */\n loadBearing: boolean;\n}\n\ninterface ReverseEntry {\n readonly token: string;\n /** `${conditionKey}\u0000${property}` → canonical value, over this class's own resolution. */\n readonly keyed: ReadonlyMap<string, string>;\n}\n\n/* ────────────────────────────────────────────────────────────────────────── *\n * CustomCSSResolver\n * ────────────────────────────────────────────────────────────────────────── */\n\n/**\n * Resolves plain CSS classes against a fixed set of project stylesheets parsed with postcss.\n */\nexport class CustomCSSResolver implements StyleResolver {\n public readonly id: string = CSS_RESOLVER_ID;\n public readonly provider: string = CSS_RESOLVER_PROVIDER;\n public readonly fingerprint: string;\n\n readonly #files: readonly CssFile[];\n /** Forward map: class token → simple-`.class` rule contributions (source order). */\n readonly #classIndex = new Map<string, RuleEntry[]>();\n /** Selector-participation facts per class token. */\n readonly #usage = new Map<string, MutableUsage>();\n /** Every class referenced anywhere in the stylesheets (forward-resolvable or not). */\n readonly #known = new Set<string>();\n /** Distinct COMPLEX selectors (combinator or structural pseudo), sorted. */\n readonly #complex: readonly string[];\n\n #reverse: readonly ReverseEntry[] | null = null;\n\n public constructor(cssFiles: readonly CssFile[] = [], options: CssResolverOptions = {}) {\n ensurePostcss(options.projectRoot);\n const fromDisk = (options.files ?? []).map(readCssPath);\n this.#files = [...cssFiles, ...fromDisk];\n this.fingerprint = options.fingerprint ?? deriveFingerprint(this.provider, this.#files);\n\n const complex = new Set<string>();\n let order = 0;\n for (const file of this.#files) {\n order = this.#indexFile(file, order, complex);\n }\n this.#complex = [...complex].sort();\n }\n\n /** The stylesheets this resolver was constructed with (raw sources + any read from disk). */\n public get files(): readonly CssFile[] {\n return this.#files;\n }\n\n /** Owns any plain class token referenced by one of {@link files}. */\n public owns(token: string): boolean {\n return isPlainClassToken(token) && this.#known.has(token);\n }\n\n public resolve(input: ResolveInput): ResolveResult {\n const styles = this.#resolveTokens(input.classes, input.classes);\n const resolved: string[] = [];\n const unknown: string[] = [];\n for (const token of input.classes) {\n if (this.#classIndex.has(token)) resolved.push(token);\n else unknown.push(token);\n }\n return { styles, resolved, unknown, opaque: [], warnings: [] };\n }\n\n public emit(styles: StyleMap, ctx: EmitContext): EmitResult {\n const norm = ctx.normalizer ?? normalizer;\n const remaining = new Map<string, string>();\n for (const [ck, block] of norm.normalizeStyleMap(styles).blocks) {\n for (const [prop, decl] of block.decls) {\n remaining.set(`${ck}\u0000${prop}`, String(decl.value));\n }\n }\n if (remaining.size === 0) return { classes: [], exact: true, warnings: [] };\n\n const classes: string[] = [];\n // Greedy set-cover: larger classes first so the emitted set stays minimal.\n for (const { token, keyed } of this.#reverseIndex()) {\n let matches = true;\n for (const [key, value] of keyed) {\n if (remaining.get(key) !== value) {\n matches = false;\n break;\n }\n }\n if (!matches) continue;\n classes.push(token);\n for (const key of keyed.keys()) remaining.delete(key);\n if (remaining.size === 0) break;\n }\n\n // Unmatched declarations are left as-is (no synthetic residual) — surfaced via `exact:false`.\n return { classes, exact: remaining.size === 0, warnings: [] };\n }\n\n public selectorUsage(token: string): SelectorUsage {\n const u = this.#usage.get(token);\n if (!u) {\n return {\n asSubject: false,\n asAncestor: false,\n asCompound: false,\n asSibling: false,\n asHasArgument: false,\n asStructural: false,\n droppable: true,\n };\n }\n return {\n asSubject: u.asSubject,\n asAncestor: u.asAncestor,\n asCompound: u.asCompound,\n asSibling: u.asSibling,\n asHasArgument: u.asHasArgument,\n asStructural: u.asStructural,\n // Safe to drop/rename only when every reference is the lone subject of a bare `.x {}`.\n droppable: u.referenced && !u.loadBearing,\n };\n }\n\n /**\n * The distinct COMPLEX selectors found across all stylesheets — anything containing a combinator\n * (descendant / `>` / `+` / `~`) or a structural pseudo (`:nth-child`, `:first-child`, …). Feeds\n * domflax's CSS-selector-safety guard.\n */\n public complexSelectors(): readonly string[] {\n return this.#complex;\n }\n\n /* ─────────────────────────── internals ─────────────────────────── */\n\n /** Parse one stylesheet and fold its rules into the indexes. Returns the advanced order counter. */\n #indexFile(file: CssFile, startOrder: number, complex: Set<string>): number {\n let order = startOrder;\n let root;\n try {\n root = pc!(file.css, { from: file.id });\n } catch {\n // Malformed CSS contributes nothing (never throws — only clear input errors do).\n return order;\n }\n\n root.walkRules((rule) => {\n const media = mediaContext(rule);\n if (media.skip) return; // inside @keyframes / @font-face etc. — not class rules\n const decls = collectDecls(rule);\n\n let ast;\n try {\n ast = sp!().astSync(rule.selector);\n } catch {\n return;\n }\n\n for (const sel of ast.nodes) {\n const thisOrder = order;\n this.#analyzeSelector(sel as selectorParser.Selector, media.media, decls, thisOrder, complex);\n }\n order += 1;\n });\n\n return order;\n }\n\n /** Analyze one comma-segment selector: forward indexing, usage facts, complex detection. */\n #analyzeSelector(\n selector: selectorParser.Selector,\n media: string,\n decls: readonly RawDecl[],\n order: number,\n complex: Set<string>,\n ): void {\n const compounds = splitCompounds(selector);\n let hasCombinator = false;\n let hasStructural = false;\n\n compounds.forEach((compound, index) => {\n const isSubject = index === compounds.length - 1;\n const rightCombinator = index < compounds.length - 1 ? compounds[index + 1]!.leftCombinator : null;\n if (rightCombinator) hasCombinator = true;\n\n const classes = compound.nodes.filter((n) => sp!.isClassName(n));\n const otherSimple = compound.nodes.some(\n (n) =>\n sp!.isTag(n) ||\n sp!.isIdentifier(n) ||\n sp!.isAttribute(n) ||\n sp!.isUniversal(n) ||\n sp!.isNesting(n),\n );\n const pseudos = compound.nodes.filter((n) => sp!.isPseudo(n));\n const structuralPseudo = pseudos.some((p) => STRUCTURAL_PSEUDOS.has(pseudoName(p)));\n const functionalPseudo = pseudos.some((p) => FUNCTIONAL_PSEUDOS.has(pseudoName(p)));\n const statePseudos = pseudos.filter(\n (p) =>\n sp!.isPseudoClass(p) &&\n !STRUCTURAL_PSEUDOS.has(pseudoName(p)) &&\n !FUNCTIONAL_PSEUDOS.has(pseudoName(p)),\n );\n const elementPseudos = pseudos.filter((p) => isPseudoElement(p));\n const qualified = classes.length > 1 || otherSimple || functionalPseudo || statePseudos.length > 0;\n\n if (structuralPseudo) hasStructural = true;\n\n for (const cls of classes) {\n const token = cls.value;\n this.#known.add(token);\n const u = this.#getUsage(token);\n u.referenced = true;\n if (isSubject) u.asSubject = true;\n if (rightCombinator === ' ' || rightCombinator === '>') u.asAncestor = true;\n if (rightCombinator === '+' || rightCombinator === '~') u.asSibling = true;\n if (qualified) u.asCompound = true;\n if (structuralPseudo) u.asStructural = true;\n if (rightCombinator !== null || qualified || structuralPseudo || elementPseudos.length > 0) {\n u.loadBearing = true;\n }\n\n // Forward indexing: a single bare `.class` compound, optionally qualified by state\n // pseudo-classes and/or a pseudo-element, with NO other simple selector and NO\n // structural/functional pseudo and NO combinator on this compound's right edge.\n const forwardEligible =\n compounds.length === 1 &&\n classes.length === 1 &&\n !otherSimple &&\n !structuralPseudo &&\n !functionalPseudo &&\n elementPseudos.length <= 1;\n if (forwardEligible && decls.length > 0) {\n const condition: StyleCondition = {\n media,\n states: statePseudos.map(pseudoName).sort(),\n pseudoElement: elementPseudos.length === 1 ? normalizePseudoElement(elementPseudos[0]!) : '',\n };\n this.#addRuleEntry(token, { order, token, condition, decls });\n }\n }\n\n // Classes nested inside selector-argument pseudos (:has/:is/:where/:not) are references too.\n for (const p of pseudos) {\n const isHas = pseudoName(p) === ':has';\n p.walkClasses((inner) => {\n const token = inner.value;\n this.#known.add(token);\n const u = this.#getUsage(token);\n u.referenced = true;\n u.loadBearing = true;\n if (isHas) u.asHasArgument = true;\n });\n }\n });\n\n if (hasCombinator || hasStructural) {\n complex.add(selector.toString().trim());\n }\n }\n\n #addRuleEntry(token: string, entry: RuleEntry): void {\n const list = this.#classIndex.get(token);\n if (list) list.push(entry);\n else this.#classIndex.set(token, [entry]);\n }\n\n #getUsage(token: string): MutableUsage {\n let u = this.#usage.get(token);\n if (!u) {\n u = {\n referenced: false,\n asSubject: false,\n asAncestor: false,\n asCompound: false,\n asSibling: false,\n asHasArgument: false,\n asStructural: false,\n loadBearing: false,\n };\n this.#usage.set(token, u);\n }\n return u;\n }\n\n /**\n * Resolve a set of tokens into a normalized condition-keyed StyleMap. `tokenList` is the original\n * class list (for per-declaration `tokenIndex` provenance); `request` is the set being resolved.\n */\n #resolveTokens(request: readonly string[], tokenList: readonly string[]): StyleMap {\n const entries: RuleEntry[] = [];\n for (const token of new Set(request)) {\n const list = this.#classIndex.get(token);\n if (list) entries.push(...list);\n }\n if (entries.length === 0) return emptyStyleMap();\n\n // Equal-specificity single-class rules cascade by source order — later wins.\n entries.sort((a, b) => a.order - b.order);\n\n const acc = new Map<ConditionKey, { condition: StyleCondition; decls: Map<CssProperty, StyleDecl> }>();\n for (const entry of entries) {\n const key = conditionKey(entry.condition);\n let block = acc.get(key);\n if (!block) {\n block = { condition: entry.condition, decls: new Map() };\n acc.set(key, block);\n }\n const tokenIndex = tokenList.indexOf(entry.token);\n const origin: StyleOrigin = { kind: 'class', tokenIndex, className: entry.token };\n for (const [prop, value, important] of entry.decls) {\n for (const decl of normalizer.normalizeDeclaration(prop, value, important)) {\n block.decls.set(decl.property, { ...decl, origin });\n }\n }\n }\n\n const rawBlocks = new Map<ConditionKey, StyleBlock>();\n for (const [key, block] of acc) {\n if (block.decls.size === 0) continue;\n rawBlocks.set(key, { condition: block.condition, decls: block.decls });\n }\n if (rawBlocks.size === 0) return emptyStyleMap();\n return normalizer.normalizeStyleMap({ blocks: rawBlocks });\n }\n\n /** Build (once) the reverse index used by {@link emit}. */\n #reverseIndex(): readonly ReverseEntry[] {\n if (this.#reverse) return this.#reverse;\n const out: ReverseEntry[] = [];\n for (const token of this.#classIndex.keys()) {\n const styles = this.#resolveTokens([token], [token]);\n const keyed = new Map<string, string>();\n for (const [ck, block] of styles.blocks) {\n for (const [prop, decl] of block.decls) keyed.set(`${ck}\u0000${prop}`, String(decl.value));\n }\n if (keyed.size > 0) out.push({ token, keyed });\n }\n // Larger declaration sets first → greedy minimal cover in `emit`.\n out.sort((a, b) => b.keyed.size - a.keyed.size);\n this.#reverse = out;\n return out;\n }\n}\n\n/* ────────────────────────────────────────────────────────────────────────── *\n * Factory\n * ────────────────────────────────────────────────────────────────────────── */\n\n/**\n * Construct a {@link CustomCSSResolver} from raw CSS sources and/or file paths.\n *\n * @param cssFiles raw stylesheets (`{ id, css }`) — pass `[]` when loading only from disk.\n * @param options optional disk paths (`files`) and/or an explicit `fingerprint`.\n */\nexport function createCssResolver(\n cssFiles: readonly CssFile[] = [],\n options?: CssResolverOptions,\n): StyleResolver {\n return new CustomCSSResolver(cssFiles, options);\n}\n\n/* ────────────────────────────────────────────────────────────────────────── *\n * Selector helpers\n * ────────────────────────────────────────────────────────────────────────── */\n\ninterface Compound {\n /** The combinator immediately to this compound's LEFT (`null` for the first compound). */\n readonly leftCombinator: string | null;\n readonly nodes: readonly selectorParser.Node[];\n}\n\n/** Split a selector's flat node list into compounds delimited by combinator nodes. */\nfunction splitCompounds(selector: selectorParser.Selector): Compound[] {\n const compounds: Compound[] = [];\n let current: selectorParser.Node[] = [];\n let leftCombinator: string | null = null;\n for (const node of selector.nodes) {\n if (sp!.isCombinator(node)) {\n compounds.push({ leftCombinator, nodes: current });\n current = [];\n leftCombinator = combinatorValue(node);\n } else {\n current.push(node);\n }\n }\n compounds.push({ leftCombinator, nodes: current });\n return compounds;\n}\n\n/** A combinator's normalized value — descendant combinators are a single space. */\nfunction combinatorValue(node: selectorParser.Combinator): string {\n const v = node.value;\n return v.trim() === '' ? ' ' : v.trim();\n}\n\n/** The pseudo's lower-cased name including its leading colon(s), without any argument. */\nfunction pseudoName(node: selectorParser.Pseudo): string {\n return node.value.toLowerCase();\n}\n\nfunction isPseudoElement(node: selectorParser.Pseudo): boolean {\n return sp!.isPseudoElement(node) || LEGACY_PSEUDO_ELEMENTS.has(pseudoName(node));\n}\n\n/** Canonicalize a pseudo-element to the modern double-colon form (e.g. `:before` → `::before`). */\nfunction normalizePseudoElement(node: selectorParser.Pseudo): string {\n const name = pseudoName(node);\n return name.startsWith('::') ? name : `::${name.replace(/^:/, '')}`;\n}\n\n/* ────────────────────────────────────────────────────────────────────────── *\n * postcss helpers\n * ────────────────────────────────────────────────────────────────────────── */\n\ninterface MediaContext {\n readonly media: string;\n /** True when the rule lives under an at-rule that is not a style context (keyframes/font-face). */\n readonly skip: boolean;\n}\n\n/** Walk a rule's at-rule ancestry, collecting `@media` params and detecting non-style contexts. */\nfunction mediaContext(rule: Rule): MediaContext {\n const parts: string[] = [];\n let skip = false;\n let parent = rule.parent;\n while (parent && parent.type === 'atrule') {\n const at = parent as AtRule;\n const name = at.name.toLowerCase();\n if (name === 'media') parts.unshift(at.params.trim().replace(/\\s+/g, ' '));\n else if (name === 'keyframes' || name.endsWith('keyframes') || name === 'font-face') skip = true;\n parent = parent.parent;\n }\n return { media: parts.join(' and '), skip };\n}\n\n/** A rule's direct declarations, in source order, as raw `[prop, value, important]` triples. */\nfunction collectDecls(rule: Rule): RawDecl[] {\n const out: RawDecl[] = [];\n for (const node of rule.nodes) {\n if (node.type === 'decl') out.push([node.prop, node.value, node.important === true]);\n }\n return out;\n}\n\n/* ────────────────────────────────────────────────────────────────────────── *\n * Misc helpers\n * ────────────────────────────────────────────────────────────────────────── */\n\n/** Cheap, allocation-free CSS-identifier check used by {@link CustomCSSResolver.owns}. */\nfunction isPlainClassToken(token: string): boolean {\n return token.length > 0 && !/[\\s.#>+~:[\\]()]/.test(token);\n}\n\n/** Read a CSS file from disk; surfaces unreadable paths as a clear input error. */\nfunction readCssPath(path: string): CssFile {\n try {\n return { id: path, css: readFileSync(path, 'utf8') };\n } catch (cause) {\n throw new Error(`resolver-css: cannot read CSS file \"${path}\"`, { cause });\n }\n}\n\n/**\n * Derive a deterministic fingerprint from the provider tag, engine version, and each file's id +\n * length. Cheap and good enough to bust downstream caches when the source CSS set changes.\n */\nfunction deriveFingerprint(provider: string, files: readonly CssFile[]): string {\n const parts = files.map((f) => `${f.id}:${f.css.length}`).sort();\n return `${provider}/${ENGINE_VERSION}::${parts.join('|')}`;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACKA,IAAM,mBAAmB,MACvB,OAAO,aAAa,cAChB,IAAI,IAAI,QAAQ,UAAU,EAAE,EAAE,OAC7B,SAAS,iBAAiB,SAAS,cAAc,QAAQ,YAAY,MAAM,WAC1E,SAAS,cAAc,MACvB,IAAI,IAAI,WAAW,SAAS,OAAO,EAAE;AAEtC,IAAM,gBAAgC,iCAAiB;;;ACgCvD,SAAS,kBAAkB,QAAQ,GAAgB;AACxD,MAAI,IAAI;AACR,SAAO;AAAA,IACL,OAAiB;AACf,YAAM,KAAK;AACX,WAAK;AACL,aAAO;AAAA,IACT;AAAA,IACA,IAAI,OAAiB;AACnB,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAGO,SAAS,mBAAmB,QAAQ,GAAiB;AAC1D,QAAM,MAAM,oBAAI,IAAyB;AACzC,MAAI,IAAI;AACR,SAAO;AAAA,IACL,IAAI,GAAoC;AACtC,aAAO,IAAI,IAAI,CAAC;AAAA,IAClB;AAAA,IACA,OAAO,KAAuC;AAC5C,YAAM,MAAM;AACZ,WAAK;AACL,UAAI,IAAI,KAAK,EAAE,GAAG,KAAK,IAAI,CAAC;AAC5B,aAAO;AAAA,IACT;AAAA,IACA,kBAAwB;AACtB,iBAAW,CAAC,GAAG,CAAC,KAAK,IAAK,KAAI,IAAI,GAAG,EAAE,GAAG,GAAG,SAAS,OAAU,CAAC;AAAA,IACnE;AAAA,EACF;AACF;AAOO,SAAS,qBAA0C;AACxD,QAAM,MAAM,oBAAI,IAAuB;AACvC,SAAO;AAAA,IACL,IAAI,IAAmC;AACrC,aAAO,IAAI,IAAI,EAAE;AAAA,IACnB;AAAA,IACA,KAAK,IAAiC;AACpC,aAAO,IAAI,IAAI,EAAE,GAAG,QAAQ;AAAA,IAC9B;AAAA,IACA,aAAa,IAAiC;AAC5C,aAAO,IAAI,IAAI,EAAE,GAAG,aAAa;AAAA,IACnC;AAAA,IACA,IAAI,IAAc,SAAwB;AACxC,UAAI,IAAI,IAAI,OAAO;AAAA,IACrB;AAAA,EACF;AACF;AAKO,SAAS,YAAY,cAA2B,GAAa;AAClE,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,kBAAkB;AAAA,IAClB,QAAQ;AAAA,IACR,gBAAgB;AAAA,IAChB,oBAAoB;AAAA,IACpB,aAAa;AAAA,IACb,kBAAkB;AAAA,IAClB,sBAAsB;AAAA,IACtB,4BAA4B;AAAA,IAC5B,oBAAoB;AAAA,IACpB,mBAAmB;AAAA,IACnB,gBAAgB;AAAA,IAChB,4BAA4B;AAAA,IAC5B,mBAAmB;AAAA,IACnB,8BAA8B;AAAA,IAC9B,0BAA0B;AAAA,IAC1B,qBAAqB;AAAA,IACrB,SAAS;AAAA,IACT,WAAW;AAAA,IACX;AAAA,EACF;AACF;AAGO,IAAM,iBAAiC,EAAE,OAAO,IAAI,QAAQ,CAAC,GAAG,eAAe,GAAG;AAGlF,SAAS,aAAa,GAAiC;AAC5D,QAAM,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG;AAC5C,SAAO,GAAG,EAAE,KAAK,IAAI,MAAM,IAAI,EAAE,aAAa;AAChD;AAEO,IAAM,qBAAmC,aAAa,cAAc;AAGpE,SAAS,gBAA0B;AACxC,SAAO,EAAE,QAAQ,oBAAI,IAA8B,EAAE;AACvD;AAGO,SAAS,iBAA4B;AAC1C,SAAO;AAAA,IACL,MAAM;AAAA,IACN,UAAU,CAAC;AAAA,IACX,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,QAAQ;AAAA,IACR,YAAY;AAAA,EACd;AACF;AAGO,SAAS,eAAwB;AACtC,SAAO,EAAE,SAAS,oBAAI,IAAI,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,EAAE;AACtD;AAGO,SAAS,mBAAgC;AAC9C,SAAO,EAAE,OAAO,oBAAI,IAAwB,GAA2B,SAAS,KAAK;AACvF;AAmBO,SAAS,cAAc,IAAc,MAA8B;AACxE,SAAO;AAAA,IACL;AAAA,IACA,MAAM;AAAA,IACN,QAAQ,KAAK,UAAU;AAAA,IACvB,MAAM,KAAK,QAAQ;AAAA,IACnB,MAAM,KAAK,QAAQ,YAAY;AAAA,IAC/B,KAAK,KAAK;AAAA,IACV,WAAW,KAAK,aAAa;AAAA,IAC7B,aAAa,KAAK,eAAe;AAAA,IACjC,aAAa,KAAK,eAAe;AAAA,IACjC,SAAS,KAAK,WAAW,eAAe;AAAA,IACxC,aAAa,KAAK,eAAe,iBAAiB;AAAA,IAClD,UAAU,KAAK,YAAY,cAAc;AAAA,IACzC,OAAO,KAAK,SAAS,aAAa;AAAA,IAClC,UAAU,KAAK,YAAY,CAAC;AAAA,EAC9B;AACF;AAEO,SAAS,WACd,IACA,OACA,MACQ;AACR,SAAO;AAAA,IACL;AAAA,IACA,MAAM;AAAA,IACN,QAAQ,MAAM,UAAU;AAAA,IACxB,MAAM,MAAM,QAAQ;AAAA,IACpB,MAAM,YAAY;AAAA,IAClB;AAAA,IACA,aAAa,MAAM,eAAe;AAAA,EACpC;AACF;AAEO,SAAS,WACd,IACA,MACA,MACQ;AACR,SAAO;AAAA,IACL;AAAA,IACA,MAAM;AAAA,IACN,QAAQ,MAAM,UAAU;AAAA,IACxB,MAAM,MAAM,QAAQ;AAAA,IACpB,MAAM,YAAY;AAAA,IAClB;AAAA,EACF;AACF;AAEO,SAAS,eACd,IACA,MACY;AACZ,SAAO;AAAA,IACL;AAAA,IACA,MAAM;AAAA,IACN,QAAQ,MAAM,UAAU;AAAA,IACxB,MAAM,MAAM,QAAQ;AAAA,IACpB,MAAM,YAAY;AAAA,IAClB,UAAU,MAAM,YAAY,CAAC;AAAA,EAC/B;AACF;AAEO,SAAS,cACd,IACA,OACA,MACW;AACX,SAAO;AAAA,IACL;AAAA,IACA,MAAM;AAAA,IACN,QAAQ,MAAM,UAAU;AAAA,IACxB,MAAM,MAAM,QAAQ;AAAA,IACpB,MAAM,YAAY;AAAA,IAClB;AAAA,EACF;AACF;AAGO,SAAS,eAAe,UAAoC;AACjE,QAAM,QAAQ,kBAAkB;AAChC,QAAM,SAAS,MAAM,KAAK;AAC1B,QAAM,OAAO,eAAe,MAAM;AAClC,QAAM,QAAQ,oBAAI,IAAsB,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC;AACxD,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA,OAAO,mBAAmB;AAAA,IAC1B,SAAS,oBAAI,IAAI;AAAA,IACjB,SAAS,mBAAmB;AAAA,IAC5B;AAAA,IACA;AAAA,EACF;AACF;AAKO,SAAS,SAAS,MAAmC;AAC1D,SAAO,KAAK,SAAS,aAAa,KAAK,SAAS,aAAa,KAAK,WAAW,CAAC;AAChF;AAGO,SAAS,QAAQ,KAAiB,IAAkC;AACzE,SAAO,IAAI,MAAM,IAAI,EAAE;AACzB;AAGO,SAAS,WAAW,KAAiB,IAAqC;AAC/E,QAAM,IAAI,IAAI,MAAM,IAAI,EAAE;AAC1B,SAAO,KAAK,EAAE,SAAS,YAAY,IAAI;AACzC;AAGO,SAAS,WAAW,KAA6B;AACtD,QAAM,MAAkB,CAAC;AACzB,QAAM,QAAQ,CAAC,OAAuB;AACpC,UAAM,IAAI,IAAI,MAAM,IAAI,EAAE;AAC1B,QAAI,CAAC,EAAG;AACR,QAAI,EAAE,SAAS,UAAW,KAAI,KAAK,EAAE;AACrC,eAAW,KAAK,SAAS,CAAC,EAAG,OAAM,CAAC;AAAA,EACtC;AACA,QAAM,IAAI,IAAI;AACd,SAAO;AACT;AASO,SAAS,KAAK,KAAiB,SAAwB;AAC5D,QAAM,QAAQ;AACd,MAAI,UAAU;AAEd,QAAM,QAAQ,CAAC,IAAc,UAAwB;AACnD,QAAI,QAAS;AACb,UAAM,OAAO,IAAI,MAAM,IAAI,EAAE;AAC7B,QAAI,CAAC,KAAM;AAEX,UAAM,MAAoB;AAAA,MACxB,KAAK;AAAA,MACL;AAAA,MACA,SAAwB;AACtB,eAAO,KAAK,UAAU,OAAO,OAAO,IAAI,MAAM,IAAI,KAAK,MAAM,KAAK;AAAA,MACpE;AAAA,IACF;AAEA,UAAM,UAAuB,QAAQ,QAAQ,QAAQ,MAAM,MAAM,GAAG,IAAI;AACxE,QAAI,YAAY,QAAQ;AACtB,gBAAU;AACV;AAAA,IACF;AACA,QAAI,YAAY,QAAQ;AACtB,iBAAW,SAAS,SAAS,IAAI,GAAG;AAClC,cAAM,OAAO,QAAQ,CAAC;AACtB,YAAI,QAAS;AAAA,MACf;AAAA,IACF;AAEA,UAAM,SAAsB,QAAQ,OAAO,QAAQ,KAAK,MAAM,GAAG,IAAI;AACrE,QAAI,WAAW,OAAQ,WAAU;AAAA,EACnC;AAEA,QAAM,IAAI,MAAM,CAAC;AACnB;;;AC9RA,SAAS,cAAc,IAAwB;AAC7C,QAAM,SAAS,oBAAI,IAA8B;AACjD,aAAW,CAAC,KAAK,KAAK,KAAK,GAAG,QAAQ;AACpC,WAAO,IAAI,KAAK;AAAA,MACd,WAAW,MAAM;AAAA,MACjB,OAAO,IAAI,IAA4B,MAAM,KAAK;AAAA,IACpD,CAAC;AAAA,EACH;AACA,SAAO,EAAE,OAAO;AAClB;AAEA,SAAS,UAAU,MAAsB;AACvC,QAAM,OAAO,EAAE,GAAG,KAAK,KAAK;AAC5B,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH;AAAA,QACA,UAAU,CAAC,GAAG,KAAK,QAAQ;AAAA,QAC3B,UAAU,cAAc,KAAK,QAAQ;AAAA,MACvC;AAAA,IACF,KAAK;AACH,aAAO,EAAE,GAAG,MAAM,MAAM,UAAU,CAAC,GAAG,KAAK,QAAQ,EAAE;AAAA,IACvD;AACE,aAAO,EAAE,GAAG,MAAM,KAAK;AAAA,EAC3B;AACF;AAGO,SAAS,cAAc,KAA6B;AACzD,QAAM,QAAQ,oBAAI,IAAsB;AACxC,aAAW,CAAC,IAAI,CAAC,KAAK,IAAI,MAAO,OAAM,IAAI,IAAI,UAAU,CAAC,CAAC;AAC3D,SAAO;AAAA,IACL,MAAM,IAAI;AAAA,IACV;AAAA,IACA,OAAO,IAAI;AAAA,IACX,SAAS,IAAI;AAAA,IACb,SAAS,IAAI;AAAA,IACb,UAAU,IAAI;AAAA,IACd,OAAO,IAAI;AAAA,EACb;AACF;AAIA,SAAS,KACP,MACA,SACA,OACY;AACZ,SAAO,EAAE,MAAM,UAAU,QAAQ,SAAS,GAAG,MAAM;AACrD;AAEA,SAAS,kBAAkB,KAAiB,IAAiC;AAC3E,QAAM,OAAO,IAAI,MAAM,IAAI,EAAE;AAC7B,MAAI,CAAC,QAAQ,KAAK,UAAU,KAAM,QAAO;AACzC,QAAM,SAAS,IAAI,MAAM,IAAI,KAAK,MAAM;AACxC,MAAI,CAAC,OAAQ,QAAO;AACpB,MAAI,OAAO,SAAS,aAAa,OAAO,SAAS,WAAY,QAAO,OAAO;AAC3E,SAAO;AACT;AAOA,SAAS,YAAY,OAAiB,IAAoB;AACxD,QAAM,IAAI,MAAM,IAAI,MAAM,IAAI,EAAE;AAChC,MAAI,GAAG;AACL,MAAE,KAAK,UAAU;AACjB,UAAM,QAAQ,IAAI,EAAE;AAAA,EACtB;AACF;AAEA,SAAS,cAAc,OAAiB,IAAoB;AAC1D,QAAM,OAAO,MAAM,IAAI,MAAM,IAAI,EAAE;AACnC,MAAI,CAAC,KAAM;AACX,MAAI,KAAK,SAAS,aAAa,KAAK,SAAS,YAAY;AACvD,eAAW,SAAS,CAAC,GAAG,KAAK,QAAQ,EAAG,eAAc,OAAO,KAAK;AAAA,EACpE;AACA,QAAM,IAAI,MAAM,OAAO,EAAE;AACzB,QAAM,QAAQ,IAAI,EAAE;AACtB;AAIA,SAAS,YAAY,KAAiE;AACpF,MAAI,CAAC,OAAO,IAAI,SAAS,EAAG,QAAO,EAAE,SAAS,oBAAI,IAAI,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,EAAE;AAChF,QAAM,UAAU,oBAAI,IAAuB;AAC3C,QAAM,QAAkB,CAAC;AACzB,aAAW,CAAC,GAAG,CAAC,KAAK,KAAK;AACxB,YAAQ,IAAI,GAAG,EAAE,MAAM,UAAU,OAAO,EAAE,CAAC;AAC3C,UAAM,KAAK,CAAC;AAAA,EACd;AACA,SAAO,EAAE,SAAS,SAAS,CAAC,GAAG,MAAM;AACvC;AAGA,SAAS,YAAY,OAAiB,MAAgB,QAAmC;AACvF,QAAM,EAAE,IAAI,IAAI;AAChB,MAAI,KAAK,SAAS,OAAO;AACvB,UAAM,WAAW,IAAI,MAAM,IAAI,KAAK,GAAG;AACvC,QAAI,SAAU,UAAS,SAAS;AAChC,WAAO,KAAK;AAAA,EACd;AAEA,QAAM,KAAK,IAAI,MAAM,KAAK;AAC1B,QAAM,QAAQ,IAAI,EAAE;AACpB,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK,WAAW;AACd,YAAMA,YAAuB,CAAC;AAC9B,YAAM,KAAK,cAAc,IAAI;AAAA,QAC3B,KAAK,KAAK;AAAA,QACV,WAAW,KAAK;AAAA,QAChB,aAAa,KAAK;AAAA,QAClB,OAAO,YAAY,KAAK,KAAK;AAAA,QAC7B;AAAA,QACA,MAAM,EAAE,GAAG,YAAY,GAAG,WAAW,KAAK;AAAA,MAC5C,CAAC;AACD,UAAI,KAAK,QAAS,IAAG,WAAW,cAAc,KAAK,OAAO;AAC1D,UAAI,MAAM,IAAI,IAAI,EAAE;AACpB,iBAAW,SAAS,KAAK,YAAY,CAAC,GAAG;AACvC,QAAAA,UAAS,KAAK,YAAY,OAAO,OAAO,EAAE,CAAC;AAAA,MAC7C;AACA,SAAG,WAAWA;AACd,aAAO;AAAA,IACT;AAAA,IACA,KAAK,QAAQ;AACX,YAAM,IAAI,WAAW,IAAI,KAAK,OAAO,EAAE,OAAO,CAAC;AAC/C,QAAE,KAAK,YAAY;AACnB,UAAI,MAAM,IAAI,IAAI,CAAC;AACnB,aAAO;AAAA,IACT;AAAA,IACA,KAAK,QAAQ;AACX,YAAM,IAAI,WAAW,IAAI,KAAK,MAAM,EAAE,OAAO,CAAC;AAC9C,QAAE,KAAK,YAAY;AACnB,UAAI,MAAM,IAAI,IAAI,CAAC;AACnB,aAAO;AAAA,IACT;AAAA,IACA,KAAK,WAAW;AACd,YAAM,IAAI,cAAc,IAAI,KAAK,OAAO,EAAE,OAAO,CAAC;AAClD,QAAE,KAAK,YAAY;AACnB,UAAI,MAAM,IAAI,IAAI,CAAC;AACnB,aAAO;AAAA,IACT;AAAA,IACA,KAAK,YAAY;AACf,YAAM,OAAO,eAAe,IAAI,EAAE,OAAO,CAAC;AAC1C,WAAK,KAAK,YAAY;AACtB,UAAI,MAAM,IAAI,IAAI,IAAI;AACtB,YAAMA,YAAuB,CAAC;AAC9B,iBAAW,SAAS,KAAK,SAAU,CAAAA,UAAS,KAAK,YAAY,OAAO,OAAO,EAAE,CAAC;AAC9E,WAAK,WAAWA;AAChB,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,kBAAkB,OAAiB,MAAmB,QAAmC;AAChG,SAAO,YAAY,OAAO,MAAM,MAAM;AACxC;AAIA,SAAS,YAAY,OAAiB,MAA0B;AAC9D,MAAI,KAAK,UAAW,QAAO;AAC3B,QAAM,QAAQ,MAAM,IAAI,YAAY;AACpC,MAAI,OAAO;AACT,QAAI;AACF,aAAO,MAAM,YAAY,KAAK,QAAQ;AAAA,IACxC,QAAQ;AACN,aAAO,KAAK;AAAA,IACd;AAAA,EACF;AACA,SAAO,KAAK;AACd;AAQA,SAAS,eACP,QACA,QACA,QACa;AAEb,QAAM,SAAS,IAAI,IAA8B,cAAc,MAAM,EAAE,MAAM;AAC7E,MAAI,WAAW;AAEf,aAAW,CAAC,KAAK,QAAQ,KAAK,OAAO,QAAQ;AAC3C,UAAM,WAAW,OAAO,IAAI,GAAG;AAC/B,QAAI,CAAC,UAAU;AACb,aAAO,IAAI,KAAK;AAAA,QACd,WAAW,SAAS;AAAA,QACpB,OAAO,IAAI,IAA4B,SAAS,KAAK;AAAA,MACvD,CAAC;AACD;AAAA,IACF;AACA,UAAM,QAAQ,IAAI,IAA4B,SAAS,KAAK;AAC5D,eAAW,CAAC,MAAM,OAAO,KAAK,SAAS,OAAO;AAC5C,YAAM,MAAM,MAAM,IAAI,IAAI;AAC1B,UAAI,OAAO,IAAI,UAAU,QAAQ,OAAO;AACtC,mBAAW;AACX,YAAI,WAAW,cAAe;AAAA,MAEhC;AACA,UAAI,WAAW,iBAAiB,IAAK;AACrC,YAAM,IAAI,MAAM,OAAO;AAAA,IACzB;AACA,WAAO,IAAI,KAAK,EAAE,WAAW,SAAS,WAAW,MAAM,CAAC;AAAA,EAC1D;AACA,SAAO,EAAE,KAAK,EAAE,OAAO,GAAG,SAAS;AACrC;AAIA,SAAS,SAAS,OAAiB,IAAe,UAAuC;AACvF,QAAM,WAAW,GAAG,OAAO;AAC3B,MAAI,WAAW,MAAM,SAAS;AAC5B,WAAO;AAAA,MACL;AAAA,MACA,OAAO,GAAG,EAAE,YAAY,QAAQ,oBAAoB,MAAM,OAAO;AAAA,MACjE,EAAE,QAAQ,UAAU,SAAS,GAAG,OAAO,SAAS,UAAU,QAAQ;AAAA,IACpE;AAAA,EACF;AACA,QAAM,OAAO,MAAM,IAAI,MAAM,IAAI,QAAQ;AACzC,MAAI,QAAQ,WAAW,KAAK,KAAK,aAAa;AAC5C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,GAAG,EAAE,YAAY,QAAQ,iBAAiB,QAAQ,UAAU,KAAK,KAAK,WAAW;AAAA,MACxF,EAAE,QAAQ,UAAU,SAAS,GAAG,OAAO,SAAS,UAAU,QAAQ;AAAA,IACpE;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,SAAS,OAAiB,IAA6B;AAC9D,QAAM,EAAE,IAAI,IAAI;AAEhB,QAAM,UAAU,cAAc,EAAE;AAChC,MAAI,WAAW,MAAM;AACnB,QAAI,CAAC,IAAI,MAAM,IAAI,OAAO,GAAG;AAC3B,aAAO;AAAA,QACL,KAAK,6BAA6B,eAAe,OAAO,cAAc;AAAA,UACpE,QAAQ;AAAA,UACR,SAAS,GAAG,OAAO;AAAA,UACnB,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,IACF;AACA,UAAM,SAAS,SAAS,OAAO,IAAI,OAAO;AAC1C,QAAI,OAAQ,QAAO,CAAC,MAAM;AAAA,EAC5B;AAEA,UAAQ,GAAG,IAAI;AAAA,IACb,KAAK,cAAc;AACjB,YAAM,WAAW,kBAAkB,KAAK,GAAG,MAAM;AACjD,UAAI,UAAU;AACZ,cAAM,IAAI,SAAS,QAAQ,GAAG,MAAM;AACpC,YAAI,KAAK,EAAG,UAAS,OAAO,GAAG,CAAC;AAAA,MAClC;AACA,oBAAc,OAAO,GAAG,MAAM;AAC9B,aAAO,CAAC;AAAA,IACV;AAAA,IAEA,KAAK,UAAU;AACb,YAAM,OAAO,IAAI,MAAM,IAAI,GAAG,MAAM;AACpC,UAAI,CAAC,QAAS,KAAK,SAAS,aAAa,KAAK,SAAS,YAAa;AAClE,eAAO,CAAC,QAAQ,IAAI,GAAG,QAAQ,kCAAkC,CAAC;AAAA,MACpE;AACA,YAAM,WAAW,kBAAkB,KAAK,GAAG,MAAM;AACjD,UAAI,CAAC,SAAU,QAAO,CAAC,QAAQ,IAAI,GAAG,QAAQ,6BAA6B,CAAC;AAC5E,YAAM,KAAK,SAAS,QAAQ,GAAG,MAAM;AACrC,YAAM,OAAO,KAAK;AAClB,iBAAW,KAAK,MAAM;AACpB,cAAM,KAAK,IAAI,MAAM,IAAI,CAAC;AAC1B,YAAI,GAAI,IAAG,SAAS,KAAK;AAAA,MAC3B;AACA,eAAS,OAAO,IAAI,GAAG,GAAG,IAAI;AAC9B,UAAI,MAAM,OAAO,GAAG,MAAM;AAC1B,YAAM,QAAQ,IAAI,GAAG,MAAM;AAC3B,UAAI,KAAK,UAAU,KAAM,aAAY,OAAO,KAAK,MAAM;AACvD,aAAO,CAAC;AAAA,IACV;AAAA,IAEA,KAAK,eAAe;AAClB,YAAM,WAAW,kBAAkB,KAAK,GAAG,MAAM;AACjD,UAAI,CAAC,SAAU,QAAO,CAAC,QAAQ,IAAI,GAAG,QAAQ,kCAAkC,CAAC;AACjF,YAAM,KAAK,SAAS,QAAQ,GAAG,MAAM;AACrC,YAAM,WAAW,IAAI,MAAM,IAAI,GAAG,MAAM,GAAG,UAAU;AACrD,YAAM,QAAQ,YAAY,OAAO,GAAG,aAAa,QAAQ;AACzD,eAAS,OAAO,IAAI,GAAG,KAAK;AAC5B,oBAAc,OAAO,GAAG,MAAM;AAC9B,UAAI,YAAY,KAAM,aAAY,OAAO,QAAQ;AACjD,aAAO,CAAC;AAAA,IACV;AAAA,IAEA,KAAK,QAAQ;AACX,YAAM,WAAW,kBAAkB,KAAK,GAAG,MAAM;AACjD,UAAI,CAAC,SAAU,QAAO,CAAC,QAAQ,IAAI,GAAG,QAAQ,2BAA2B,CAAC;AAC1E,YAAM,KAAK,SAAS,QAAQ,GAAG,MAAM;AACrC,YAAM,WAAW,IAAI,MAAM,IAAI,GAAG,MAAM,GAAG,UAAU;AACrD,YAAM,YAAY,kBAAkB,OAAO,GAAG,SAAS,QAAQ;AAC/D,YAAM,UAAU,IAAI,MAAM,IAAI,SAAS;AACvC,YAAM,aAAa,IAAI,MAAM,IAAI,GAAG,MAAM;AAC1C,UAAI,YAAY,QAAQ,SAAS,aAAa,QAAQ,SAAS,aAAa;AAC1E,gBAAQ,SAAS,KAAK,GAAG,MAAM;AAAA,MACjC;AACA,UAAI,WAAY,YAAW,SAAS;AACpC,eAAS,OAAO,IAAI,GAAG,SAAS;AAChC,aAAO,CAAC;AAAA,IACV;AAAA,IAEA,KAAK;AAAA,IACL,KAAK,eAAe;AAClB,YAAM,WAAW,kBAAkB,KAAK,GAAG,MAAM;AACjD,UAAI,CAAC,SAAU,QAAO,CAAC,QAAQ,IAAI,GAAG,QAAQ,6BAA6B,CAAC;AAC5E,YAAM,KAAK,SAAS,QAAQ,GAAG,MAAM;AACrC,YAAM,WAAW,IAAI,MAAM,IAAI,GAAG,MAAM,GAAG,UAAU;AACrD,YAAM,QAAQ,YAAY,OAAO,GAAG,MAAM,QAAQ;AAClD,eAAS,OAAO,GAAG,OAAO,iBAAiB,KAAK,KAAK,GAAG,GAAG,KAAK;AAChE,UAAI,YAAY,KAAM,aAAY,OAAO,QAAQ;AACjD,aAAO,CAAC;AAAA,IACV;AAAA,IAEA,KAAK,YAAY;AACf,YAAM,YAAY,IAAI,MAAM,IAAI,GAAG,SAAS;AAC5C,UAAI,CAAC,aAAc,UAAU,SAAS,aAAa,UAAU,SAAS,YAAa;AACjF,eAAO,CAAC,QAAQ,IAAI,GAAG,WAAW,uCAAuC,CAAC;AAAA,MAC5E;AACA,YAAM,WAAW,kBAAkB,KAAK,GAAG,MAAM;AACjD,UAAI,UAAU;AACZ,cAAM,IAAI,SAAS,QAAQ,GAAG,MAAM;AACpC,YAAI,KAAK,EAAG,UAAS,OAAO,GAAG,CAAC;AAAA,MAClC;AACA,YAAM,SAAS,IAAI,MAAM,IAAI,GAAG,MAAM;AACtC,UAAI,OAAQ,QAAO,SAAS,GAAG;AAC/B,YAAM,MAAM,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,OAAO,UAAU,SAAS,MAAM,CAAC;AACrE,gBAAU,SAAS,OAAO,KAAK,GAAG,GAAG,MAAM;AAC3C,kBAAY,OAAO,GAAG,SAAS;AAC/B,aAAO,CAAC;AAAA,IACV;AAAA,IAEA,KAAK,iBAAiB;AACpB,YAAM,QAAQ,IAAI,MAAM,IAAI,GAAG,KAAK;AACpC,YAAM,SAAS,IAAI,MAAM,IAAI,GAAG,MAAM;AACtC,UAAI,CAAC,SAAS,CAAC,OAAQ,QAAO,CAAC,QAAQ,IAAI,GAAG,OAAO,4BAA4B,CAAC;AAClF,WACG,MAAM,SAAS,aAAa,MAAM,SAAS,gBAC3C,OAAO,SAAS,aAAa,OAAO,SAAS,aAC9C;AACA,mBAAW,KAAK,OAAO,UAAU;AAC/B,gBAAM,KAAK,IAAI,MAAM,IAAI,CAAC;AAC1B,cAAI,GAAI,IAAG,SAAS,GAAG;AACvB,gBAAM,SAAS,KAAK,CAAC;AAAA,QACvB;AACA,eAAO,WAAW,CAAC;AAAA,MACrB;AACA,YAAM,WAAW,kBAAkB,KAAK,GAAG,MAAM;AACjD,UAAI,UAAU;AACZ,cAAM,IAAI,SAAS,QAAQ,GAAG,MAAM;AACpC,YAAI,KAAK,EAAG,UAAS,OAAO,GAAG,CAAC;AAAA,MAClC;AACA,UAAI,MAAM,OAAO,GAAG,MAAM;AAC1B,YAAM,QAAQ,IAAI,GAAG,MAAM;AAC3B,kBAAY,OAAO,GAAG,KAAK;AAC3B,aAAO,CAAC;AAAA,IACV;AAAA,IAEA,KAAK,gBAAgB;AACnB,YAAM,KAAK,IAAI,MAAM,IAAI,GAAG,MAAM;AAClC,UAAI,CAAC,MAAM,GAAG,SAAS,WAAW;AAChC,eAAO,CAAC,QAAQ,IAAI,GAAG,QAAQ,uCAAuC,CAAC;AAAA,MACzE;AACA,SAAG,WAAW,cAAc,GAAG,KAAK;AACpC,kBAAY,OAAO,GAAG,MAAM;AAC5B,aAAO,CAAC;AAAA,IACV;AAAA,IAEA,KAAK,cAAc;AACjB,YAAM,KAAK,IAAI,MAAM,IAAI,GAAG,MAAM;AAClC,UAAI,CAAC,MAAM,GAAG,SAAS,WAAW;AAChC,eAAO,CAAC,QAAQ,IAAI,GAAG,QAAQ,qCAAqC,CAAC;AAAA,MACvE;AACA,YAAM,SAAS,eAAe,GAAG,UAAU,GAAG,OAAO,GAAG,UAAU;AAClE,UAAI,OAAO,YAAY,GAAG,eAAe,SAAS;AAChD,eAAO;AAAA,UACL,KAAK,gCAAgC,qCAAqC,GAAG,MAAM,IAAI;AAAA,YACrF,QAAQ,GAAG;AAAA,YACX,SAAS,GAAG,OAAO;AAAA,YACnB,UAAU;AAAA,UACZ,CAAC;AAAA,QACH;AAAA,MACF;AACA,SAAG,WAAW,OAAO;AACrB,UAAI,GAAG,UAAU,MAAM;AACrB,cAAM,MAAM,IAAI,MAAM,IAAI,GAAG,MAAM;AACnC,YAAI,IAAK,aAAY,OAAO,GAAG,MAAM;AAAA,MACvC;AACA,kBAAY,OAAO,GAAG,MAAM;AAC5B,aAAO,CAAC;AAAA,IACV;AAAA,IAEA,KAAK;AACH,aAAO,UAAU,OAAO,EAAE;AAAA,EAC9B;AACF;AAEA,SAAS,UACP,OACA,IACc;AACd,QAAM,EAAE,IAAI,IAAI;AAChB,QAAM,OAAO,IAAI,MAAM,IAAI,GAAG,IAAI;AAClC,MAAI,CAAC,QAAQ,KAAK,SAAS,WAAW;AACpC,WAAO,CAAC,QAAQ,IAAI,GAAG,MAAM,+BAA+B,CAAC;AAAA,EAC/D;AACA,QAAM,SAAuB,CAAC;AAC9B,QAAM,YACJ,GAAG,eAAe,kBAAkB,OAAO,IAAI,IAAI,GAAG,UAAU;AAElE,QAAM,gBACJ,GAAG,eAAe,QACd,CAAC,GAAG,KAAK,SAAS,OAAO,KAAK,CAAC,IAC/B,CAAC,kBAAkB;AAEzB,aAAW,UAAU,GAAG,MAAM;AAC5B,UAAM,OAAO,IAAI,MAAM,IAAI,MAAM;AACjC,QAAI,CAAC,QAAQ,KAAK,SAAS,WAAW;AACpC,aAAO,KAAK,QAAQ,IAAI,QAAQ,+BAA+B,CAAC;AAChE;AAAA,IACF;AAEA,UAAM,aAAa,IAAI,IAA8B,cAAc,KAAK,QAAQ,EAAE,MAAM;AACxF,QAAI,SAAS;AAEb,eAAW,OAAO,eAAe;AAC/B,YAAM,WAAW,KAAK,SAAS,OAAO,IAAI,GAAG;AAC7C,UAAI,CAAC,SAAU;AACf,YAAM,WAAW,WAAW,IAAI,GAAG;AACnC,YAAM,QAAQ,WACV,IAAI,IAA4B,SAAS,KAAK,IAC9C,oBAAI,IAA4B;AAEpC,iBAAW,CAAC,MAAM,IAAI,KAAK,SAAS,OAAO;AACzC,YAAI,aAAa,CAAC,UAAU,IAAI,IAAI,EAAG;AACvC,YAAI,CAAC,YAAY,OAAO,IAAI,EAAG;AAC/B,YAAI,KAAK,kBAAkB;AACzB,iBAAO;AAAA,YACL;AAAA,cACE;AAAA,cACA,8CAA8C,KAAK,QAAQ,UAAU,MAAM;AAAA,cAC3E,EAAE,QAAQ,QAAQ,SAAS,GAAG,OAAO,SAAS,UAAU,OAAO;AAAA,YACjE;AAAA,UACF;AACA;AAAA,QACF;AACA,YAAI,CAAC,MAAM,IAAI,IAAI,GAAG;AACpB,gBAAM,IAAI,MAAM,IAAI;AACpB,mBAAS;AAAA,QACX;AAAA,MACF;AACA,iBAAW,IAAI,KAAK,EAAE,WAAW,SAAS,WAAW,MAAM,CAAC;AAAA,IAC9D;AAEA,QAAI,QAAQ;AACV,WAAK,WAAW,EAAE,QAAQ,WAAW;AACrC,kBAAY,OAAO,MAAM;AAAA,IAC3B;AAAA,EACF;AAEA,aAAW,KAAK,OAAQ,OAAM,YAAY,KAAK,CAAC;AAChD,SAAO,CAAC;AACV;AAEA,SAAS,QAAQ,IAAe,QAAkB,SAA6B;AAC7E,SAAO,KAAK,6BAA6B,SAAS;AAAA,IAChD;AAAA,IACA,SAAS,GAAG,OAAO;AAAA,IACnB,UAAU;AAAA,EACZ,CAAC;AACH;AAEA,SAAS,cAAc,IAAgC;AACrD,UAAQ,GAAG,IAAI;AAAA,IACb,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,GAAG;AAAA,IACZ,KAAK;AAAA,IACL,KAAK;AACH,aAAO,GAAG;AAAA,IACZ,KAAK;AACH,aAAO,GAAG;AAAA,IACZ,KAAK;AACH,aAAO,GAAG;AAAA,EACd;AACF;AASO,SAAS,SACd,KACA,KACA,KACc;AACd,QAAM,SAAS,cAAc,GAAG;AAChC,QAAM,QAAkB;AAAA,IACtB,KAAK;AAAA,IACL,SAAS,oBAAI,IAAI;AAAA,IACjB,SAAS,oBAAI,IAAI;AAAA,IACjB,SAAS,oBAAI,IAAI;AAAA,IACjB,aAAa,CAAC;AAAA,IACd,SAAS,CAAC;AAAA,IACV,eAAe;AAAA,IACf,SAAS,KAAK,iBAAiB;AAAA,IAC/B,KAAK,EAAE,KAAK,QAAQ,eAAe,KAAK,iBAAiB,GAAG,GAAG,IAAI;AAAA,EACrE;AAEA,aAAW,MAAM,KAAK;AACpB,UAAM,SAAS,SAAS,OAAO,EAAE;AACjC,QAAI,OAAO,SAAS,GAAG;AACrB,YAAM,QAAQ,KAAK;AAAA,QACjB,OAAO,EAAE,SAAS,GAAG,OAAO,SAAS,QAAQ,cAAc,EAAE,KAAK,IAAI,MAAM,KAAK,CAAC,EAAE,EAAE;AAAA,QACtF,QAAQ,OAAO,IAAI,CAAC,OAAO,EAAE,IAAI,MAAM,EAAE,MAAM,SAAS,EAAE,QAAQ,EAAE;AAAA,MACtE,CAAC;AACD,iBAAW,KAAK,OAAQ,OAAM,YAAY,KAAK,CAAC;AAAA,IAClD,OAAO;AACL,YAAM,iBAAiB;AAAA,IACzB;AAAA,EACF;AAEA,SAAO,EAAE,KAAK,QAAQ,QAAQ,SAAS,KAAK,EAAE;AAChD;AAMO,SAAS,YACd,KACA,QACA,KACc;AAEd,MAAI,UAAU,cAAc,GAAG;AAC/B,QAAM,UAAU,oBAAI,IAAc;AAClC,QAAM,UAAU,oBAAI,IAAc;AAClC,QAAM,UAAU,oBAAI,IAAc;AAClC,QAAM,cAA4B,CAAC;AACnC,QAAM,UAA4B,CAAC;AACnC,MAAI,gBAAgB;AAEpB,aAAW,SAAS,QAAQ;AAC1B,UAAM,UAAU,SAAS,SAAS,MAAM,KAAK,GAAG;AAChD,QAAI,QAAQ,OAAO,QAAQ,SAAS,GAAG;AACrC,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,QAAQ,QAAQ,OAAO,QAAQ,QAAQ,CAAC,MAAM,EAAE,MAAM;AAAA,MACxD,CAAC;AACD,iBAAW,KAAK,QAAQ,OAAO,QAAS,YAAW,KAAK,EAAE,QAAQ;AAChE,oBAAY,KAAK,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,MAAM,QAAQ,CAAC,CAAC;AAAA,MACtE;AACA;AAAA,IACF;AACA,cAAU,QAAQ;AAClB,qBAAiB;AACjB,eAAW,MAAM,QAAQ,OAAO,QAAS,SAAQ,IAAI,EAAE;AACvD,eAAW,MAAM,QAAQ,OAAO,QAAS,SAAQ,IAAI,EAAE;AACvD,eAAW,MAAM,QAAQ,OAAO,QAAS,SAAQ,IAAI,EAAE;AACvD,eAAW,KAAK,QAAQ,OAAO,YAAa,aAAY,KAAK,CAAC;AAAA,EAChE;AAEA,QAAM,SAAsB;AAAA,IAC1B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,CAAC;AAAA,IACV;AAAA,EACF;AACA,SAAO,EAAE,KAAK,SAAS,OAAO;AAChC;AAEA,SAAS,SAAS,OAA8B;AAC9C,SAAO;AAAA,IACL,SAAS,MAAM;AAAA,IACf,SAAS,MAAM;AAAA,IACf,SAAS,MAAM;AAAA,IACf,eAAe,MAAM;AAAA,IACrB,SAAS,MAAM;AAAA,IACf,SAAS,CAAC;AAAA,IACV,aAAa,MAAM;AAAA,EACrB;AACF;;;AC9mBO,IAAM,mBAAmC;AAAA,EAC9C,eAAe;AAAA,EACf,QAAQ,EAAE,SAAS,IAAI,UAAU,GAAG,SAAS,EAAE;AAAA,EAC/C,mBAAmB;AAAA,EACnB,mBAAmB;AACrB;AAEA,IAAM,cAAoC,CAAC,WAAW,YAAY,SAAS;AAGpE,SAAS,qBAAoC;AAClD,QAAM,QAAuB;AAAA,IAC3B,QAAQ,cAAc;AAAA,IACtB,UAAU,CAAC;AAAA,IACX,SAAS,CAAC;AAAA,IACV,QAAQ,CAAC;AAAA,IACT,UAAU,CAAC;AAAA,EACb;AACA,QAAM,QAAuB;AAAA,IAC3B,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,eAAe;AAAA,IACf,cAAc;AAAA,IACd,WAAW;AAAA,EACb;AACA,SAAO;AAAA,IACL,IAAI;AAAA,IACJ,UAAU;AAAA,IACV,aAAa;AAAA,IACb,OAAgB;AACd,aAAO;AAAA,IACT;AAAA,IACA,QAAQ,QAAqC;AAC3C,aAAO;AAAA,IACT;AAAA,IACA,KAAK,SAAmB,MAA+B;AACrD,aAAO,EAAE,SAAS,CAAC,GAAG,OAAO,MAAM,UAAU,CAAC,EAAE;AAAA,IAClD;AAAA,IACA,gBAA+B;AAC7B,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAGO,SAAS,0BAAyC;AACvD,QAAM,OAA8B,oBAAI,IAAI;AAC5C,SAAO;AAAA,IACL,uBAAgC;AAC9B,aAAO;AAAA,IACT;AAAA,IACA,6BAAsC;AACpC,aAAO;AAAA,IACT;AAAA,IACA,iBAAwC;AACtC,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAOA,SAAS,oBAAoB,GAA+D;AAC1F,SAAO,OAAQ,EAAsC,qBAAqB;AAC5E;AAeO,SAAS,mBAAmB,KAAiB,UAAwC;AAC1F,MAAI,CAAC,oBAAoB,QAAQ,KAAK,SAAS,iBAAiB,EAAE,WAAW,GAAG;AAC9E,WAAO,wBAAwB;AAAA,EACjC;AAEA,QAAM,aAAa,oBAAI,IAAc;AACrC,QAAM,aAAa,oBAAI,IAAc;AAErC,aAAW,MAAM,WAAW,GAAG,GAAG;AAChC,UAAM,KAAK,WAAW,KAAK,EAAE;AAC7B,QAAI,CAAC,GAAI;AACT,eAAW,OAAO,GAAG,QAAQ,UAAU;AACrC,UAAI,IAAI,SAAS,SAAU;AAC3B,iBAAW,KAAK,IAAI,QAAQ;AAC1B,cAAM,IAAI,SAAS,cAAc,EAAE,KAAK;AAGxC,YAAI,EAAE,cAAc,EAAE,aAAa,EAAE,cAAe,YAAW,IAAI,EAAE;AACrE,YAAI,EAAE,aAAc,YAAW,IAAI,EAAE;AAAA,MACvC;AAAA,IACF;AAAA,EACF;AAMA,QAAM,SAAS,oBAAI,IAA6B;AAChD,aAAW,MAAM,WAAW,GAAG,GAAG;AAChC,UAAM,KAAK,WAAW,KAAK,EAAE;AAC7B,QAAI,CAAC,GAAI;AACT,QAAI,CAAC,WAAW,IAAI,EAAE,KAAK,CAAC,WAAW,IAAI,EAAE,EAAG;AAChD,UAAM,MAAM,oBAAI,IAAc,CAAC,EAAE,CAAC;AAClC,eAAW,KAAK,GAAG,UAAU;AAC3B,YAAM,KAAK,IAAI,MAAM,IAAI,CAAC;AAC1B,UAAI,MAAM,GAAG,SAAS,UAAW,KAAI,IAAI,CAAC;AAAA,IAC5C;AACA,WAAO,IAAI,IAAI,GAAG;AAAA,EACpB;AAEA,QAAM,QAA+B,oBAAI,IAAI;AAC7C,SAAO;AAAA,IACL,sBAAsB,CAAC,OAA0B,WAAW,IAAI,EAAE;AAAA,IAClE,4BAA4B,CAAC,OAA0B,WAAW,IAAI,EAAE;AAAA,IACxE,gBAAgB,CAAC,OAAwC,OAAO,IAAI,EAAE,KAAK;AAAA,EAC7E;AACF;AAKA,SAAS,KAAK,GAAqC;AACjD,SAAQ,EAAgB;AAC1B;AAGO,SAAS,uBAAuC;AACrD,SAAO;AAAA,IACL,OAAO,QAAqC;AAC1C,aAAO,EAAE,IAAI,UAAU,QAAQ,KAAK,MAAM,EAAE;AAAA,IAC9C;AAAA,IACA,WAAW,QAAkC;AAC3C,aAAO,EAAE,IAAI,cAAc,QAAQ,KAAK,MAAM,EAAE;AAAA,IAClD;AAAA,IACA,YAAY,QAAkB,aAAuC;AACnE,aAAO,EAAE,IAAI,eAAe,QAAQ,KAAK,MAAM,GAAG,YAAY;AAAA,IAChE;AAAA,IACA,KAAK,QAAkB,SAAsC;AAC3D,aAAO,EAAE,IAAI,QAAQ,QAAQ,KAAK,MAAM,GAAG,QAAQ;AAAA,IACrD;AAAA,IACA,aAAa,QAAkB,MAAgC;AAC7D,aAAO,EAAE,IAAI,gBAAgB,QAAQ,KAAK,MAAM,GAAG,KAAK;AAAA,IAC1D;AAAA,IACA,YAAY,QAAkB,MAAgC;AAC5D,aAAO,EAAE,IAAI,eAAe,QAAQ,KAAK,MAAM,GAAG,KAAK;AAAA,IACzD;AAAA,IACA,SAAS,QAAkB,WAAwB,OAA+B;AAChF,aAAO,EAAE,IAAI,YAAY,QAAQ,KAAK,MAAM,GAAG,WAAW,KAAK,SAAS,GAAG,MAAM;AAAA,IACnF;AAAA,IACA,cAAc,OAAiB,QAAkC;AAC/D,aAAO,EAAE,IAAI,iBAAiB,OAAO,KAAK,KAAK,GAAG,QAAQ,KAAK,MAAM,EAAE;AAAA,IACzE;AAAA,IACA,aAAa,QAAqB,OAAiB,iBAAiB,MAAsB;AACxF,aAAO,EAAE,IAAI,gBAAgB,QAAQ,KAAK,MAAM,GAAG,OAAO,eAAe;AAAA,IAC3E;AAAA,IACA,WACE,QACA,QACA,OACA,aAAkC,SAClB;AAChB,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,QAAQ,KAAK,MAAM;AAAA,QACnB,QAAQ,SAAS,KAAK,MAAM,IAAI;AAAA,QAChC;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,IACA,oBACE,MACA,MACA,MACgB;AAChB,YAAM,OAA+B,MAAM,QAAQ,IAAI,IAClD,OACD,CAAC,IAAmB;AACxB,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,MAAM,KAAK,IAAI;AAAA,QACf,MAAM,KAAK,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;AAAA,QAC7B,YAAY,MAAM,QAAQ;AAAA,QAC1B,YAAY,MAAM,cAAc;AAAA,MAClC;AAAA,IACF;AAAA,IACA,QAAQ,MAA6B;AACnC,aAAO;AAAA,IACT;AAAA,IACA,KAAK,OAAyB;AAC5B,aAAO,EAAE,MAAM,QAAQ,MAAM;AAAA,IAC/B;AAAA,IACA,KAAK,MAA0B;AAC7B,aAAO,EAAE,MAAM,OAAO,KAAK,KAAK,IAAI,EAAE;AAAA,IACxC;AAAA,EACF;AACF;AAIA,SAAS,GAAM,GAAuB;AACpC,SAAO;AACT;AAEA,SAAS,kBACP,KACA,WACA,UACA,WACA,QACA,OACA,WACc;AACd,QAAM,OAAO,WAAW,KAAK,SAAS;AAEtC,QAAM,WAAW,MAAsC;AACrD,QAAI,KAAK,UAAU,KAAM,QAAO;AAChC,UAAM,IAAI,IAAI,MAAM,IAAI,KAAK,MAAM;AACnC,WAAO,KAAK,EAAE,SAAS,YAAY,GAAG,CAAC,IAAI;AAAA,EAC7C;AAEA,QAAM,kBAAkB,MAA0C;AAChE,UAAM,MAAiC,CAAC;AACxC,eAAW,KAAK,KAAK,UAAU;AAC7B,YAAM,KAAK,IAAI,MAAM,IAAI,CAAC;AAC1B,UAAI,MAAM,GAAG,SAAS,UAAW,KAAI,KAAK,GAAG,EAAE,CAAC;AAAA,IAClD;AACA,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,MAA0C;AAC1D,UAAM,MAAiC,CAAC;AACxC,QAAI,MAAuB,KAAK;AAChC,WAAO,OAAO,MAAM;AAClB,YAAM,IAAwB,IAAI,MAAM,IAAI,GAAG;AAC/C,UAAI,CAAC,EAAG;AACR,UAAI,EAAE,SAAS,UAAW,KAAI,KAAK,GAAG,CAAC,CAAC;AACxC,YAAM,EAAE;AAAA,IACV;AACA,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,CAAC,UAA+C;AAChE,QAAI,KAAK,UAAU,KAAM,QAAO;AAChC,UAAM,IAAI,IAAI,MAAM,IAAI,KAAK,MAAM;AACnC,QAAI,CAAC,KAAM,EAAE,SAAS,aAAa,EAAE,SAAS,WAAa,QAAO;AAClE,UAAM,IAAI,EAAE,SAAS,QAAQ,SAAS;AACtC,UAAM,MAAM,EAAE,SAAS,IAAI,KAAK;AAChC,QAAI,OAAO,KAAM,QAAO;AACxB,UAAM,KAAK,IAAI,MAAM,IAAI,GAAG;AAC5B,WAAO,KAAK,GAAG,EAAE,IAAI;AAAA,EACvB;AAEA,QAAM,aAAa,CAAC,MAA0B;AAC5C,UAAM,OAAO,IAAI,MAAM,IAAK,EAAa,EAAE;AAC3C,WAAO,QAAQ,KAAK,SAAS,YAAY,KAAK,WAAW,cAAc;AAAA,EACzE;AAEA,SAAO;AAAA,IACL,MAAM,GAAG,IAAI;AAAA,IACb,KAAK,GAAG,GAAG;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,IACA,mBAAmD;AACjD,YAAM,MAAM,gBAAgB;AAC5B,aAAO,IAAI,WAAW,IAAI,IAAI,CAAC,IAAK;AAAA,IACtC;AAAA,IACA,WAAqB;AACnB,aAAO,KAAK;AAAA,IACd;AAAA,IACA;AAAA,IACA,SAAS,GAA0B;AACjC,YAAM,SAAS,IAAI,IAAI,MAAM,IAAK,EAAgB,EAAE,IAAI;AACxD,UAAI,CAAC,UAAU,OAAO,SAAS,UAAW,QAAO;AACjD,aAAO,OAAO,QAAQ,UAAU,OAAO,KAAK;AAAA,IAC9C;AAAA,IACA;AAAA,IACA,QAAQ,MAAsC;AAC5C,iBAAW,KAAK,UAAU,EAAG,KAAI,KAAK,CAAC,EAAG,QAAO;AACjD,aAAO;AAAA,IACT;AAAA,IACA,cAA2C;AACzC,aAAO,UAAU,EAAE;AAAA,IACrB;AAAA,IACA,cAA2C;AACzC,aAAO,UAAU,CAAC;AAAA,IACpB;AAAA,IACA,gBAAwB;AACtB,UAAI,KAAK,UAAU,KAAM,QAAO;AAChC,YAAM,IAAI,IAAI,MAAM,IAAI,KAAK,MAAM;AACnC,UAAI,CAAC,KAAM,EAAE,SAAS,aAAa,EAAE,SAAS,WAAa,QAAO;AAClE,UAAI,MAAM;AACV,iBAAW,KAAK,EAAE,UAAU;AAC1B,cAAM,KAAK,IAAI,MAAM,IAAI,CAAC;AAC1B,YAAI,MAAM,GAAG,SAAS,WAAW;AAC/B,iBAAO;AACP,cAAI,MAAM,UAAW,QAAO;AAAA,QAC9B;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAIA,SAAS,YAAY,OAAuBC,UAA6B;AACvE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,QAAQ,EAAE,SAASA,SAAQ,MAAM,UAAUA,SAAQ,UAAU,QAAQA,SAAQ,OAAO;AAAA,EACtF;AACF;AAEA,SAAS,iBAAiB,QAAyB,OAA6B;AAC9E,QAAM,MAAiB,CAAC;AACxB,aAAW,QAAQ,QAAQ;AACzB,QAAI,KAAK,UAAU,MAAO;AAC1B,eAAW,KAAK,KAAK,SAAU,KAAI,KAAK,CAAC;AAAA,EAC3C;AACA,MAAI,KAAK,CAAC,GAAG,OAAO,EAAE,YAAY,MAAM,EAAE,YAAY,EAAE;AACxD,SAAO;AACT;AASA,SAAS,YAA2B;AAClC,SAAO;AAAA,IACL,SAAS,GAAW;AAClB,aAAO,EAAE;AAAA,IACX;AAAA,IACA,QAA0B;AACxB,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AACF;AAGA,SAAS,kBAAkB,KAAuC;AAChE,QAAM,MAAkB,CAAC;AACzB,aAAW,MAAM,KAAK;AACpB,QAAI,GAAG,OAAO,gBAAgB,GAAG,OAAO,eAAgB,KAAI,KAAK,GAAG,MAAM;AAAA,aACjE,GAAG,OAAO,sBAAuB,KAAI,KAAK,GAAG,GAAG,IAAI;AAAA,EAC/D;AACA,SAAO;AACT;AAGA,SAAS,YAAY,UAAyBC,aAA6B,IAAuB;AAChG,MAAI,GAAG,OAAO,SAAS,EAAG,QAAO;AACjC,MAAI;AACF,UAAM,MAAmB,EAAE,YAAAA,aAAY,MAAM,UAAU,EAAE;AACzD,UAAM,IAAI,SAAS,KAAK,IAAI,GAAG;AAC/B,WAAO,EAAE,SAAS,EAAE,YAAY;AAAA,EAClC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AASA,SAAS,sBACP,QACA,OACA,KACA,UACAA,aACS;AACT,aAAW,MAAM,kBAAkB,GAAG,GAAG;AACvC,UAAM,QAAQ,WAAW,OAAO,EAAE;AAClC,QAAI,CAAC,MAAO;AAEZ,QAAI,MAAM,QAAQ,UAAU,MAAM,QAAQ,WAAY;AACtD,QAAI,YAAY,UAAUA,aAAY,MAAM,QAAQ,EAAG;AACvD,UAAM,QAAQ,WAAW,QAAQ,EAAE;AACnC,UAAM,WAAW,CAAC,SAAS,YAAY,UAAUA,aAAY,MAAM,QAAQ;AAC3E,QAAI,SAAU,QAAO;AAAA,EACvB;AACA,SAAO;AACT;AAOA,SAAS,SACP,OACA,UACA,KACA,SACA,OACA,WACA,SACA,aACA,eACQ;AACR,MAAI,aAAa;AACjB,QAAM,WAAW,IAAI;AACrB,QAAM,YAAY,IAAI;AAEtB,aAAW,QAAQ,WAAW,MAAM,GAAG,GAAG;AACxC,UAAM,KAAK,WAAW,MAAM,KAAK,IAAI;AACrC,QAAI,CAAC,GAAI;AAKT,QAAI,UAAU,aAAa,cAAc,IAAI,IAAI,EAAG;AAEpD,eAAWD,YAAW,UAAU;AAC9B,UAAIA,SAAQ,SAAS,IAAI,cAAe;AACxC,UAAI,SAAoC,CAAC;AACzC,UAAI;AACF,cAAM,OAAO;AAAA,UACX,MAAM;AAAA,UACN;AAAA,UACA;AAAA,UACA;AAAA,UACA,IAAI;AAAA,UACJ;AAAA,UACA;AAAA,QACF;AACA,cAAM,SAASA,SAAQ,SAAS,MAAM,OAAO;AAC7C,YAAI,CAAC,OAAQ;AACb,iBAAS,OAAO;AAChB,YAAI,OAAO,YAAa,YAAW,KAAK,OAAO,YAAa,aAAY,KAAK,CAAC;AAAA,MAChF,SAAS,KAAK;AACZ,oBAAY,KAAK;AAAA,UACf,MAAM;AAAA,UACN,UAAU;AAAA,UACV,SAAS,YAAYA,SAAQ,IAAI,YAAY,OAAQ,KAAe,WAAW,GAAG,CAAC;AAAA,UACnF,QAAQ;AAAA,UACR,SAASA,SAAQ;AAAA,UACjB;AAAA,UACA;AAAA,UACA,OAAO;AAAA,QACT,CAAC;AACD;AAAA,MACF;AAEA,UAAI,OAAO,WAAW,EAAG;AACzB,YAAM,MAAM,OAAO,IAAI,CAAC,MAAM,YAAY,GAAGA,QAAO,CAAC;AACrD,YAAM,UAAU,SAAS,MAAM,KAAK,KAAK,GAAG;AAC5C,iBAAW,KAAK,QAAQ,OAAO,YAAa,aAAY,KAAK,CAAC;AAC9D,UAAI,QAAQ,OAAO,gBAAgB,GAAG;AAEpC,YACE,UAAU,aACV,sBAAsB,MAAM,KAAK,QAAQ,KAAK,KAAK,UAAU,IAAI,UAAU,GAC3E;AACA,sBAAY,KAAK;AAAA,YACf,MAAM;AAAA,YACN,UAAU;AAAA,YACV,SACE,YAAYA,SAAQ,IAAI,sBAAsB,IAAI,qDACrB,SAAS,EAAE;AAAA,YAC1C,QAAQ;AAAA,YACR,SAASA,SAAQ;AAAA,YACjB;AAAA,YACA;AAAA,UACF,CAAC;AAGD,wBAAc,IAAI,IAAI;AACtB;AAAA,QACF;AACA,cAAM,MAAM,QAAQ;AACpB,sBAAc,QAAQ,OAAO;AAC7B,mBAAW,MAAM,QAAQ,OAAO,QAAS,SAAQ,IAAI,EAAE;AACvD,mBAAW,MAAM,QAAQ,OAAO,QAAS,SAAQ,IAAI,EAAE;AAEvD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,eAAe,KAAyB;AAC/C,QAAM,QAAkB,CAAC;AACzB,QAAM,QAAQ,CAAC,OAAuB;AACpC,UAAM,IAAI,IAAI,MAAM,IAAI,EAAE;AAC1B,QAAI,CAAC,EAAG;AACR,UAAM,KAAK,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE;AAC5B,eAAW,KAAK,SAAS,CAAC,EAAG,OAAM,CAAC;AAAA,EACtC;AACA,QAAM,IAAI,IAAI;AACd,SAAO,MAAM,KAAK,GAAG;AACvB;AAOO,SAAS,UACd,KACA,QACA,KACA,QAC2E;AAC3E,QAAM,MAAsB,EAAE,GAAG,kBAAkB,GAAG,OAAO;AAC7D,QAAM,UAAU,qBAAqB;AACrC,QAAM,QAAkB,EAAE,IAAI;AAC9B,QAAM,UAA4B,CAAC;AAEnC,QAAM,gBAAgB,oBAAI,IAAc;AAExC,aAAW,SAAS,aAAa;AAC/B,UAAM,WAAW,iBAAiB,QAAQ,KAAK;AAC/C,UAAM,eAAe,oBAAI,IAAc;AACvC,UAAM,cAA4B,CAAC;AACnC,UAAM,SAAS,IAAI,OAAO,KAAK,KAAK,IAAI;AAExC,QAAI,aAAa;AACjB,QAAI,YAAY;AAChB,QAAI,aAAyB;AAC7B,UAAM,OAAO,oBAAI,IAAY;AAE7B,QAAI,SAAS,WAAW,GAAG;AACzB,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,SAAS;AAAA,QACT;AAAA,MACF,CAAC;AACD;AAAA,IACF;AAEA,WAAO,aAAa,QAAQ;AAC1B,oBAAc;AACd,YAAM,UAAU;AAAA,QACd;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAEA,UAAI,YAAY,GAAG;AACjB,oBAAY;AACZ,qBAAa;AACb;AAAA,MACF;AAEA,UAAI,IAAI,mBAAmB;AACzB,cAAM,KAAK,eAAe,MAAM,GAAG;AACnC,YAAI,KAAK,IAAI,EAAE,GAAG;AAChB,uBAAa;AACb,sBAAY,KAAK;AAAA,YACf,MAAM;AAAA,YACN,UAAU;AAAA,YACV,SAAS,UAAU,KAAK;AAAA,YACxB;AAAA,YACA,WAAW;AAAA,UACb,CAAC;AACD;AAAA,QACF;AACA,aAAK,IAAI,EAAE;AAAA,MACb;AAAA,IACF;AAEA,QAAI,CAAC,aAAa,eAAe,eAAe;AAC9C,mBAAa;AACb,kBAAY,KAAK;AAAA,QACf,MAAM;AAAA,QACN,UAAU,IAAI,sBAAsB,UAAU,UAAU;AAAA,QACxD,SAAS,UAAU,KAAK,eAAe,MAAM;AAAA,QAC7C;AAAA,QACA,WAAW;AAAA,MACb,CAAC;AAAA,IACH;AAEA,YAAQ,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO,EAAE,KAAK,MAAM,KAAK,QAAQ;AACnC;AAGO,SAAS,kBAAkB,QAAsC;AACtE,SAAO;AAAA,IACL,IAAI,KAAiB,KAAmB,QAAoD;AAC1F,aAAO,UAAU,KAAK,QAAQ,KAAK,MAAM,EAAE;AAAA,IAC7C;AAAA,EACF;AACF;;;ACpoBO,SAAS,sBAAqC;AACnD,QAAM,MAAM,oBAAI,IAA4B;AAC5C,SAAO;AAAA,IACL,SAAS,GAA2B;AAClC,UAAI,CAAC,IAAI,IAAI,EAAE,SAAS,EAAG,KAAI,IAAI,EAAE,WAAW,CAAC;AACjD,aAAO,EAAE;AAAA,IACX;AAAA,IACA,QAAmC;AACjC,aAAO,CAAC,GAAG,IAAI,OAAO,CAAC;AAAA,IACzB;AAAA,EACF;AACF;AAIA,SAAS,kBAAkB,IAAyB;AAClD,QAAM,MAAgB,CAAC;AACvB,aAAW,OAAO,GAAG,QAAQ,UAAU;AACrC,QAAI,IAAI,SAAS,SAAU,YAAW,KAAK,IAAI,OAAQ,KAAI,KAAK,EAAE,KAAK;AAAA,EACzE;AACA,SAAO;AACT;AAOA,SAAS,cACP,KACA,OACA,aACM;AACN,QAAM,EAAE,UAAU,YAAAE,YAAW,IAAI;AACjC,aAAW,MAAM,WAAW,GAAG,GAAG;AAChC,UAAM,KAAK,WAAW,KAAK,EAAE;AAC7B,QAAI,CAAC,MAAM,GAAG,QAAQ,OAAQ;AAC9B,UAAM,SAAS,kBAAkB,EAAE;AACnC,QAAI,OAAO,WAAW,EAAG;AACzB,QAAI;AACF,YAAM,SAAS,SAAS,QAAQ;AAAA,QAC9B,SAAS;AAAA,QACT,SAAS;AAAA,UACP,SAAS,GAAG;AAAA,UACZ,WAAW,GAAG,cAAc,QAAQ,QAAQ;AAAA,QAC9C;AAAA,MACF,CAAC;AACD,UAAI,SAAmB,OAAO;AAC9B,UAAI;AACF,iBAASA,YAAW,kBAAkB,MAAM;AAAA,MAC9C,QAAQ;AAAA,MAER;AACA,SAAG,WAAW;AACd,iBAAW,KAAK,OAAO,UAAU;AAC/B,oBAAY,KAAK;AAAA,UACf,MAAM;AAAA,UACN,UAAU,EAAE;AAAA,UACZ,SAAS,EAAE;AAAA,UACX,QAAQ;AAAA,QACV,CAAC;AAAA,MACH;AAAA,IACF,SAAS,KAAK;AACZ,kBAAY,KAAK;AAAA,QACf,MAAM;AAAA,QACN,UAAU;AAAA,QACV,SAAS,wBAAwB,GAAG,GAAG,MAAM,OAAQ,KAAe,WAAW,GAAG,CAAC;AAAA,QACnF,QAAQ;AAAA,QACR,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAIA,IAAM,kBAAuD;AAAA,EAC3D,SAAS;AAAA,EACT,UAAU;AAAA,EACV,SAAS;AACX;AAEA,IAAM,kBAAN,MAA0C;AAAA,EACxC,IAAI,OAAsC;AACxC,UAAM,YAAY,IAAI;AACtB,UAAM,cAA4B,CAAC;AACnC,UAAM,SAAS,CAAC,MAAwB;AACtC,kBAAY,KAAK,CAAC;AAClB,YAAM,UAAU,OAAO,CAAC;AAAA,IAC1B;AAGA,UAAM,WAAiC;AAAA,MACrC,IAAI,MAAM;AAAA,MACV,MAAM,MAAM;AAAA,MACZ,UAAU,MAAM;AAAA,MAChB,YAAY,MAAM;AAAA,MAClB,QAAQ,EAAE,kBAAkB,MAAM,QAAQ,oBAAoB,KAAK;AAAA,MACnE,cAAc;AAAA,IAChB;AACA,QAAI,MAAM,aAAa,OAAW,UAAS,WAAW,MAAM;AAE5D,UAAM,SAAS,MAAM,SAAS,MAAM,MAAM,MAAM,QAAQ;AACxD,eAAW,KAAK,OAAO,YAAa,QAAO,CAAC;AAC5C,UAAM,MAAM,OAAO;AACnB,UAAM,UAAU,IAAI,MAAM;AAG1B,kBAAc,KAAK,OAAO,WAAW;AAGrC,UAAM,MAAoB;AAAA,MACxB;AAAA,MACA,eAAe,MAAM,QAAQ,UAAU;AAAA,MACvC,YAAY,MAAM;AAAA,MAClB,WAAW,wBAAwB;AAAA,MACnC,UAAU,MAAM;AAAA,IAClB;AACA,UAAM,EAAE,KAAK,WAAW,QAAQ,IAAI,UAAU,KAAK,MAAM,QAAQ,KAAK,aAAa,KAAK,CAAC;AAEzF,QAAI,aAAa;AACjB,UAAM,aAAwC,EAAE,GAAG,gBAAgB;AACnE,eAAW,KAAK,SAAS;AACvB,iBAAW,EAAE,KAAK,IAAI,EAAE;AACxB,iBAAW,KAAK,EAAE,aAAa;AAC7B,oBAAY,KAAK,CAAC;AAClB,cAAM,UAAU,OAAO,CAAC;AAAA,MAC1B;AACA,oBAAc,EAAE,QAAQ;AAAA,IAC1B;AAGA,UAAM,WAAqB;AAAA,MACzB,UAAU,MAAM;AAAA,MAChB,KAAK,CAAC;AAAA,MACN,YAAY,oBAAI,IAAI;AAAA,IACtB;AACA,UAAM,aAA6B;AAAA,MACjC,YAAY,MAAM;AAAA,MAClB,UAAU,MAAM;AAAA,MAChB,MAAM,oBAAoB;AAAA,MAC1B,KAAK,MAAM,SAAS;AAAA,MACpB,cAAc;AAAA,IAChB;AACA,UAAM,UAAyB,MAAM,QAAQ,MAAM,WAAW,UAAU,UAAU;AAClF,eAAW,KAAK,QAAQ,aAAa;AACnC,kBAAY,KAAK,CAAC;AAClB,YAAM,UAAU,OAAO,CAAC;AAAA,IAC1B;AAGA,UAAM,QAAuB;AAAA,MAC3B;AAAA,MACA,UAAU,UAAU,MAAM;AAAA,MAC1B;AAAA,MACA;AAAA,MACA,YAAY,IAAI,IAAI;AAAA,IACtB;AACA,UAAM,UAAiC,QAAQ,MAAM,IAAI,CAAC,MAAM,EAAE,IAAI;AAEtE,WAAO;AAAA,MACL,MAAM,QAAQ;AAAA,MACd,KAAK,QAAQ;AAAA,MACb,SAAS,QAAQ,SAAS,MAAM;AAAA,MAChC;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK;AAAA,MACL;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,aAAa,OAAoE;AACxF,QAAM,KAAK,MAAM,QAAQ;AACzB,MAAI,CAAC,GAAI,QAAO;AAChB,SAAO;AAAA,IACL,eAAe,GAAG,iBAAiB;AAAA,IACnC,QAAQ,GAAG,UAAU,CAAC;AAAA,IACtB,mBAAmB,GAAG,qBAAqB;AAAA,IAC3C,mBAAmB,GAAG,qBAAqB;AAAA,EAC7C;AACF;AAEA,SAAS,MAAM,KAAgC;AAC7C,aAAW,OAAO,IAAI,QAAQ,OAAO,EAAG,QAAO,IAAI;AACnD,SAAO;AACT;AAMA,SAAS,MAAc;AACrB,SAAO,OAAO,gBAAgB,eAAe,OAAO,YAAY,QAAQ,aACpE,YAAY,IAAI,IAChB,KAAK,IAAI;AACf;AAGO,SAAS,iBAA2B;AACzC,SAAO,IAAI,gBAAgB;AAC7B;;;ACtMA,SAAS,eAAe,IAAyB;AAC/C,QAAM,MAAgB,CAAC;AACvB,aAAW,OAAO,GAAG,UAAU;AAC7B,QAAI,IAAI,SAAS,SAAU,YAAW,KAAK,IAAI,OAAQ,KAAI,KAAK,EAAE,KAAK;AAAA,EACzE;AACA,SAAO;AACT;AAGA,SAAS,gBAAgB,MAAiB,QAAsC;AAC9E,QAAM,cAA4B,OAAO,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE;AACnE,QAAM,MAAoB,EAAE,MAAM,UAAU,QAAQ,YAAY;AAChE,SAAO;AAAA,IACL,MAAM;AAAA,IACN,UAAU,CAAC,GAAG;AAAA,IACd,WAAW,KAAK;AAAA,IAChB,UAAU,KAAK;AAAA,IACf,YAAY;AAAA,IACZ,QAAQ;AAAA,IACR,YAAY;AAAA,EACd;AACF;AAGA,SAAS,WAAW,GAAsB,GAA+B;AACvE,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,EAAG,KAAI,EAAE,CAAC,MAAM,EAAE,CAAC,EAAG,QAAO;AAChE,SAAO;AACT;AAMO,SAAS,wBACd,KACA,UACA,MACM;AACN,QAAM,OAAO,oBAAoB;AACjC,aAAW,MAAM,WAAW,GAAG,GAAG;AAChC,UAAM,KAAK,WAAW,KAAK,EAAE;AAC7B,QAAI,CAAC,MAAM,CAAC,GAAG,KAAK,QAAS;AAC7B,QAAI,GAAG,QAAQ,UAAU,GAAG,QAAQ,WAAY;AAEhD,UAAM,SAAS,eAAe,GAAG,OAAO;AAGxC,UAAM,MAAmB,EAAE,YAAY,MAAM,KAAK;AAClD,UAAM,UAAU,SAAS,KAAK,GAAG,UAAU,GAAG,EAAE;AAEhD,QAAI,QAAQ,WAAW,EAAG;AAE1B,UAAM,aAAa,IAAI,IAAI,OAAO;AAClC,UAAM,OAAiB,CAAC;AACxB,UAAM,OAAO,oBAAI,IAAY;AAI7B,eAAW,KAAK,QAAQ;AACtB,UAAI,KAAK,IAAI,CAAC,EAAG;AACjB,YAAM,OAAO,WAAW,IAAI,CAAC,KAAK,CAAC,SAAS,cAAc,CAAC,EAAE;AAC7D,UAAI,MAAM;AACR,aAAK,KAAK,CAAC;AACX,aAAK,IAAI,CAAC;AAAA,MACZ;AAAA,IACF;AAEA,eAAW,KAAK,SAAS;AACvB,UAAI,KAAK,IAAI,CAAC,EAAG;AACjB,WAAK,KAAK,CAAC;AACX,WAAK,IAAI,CAAC;AAAA,IACZ;AAEA,QAAI,WAAW,MAAM,MAAM,EAAG;AAC9B,OAAG,UAAU,gBAAgB,GAAG,SAAS,IAAI;AAAA,EAC/C;AACF;;;AC1GA,IAAM,SAAiC,oBAAI,IAAe,CAAC,WAAW,YAAY,SAAS,CAAC;AAC5F,IAAM,gBAA0C,oBAAI,IAAiB,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;AAEjF,SAAS,KAAK,MAAc,KAAoB;AAC9C,QAAM,IAAI,MAAM,iBAAiB,QAAQ,aAAa,MAAM,GAAG,EAAE;AACnE;AAMO,SAAS,cAAc,MAAwB;AACpD,MAAI,QAAQ,QAAQ,OAAO,SAAS,UAAU;AAC5C,UAAM,IAAI,MAAM,uCAAuC;AAAA,EACzD;AAEA,QAAM,OAAO,KAAK;AAClB,MAAI,OAAO,SAAS,YAAY,KAAK,WAAW,GAAG;AACjD,SAAK,OAAO,IAAI,GAAG,iCAAiC;AAAA,EACtD;AAEA,MAAI,OAAO,KAAK,aAAa,YAAY,CAAC,KAAK,SAAS,SAAS,GAAG,GAAG;AACrE,SAAK,MAAM,mDAAmD,KAAK,UAAU,KAAK,QAAQ,CAAC,GAAG;AAAA,EAChG;AAEA,QAAM,QAAQ,KAAK,SAAS,MAAM,KAAK,CAAC,EAAE,CAAC;AAC3C,MAAI,CAAC,OAAO,IAAI,KAAK,GAAG;AACtB,SAAK,MAAM,gEAAgE,KAAK,IAAI;AAAA,EACtF;AAEA,MAAI,CAAC,cAAc,IAAI,KAAK,MAAM,GAAG;AACnC,SAAK,MAAM,+BAA+B,KAAK,UAAU,KAAK,MAAM,CAAC,GAAG;AAAA,EAC1E;AAEA,MAAI,OAAO,KAAK,aAAa,YAAY;AACvC,SAAK,MAAM,6BAA6B;AAAA,EAC1C;AAEA,MAAI,KAAK,aAAa,UAAa,CAAC,OAAO,SAAS,KAAK,QAAQ,GAAG;AAClE,SAAK,MAAM,gDAAgD;AAAA,EAC7D;AAEA,SAAO,OAAO,OAAO,EAAE,GAAG,KAAK,CAAC;AAClC;;;AClBA,IAAM,uBAA0C;AAAA,EAC9C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,SAAS,uBAA+C;AACtD,QAAM,aAAa,IAAI,IAAiB,oBAAgD;AACxF,SAAO;AAAA,IACL,SAAS;AAAA,IACT;AAAA,IACA,YAAY,UAAgC;AAE1C,aAAO,OAAO,QAAQ,EAAE,WAAW,IAAI,KAAK,WAAW,IAAI,QAAQ;AAAA,IACrE;AAAA,EACF;AACF;AAIA,IAAM,iBACJ;AAEF,IAAM,eAAe;AAErB,IAAM,mBAAmB;AAKzB,SAAS,WAAW,KAAqB;AACvC,MAAI,IAAI,IAAI,KAAK,EAAE,QAAQ,QAAQ,GAAG;AAGtC,MAAI,EAAE,QAAQ,0BAA0B,CAAC,IAAI,QAAgB,MAAM,IAAI,YAAY,CAAC;AAGpF,MAAI,EAAE;AAAA,IACJ;AAAA,IACA,CAAC,IAAI,GAAW,GAAW,MAAc,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;AAAA,EACpE;AAGA,MAAI,EAAE,QAAQ,qBAAqB,kBAAkB;AACrD,MAAI,EAAE,QAAQ,gBAAgB,kBAAkB;AAGhD,MAAI,EAAE,QAAQ,gBAAgB,GAAG;AAGjC,MAAI,EAAE,QAAQ,cAAc,CAAC,IAAI,IAAY,SAAiB;AAC5D,UAAM,QAAQ,KACX,MAAM,GAAG,EACT,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC7B,WAAO,GAAG,GAAG,YAAY,CAAC,IAAI,MAAM,KAAK,IAAI,CAAC;AAAA,EAChD,CAAC;AAED,SAAO;AACT;AAGA,SAAS,gBAAgB,OAAwB;AAC/C,SAAO,iBAAiB,KAAK,KAAK;AACpC;AAKA,IAAM,YAAiF;AAAA,EACrF,SAAS,CAAC,eAAe,iBAAiB,kBAAkB,cAAc;AAAA,EAC1E,QAAQ,CAAC,cAAc,gBAAgB,iBAAiB,aAAa;AAAA,EACrE,OAAO,CAAC,OAAO,SAAS,UAAU,MAAM;AAAA,EACxC,gBAAgB;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAAA,EACA,gBAAgB;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAAA,EACA,gBAAgB;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAGA,SAAS,cAAc,OAAyB;AAC9C,QAAM,MAAgB,CAAC;AACvB,MAAI,QAAQ;AACZ,MAAI,MAAM;AACV,aAAW,MAAM,OAAO;AACtB,QAAI,OAAO,IAAK,UAAS;AAAA,aAChB,OAAO,IAAK,SAAQ,KAAK,IAAI,GAAG,QAAQ,CAAC;AAClD,QAAI,UAAU,KAAK,KAAK,KAAK,EAAE,GAAG;AAChC,UAAI,IAAI,SAAS,GAAG;AAClB,YAAI,KAAK,GAAG;AACZ,cAAM;AAAA,MACR;AACA;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,MAAI,IAAI,SAAS,EAAG,KAAI,KAAK,GAAG;AAChC,SAAO;AACT;AAGA,SAAS,aAAa,QAA6D;AACjF,QAAM,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI;AACrB,UAAQ,OAAO,QAAQ;AAAA,IACrB,KAAK;AACH,aAAO,CAAC,GAAI,GAAI,GAAI,CAAE;AAAA,IACxB,KAAK;AACH,aAAO,CAAC,GAAI,GAAI,GAAI,CAAE;AAAA,IACxB,KAAK;AACH,aAAO,CAAC,GAAI,GAAI,GAAI,CAAE;AAAA,IACxB;AACE,aAAO,CAAC,GAAI,GAAI,GAAI,CAAE;AAAA,EAC1B;AACF;AAGA,SAAS,gBAAgB,MAAc,OAAwC;AAC7E,QAAM,MAAM,UAAU,IAAI;AAC1B,MAAI,KAAK;AACP,UAAM,QAAQ,cAAc,KAAK;AACjC,QAAI,MAAM,UAAU,KAAK,MAAM,UAAU,GAAG;AAC1C,YAAM,QAAQ,aAAa,KAAK;AAChC,aAAO,IAAI,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,CAAE,CAAqB;AAAA,IAC7D;AACA,WAAO,CAAC,CAAC,MAAM,KAAK,CAAC;AAAA,EACvB;AAEA,MAAI,SAAS,SAAS,SAAS,YAAY;AACzC,UAAM,QAAQ,cAAc,KAAK;AACjC,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO;AAAA,QACL,CAAC,WAAW,MAAM,CAAC,CAAE;AAAA,QACrB,CAAC,cAAc,MAAM,CAAC,CAAE;AAAA,MAC1B;AAAA,IACF;AACA,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO;AAAA,QACL,CAAC,WAAW,MAAM,CAAC,CAAE;AAAA,QACrB,CAAC,cAAc,MAAM,CAAC,CAAE;AAAA,MAC1B;AAAA,IACF;AACA,WAAO,CAAC,CAAC,MAAM,KAAK,CAAC;AAAA,EACvB;AAEA,SAAO,CAAC,CAAC,MAAM,KAAK,CAAC;AACvB;AAIA,SAAS,SACP,OACA,MACA,UACA,WACW;AACX,QAAM,WAAW,KAAK,KAAK,EAAE,YAAY;AACzC,QAAM,QAAQ,WAAW,QAAQ;AACjC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,kBAAkB,gBAAgB,KAAK;AAAA,IACvC,WAAW,MAAM,YAAY,QAAQ;AAAA,EACvC;AACF;AAEO,SAAS,mBAAoC;AAClD,QAAM,YAAY,qBAAqB;AAEvC,QAAM,uBAAuB,CAC3B,MACA,OACA,cACyB;AACzB,UAAM,IAAI,KAAK,KAAK,EAAE,YAAY;AAClC,UAAM,WAAW,gBAAgB,GAAG,MAAM,KAAK,CAAC;AAChD,WAAO,SAAS,IAAI,CAAC,CAAC,IAAI,EAAE,MAAM,SAAS,WAAW,IAAI,IAAI,SAAS,CAAC;AAAA,EAC1E;AAEA,QAAM,iBAAiB,CAAC,MAAmB,QAA0B;AACnE,SAAK;AACL,WAAO,WAAW,GAAG;AAAA,EACvB;AAEA,QAAM,oBAAoB,CAAC,OAA2B;AACpD,UAAM,SAAS,oBAAI,IAA8B;AACjD,eAAW,SAAS,GAAG,OAAO,OAAO,GAAG;AACtC,YAAM,QAAQ,oBAAI,IAA4B;AAE9C,iBAAW,QAAQ,MAAM,MAAM,OAAO,GAAG;AACvC,cAAM,OAAkB;AAAA,UACtB,GAAG;AAAA,UACH,OAAO,WAAW,OAAO,KAAK,KAAK,CAAC;AAAA,UACpC,kBAAkB,gBAAgB,OAAO,KAAK,KAAK,CAAC;AAAA,UACpD,WAAW,UAAU,YAAY,KAAK,QAAQ;AAAA,QAChD;AACA,cAAM,IAAI,KAAK,UAAU,IAAI;AAAA,MAC/B;AAEA,YAAM,SAAS,IAAI;AAAA,QACjB,CAAC,GAAG,MAAM,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAO,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAE;AAAA,MAC9E;AACA,YAAM,MAAM,aAAa,MAAM,SAAS;AACxC,aAAO,IAAI,KAAK,EAAE,WAAW,MAAM,WAAW,OAAO,OAAO,CAAC;AAAA,IAC/D;AACA,WAAO,EAAE,OAAO;AAAA,EAClB;AAEA,QAAM,SAAS,CAAC,GAAa,MAAyB;AACpD,UAAM,KAAK,kBAAkB,CAAC;AAC9B,UAAM,KAAK,kBAAkB,CAAC;AAC9B,QAAI,GAAG,OAAO,SAAS,GAAG,OAAO,KAAM,QAAO;AAC9C,eAAW,CAAC,KAAK,MAAM,KAAK,GAAG,QAAQ;AACrC,YAAM,SAAS,GAAG,OAAO,IAAI,GAAG;AAChC,UAAI,CAAC,OAAQ,QAAO;AACpB,UAAI,OAAO,MAAM,SAAS,OAAO,MAAM,KAAM,QAAO;AACpD,iBAAW,CAAC,MAAM,KAAK,KAAK,OAAO,OAAO;AACxC,cAAM,QAAQ,OAAO,MAAM,IAAI,IAAI;AACnC,YAAI,CAAC,MAAO,QAAO;AACnB,YAAI,MAAM,UAAU,MAAM,SAAS,MAAM,cAAc,MAAM,UAAW,QAAO;AAAA,MACjF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL,SAAS;AAAA,IACT;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAGO,IAAM,aAA8B,iBAAiB;AASrD,SAAS,gBACd,MACA,SACA,OAAwB,YACf;AACT,QAAM,KAAK,KAAK,kBAAkB,IAAI;AACtC,QAAM,KAAK,KAAK,kBAAkB,OAAO;AACzC,aAAW,CAAC,KAAK,IAAI,KAAK,GAAG,QAAQ;AACnC,UAAM,OAAO,GAAG,OAAO,IAAI,GAAG,KAAK,GAAG,OAAO,IAAI,aAAa,KAAK,SAAS,CAAC;AAC7E,QAAI,CAAC,KAAM,QAAO;AAClB,eAAW,CAAC,MAAM,IAAI,KAAK,KAAK,OAAO;AACrC,YAAM,MAAM,KAAK,MAAM,IAAI,IAAI;AAC/B,UAAI,CAAC,OAAO,IAAI,UAAU,KAAK,MAAO,QAAO;AAAA,IAC/C;AAAA,EACF;AACA,SAAO;AACT;;;ACpUA,SAAS,UAAU,MAAgD;AACjE,QAAM,IAAI;AACV,SAAO,EAAE,SAAS,YAAa,IAAgC;AACjE;AAEA,SAAS,kBACP,IACA,KAC2B;AAC3B,QAAM,MAAiC,CAAC;AACxC,aAAW,WAAW,GAAG,UAAU;AACjC,UAAM,QAAQ,IAAI,IAAI,MAAM,IAAI,OAAO;AACvC,QAAI,SAAS,MAAM,SAAS,UAAW,KAAI,KAAK,KAAgC;AAAA,EAClF;AACA,SAAO;AACT;AAKO,SAAS,OAAO,UAAuC;AAC5D,SAAO,CAAC,MAAM,QAAQ,SAAS,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC;AAC1D;AAQO,SAAS,IAAI,SAA2B;AAC7C,SAAO,CAAC,MAAM,QAAQ,CAAC,QAAQ,MAAM,GAAG;AAC1C;AAKO,SAAS,UAAU,KAAuB;AAC/C,QAAM,OAAO,KAAK,YAAY;AAC9B,SAAO,CAAC,SAAS;AACf,UAAM,KAAK,UAAU,IAAI;AACzB,QAAI,CAAC,GAAI,QAAO;AAChB,WAAO,SAAS,UAAa,GAAG,IAAI,YAAY,MAAM;AAAA,EACxD;AACF;AAGO,IAAM,wBAAiC,CAAC,MAAM,QAAQ;AAC3D,QAAM,KAAK,UAAU,IAAI;AACzB,MAAI,CAAC,GAAI,QAAO;AAChB,SAAO,kBAAkB,IAAI,GAAG,EAAE,WAAW;AAC/C;AASO,SAAS,SAAS,SAA4B;AACnD,SAAO,CAAC,MAAM,QAAQ;AACpB,UAAM,KAAK,UAAU,IAAI;AACzB,QAAI,CAAC,GAAI,QAAO;AAChB,UAAM,OAAO,IAAI,WAAW,EAAyB,KAAM,GAAG;AAC9D,WAAO,gBAAgB,MAAkB,SAAS,UAAU;AAAA,EAC9D;AACF;AAGA,IAAM,oBAAyC,oBAAI,IAAY;AAAA,EAC7D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGD,IAAM,sBAA2C,oBAAI,IAAY;AAAA,EAC/D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAOM,IAAM,oBAA6B,CAAC,MAAM,QAAQ;AACvD,QAAM,KAAK,UAAU,IAAI;AACzB,MAAI,CAAC,GAAI,QAAO;AAChB,MAAI,GAAG,KAAK,kBAAmB,QAAO;AAEtC,QAAM,cAAc,IAAI,WAAW,EAAyB,KAAM,GAAG;AACrE,QAAM,OAAO,WAAW,kBAAkB,WAAuB;AACjE,aAAW,SAAS,KAAK,OAAO,OAAO,GAAG;AACxC,eAAW,QAAQ,MAAM,MAAM,OAAO,GAAG;AACvC,UAAI,CAAC,kBAAkB,IAAI,OAAO,KAAK,QAAQ,CAAC,EAAG;AACnD,UAAI,CAAC,oBAAoB,IAAI,OAAO,KAAK,KAAK,CAAC,EAAG,QAAO;AAAA,IAC3D;AAAA,EACF;AACA,SAAO;AACT;AAKO,IAAM,SAAkB,CAAC,SAAS,UAAU,IAAI,GAAG,KAAK,UAAU;AAGlE,IAAM,mBAA4B,CAAC,SAAS,UAAU,IAAI,GAAG,KAAK,oBAAoB;AAGtF,IAAM,qBAA8B,CAAC,SAC1C,UAAU,IAAI,GAAG,KAAK,sBAAsB;AAGvC,IAAM,oBAA6B,CAAC,SAAS,UAAU,IAAI,GAAG,QAAQ,cAAc;AAMpF,IAAM,uBAAgC,CAAC,MAAM,QAAQ;AAC1D,QAAM,KAAK,UAAU,IAAI;AACzB,MAAI,CAAC,GAAI,QAAO;AAChB,MAAI,GAAG,KAAK,qBAAsB,QAAO;AAEzC,SAAO,IAAI,UAAU,qBAAqB,GAAG,EAAyB;AACxE;;;AC5BA,SAAS,aAAa,KAAqB;AACzC,MAAI,IAAI,WAAW,IAAI,EAAG,QAAO;AACjC,SAAO,IAAI,QAAQ,UAAU,CAAC,MAAM,IAAI,EAAE,YAAY,CAAC,EAAE;AAC3D;AAGA,SAAS,gBAAgB,OAA6B;AACpD,QAAM,QAAQ,oBAAI,IAA4B;AAC9C,aAAW,CAAC,QAAQ,QAAQ,KAAK,OAAO,QAAQ,KAAK,GAAG;AACtD,UAAM,OAAO,aAAa,MAAM;AAChC,eAAW,QAAQ,WAAW,qBAAqB,MAAM,OAAO,QAAQ,GAAG,KAAK,GAAG;AACjF,YAAM,IAAI,KAAK,UAAU,IAAI;AAAA,IAC/B;AAAA,EACF;AACA,QAAM,QAAoB,EAAE,WAAW,gBAAgB,MAAM;AAC7D,SAAO,EAAE,QAAQ,oBAAI,IAA8B,CAAC,CAAC,aAAa,cAAc,GAAG,KAAK,CAAC,CAAC,EAAE;AAC9F;AAIA,SAASC,WAAU,MAAgD;AACjE,QAAM,IAAI;AACV,SAAO,EAAE,SAAS,YAAa,IAAgC;AACjE;AAEA,SAAS,SAAS,MAA+B;AAC/C,SAAO,CAAC,SAAS,QAAQA,WAAU,IAAI,GAAG,KAAK,IAAI,CAAC;AACtD;AAGA,IAAM,aAAsB,SAAS,kBAAkB;AAMvD,IAAM,0BAAmC,CAAC,MAAM,QAAQ;AACtD,QAAM,KAAKA,WAAU,IAAI;AACzB,MAAI,CAAC,GAAI,QAAO;AAChB,SAAO,IAAI,UAAU,eAAe,GAAG,EAAyB,EAAE,OAAO;AAC3E;AAMA,IAAM,iBAA0B;AAAA,EAC9B,IAAI,MAAM;AAAA,EACV,IAAI,gBAAgB;AAAA,EACpB,IAAI,kBAAkB;AAAA,EACtB,IAAI,UAAU;AAAA,EACd,IAAI,oBAAoB;AAAA,EACxB,IAAI,uBAAuB;AAC7B;AAIA,SAAS,kBAAkB,UAAiC;AAC1D,SAAQ,SAAS,MAAM,KAAK,CAAC,EAAE,CAAC,MAAoB;AACtD;AAEA,SAAS,wBAAwB,GAA8B;AAC7D,QAAM,QAAmB,CAAC,UAAU,EAAE,GAAG,CAAC;AAC1C,MAAI,EAAE,MAAO,OAAM,KAAK,SAAS,gBAAgB,EAAE,KAAK,CAAC,CAAC;AAC1D,MAAI,EAAE,cAAc,UAAW,OAAM,KAAK,qBAAqB;AAC/D,MAAI,EAAE,cAAe,OAAM,KAAK,IAAI,iBAAiB,CAAC;AACtD,MAAI,EAAE,OAAO;AACX,UAAM,QAAQ,MAAM,QAAQ,EAAE,KAAK,IAAK,EAAE,QAA+B,CAAC,EAAE,KAAgB;AAC5F,eAAW,KAAK,MAAO,OAAM,KAAK,CAAC;AAAA,EACrC;AACA,SAAO,IAAI,GAAG,KAAK;AACrB;AAEA,SAAS,aACP,OACA,UACS;AAET,MAAI,OAAO,UAAU,WAAY,QAAO;AAExC,QAAM,cAAc,wBAAwB,SAAS,CAAC,CAAC;AACvD,QAAM,UAAU,kBAAkB,QAAQ,IAAI,IAAI,aAAa,cAAc,IAAI;AACjF,SAAO,CAAC,MAAM,QAAQ,QAAQ,MAAM,GAAG;AACzC;AAKA,SAAS,cAAc,IAAc,MAAqC;AACxE,QAAM,SAAS,oBAAI,IAA8B;AACjD,aAAW,CAAC,KAAK,KAAK,KAAK,GAAG,QAAQ;AACpC,UAAM,QAAQ,oBAAI,IAA4B;AAC9C,eAAW,CAAC,MAAM,IAAI,KAAK,MAAM,OAAO;AACtC,YAAM,YAAY,KAAK,YAAY,CAAC,GAAG;AAAA,QACrC,CAAC,MAAM,EAAE,EAAE,SAAS,WAAW,KAAK,IAAI,EAAE,SAAS;AAAA,MACrD;AACA,YAAM,OAAkB,EAAE,GAAG,KAAK;AAClC,aAAQ,KAA+C;AACvD,YAAM,OAAkB,SAAS,SAAS,IAAI,EAAE,GAAG,MAAM,UAAU,SAAS,IAAI;AAChF,YAAM,IAAI,MAAM,IAAI;AAAA,IACtB;AACA,WAAO,IAAI,KAAK,EAAE,WAAW,MAAM,WAAW,MAAM,CAAC;AAAA,EACvD;AACA,SAAO,EAAE,OAAO;AAClB;AAEA,SAAS,mBAAmB,QAAsC;AAChE,QAAM,aAAa,OAAO,aAAa,gBAAgB,OAAO,UAAU,IAAI;AAC5E,QAAM,OAAO,OAAO,kBAAkB;AACtC,SAAO,CAAC,KAAK,OAAO;AAClB,UAAM,UAAU,IAAI;AACpB,UAAM,QAAQ,IAAI,iBAAiB;AACnC,QAAI,CAAC,MAAO,QAAO;AACnB,UAAM,MAAwB,CAAC;AAC/B,QAAI,KAAM,KAAI,KAAK,GAAG,oBAAoB,SAAS,OAAO,EAAE,YAAY,MAAM,CAAC,CAAC;AAChF,QAAI,WAAY,KAAI,KAAK,GAAG,WAAW,OAAO,MAAM,YAAY,aAAa,CAAC;AAC9E,QAAI,KAAK,GAAG,OAAO,OAAO,CAAC;AAC3B,WAAO;AAAA,EACT;AACF;AAEA,SAAS,eAAe,SAA+C;AACrE,MAAI,OAAO,YAAY,WAAY,QAAO;AAE1C,MAAI,iBAAiB,QAAS,QAAO,mBAAmB,OAAO;AAE/D,MAAI,oBAAoB,SAAS;AAC/B,UAAM,iBAAiB,QAAQ,kBAAkB;AACjD,WAAO,CAAC,KAAK,OAAO;AAClB,YAAM,OAAO,QAAQ,eAAe,IAAI,SAAS,GAAG,GAAG;AACvD,UAAI,CAAC,KAAM,QAAO;AAClB,aAAO,CAAC,GAAG,aAAa,IAAI,MAAM,MAAM,cAAc,CAAC;AAAA,IACzD;AAAA,EACF;AAEA,MAAI,iBAAiB,SAAS;AAC5B,UAAM,iBAAiB,QAAQ,kBAAkB;AACjD,WAAO,CAAC,KAAK,OAAO;AAClB,YAAM,OAAO,IAAI,IAAY,QAAQ,YAAY,IAAI,SAAS,GAAG,GAAG,CAAC;AACrE,UAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,aAAO,CAAC,GAAG,aAAa,IAAI,MAAM,cAAc,IAAI,SAAS,GAAG,IAAI,GAAG,cAAc,CAAC;AAAA,IACxF;AAAA,EACF;AAGA,QAAM,QAAQ,gBAAgB,QAAQ,UAAU;AAChD,QAAM,aAAa,QAAQ,cAAc;AACzC,SAAO,CAAC,KAAK,OAAO,CAAC,GAAG,WAAW,IAAI,MAAM,MAAM,OAAO,UAAU,CAAC;AACvE;AASO,SAAS,QAAQ,QAAwC;AAC9D,QAAM,UAAU,aAAa,OAAO,OAAO,OAAO,QAAQ;AAC1D,QAAM,YAAY,eAAe,OAAO,OAAO;AAE/C,QAAM,OAAwB;AAAA,IAC5B,MAAM,OAAO;AAAA,IACb,UAAU,OAAO;AAAA,IACjB,QAAQ,OAAO;AAAA,IACf,UAAU,OAAO;AAAA,IACjB,cAAc,OAAO;AAAA,IACrB,KAAK,OAAO;AAAA,IACZ,UAAU,OAAO;AAAA,IACjB,SAAS,KAAmB,IAAwC;AAClE,UAAI,CAAC,QAAQ,IAAI,MAA6B,GAAG,EAAG,QAAO;AAC3D,YAAM,MAAM,UAAU,KAAK,EAAE;AAC7B,UAAI,CAAC,OAAO,IAAI,WAAW,EAAG,QAAO;AACrC,aAAO,EAAE,IAAI;AAAA,IACf;AAAA,EACF;AAGA,SAAO,cAAc,IAAI;AAC3B;;;AC5SA,SAAS,KAAK,MAAgD;AAC5D,QAAM,IAAI;AACV,SAAO,EAAE,SAAS,YAAa,IAAgC;AACjE;AAGA,SAASC,UAAS,MAA+B;AAC/C,SAAO,CAAC,SAAS,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AACjD;AAGA,IAAM,iBAAiBA,UAAS,gBAAgB;AAEhD,IAAM,+BAA+BA,UAAS,8BAA8B;AAE5E,IAAM,6BAA6BA,UAAS,4BAA4B;AAExE,IAAM,oBAAoBA,UAAS,mBAAmB;AAEtD,IAAM,2BAA2BA,UAAS,0BAA0B;AAOpE,IAAM,6BAAsC,CAAC,MAAM,QAAQ;AACzD,QAAM,KAAK,KAAK,IAAI;AACpB,MAAI,CAAC,GAAI,QAAO;AAChB,MAAI,GAAG,KAAK,2BAA4B,QAAO;AAC/C,SAAO,IAAI,UAAU,2BAA2B,GAAG,EAAyB;AAC9E;AAEA,IAAM,UAAU;AAOhB,IAAM,qBAA8B,CAAC,MAAM,QAAQ;AACjD,QAAM,KAAK,KAAK,IAAI;AACpB,MAAI,CAAC,GAAI,QAAO;AAChB,QAAM,KAAe,IAAI,WAAW,EAAyB,KAAM,GAAG;AACtE,aAAW,SAAS,GAAG,OAAO,OAAO,GAAG;AACtC,UAAM,OAAO,MAAM,MAAM,IAAI,OAAO;AACpC,QAAI,QAAQ,OAAO,KAAK,KAAK,MAAM,QAAS,QAAO;AAAA,EACrD;AACA,SAAO;AACT;AAOO,IAAM,gBAAgB,QAAQ;AAAA,EACnC,MAAM;AAAA,EACN,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,IAEF,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,iBACE;AAAA,EAIJ;AAAA,EACA,OAAO;AAAA,IACL,KAAK;AAAA,IACL,WAAW;AAAA,IACX,eAAe;AAAA,IACf,OAAO;AAAA,MACL,IAAI,kBAAkB;AAAA,MACtB,IAAI,cAAc;AAAA,MAClB,IAAI,4BAA4B;AAAA,MAChC,IAAI,0BAA0B;AAAA,MAC9B,IAAI,iBAAiB;AAAA,MACrB,IAAI,wBAAwB;AAAA,MAC5B,IAAI,0BAA0B;AAAA,IAChC;AAAA,EACF;AAAA,EACA,SAAS,EAAE,aAAa,QAAQ;AAAA,EAChC,UAAU;AAAA,IACR;AAAA,MACE,QAAQ;AAAA,MACR,OAAO;AAAA,IACT;AAAA,IACA;AAAA;AAAA,MAEE,SAAS;AAAA,IACX;AAAA,EACF;AACF,CAAC;;;AC/GM,IAAM,oBAAoB,QAAQ;AAAA,EACvC,MAAM;AAAA,EACN,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,IAEF,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,iBACE;AAAA,EAEJ;AAAA,EACA,OAAO;AAAA,IACL,KAAK;AAAA,IACL,OAAO,EAAE,SAAS,QAAQ,YAAY,UAAU,gBAAgB,SAAS;AAAA,IACzE,WAAW;AAAA,IACX,eAAe;AAAA,EACjB;AAAA,EACA,SAAS;AAAA,IACP,aAAa;AAAA,IACb,YAAY,EAAE,WAAW,SAAS;AAAA,EACpC;AAAA,EACA,UAAU;AAAA,IACR;AAAA;AAAA;AAAA,MAGE,QACE;AAAA,MAGF,OAAO;AAAA,IACT;AAAA,IACA;AAAA;AAAA,MAEE,SACE;AAAA,IAGJ;AAAA,EACF;AACF,CAAC;;;ACjBD,SAAS,sBAAsB,OAAyD;AACtF,QAAM,MAAM,oBAAI,IAA4B;AAC5C,aAAW,CAAC,MAAM,KAAK,KAAK,OAAO;AACjC,eAAW,QAAQ,WAAW,qBAAqB,MAAM,OAAO,KAAK,GAAG;AACtE,UAAI,IAAI,KAAK,UAAU,IAAI;AAAA,IAC7B;AAAA,EACF;AACA,QAAM,QAAoB,EAAE,WAAW,gBAAgB,OAAO,IAAI;AAClE,QAAM,SAAS,oBAAI,IAA8B,CAAC,CAAC,aAAa,cAAc,GAAG,KAAK,CAAC,CAAC;AACxF,SAAO,EAAE,OAAO;AAClB;AAGA,IAAM,eAAyB,sBAAsB,CAAC,CAAC,WAAW,MAAM,CAAC,CAAC;AAM1E,IAAM,4BAAiD,oBAAI,IAAY;AAAA,EACrE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AASD,SAAS,eAAe,IAAuB;AAC7C,QAAM,OAAO,WAAW,kBAAkB,EAAE;AAC5C,aAAW,SAAS,KAAK,OAAO,OAAO,GAAG;AACxC,eAAW,QAAQ,MAAM,MAAM,OAAO,GAAG;AACvC,UAAI,0BAA0B,IAAI,OAAO,KAAK,QAAQ,CAAC,EAAG;AAC1D,UAAI,KAAK,UAAW;AACpB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAOA,SAAS,aAAa,OAAiB,OAA0B;AAC/D,QAAM,IAAI,WAAW,kBAAkB,KAAK;AAC5C,QAAM,IAAI,WAAW,kBAAkB,KAAK;AAC5C,aAAW,CAAC,KAAK,MAAM,KAAK,EAAE,QAAQ;AACpC,UAAM,SAAS,EAAE,OAAO,IAAI,GAAG;AAC/B,QAAI,CAAC,OAAQ;AACb,eAAW,CAAC,MAAM,KAAK,KAAK,OAAO,OAAO;AACxC,UAAI,CAAC,0BAA0B,IAAI,OAAO,IAAI,CAAC,EAAG;AAClD,YAAM,QAAQ,OAAO,MAAM,IAAI,IAAI;AACnC,UAAI,SAAS,MAAM,UAAU,MAAM,MAAO,QAAO;AAAA,IACnD;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,iBAAiB,IAAwB;AAChD,QAAM,SAAS,oBAAI,IAA8B;AACjD,aAAW,CAAC,KAAK,KAAK,KAAK,GAAG,QAAQ;AACpC,UAAM,QAAQ,oBAAI,IAA4B;AAC9C,eAAW,CAAC,MAAM,IAAI,KAAK,MAAM,OAAO;AACtC,UAAI,0BAA0B,IAAI,OAAO,IAAI,CAAC,EAAG,OAAM,IAAI,MAAM,IAAI;AAAA,IACvE;AACA,QAAI,MAAM,OAAO,EAAG,QAAO,IAAI,KAAK,EAAE,WAAW,MAAM,WAAW,MAAM,CAAC;AAAA,EAC3E;AACA,SAAO,EAAE,OAAO;AAClB;AAGA,IAAM,cAAuB;AAAA,EAC3B,UAAU,KAAK;AAAA,EACf,SAAS,YAAY;AAAA,EACrB,IAAI,oBAAoB;AAC1B;AAOO,IAAM,kBAAkB,QAAQ;AAAA,EACrC,MAAM;AAAA,EACN,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,IAGF,QACE;AAAA,IAEF,OAAO;AAAA,IACP,iBACE;AAAA,EAGJ;AAAA,EACA,OAAO;AAAA,IACL,KAAK;AAAA,IACL,OAAO,EAAE,SAAS,OAAO;AAAA,IACzB,WAAW;AAAA,IACX,eAAe;AAAA,EACjB;AAAA,EACA,SAAS,CAAC,KAAmB,OAAyD;AACpF,UAAM,QAAQ,IAAI;AAClB,UAAM,QAAQ,IAAI,iBAAiB;AACnC,QAAI,CAAC,MAAO,QAAO;AACnB,QAAI,CAAC,YAAY,OAA8B,GAAG,EAAG,QAAO;AAE5D,UAAM,aAAa,IAAI,SAAS;AAChC,UAAM,aAAa,IAAI,WAAW,KAA4B;AAG9D,QAAI,CAAC,eAAe,UAAU,EAAG,QAAO;AAExC,QAAI,aAAa,YAAY,UAAU,EAAG,QAAO;AAEjD,WAAO;AAAA;AAAA,MAEL,GAAG,oBAAoB,OAAO,OAAO,EAAE,YAAY,MAAM,CAAC;AAAA;AAAA;AAAA,MAG1D,GAAG,WAAW,OAAO,MAAM,iBAAiB,UAAU,GAAG,aAAa;AAAA;AAAA,MAEtE,GAAG,OAAO,KAAK;AAAA,IACjB;AAAA,EACF;AAAA,EACA,UAAU;AAAA,IACR;AAAA;AAAA;AAAA;AAAA,MAIE,QACE;AAAA,MAGF,OAAO;AAAA,IACT;AAAA,IACA;AAAA;AAAA,MAEE,SACE;AAAA,IAGJ;AAAA,EACF;AACF,CAAC;;;ACrLD,SAAS,OAAO,MAA+C;AAC7D,QAAM,IAAI;AACV,SAAO,EAAE,SAAS,YAAa,EAA8B,OAAO;AACtE;AAEA,SAAS,UAAU,MAAgD;AACjE,QAAM,IAAI;AACV,SAAO,EAAE,SAAS,YAAa,IAAgC;AACjE;AAOA,IAAM,qBAA8B,CAAC,SAAS;AAC5C,QAAM,IAAI,OAAO,IAAI;AACrB,MAAI,CAAC,EAAG,QAAO;AACf,SACE,EAAE,kBACF,EAAE,gCACF,EAAE,8BACF,EAAE,qBACF,EAAE;AAEN;AAGA,IAAM,iBAA0B,CAAC,SAAS,OAAO,IAAI,GAAG,kBAAkB;AAC1E,IAAM,kBAA2B,CAAC,SAAS,OAAO,IAAI,GAAG,eAAe;AAGxE,IAAM,cAAuB,CAAC,SAAS;AACrC,QAAM,KAAK,UAAU,IAAI;AACzB,MAAI,CAAC,GAAI,QAAO;AAChB,SAAO,GAAG,MAAM,QAAQ,OAAO,KAAK,GAAG,MAAM,QAAQ,SAAS;AAChE;AAMA,IAAMC,8BAAsC,CAAC,MAAM,QAAQ;AACzD,QAAM,KAAK,UAAU,IAAI;AACzB,MAAI,CAAC,GAAI,QAAO;AAChB,MAAI,GAAG,KAAK,2BAA4B,QAAO;AAC/C,SAAO,IAAI,UAAU,2BAA2B,GAAG,EAAyB;AAC9E;AAQO,IAAM,qBAAqB,QAAQ;AAAA,EACxC,MAAM;AAAA,EACN,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,IAEF,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,iBACE;AAAA,EAIJ;AAAA,EACA,OAAO;AAAA,IACL,KAAK;AAAA,IACL,WAAW;AAAA,IACX,eAAe;AAAA,IACf,OAAO;AAAA,MACL,IAAI,kBAAkB;AAAA,MACtB,IAAI,WAAW;AAAA,MACf,IAAI,iBAAiB;AAAA,MACrB,IAAI,cAAc;AAAA,MAClB,IAAI,eAAe;AAAA,MACnB,IAAIA,2BAA0B;AAAA,IAChC;AAAA,EACF;AAAA,EACA,SAAS,EAAE,aAAa,QAAQ;AAAA,EAChC,UAAU;AAAA,IACR;AAAA,MACE,QAAQ;AAAA,MACR,OAAO;AAAA,IACT;AAAA,IACA;AAAA;AAAA,MAEE,SAAS;AAAA,IACX;AAAA,EACF;AACF,CAAC;;;AC5FD,SAAS,0BAA0B,MAAgB,KAA4B;AAC7E,QAAM,KAAK;AACX,MAAI,GAAG,SAAS,UAAW,QAAO;AAElC,QAAM,WAAW,GAAG;AACpB,MAAI,YAAY,KAAM,QAAO;AAE7B,QAAM,SAAS,IAAI,IAAI,MAAM,IAAI,QAAQ;AACzC,MAAI,CAAC,UAAU,OAAO,SAAS,WAAY,QAAO;AAGlD,MAAI,OAAO,UAAU,KAAM,QAAO;AAGlC,MAAI,OAAO,SAAS,WAAW,EAAG,QAAO;AAIzC,QAAM,IAAI,OAAO;AACjB,MACE,EAAE,UACF,EAAE,UACF,EAAE,oBACF,EAAE,sBACF,EAAE,oBACF,EAAE,kBACF,EAAE,aACF;AACA,WAAO;AAAA,EACT;AAIA,MAAI,EAAE,wBAAwB,EAAE,2BAA4B,QAAO;AACnE,QAAM,MAAM;AACZ,MAAI,IAAI,UAAU,qBAAqB,GAAG,KAAK,IAAI,UAAU,2BAA2B,GAAG,GAAG;AAC5F,WAAO;AAAA,EACT;AACA,MAAI,IAAI,UAAU,eAAe,GAAG,EAAE,OAAO,EAAG,QAAO;AAEvD,SAAO;AACT;AASO,IAAM,oBAAoB,QAAQ;AAAA,EACvC,MAAM;AAAA,EACN,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,IAEF,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,iBACE;AAAA,EAGJ;AAAA,EACA,OAAO;AAAA,EACP,SAAS,CAAC,KAAmB,OAAyD;AACpF,UAAM,WAAW,IAAI,KAAK;AAC1B,QAAI,YAAY,KAAM,QAAO;AAC7B,UAAM,WAAW,IAAI,IAAI,MAAM,IAAI,QAAQ;AAC3C,QAAI,CAAC,YAAY,SAAS,SAAS,WAAY,QAAO;AAEtD,WAAO,CAAC,GAAG,OAAO,QAAkC,CAAC;AAAA,EACvD;AAAA,EACA,UAAU;AAAA,IACR;AAAA,MACE,QAAQ;AAAA,MACR,OAAO;AAAA,IACT;AAAA,IACA;AAAA;AAAA,MAEE,SACE;AAAA,IACJ;AAAA,EACF;AACF,CAAC;;;AC1ED,SAASC,WAAU,MAAgD;AACjE,QAAM,IAAI;AACV,SAAO,EAAE,SAAS,YAAa,IAAgC;AACjE;AAGA,IAAM,mBAA4B,CAAC,SAASA,WAAU,IAAI,GAAG,KAAK,oBAAoB;AAGtF,IAAM,WAAoB,CAAC,MAAM,QAAQ,IAAI,SAAS,IAAmB;AAKzE,SAAS,qBAAqBC,WAG5B;AACA,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,SAASA,UAAS,OAAO,OAAO,GAAG;AAC5C,eAAW,QAAQ,MAAM,MAAM,OAAO,GAAG;AACvC,UAAI,KAAK,UAAU,KAAK,OAAO,SAAS,QAAS,SAAQ,IAAI,KAAK,OAAO,SAAS;AAClF,iBAAW,KAAK,KAAK,YAAY,CAAC,GAAG;AACnC,YAAI,EAAE,SAAS,QAAS,UAAS,IAAI,EAAE,SAAS;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,SAAS,SAAS;AAC7B;AAQO,IAAM,gBAAgB,QAAQ;AAAA,EACnC,MAAM;AAAA,EACN,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,IAEF,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,iBACE;AAAA,EAGJ;AAAA,EACA,OAAO;AAAA,IACL,OAAO;AAAA,MACL,IAAI,MAAM;AAAA,MACV,IAAI,gBAAgB;AAAA,MACpB,IAAI,kBAAkB;AAAA,MACtB,IAAI,gBAAgB;AAAA,MACpB,IAAI,iBAAiB;AAAA,MACrB,IAAI,QAAQ;AAAA,MACZ,IAAI,oBAAoB;AAAA,IAC1B;AAAA,EACF;AAAA,EACA,SAAS;AAAA,IACP,YAAYA,WAAoB,KAAqC;AACnE,YAAM,EAAE,SAAS,SAAS,IAAI,qBAAqBA,SAAQ;AAC3D,YAAM,OAAO,oBAAI,IAAY;AAC7B,iBAAW,OAAO,UAAU;AAE1B,YAAI,QAAQ,IAAI,GAAG,EAAG;AAEtB,YAAI,CAAC,IAAI,SAAS,cAAc,GAAG,EAAE,UAAW;AAChD,aAAK,IAAI,GAAG;AAAA,MACd;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EACA,UAAU;AAAA,IACR;AAAA;AAAA;AAAA;AAAA,MAIE,QAAQ;AAAA,MACR,OAAO;AAAA,IACT;AAAA,IACA;AAAA;AAAA,MAEE,SAAS;AAAA,IACX;AAAA,EACF;AACF,CAAC;;;AC9FD,IAAM,MAAM;AACZ,IAAM,QAAQ;AACd,IAAM,SAAS;AACf,IAAM,OAAO;AACb,IAAM,QAAQ;AACd,IAAM,cAAc;AACpB,IAAM,eAAe;AAKrB,IAAMC,cAAsB,CAAC,SAAS;AACpC,QAAM,IAAI;AACV,SAAO,EAAE,SAAS,YAAa,EAA8B,KAAK,mBAAmB;AACvF;AAKA,SAAS,SAAS,GAA0B,GAAmC;AAC7E,SAAO,MAAM,UAAa,MAAM,UAAa,EAAE,UAAU,EAAE,SAAS,EAAE,cAAc,EAAE;AACxF;AAGA,SAAS,WAAW,KAAgB,UAAkC;AACpE,SAAO,EAAE,GAAG,KAAK,UAAU,WAAW,WAAW,UAAU,YAAY,QAAQ,EAAE;AACnF;AAGA,SAAS,cAAc,KAAe,WAA0D;AAC9F,QAAM,SAAS,oBAAI,IAA8B;AACjD,aAAW,CAAC,KAAK,KAAK,KAAK,IAAI,QAAQ;AACrC,UAAM,QACJ,QAAQ,qBAAqB,YAAY,IAAI,IAA4B,MAAM,KAAK;AACtF,WAAO,IAAI,KAAK,EAAE,WAAW,MAAM,WAAW,MAAM,CAAC;AAAA,EACvD;AACA,SAAO,EAAE,OAAO;AAClB;AAQO,IAAM,iBAAiB,QAAQ;AAAA,EACpC,MAAM;AAAA,EACN,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,IAEF,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,iBACE;AAAA,EAEJ;AAAA,EACA,OAAO;AAAA,IACL,OAAO;AAAA,MACL,IAAI,MAAM;AAAA,MACV,IAAI,gBAAgB;AAAA,MACpB,IAAI,kBAAkB;AAAA,MACtB,IAAIA,WAAU;AAAA,MACd,IAAI,iBAAiB;AAAA,MACrB,IAAI,oBAAoB;AAAA,IAC1B;AAAA,EACF;AAAA,EACA,SAAS;AAAA,IACP,eAAeC,WAAqC;AAClD,YAAM,OAAOA,UAAS,OAAO,IAAI,kBAAkB;AACnD,UAAI,CAAC,KAAM,QAAO;AAElB,YAAM,MAAM,KAAK,MAAM,IAAI,GAAG;AAC9B,YAAM,QAAQ,KAAK,MAAM,IAAI,KAAK;AAClC,YAAM,SAAS,KAAK,MAAM,IAAI,MAAM;AACpC,YAAM,OAAO,KAAK,MAAM,IAAI,IAAI;AAEhC,YAAM,OAAO,IAAI,IAA4B,KAAK,KAAK;AAGvD,UAAI,OAAO,SAAS,KAAK,KAAK,KAAK,SAAS,KAAK,MAAM,KAAK,SAAS,KAAK,IAAI,GAAG;AAC/E,aAAK,OAAO,GAAG;AACf,aAAK,OAAO,KAAK;AACjB,aAAK,OAAO,MAAM;AAClB,aAAK,OAAO,IAAI;AAChB,aAAK,IAAI,OAAO,WAAW,KAAK,KAAK,CAAC;AAAA,MACxC,OAAO;AACL,YAAI,YAAY;AAEhB,YAAI,SAAS,KAAK,MAAM,GAAG;AACzB,eAAK,OAAO,GAAG;AACf,eAAK,OAAO,MAAM;AAClB,eAAK,IAAI,aAAa,WAAW,KAAM,WAAW,CAAC;AACnD,sBAAY;AAAA,QACd;AAEA,YAAI,SAAS,MAAM,KAAK,GAAG;AACzB,eAAK,OAAO,IAAI;AAChB,eAAK,OAAO,KAAK;AACjB,eAAK,IAAI,cAAc,WAAW,MAAO,YAAY,CAAC;AACtD,sBAAY;AAAA,QACd;AACA,YAAI,CAAC,UAAW,QAAO;AAAA,MACzB;AAEA,aAAO,cAAcA,WAAU,IAAI;AAAA,IACrC;AAAA,EACF;AAAA,EACA,UAAU;AAAA,IACR;AAAA;AAAA;AAAA;AAAA,MAIE,QAAQ;AAAA,MACR,OAAO;AAAA,IACT;AAAA,IACA;AAAA;AAAA,MAEE,SAAS;AAAA,IACX;AAAA,EACF;AACF,CAAC;;;ACrHD,IAAM,eAAe;AAAA,EACnB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,kBAAuC,IAAI,IAAI,YAAY;AAEjE,IAAM,WAAyB,aAAa,cAAc;AAE1D,SAASC,WAAU,MAAgD;AACjE,QAAM,IAAI;AACV,SAAO,EAAE,SAAS,YAAa,IAAgC;AACjE;AAGA,IAAMC,oBAA4B,CAAC,SAASD,WAAU,IAAI,GAAG,KAAK,oBAAoB;AAGtF,SAAS,oBAAoB,KAAa,OAAe,QAAgB,MAAsB;AAC7F,MAAI,UAAU,MAAM;AAClB,QAAI,QAAQ,QAAQ;AAClB,aAAO,QAAQ,QAAQ,MAAM,GAAG,GAAG,IAAI,KAAK;AAAA,IAC9C;AACA,WAAO,GAAG,GAAG,IAAI,KAAK,IAAI,MAAM;AAAA,EAClC;AACA,SAAO,GAAG,GAAG,IAAI,KAAK,IAAI,MAAM,IAAI,IAAI;AAC1C;AAGA,SAAS,iBAAiB,IAAc,YAAiC;AACvE,QAAM,SAAS,oBAAI,IAA8B;AACjD,aAAW,CAAC,KAAK,KAAK,KAAK,GAAG,QAAQ;AACpC,QAAI,QAAQ,UAAU;AACpB,aAAO,IAAI,KAAK,KAAK;AACrB;AAAA,IACF;AACA,UAAM,QAAQ,oBAAI,IAA4B;AAC9C,eAAW,CAAC,MAAM,IAAI,KAAK,MAAM,OAAO;AACtC,UAAI,CAAC,gBAAgB,IAAI,OAAO,IAAI,CAAC,EAAG,OAAM,IAAI,MAAM,IAAI;AAAA,IAC9D;AACA,UAAM,IAAI,WAAW,UAAU,UAAU;AACzC,WAAO,IAAI,KAAK,EAAE,WAAW,MAAM,WAAW,MAAM,CAAC;AAAA,EACvD;AACA,SAAO,EAAE,OAAO;AAClB;AAOO,IAAM,kBAAkB,QAAQ;AAAA,EACrC,MAAM;AAAA,EACN,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,IAEF,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,iBACE;AAAA,EAEJ;AAAA,EACA,OAAO;AAAA,IACL,OAAO;AAAA,MACL,IAAI,MAAM;AAAA,MACV,IAAI,gBAAgB;AAAA,MACpB,IAAI,kBAAkB;AAAA,MACtB,IAAI,iBAAiB;AAAA,MACrB,IAAIC,iBAAgB;AAAA,MACpB,IAAI,oBAAoB;AAAA,IAC1B;AAAA,EACF;AAAA,EACA,SAAS;AAAA,IACP,eAAeC,WAAqC;AAClD,YAAM,OAAOA,UAAS,OAAO,IAAI,QAAQ;AACzC,UAAI,CAAC,KAAM,QAAO;AAGlB,YAAM,QAAQ,aAAa,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,CAAgB,CAAC;AACtE,UAAI,MAAM,KAAK,CAAC,MAAM,MAAM,MAAS,EAAG,QAAO;AAC/C,YAAM,CAAC,IAAI,IAAI,IAAI,EAAE,IAAI;AAGzB,UAAI,GAAG,aAAa,GAAG,aAAa,GAAG,aAAa,GAAG,UAAW,QAAO;AAEzE,YAAM,QAAQ;AAAA,QACZ,OAAO,GAAG,KAAK;AAAA,QACf,OAAO,GAAG,KAAK;AAAA,QACf,OAAO,GAAG,KAAK;AAAA,QACf,OAAO,GAAG,KAAK;AAAA,MACjB;AAEA,YAAM,aAAwB;AAAA,QAC5B,UAAU;AAAA,QACV;AAAA,QACA,WAAW;AAAA,QACX,kBACE,GAAG,oBAAoB,GAAG,oBAAoB,GAAG,oBAAoB,GAAG;AAAA,QAC1E,WAAW;AAAA;AAAA,MACb;AAEA,aAAO,iBAAiBA,WAAU,UAAU;AAAA,IAC9C;AAAA,EACF;AAAA,EACA,UAAU;AAAA,IACR;AAAA;AAAA;AAAA;AAAA,MAIE,QAAQ;AAAA,MACR,OAAO;AAAA,IACT;AAAA,IACA;AAAA;AAAA,MAEE,SAAS;AAAA,IACX;AAAA,EACF;AACF,CAAC;;;AC/HD,IAAM,gBAAgB;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,mBAAwC,IAAI,IAAY,aAAa;AAE3E,IAAMC,YAAyB,aAAa,cAAc;AAc1D,SAAS,eAAe,IAAkC;AACxD,QAAM,QAAQ,GAAG,OAAO,IAAIA,SAAQ;AACpC,MAAI,CAAC,MAAO,QAAO;AAEnB,QAAM,QAAqB,CAAC;AAC5B,aAAW,QAAQ,eAAe;AAChC,UAAM,OAAO,MAAM,MAAM,IAAI,IAAmB;AAChD,QAAI,CAAC,KAAM,QAAO;AAClB,UAAM,KAAK,IAAI;AAAA,EACjB;AACA,QAAM,CAAC,KAAK,OAAO,QAAQ,IAAI,IAAI;AAGnC,MACE,EACE,IAAI,cAAc,MAAM,aACxB,MAAM,cAAc,OAAO,aAC3B,OAAO,cAAc,KAAK,YAE5B;AACA,WAAO;AAAA,EACT;AAEA,QAAM,KAAK,OAAO,IAAI,KAAK;AAC3B,QAAM,KAAK,OAAO,MAAM,KAAK;AAC7B,QAAM,KAAK,OAAO,OAAO,KAAK;AAC9B,QAAM,KAAK,OAAO,KAAK,KAAK;AAG5B,MAAI,OAAO,MAAM,OAAO,GAAI,QAAO;AAEnC,QAAM,QAAQ,OAAO,KAAK,KAAK,GAAG,EAAE,IAAI,EAAE;AAC1C,QAAM,WAAW,MAAM,KAAK,CAAC,MAAM,EAAE,gBAAgB;AACrD,SAAO,EAAE,OAAO,WAAW,IAAI,WAAW,SAAS;AACrD;AAKA,IAAM,UAAmB,CAAC,SAAS;AACjC,QAAM,IAAI;AACV,MAAI,EAAE,SAAS,UAAW,QAAO;AACjC,QAAM,KAAK;AACX,SAAO,CAAC,GAAG,KAAK,oBAAoB,CAAC,GAAG,KAAK,kBAAkB,CAAC,GAAG;AACrE;AAKA,SAAS,kBAAkB,IAAc,MAA6B;AACpE,QAAM,SAAS,oBAAI,IAA8B;AACjD,aAAW,CAAC,KAAK,KAAK,KAAK,GAAG,QAAQ;AACpC,QAAI,QAAQA,WAAU;AACpB,aAAO,IAAI,KAAK,KAAK;AACrB;AAAA,IACF;AACA,UAAM,QAAQ,oBAAI,IAA4B;AAC9C,eAAW,CAAC,MAAM,IAAI,KAAK,MAAM,OAAO;AACtC,UAAI,iBAAiB,IAAI,OAAO,IAAI,CAAC,EAAG;AACxC,YAAM,IAAI,MAAM,IAAI;AAAA,IACtB;AACA,UAAM,YAAuB;AAAA,MAC3B,UAAU;AAAA,MACV,OAAO,KAAK;AAAA,MACZ,WAAW,KAAK;AAAA,MAChB,kBAAkB,KAAK;AAAA,MACvB,WAAW;AAAA;AAAA,IACb;AACA,UAAM,IAAI,UAAU,UAAU,SAAS;AACvC,WAAO,IAAI,KAAK,EAAE,WAAW,MAAM,WAAW,MAAM,CAAC;AAAA,EACvD;AACA,SAAO,EAAE,OAAO;AAClB;AAOO,IAAM,mBAAmB,QAAQ;AAAA,EACtC,MAAM;AAAA,EACN,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,IAEF,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,iBACE;AAAA,EAGJ;AAAA,EACA,OAAO;AAAA,IACL,OAAO;AAAA,MACL,IAAI,MAAM;AAAA,MACV,IAAI,gBAAgB;AAAA,MACpB,IAAI,kBAAkB;AAAA,MACtB,IAAI,iBAAiB;AAAA,MACrB,IAAI,oBAAoB;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAAA,EACA,SAAS;AAAA,IACP,eAAeC,WAAqC;AAClD,YAAM,OAAO,eAAeA,SAAQ;AACpC,aAAO,OAAO,kBAAkBA,WAAU,IAAI,IAAI;AAAA,IACpD;AAAA,EACF;AAAA,EACA,UAAU;AAAA,IACR;AAAA;AAAA;AAAA;AAAA,MAIE,QAAQ;AAAA,MACR,OAAO;AAAA,IACT;AAAA,IACA;AAAA;AAAA,MAEE,SAAS;AAAA,IACX;AAAA,EACF;AACF,CAAC;;;ACvJD,IAAM,QAAQ;AACd,IAAM,SAAS;AACf,IAAM,OAAO;AAGb,IAAM,yBAA8C,oBAAI,IAAY,CAAC,QAAQ,WAAW,OAAO,CAAC;AAIhG,SAASC,WAAU,MAAgD;AACjE,QAAM,IAAI;AACV,SAAO,EAAE,SAAS,YAAa,IAAgC;AACjE;AAGA,SAAS,UAAU,IAAsC;AACvD,SAAO,GAAG,OAAO,IAAI,aAAa,cAAc,CAAC;AACnD;AAGA,IAAMC,oBAA4B,CAAC,SAASD,WAAU,IAAI,GAAG,KAAK,oBAAoB;AAMtF,SAAS,kBAAkB,IAAc,OAAe,WAA8B;AACpF,QAAM,UAAU,aAAa,cAAc;AAC3C,QAAM,SAAS,oBAAI,IAA8B;AACjD,aAAW,CAAC,KAAK,KAAK,KAAK,GAAG,QAAQ;AACpC,QAAI,QAAQ,SAAS;AACnB,aAAO,IAAI,KAAK,KAAK;AACrB;AAAA,IACF;AACA,UAAM,QAAQ,IAAI,IAA4B,MAAM,KAAK;AACzD,UAAM,OAAO,KAAK;AAClB,UAAM,OAAO,MAAM;AACnB,eAAW,QAAQ,WAAW,qBAAqB,OAAO,IAAI,GAAG,OAAO,SAAS,GAAG;AAClF,YAAM,IAAI,KAAK,UAAU,IAAI;AAAA,IAC/B;AACA,WAAO,IAAI,KAAK,EAAE,WAAW,MAAM,WAAW,MAAM,CAAC;AAAA,EACvD;AACA,SAAO,EAAE,OAAO;AAClB;AAKO,IAAM,gBAAgB,QAAQ;AAAA,EACnC,MAAM;AAAA,EACN,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,IAEF,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,iBACE;AAAA,EAEJ;AAAA,EACA,OAAO;AAAA,IACL,OAAO;AAAA,MACL,IAAI,MAAM;AAAA,MACV,IAAI,gBAAgB;AAAA,MACpB,IAAI,kBAAkB;AAAA,MACtB,IAAIC,iBAAgB;AAAA,MACpB,IAAI,iBAAiB;AAAA,MACrB,IAAI,oBAAoB;AAAA,IAC1B;AAAA,EACF;AAAA,EACA,SAAS;AAAA,IACP,eAAeC,WAAqC;AAClD,YAAM,OAAO,UAAUA,SAAQ;AAC/B,YAAM,IAAI,MAAM,MAAM,IAAI,KAAK;AAC/B,YAAM,IAAI,MAAM,MAAM,IAAI,MAAM;AAChC,UAAI,CAAC,KAAK,CAAC,EAAG,QAAO;AACrB,UAAI,EAAE,cAAc,EAAE,UAAW,QAAO;AACxC,UAAI,uBAAuB,IAAI,OAAO,EAAE,KAAK,CAAC,EAAG,QAAO;AACxD,UAAI,EAAE,UAAU,EAAE,MAAO,QAAO;AAChC,aAAO,kBAAkBA,WAAU,OAAO,EAAE,KAAK,GAAG,EAAE,SAAS;AAAA,IACjE;AAAA,EACF;AAAA,EACA,UAAU;AAAA,IACR;AAAA;AAAA;AAAA;AAAA,MAIE,QAAQ;AAAA,MACR,OAAO;AAAA,IACT;AAAA,IACA;AAAA;AAAA,MAEE,SAAS;AAAA,IACX;AAAA,EACF;AACF,CAAC;;;AC5GM,IAAM,kBAAsC;AAAA,EACjD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;;;ACvBA,oBAAoC;AACpC,sBAA0B;AAyD1B,IAAM,WACJ,OAAO,gBAAAC,YAAkB,aACrB,gBAAAA,UACC,gBAAAA,QAA+D;AAItE,IAAM,YAAiC,CAAC,OAAO,KAAK;AAGpD,IAAM,UAAU;AAYhB,SAAS,QAAQ,MAAuB;AACtC,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO,KAAK;AAAA,IACd,KAAK;AACH,aAAO,GAAG,QAAQ,KAAK,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI;AAAA,IACtD,KAAK;AACH,aAAO,GAAG,KAAK,UAAU,IAAI,IAAI,KAAK,KAAK,IAAI;AAAA,EACnD;AACF;AAGA,SAAS,gBAAgB,MAAwB;AAC/C,MAAI,KAAK,SAAS,sBAAuB,QAAO;AAChD,MAAI,KAAK,SAAS,oBAAqB,QAAO;AAC9C,SAAO,SAAS,KAAK,KAAK,IAAI;AAChC;AAEA,SAAS,SAAS,MAAoC;AACpD,SAAO,KAAK,SAAS,sBACjB,GAAG,KAAK,UAAU,IAAI,IAAI,KAAK,KAAK,IAAI,KACxC,KAAK;AACX;AAEA,SAAS,SAAS,MAA2B;AAC3C,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAGA,SAAS,YAAY,MAAgC;AACnD,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAIA,SAAS,aAAa,IAAY,MAAuB;AACvD,MAAI,aAAa,KAAK,EAAE,EAAG,QAAO;AAClC,SAAO,yBAAyB,KAAK,IAAI;AAC3C;AAEA,SAAS,QAAQ,MAAc,KAAwC;AACrE,QAAM,cAA4B,CAAC;AACnC,QAAM,MAAkB,eAAe,KAAK;AAC5C,QAAM,UAAU,IAAI;AAEpB,QAAM,UAAM,cAAAC,OAAW,MAAM;AAAA,IAC3B,YAAY;AAAA,IACZ,SAAS,CAAC,OAAO,YAAY;AAAA,EAC/B,CAAC;AAED,QAAM,MAAqB,KAAK,SAAS,MAAM,IAAI,SAAS;AAC5D,QAAM,aAAyB;AAAA,IAC7B,IAAI;AAAA,IACJ,MAAM,IAAI;AAAA,IACV,MAAM;AAAA,IACN,UAAU;AAAA,IACV;AAAA,IACA,YAAY;AAAA,IACZ,QAAQ;AAAA,EACV;AACA,MAAI,QAAQ,IAAI,SAAS,UAAU;AAInC,QAAM,SAAS,CAAC,SAAuC;AACrD,QAAI,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAM,QAAO;AACnD,UAAM,OAAmB;AAAA,MACvB,MAAM;AAAA,MACN,OAAO,KAAK;AAAA,MACZ,KAAK,KAAK;AAAA,MACV,UAAU,KAAK,MACX,EAAE,MAAM,KAAK,IAAI,MAAM,MAAM,QAAQ,KAAK,IAAI,MAAM,OAAO,IAC3D;AAAA,MACJ,QAAQ,KAAK,MAAM,EAAE,MAAM,KAAK,IAAI,IAAI,MAAM,QAAQ,KAAK,IAAI,IAAI,OAAO,IAAI;AAAA,IAChF;AACA,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,CAAC,SACf,KAAK,SAAS,QAAQ,KAAK,OAAO,OAAO,KAAK,KAAK,MAAM,KAAK,OAAO,KAAK,GAAG;AAG/E,QAAM,aAAa,CAAC,MAAuC,WAA6B;AACtF,UAAM,UAAuB,EAAE,MAAM,QAAQ,IAAI,GAAG,OAAO;AAC3D,WAAO,IAAI,MAAM,OAAO;AAAA,MACtB,MAAM,OAAO,IAAI,KAAK,EAAE,MAAM,SAAS,OAAO,GAAG,KAAK,EAAE;AAAA,MACxD,MAAM,SAAS,IAAI;AAAA,MACnB;AAAA,IACF,CAAC;AAAA,EACH;AAIA,QAAM,cAAc,CAAC,QACnB,IACG,MAAM,KAAK,EACX,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,EAC1B,IAAI,CAAC,WAAW,EAAE,MAAM,EAAgB;AAE7C,QAAM,iBAAiB,CAAC,SAAkC;AACxD,UAAM,WAAW,OAAO,IAAI,KAAK;AACjC,UAAM,IAAI,KAAK;AAEf,UAAM,aAAa,CAAC,QAAsB,cAA4C;AACpF,YAAM,MAAoB,EAAE,MAAM,UAAU,MAAM,aAAa,QAAW,OAAO;AACjF,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,CAAC,GAAG;AAAA,QACd;AAAA,QACA;AAAA,QACA,YAAY;AAAA,QACZ,QAAQ;AAAA,QACR,YAAY;AAAA,MACd;AAAA,IACF;AAEA,QAAI,KAAK,KAAM,QAAO,WAAW,CAAC,GAAG,IAAI;AAEzC,QAAI,EAAE,SAAS,iBAAiB;AAC9B,aAAO,WAAW,YAAY,EAAE,KAAK,GAAG,OAAO,CAAC,CAAC;AAAA,IACnD;AAEA,QAAI,EAAE,SAAS,0BAA0B;AACvC,YAAM,OAAO,EAAE;AAEf,UAAI,KAAK,SAAS,iBAAiB;AACjC,eAAO,WAAW,YAAY,KAAK,KAAK,GAAG,OAAO,IAAI,CAAC;AAAA,MACzD;AACA,UAAI,KAAK,SAAS,qBAAsB,QAAO,WAAW,CAAC,GAAG,IAAI;AAClE,YAAM,MAAM,WAAW,MAAM,KAAK;AAClC,YAAM,YAAY,OAAO,IAAI;AAC7B,YAAM,MAAoB,EAAE,MAAM,WAAW,MAAM,aAAa,QAAW,MAAM,IAAI;AACrF,aAAO;AAAA,QACL,MAAM,YAAY,IAAI;AAAA,QACtB,UAAU,CAAC,GAAG;AAAA,QACd;AAAA,QACA;AAAA,QACA,YAAY;AAAA,QACZ,QAAQ;AAAA,QACR,YAAY;AAAA,MACd;AAAA,IACF;AAEA,WAAO,eAAe;AAAA,EACxB;AAEA,QAAMC,kBAAiB,CAAC,YAAiC;AACvD,UAAM,MAAgB,CAAC;AACvB,eAAW,OAAO,QAAQ,UAAU;AAClC,UAAI,IAAI,SAAS,SAAU,YAAW,KAAK,IAAI,OAAQ,KAAI,KAAK,EAAE,KAAK;AAAA,IACzE;AACA,WAAO;AAAA,EACT;AAIA,QAAM,iBAAiB,CAAC,SAAkC;AACxD,UAAM,IAAI,KAAK;AACf,QAAI,KAAK,KAAM,QAAO,EAAE,MAAM,UAAU,OAAO,MAAM,MAAM,OAAO,IAAI,KAAK,OAAU;AACrF,QAAI,EAAE,SAAS,iBAAiB;AAC9B,aAAO,EAAE,MAAM,UAAU,OAAO,EAAE,OAAO,MAAM,OAAO,CAAC,KAAK,OAAU;AAAA,IACxE;AACA,QAAI,EAAE,SAAS,0BAA0B;AACvC,UAAI,EAAE,WAAW,SAAS,sBAAsB;AAC9C,eAAO,EAAE,MAAM,UAAU,OAAO,MAAM,MAAM,OAAO,CAAC,KAAK,OAAU;AAAA,MACrE;AACA,aAAO,EAAE,MAAM,WAAW,MAAM,WAAW,EAAE,YAAY,KAAK,GAAG,MAAM,OAAO,CAAC,KAAK,OAAU;AAAA,IAChG;AAEA,WAAO,EAAE,MAAM,WAAW,MAAM,WAAW,GAAiB,KAAK,GAAG,MAAM,OAAO,CAAC,KAAK,OAAU;AAAA,EACnG;AAIA,QAAM,aAAa,CAAC,MAAsC,aAAwC;AAChG,YAAQ,KAAK,MAAM;AAAA,MACjB,KAAK,WAAW;AACd,cAAM,KAAK,IAAI,MAAM,KAAK;AAC1B,YAAI,MAAM;AAAA,UACR;AAAA,UACA,WAAW,IAAI,KAAK,OAAO;AAAA,YACzB,QAAQ;AAAA,YACR,MAAM,OAAO,IAAI;AAAA,YACjB,aAAa,QAAQ,KAAK,KAAK,KAAK;AAAA,UACtC,CAAC;AAAA,QACH;AACA,eAAO;AAAA,MACT;AAAA,MACA,KAAK,0BAA0B;AAC7B,YAAI,KAAK,WAAW,SAAS,qBAAsB,QAAO;AAC1D,cAAM,KAAK,IAAI,MAAM,KAAK;AAC1B,cAAM,MAAM,WAAW,KAAK,YAAY,KAAK;AAC7C,YAAI,MAAM,IAAI,IAAI,WAAW,IAAI,KAAK,EAAE,QAAQ,UAAU,MAAM,OAAO,IAAI,EAAE,CAAC,CAAC;AAC/E,eAAO;AAAA,MACT;AAAA,MACA,KAAK,kBAAkB;AACrB,cAAM,KAAK,IAAI,MAAM,KAAK;AAC1B,cAAM,MAAM,WAAW,KAAK,YAAY,IAAI;AAC5C,YAAI,MAAM,IAAI,IAAI,WAAW,IAAI,KAAK,EAAE,QAAQ,UAAU,MAAM,OAAO,IAAI,EAAE,CAAC,CAAC;AAC/E,eAAO;AAAA,MACT;AAAA,MACA,KAAK;AACH,eAAO,aAAa,MAAM,QAAQ;AAAA,MACpC,KAAK;AACH,eAAO,cAAc,MAAM,QAAQ;AAAA,MACrC;AACE,eAAO;AAAA,IACX;AAAA,EACF;AAEA,QAAM,gBAAgB,CAAC,MAAmB,aAAiC;AACzE,UAAM,KAAK,IAAI,MAAM,KAAK;AAC1B,UAAM,WAAuB,CAAC;AAC9B,eAAW,KAAK,KAAK,UAAU;AAC7B,YAAM,MAAM,WAAW,GAAG,EAAE;AAC5B,UAAI,OAAO,KAAM,UAAS,KAAK,GAAG;AAAA,IACpC;AACA,QAAI,MAAM,IAAI,IAAI,eAAe,IAAI,EAAE,UAAU,QAAQ,UAAU,MAAM,OAAO,IAAI,EAAE,CAAC,CAAC;AACxF,YAAQ,IAAI,IAAI;AAAA,MACd,QAAQ;AAAA,MACR,MAAM,OAAO,IAAI,KAAK,EAAE,MAAM,SAAS,OAAO,GAAG,KAAK,EAAE;AAAA,MACxD,aAAa,OAAO,KAAK,eAAe;AAAA,MACxC,cAAc,OAAO,KAAK,eAAe;AAAA,MACzC,WAAW;AAAA,MACX,aAAa;AAAA,IACf,CAAC;AACD,WAAO;AAAA,EACT;AAEA,QAAM,eAAe,CAAC,MAAkB,aAAiC;AACvE,UAAM,KAAK,IAAI,MAAM,KAAK;AAC1B,UAAM,UAA6B,KAAK;AACxC,UAAM,MAAM,QAAQ,QAAQ,IAAI;AAChC,UAAM,YAAY,gBAAgB,QAAQ,IAAI;AAE9C,UAAM,OAAiB,YAAY;AACnC,SAAK,cAAc;AAEnB,QAAI,UAAqB,eAAe;AACxC,UAAM,UAAU,oBAAI,IAAuB;AAC3C,UAAM,QAAkB,CAAC;AACzB,UAAM,UAAqB,CAAC;AAE5B,eAAW,QAAQ,QAAQ,YAAY;AACrC,UAAI,KAAK,SAAS,sBAAsB;AACtC,gBAAQ,KAAK,WAAW,KAAK,UAAU,IAAI,CAAC;AAC5C,aAAK,iBAAiB;AACtB;AAAA,MACF;AACA,YAAM,OAAO,SAAS,KAAK,IAAI;AAC/B,UAAI,SAAS,eAAe,SAAS,SAAS;AAC5C,kBAAU,eAAe,IAAI;AAC7B;AAAA,MACF;AACA,UAAI,SAAS,MAAO,MAAK,SAAS;AAAA,eACzB,SAAS,MAAO,MAAK,SAAS;AAAA,eAC9B,SAAS,0BAA2B,MAAK,mBAAmB;AAAA,eAC5D,WAAW,KAAK,IAAI,EAAG,MAAK,mBAAmB;AACxD,cAAQ,IAAI,MAAM,eAAe,IAAI,CAAC;AACtC,YAAM,KAAK,IAAI;AAAA,IACjB;AAEA,UAAM,QAAiB,EAAE,SAAS,SAAS,MAAM;AAEjD,UAAM,WAAuB,CAAC;AAC9B,eAAW,KAAK,KAAK,UAAU;AAC7B,YAAM,MAAM,WAAW,GAAG,EAAE;AAC5B,UAAI,OAAO,KAAM,UAAS,KAAK,GAAG;AAAA,IACpC;AACA,eAAW,OAAO,UAAU;AAC1B,YAAM,KAAK,IAAI,MAAM,IAAI,GAAG;AAC5B,UAAI,MAAM,GAAG,SAAS,QAAQ;AAC5B,aAAK,qBAAqB;AAC1B;AAAA,MACF;AAAA,IACF;AAGA,QAAIC,YAAqB,cAAc;AACvC,QAAI,CAAC,QAAQ,YAAY;AACvB,YAAM,SAASD,gBAAe,OAAO;AACrC,UAAI,OAAO,SAAS,GAAG;AACrB,cAAM,MAAM,IAAI,SAAS,QAAQ;AAAA,UAC/B,SAAS;AAAA,UACT,SAAS,EAAE,SAAS,KAAK,WAAW,YAAY,SAAY,OAAO;AAAA,QACrE,CAAC;AACD,QAAAC,YAAW,IAAI,WAAW,kBAAkB,IAAI,MAAM;AACtD,mBAAW,KAAK,IAAI,UAAU;AAC5B,sBAAY,KAAK;AAAA,YACf,MAAM;AAAA,YACN,UAAU,EAAE;AAAA,YACZ,SAAS,EAAE;AAAA,YACX,QAAQ;AAAA,UACV,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,UAAM,YAAyB,YAAY,cAAc;AACzD,UAAM,KAAgB,cAAc,IAAI;AAAA,MACtC;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,aAAa,QAAQ;AAAA,MACrB;AAAA,MACA,UAAAA;AAAA,MACA;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,MAAM,OAAO,IAAI;AAAA,MACjB;AAAA,IACF,CAAC;AACD,QAAI,MAAM,IAAI,IAAI,EAAE;AAEpB,UAAM,QACJ,SAAS,SAAS,IACd,OAAO,KAAK,SAAS,CAAC,CAAe,KAAK,OAAO,KAAK,SAAS,GAAG,EAAE,CAAe,IACjF;AAAA,MACE,MAAM;AAAA,MACN,OAAO,OAAO,KAAK,SAAS,CAAC,CAAe,EAAG;AAAA,MAC/C,KAAK,OAAO,KAAK,SAAS,GAAG,EAAE,CAAe,EAAG;AAAA,IACnD,IACA,OACF;AACN,YAAQ,IAAI,IAAI;AAAA,MACd,QAAQ;AAAA,MACR,MAAM,OAAO,IAAI,KAAK,EAAE,MAAM,SAAS,OAAO,GAAG,KAAK,EAAE;AAAA,MACxD,aAAa,OAAO,OAAO;AAAA,MAC3B,cAAc,KAAK,iBAAiB,OAAO,KAAK,cAAc,IAAI;AAAA,MAClE,WAAW;AAAA,MACX,aAAa,QAAQ;AAAA,IACvB,CAAC;AACD,WAAO;AAAA,EACT;AAIA,QAAM,QAAsC,CAAC;AAC7C,WAAS,KAAK;AAAA,IACZ,WAAWC,OAA4B;AACrC,YAAM,KAAKA,MAAK,IAAI;AACpB,MAAAA,MAAK,KAAK;AAAA,IACZ;AAAA,IACA,YAAYA,OAA6B;AACvC,YAAM,KAAKA,MAAK,IAAI;AACpB,MAAAA,MAAK,KAAK;AAAA,IACZ;AAAA,EACF,CAAC;AAED,QAAM,WAAW,IAAI,MAAM,IAAI,IAAI,IAAI;AACvC,aAAW,KAAK,OAAO;AACrB,UAAM,KAAK,EAAE,SAAS,gBAAgB,cAAc,GAAG,IAAI,IAAI,IAAI,aAAa,GAAG,IAAI,IAAI;AAC3F,aAAS,SAAS,KAAK,EAAE;AAAA,EAC3B;AAEA,SAAO,EAAE,KAAK,YAAY;AAC5B;AAEO,IAAM,cAAwB;AAAA,EACnC,MAAM;AAAA,EACN,OAAO;AAAA,EACP,SAAS,IAAY,MAAuB;AAC1C,WAAO,aAAa,IAAI,IAAI;AAAA,EAC9B;AAAA,EACA,MAAM,MAAc,KAAwC;AAC1D,WAAO,QAAQ,MAAM,GAAG;AAAA,EAC1B;AACF;AAGO,SAAS,oBAA8B;AAC5C,SAAO;AACT;;;ACpeA,0BAAwB;AAoBxB,IAAMC,aAAiC,CAAC,OAAO,KAAK;AAUpD,SAAS,SAAS,KAAiB,KAA2B;AAC5D,QAAM,MAAM,IAAI,MAAM,IAAI,GAAG;AAC7B,QAAM,UAAU,KAAK;AACrB,MAAI,WAAW,OAAO,QAAQ,SAAS,UAAU;AAC/C,WAAO,EAAE,MAAM,QAAQ,MAAM,QAAQ,QAAQ,WAAW,KAAK;AAAA,EAC/D;AACA,MAAI,KAAK;AACP,UAAM,KAAK,IAAI,QAAQ,IAAI,IAAI,KAAK,IAAI;AACxC,QAAI,GAAI,QAAO,EAAE,MAAM,GAAG,KAAK,MAAM,IAAI,KAAK,OAAO,IAAI,KAAK,GAAG,GAAG,QAAQ,MAAM;AAAA,EACpF;AACA,SAAO,EAAE,MAAM,IAAI,QAAQ,MAAM;AACnC;AAGA,SAASC,gBAAe,SAA8B;AACpD,QAAM,MAAgB,CAAC;AACvB,aAAW,OAAO,QAAQ,UAAU;AAClC,QAAI,IAAI,SAAS,SAAU,YAAW,KAAK,IAAI,OAAQ,KAAI,KAAK,EAAE,KAAK;AAAA,EACzE;AACA,SAAO;AACT;AAKA,SAAS,cAAc,KAAoC;AACzD,aAAW,MAAM,IAAI,QAAQ,OAAO,GAAG;AACrC,QAAI,OAAO,GAAG,SAAS,YAAY,GAAG,KAAK,SAAS,EAAG,QAAO;AAAA,EAChE;AACA,SAAO;AACT;AAGA,SAAS,YAAY,KAA2B;AAC9C,QAAM,MAAgB,CAAC;AACvB,QAAM,OAAO,oBAAI,IAAc;AAC/B,QAAM,QAAQ,CAAC,OAAuB;AACpC,QAAI,KAAK,IAAI,EAAE,EAAG;AAClB,SAAK,IAAI,EAAE;AACX,UAAM,IAAI,IAAI,MAAM,IAAI,EAAE;AAC1B,QAAI,CAAC,EAAG;AACR,QAAI,KAAK,CAAC;AACV,QAAI,EAAE,SAAS,aAAa,EAAE,SAAS,WAAY,YAAW,KAAK,EAAE,SAAU,OAAM,CAAC;AAAA,EACxF;AACA,QAAM,IAAI,IAAI;AACd,SAAO;AACT;AAGA,SAAS,iBAAiB,GAAe,GAAwB;AAC/D,MAAI,EAAE,SAAS,EAAE,KAAM,QAAO;AAC9B,MAAI,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,IAAK,QAAO,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,QAAQ,EAAE;AACtF,SAAO;AACT;AAWA,SAAS,YAAY,IAAiB,KAAiB,IAAgB,IAAwB;AAC7F,QAAM,UAAU,GAAG;AAEnB,MAAI,QAAQ,cAAc,QAAQ,OAAQ,QAAO;AAEjD,QAAM,SAASA,gBAAe,OAAO;AACrC,QAAM,YAAY,QAAQ;AAE1B,MAAI,aAAa,UAAU,SAAS,GAAG,IAAI;AACzC,UAAM,UAAU,GAAG,KAAK,MAAM,UAAU,OAAO,UAAU,GAAG;AAE5D,UAAM,QAAQ,QAAQ,WAAW,GAAG,IAAI,MAAM;AAC9C,UAAM,OAAO,GAAG,KAAK,GAAG,OAAO,KAAK,GAAG,CAAC,GAAG,KAAK;AAChD,QAAI,YAAY,MAAM;AACpB,SAAG,UAAU,UAAU,OAAO,UAAU,KAAK,IAAI;AACjD,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,MAAI,GAAG,YAAa,QAAO;AAC3B,QAAM,OAAO,IAAI,QAAQ,IAAI,GAAG,EAAE;AAClC,QAAM,UAAU,MAAM;AACtB,MAAI,CAAC,WAAW,QAAQ,SAAS,GAAG,GAAI,QAAO;AAE/C,QAAM,WAAW,QAAQ,QAAQ,IAAI,GAAG,IAAI;AAC5C,KAAG,WAAW,UAAU,eAAe,OAAO,KAAK,GAAG,CAAC,GAAG;AAC1D,SAAO;AACT;AAGA,SAAS,cAAc,KAAgC;AACrD,QAAM,KAAK,cAAc,GAAG;AAC5B,MAAI,CAAC,GAAI,QAAO;AAEhB,QAAM,KAAK,IAAI,oBAAAC,QAAY,GAAG,IAAI;AAElC,QAAM,OAAO,YAAY,GAAG;AAC5B,QAAM,YAA0B,CAAC;AACjC,aAAW,KAAK,KAAM,KAAI,EAAE,QAAQ,EAAE,KAAK,SAAS,GAAG,GAAI,WAAU,KAAK,EAAE,IAAI;AAKhF,QAAM,UAA2B,CAAC;AAClC,aAAW,MAAM,WAAW,GAAG,GAAG;AAChC,QAAI,IAAI,MAAM,IAAI,EAAE,EAAG;AACvB,UAAM,OAAO,IAAI,QAAQ,IAAI,EAAE;AAC/B,QAAI,CAAC,QAAQ,KAAK,KAAK,SAAS,GAAG,GAAI;AACvC,UAAM,YAAY,UAAU,KAAK,CAAC,MAAM,iBAAiB,KAAK,MAAM,CAAC,CAAC;AACtE,YAAQ,KAAK,EAAE,SAAS,MAAM,UAAU,CAAC;AAAA,EAC3C;AAIA,QAAM,eAAe,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,IAAI;AAClF,aAAW,KAAK,SAAS;AACvB,UAAM,OAAO,EAAE,QAAQ;AACvB,UAAM,gBAAgB,aAAa,KAAK,CAAC,MAAM,MAAM,QAAQ,iBAAiB,GAAG,IAAI,CAAC;AACtF,QAAI,cAAe;AAEnB,QAAI,EAAE,WAAW;AAEf,YAAM,OAAO,EAAE,QAAQ;AACvB,YAAM,QAAQ,EAAE,QAAQ;AACxB,UAAI,QAAQ,KAAK,SAAS,GAAG,MAAM,KAAK,MAAM,KAAK,MAAO,IAAG,OAAO,KAAK,OAAO,KAAK,GAAG;AACxF,UAAI,SAAS,MAAM,SAAS,GAAG,MAAM,MAAM,MAAM,MAAM,OAAO;AAC5D,WAAG,OAAO,MAAM,OAAO,MAAM,GAAG;AAAA,MAClC;AAAA,IACF,OAAO;AACL,SAAG,OAAO,KAAK,OAAO,KAAK,GAAG;AAAA,IAChC;AAAA,EACF;AAGA,aAAW,KAAK,MAAM;AACpB,QAAI,EAAE,SAAS,UAAW,aAAY,IAAI,KAAK,IAAI,CAAC;AAAA,EACtD;AAEA,SAAO,GAAG,SAAS;AACrB;AAGA,SAAS,WAAW,KAA6B;AAM/C,QAAM,MAAkB,CAAC;AACzB,QAAM,MAAM,IAAI,MAAM;AACtB,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,UAAM,KAAK;AACX,QAAI,IAAI,QAAQ,IAAI,EAAE,EAAG,KAAI,KAAK,EAAE;AAAA,EACtC;AACA,SAAO;AACT;AAKA,SAAS,UAAU,KAAiB,SAAmC;AACrE,MAAI,QAAQ,SAAS,YAAY,QAAQ,SAAS,WAAW,EAAG,QAAO;AAEvE,QAAM,UAAU,QAAQ,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,SAAS;AACjE,MAAI,WAAW,QAAQ,SAAS,WAAW;AACzC,WAAO,cAAc,SAAS,KAAK,QAAQ,IAAI,EAAE,IAAI;AAAA,EACvD;AAEA,QAAM,SAASD,gBAAe,OAAO;AACrC,SAAO,cAAc,OAAO,KAAK,GAAG,CAAC;AACvC;AAEA,SAAS,SAAS,KAAiB,MAAc,OAA0B;AACzE,MAAI,MAAM,SAAS,UAAU;AAC3B,QAAI,MAAM,UAAU,KAAM,QAAO;AACjC,QAAI,MAAM,UAAU,MAAO,QAAO;AAClC,WAAO,GAAG,IAAI,KAAK,OAAO,MAAM,KAAK,CAAC;AAAA,EACxC;AACA,SAAO,GAAG,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,EAAE,IAAI;AACnD;AAEA,SAAS,aAAa,KAAiB,IAAuB;AAC5D,QAAM,QAAkB,CAAC;AAEzB,QAAM,MAAM,UAAU,KAAK,GAAG,OAAO;AACrC,MAAI,QAAQ,KAAM,OAAM,KAAK,GAAG;AAEhC,aAAW,QAAQ,GAAG,MAAM,OAAO;AACjC,UAAM,IAAI,GAAG,MAAM,QAAQ,IAAI,IAAI;AACnC,QAAI,CAAC,EAAG;AACR,UAAM,OAAO,SAAS,KAAK,MAAM,CAAC;AAClC,QAAI,KAAK,SAAS,EAAG,OAAM,KAAK,IAAI;AAAA,EACtC;AAEA,aAAW,OAAO,GAAG,MAAM,QAAS,OAAM,KAAK,OAAO,SAAS,KAAK,GAAG,EAAE,IAAI,GAAG;AAEhF,QAAM,UAAU,MAAM,SAAS,IAAI,IAAI,MAAM,KAAK,GAAG,CAAC,KAAK;AAC3D,QAAM,MAAM,GAAG;AAEf,MAAI,GAAG,SAAS,WAAW,GAAG;AAC5B,WAAO,GAAG,cAAc,IAAI,GAAG,GAAG,OAAO,QAAQ,IAAI,GAAG,GAAG,OAAO,MAAM,GAAG;AAAA,EAC7E;AAEA,QAAM,QAAQ,GAAG,SAAS,IAAI,CAAC,MAAM,UAAU,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE;AAC/D,SAAO,IAAI,GAAG,GAAG,OAAO,IAAI,KAAK,KAAK,GAAG;AAC3C;AAEA,SAAS,UAAU,KAAiB,IAAsB;AACxD,QAAM,OAAO,IAAI,MAAM,IAAI,EAAE;AAC7B,MAAI,CAAC,KAAM,QAAO;AAClB,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO,KAAK;AAAA,IACd,KAAK;AACH,aAAO,MAAM,KAAK,KAAK;AAAA,IACzB,KAAK,QAAQ;AACX,YAAM,EAAE,MAAM,OAAO,IAAI,SAAS,KAAK,KAAK,IAAI;AAChD,aAAO,SAAS,OAAO,IAAI,MAAM,IAAI,IAAI;AAAA,IAC3C;AAAA,IACA,KAAK;AACH,aAAO,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,UAAU,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC;AAAA,IAClE,KAAK;AACH,aAAO,aAAa,KAAK,IAAI;AAAA,EACjC;AACF;AAEA,SAAS,QAAQ,KAAyB;AACxC,QAAM,OAAO,IAAI,MAAM,IAAI,IAAI,IAAI;AACnC,MAAI,CAAC,QAAQ,KAAK,SAAS,WAAY,QAAO,UAAU,KAAK,IAAI,IAAI;AACrE,SAAO,KAAK,SAAS,IAAI,CAAC,MAAM,UAAU,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE;AAC5D;AAIA,SAAS,QAAQ,KAAyB;AACxC,QAAM,WAAW,cAAc,GAAG;AAClC,SAAO,YAAY,QAAQ,GAAG;AAChC;AAEO,IAAM,aAAsB;AAAA,EACjC,MAAM;AAAA,EACN,OAAOD;AAAA,EACP,MAAM,KAAiB,OAAiB,MAAqC;AAC3E,UAAM,OAAO,QAAQ,GAAG;AACxB,WAAO,EAAE,MAAM,KAAK,MAAM,OAAO,CAAC,GAAG,aAAa,CAAC,EAAE;AAAA,EACvD;AACF;AAGO,SAAS,mBAA4B;AAC1C,SAAO;AACT;;;ACzQA,yBAA8B;AAC9B,WAAsB;AA0CtB,SAAS,aAAqB;AAC5B,SAAO,OAAO,eAAe,WAAW,aAAa;AACvD;AAOA,SAAS,eAAe,aAA0C;AAChE,QAAM,QAAkB,CAAC;AAGzB,MAAI,YAAa,OAAM,KAAU,UAAK,aAAa,gBAAgB,CAAC;AACpE,QAAM,KAAU,UAAK,QAAQ,IAAI,GAAG,gBAAgB,CAAC;AACrD,QAAM,KAAK,WAAW,CAAC;AACvB,aAAW,QAAQ,OAAO;AACxB,QAAI;AACF,YAAM,gBAAY,kCAAc,IAAI;AACpC,gBAAU,QAAQ,0BAA0B;AAC5C,aAAO;AAAA,IACT,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAiCA,SAAS,WAAW,SAAkD;AACpE,QAAM,MAAM,eAAe,QAAQ,WAAW;AAC9C,MAAI,CAAC,IAAK,QAAO;AACjB,MAAI;AACF,UAAM,gBAAgB,IAAI,8BAA8B;AACxD,UAAM,EAAE,cAAc,IAAI,IAAI,0CAA0C;AAGxE,UAAM,EAAE,cAAc,IAAI,IAAI,sCAAsC;AAGpE,UAAM,MAAM,IAAI,0BAA0B;AAE1C,QAAI,aAAsB,QAAQ,UAAU,EAAE,SAAS,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE;AACrE,QAAI,QAAQ,eAAe,QAAW;AACpC,YAAM,aAAa,IAAI,2BAA2B;AAClD,mBAAa,WAAW,QAAQ,UAAU;AAAA,IAC5C;AACA,UAAM,WAAW,cAAc,UAAU;AACzC,UAAM,UAAU,cAAc,QAAQ;AAEtC,WAAO;AAAA,MACL,SAAS,IAAI;AAAA,MACb;AAAA,MACA,SAAS,YAAyC;AAChD,cAAM,QAAQ,cAAc,IAAI,IAAI,UAAU,GAAG,OAAO;AACxD,eAAO,MAAM,IAAI,CAAC,CAAC,EAAE,IAAI,MAAM,IAAI;AAAA,MACrC;AAAA,IACF;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AA+BA,IAAM,yBAAyB,oBAAI,IAAI;AAAA,EACrC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAaD,SAAS,cAAc,UAAkC;AACvD,QAAM,MAAM,SAAS,KAAK;AAC1B,MAAI,IAAI,WAAW,KAAK,IAAI,CAAC,MAAM,IAAK,QAAO,EAAE,MAAM,UAAU;AAGjE,MAAI,IAAI;AACR,SAAO,IAAI,IAAI,QAAQ,KAAK,GAAG;AAC7B,UAAM,IAAI,IAAI,CAAC;AACf,QAAI,MAAM,MAAM;AACd,WAAK;AACL;AAAA,IACF;AACA,QAAI,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,KAAK;AACxG;AAAA,IACF;AAAA,EACF;AAEA,QAAM,YAAY,IAAI,MAAM,CAAC;AAC7B,MAAI,UAAU,WAAW,GAAG;AAC1B,WAAO,EAAE,MAAM,UAAU,QAAQ,CAAC,GAAG,eAAe,GAAG;AAAA,EACzD;AAEA,MAAI,CAAC,oCAAoC,KAAK,SAAS,GAAG;AACxD,WAAO,EAAE,MAAM,UAAU;AAAA,EAC3B;AAEA,QAAM,QAAQ,UAAU,MAAM,6BAA6B,KAAK,CAAC;AACjE,QAAM,SAAmB,CAAC;AAC1B,MAAI,gBAAgB;AACpB,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,WAAW,IAAI,KAAK,uBAAuB,IAAI,IAAI,GAAG;AAC7D,sBAAgB,KAAK,WAAW,IAAI,IAAI,OAAO,IAAI,IAAI;AAAA,IACzD,OAAO;AACL,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF;AACA,SAAO,EAAE,MAAM,UAAU,QAAQ,cAAc;AACjD;AAEA,SAAS,cAAc,OAAe,QAA2B,eAAuC;AACtG,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC,EAAE,KAAK;AAAA,IAClC;AAAA,EACF;AACF;AAmBA,SAAS,aACP,MACA,YACA,qBACA,KACM;AACN,MAAI,KAAK,SAAS,QAAQ;AACxB,QAAI,KAAK,EAAE,MAAM,MAAyB,OAAO,YAAY,aAAa,oBAAoB,CAAC;AAC/F;AAAA,EACF;AACA,MAAI,KAAK,SAAS,UAAU;AAC1B,UAAM,KAAK;AACX,UAAM,WAAW,GAAG,SAAS,CAAC;AAC9B,QAAI,GAAG,SAAS,SAAS;AACvB,YAAM,YAAY,GAAG,SAAS,CAAC,GAAG,YAAY,GAAG,MAAM,IAAI;AAC3D,iBAAW,SAAS,SAAU,cAAa,OAAO,WAAW,qBAAqB,GAAG;AAAA,IACvF,OAAO;AAEL,iBAAW,SAAS,SAAU,cAAa,OAAO,YAAY,MAAM,GAAG;AAAA,IACzE;AAAA,EACF;AACF;AAGA,SAAS,aAAa,OAAe,OAA0C;AAC7E,MAAI,MAAM,WAAW,EAAG,QAAO,EAAE,QAAQ,CAAC,GAAG,UAAU,MAAM;AAE7D,QAAM,SAA2F,CAAC;AAClG,aAAW,QAAQ,MAAO,cAAa,MAAM,CAAC,GAAG,OAAO,MAAM;AAE9D,QAAM,SAA2B,CAAC;AAClC,MAAI,aAAa;AAEjB,aAAW,EAAE,MAAM,OAAO,YAAY,KAAK,QAAQ;AACjD,UAAM,SAAS,cAAc,KAAK,QAAQ;AAC1C,QAAI,OAAO,SAAS,aAAa,aAAa;AAC5C,mBAAa;AACb;AAAA,IACF;AACA,UAAM,QAAmD,CAAC;AAC1D,eAAW,SAAS,KAAK,SAAS,CAAC,GAAG;AACpC,UAAI,MAAM,SAAS,OAAQ;AAC3B,YAAM,IAAI;AACV,UAAI,OAAO,EAAE,UAAU,SAAU;AACjC,YAAM,KAAK,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc,IAAI,CAAC;AAAA,IACpD;AACA,QAAI,MAAM,WAAW,EAAG;AACxB,UAAM,aAAa,MAAM,KAAK,OAAO;AACrC,WAAO,KAAK,EAAE,WAAW,cAAc,YAAY,OAAO,QAAQ,OAAO,aAAa,GAAG,MAAM,CAAC;AAAA,EAClG;AAEA,QAAM,SACJ,cAAc,OAAO,WAAW,IAC5B,EAAE,OAAO,QAAQ,sBAAsB,QAAQ,wDAAwD,IACvG;AAEN,SAAO,EAAE,QAAQ,UAAU,MAAM,OAAO;AAC1C;AAIA,SAAS,cACP,WACU;AACV,MAAI,UAAU,SAAS,EAAG,QAAO,cAAc;AAC/C,QAAM,SAAS,oBAAI,IAAiD;AACpE,aAAW,EAAE,WAAW,MAAM,KAAK,UAAU,OAAO,GAAG;AACrD,QAAI,MAAM,SAAS,EAAG;AACtB,WAAO,IAAI,aAAa,SAAS,GAAG,EAAE,WAAW,MAAM,CAAC;AAAA,EAC1D;AACA,MAAI,OAAO,SAAS,EAAG,QAAO,cAAc;AAC5C,SAAO,WAAW,kBAAkB,EAAE,OAAO,CAAC;AAChD;AAOA,SAAS,WAAW,MAAqD;AACvE,QAAM,MAAqB,CAAC;AAC5B,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,MAAM,CAAC,MAAqC;AAChD,QAAI,CAAC,KAAK,EAAE,SAAS,WAAW,KAAK,IAAI,EAAE,SAAS,EAAG;AACvD,SAAK,IAAI,EAAE,SAAS;AACpB,QAAI,KAAK,CAAC;AAAA,EACZ;AACA,aAAW,KAAK,KAAK,YAAY,CAAC,EAAG,KAAI,CAAC;AAC1C,MAAI,KAAK,MAAM;AACf,SAAO,IAAI,SAAS,IAAI,MAAM;AAChC;AAQA,IAAM,eAA8B;AAAA,EAClC,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,eAAe;AAAA,EACf,cAAc;AAAA,EACd,WAAW;AACb;AAMA,IAAM,kBAAiC;AAAA,EACrC,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,eAAe;AAAA,EACf,cAAc;AAAA,EACd,WAAW;AACb;AAKA,SAAS,MAAM,OAAuB;AACpC,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACxC,SAAK,MAAM,WAAW,CAAC;AACvB,QAAI,KAAK,KAAK,GAAG,QAAU;AAAA,EAC7B;AACA,UAAQ,MAAM,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC/C;AAIA,IAAM,mBAAN,MAAgD;AAAA,EACrC,KAAK;AAAA,EACL;AAAA,EACA;AAAA,EAEA;AAAA;AAAA,EAEA,cAAc,oBAAI,IAA4B;AAAA;AAAA,EAE9C,gBAAgB,oBAAI,IAA2B;AAAA;AAAA,EAExD,gBAA2F;AAAA,EAE3F,YAAY,SAAiC,CAAC,GAAG;AAC/C,SAAK,UAAU,WAAW,MAAM;AAChC,SAAK,WACH,OAAO,aAAa,KAAK,UAAU,eAAe,KAAK,QAAQ,OAAO,KAAK;AAC7E,UAAM,OAAO,KAAK,UAAU,OAAO,UAAU,CAAC,CAAC,KAAK,OAAO,cAAc;AACzE,SAAK,cAAc,OAAO,eAAe,GAAG,KAAK,QAAQ,IAAI,MAAM,IAAI,CAAC;AAAA,EAC1E;AAAA;AAAA,EAGA,SAAS,OAA+B;AACtC,UAAM,SAAS,KAAK,YAAY,IAAI,KAAK;AACzC,QAAI,OAAQ,QAAO;AACnB,QAAI;AACJ,QAAI,CAAC,KAAK,SAAS;AACjB,eAAS,EAAE,QAAQ,CAAC,GAAG,UAAU,MAAM;AAAA,IACzC,OAAO;AACL,UAAI;AACF,iBAAS,aAAa,OAAO,KAAK,QAAQ,SAAS,CAAC,KAAK,CAAC,CAAC;AAAA,MAC7D,QAAQ;AACN,iBAAS,EAAE,QAAQ,CAAC,GAAG,UAAU,MAAM;AAAA,MACzC;AAAA,IACF;AACA,SAAK,YAAY,IAAI,OAAO,MAAM;AAClC,WAAO;AAAA,EACT;AAAA,EAEA,KAAK,OAAwB;AAC3B,QAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,WAAO,KAAK,SAAS,KAAK,EAAE;AAAA,EAC9B;AAAA,EAEA,QAAQ,OAAoC;AAC1C,UAAM,MAAM,KAAK,UAAU,MAAM,OAAO;AACxC,UAAM,SAAS,KAAK,cAAc,IAAI,GAAG;AACzC,QAAI,OAAQ,QAAO;AAInB,UAAM,YAAY,oBAAI,IAGpB;AACF,UAAM,WAAqB,CAAC;AAC5B,UAAM,UAAoB,CAAC;AAC3B,UAAM,SAAwB,CAAC;AAE/B,UAAM,QAAQ,QAAQ,CAAC,OAAO,eAAe;AAC3C,YAAM,YAAY,KAAK,SAAS,KAAK;AACrC,UAAI,CAAC,UAAU,UAAU;AACvB,gBAAQ,KAAK,KAAK;AAClB;AAAA,MACF;AACA,UAAI,UAAU,OAAQ,QAAO,KAAK,UAAU,MAAM;AAClD,UAAI,UAAU,OAAO,WAAW,EAAG;AAEnC,YAAM,SAAsB,EAAE,MAAM,SAAS,YAAY,WAAW,MAAM;AAC1E,UAAI,cAAc;AAClB,iBAAW,SAAS,UAAU,QAAQ;AACpC,cAAM,KAAK,aAAa,MAAM,SAAS;AACvC,YAAI,SAAS,UAAU,IAAI,EAAE;AAC7B,YAAI,CAAC,QAAQ;AACX,mBAAS,EAAE,WAAW,MAAM,WAAW,OAAO,oBAAI,IAAI,EAAE;AACxD,oBAAU,IAAI,IAAI,MAAM;AAAA,QAC1B;AACA,mBAAW,CAAC,MAAM,OAAO,SAAS,KAAK,MAAM,OAAO;AAClD,qBAAW,QAAQ,WAAW,qBAAqB,MAAM,OAAO,SAAS,GAAG;AAK1E,kBAAM,OAAO,OAAO,MAAM,IAAI,KAAK,QAAQ;AAC3C,kBAAM,WAAW,OAAO,WAAW,IAAI,IAAI;AAC3C,mBAAO,MAAM,IAAI,KAAK,UAAU,WAAW,EAAE,GAAG,MAAM,QAAQ,SAAS,IAAI,EAAE,GAAG,MAAM,OAAO,CAAC;AAC9F,0BAAc;AAAA,UAChB;AAAA,QACF;AAAA,MACF;AACA,UAAI,YAAa,UAAS,KAAK,KAAK;AAAA,IACtC,CAAC;AAED,UAAM,SAAwB;AAAA,MAC5B,QAAQ,cAAc,SAAS;AAAA,MAC/B;AAAA,MACA;AAAA,MACA;AAAA,MACA,UAAU,CAAC;AAAA,IACb;AACA,SAAK,cAAc,IAAI,KAAK,MAAM;AAClC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,qBAAyF;AACvF,QAAI,KAAK,cAAe,QAAO,KAAK;AACpC,UAAM,QAA4D,CAAC;AACnE,QAAI,KAAK,SAAS;AAChB,UAAI;AACF,cAAM,UAAU,KAAK,QAAQ,QAC1B,aAAa,EACb,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AACnD,cAAM,QAAQ,KAAK,QAAQ,SAAS,OAAO;AAE3C,mBAAW,QAAQ,OAAO;AACxB,cAAI,KAAK,SAAS,OAAQ;AAC1B,gBAAM,OAAO;AACb,gBAAM,SAAS,cAAc,KAAK,QAAQ;AAC1C,cAAI,OAAO,SAAS,YAAY,OAAO,OAAO,SAAS,KAAK,OAAO,kBAAkB,IAAI;AACvF;AAAA,UACF;AACA,gBAAM,YAAY,cAAc,KAAK,QAAQ;AAC7C,cAAI,cAAc,KAAM;AACxB,gBAAM,QAAQ,oBAAI,IAAyB;AAC3C,qBAAW,SAAS,KAAK,SAAS,CAAC,GAAG;AACpC,gBAAI,MAAM,SAAS,OAAQ;AAC3B,kBAAM,IAAI;AACV,gBAAI,OAAO,EAAE,UAAU,SAAU;AACjC,uBAAW,QAAQ,WAAW,qBAAqB,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc,IAAI,GAAG;AACzF,oBAAM,IAAI,KAAK,UAAU,OAAO,KAAK,KAAK,CAAC;AAAA,YAC7C;AAAA,UACF;AACA,cAAI,MAAM,OAAO,EAAG,OAAM,KAAK,CAAC,WAAW,KAAK,CAAC;AAAA,QACnD;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AACA,UAAM,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE;AACtF,SAAK,gBAAgB;AACrB,WAAO;AAAA,EACT;AAAA,EAEA,KAAK,QAAkB,KAA8B;AACnD,UAAM,OAAO,IAAI,cAAc;AAC/B,UAAM,aAAa,KAAK,kBAAkB,MAAM;AAChD,UAAM,OAAO,WAAW,OAAO,IAAI,aAAa,cAAc,CAAC;AAC/D,QAAI,CAAC,QAAQ,KAAK,MAAM,SAAS,EAAG,QAAO,EAAE,SAAS,CAAC,GAAG,OAAO,MAAM,UAAU,CAAC,EAAE;AAIpF,UAAM,aAAa,WAAW,OAAO,OAAO;AAM5C,UAAM,SAAS,oBAAI,IAAyB;AAC5C,eAAW,CAAC,MAAM,IAAI,KAAK,KAAK,OAAO;AACrC,iBAAW,CAAC,IAAI,EAAE,KAAK,cAAc,MAAM,OAAO,IAAI,GAAG,OAAO,KAAK,KAAK,GAAG,KAAK,SAAS,GAAG;AAC5F,eAAO,IAAI,IAAI,EAAE;AAAA,MACnB;AAAA,IACF;AAIA,UAAM,aAAyE,CAAC;AAChF,eAAW,SAAS,KAAK,mBAAmB,GAAG;AAC7C,YAAM,CAAC,EAAE,OAAO,IAAI;AACpB,UAAI,QAAQ,SAAS,KAAK,QAAQ,OAAO,OAAO,KAAM;AACtD,UAAI,OAAO;AACX,iBAAW,CAAC,MAAM,KAAK,KAAK,SAAS;AACnC,YAAI,OAAO,IAAI,IAAI,MAAM,OAAO;AAC9B,iBAAO;AACP;AAAA,QACF;AAAA,MACF;AACA,UAAI,KAAM,YAAW,KAAK,KAAK;AAAA,IACjC;AAKA,UAAM,YAAY,IAAI,IAAI,MAAM;AAChC,UAAM,UAAoB,CAAC;AAC3B,WAAO,UAAU,OAAO,GAAG;AACzB,UAAI,OAAmE;AACvE,UAAI,YAAY;AAChB,iBAAW,SAAS,YAAY;AAC9B,cAAM,CAAC,OAAO,OAAO,IAAI;AACzB,YAAI,QAAQ;AACZ,mBAAW,QAAQ,QAAQ,KAAK,EAAG,KAAI,UAAU,IAAI,IAAI,EAAG,UAAS;AACrE,YAAI,UAAU,EAAG;AACjB,cAAM,SACJ,SAAS,QACT,QAAQ,aACP,UAAU,aAAa,QAAQ,OAAO,KAAK,CAAC,EAAE,QAC9C,UAAU,aAAa,QAAQ,SAAS,KAAK,CAAC,EAAE,QAAQ,QAAQ,KAAK,CAAC;AACzE,YAAI,QAAQ;AACV,iBAAO;AACP,sBAAY;AAAA,QACd;AAAA,MACF;AACA,UAAI,CAAC,KAAM;AACX,cAAQ,KAAK,KAAK,CAAC,CAAC;AACpB,iBAAW,QAAQ,KAAK,CAAC,EAAE,KAAK,EAAG,WAAU,OAAO,IAAI;AAAA,IAC1D;AAEA,UAAM,QAAQ,UAAU,SAAS,KAAK,CAAC;AACvC,QAAI,UAAU,SAAS,EAAG,QAAO,EAAE,SAAS,OAAO,UAAU,CAAC,EAAE;AAGhE,UAAM,WAAW,mBAAmB,WAAW,GAAG;AAClD,WAAO,WACH,EAAE,SAAS,UAAU,OAAO,UAAU,CAAC,EAAE,IACzC,EAAE,SAAS,OAAO,UAAU,CAAC,EAAE;AAAA,EACrC;AAAA,EAEA,cAAc,OAA8B;AAM1C,UAAM,KAAK,KAAK,SAAS,KAAK;AAC9B,QAAI,CAAC,GAAG,YAAY,GAAG,OAAQ,QAAO;AACtC,UAAM,WACJ,GAAG,OAAO,SAAS,KACnB,GAAG,OAAO,MAAM,CAAC,MAAM,aAAa,EAAE,SAAS,MAAM,aAAa,cAAc,CAAC;AACnF,QAAI,CAAC,SAAU,QAAO;AACtB,WAAO;AAAA,EACT;AACF;AAWA,SAAS,cACP,MACA,MACA,OACA,WACuC;AACvC,QAAM,WAAW,CAAC,GAAW,MAC3B,KAAK,qBAAqB,GAAG,GAAG,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,UAAU,OAAO,EAAE,KAAK,CAAC,CAAU;AAE9F,MAAI,SAAS,QAAQ;AACnB,WAAO,CAAC,GAAG,SAAS,SAAS,KAAK,GAAG,GAAG,SAAS,UAAU,KAAK,CAAC;AAAA,EACnE;AACA,MAAI,SAAS,iBAAiB,SAAS,gBAAgB;AACrD,UAAM,QAAQ,MAAM,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC3D,UAAM,IAAI,MAAM,CAAC,KAAK;AACtB,UAAM,IAAI,MAAM,CAAC,KAAK;AACtB,UAAM,QAAQ,SAAS,gBAAiB,CAAC,OAAO,QAAQ,IAAe,CAAC,QAAQ,OAAO;AACvF,WAAO,CAAC,GAAG,SAAS,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,SAAS,MAAM,CAAC,GAAG,CAAC,CAAC;AAAA,EAC5D;AACA,SAAO,SAAS,MAAM,KAAK;AAC7B;AAGA,SAAS,mBACP,WACA,KAC4B;AAC5B,MAAI,UAAU,SAAS,EAAG,QAAO;AACjC,QAAM,OAAO,IAAI,cAAc;AAC/B,QAAM,QAAQ,oBAAI,IAA4B;AAC9C,aAAW,CAAC,MAAM,KAAK,KAAK,WAAW;AACrC,eAAW,QAAQ,KAAK,qBAAqB,OAAO,IAAI,GAAG,OAAO,KAAK,GAAG;AACxE,YAAM,IAAI,KAAK,UAAU,IAAI;AAAA,IAC/B;AAAA,EACF;AACA,QAAM,QAAoB,EAAE,WAAW,gBAAgB,MAAM;AAC7D,QAAM,WAAqB,EAAE,QAAQ,oBAAI,IAAI,CAAC,CAAC,aAAa,cAAc,GAAG,KAAK,CAAC,CAAC,EAAE;AACtF,QAAM,MAAM,CAAC,GAAG,SAAS,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,GAAG;AAChE,QAAM,YAAY,MAAM,MAAM,GAAG,CAAC;AAClC,QAAM,YAA4B,EAAE,WAAW,OAAO,UAAU,KAAK,IAAI,SAAS,IAAI,GAAG,IAAI;AAC7F,MAAI;AACF,QAAI,KAAK,SAAS,SAAS;AAAA,EAC7B,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAGA,SAAS,cAAc,UAAiC;AACtD,QAAM,MAAM,SAAS,KAAK;AAC1B,MAAI,IAAI,CAAC,MAAM,IAAK,QAAO;AAC3B,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GAAG;AACtC,UAAM,IAAI,IAAI,CAAC;AACf,QAAI,MAAM,MAAM;AACd,WAAK;AACL,UAAI,IAAI,IAAI,OAAQ,QAAO,IAAI,CAAC;AAChC;AAAA,IACF;AACA,QAAI,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,KAAK;AACxG,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AACA,SAAO,IAAI,SAAS,IAAI,MAAM;AAChC;AAGO,SAAS,uBAAuB,QAAgD;AACrF,SAAO,IAAI,iBAAiB,MAAM;AACpC;;;ACpsBA,qBAA6B;AAC7B,IAAAG,sBAA8B;AAC9B,IAAAC,QAAsB;AAkBtB,SAASC,cAAqB;AAC5B,SAAO,OAAO,eAAe,WAAW,aAAa;AACvD;AA0BA,SAAS,kBAAkB,aAA4C;AACrE,QAAM,QAAkB,CAAC;AACzB,MAAI,YAAa,OAAM,KAAU,WAAK,aAAa,gBAAgB,CAAC;AACpE,QAAM,KAAU,WAAK,QAAQ,IAAI,GAAG,gBAAgB,CAAC;AACrD,QAAM,KAAKA,YAAW,CAAC;AACvB,aAAW,QAAQ,OAAO;AACxB,QAAI;AACF,YAAM,UAAM,mCAAc,IAAI;AAC9B,UAAI,QAAQ,SAAS;AACrB,UAAI,QAAQ,yBAAyB;AACrC,YAAM,UAAU,IAAI,SAAS;AAC7B,YAAM,MAAM,IAAI,yBAAyB;AAEzC,YAAM,WAAW,IAAI,WAAW;AAChC,aAAO,EAAE,OAAO,QAAQ,OAAO,gBAAgB,SAAS;AAAA,IAC1D,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAmCA,IAAI,KAA6B;AAEjC,IAAI,KAA+B;AAGnC,SAAS,cAAc,aAA4B;AACjD,MAAI,MAAM,GAAI;AACd,QAAM,SAAS,kBAAkB,WAAW;AAC5C,MAAI,CAAC,QAAQ;AACX,UAAM,IAAI;AAAA,MACR;AAAA,IAGF;AAAA,EACF;AACA,OAAK,OAAO;AACZ,OAAK,OAAO;AACd;AAGO,IAAM,kBAAkB;AAGxB,IAAM,wBAAwB;AAGrC,IAAM,iBAAiB;AAGvB,IAAM,qBAA0C,oBAAI,IAAI;AAAA,EACtD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGD,IAAM,qBAA0C,oBAAI,IAAI;AAAA,EACtD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGD,IAAMC,0BAA8C,oBAAI,IAAI;AAAA,EAC1D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAyCM,IAAM,oBAAN,MAAiD;AAAA,EACtC,KAAa;AAAA,EACb,WAAmB;AAAA,EACnB;AAAA,EAEP;AAAA;AAAA,EAEA,cAAc,oBAAI,IAAyB;AAAA;AAAA,EAE3C,SAAS,oBAAI,IAA0B;AAAA;AAAA,EAEvC,SAAS,oBAAI,IAAY;AAAA;AAAA,EAEzB;AAAA,EAET,WAA2C;AAAA,EAEpC,YAAY,WAA+B,CAAC,GAAG,UAA8B,CAAC,GAAG;AACtF,kBAAc,QAAQ,WAAW;AACjC,UAAM,YAAY,QAAQ,SAAS,CAAC,GAAG,IAAI,WAAW;AACtD,SAAK,SAAS,CAAC,GAAG,UAAU,GAAG,QAAQ;AACvC,SAAK,cAAc,QAAQ,eAAe,kBAAkB,KAAK,UAAU,KAAK,MAAM;AAEtF,UAAM,UAAU,oBAAI,IAAY;AAChC,QAAI,QAAQ;AACZ,eAAW,QAAQ,KAAK,QAAQ;AAC9B,cAAQ,KAAK,WAAW,MAAM,OAAO,OAAO;AAAA,IAC9C;AACA,SAAK,WAAW,CAAC,GAAG,OAAO,EAAE,KAAK;AAAA,EACpC;AAAA;AAAA,EAGA,IAAW,QAA4B;AACrC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGO,KAAK,OAAwB;AAClC,WAAO,kBAAkB,KAAK,KAAK,KAAK,OAAO,IAAI,KAAK;AAAA,EAC1D;AAAA,EAEO,QAAQ,OAAoC;AACjD,UAAM,SAAS,KAAK,eAAe,MAAM,SAAS,MAAM,OAAO;AAC/D,UAAM,WAAqB,CAAC;AAC5B,UAAM,UAAoB,CAAC;AAC3B,eAAW,SAAS,MAAM,SAAS;AACjC,UAAI,KAAK,YAAY,IAAI,KAAK,EAAG,UAAS,KAAK,KAAK;AAAA,UAC/C,SAAQ,KAAK,KAAK;AAAA,IACzB;AACA,WAAO,EAAE,QAAQ,UAAU,SAAS,QAAQ,CAAC,GAAG,UAAU,CAAC,EAAE;AAAA,EAC/D;AAAA,EAEO,KAAK,QAAkB,KAA8B;AAC1D,UAAM,OAAO,IAAI,cAAc;AAC/B,UAAM,YAAY,oBAAI,IAAoB;AAC1C,eAAW,CAAC,IAAI,KAAK,KAAK,KAAK,kBAAkB,MAAM,EAAE,QAAQ;AAC/D,iBAAW,CAAC,MAAM,IAAI,KAAK,MAAM,OAAO;AACtC,kBAAU,IAAI,GAAG,EAAE,KAAI,IAAI,IAAI,OAAO,KAAK,KAAK,CAAC;AAAA,MACnD;AAAA,IACF;AACA,QAAI,UAAU,SAAS,EAAG,QAAO,EAAE,SAAS,CAAC,GAAG,OAAO,MAAM,UAAU,CAAC,EAAE;AAE1E,UAAM,UAAoB,CAAC;AAE3B,eAAW,EAAE,OAAO,MAAM,KAAK,KAAK,cAAc,GAAG;AACnD,UAAI,UAAU;AACd,iBAAW,CAAC,KAAK,KAAK,KAAK,OAAO;AAChC,YAAI,UAAU,IAAI,GAAG,MAAM,OAAO;AAChC,oBAAU;AACV;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,QAAS;AACd,cAAQ,KAAK,KAAK;AAClB,iBAAW,OAAO,MAAM,KAAK,EAAG,WAAU,OAAO,GAAG;AACpD,UAAI,UAAU,SAAS,EAAG;AAAA,IAC5B;AAGA,WAAO,EAAE,SAAS,OAAO,UAAU,SAAS,GAAG,UAAU,CAAC,EAAE;AAAA,EAC9D;AAAA,EAEO,cAAc,OAA8B;AACjD,UAAM,IAAI,KAAK,OAAO,IAAI,KAAK;AAC/B,QAAI,CAAC,GAAG;AACN,aAAO;AAAA,QACL,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,eAAe;AAAA,QACf,cAAc;AAAA,QACd,WAAW;AAAA,MACb;AAAA,IACF;AACA,WAAO;AAAA,MACL,WAAW,EAAE;AAAA,MACb,YAAY,EAAE;AAAA,MACd,YAAY,EAAE;AAAA,MACd,WAAW,EAAE;AAAA,MACb,eAAe,EAAE;AAAA,MACjB,cAAc,EAAE;AAAA;AAAA,MAEhB,WAAW,EAAE,cAAc,CAAC,EAAE;AAAA,IAChC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,mBAAsC;AAC3C,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA,EAKA,WAAW,MAAe,YAAoB,SAA8B;AAC1E,QAAI,QAAQ;AACZ,QAAI;AACJ,QAAI;AACF,aAAO,GAAI,KAAK,KAAK,EAAE,MAAM,KAAK,GAAG,CAAC;AAAA,IACxC,QAAQ;AAEN,aAAO;AAAA,IACT;AAEA,SAAK,UAAU,CAAC,SAAS;AACvB,YAAM,QAAQ,aAAa,IAAI;AAC/B,UAAI,MAAM,KAAM;AAChB,YAAM,QAAQ,aAAa,IAAI;AAE/B,UAAI;AACJ,UAAI;AACF,cAAM,GAAI,EAAE,QAAQ,KAAK,QAAQ;AAAA,MACnC,QAAQ;AACN;AAAA,MACF;AAEA,iBAAW,OAAO,IAAI,OAAO;AAC3B,cAAM,YAAY;AAClB,aAAK,iBAAiB,KAAgC,MAAM,OAAO,OAAO,WAAW,OAAO;AAAA,MAC9F;AACA,eAAS;AAAA,IACX,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,iBACE,UACA,OACA,OACA,OACA,SACM;AACN,UAAM,YAAY,eAAe,QAAQ;AACzC,QAAI,gBAAgB;AACpB,QAAI,gBAAgB;AAEpB,cAAU,QAAQ,CAAC,UAAU,UAAU;AACrC,YAAM,YAAY,UAAU,UAAU,SAAS;AAC/C,YAAM,kBAAkB,QAAQ,UAAU,SAAS,IAAI,UAAU,QAAQ,CAAC,EAAG,iBAAiB;AAC9F,UAAI,gBAAiB,iBAAgB;AAErC,YAAM,UAAU,SAAS,MAAM,OAAO,CAAC,MAAM,GAAI,YAAY,CAAC,CAAC;AAC/D,YAAM,cAAc,SAAS,MAAM;AAAA,QACjC,CAAC,MACC,GAAI,MAAM,CAAC,KACX,GAAI,aAAa,CAAC,KAClB,GAAI,YAAY,CAAC,KACjB,GAAI,YAAY,CAAC,KACjB,GAAI,UAAU,CAAC;AAAA,MACnB;AACA,YAAM,UAAU,SAAS,MAAM,OAAO,CAAC,MAAM,GAAI,SAAS,CAAC,CAAC;AAC5D,YAAM,mBAAmB,QAAQ,KAAK,CAAC,MAAM,mBAAmB,IAAI,WAAW,CAAC,CAAC,CAAC;AAClF,YAAM,mBAAmB,QAAQ,KAAK,CAAC,MAAM,mBAAmB,IAAI,WAAW,CAAC,CAAC,CAAC;AAClF,YAAM,eAAe,QAAQ;AAAA,QAC3B,CAAC,MACC,GAAI,cAAc,CAAC,KACnB,CAAC,mBAAmB,IAAI,WAAW,CAAC,CAAC,KACrC,CAAC,mBAAmB,IAAI,WAAW,CAAC,CAAC;AAAA,MACzC;AACA,YAAM,iBAAiB,QAAQ,OAAO,CAAC,MAAM,gBAAgB,CAAC,CAAC;AAC/D,YAAM,YAAY,QAAQ,SAAS,KAAK,eAAe,oBAAoB,aAAa,SAAS;AAEjG,UAAI,iBAAkB,iBAAgB;AAEtC,iBAAW,OAAO,SAAS;AACzB,cAAM,QAAQ,IAAI;AAClB,aAAK,OAAO,IAAI,KAAK;AACrB,cAAM,IAAI,KAAK,UAAU,KAAK;AAC9B,UAAE,aAAa;AACf,YAAI,UAAW,GAAE,YAAY;AAC7B,YAAI,oBAAoB,OAAO,oBAAoB,IAAK,GAAE,aAAa;AACvE,YAAI,oBAAoB,OAAO,oBAAoB,IAAK,GAAE,YAAY;AACtE,YAAI,UAAW,GAAE,aAAa;AAC9B,YAAI,iBAAkB,GAAE,eAAe;AACvC,YAAI,oBAAoB,QAAQ,aAAa,oBAAoB,eAAe,SAAS,GAAG;AAC1F,YAAE,cAAc;AAAA,QAClB;AAKA,cAAM,kBACJ,UAAU,WAAW,KACrB,QAAQ,WAAW,KACnB,CAAC,eACD,CAAC,oBACD,CAAC,oBACD,eAAe,UAAU;AAC3B,YAAI,mBAAmB,MAAM,SAAS,GAAG;AACvC,gBAAM,YAA4B;AAAA,YAChC;AAAA,YACA,QAAQ,aAAa,IAAI,UAAU,EAAE,KAAK;AAAA,YAC1C,eAAe,eAAe,WAAW,IAAI,uBAAuB,eAAe,CAAC,CAAE,IAAI;AAAA,UAC5F;AACA,eAAK,cAAc,OAAO,EAAE,OAAO,OAAO,WAAW,MAAM,CAAC;AAAA,QAC9D;AAAA,MACF;AAGA,iBAAW,KAAK,SAAS;AACvB,cAAM,QAAQ,WAAW,CAAC,MAAM;AAChC,UAAE,YAAY,CAAC,UAAU;AACvB,gBAAM,QAAQ,MAAM;AACpB,eAAK,OAAO,IAAI,KAAK;AACrB,gBAAM,IAAI,KAAK,UAAU,KAAK;AAC9B,YAAE,aAAa;AACf,YAAE,cAAc;AAChB,cAAI,MAAO,GAAE,gBAAgB;AAAA,QAC/B,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAED,QAAI,iBAAiB,eAAe;AAClC,cAAQ,IAAI,SAAS,SAAS,EAAE,KAAK,CAAC;AAAA,IACxC;AAAA,EACF;AAAA,EAEA,cAAc,OAAe,OAAwB;AACnD,UAAM,OAAO,KAAK,YAAY,IAAI,KAAK;AACvC,QAAI,KAAM,MAAK,KAAK,KAAK;AAAA,QACpB,MAAK,YAAY,IAAI,OAAO,CAAC,KAAK,CAAC;AAAA,EAC1C;AAAA,EAEA,UAAU,OAA6B;AACrC,QAAI,IAAI,KAAK,OAAO,IAAI,KAAK;AAC7B,QAAI,CAAC,GAAG;AACN,UAAI;AAAA,QACF,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,eAAe;AAAA,QACf,cAAc;AAAA,QACd,aAAa;AAAA,MACf;AACA,WAAK,OAAO,IAAI,OAAO,CAAC;AAAA,IAC1B;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAe,SAA4B,WAAwC;AACjF,UAAM,UAAuB,CAAC;AAC9B,eAAW,SAAS,IAAI,IAAI,OAAO,GAAG;AACpC,YAAM,OAAO,KAAK,YAAY,IAAI,KAAK;AACvC,UAAI,KAAM,SAAQ,KAAK,GAAG,IAAI;AAAA,IAChC;AACA,QAAI,QAAQ,WAAW,EAAG,QAAO,cAAc;AAG/C,YAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAExC,UAAM,MAAM,oBAAI,IAAqF;AACrG,eAAW,SAAS,SAAS;AAC3B,YAAM,MAAM,aAAa,MAAM,SAAS;AACxC,UAAI,QAAQ,IAAI,IAAI,GAAG;AACvB,UAAI,CAAC,OAAO;AACV,gBAAQ,EAAE,WAAW,MAAM,WAAW,OAAO,oBAAI,IAAI,EAAE;AACvD,YAAI,IAAI,KAAK,KAAK;AAAA,MACpB;AACA,YAAM,aAAa,UAAU,QAAQ,MAAM,KAAK;AAChD,YAAM,SAAsB,EAAE,MAAM,SAAS,YAAY,WAAW,MAAM,MAAM;AAChF,iBAAW,CAAC,MAAM,OAAO,SAAS,KAAK,MAAM,OAAO;AAClD,mBAAW,QAAQ,WAAW,qBAAqB,MAAM,OAAO,SAAS,GAAG;AAC1E,gBAAM,MAAM,IAAI,KAAK,UAAU,EAAE,GAAG,MAAM,OAAO,CAAC;AAAA,QACpD;AAAA,MACF;AAAA,IACF;AAEA,UAAM,YAAY,oBAAI,IAA8B;AACpD,eAAW,CAAC,KAAK,KAAK,KAAK,KAAK;AAC9B,UAAI,MAAM,MAAM,SAAS,EAAG;AAC5B,gBAAU,IAAI,KAAK,EAAE,WAAW,MAAM,WAAW,OAAO,MAAM,MAAM,CAAC;AAAA,IACvE;AACA,QAAI,UAAU,SAAS,EAAG,QAAO,cAAc;AAC/C,WAAO,WAAW,kBAAkB,EAAE,QAAQ,UAAU,CAAC;AAAA,EAC3D;AAAA;AAAA,EAGA,gBAAyC;AACvC,QAAI,KAAK,SAAU,QAAO,KAAK;AAC/B,UAAM,MAAsB,CAAC;AAC7B,eAAW,SAAS,KAAK,YAAY,KAAK,GAAG;AAC3C,YAAM,SAAS,KAAK,eAAe,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC;AACnD,YAAM,QAAQ,oBAAI,IAAoB;AACtC,iBAAW,CAAC,IAAI,KAAK,KAAK,OAAO,QAAQ;AACvC,mBAAW,CAAC,MAAM,IAAI,KAAK,MAAM,MAAO,OAAM,IAAI,GAAG,EAAE,KAAI,IAAI,IAAI,OAAO,KAAK,KAAK,CAAC;AAAA,MACvF;AACA,UAAI,MAAM,OAAO,EAAG,KAAI,KAAK,EAAE,OAAO,MAAM,CAAC;AAAA,IAC/C;AAEA,QAAI,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,OAAO,EAAE,MAAM,IAAI;AAC9C,SAAK,WAAW;AAChB,WAAO;AAAA,EACT;AACF;AAYO,SAAS,kBACd,WAA+B,CAAC,GAChC,SACe;AACf,SAAO,IAAI,kBAAkB,UAAU,OAAO;AAChD;AAaA,SAAS,eAAe,UAA+C;AACrE,QAAM,YAAwB,CAAC;AAC/B,MAAI,UAAiC,CAAC;AACtC,MAAI,iBAAgC;AACpC,aAAW,QAAQ,SAAS,OAAO;AACjC,QAAI,GAAI,aAAa,IAAI,GAAG;AAC1B,gBAAU,KAAK,EAAE,gBAAgB,OAAO,QAAQ,CAAC;AACjD,gBAAU,CAAC;AACX,uBAAiB,gBAAgB,IAAI;AAAA,IACvC,OAAO;AACL,cAAQ,KAAK,IAAI;AAAA,IACnB;AAAA,EACF;AACA,YAAU,KAAK,EAAE,gBAAgB,OAAO,QAAQ,CAAC;AACjD,SAAO;AACT;AAGA,SAAS,gBAAgB,MAAyC;AAChE,QAAM,IAAI,KAAK;AACf,SAAO,EAAE,KAAK,MAAM,KAAK,MAAM,EAAE,KAAK;AACxC;AAGA,SAAS,WAAW,MAAqC;AACvD,SAAO,KAAK,MAAM,YAAY;AAChC;AAEA,SAAS,gBAAgB,MAAsC;AAC7D,SAAO,GAAI,gBAAgB,IAAI,KAAKA,wBAAuB,IAAI,WAAW,IAAI,CAAC;AACjF;AAGA,SAAS,uBAAuB,MAAqC;AACnE,QAAM,OAAO,WAAW,IAAI;AAC5B,SAAO,KAAK,WAAW,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,MAAM,EAAE,CAAC;AACnE;AAaA,SAAS,aAAa,MAA0B;AAC9C,QAAM,QAAkB,CAAC;AACzB,MAAI,OAAO;AACX,MAAI,SAAS,KAAK;AAClB,SAAO,UAAU,OAAO,SAAS,UAAU;AACzC,UAAM,KAAK;AACX,UAAM,OAAO,GAAG,KAAK,YAAY;AACjC,QAAI,SAAS,QAAS,OAAM,QAAQ,GAAG,OAAO,KAAK,EAAE,QAAQ,QAAQ,GAAG,CAAC;AAAA,aAChE,SAAS,eAAe,KAAK,SAAS,WAAW,KAAK,SAAS,YAAa,QAAO;AAC5F,aAAS,OAAO;AAAA,EAClB;AACA,SAAO,EAAE,OAAO,MAAM,KAAK,OAAO,GAAG,KAAK;AAC5C;AAGA,SAAS,aAAa,MAAuB;AAC3C,QAAM,MAAiB,CAAC;AACxB,aAAW,QAAQ,KAAK,OAAO;AAC7B,QAAI,KAAK,SAAS,OAAQ,KAAI,KAAK,CAAC,KAAK,MAAM,KAAK,OAAO,KAAK,cAAc,IAAI,CAAC;AAAA,EACrF;AACA,SAAO;AACT;AAOA,SAAS,kBAAkB,OAAwB;AACjD,SAAO,MAAM,SAAS,KAAK,CAAC,kBAAkB,KAAK,KAAK;AAC1D;AAGA,SAAS,YAAYF,OAAuB;AAC1C,MAAI;AACF,WAAO,EAAE,IAAIA,OAAM,SAAK,6BAAaA,OAAM,MAAM,EAAE;AAAA,EACrD,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,uCAAuCA,KAAI,KAAK,EAAE,MAAM,CAAC;AAAA,EAC3E;AACF;AAMA,SAAS,kBAAkB,UAAkB,OAAmC;AAC9E,QAAM,QAAQ,MAAM,IAAI,CAAC,MAAM,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,MAAM,EAAE,EAAE,KAAK;AAC/D,SAAO,GAAG,QAAQ,IAAI,cAAc,KAAK,MAAM,KAAK,GAAG,CAAC;AAC1D;;;AzBjpBA,uBAA8B;AAC9B,sBAA8B;AAoC9B,IAAM,kBAAqC,CAAC,QAAQ,QAAQ,OAAO;AAEnE,SAAS,eAAe,SAAiD;AACvE,SAAO;AAAA,IACL,UAAU,QAAQ,YAAY;AAAA,IAC9B,UAAU,QAAQ,YAAY,CAAC;AAAA,IAC/B,QAAQ,QAAQ,UAAU;AAAA,IAC1B,QAAQ,QAAQ,UAAU;AAAA,IAC1B,SAAS,QAAQ,WAAW;AAAA,EAC9B;AACF;AAGA,SAAS,YAAY,IAAY,SAAqC;AAEpE,QAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,EAAE,CAAC,KAAK;AACrC,SAAO,QAAQ,KAAK,CAAC,QAAQ,MAAM,SAAS,GAAG,CAAC;AAClD;AA8BA,SAAS,UAAU,IAA6B;AAC9C,QAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,EAAE,CAAC,KAAK;AACrC,MAAI,MAAM,SAAS,MAAM,EAAG,QAAO;AACnC,MAAI,MAAM,SAAS,MAAM,EAAG,QAAO;AACnC,SAAO;AACT;AAGA,SAASG,OAAM,KAAgC;AAC7C,aAAW,OAAO,IAAI,QAAQ,OAAO,EAAG,QAAO,IAAI;AACnD,SAAO;AACT;AAGA,SAAS,YAAY,UAAsC;AACzD,QAAM,UAAU,oBAAI,IAA0B;AAC9C,aAAW,KAAK,UAAU;AACxB,UAAM,QAAS,EAAE,SAAS,MAAM,KAAK,CAAC,EAAE,CAAC,KAAK;AAC9C,QAAI,SAAS,QAAQ,IAAI,KAAK;AAC9B,QAAI,CAAC,QAAQ;AACX,eAAS,CAAC;AACV,cAAQ,IAAI,OAAO,MAAM;AAAA,IAC3B;AACA,WAAO,KAAK,CAAC;AAAA,EACf;AACA,QAAM,SAAiB,CAAC;AACxB,aAAW,CAAC,OAAO,IAAI,KAAK,SAAS;AACnC,WAAO,KAAK,EAAE,OAAO,UAAU,GAAG,KAAK,YAA4B,UAAU,KAAK,CAAC;AAAA,EACrF;AACA,SAAO;AACT;AAGA,SAAS,eACP,MACA,IACA,MACA,UACA,UACA,QACQ;AAIR,QAAM,SAAS,kBAAkB,EAAE,MAAM,MAAM;AAAA,IAC7C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,CAAC;AAAA,IACT,cAAc,MAAM;AAAA,IAAC;AAAA,EACvB,CAAC;AACD,QAAM,MAAM,OAAO;AAKnB,aAAW,QAAQ,IAAI,MAAM,OAAO,EAAG,MAAK,KAAK,cAAc;AAG/D,QAAM,MAAoB;AAAA,IACxB;AAAA,IACA,eAAe;AAAA,IACf;AAAA;AAAA;AAAA;AAAA,IAIA,WAAW,mBAAmB,KAAK,QAAQ;AAAA,IAC3C;AAAA,EACF;AACA,QAAM,EAAE,KAAK,UAAU,IAAI,UAAU,KAAK,YAAY,QAAQ,GAAG,GAAG;AAGpE,0BAAwB,WAAW,UAAU,UAAU;AAGvD,QAAM,UAAU,iBAAiB,EAAE;AAAA,IACjC;AAAA,IACA,EAAE,UAAU,IAAI,KAAK,CAAC,GAAG,YAAY,oBAAI,IAAI,EAAE;AAAA,IAC/C;AAAA,MACE;AAAA,MACA;AAAA,MACA,MAAM,oBAAoB;AAAA,MAC1B,KAAKA,OAAM,SAAS;AAAA,MACpB,cAAc,MAAM;AAAA,MAAC;AAAA,IACvB;AAAA,EACF;AACA,SAAO,QAAQ;AACjB;AAgBA,SAAS,eAAe,UAAiD;AACvE,MAAI,SAAS,aAAa,UAAU;AAClC,WAAO,kBAAkB,CAAC,GAAG,EAAE,OAAO,SAAS,SAAS,CAAC;AAAA,EAC3D;AAEA,SAAO,uBAAuB;AAChC;AAEO,SAAS,cAAc,UAA0B,CAAC,GAAY;AACnE,QAAM,WAAW,eAAe,OAAO;AACvC,QAAM,WAAW,eAAe;AAChC,QAAM,WAAW;AAIjB,MAAI,iBAAuC;AAC3C,QAAM,cAAc,MAAsB,mBAAmB,eAAe,QAAQ;AAEpF,SAAO;AAAA,IACL,SAAS;AAAA,IACT;AAAA,IACA,IAAI,WAA0B;AAC5B,aAAO,YAAY;AAAA,IACrB;AAAA,IACA;AAAA,IACA,UAAU,MAAc,IAAoC;AAC1D,UAAI,CAAC,YAAY,IAAI,SAAS,OAAO,EAAG,QAAO,EAAE,MAAM,KAAK,KAAK;AACjE,YAAM,OAAO,UAAU,EAAE;AAEzB,UAAI,SAAS,KAAM,QAAO,EAAE,MAAM,KAAK,KAAK;AAC5C,YAAM,MAAM,eAAe,MAAM,IAAI,MAAM,YAAY,GAAG,UAAU,SAAS,MAAM;AACnF,aAAO,EAAE,MAAM,KAAK,KAAK,KAAK;AAAA,IAChC;AAAA,EACF;AACF;AA+BO,SAAS,KAAK,UAA0B,CAAC,GAAsB;AACpE,QAAM,SAAS,cAAc,OAAO;AACpC,SAAO;AAAA,IACL,MAAM;AAAA,IACN,SAAS;AAAA,IACT,UAAU,MAAc,IAA2C;AACjE,UAAI,CAAC,YAAY,IAAI,OAAO,QAAQ,OAAO,EAAG,QAAO;AACrD,YAAM,MAAM,OAAO,UAAU,MAAM,EAAE;AAErC,aAAO,IAAI,SAAS,OAAO,OAAO;AAAA,IACpC;AAAA,EACF;AACF;AA4CA,IAAM,mBAAmB;AAQzB,SAAS,oBAA4B;AACnC,QAAM,WAAO,8BAAQ,+BAAc,aAAe,CAAC;AACnD,aAAO,uBAAK,MAAM,oBAAoB;AACxC;AA0BO,SAAS,QAAQ,UAA0B,CAAC,GAAyB;AAE1E,gBAAc,OAAO;AACrB,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,UAAwC;AAG5C,YAAM,OAAiC,SAAS,WAAW;AAC3D,YAAM,MAAO,KAAK,WAAW,CAAC;AAC9B,YAAM,QAAS,IAAI,UAAU,CAAC;AAC9B,YAAM,OAA0B;AAAA,QAC9B,MAAM;AAAA,QACN,SAAS;AAAA,QACT,SAAS;AAAA,QACT,KAAK,CAAC,EAAE,QAAQ,kBAAkB,GAAG,QAAQ,CAAC;AAAA,MAChD;AACA,YAAM,KAAK,IAAI;AAAA,IACjB;AAAA,EACF;AACF;AAeA,IAAM,UAA0B,EAAE,eAAe,MAAM,QAAQ;AAC/D,IAAO,cAAQ;","names":["childIds","pattern","normalizer","normalizer","asElement","metaFlag","targetedByStructuralPseudo","elementOf","computed","hasRawHtml","computed","asElement","hasDangerousHtml","computed","BASE_KEY","computed","asElement","hasDangerousHtml","computed","babelTraverse","babelParse","staticTokensOf","computed","path","JSX_LANGS","staticTokensOf","MagicString","import_node_module","path","moduleBase","LEGACY_PSEUDO_ELEMENTS","eolOf"]}
|