@graphrefly/ts 0.0.0

package/dist/chunk-D6BG7U6A.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graph/composition.ts"],"sourcesContent":["/**\n * CSP-2.8 composition helpers (D56).\n *\n * These are graph-layer, per-language helpers (D6/D24), not protocol primitives. The first cut is\n * intentionally static: branch nodes are declared at construction time, with real dep edges\n * `[source, rules]` that `describe()` can show. Dynamic rule add/remove is deferred by D56.\n */\n\nimport {\n\ttype Ctx,\n\tdepBatch,\n\tdepLatest,\n\tdepTerminal,\n\tisTerminalComplete,\n\tisTerminalError,\n\tterminalErrorValue,\n} from \"../ctx/types.js\";\nimport type { Node, NodeOptions } from \"../node/node.js\";\nimport type { DescribeEdge, DescribeNode, DescribeSnapshot } from \"./describe.js\";\nimport type { Graph, StateNode, SugarOpts } from \"./graph.js\";\nimport { initNode, type Operator } from \"./operators.js\";\n\n/** One unary operator step accepted by {@link pipe}. */\nexport type PipeOperator<TIn, TOut> = Operator<TIn, TOut>;\n\nexport type DescribeEvent =\n\t| { readonly type: \"node-added\"; readonly id: string; readonly node: DescribeNode }\n\t| { readonly type: \"node-removed\"; readonly id: string }\n\t| {\n\t\t\treadonly type: \"node-meta-changed\";\n\t\t\treadonly id: string;\n\t\t\treadonly prevMeta: Record<string, unknown>;\n\t\t\treadonly nextMeta: Record<string, unknown>;\n\t  }\n\t| { readonly type: \"edge-added\"; readonly from: string; readonly to: string }\n\t| { readonly type: \"edge-removed\"; readonly from: string; readonly to: string }\n\t| { readonly type: \"subgraph-mounted\"; readonly path: string }\n\t| { readonly type: \"subgraph-unmounted\"; readonly path: string };\n\nexport interface DescribeChangeset {\n\treadonly events: readonly DescribeEvent[];\n}\n\nfunction metaEqual(a: unknown, b: unknown): boolean {\n\tif (Object.is(a, b)) return true;\n\tif (a == null || b == null || typeof a !== \"object\" || typeof b !== \"object\") return false;\n\tif (Array.isArray(a) || Array.isArray(b)) {\n\t\tif (!Array.isArray(a) || !Array.isArray(b) || a.length !== b.length) return false;\n\t\tfor (let i = 0; i < a.length; i++) if (!metaEqual(a[i], b[i])) return false;\n\t\treturn true;\n\t}\n\tconst ak = Object.keys(a as Record<string, unknown>).sort();\n\tconst bk = Object.keys(b as Record<string, unknown>).sort();\n\tif (ak.length !== bk.length) return false;\n\tfor (let i = 0; i < ak.length; i++) {\n\t\tif (ak[i] !== bk[i]) return false;\n\t\tif (!metaEqual((a as Record<string, unknown>)[ak[i]], (b as Record<string, unknown>)[bk[i]]))\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nfunction edgeKey(e: DescribeEdge): string {\n\treturn `${e.from}\\0${e.to}`;\n}\n\nfunction cloneNode(n: DescribeNode): DescribeNode {\n\treturn {\n\t\t...n,\n\t\tdeps: [...n.deps],\n\t\t...(n.meta ? { meta: { ...n.meta } } : {}),\n\t};\n}\n\nfunction flattenSnapshot(snap: DescribeSnapshot): {\n\tnodes: Map<string, DescribeNode>;\n\tedges: Map<string, DescribeEdge>;\n\tsubgraphs: Set<string>;\n} {\n\tconst nodes = new Map<string, DescribeNode>();\n\tconst edges = new Map<string, DescribeEdge>();\n\tconst subgraphs = new Set<string>();\n\tconst visit = (s: DescribeSnapshot, indexPath = \"\"): void => {\n\t\tfor (const n of s.nodes) nodes.set(n.id, n);\n\t\tfor (const e of s.edges) edges.set(edgeKey(e), e);\n\t\ts.subgraphs?.forEach((child, i) => {\n\t\t\tconst prefixed = child.nodes.find((n) => n.id.includes(\"::\"))?.id;\n\t\t\tconst key =\n\t\t\t\tprefixed?.slice(0, prefixed.lastIndexOf(\"::\")) ??\n\t\t\t\t(child.name ? `${indexPath}${child.name}` : `${indexPath}${i}`);\n\t\t\tsubgraphs.add(key);\n\t\t\tvisit(child, `${key}/`);\n\t\t});\n\t};\n\tvisit(snap);\n\treturn { nodes, edges, subgraphs };\n}\n\n/**\n * Pure topology delta from one D39 `describe()` snapshot to another. No node refs, no clocks, no\n * old-core deps (D56). Values/status changes are not topology events; use `observe()` for data.\n */\nexport function topologyDiff(prev: DescribeSnapshot, next: DescribeSnapshot): DescribeChangeset {\n\tconst p = flattenSnapshot(prev);\n\tconst n = flattenSnapshot(next);\n\tconst events: DescribeEvent[] = [];\n\n\tfor (const path of [...n.subgraphs].filter((x) => !p.subgraphs.has(x)).sort())\n\t\tevents.push({ type: \"subgraph-mounted\", path });\n\n\tfor (const id of [...n.nodes.keys()].filter((x) => !p.nodes.has(x)).sort()) {\n\t\tevents.push({ type: \"node-added\", id, node: cloneNode(n.nodes.get(id) as DescribeNode) });\n\t}\n\n\tfor (const id of [...n.nodes.keys()].filter((x) => p.nodes.has(x)).sort()) {\n\t\tconst prevMeta = p.nodes.get(id)?.meta ?? {};\n\t\tconst nextMeta = n.nodes.get(id)?.meta ?? {};\n\t\tif (!metaEqual(prevMeta, nextMeta)) {\n\t\t\tevents.push({\n\t\t\t\ttype: \"node-meta-changed\",\n\t\t\t\tid,\n\t\t\t\tprevMeta: { ...prevMeta },\n\t\t\t\tnextMeta: { ...nextMeta },\n\t\t\t});\n\t\t}\n\t}\n\n\tfor (const [k, e] of [...n.edges.entries()].sort()) {\n\t\tif (!p.edges.has(k)) events.push({ type: \"edge-added\", from: e.from, to: e.to });\n\t}\n\tfor (const [k, e] of [...p.edges.entries()].sort()) {\n\t\tif (!n.edges.has(k)) events.push({ type: \"edge-removed\", from: e.from, to: e.to });\n\t}\n\n\tfor (const id of [...p.nodes.keys()].filter((x) => !n.nodes.has(x)).sort())\n\t\tevents.push({ type: \"node-removed\", id });\n\n\tfor (const path of [...p.subgraphs].filter((x) => !n.subgraphs.has(x)).sort())\n\t\tevents.push({ type: \"subgraph-unmounted\", path });\n\n\treturn { events };\n}\n\n/**\n * Compose unary operator factories into a graph-registered chain.\n *\n * Each step is instantiated through `g.initNode`, so `describe()` still shows the real\n * per-operator factory names and declared edges (D6/D39/D45). This is graph-layer sugar, not a\n * new verb or protocol primitive.\n */\nexport function pipe<S>(g: Graph, source: Node<S>): Node<S>;\nexport function pipe<S, A>(g: Graph, source: Node<S>, op1: PipeOperator<S, A>): Node<A>;\nexport function pipe<S, A, B>(\n\tg: Graph,\n\tsource: Node<S>,\n\top1: PipeOperator<S, A>,\n\top2: PipeOperator<A, B>,\n): Node<B>;\nexport function pipe<S, A, B, C>(\n\tg: Graph,\n\tsource: Node<S>,\n\top1: PipeOperator<S, A>,\n\top2: PipeOperator<A, B>,\n\top3: PipeOperator<B, C>,\n): Node<C>;\nexport function pipe<S, A, B, C, D>(\n\tg: Graph,\n\tsource: Node<S>,\n\top1: PipeOperator<S, A>,\n\top2: PipeOperator<A, B>,\n\top3: PipeOperator<B, C>,\n\top4: PipeOperator<C, D>,\n): Node<D>;\nexport function pipe<S, A, B, C, D, E>(\n\tg: Graph,\n\tsource: Node<S>,\n\top1: PipeOperator<S, A>,\n\top2: PipeOperator<A, B>,\n\top3: PipeOperator<B, C>,\n\top4: PipeOperator<C, D>,\n\top5: PipeOperator<D, E>,\n): Node<E>;\nexport function pipe<S, A, B, C, D, E, F>(\n\tg: Graph,\n\tsource: Node<S>,\n\top1: PipeOperator<S, A>,\n\top2: PipeOperator<A, B>,\n\top3: PipeOperator<B, C>,\n\top4: PipeOperator<C, D>,\n\top5: PipeOperator<D, E>,\n\top6: PipeOperator<E, F>,\n): Node<F>;\nexport function pipe<S>(\n\tg: Graph,\n\tsource: Node<S>,\n\t...ops: readonly PipeOperator<unknown, unknown>[]\n): Node<unknown>;\nexport function pipe(\n\tg: Graph,\n\tsource: Node<unknown>,\n\t...ops: readonly PipeOperator<unknown, unknown>[]\n): Node<unknown> {\n\tlet current = source;\n\tfor (const op of ops) current = g.initNode(op, [current]);\n\treturn current;\n}\n\nexport interface StratifyRule<R> {\n\treadonly name: string;\n\treadonly rule: R;\n\treadonly meta?: Record<string, unknown>;\n}\n\nexport interface StratifyBranchOptions<T> extends Omit<NodeOptions<T>, \"dispatcher\"> {}\n\n/** D56 branch node body: declared deps `[source, rules]`, no internal subscribe island. */\nexport function stratifyBranch<T, R>(\n\tsource: Node<T>,\n\trules: Node<R>,\n\tclassifier: (rules: R, value: T) => boolean,\n\topts: StratifyBranchOptions<T> = {},\n): Node<T> {\n\tconst op = stratifyBranchOperator<T, R>(classifier);\n\treturn initNode(op, [source as Node<unknown>, rules as Node<unknown>], opts);\n}\n\nfunction stratifyBranchOperator<T, R>(\n\tclassifier: (rules: R, value: T) => boolean,\n): Operator<unknown, T> {\n\treturn {\n\t\tfactory: \"stratifyBranch\",\n\t\topts: {\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t\tterminalAsRealInput: true,\n\t\t},\n\t\tbody: (ctx: Ctx) => {\n\t\t\tconst sourceBatch = depBatch(ctx, 0);\n\t\t\tconst sourceTerminal = depTerminal(ctx, 0);\n\t\t\tconst rules = depLatest(ctx, 1) as R | undefined;\n\t\t\tif (rules !== undefined && sourceBatch !== null) {\n\t\t\t\tfor (const value of sourceBatch as readonly T[]) {\n\t\t\t\t\tif (classifier(rules, value)) ctx.down([[\"DATA\", value]]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isTerminalComplete(sourceTerminal)) {\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t} else if (isTerminalError(sourceTerminal)) {\n\t\t\t\tctx.down([[\"ERROR\", terminalErrorValue(sourceTerminal)]]);\n\t\t\t}\n\t\t},\n\t};\n}\n\nexport interface StratifyOptions<R = unknown> {\n\t/** Branch id prefix. Default `branch`, yielding ids like `branch/even`. */\n\tprefix?: string;\n\t/** Optional graph sugar opts for the rules state node. */\n\trules?: SugarOpts<readonly StratifyRule<R>[]>;\n\t/** Optional graph sugar opts for each branch node, keyed by rule name. */\n\tbranches?: Record<string, SugarOpts<unknown>>;\n}\n\nexport interface Stratified<T, R> {\n\treadonly rules: StateNode<readonly StratifyRule<R>[]>;\n\treadonly branches: Record<string, Node<T>>;\n}\n\n/**\n * Build static stratification branches in `g` (D56 first cut). Rules are a state node so future\n * classifier data changes affect future source items, but branch count is fixed at construction.\n */\nexport function stratify<T, R>(\n\tg: Graph,\n\tsource: Node<T>,\n\trules: readonly StratifyRule<R>[],\n\tclassifier: (rule: R, value: T) => boolean,\n\topts: StratifyOptions<R> = {},\n): Stratified<T, R> {\n\tconst prefix = opts.prefix ?? \"branch\";\n\tconst seen = new Set<string>();\n\tfor (const { name } of rules) {\n\t\tif (seen.has(name)) throw new Error(`stratify: duplicate rule name '${name}'`);\n\t\tseen.add(name);\n\t}\n\tconst { meta: rulesMeta, ...rulesOpts } = opts.rules ?? {};\n\tconst rulesNode = g.state<readonly StratifyRule<R>[]>([...rules], {\n\t\t...rulesOpts,\n\t\tname: rulesOpts.name ?? `${prefix}/rules`,\n\t\tmeta: { ...(rulesMeta ?? {}), kind: \"stratify_rules\" },\n\t});\n\tconst branches: Record<string, Node<T>> = {};\n\tfor (const rule of rules) {\n\t\tconst op = stratifyBranchOperator<T, readonly StratifyRule<R>[]>((all, value) => {\n\t\t\tconst current = all.find((r) => r.name === rule.name);\n\t\t\treturn current === undefined ? false : classifier(current.rule, value);\n\t\t});\n\t\tconst { meta: branchMeta, ...branchOpts } = opts.branches?.[rule.name] ?? {};\n\t\tbranches[rule.name] = g.initNode(op, [source as Node<unknown>, rulesNode as Node<unknown>], {\n\t\t\t...branchOpts,\n\t\t\tname: branchOpts.name ?? `${prefix}/${rule.name}`,\n\t\t\tmeta: { ...(rule.meta ?? {}), ...(branchMeta ?? {}), branch: rule.name },\n\t\t}) as Node<T>;\n\t}\n\treturn { rules: rulesNode, branches };\n}\n"],"mappings":";;;;;;;;;;;;;AA2CA,SAAS,UAAU,GAAY,GAAqB;AACnD,MAAI,OAAO,GAAG,GAAG,CAAC,EAAG,QAAO;AAC5B,MAAI,KAAK,QAAQ,KAAK,QAAQ,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO;AACrF,MAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;AACzC,QAAI,CAAC,MAAM,QAAQ,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,KAAK,EAAE,WAAW,EAAE,OAAQ,QAAO;AAC5E,aAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,CAAC,UAAU,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAG,QAAO;AACtE,WAAO;AAAA,EACR;AACA,QAAM,KAAK,OAAO,KAAK,CAA4B,EAAE,KAAK;AAC1D,QAAM,KAAK,OAAO,KAAK,CAA4B,EAAE,KAAK;AAC1D,MAAI,GAAG,WAAW,GAAG,OAAQ,QAAO;AACpC,WAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AACnC,QAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAG,QAAO;AAC5B,QAAI,CAAC,UAAW,EAA8B,GAAG,CAAC,CAAC,GAAI,EAA8B,GAAG,CAAC,CAAC,CAAC;AAC1F,aAAO;AAAA,EACT;AACA,SAAO;AACR;AAEA,SAAS,QAAQ,GAAyB;AACzC,SAAO,GAAG,EAAE,IAAI,KAAK,EAAE,EAAE;AAC1B;AAEA,SAAS,UAAU,GAA+B;AACjD,SAAO;AAAA,IACN,GAAG;AAAA,IACH,MAAM,CAAC,GAAG,EAAE,IAAI;AAAA,IAChB,GAAI,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC;AAAA,EACzC;AACD;AAEA,SAAS,gBAAgB,MAIvB;AACD,QAAM,QAAQ,oBAAI,IAA0B;AAC5C,QAAM,QAAQ,oBAAI,IAA0B;AAC5C,QAAM,YAAY,oBAAI,IAAY;AAClC,QAAM,QAAQ,CAAC,GAAqB,YAAY,OAAa;AAC5D,eAAW,KAAK,EAAE,MAAO,OAAM,IAAI,EAAE,IAAI,CAAC;AAC1C,eAAW,KAAK,EAAE,MAAO,OAAM,IAAI,QAAQ,CAAC,GAAG,CAAC;AAChD,MAAE,WAAW,QAAQ,CAAC,OAAO,MAAM;AAClC,YAAM,WAAW,MAAM,MAAM,KAAK,CAAC,MAAM,EAAE,GAAG,SAAS,IAAI,CAAC,GAAG;AAC/D,YAAM,MACL,UAAU,MAAM,GAAG,SAAS,YAAY,IAAI,CAAC,MAC5C,MAAM,OAAO,GAAG,SAAS,GAAG,MAAM,IAAI,KAAK,GAAG,SAAS,GAAG,CAAC;AAC7D,gBAAU,IAAI,GAAG;AACjB,YAAM,OAAO,GAAG,GAAG,GAAG;AAAA,IACvB,CAAC;AAAA,EACF;AACA,QAAM,IAAI;AACV,SAAO,EAAE,OAAO,OAAO,UAAU;AAClC;AAMO,SAAS,aAAa,MAAwB,MAA2C;AAC/F,QAAM,IAAI,gBAAgB,IAAI;AAC9B,QAAM,IAAI,gBAAgB,IAAI;AAC9B,QAAM,SAA0B,CAAC;AAEjC,aAAW,QAAQ,CAAC,GAAG,EAAE,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,IAAI,CAAC,CAAC,EAAE,KAAK;AAC3E,WAAO,KAAK,EAAE,MAAM,oBAAoB,KAAK,CAAC;AAE/C,aAAW,MAAM,CAAC,GAAG,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG;AAC3E,WAAO,KAAK,EAAE,MAAM,cAAc,IAAI,MAAM,UAAU,EAAE,MAAM,IAAI,EAAE,CAAiB,EAAE,CAAC;AAAA,EACzF;AAEA,aAAW,MAAM,CAAC,GAAG,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG;AAC1E,UAAM,WAAW,EAAE,MAAM,IAAI,EAAE,GAAG,QAAQ,CAAC;AAC3C,UAAM,WAAW,EAAE,MAAM,IAAI,EAAE,GAAG,QAAQ,CAAC;AAC3C,QAAI,CAAC,UAAU,UAAU,QAAQ,GAAG;AACnC,aAAO,KAAK;AAAA,QACX,MAAM;AAAA,QACN;AAAA,QACA,UAAU,EAAE,GAAG,SAAS;AAAA,QACxB,UAAU,EAAE,GAAG,SAAS;AAAA,MACzB,CAAC;AAAA,IACF;AAAA,EACD;AAEA,aAAW,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,QAAQ,CAAC,EAAE,KAAK,GAAG;AACnD,QAAI,CAAC,EAAE,MAAM,IAAI,CAAC,EAAG,QAAO,KAAK,EAAE,MAAM,cAAc,MAAM,EAAE,MAAM,IAAI,EAAE,GAAG,CAAC;AAAA,EAChF;AACA,aAAW,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,QAAQ,CAAC,EAAE,KAAK,GAAG;AACnD,QAAI,CAAC,EAAE,MAAM,IAAI,CAAC,EAAG,QAAO,KAAK,EAAE,MAAM,gBAAgB,MAAM,EAAE,MAAM,IAAI,EAAE,GAAG,CAAC;AAAA,EAClF;AAEA,aAAW,MAAM,CAAC,GAAG,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK;AACxE,WAAO,KAAK,EAAE,MAAM,gBAAgB,GAAG,CAAC;AAEzC,aAAW,QAAQ,CAAC,GAAG,EAAE,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,IAAI,CAAC,CAAC,EAAE,KAAK;AAC3E,WAAO,KAAK,EAAE,MAAM,sBAAsB,KAAK,CAAC;AAEjD,SAAO,EAAE,OAAO;AACjB;AAwDO,SAAS,KACf,GACA,WACG,KACa;AAChB,MAAI,UAAU;AACd,aAAW,MAAM,IAAK,WAAU,EAAE,SAAS,IAAI,CAAC,OAAO,CAAC;AACxD,SAAO;AACR;AAWO,SAAS,eACf,QACA,OACA,YACA,OAAiC,CAAC,GACxB;AACV,QAAM,KAAK,uBAA6B,UAAU;AAClD,SAAO,SAAS,IAAI,CAAC,QAAyB,KAAsB,GAAG,IAAI;AAC5E;AAEA,SAAS,uBACR,YACuB;AACvB,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM;AAAA,MACL,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,MACpB,qBAAqB;AAAA,IACtB;AAAA,IACA,MAAM,CAAC,QAAa;AACnB,YAAM,cAAc,SAAS,KAAK,CAAC;AACnC,YAAM,iBAAiB,YAAY,KAAK,CAAC;AACzC,YAAM,QAAQ,UAAU,KAAK,CAAC;AAC9B,UAAI,UAAU,UAAa,gBAAgB,MAAM;AAChD,mBAAW,SAAS,aAA6B;AAChD,cAAI,WAAW,OAAO,KAAK,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC;AAAA,QACzD;AAAA,MACD;AACA,UAAI,mBAAmB,cAAc,GAAG;AACvC,YAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,MACxB,WAAW,gBAAgB,cAAc,GAAG;AAC3C,YAAI,KAAK,CAAC,CAAC,SAAS,mBAAmB,cAAc,CAAC,CAAC,CAAC;AAAA,MACzD;AAAA,IACD;AAAA,EACD;AACD;AAoBO,SAAS,SACf,GACA,QACA,OACA,YACA,OAA2B,CAAC,GACT;AACnB,QAAM,SAAS,KAAK,UAAU;AAC9B,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,EAAE,KAAK,KAAK,OAAO;AAC7B,QAAI,KAAK,IAAI,IAAI,EAAG,OAAM,IAAI,MAAM,kCAAkC,IAAI,GAAG;AAC7E,SAAK,IAAI,IAAI;AAAA,EACd;AACA,QAAM,EAAE,MAAM,WAAW,GAAG,UAAU,IAAI,KAAK,SAAS,CAAC;AACzD,QAAM,YAAY,EAAE,MAAkC,CAAC,GAAG,KAAK,GAAG;AAAA,IACjE,GAAG;AAAA,IACH,MAAM,UAAU,QAAQ,GAAG,MAAM;AAAA,IACjC,MAAM,EAAE,GAAI,aAAa,CAAC,GAAI,MAAM,iBAAiB;AAAA,EACtD,CAAC;AACD,QAAM,WAAoC,CAAC;AAC3C,aAAW,QAAQ,OAAO;AACzB,UAAM,KAAK,uBAAsD,CAAC,KAAK,UAAU;AAChF,YAAM,UAAU,IAAI,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,IAAI;AACpD,aAAO,YAAY,SAAY,QAAQ,WAAW,QAAQ,MAAM,KAAK;AAAA,IACtE,CAAC;AACD,UAAM,EAAE,MAAM,YAAY,GAAG,WAAW,IAAI,KAAK,WAAW,KAAK,IAAI,KAAK,CAAC;AAC3E,aAAS,KAAK,IAAI,IAAI,EAAE,SAAS,IAAI,CAAC,QAAyB,SAA0B,GAAG;AAAA,MAC3F,GAAG;AAAA,MACH,MAAM,WAAW,QAAQ,GAAG,MAAM,IAAI,KAAK,IAAI;AAAA,MAC/C,MAAM,EAAE,GAAI,KAAK,QAAQ,CAAC,GAAI,GAAI,cAAc,CAAC,GAAI,QAAQ,KAAK,KAAK;AAAA,IACxE,CAAC;AAAA,EACF;AACA,SAAO,EAAE,OAAO,WAAW,SAAS;AACrC;","names":[]}