ts-rules-composer 1.6.0 → 1.7.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.
@@ -1 +1 @@
1
- {"version":3,"file":"mermaid.js","names":["toGraph","mermaidId","id","escapeLabel","label","char","box","render","node","parts","part","i","toMermaid","body","rule"],"sources":["../src/lib/mermaid/to-mermaid.ts"],"sourcesContent":["import type { GraphNode } from \"../graph/node\";\nimport { toGraph } from \"../graph/to-graph\";\nimport type { Rule } from \"../types\";\n\ntype Fragment = {\n nodes: string[];\n edges: string[];\n entry: string;\n exit: string;\n};\n\nconst mermaidId = (id: string) => id.replace(/[^A-Za-z0-9_]/g, \"_\");\n\n/**\n * Labels come from function names and `named()` strings, so they are\n * untrusted. Everything except letters, digits, spaces and a few plain\n * punctuation marks becomes a numeric entity (`#40;`). That covers quotes,\n * brackets, `%` (directives), `#`, `;` and every kind of line break, so a label\n * can never leave its quoted string or start a statement of its own.\n */\nconst escapeLabel = (label: string) =>\n label.replace(/[^\\p{L}\\p{N} _.,:/-]/gu, (char) => `#${char.codePointAt(0)};`);\n\nconst box = (id: string, label: string) => ` ${id}[\"${escapeLabel(label)}\"]`;\n\nconst render = (node: GraphNode): Fragment => {\n const id = mermaidId(node.id);\n\n if (node.kind === \"sequence\" && node.steps.length > 0) {\n const parts = node.steps.map(render);\n return {\n nodes: parts.flatMap((part) => part.nodes),\n edges: [\n ...parts.flatMap((part) => part.edges),\n ...parts\n .slice(1)\n .map((part, i) => ` ${parts[i].exit} --> ${part.entry}`),\n ],\n entry: parts[0].entry,\n exit: parts[parts.length - 1].exit,\n };\n }\n\n // Leaves and kinds the skeleton cannot draw yet render as a single box.\n const label = node.kind === \"rule\" ? node.label : node.kind;\n return { nodes: [box(id, label)], edges: [], entry: id, exit: id };\n};\n\n/**\n * Renders a rule as Mermaid flowchart source, without running it.\n *\n * Skeleton: draws leaf rules and `pipeRules` sequences only.\n *\n * @example\n * const text = toMermaid(pipeRules([hasItems, withinLimit]));\n */\nexport const toMermaid = <TInput, TError, TContext>(\n rule: Rule<TInput, TError, TContext>,\n): string => {\n const body = render(toGraph(rule).root);\n return [\n \"flowchart TD\",\n \" input([input])\",\n ...body.nodes,\n \" passed([passed])\",\n ` input --> ${body.entry}`,\n ...body.edges,\n ` ${body.exit} --> passed`,\n ].join(\"\\n\");\n};\n"],"mappings":"A,2CAWA,MAAMC,EAAa,GAAeC,EAAG,QAAQ,iBAAkB,GAAG,EAS5DC,EAAe,GACnBC,EAAM,QAAQ,yBAA2B,GAAS,IAAIC,EAAK,YAAY,CAAC,EAAE,EAAE,EAExEC,GAAO,EAAY,IAAkB,KAAKJ,EAAG,IAAIC,EAAYC,CAAK,EAAE,IAEpEG,EAAU,GAA8B,CAC5C,IAAML,EAAKD,EAAUO,EAAK,EAAE,EAE5B,GAAIA,EAAK,OAAS,YAAcA,EAAK,MAAM,OAAS,EAAG,CACrD,IAAMC,EAAQD,EAAK,MAAM,IAAID,CAAM,EACnC,MAAO,CACL,MAAOE,EAAM,QAAS,GAASC,EAAK,KAAK,EACzC,MAAO,CACL,GAAGD,EAAM,QAAS,GAASC,EAAK,KAAK,EACrC,GAAGD,EACA,MAAM,CAAC,CAAC,CACR,KAAK,EAAM,IAAM,KAAKA,EAAME,EAAE,CAAC,KAAK,OAAOD,EAAK,OAAO,CAC5D,EACA,MAAOD,EAAM,EAAE,CAAC,MAChB,KAAMA,EAAMA,EAAM,OAAS,EAAE,CAAC,IAChC,CACF,CAGA,IAAML,EAAQI,EAAK,OAAS,OAASA,EAAK,MAAQA,EAAK,KACvD,MAAO,CAAE,MAAO,CAACF,EAAIJ,EAAIE,CAAK,CAAC,EAAG,MAAO,CAAC,EAAG,MAAOF,EAAI,KAAMA,CAAG,CACnE,EAUaU,EACX,GACW,CACX,IAAMC,EAAON,EAAOP,EAAQc,CAAI,CAAC,CAAC,IAAI,EACtC,MAAO,CACL,eACA,mBACA,GAAGD,EAAK,MACR,qBACA,eAAeA,EAAK,QACpB,GAAGA,EAAK,MACR,KAAKA,EAAK,KAAK,YACjB,CAAC,CAAC,KAAK;CAAI,CACb,E"}
1
+ {"version":3,"file":"mermaid.js","names":["toGraph","labelLimit","requested","clip","chars","text","max","direction","param","value","badge","node","verbose","withBadges","label","badges","mermaidId","id","escapeLabel","char","box","link","from","fallbackLabel","arrow","to","linkAll","port","group","title","nodes","fragment","parts","composite","isLeaf","render","own","cfg","part","draw","sub","child","i","sides","cases","key","fallback","routed","fork","join","gate","main","onFail","toMermaid","requestedDirection","options","body","rule","maxLabelLength","fails","failEdges"],"sources":["../src/lib/mermaid/to-mermaid.ts"],"sourcesContent":["import type { GraphNode } from \"../graph/node\";\nimport { toGraph } from \"../graph/to-graph\";\nimport type { Rule } from \"../types\";\n\n/** A point control leaves a fragment from, with an optional edge label. */\ntype Port = { id: string; label?: string };\n\n/**\n * A drawn piece of the diagram. `exits` continue to whatever comes next when the\n * piece passes; `fails` are where it can fail, left for the parent to route\n * (to `failed`, or to a fallback).\n */\ntype Fragment = {\n nodes: string[];\n edges: string[];\n entry: string;\n exits: Port[];\n fails: Port[];\n};\n\nexport type MermaidOptions = {\n /** Flow direction. Default `\"TD\"`. */\n direction?: \"TD\" | \"LR\";\n /** Draw dotted edges from steps that can fail to `failed`. Default `false`: they roughly double the edges and bury the happy path. */\n failEdges?: boolean;\n /** Also show `withDebug`, `withTap` and `mapError` decorators. Default `false`. */\n verbose?: boolean;\n /** Longest label text, cut with `…`. Default `40`. Badges are never cut. */\n maxLabelLength?: number;\n};\n\ntype Settings = { verbose: boolean; max: number };\n\n/** At least 2, so a label keeps one character before its `…`. */\nconst labelLimit = (requested: number) =>\n Number.isNaN(requested) ? 40 : Math.max(2, Math.floor(requested));\n\nconst clip = (max: number, text: string) => {\n const chars = [...text];\n return chars.length > max ? `${chars.slice(0, max - 1).join(\"\")}…` : text;\n};\n\nconst direction = (requested: string) => (requested === \"LR\" ? \"LR\" : \"TD\");\n\nconst param = (value: unknown) =>\n typeof value === \"number\" || typeof value === \"string\" ? `${value}` : \"?\";\n\n/** Short text for a decorator, or `undefined` when it stays hidden. */\nconst badge = (\n node: Extract<GraphNode, { kind: \"decorator\" }>,\n verbose: boolean,\n) => {\n switch (node.decorator) {\n case \"timeout\":\n return `⏱ ${param(node.params.ms)}ms`;\n case \"retry\":\n return `↻ ${param(node.params.attempts)}x`;\n case \"memoize\":\n return \"⚡ cached\";\n default:\n return verbose ? node.decorator : undefined;\n }\n};\n\nconst withBadges = (label: string, badges: string[]) =>\n [label, ...badges].join(\" \");\n\nconst mermaidId = (id: string) => id.replace(/[^A-Za-z0-9_]/g, \"_\");\n\n/**\n * Labels come from function names and `named()` strings, so they are\n * untrusted. Everything except letters, digits, spaces and a few plain\n * punctuation marks becomes a numeric entity (`#40;`). That covers quotes,\n * brackets, `%` (directives), `#`, `;` and every kind of line break, so a label\n * can never leave its quoted string or start a statement of its own.\n */\nconst escapeLabel = (label: string) =>\n label.replace(/[^\\p{L}\\p{N} _.,:/-]/gu, (char) => `#${char.codePointAt(0)};`);\n\nconst box = (id: string, label: string) => ` ${id}[\"${escapeLabel(label)}\"]`;\n\nconst link = (\n from: Port,\n to: string,\n arrow = \"-->\",\n fallbackLabel?: string,\n) => {\n const label = from.label ?? fallbackLabel;\n return label === undefined\n ? ` ${from.id} ${arrow} ${to}`\n : ` ${from.id} ${arrow}|\"${escapeLabel(label)}\"| ${to}`;\n};\n\nconst linkAll = (from: Port[], to: string, arrow = \"-->\", label?: string) =>\n from.map((port) => link(port, to, arrow, label));\n\nconst group = (id: string, title: string, nodes: string[]) => [\n ` subgraph ${id}_sg[\"${escapeLabel(title)}\"]`,\n ...nodes,\n \" end\",\n];\n\nconst fragment = (parts: Partial<Fragment> & { entry: string }): Fragment => ({\n nodes: [],\n edges: [],\n exits: [],\n fails: [],\n ...parts,\n});\n\nconst composite = new Set<string>([\n \"sequence\",\n \"branch\",\n \"switch\",\n \"all\",\n \"any\",\n \"not\",\n \"fallback\",\n \"field\",\n]);\n\nconst isLeaf = (node: GraphNode) => !composite.has(node.kind);\n\n/** Draws the rule at `id` plus whichever children it has, in order. */\nconst render = (\n node: GraphNode,\n cfg: Settings,\n badges: string[] = [],\n): Fragment => {\n if (node.kind === \"decorator\") {\n const own = badge(node, cfg.verbose);\n return render(node.rule, cfg, own ? [...badges, own] : badges);\n }\n const part = draw(node, cfg, badges);\n return badges.length > 0 && !isLeaf(node)\n ? {\n ...part,\n nodes: group(\n `${mermaidId(node.id)}_badge`,\n badges.join(\" \"),\n part.nodes,\n ),\n }\n : part;\n};\n\nconst draw = (\n node: Exclude<GraphNode, { kind: \"decorator\" }>,\n cfg: Settings,\n badges: string[],\n): Fragment => {\n const id = mermaidId(node.id);\n const text = (value: string) => clip(cfg.max, value);\n const sub = (child: GraphNode) => render(child, cfg);\n\n switch (node.kind) {\n case \"sequence\": {\n if (node.steps.length === 0) {\n return fragment({\n nodes: [` ${id}(\"no rules\")`],\n entry: id,\n exits: [{ id }],\n });\n }\n const parts = node.steps.map(sub);\n return fragment({\n nodes: parts.flatMap((part) => part.nodes),\n edges: [\n ...parts.flatMap((part) => part.edges),\n ...parts\n .slice(1)\n .flatMap((part, i) => linkAll(parts[i].exits, part.entry)),\n ],\n entry: parts[0].entry,\n exits: parts[parts.length - 1].exits,\n fails: parts.flatMap((part) => part.fails),\n });\n }\n case \"branch\": {\n const sides = [\n { child: node.ifTrue, label: \"yes\" },\n { child: node.ifFalse, label: \"no\" },\n ].map(({ child, label }) => ({\n label,\n part: child && sub(child),\n }));\n return fragment({\n nodes: [\n ` ${id}{\"${escapeLabel(text(node.test))}\"}`,\n ...sides.flatMap(({ part }) => part?.nodes ?? []),\n ],\n edges: sides.flatMap(({ part, label }) => [\n ...(part ? [link({ id, label }, part.entry)] : []),\n ...(part?.edges ?? []),\n ]),\n entry: id,\n exits: sides.flatMap(\n ({ part, label }) => part?.exits ?? [{ id, label }],\n ),\n fails: sides.flatMap(({ part }) => part?.fails ?? []),\n });\n }\n case \"switch\": {\n const cases = node.cases.map(({ key, node: child }) => ({\n label: text(key),\n part: sub(child),\n }));\n const fallback = node.default && {\n label: \"default\",\n part: sub(node.default),\n };\n const routed = fallback ? [...cases, fallback] : cases;\n return fragment({\n nodes: [\n ` ${id}{\"${escapeLabel(text(node.selector))}\"}`,\n ...routed.flatMap(({ part }) => part.nodes),\n ],\n edges: routed.flatMap(({ part, label }) => [\n link({ id, label }, part.entry),\n ...part.edges,\n ]),\n entry: id,\n exits: routed.flatMap(({ part }) => part.exits),\n fails: [\n ...routed.flatMap(({ part }) => part.fails),\n ...(fallback\n ? []\n : [\n {\n id,\n label:\n node.defaultError === undefined ? \"no match\" : \"default\",\n },\n ]),\n ],\n });\n }\n case \"all\":\n case \"any\": {\n const parts = node.rules.map(sub);\n const fork = `${id}_in`;\n const join = `${id}_out`;\n const title =\n node.kind === \"all\" ? \"all must pass\" : \"at least one must pass\";\n return fragment({\n nodes: group(id, title, [\n ` ${fork}((\"fork\"))`,\n ...parts.flatMap((part) => part.nodes),\n ` ${join}((\"join\"))`,\n ]),\n edges: [\n ...(parts.length === 0 ? [` ${fork} --> ${join}`] : []),\n ...parts.flatMap((part) => [\n ` ${fork} --> ${part.entry}`,\n ...part.edges,\n ...linkAll(part.exits, join),\n ]),\n ],\n entry: fork,\n exits: [{ id: join }],\n fails: parts.length === 0 ? [] : [{ id: join }],\n });\n }\n case \"not\": {\n const part = sub(node.rule);\n const gate = `${id}_gate`;\n return fragment({\n nodes: [...group(id, \"not\", part.nodes), ` ${gate}{\"inner failed?\"}`],\n edges: [...part.edges, ...linkAll(part.exits, gate)],\n entry: part.entry,\n // `not` passes when the inner rule fails, so the happy edge reads \"yes\".\n exits: [{ id: gate, label: \"yes\" }],\n fails: [{ id: gate, label: \"no\" }],\n });\n }\n case \"fallback\": {\n const main = sub(node.main);\n const fallback = sub(node.fallback);\n const onFail = node.guard ? `on fail if ${text(node.guard)}` : \"on fail\";\n return fragment({\n nodes: [...main.nodes, ...fallback.nodes],\n edges: [\n ...main.edges,\n ...fallback.edges,\n ...linkAll(main.fails, fallback.entry, \"-.->\", onFail),\n ],\n entry: main.entry,\n exits: [...main.exits, ...fallback.exits],\n // A guard that rejects the error lets the main failure through.\n fails: [...(node.guard ? main.fails : []), ...fallback.fails],\n });\n }\n case \"field\": {\n const part = sub(node.rule);\n return fragment({\n ...part,\n nodes: group(id, `field: ${text(node.getter)}`, part.nodes),\n });\n }\n case \"effect\":\n return fragment({\n nodes: [\n ` ${id}(\"${escapeLabel(withBadges(text(node.label), badges))}\")`,\n ],\n entry: id,\n exits: [{ id }],\n });\n }\n\n // Every other kind was drawn above, so this is a leaf rule.\n return fragment({\n nodes: [box(id, withBadges(text(node.label), badges))],\n entry: id,\n exits: [{ id }],\n fails: [{ id }],\n });\n};\n\n/**\n * Renders a rule as Mermaid flowchart source, without running it.\n *\n * Draws every node kind. Timeout, retry and memoize show as badges on the\n * wrapped rule; debug, tap and mapError only with `verbose`.\n *\n * @example\n * const text = toMermaid(pipeRules([hasItems, withinLimit]));\n */\nexport const toMermaid = <TInput, TError, TContext>(\n rule: Rule<TInput, TError, TContext>,\n options: MermaidOptions = {},\n): string => {\n const {\n direction: requestedDirection = \"TD\",\n failEdges = false,\n verbose = false,\n maxLabelLength = 40,\n } = options;\n const body = render(toGraph(rule).root, {\n verbose,\n max: labelLimit(maxLabelLength),\n });\n const fails = failEdges ? body.fails : [];\n return [\n `flowchart ${direction(requestedDirection)}`,\n \" input([input])\",\n ...body.nodes,\n \" passed([passed])\",\n ...(fails.length > 0 ? [\" failed([failed])\"] : []),\n ` input --> ${body.entry}`,\n ...body.edges,\n ...linkAll(body.exits, \"passed\"),\n ...linkAll(fails, \"failed\", \"-.->\", \"fail\"),\n ].join(\"\\n\");\n};\n"],"mappings":"A,2CAkCA,MAAMC,EAAc,GAClB,OAAO,MAAMC,CAAS,EAAI,GAAK,KAAK,IAAI,EAAG,KAAK,MAAMA,CAAS,CAAC,EAE5DC,GAAQ,EAAa,IAAiB,CAC1C,IAAMC,EAAQ,CAAC,GAAGC,CAAI,EACtB,OAAOD,EAAM,OAASE,EAAM,GAAGF,EAAM,MAAM,EAAGE,EAAM,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,GAAKD,CACvE,EAEME,EAAa,GAAuBL,IAAc,KAAO,KAAO,KAEhEM,EAAS,GACb,OAAOC,GAAU,UAAY,OAAOA,GAAU,SAAW,GAAGA,IAAU,IAGlEC,GACJ,EACA,IACG,CACH,OAAQC,EAAK,UAAb,CACE,IAAK,UACH,MAAO,KAAKH,EAAMG,EAAK,OAAO,EAAE,EAAE,IACpC,IAAK,QACH,MAAO,KAAKH,EAAMG,EAAK,OAAO,QAAQ,EAAE,GAC1C,IAAK,UACH,MAAO,WACT,QACE,OAAOC,EAAUD,EAAK,UAAY,IAAA,EACtC,CACF,EAEME,GAAc,EAAe,IACjC,CAACC,EAAO,GAAGC,CAAM,CAAC,CAAC,KAAK,GAAG,EAEvBC,EAAa,GAAeC,EAAG,QAAQ,iBAAkB,GAAG,EAS5DC,EAAe,GACnBJ,EAAM,QAAQ,yBAA2B,GAAS,IAAIK,EAAK,YAAY,CAAC,EAAE,EAAE,EAExEC,GAAO,EAAY,IAAkB,KAAKH,EAAG,IAAIC,EAAYJ,CAAK,EAAE,IAEpEO,GACJ,EACA,EACA,EAAQ,MACR,IACG,CACH,IAAMP,EAAQQ,EAAK,OAASC,EAC5B,OAAOT,IAAU,IAAA,GACb,KAAKQ,EAAK,GAAG,GAAGE,EAAM,GAAGC,IACzB,KAAKH,EAAK,GAAG,GAAGE,EAAM,IAAIN,EAAYJ,CAAK,EAAE,KAAKW,GACxD,EAEMC,GAAW,EAAc,EAAY,EAAQ,MAAO,IACxDJ,EAAK,IAAK,GAASD,EAAKM,EAAMF,EAAID,EAAOV,CAAK,CAAC,EAE3Cc,GAAS,EAAY,EAAe,IAAoB,CAC5D,cAAcX,EAAG,OAAOC,EAAYW,CAAK,EAAE,IAC3C,GAAGC,EACH,OACF,EAEMC,EAAY,IAA4D,CAC5E,MAAO,CAAC,EACR,MAAO,CAAC,EACR,MAAO,CAAC,EACR,MAAO,CAAC,EACR,GAAGC,CACL,GAEMC,kBAAY,IAAI,IAAY,CAChC,WACA,SACA,SACA,MACA,MACA,MACA,WACA,OACF,CAAC,EAEKC,EAAU,GAAoB,CAACD,EAAU,IAAItB,EAAK,IAAI,EAGtDwB,GACJ,EACA,EACA,EAAmB,CAAC,IACP,CACb,GAAIxB,EAAK,OAAS,YAAa,CAC7B,IAAMyB,EAAM1B,EAAMC,EAAM0B,EAAI,OAAO,EACnC,OAAOF,EAAOxB,EAAK,KAAM0B,EAAKD,EAAM,CAAC,GAAGrB,EAAQqB,CAAG,EAAIrB,CAAM,CAC/D,CACA,IAAMuB,EAAOC,EAAK5B,EAAM0B,EAAKtB,CAAM,EACnC,OAAOA,EAAO,OAAS,GAAK,CAACmB,EAAOvB,CAAI,EACpC,CACE,GAAG2B,EACH,MAAOV,EACL,GAAGZ,EAAUL,EAAK,EAAE,EAAE,QACtBI,EAAO,KAAK,GAAG,EACfuB,EAAK,KACP,CACF,EACAA,CACN,EAEMC,GACJ,EACA,EACA,IACa,CACb,IAAMtB,EAAKD,EAAUL,EAAK,EAAE,EACtBN,EAAQ,GAAkBF,EAAKkC,EAAI,IAAK5B,CAAK,EAC7C+B,EAAO,GAAqBL,EAAOM,EAAOJ,CAAG,EAEnD,OAAQ1B,EAAK,KAAb,CACE,IAAK,WAAY,CACf,GAAIA,EAAK,MAAM,SAAW,EACxB,OAAOoB,EAAS,CACd,MAAO,CAAC,KAAKd,EAAG,aAAa,EAC7B,MAAOA,EACP,MAAO,CAAC,CAAE,IAAG,CAAC,CAChB,CAAC,EAEH,IAAMe,EAAQrB,EAAK,MAAM,IAAI6B,CAAG,EAChC,OAAOT,EAAS,CACd,MAAOC,EAAM,QAAS,GAASM,EAAK,KAAK,EACzC,MAAO,CACL,GAAGN,EAAM,QAAS,GAASM,EAAK,KAAK,EACrC,GAAGN,EACA,MAAM,CAAC,CAAC,CACR,SAAS,EAAM,IAAMN,EAAQM,EAAMU,EAAE,CAAC,MAAOJ,EAAK,KAAK,CAAC,CAC7D,EACA,MAAON,EAAM,EAAE,CAAC,MAChB,MAAOA,EAAMA,EAAM,OAAS,EAAE,CAAC,MAC/B,MAAOA,EAAM,QAAS,GAASM,EAAK,KAAK,CAC3C,CAAC,CACH,CACA,IAAK,SAAU,CACb,IAAMK,EAAQ,CACZ,CAAE,MAAOhC,EAAK,OAAQ,MAAO,KAAM,EACnC,CAAE,MAAOA,EAAK,QAAS,MAAO,IAAK,CACrC,CAAC,CAAC,KAAK,CAAE,QAAO,YAAa,CAC3B,QACA,KAAM8B,GAASD,EAAIC,CAAK,CAC1B,EAAE,EACF,OAAOV,EAAS,CACd,MAAO,CACL,KAAKd,EAAG,IAAIC,EAAYb,EAAKM,EAAK,IAAI,CAAC,EAAE,IACzC,GAAGgC,EAAM,SAAS,CAAE,UAAWL,GAAM,OAAS,CAAC,CAAC,CAClD,EACA,MAAOK,EAAM,SAAS,CAAE,OAAM,WAAY,CACxC,GAAIL,EAAO,CAACjB,EAAK,CAAE,KAAI,OAAM,EAAGiB,EAAK,KAAK,CAAC,EAAI,CAAC,EAChD,GAAIA,GAAM,OAAS,CAAC,CACtB,CAAC,EACD,MAAOrB,EACP,MAAO0B,EAAM,SACV,CAAE,OAAM,WAAYL,GAAM,OAAS,CAAC,CAAE,KAAI,OAAM,CAAC,CACpD,EACA,MAAOK,EAAM,SAAS,CAAE,UAAWL,GAAM,OAAS,CAAC,CAAC,CACtD,CAAC,CACH,CACA,IAAK,SAAU,CACb,IAAMM,EAAQjC,EAAK,MAAM,KAAK,CAAE,MAAK,KAAM8B,MAAa,CACtD,MAAOpC,EAAKwC,CAAG,EACf,KAAML,EAAIC,CAAK,CACjB,EAAE,EACIK,EAAWnC,EAAK,SAAW,CAC/B,MAAO,UACP,KAAM6B,EAAI7B,EAAK,OAAO,CACxB,EACMoC,EAASD,EAAW,CAAC,GAAGF,EAAOE,CAAQ,EAAIF,EACjD,OAAOb,EAAS,CACd,MAAO,CACL,KAAKd,EAAG,IAAIC,EAAYb,EAAKM,EAAK,QAAQ,CAAC,EAAE,IAC7C,GAAGoC,EAAO,SAAS,CAAE,UAAWT,EAAK,KAAK,CAC5C,EACA,MAAOS,EAAO,SAAS,CAAE,OAAM,WAAY,CACzC1B,EAAK,CAAE,KAAI,OAAM,EAAGiB,EAAK,KAAK,EAC9B,GAAGA,EAAK,KACV,CAAC,EACD,MAAOrB,EACP,MAAO8B,EAAO,SAAS,CAAE,UAAWT,EAAK,KAAK,EAC9C,MAAO,CACL,GAAGS,EAAO,SAAS,CAAE,UAAWT,EAAK,KAAK,EAC1C,GAAIQ,EACA,CAAC,EACD,CACE,CACE,KACA,MACEnC,EAAK,eAAiB,IAAA,GAAY,WAAa,SACnD,CACF,CACN,CACF,CAAC,CACH,CACA,IAAK,MACL,IAAK,MAAO,CACV,IAAMqB,EAAQrB,EAAK,MAAM,IAAI6B,CAAG,EAC1BQ,EAAO,GAAG/B,EAAG,KACbgC,EAAO,GAAGhC,EAAG,MACbY,EACJlB,EAAK,OAAS,MAAQ,gBAAkB,yBAC1C,OAAOoB,EAAS,CACd,MAAOH,EAAMX,EAAIY,EAAO,CACtB,KAAKmB,EAAK,YACV,GAAGhB,EAAM,QAAS,GAASM,EAAK,KAAK,EACrC,KAAKW,EAAK,WACZ,CAAC,EACD,MAAO,CACL,GAAIjB,EAAM,SAAW,EAAI,CAAC,KAAKgB,EAAK,OAAOC,GAAM,EAAI,CAAC,EACtD,GAAGjB,EAAM,QAAS,GAAS,CACzB,KAAKgB,EAAK,OAAOV,EAAK,QACtB,GAAGA,EAAK,MACR,GAAGZ,EAAQY,EAAK,MAAOW,CAAI,CAC7B,CAAC,CACH,EACA,MAAOD,EACP,MAAO,CAAC,CAAE,GAAIC,CAAK,CAAC,EACpB,MAAOjB,EAAM,SAAW,EAAI,CAAC,EAAI,CAAC,CAAE,GAAIiB,CAAK,CAAC,CAChD,CAAC,CACH,CACA,IAAK,MAAO,CACV,IAAMX,EAAOE,EAAI7B,EAAK,IAAI,EACpBuC,EAAO,GAAGjC,EAAG,OACnB,OAAOc,EAAS,CACd,MAAO,CAAC,GAAGH,EAAMX,EAAI,MAAOqB,EAAK,KAAK,EAAG,KAAKY,EAAK,kBAAkB,EACrE,MAAO,CAAC,GAAGZ,EAAK,MAAO,GAAGZ,EAAQY,EAAK,MAAOY,CAAI,CAAC,EACnD,MAAOZ,EAAK,MAEZ,MAAO,CAAC,CAAE,GAAIY,EAAM,MAAO,KAAM,CAAC,EAClC,MAAO,CAAC,CAAE,GAAIA,EAAM,MAAO,IAAK,CAAC,CACnC,CAAC,CACH,CACA,IAAK,WAAY,CACf,IAAMC,EAAOX,EAAI7B,EAAK,IAAI,EACpBmC,EAAWN,EAAI7B,EAAK,QAAQ,EAC5ByC,EAASzC,EAAK,MAAQ,cAAcN,EAAKM,EAAK,KAAK,IAAM,UAC/D,OAAOoB,EAAS,CACd,MAAO,CAAC,GAAGoB,EAAK,MAAO,GAAGL,EAAS,KAAK,EACxC,MAAO,CACL,GAAGK,EAAK,MACR,GAAGL,EAAS,MACZ,GAAGpB,EAAQyB,EAAK,MAAOL,EAAS,MAAO,OAAQM,CAAM,CACvD,EACA,MAAOD,EAAK,MACZ,MAAO,CAAC,GAAGA,EAAK,MAAO,GAAGL,EAAS,KAAK,EAExC,MAAO,CAAC,GAAInC,EAAK,MAAQwC,EAAK,MAAQ,CAAC,EAAI,GAAGL,EAAS,KAAK,CAC9D,CAAC,CACH,CACA,IAAK,QAAS,CACZ,IAAMR,EAAOE,EAAI7B,EAAK,IAAI,EAC1B,OAAOoB,EAAS,CACd,GAAGO,EACH,MAAOV,EAAMX,EAAI,UAAUZ,EAAKM,EAAK,MAAM,IAAK2B,EAAK,KAAK,CAC5D,CAAC,CACH,CACA,IAAK,SACH,OAAOP,EAAS,CACd,MAAO,CACL,KAAKd,EAAG,IAAIC,EAAYL,EAAWR,EAAKM,EAAK,KAAK,EAAGI,CAAM,CAAC,EAAE,GAChE,EACA,MAAOE,EACP,MAAO,CAAC,CAAE,IAAG,CAAC,CAChB,CAAC,CACL,CAGA,OAAOc,EAAS,CACd,MAAO,CAACX,EAAIH,EAAIJ,EAAWR,EAAKM,EAAK,KAAK,EAAGI,CAAM,CAAC,CAAC,EACrD,MAAOE,EACP,MAAO,CAAC,CAAE,IAAG,CAAC,EACd,MAAO,CAAC,CAAE,IAAG,CAAC,CAChB,CAAC,CACH,EAWaoC,GACX,EACA,EAA0B,CAAC,IAChB,CACX,GAAM,CACJ,UAAWC,EAAqB,KAChC,YAAY,GACZ,UAAU,GACV,iBAAiB,IACfC,EACEC,EAAOrB,EAAOnC,EAAQyD,CAAI,CAAC,CAAC,KAAM,CACtC,UACA,IAAKxD,EAAWyD,CAAc,CAChC,CAAC,EACKC,EAAQC,EAAYJ,EAAK,MAAQ,CAAC,EACxC,MAAO,CACL,aAAajD,EAAU+C,CAAkB,IACzC,mBACA,GAAGE,EAAK,MACR,qBACA,GAAIG,EAAM,OAAS,EAAI,CAAC,oBAAoB,EAAI,CAAC,EACjD,eAAeH,EAAK,QACpB,GAAGA,EAAK,MACR,GAAG9B,EAAQ8B,EAAK,MAAO,QAAQ,EAC/B,GAAG9B,EAAQiC,EAAO,SAAU,OAAQ,MAAM,CAC5C,CAAC,CAAC,KAAK;CAAI,CACb,E"}
@@ -1,2 +1,2 @@
1
- const e=e=>Number.isFinite(e)?e:String(e),t=Symbol.for(`ts-rules-composer.node`),n=(e,n)=>(Object.defineProperty(e,t,{value:n,enumerable:!1,writable:!1,configurable:!0}),e),r=e=>typeof e==`function`&&Object.hasOwn(e,t)?e[t]:void 0,i=e=>{let{name:t}=e;return t===``||t===`anonymous`||t.startsWith(`bound `)?void 0:t},a=()=>{let e=0,t=(t,n)=>n??i(t)??`rule #${++e}`,n=(e,i,a)=>{let c=r(e);if(!c||c.kind===`rule`)return{id:i,kind:`rule`,label:t(e,c?.label??a),...c?.params?{params:{...c.params}}:{}};switch(c.kind){case`sequence`:return{id:i,kind:`sequence`,via:c.via,steps:c.steps.map((e,t)=>n(e,`${i}.steps.${t}`))};case`branch`:return{id:i,kind:`branch`,test:t(c.test,s(c.test)),...c.ifTrue?{ifTrue:n(c.ifTrue,`${i}.ifTrue`)}:{},...c.ifFalse?{ifFalse:n(c.ifFalse,`${i}.ifFalse`)}:{}};case`all`:case`any`:return{id:i,kind:c.kind,rules:c.rules.map((e,t)=>n(e,`${i}.rules.${t}`))};case`not`:return{id:i,kind:`not`,rule:n(c.rule,`${i}.rule`)};case`fallback`:{let e=n(c.main,`${i}.main`),r=c.guard&&t(c.guard,s(c.guard));return{id:i,kind:`fallback`,main:e,...r?{guard:r}:{},fallback:n(c.fallback,`${i}.fallback`)}}case`field`:return{id:i,kind:`field`,getter:t(c.getter,s(c.getter)),rule:n(c.rule,`${i}.rule`)};case`effect`:return{id:i,kind:`effect`,label:t(c.effect,s(c.effect))};case`decorator`:{let e=c.decorator===`debug`?c.params.name:void 0;return{id:i,kind:`decorator`,decorator:c.decorator,params:{...c.params},rule:n(c.rule,`${i}.rule`,typeof e==`string`?e:a)}}case`switch`:return{id:i,kind:`switch`,selector:t(c.selector,s(c.selector)),cases:Reflect.ownKeys(c.cases).map((e,t)=>({key:String(e),node:n(c.cases[e],`${i}.cases.${t}`)})),...c.default?{default:n(c.default,`${i}.default`)}:{},...c.defaultError===void 0?{}:{defaultError:o(c.defaultError)}}}};return n},o=e=>typeof e==`string`?e:`custom error`,s=e=>{let t=r(e);return t?.kind===`rule`?t.label:void 0},c=e=>({version:1,root:a()(e,`root`)});Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return r}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return i}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return n}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return c}});
2
- //# sourceMappingURL=to-graph-DRYHiuLU.cjs.map
1
+ const e=e=>Number.isFinite(e)?e:String(e),t=Symbol.for(`ts-rules-composer.node`),n=(e,n)=>(Object.defineProperty(e,t,{value:n,enumerable:!1,writable:!1,configurable:!0}),e),r=e=>typeof e==`function`&&Object.hasOwn(e,t)?e[t]:void 0,i=e=>{let{name:t}=e;return t===``||t===`anonymous`||t.startsWith(`bound `)?void 0:t},a=()=>{let e=0,t=(t,n)=>n??i(t)??`rule #${++e}`,n=(e,i,a)=>{let c=r(e);if(!c||c.kind===`rule`)return{id:i,kind:`rule`,label:t(e,c?.label??a),...c?.params?{params:{...c.params}}:{}};switch(c.kind){case`sequence`:return{id:i,kind:`sequence`,via:c.via,steps:c.steps.map((e,t)=>n(e,`${i}.steps.${t}`))};case`branch`:return{id:i,kind:`branch`,test:t(c.test,s(c.test)),...c.ifTrue?{ifTrue:n(c.ifTrue,`${i}.ifTrue`)}:{},...c.ifFalse?{ifFalse:n(c.ifFalse,`${i}.ifFalse`)}:{}};case`all`:case`any`:return{id:i,kind:c.kind,rules:c.rules.map((e,t)=>n(e,`${i}.rules.${t}`))};case`not`:return{id:i,kind:`not`,rule:n(c.rule,`${i}.rule`)};case`fallback`:{let e=n(c.main,`${i}.main`),r=c.guard&&t(c.guard,s(c.guard));return{id:i,kind:`fallback`,main:e,...r?{guard:r}:{},fallback:n(c.fallback,`${i}.fallback`)}}case`field`:return{id:i,kind:`field`,getter:t(c.getter,s(c.getter)),rule:n(c.rule,`${i}.rule`)};case`effect`:return{id:i,kind:`effect`,label:t(c.effect,s(c.effect))};case`decorator`:{let e=c.decorator===`debug`?c.params.name:void 0;return{id:i,kind:`decorator`,decorator:c.decorator,params:{...c.params},rule:n(c.rule,`${i}.rule`,typeof e==`string`?e:a)}}case`switch`:return{id:i,kind:`switch`,selector:t(c.selector,s(c.selector)),cases:Reflect.ownKeys(c.cases).map((e,t)=>({key:String(e),node:n(c.cases[e],`${i}.cases.${t}`)})),...c.default?{default:n(c.default,`${i}.default`)}:{},...c.defaultError===void 0?{}:{defaultError:o(c.defaultError)}};default:return{id:i,kind:`rule`,label:t(e,a)}}};return n},o=e=>typeof e==`string`?e:`custom error`,s=e=>{let t=r(e);return t?.kind===`rule`?t.label:void 0},c=e=>({version:1,root:a()(e,`root`)});Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return r}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return i}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return n}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return c}});
2
+ //# sourceMappingURL=to-graph-BBdB7p5H.cjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"to-graph-BBdB7p5H.cjs","names":["jsonNumber","value","NODE_KEY","attachNode","fn","node","readNode","usableName","name","createBuilder","unlabelled","labelOf","explicit","build","raw","hint","step","id","index","readLabel","rule","main","guard","debugName","key","describeError","error","toGraph"],"sources":["../src/lib/graph/node.ts","../src/lib/graph/labels.ts","../src/lib/graph/to-graph.ts"],"sourcesContent":["/**\n * Graph node primitives.\n *\n * This module must not import from `combinators/` or `helpers/`: combinators\n * import it, and `helpers/` and `combinators/` already depend on each other.\n */\n\n/** Any function a combinator may hold as a child (rule, predicate, accessor). */\nexport type Fn = (...args: never[]) => unknown;\n\n/** A number as a JSON-safe param: `Infinity` and `NaN` would become `null`. */\nexport const jsonNumber = (value: number): number | string =>\n Number.isFinite(value) ? value : String(value);\n\n/** Behavior a decorator adds around a rule without changing what it checks. */\nexport type DecoratorName =\n | \"timeout\"\n | \"retry\"\n | \"memoize\"\n | \"debug\"\n | \"tap\"\n | \"mapError\"\n | \"lazyContext\";\n\n/**\n * Structure recorded by a combinator at construction time. Children are the\n * original functions passed in (before any safety wrapping), so they can be\n * inspected later. Internal: the public, JSON-safe form is {@link GraphNode}.\n */\nexport type RawNode =\n | {\n /** A rule given an explicit label by `named`. */\n kind: \"rule\";\n label: string;\n params?: Record<string, unknown>;\n }\n | {\n kind: \"sequence\";\n /** Steps in execution order (`composeRules` runs its array reversed). */\n steps: Fn[];\n via: \"pipeRules\" | \"composeRules\";\n }\n | {\n kind: \"branch\";\n /**\n * `when` has only `ifTrue`, `unless` only `ifFalse`, `ifElse` both. A\n * missing side passes. (Not named `then`/`else`: an object with a\n * `then` key is treated as a promise by `await`.)\n */\n test: Fn;\n ifTrue?: Fn;\n ifFalse?: Fn;\n }\n | {\n kind: \"switch\";\n selector: Fn;\n /** Copy of the cases object, keyed as `match` received it. */\n cases: Record<PropertyKey, Fn>;\n /** `match`'s default rule; at most one of `default`/`defaultError`. */\n default?: Fn;\n /** `match`'s default error value, kept raw (never stringified here). */\n defaultError?: unknown;\n }\n | {\n /** `every` is `all` (every rule must pass), `oneOf` is `any`. */\n kind: \"all\" | \"any\";\n rules: Fn[];\n }\n | { kind: \"not\"; rule: Fn }\n | {\n kind: \"fallback\";\n main: Fn;\n fallback: Fn;\n /** `onlyFallbackOn`: when set, the fallback runs only if it accepts the error. */\n guard?: Fn;\n }\n | {\n kind: \"field\";\n /** Reads the value the rule is applied to. */\n getter: Fn;\n rule: Fn;\n }\n | {\n kind: \"effect\";\n /** The side effect `tap` runs; the rule always passes. */\n effect: Fn;\n }\n | {\n kind: \"decorator\";\n decorator: DecoratorName;\n /** The decorated rule, as passed in. */\n rule: Fn;\n /** Settings worth showing, as plain JSON values. */\n params: Record<string, unknown>;\n };\n\n/** Public, JSON-serializable graph. Built by `toGraph`. */\nexport type GraphNode =\n | {\n id: string;\n kind: \"rule\";\n label: string;\n params?: Record<string, unknown>;\n }\n | {\n id: string;\n kind: \"sequence\";\n via: \"pipeRules\" | \"composeRules\";\n steps: GraphNode[];\n }\n | {\n id: string;\n kind: \"branch\";\n test: string;\n ifTrue?: GraphNode;\n ifFalse?: GraphNode;\n }\n | {\n id: string;\n kind: \"switch\";\n selector: string;\n /** In `Reflect.ownKeys` order; symbol keys appear as `Symbol(desc)`. */\n cases: { key: string; node: GraphNode }[];\n /** Absent `default` and `defaultError` mean \"no match\" fails. */\n default?: GraphNode;\n defaultError?: string;\n }\n | {\n id: string;\n kind: \"all\" | \"any\";\n rules: GraphNode[];\n }\n | { id: string; kind: \"not\"; rule: GraphNode }\n | {\n id: string;\n kind: \"fallback\";\n main: GraphNode;\n fallback: GraphNode;\n guard?: string;\n }\n | { id: string; kind: \"field\"; getter: string; rule: GraphNode }\n | { id: string; kind: \"effect\"; label: string }\n | {\n id: string;\n kind: \"decorator\";\n decorator: DecoratorName;\n params: Record<string, unknown>;\n rule: GraphNode;\n };\n\nexport type RuleGraph = { version: 1; root: GraphNode };\n\n/**\n * Registry symbol, so ESM and CJS copies of the package (or several copies of\n * one version) read each other's metadata.\n */\nexport const NODE_KEY: unique symbol = Symbol.for(\n \"ts-rules-composer.node\",\n) as never;\n\ntype WithNode = { [NODE_KEY]?: RawNode };\n\n/**\n * Records `node` on `fn` and returns the same function. The property is\n * non-enumerable, so spreading, `Object.keys` and `JSON.stringify` are\n * unaffected. A later call replaces an earlier one.\n */\nexport const attachNode = <F extends Fn>(fn: F, node: RawNode): F => {\n Object.defineProperty(fn, NODE_KEY, {\n value: node,\n enumerable: false,\n writable: false,\n configurable: true,\n });\n return fn;\n};\n\n/** Returns the node recorded on `fn`, or `undefined` for plain functions. */\nexport const readNode = (fn: unknown): RawNode | undefined =>\n typeof fn === \"function\" && Object.hasOwn(fn, NODE_KEY)\n ? (fn as WithNode)[NODE_KEY]\n : undefined;\n","/**\n * The function's own name, unless it carries no information: empty,\n * \"anonymous\", or the \"bound x\" name given by `Function.prototype.bind`.\n */\nexport const usableName = (fn: { name: string }): string | undefined => {\n const { name } = fn;\n return name === \"\" || name === \"anonymous\" || name.startsWith(\"bound \")\n ? undefined\n : name;\n};\n","import type { Rule } from \"../types\";\nimport { usableName } from \"./labels\";\nimport { type Fn, type GraphNode, type RuleGraph, readNode } from \"./node\";\n\n/**\n * Builds the public graph. Unlabelled functions get `rule #n`, numbered in\n * depth-first order (a branch's predicate before its sides) so that the same\n * pipeline always yields the same labels.\n */\nconst createBuilder = () => {\n let unlabelled = 0;\n const labelOf = (fn: Fn, explicit?: string) =>\n explicit ?? usableName(fn) ?? `rule #${++unlabelled}`;\n\n /**\n * `hint` is a label offered by an enclosing `withDebug`: it names a leaf\n * rule that has no explicit label, ahead of the function's own name.\n */\n const build = (fn: Fn, id: string, hint?: string): GraphNode => {\n const raw = readNode(fn);\n\n // Any function without a recorded structure is a leaf rule.\n if (!raw || raw.kind === \"rule\") {\n return {\n id,\n kind: \"rule\",\n label: labelOf(fn, raw?.label ?? hint),\n ...(raw?.params ? { params: { ...raw.params } } : {}),\n };\n }\n\n switch (raw.kind) {\n case \"sequence\":\n return {\n id,\n kind: \"sequence\",\n via: raw.via,\n steps: raw.steps.map((step, index) =>\n build(step, `${id}.steps.${index}`),\n ),\n };\n case \"branch\": {\n const test = labelOf(raw.test, readLabel(raw.test));\n return {\n id,\n kind: \"branch\",\n test,\n ...(raw.ifTrue ? { ifTrue: build(raw.ifTrue, `${id}.ifTrue`) } : {}),\n ...(raw.ifFalse\n ? { ifFalse: build(raw.ifFalse, `${id}.ifFalse`) }\n : {}),\n };\n }\n case \"all\":\n case \"any\":\n return {\n id,\n kind: raw.kind,\n rules: raw.rules.map((rule, index) =>\n build(rule, `${id}.rules.${index}`),\n ),\n };\n case \"not\":\n return { id, kind: \"not\", rule: build(raw.rule, `${id}.rule`) };\n case \"fallback\": {\n // Numbered in execution order: main, then the guard, then the fallback.\n const main = build(raw.main, `${id}.main`);\n const guard = raw.guard && labelOf(raw.guard, readLabel(raw.guard));\n return {\n id,\n kind: \"fallback\",\n main,\n ...(guard ? { guard } : {}),\n fallback: build(raw.fallback, `${id}.fallback`),\n };\n }\n case \"field\": {\n const getter = labelOf(raw.getter, readLabel(raw.getter));\n return {\n id,\n kind: \"field\",\n getter,\n rule: build(raw.rule, `${id}.rule`),\n };\n }\n case \"effect\":\n return {\n id,\n kind: \"effect\",\n label: labelOf(raw.effect, readLabel(raw.effect)),\n };\n case \"decorator\": {\n const debugName =\n raw.decorator === \"debug\" ? raw.params.name : undefined;\n return {\n id,\n kind: \"decorator\",\n decorator: raw.decorator,\n params: { ...raw.params },\n rule: build(\n raw.rule,\n `${id}.rule`,\n typeof debugName === \"string\" ? debugName : hint,\n ),\n };\n }\n case \"switch\": {\n const selector = labelOf(raw.selector, readLabel(raw.selector));\n return {\n id,\n kind: \"switch\",\n selector,\n cases: Reflect.ownKeys(raw.cases).map((key, index) => ({\n key: String(key),\n node: build(raw.cases[key] as Fn, `${id}.cases.${index}`),\n })),\n ...(raw.default\n ? { default: build(raw.default, `${id}.default`) }\n : {}),\n ...(raw.defaultError !== undefined\n ? { defaultError: describeError(raw.defaultError) }\n : {}),\n };\n }\n // The node key is shared, so another version of this package could have\n // attached a kind this one does not know: describe it as a leaf.\n default:\n return { id, kind: \"rule\", label: labelOf(fn, hint) };\n }\n };\n\n return build;\n};\n\n/** Strings are shown as-is; anything else is never stringified (it could run user code). */\nconst describeError = (error: unknown) =>\n typeof error === \"string\" ? error : \"custom error\";\n\nconst readLabel = (fn: Fn) => {\n const raw = readNode(fn);\n return raw?.kind === \"rule\" ? raw.label : undefined;\n};\n\n/**\n * Describes a rule as a JSON-serializable graph, without running it.\n *\n * Rules built with this package's combinators are described structurally; any\n * other function (including your own wrappers) is a single leaf rule.\n *\n * @example\n * const graph = toGraph(pipeRules([hasItems, withinLimit]));\n * // { version: 1, root: { kind: \"sequence\", steps: [...] } }\n * @caveats\n * - Nothing is executed: rules, predicates and accessors are never called.\n * - Anonymous functions are labelled `rule #n`; use `named` for a real name.\n */\nexport const toGraph = <TInput, TError, TContext>(\n rule: Rule<TInput, TError, TContext>,\n): RuleGraph => ({ version: 1, root: createBuilder()(rule, \"root\") });\n"],"mappings":"AAWA,MAAaA,EAAc,GACzB,OAAO,SAASC,CAAK,EAAIA,EAAQ,OAAOA,CAAK,EAgJlCC,EAA0B,OAAO,IAC5C,wBACF,EASaC,GAA4B,EAAO,KAC9C,OAAO,eAAeC,EAAIF,EAAU,CAClC,MAAOG,EACP,WAAY,GACZ,SAAU,GACV,aAAc,EAChB,CAAC,EACMD,GAIIE,EAAY,GACvB,OAAOF,GAAO,YAAc,OAAO,OAAOA,EAAIF,CAAQ,EACjDE,EAAgBF,GACjB,IAAA,GCjLOK,EAAc,GAA6C,CACtE,GAAM,CAAE,QAASH,EACjB,OAAOI,IAAS,IAAMA,IAAS,aAAeA,EAAK,WAAW,QAAQ,EAClE,IAAA,GACAA,CACN,ECAMC,MAAsB,CAC1B,IAAIC,EAAa,EACXC,GAAW,EAAQ,IACvBC,GAAYL,EAAWH,CAAE,GAAK,SAAS,EAAEM,IAMrCG,GAAS,EAAQ,EAAY,IAA6B,CAC9D,IAAMC,EAAMR,EAASF,CAAE,EAGvB,GAAI,CAACU,GAAOA,EAAI,OAAS,OACvB,MAAO,CACL,KACA,KAAM,OACN,MAAOH,EAAQP,EAAIU,GAAK,OAASC,CAAI,EACrC,GAAID,GAAK,OAAS,CAAE,OAAQ,CAAE,GAAGA,EAAI,MAAO,CAAE,EAAI,CAAC,CACrD,EAGF,OAAQA,EAAI,KAAZ,CACE,IAAK,WACH,MAAO,CACL,KACA,KAAM,WACN,IAAKA,EAAI,IACT,MAAOA,EAAI,MAAM,KAAK,EAAM,IAC1BD,EAAMG,EAAM,GAAGC,EAAG,SAASC,GAAO,CACpC,CACF,EACF,IAAK,SAEH,MAAO,CACL,KACA,KAAM,SACN,KAJWP,EAAQG,EAAI,KAAMK,EAAUL,EAAI,IAAI,CAI5C,EACH,GAAIA,EAAI,OAAS,CAAE,OAAQD,EAAMC,EAAI,OAAQ,GAAGG,EAAG,QAAQ,CAAE,EAAI,CAAC,EAClE,GAAIH,EAAI,QACJ,CAAE,QAASD,EAAMC,EAAI,QAAS,GAAGG,EAAG,SAAS,CAAE,EAC/C,CAAC,CACP,EAEF,IAAK,MACL,IAAK,MACH,MAAO,CACL,KACA,KAAMH,EAAI,KACV,MAAOA,EAAI,MAAM,KAAK,EAAM,IAC1BD,EAAMO,EAAM,GAAGH,EAAG,SAASC,GAAO,CACpC,CACF,EACF,IAAK,MACH,MAAO,CAAE,KAAI,KAAM,MAAO,KAAML,EAAMC,EAAI,KAAM,GAAGG,EAAG,MAAM,CAAE,EAChE,IAAK,WAAY,CAEf,IAAMI,EAAOR,EAAMC,EAAI,KAAM,GAAGG,EAAG,MAAM,EACnCK,EAAQR,EAAI,OAASH,EAAQG,EAAI,MAAOK,EAAUL,EAAI,KAAK,CAAC,EAClE,MAAO,CACL,KACA,KAAM,WACN,OACA,GAAIQ,EAAQ,CAAE,OAAM,EAAI,CAAC,EACzB,SAAUT,EAAMC,EAAI,SAAU,GAAGG,EAAG,UAAU,CAChD,CACF,CACA,IAAK,QAEH,MAAO,CACL,KACA,KAAM,QACN,OAJaN,EAAQG,EAAI,OAAQK,EAAUL,EAAI,MAAM,CAIhD,EACL,KAAMD,EAAMC,EAAI,KAAM,GAAGG,EAAG,MAAM,CACpC,EAEF,IAAK,SACH,MAAO,CACL,KACA,KAAM,SACN,MAAON,EAAQG,EAAI,OAAQK,EAAUL,EAAI,MAAM,CAAC,CAClD,EACF,IAAK,YAAa,CAChB,IAAMS,EACJT,EAAI,YAAc,QAAUA,EAAI,OAAO,KAAO,IAAA,GAChD,MAAO,CACL,KACA,KAAM,YACN,UAAWA,EAAI,UACf,OAAQ,CAAE,GAAGA,EAAI,MAAO,EACxB,KAAMD,EACJC,EAAI,KACJ,GAAGG,EAAG,OACN,OAAOM,GAAc,SAAWA,EAAYR,CAC9C,CACF,CACF,CACA,IAAK,SAEH,MAAO,CACL,KACA,KAAM,SACN,SAJeJ,EAAQG,EAAI,SAAUK,EAAUL,EAAI,QAAQ,CAIpD,EACP,MAAO,QAAQ,QAAQA,EAAI,KAAK,CAAC,CAAC,KAAK,EAAK,KAAW,CACrD,IAAK,OAAOU,CAAG,EACf,KAAMX,EAAMC,EAAI,MAAMU,GAAY,GAAGP,EAAG,SAASC,GAAO,CAC1D,EAAE,EACF,GAAIJ,EAAI,QACJ,CAAE,QAASD,EAAMC,EAAI,QAAS,GAAGG,EAAG,SAAS,CAAE,EAC/C,CAAC,EACL,GAAIH,EAAI,eAAiB,IAAA,GAErB,CAAC,EADD,CAAE,aAAcW,EAAcX,EAAI,YAAY,CAAE,CAEtD,EAIF,QACE,MAAO,CAAE,KAAI,KAAM,OAAQ,MAAOH,EAAQP,EAAIW,CAAI,CAAE,CACxD,CACF,EAEA,OAAOF,CACT,EAGMY,EAAiB,GACrB,OAAOC,GAAU,SAAWA,EAAQ,eAEhCP,EAAa,GAAW,CAC5B,IAAML,EAAMR,EAASF,CAAE,EACvB,OAAOU,GAAK,OAAS,OAASA,EAAI,MAAQ,IAAA,EAC5C,EAeaa,EACX,IACe,CAAE,QAAS,EAAG,KAAMlB,EAAc,CAAC,CAACW,EAAM,MAAM,CAAE,G"}
@@ -1,2 +1,2 @@
1
- const e=e=>Number.isFinite(e)?e:String(e),t=Symbol.for(`ts-rules-composer.node`),n=(e,n)=>(Object.defineProperty(e,t,{value:n,enumerable:!1,writable:!1,configurable:!0}),e),r=e=>typeof e==`function`&&Object.hasOwn(e,t)?e[t]:void 0,i=e=>{let{name:t}=e;return t===``||t===`anonymous`||t.startsWith(`bound `)?void 0:t},a=()=>{let e=0,t=(t,n)=>n??i(t)??`rule #${++e}`,n=(e,i,a)=>{let c=r(e);if(!c||c.kind===`rule`)return{id:i,kind:`rule`,label:t(e,c?.label??a),...c?.params?{params:{...c.params}}:{}};switch(c.kind){case`sequence`:return{id:i,kind:`sequence`,via:c.via,steps:c.steps.map((e,t)=>n(e,`${i}.steps.${t}`))};case`branch`:return{id:i,kind:`branch`,test:t(c.test,s(c.test)),...c.ifTrue?{ifTrue:n(c.ifTrue,`${i}.ifTrue`)}:{},...c.ifFalse?{ifFalse:n(c.ifFalse,`${i}.ifFalse`)}:{}};case`all`:case`any`:return{id:i,kind:c.kind,rules:c.rules.map((e,t)=>n(e,`${i}.rules.${t}`))};case`not`:return{id:i,kind:`not`,rule:n(c.rule,`${i}.rule`)};case`fallback`:{let e=n(c.main,`${i}.main`),r=c.guard&&t(c.guard,s(c.guard));return{id:i,kind:`fallback`,main:e,...r?{guard:r}:{},fallback:n(c.fallback,`${i}.fallback`)}}case`field`:return{id:i,kind:`field`,getter:t(c.getter,s(c.getter)),rule:n(c.rule,`${i}.rule`)};case`effect`:return{id:i,kind:`effect`,label:t(c.effect,s(c.effect))};case`decorator`:{let e=c.decorator===`debug`?c.params.name:void 0;return{id:i,kind:`decorator`,decorator:c.decorator,params:{...c.params},rule:n(c.rule,`${i}.rule`,typeof e==`string`?e:a)}}case`switch`:return{id:i,kind:`switch`,selector:t(c.selector,s(c.selector)),cases:Reflect.ownKeys(c.cases).map((e,t)=>({key:String(e),node:n(c.cases[e],`${i}.cases.${t}`)})),...c.default?{default:n(c.default,`${i}.default`)}:{},...c.defaultError===void 0?{}:{defaultError:o(c.defaultError)}}}};return n},o=e=>typeof e==`string`?e:`custom error`,s=e=>{let t=r(e);return t?.kind===`rule`?t.label:void 0},c=e=>({version:1,root:a()(e,`root`)});export{r as a,e as i,i as n,n as r,c as t};
2
- //# sourceMappingURL=to-graph-C-KK0y4c.js.map
1
+ const e=e=>Number.isFinite(e)?e:String(e),t=Symbol.for(`ts-rules-composer.node`),n=(e,n)=>(Object.defineProperty(e,t,{value:n,enumerable:!1,writable:!1,configurable:!0}),e),r=e=>typeof e==`function`&&Object.hasOwn(e,t)?e[t]:void 0,i=e=>{let{name:t}=e;return t===``||t===`anonymous`||t.startsWith(`bound `)?void 0:t},a=()=>{let e=0,t=(t,n)=>n??i(t)??`rule #${++e}`,n=(e,i,a)=>{let c=r(e);if(!c||c.kind===`rule`)return{id:i,kind:`rule`,label:t(e,c?.label??a),...c?.params?{params:{...c.params}}:{}};switch(c.kind){case`sequence`:return{id:i,kind:`sequence`,via:c.via,steps:c.steps.map((e,t)=>n(e,`${i}.steps.${t}`))};case`branch`:return{id:i,kind:`branch`,test:t(c.test,s(c.test)),...c.ifTrue?{ifTrue:n(c.ifTrue,`${i}.ifTrue`)}:{},...c.ifFalse?{ifFalse:n(c.ifFalse,`${i}.ifFalse`)}:{}};case`all`:case`any`:return{id:i,kind:c.kind,rules:c.rules.map((e,t)=>n(e,`${i}.rules.${t}`))};case`not`:return{id:i,kind:`not`,rule:n(c.rule,`${i}.rule`)};case`fallback`:{let e=n(c.main,`${i}.main`),r=c.guard&&t(c.guard,s(c.guard));return{id:i,kind:`fallback`,main:e,...r?{guard:r}:{},fallback:n(c.fallback,`${i}.fallback`)}}case`field`:return{id:i,kind:`field`,getter:t(c.getter,s(c.getter)),rule:n(c.rule,`${i}.rule`)};case`effect`:return{id:i,kind:`effect`,label:t(c.effect,s(c.effect))};case`decorator`:{let e=c.decorator===`debug`?c.params.name:void 0;return{id:i,kind:`decorator`,decorator:c.decorator,params:{...c.params},rule:n(c.rule,`${i}.rule`,typeof e==`string`?e:a)}}case`switch`:return{id:i,kind:`switch`,selector:t(c.selector,s(c.selector)),cases:Reflect.ownKeys(c.cases).map((e,t)=>({key:String(e),node:n(c.cases[e],`${i}.cases.${t}`)})),...c.default?{default:n(c.default,`${i}.default`)}:{},...c.defaultError===void 0?{}:{defaultError:o(c.defaultError)}};default:return{id:i,kind:`rule`,label:t(e,a)}}};return n},o=e=>typeof e==`string`?e:`custom error`,s=e=>{let t=r(e);return t?.kind===`rule`?t.label:void 0},c=e=>({version:1,root:a()(e,`root`)});export{r as a,e as i,i as n,n as r,c as t};
2
+ //# sourceMappingURL=to-graph-nf3nMDMB.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"to-graph-nf3nMDMB.js","names":["jsonNumber","value","NODE_KEY","attachNode","fn","node","readNode","usableName","name","createBuilder","unlabelled","labelOf","explicit","build","raw","hint","step","id","index","readLabel","rule","main","guard","debugName","key","describeError","error","toGraph"],"sources":["../src/lib/graph/node.ts","../src/lib/graph/labels.ts","../src/lib/graph/to-graph.ts"],"sourcesContent":["/**\n * Graph node primitives.\n *\n * This module must not import from `combinators/` or `helpers/`: combinators\n * import it, and `helpers/` and `combinators/` already depend on each other.\n */\n\n/** Any function a combinator may hold as a child (rule, predicate, accessor). */\nexport type Fn = (...args: never[]) => unknown;\n\n/** A number as a JSON-safe param: `Infinity` and `NaN` would become `null`. */\nexport const jsonNumber = (value: number): number | string =>\n Number.isFinite(value) ? value : String(value);\n\n/** Behavior a decorator adds around a rule without changing what it checks. */\nexport type DecoratorName =\n | \"timeout\"\n | \"retry\"\n | \"memoize\"\n | \"debug\"\n | \"tap\"\n | \"mapError\"\n | \"lazyContext\";\n\n/**\n * Structure recorded by a combinator at construction time. Children are the\n * original functions passed in (before any safety wrapping), so they can be\n * inspected later. Internal: the public, JSON-safe form is {@link GraphNode}.\n */\nexport type RawNode =\n | {\n /** A rule given an explicit label by `named`. */\n kind: \"rule\";\n label: string;\n params?: Record<string, unknown>;\n }\n | {\n kind: \"sequence\";\n /** Steps in execution order (`composeRules` runs its array reversed). */\n steps: Fn[];\n via: \"pipeRules\" | \"composeRules\";\n }\n | {\n kind: \"branch\";\n /**\n * `when` has only `ifTrue`, `unless` only `ifFalse`, `ifElse` both. A\n * missing side passes. (Not named `then`/`else`: an object with a\n * `then` key is treated as a promise by `await`.)\n */\n test: Fn;\n ifTrue?: Fn;\n ifFalse?: Fn;\n }\n | {\n kind: \"switch\";\n selector: Fn;\n /** Copy of the cases object, keyed as `match` received it. */\n cases: Record<PropertyKey, Fn>;\n /** `match`'s default rule; at most one of `default`/`defaultError`. */\n default?: Fn;\n /** `match`'s default error value, kept raw (never stringified here). */\n defaultError?: unknown;\n }\n | {\n /** `every` is `all` (every rule must pass), `oneOf` is `any`. */\n kind: \"all\" | \"any\";\n rules: Fn[];\n }\n | { kind: \"not\"; rule: Fn }\n | {\n kind: \"fallback\";\n main: Fn;\n fallback: Fn;\n /** `onlyFallbackOn`: when set, the fallback runs only if it accepts the error. */\n guard?: Fn;\n }\n | {\n kind: \"field\";\n /** Reads the value the rule is applied to. */\n getter: Fn;\n rule: Fn;\n }\n | {\n kind: \"effect\";\n /** The side effect `tap` runs; the rule always passes. */\n effect: Fn;\n }\n | {\n kind: \"decorator\";\n decorator: DecoratorName;\n /** The decorated rule, as passed in. */\n rule: Fn;\n /** Settings worth showing, as plain JSON values. */\n params: Record<string, unknown>;\n };\n\n/** Public, JSON-serializable graph. Built by `toGraph`. */\nexport type GraphNode =\n | {\n id: string;\n kind: \"rule\";\n label: string;\n params?: Record<string, unknown>;\n }\n | {\n id: string;\n kind: \"sequence\";\n via: \"pipeRules\" | \"composeRules\";\n steps: GraphNode[];\n }\n | {\n id: string;\n kind: \"branch\";\n test: string;\n ifTrue?: GraphNode;\n ifFalse?: GraphNode;\n }\n | {\n id: string;\n kind: \"switch\";\n selector: string;\n /** In `Reflect.ownKeys` order; symbol keys appear as `Symbol(desc)`. */\n cases: { key: string; node: GraphNode }[];\n /** Absent `default` and `defaultError` mean \"no match\" fails. */\n default?: GraphNode;\n defaultError?: string;\n }\n | {\n id: string;\n kind: \"all\" | \"any\";\n rules: GraphNode[];\n }\n | { id: string; kind: \"not\"; rule: GraphNode }\n | {\n id: string;\n kind: \"fallback\";\n main: GraphNode;\n fallback: GraphNode;\n guard?: string;\n }\n | { id: string; kind: \"field\"; getter: string; rule: GraphNode }\n | { id: string; kind: \"effect\"; label: string }\n | {\n id: string;\n kind: \"decorator\";\n decorator: DecoratorName;\n params: Record<string, unknown>;\n rule: GraphNode;\n };\n\nexport type RuleGraph = { version: 1; root: GraphNode };\n\n/**\n * Registry symbol, so ESM and CJS copies of the package (or several copies of\n * one version) read each other's metadata.\n */\nexport const NODE_KEY: unique symbol = Symbol.for(\n \"ts-rules-composer.node\",\n) as never;\n\ntype WithNode = { [NODE_KEY]?: RawNode };\n\n/**\n * Records `node` on `fn` and returns the same function. The property is\n * non-enumerable, so spreading, `Object.keys` and `JSON.stringify` are\n * unaffected. A later call replaces an earlier one.\n */\nexport const attachNode = <F extends Fn>(fn: F, node: RawNode): F => {\n Object.defineProperty(fn, NODE_KEY, {\n value: node,\n enumerable: false,\n writable: false,\n configurable: true,\n });\n return fn;\n};\n\n/** Returns the node recorded on `fn`, or `undefined` for plain functions. */\nexport const readNode = (fn: unknown): RawNode | undefined =>\n typeof fn === \"function\" && Object.hasOwn(fn, NODE_KEY)\n ? (fn as WithNode)[NODE_KEY]\n : undefined;\n","/**\n * The function's own name, unless it carries no information: empty,\n * \"anonymous\", or the \"bound x\" name given by `Function.prototype.bind`.\n */\nexport const usableName = (fn: { name: string }): string | undefined => {\n const { name } = fn;\n return name === \"\" || name === \"anonymous\" || name.startsWith(\"bound \")\n ? undefined\n : name;\n};\n","import type { Rule } from \"../types\";\nimport { usableName } from \"./labels\";\nimport { type Fn, type GraphNode, type RuleGraph, readNode } from \"./node\";\n\n/**\n * Builds the public graph. Unlabelled functions get `rule #n`, numbered in\n * depth-first order (a branch's predicate before its sides) so that the same\n * pipeline always yields the same labels.\n */\nconst createBuilder = () => {\n let unlabelled = 0;\n const labelOf = (fn: Fn, explicit?: string) =>\n explicit ?? usableName(fn) ?? `rule #${++unlabelled}`;\n\n /**\n * `hint` is a label offered by an enclosing `withDebug`: it names a leaf\n * rule that has no explicit label, ahead of the function's own name.\n */\n const build = (fn: Fn, id: string, hint?: string): GraphNode => {\n const raw = readNode(fn);\n\n // Any function without a recorded structure is a leaf rule.\n if (!raw || raw.kind === \"rule\") {\n return {\n id,\n kind: \"rule\",\n label: labelOf(fn, raw?.label ?? hint),\n ...(raw?.params ? { params: { ...raw.params } } : {}),\n };\n }\n\n switch (raw.kind) {\n case \"sequence\":\n return {\n id,\n kind: \"sequence\",\n via: raw.via,\n steps: raw.steps.map((step, index) =>\n build(step, `${id}.steps.${index}`),\n ),\n };\n case \"branch\": {\n const test = labelOf(raw.test, readLabel(raw.test));\n return {\n id,\n kind: \"branch\",\n test,\n ...(raw.ifTrue ? { ifTrue: build(raw.ifTrue, `${id}.ifTrue`) } : {}),\n ...(raw.ifFalse\n ? { ifFalse: build(raw.ifFalse, `${id}.ifFalse`) }\n : {}),\n };\n }\n case \"all\":\n case \"any\":\n return {\n id,\n kind: raw.kind,\n rules: raw.rules.map((rule, index) =>\n build(rule, `${id}.rules.${index}`),\n ),\n };\n case \"not\":\n return { id, kind: \"not\", rule: build(raw.rule, `${id}.rule`) };\n case \"fallback\": {\n // Numbered in execution order: main, then the guard, then the fallback.\n const main = build(raw.main, `${id}.main`);\n const guard = raw.guard && labelOf(raw.guard, readLabel(raw.guard));\n return {\n id,\n kind: \"fallback\",\n main,\n ...(guard ? { guard } : {}),\n fallback: build(raw.fallback, `${id}.fallback`),\n };\n }\n case \"field\": {\n const getter = labelOf(raw.getter, readLabel(raw.getter));\n return {\n id,\n kind: \"field\",\n getter,\n rule: build(raw.rule, `${id}.rule`),\n };\n }\n case \"effect\":\n return {\n id,\n kind: \"effect\",\n label: labelOf(raw.effect, readLabel(raw.effect)),\n };\n case \"decorator\": {\n const debugName =\n raw.decorator === \"debug\" ? raw.params.name : undefined;\n return {\n id,\n kind: \"decorator\",\n decorator: raw.decorator,\n params: { ...raw.params },\n rule: build(\n raw.rule,\n `${id}.rule`,\n typeof debugName === \"string\" ? debugName : hint,\n ),\n };\n }\n case \"switch\": {\n const selector = labelOf(raw.selector, readLabel(raw.selector));\n return {\n id,\n kind: \"switch\",\n selector,\n cases: Reflect.ownKeys(raw.cases).map((key, index) => ({\n key: String(key),\n node: build(raw.cases[key] as Fn, `${id}.cases.${index}`),\n })),\n ...(raw.default\n ? { default: build(raw.default, `${id}.default`) }\n : {}),\n ...(raw.defaultError !== undefined\n ? { defaultError: describeError(raw.defaultError) }\n : {}),\n };\n }\n // The node key is shared, so another version of this package could have\n // attached a kind this one does not know: describe it as a leaf.\n default:\n return { id, kind: \"rule\", label: labelOf(fn, hint) };\n }\n };\n\n return build;\n};\n\n/** Strings are shown as-is; anything else is never stringified (it could run user code). */\nconst describeError = (error: unknown) =>\n typeof error === \"string\" ? error : \"custom error\";\n\nconst readLabel = (fn: Fn) => {\n const raw = readNode(fn);\n return raw?.kind === \"rule\" ? raw.label : undefined;\n};\n\n/**\n * Describes a rule as a JSON-serializable graph, without running it.\n *\n * Rules built with this package's combinators are described structurally; any\n * other function (including your own wrappers) is a single leaf rule.\n *\n * @example\n * const graph = toGraph(pipeRules([hasItems, withinLimit]));\n * // { version: 1, root: { kind: \"sequence\", steps: [...] } }\n * @caveats\n * - Nothing is executed: rules, predicates and accessors are never called.\n * - Anonymous functions are labelled `rule #n`; use `named` for a real name.\n */\nexport const toGraph = <TInput, TError, TContext>(\n rule: Rule<TInput, TError, TContext>,\n): RuleGraph => ({ version: 1, root: createBuilder()(rule, \"root\") });\n"],"mappings":"AAWA,MAAaA,EAAc,GACzB,OAAO,SAASC,CAAK,EAAIA,EAAQ,OAAOA,CAAK,EAgJlCC,EAA0B,OAAO,IAC5C,wBACF,EASaC,GAA4B,EAAO,KAC9C,OAAO,eAAeC,EAAIF,EAAU,CAClC,MAAOG,EACP,WAAY,GACZ,SAAU,GACV,aAAc,EAChB,CAAC,EACMD,GAIIE,EAAY,GACvB,OAAOF,GAAO,YAAc,OAAO,OAAOA,EAAIF,CAAQ,EACjDE,EAAgBF,GACjB,IAAA,GCjLOK,EAAc,GAA6C,CACtE,GAAM,CAAE,QAASH,EACjB,OAAOI,IAAS,IAAMA,IAAS,aAAeA,EAAK,WAAW,QAAQ,EAClE,IAAA,GACAA,CACN,ECAMC,MAAsB,CAC1B,IAAIC,EAAa,EACXC,GAAW,EAAQ,IACvBC,GAAYL,EAAWH,CAAE,GAAK,SAAS,EAAEM,IAMrCG,GAAS,EAAQ,EAAY,IAA6B,CAC9D,IAAMC,EAAMR,EAASF,CAAE,EAGvB,GAAI,CAACU,GAAOA,EAAI,OAAS,OACvB,MAAO,CACL,KACA,KAAM,OACN,MAAOH,EAAQP,EAAIU,GAAK,OAASC,CAAI,EACrC,GAAID,GAAK,OAAS,CAAE,OAAQ,CAAE,GAAGA,EAAI,MAAO,CAAE,EAAI,CAAC,CACrD,EAGF,OAAQA,EAAI,KAAZ,CACE,IAAK,WACH,MAAO,CACL,KACA,KAAM,WACN,IAAKA,EAAI,IACT,MAAOA,EAAI,MAAM,KAAK,EAAM,IAC1BD,EAAMG,EAAM,GAAGC,EAAG,SAASC,GAAO,CACpC,CACF,EACF,IAAK,SAEH,MAAO,CACL,KACA,KAAM,SACN,KAJWP,EAAQG,EAAI,KAAMK,EAAUL,EAAI,IAAI,CAI5C,EACH,GAAIA,EAAI,OAAS,CAAE,OAAQD,EAAMC,EAAI,OAAQ,GAAGG,EAAG,QAAQ,CAAE,EAAI,CAAC,EAClE,GAAIH,EAAI,QACJ,CAAE,QAASD,EAAMC,EAAI,QAAS,GAAGG,EAAG,SAAS,CAAE,EAC/C,CAAC,CACP,EAEF,IAAK,MACL,IAAK,MACH,MAAO,CACL,KACA,KAAMH,EAAI,KACV,MAAOA,EAAI,MAAM,KAAK,EAAM,IAC1BD,EAAMO,EAAM,GAAGH,EAAG,SAASC,GAAO,CACpC,CACF,EACF,IAAK,MACH,MAAO,CAAE,KAAI,KAAM,MAAO,KAAML,EAAMC,EAAI,KAAM,GAAGG,EAAG,MAAM,CAAE,EAChE,IAAK,WAAY,CAEf,IAAMI,EAAOR,EAAMC,EAAI,KAAM,GAAGG,EAAG,MAAM,EACnCK,EAAQR,EAAI,OAASH,EAAQG,EAAI,MAAOK,EAAUL,EAAI,KAAK,CAAC,EAClE,MAAO,CACL,KACA,KAAM,WACN,OACA,GAAIQ,EAAQ,CAAE,OAAM,EAAI,CAAC,EACzB,SAAUT,EAAMC,EAAI,SAAU,GAAGG,EAAG,UAAU,CAChD,CACF,CACA,IAAK,QAEH,MAAO,CACL,KACA,KAAM,QACN,OAJaN,EAAQG,EAAI,OAAQK,EAAUL,EAAI,MAAM,CAIhD,EACL,KAAMD,EAAMC,EAAI,KAAM,GAAGG,EAAG,MAAM,CACpC,EAEF,IAAK,SACH,MAAO,CACL,KACA,KAAM,SACN,MAAON,EAAQG,EAAI,OAAQK,EAAUL,EAAI,MAAM,CAAC,CAClD,EACF,IAAK,YAAa,CAChB,IAAMS,EACJT,EAAI,YAAc,QAAUA,EAAI,OAAO,KAAO,IAAA,GAChD,MAAO,CACL,KACA,KAAM,YACN,UAAWA,EAAI,UACf,OAAQ,CAAE,GAAGA,EAAI,MAAO,EACxB,KAAMD,EACJC,EAAI,KACJ,GAAGG,EAAG,OACN,OAAOM,GAAc,SAAWA,EAAYR,CAC9C,CACF,CACF,CACA,IAAK,SAEH,MAAO,CACL,KACA,KAAM,SACN,SAJeJ,EAAQG,EAAI,SAAUK,EAAUL,EAAI,QAAQ,CAIpD,EACP,MAAO,QAAQ,QAAQA,EAAI,KAAK,CAAC,CAAC,KAAK,EAAK,KAAW,CACrD,IAAK,OAAOU,CAAG,EACf,KAAMX,EAAMC,EAAI,MAAMU,GAAY,GAAGP,EAAG,SAASC,GAAO,CAC1D,EAAE,EACF,GAAIJ,EAAI,QACJ,CAAE,QAASD,EAAMC,EAAI,QAAS,GAAGG,EAAG,SAAS,CAAE,EAC/C,CAAC,EACL,GAAIH,EAAI,eAAiB,IAAA,GAErB,CAAC,EADD,CAAE,aAAcW,EAAcX,EAAI,YAAY,CAAE,CAEtD,EAIF,QACE,MAAO,CAAE,KAAI,KAAM,OAAQ,MAAOH,EAAQP,EAAIW,CAAI,CAAE,CACxD,CACF,EAEA,OAAOF,CACT,EAGMY,EAAiB,GACrB,OAAOC,GAAU,SAAWA,EAAQ,eAEhCP,EAAa,GAAW,CAC5B,IAAML,EAAMR,EAASF,CAAE,EACvB,OAAOU,GAAK,OAAS,OAASA,EAAI,MAAQ,IAAA,EAC5C,EAeaa,EACX,IACe,CAAE,QAAS,EAAG,KAAMlB,EAAc,CAAC,CAACW,EAAM,MAAM,CAAE,G"}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "ts-rules-composer",
3
- "version": "1.6.0",
3
+ "version": "1.7.0",
4
4
  "description": "Typescript rules engine by composition",
5
5
  "main": "./dist/index.cjs",
6
6
  "module": "./dist/index.js",
@@ -1 +0,0 @@
1
- {"version":3,"file":"to-graph-C-KK0y4c.js","names":["jsonNumber","value","NODE_KEY","attachNode","fn","node","readNode","usableName","name","createBuilder","unlabelled","labelOf","explicit","build","raw","hint","step","id","index","readLabel","rule","main","guard","debugName","key","describeError","error","toGraph"],"sources":["../src/lib/graph/node.ts","../src/lib/graph/labels.ts","../src/lib/graph/to-graph.ts"],"sourcesContent":["/**\n * Graph node primitives.\n *\n * This module must not import from `combinators/` or `helpers/`: combinators\n * import it, and `helpers/` and `combinators/` already depend on each other.\n */\n\n/** Any function a combinator may hold as a child (rule, predicate, accessor). */\nexport type Fn = (...args: never[]) => unknown;\n\n/** A number as a JSON-safe param: `Infinity` and `NaN` would become `null`. */\nexport const jsonNumber = (value: number): number | string =>\n Number.isFinite(value) ? value : String(value);\n\n/** Behavior a decorator adds around a rule without changing what it checks. */\nexport type DecoratorName =\n | \"timeout\"\n | \"retry\"\n | \"memoize\"\n | \"debug\"\n | \"tap\"\n | \"mapError\";\n\n/**\n * Structure recorded by a combinator at construction time. Children are the\n * original functions passed in (before any safety wrapping), so they can be\n * inspected later. Internal: the public, JSON-safe form is {@link GraphNode}.\n */\nexport type RawNode =\n | {\n /** A rule given an explicit label by `named`. */\n kind: \"rule\";\n label: string;\n params?: Record<string, unknown>;\n }\n | {\n kind: \"sequence\";\n /** Steps in execution order (`composeRules` runs its array reversed). */\n steps: Fn[];\n via: \"pipeRules\" | \"composeRules\";\n }\n | {\n kind: \"branch\";\n /**\n * `when` has only `ifTrue`, `unless` only `ifFalse`, `ifElse` both. A\n * missing side passes. (Not named `then`/`else`: an object with a\n * `then` key is treated as a promise by `await`.)\n */\n test: Fn;\n ifTrue?: Fn;\n ifFalse?: Fn;\n }\n | {\n kind: \"switch\";\n selector: Fn;\n /** Copy of the cases object, keyed as `match` received it. */\n cases: Record<PropertyKey, Fn>;\n /** `match`'s default rule; at most one of `default`/`defaultError`. */\n default?: Fn;\n /** `match`'s default error value, kept raw (never stringified here). */\n defaultError?: unknown;\n }\n | {\n /** `every` is `all` (every rule must pass), `oneOf` is `any`. */\n kind: \"all\" | \"any\";\n rules: Fn[];\n }\n | { kind: \"not\"; rule: Fn }\n | {\n kind: \"fallback\";\n main: Fn;\n fallback: Fn;\n /** `onlyFallbackOn`: when set, the fallback runs only if it accepts the error. */\n guard?: Fn;\n }\n | {\n kind: \"field\";\n /** Reads the value the rule is applied to. */\n getter: Fn;\n rule: Fn;\n }\n | {\n kind: \"effect\";\n /** The side effect `tap` runs; the rule always passes. */\n effect: Fn;\n }\n | {\n kind: \"decorator\";\n decorator: DecoratorName;\n /** The decorated rule, as passed in. */\n rule: Fn;\n /** Settings worth showing, as plain JSON values. */\n params: Record<string, unknown>;\n };\n\n/** Public, JSON-serializable graph. Built by `toGraph`. */\nexport type GraphNode =\n | {\n id: string;\n kind: \"rule\";\n label: string;\n params?: Record<string, unknown>;\n }\n | {\n id: string;\n kind: \"sequence\";\n via: \"pipeRules\" | \"composeRules\";\n steps: GraphNode[];\n }\n | {\n id: string;\n kind: \"branch\";\n test: string;\n ifTrue?: GraphNode;\n ifFalse?: GraphNode;\n }\n | {\n id: string;\n kind: \"switch\";\n selector: string;\n /** In `Reflect.ownKeys` order; symbol keys appear as `Symbol(desc)`. */\n cases: { key: string; node: GraphNode }[];\n /** Absent `default` and `defaultError` mean \"no match\" fails. */\n default?: GraphNode;\n defaultError?: string;\n }\n | {\n id: string;\n kind: \"all\" | \"any\";\n rules: GraphNode[];\n }\n | { id: string; kind: \"not\"; rule: GraphNode }\n | {\n id: string;\n kind: \"fallback\";\n main: GraphNode;\n fallback: GraphNode;\n guard?: string;\n }\n | { id: string; kind: \"field\"; getter: string; rule: GraphNode }\n | { id: string; kind: \"effect\"; label: string }\n | {\n id: string;\n kind: \"decorator\";\n decorator: DecoratorName;\n params: Record<string, unknown>;\n rule: GraphNode;\n };\n\nexport type RuleGraph = { version: 1; root: GraphNode };\n\n/**\n * Registry symbol, so ESM and CJS copies of the package (or several copies of\n * one version) read each other's metadata.\n */\nexport const NODE_KEY: unique symbol = Symbol.for(\n \"ts-rules-composer.node\",\n) as never;\n\ntype WithNode = { [NODE_KEY]?: RawNode };\n\n/**\n * Records `node` on `fn` and returns the same function. The property is\n * non-enumerable, so spreading, `Object.keys` and `JSON.stringify` are\n * unaffected. A later call replaces an earlier one.\n */\nexport const attachNode = <F extends Fn>(fn: F, node: RawNode): F => {\n Object.defineProperty(fn, NODE_KEY, {\n value: node,\n enumerable: false,\n writable: false,\n configurable: true,\n });\n return fn;\n};\n\n/** Returns the node recorded on `fn`, or `undefined` for plain functions. */\nexport const readNode = (fn: unknown): RawNode | undefined =>\n typeof fn === \"function\" && Object.hasOwn(fn, NODE_KEY)\n ? (fn as WithNode)[NODE_KEY]\n : undefined;\n","/**\n * The function's own name, unless it carries no information: empty,\n * \"anonymous\", or the \"bound x\" name given by `Function.prototype.bind`.\n */\nexport const usableName = (fn: { name: string }): string | undefined => {\n const { name } = fn;\n return name === \"\" || name === \"anonymous\" || name.startsWith(\"bound \")\n ? undefined\n : name;\n};\n","import type { Rule } from \"../types\";\nimport { usableName } from \"./labels\";\nimport { type Fn, type GraphNode, type RuleGraph, readNode } from \"./node\";\n\n/**\n * Builds the public graph. Unlabelled functions get `rule #n`, numbered in\n * depth-first order (a branch's predicate before its sides) so that the same\n * pipeline always yields the same labels.\n */\nconst createBuilder = () => {\n let unlabelled = 0;\n const labelOf = (fn: Fn, explicit?: string) =>\n explicit ?? usableName(fn) ?? `rule #${++unlabelled}`;\n\n /**\n * `hint` is a label offered by an enclosing `withDebug`: it names a leaf\n * rule that has no explicit label, ahead of the function's own name.\n */\n const build = (fn: Fn, id: string, hint?: string): GraphNode => {\n const raw = readNode(fn);\n\n // Any function without a recorded structure is a leaf rule.\n if (!raw || raw.kind === \"rule\") {\n return {\n id,\n kind: \"rule\",\n label: labelOf(fn, raw?.label ?? hint),\n ...(raw?.params ? { params: { ...raw.params } } : {}),\n };\n }\n\n switch (raw.kind) {\n case \"sequence\":\n return {\n id,\n kind: \"sequence\",\n via: raw.via,\n steps: raw.steps.map((step, index) =>\n build(step, `${id}.steps.${index}`),\n ),\n };\n case \"branch\": {\n const test = labelOf(raw.test, readLabel(raw.test));\n return {\n id,\n kind: \"branch\",\n test,\n ...(raw.ifTrue ? { ifTrue: build(raw.ifTrue, `${id}.ifTrue`) } : {}),\n ...(raw.ifFalse\n ? { ifFalse: build(raw.ifFalse, `${id}.ifFalse`) }\n : {}),\n };\n }\n case \"all\":\n case \"any\":\n return {\n id,\n kind: raw.kind,\n rules: raw.rules.map((rule, index) =>\n build(rule, `${id}.rules.${index}`),\n ),\n };\n case \"not\":\n return { id, kind: \"not\", rule: build(raw.rule, `${id}.rule`) };\n case \"fallback\": {\n // Numbered in execution order: main, then the guard, then the fallback.\n const main = build(raw.main, `${id}.main`);\n const guard = raw.guard && labelOf(raw.guard, readLabel(raw.guard));\n return {\n id,\n kind: \"fallback\",\n main,\n ...(guard ? { guard } : {}),\n fallback: build(raw.fallback, `${id}.fallback`),\n };\n }\n case \"field\": {\n const getter = labelOf(raw.getter, readLabel(raw.getter));\n return {\n id,\n kind: \"field\",\n getter,\n rule: build(raw.rule, `${id}.rule`),\n };\n }\n case \"effect\":\n return {\n id,\n kind: \"effect\",\n label: labelOf(raw.effect, readLabel(raw.effect)),\n };\n case \"decorator\": {\n const debugName =\n raw.decorator === \"debug\" ? raw.params.name : undefined;\n return {\n id,\n kind: \"decorator\",\n decorator: raw.decorator,\n params: { ...raw.params },\n rule: build(\n raw.rule,\n `${id}.rule`,\n typeof debugName === \"string\" ? debugName : hint,\n ),\n };\n }\n case \"switch\": {\n const selector = labelOf(raw.selector, readLabel(raw.selector));\n return {\n id,\n kind: \"switch\",\n selector,\n cases: Reflect.ownKeys(raw.cases).map((key, index) => ({\n key: String(key),\n node: build(raw.cases[key] as Fn, `${id}.cases.${index}`),\n })),\n ...(raw.default\n ? { default: build(raw.default, `${id}.default`) }\n : {}),\n ...(raw.defaultError !== undefined\n ? { defaultError: describeError(raw.defaultError) }\n : {}),\n };\n }\n }\n };\n\n return build;\n};\n\n/** Strings are shown as-is; anything else is never stringified (it could run user code). */\nconst describeError = (error: unknown) =>\n typeof error === \"string\" ? error : \"custom error\";\n\nconst readLabel = (fn: Fn) => {\n const raw = readNode(fn);\n return raw?.kind === \"rule\" ? raw.label : undefined;\n};\n\n/**\n * Describes a rule as a JSON-serializable graph, without running it.\n *\n * Rules built with this package's combinators are described structurally; any\n * other function (including your own wrappers) is a single leaf rule.\n *\n * @example\n * const graph = toGraph(pipeRules([hasItems, withinLimit]));\n * // { version: 1, root: { kind: \"sequence\", steps: [...] } }\n * @caveats\n * - Nothing is executed: rules, predicates and accessors are never called.\n * - Anonymous functions are labelled `rule #n`; use `named` for a real name.\n */\nexport const toGraph = <TInput, TError, TContext>(\n rule: Rule<TInput, TError, TContext>,\n): RuleGraph => ({ version: 1, root: createBuilder()(rule, \"root\") });\n"],"mappings":"AAWA,MAAaA,EAAc,GACzB,OAAO,SAASC,CAAK,EAAIA,EAAQ,OAAOA,CAAK,EA+IlCC,EAA0B,OAAO,IAC5C,wBACF,EASaC,GAA4B,EAAO,KAC9C,OAAO,eAAeC,EAAIF,EAAU,CAClC,MAAOG,EACP,WAAY,GACZ,SAAU,GACV,aAAc,EAChB,CAAC,EACMD,GAIIE,EAAY,GACvB,OAAOF,GAAO,YAAc,OAAO,OAAOA,EAAIF,CAAQ,EACjDE,EAAgBF,GACjB,IAAA,GChLOK,EAAc,GAA6C,CACtE,GAAM,CAAE,QAASH,EACjB,OAAOI,IAAS,IAAMA,IAAS,aAAeA,EAAK,WAAW,QAAQ,EAClE,IAAA,GACAA,CACN,ECAMC,MAAsB,CAC1B,IAAIC,EAAa,EACXC,GAAW,EAAQ,IACvBC,GAAYL,EAAWH,CAAE,GAAK,SAAS,EAAEM,IAMrCG,GAAS,EAAQ,EAAY,IAA6B,CAC9D,IAAMC,EAAMR,EAASF,CAAE,EAGvB,GAAI,CAACU,GAAOA,EAAI,OAAS,OACvB,MAAO,CACL,KACA,KAAM,OACN,MAAOH,EAAQP,EAAIU,GAAK,OAASC,CAAI,EACrC,GAAID,GAAK,OAAS,CAAE,OAAQ,CAAE,GAAGA,EAAI,MAAO,CAAE,EAAI,CAAC,CACrD,EAGF,OAAQA,EAAI,KAAZ,CACE,IAAK,WACH,MAAO,CACL,KACA,KAAM,WACN,IAAKA,EAAI,IACT,MAAOA,EAAI,MAAM,KAAK,EAAM,IAC1BD,EAAMG,EAAM,GAAGC,EAAG,SAASC,GAAO,CACpC,CACF,EACF,IAAK,SAEH,MAAO,CACL,KACA,KAAM,SACN,KAJWP,EAAQG,EAAI,KAAMK,EAAUL,EAAI,IAAI,CAI5C,EACH,GAAIA,EAAI,OAAS,CAAE,OAAQD,EAAMC,EAAI,OAAQ,GAAGG,EAAG,QAAQ,CAAE,EAAI,CAAC,EAClE,GAAIH,EAAI,QACJ,CAAE,QAASD,EAAMC,EAAI,QAAS,GAAGG,EAAG,SAAS,CAAE,EAC/C,CAAC,CACP,EAEF,IAAK,MACL,IAAK,MACH,MAAO,CACL,KACA,KAAMH,EAAI,KACV,MAAOA,EAAI,MAAM,KAAK,EAAM,IAC1BD,EAAMO,EAAM,GAAGH,EAAG,SAASC,GAAO,CACpC,CACF,EACF,IAAK,MACH,MAAO,CAAE,KAAI,KAAM,MAAO,KAAML,EAAMC,EAAI,KAAM,GAAGG,EAAG,MAAM,CAAE,EAChE,IAAK,WAAY,CAEf,IAAMI,EAAOR,EAAMC,EAAI,KAAM,GAAGG,EAAG,MAAM,EACnCK,EAAQR,EAAI,OAASH,EAAQG,EAAI,MAAOK,EAAUL,EAAI,KAAK,CAAC,EAClE,MAAO,CACL,KACA,KAAM,WACN,OACA,GAAIQ,EAAQ,CAAE,OAAM,EAAI,CAAC,EACzB,SAAUT,EAAMC,EAAI,SAAU,GAAGG,EAAG,UAAU,CAChD,CACF,CACA,IAAK,QAEH,MAAO,CACL,KACA,KAAM,QACN,OAJaN,EAAQG,EAAI,OAAQK,EAAUL,EAAI,MAAM,CAIhD,EACL,KAAMD,EAAMC,EAAI,KAAM,GAAGG,EAAG,MAAM,CACpC,EAEF,IAAK,SACH,MAAO,CACL,KACA,KAAM,SACN,MAAON,EAAQG,EAAI,OAAQK,EAAUL,EAAI,MAAM,CAAC,CAClD,EACF,IAAK,YAAa,CAChB,IAAMS,EACJT,EAAI,YAAc,QAAUA,EAAI,OAAO,KAAO,IAAA,GAChD,MAAO,CACL,KACA,KAAM,YACN,UAAWA,EAAI,UACf,OAAQ,CAAE,GAAGA,EAAI,MAAO,EACxB,KAAMD,EACJC,EAAI,KACJ,GAAGG,EAAG,OACN,OAAOM,GAAc,SAAWA,EAAYR,CAC9C,CACF,CACF,CACA,IAAK,SAEH,MAAO,CACL,KACA,KAAM,SACN,SAJeJ,EAAQG,EAAI,SAAUK,EAAUL,EAAI,QAAQ,CAIpD,EACP,MAAO,QAAQ,QAAQA,EAAI,KAAK,CAAC,CAAC,KAAK,EAAK,KAAW,CACrD,IAAK,OAAOU,CAAG,EACf,KAAMX,EAAMC,EAAI,MAAMU,GAAY,GAAGP,EAAG,SAASC,GAAO,CAC1D,EAAE,EACF,GAAIJ,EAAI,QACJ,CAAE,QAASD,EAAMC,EAAI,QAAS,GAAGG,EAAG,SAAS,CAAE,EAC/C,CAAC,EACL,GAAIH,EAAI,eAAiB,IAAA,GAErB,CAAC,EADD,CAAE,aAAcW,EAAcX,EAAI,YAAY,CAAE,CAEtD,CAEJ,CACF,EAEA,OAAOD,CACT,EAGMY,EAAiB,GACrB,OAAOC,GAAU,SAAWA,EAAQ,eAEhCP,EAAa,GAAW,CAC5B,IAAML,EAAMR,EAASF,CAAE,EACvB,OAAOU,GAAK,OAAS,OAASA,EAAI,MAAQ,IAAA,EAC5C,EAeaa,EACX,IACe,CAAE,QAAS,EAAG,KAAMlB,EAAc,CAAC,CAACW,EAAM,MAAM,CAAE,G"}
@@ -1 +0,0 @@
1
- {"version":3,"file":"to-graph-DRYHiuLU.cjs","names":["jsonNumber","value","NODE_KEY","attachNode","fn","node","readNode","usableName","name","createBuilder","unlabelled","labelOf","explicit","build","raw","hint","step","id","index","readLabel","rule","main","guard","debugName","key","describeError","error","toGraph"],"sources":["../src/lib/graph/node.ts","../src/lib/graph/labels.ts","../src/lib/graph/to-graph.ts"],"sourcesContent":["/**\n * Graph node primitives.\n *\n * This module must not import from `combinators/` or `helpers/`: combinators\n * import it, and `helpers/` and `combinators/` already depend on each other.\n */\n\n/** Any function a combinator may hold as a child (rule, predicate, accessor). */\nexport type Fn = (...args: never[]) => unknown;\n\n/** A number as a JSON-safe param: `Infinity` and `NaN` would become `null`. */\nexport const jsonNumber = (value: number): number | string =>\n Number.isFinite(value) ? value : String(value);\n\n/** Behavior a decorator adds around a rule without changing what it checks. */\nexport type DecoratorName =\n | \"timeout\"\n | \"retry\"\n | \"memoize\"\n | \"debug\"\n | \"tap\"\n | \"mapError\";\n\n/**\n * Structure recorded by a combinator at construction time. Children are the\n * original functions passed in (before any safety wrapping), so they can be\n * inspected later. Internal: the public, JSON-safe form is {@link GraphNode}.\n */\nexport type RawNode =\n | {\n /** A rule given an explicit label by `named`. */\n kind: \"rule\";\n label: string;\n params?: Record<string, unknown>;\n }\n | {\n kind: \"sequence\";\n /** Steps in execution order (`composeRules` runs its array reversed). */\n steps: Fn[];\n via: \"pipeRules\" | \"composeRules\";\n }\n | {\n kind: \"branch\";\n /**\n * `when` has only `ifTrue`, `unless` only `ifFalse`, `ifElse` both. A\n * missing side passes. (Not named `then`/`else`: an object with a\n * `then` key is treated as a promise by `await`.)\n */\n test: Fn;\n ifTrue?: Fn;\n ifFalse?: Fn;\n }\n | {\n kind: \"switch\";\n selector: Fn;\n /** Copy of the cases object, keyed as `match` received it. */\n cases: Record<PropertyKey, Fn>;\n /** `match`'s default rule; at most one of `default`/`defaultError`. */\n default?: Fn;\n /** `match`'s default error value, kept raw (never stringified here). */\n defaultError?: unknown;\n }\n | {\n /** `every` is `all` (every rule must pass), `oneOf` is `any`. */\n kind: \"all\" | \"any\";\n rules: Fn[];\n }\n | { kind: \"not\"; rule: Fn }\n | {\n kind: \"fallback\";\n main: Fn;\n fallback: Fn;\n /** `onlyFallbackOn`: when set, the fallback runs only if it accepts the error. */\n guard?: Fn;\n }\n | {\n kind: \"field\";\n /** Reads the value the rule is applied to. */\n getter: Fn;\n rule: Fn;\n }\n | {\n kind: \"effect\";\n /** The side effect `tap` runs; the rule always passes. */\n effect: Fn;\n }\n | {\n kind: \"decorator\";\n decorator: DecoratorName;\n /** The decorated rule, as passed in. */\n rule: Fn;\n /** Settings worth showing, as plain JSON values. */\n params: Record<string, unknown>;\n };\n\n/** Public, JSON-serializable graph. Built by `toGraph`. */\nexport type GraphNode =\n | {\n id: string;\n kind: \"rule\";\n label: string;\n params?: Record<string, unknown>;\n }\n | {\n id: string;\n kind: \"sequence\";\n via: \"pipeRules\" | \"composeRules\";\n steps: GraphNode[];\n }\n | {\n id: string;\n kind: \"branch\";\n test: string;\n ifTrue?: GraphNode;\n ifFalse?: GraphNode;\n }\n | {\n id: string;\n kind: \"switch\";\n selector: string;\n /** In `Reflect.ownKeys` order; symbol keys appear as `Symbol(desc)`. */\n cases: { key: string; node: GraphNode }[];\n /** Absent `default` and `defaultError` mean \"no match\" fails. */\n default?: GraphNode;\n defaultError?: string;\n }\n | {\n id: string;\n kind: \"all\" | \"any\";\n rules: GraphNode[];\n }\n | { id: string; kind: \"not\"; rule: GraphNode }\n | {\n id: string;\n kind: \"fallback\";\n main: GraphNode;\n fallback: GraphNode;\n guard?: string;\n }\n | { id: string; kind: \"field\"; getter: string; rule: GraphNode }\n | { id: string; kind: \"effect\"; label: string }\n | {\n id: string;\n kind: \"decorator\";\n decorator: DecoratorName;\n params: Record<string, unknown>;\n rule: GraphNode;\n };\n\nexport type RuleGraph = { version: 1; root: GraphNode };\n\n/**\n * Registry symbol, so ESM and CJS copies of the package (or several copies of\n * one version) read each other's metadata.\n */\nexport const NODE_KEY: unique symbol = Symbol.for(\n \"ts-rules-composer.node\",\n) as never;\n\ntype WithNode = { [NODE_KEY]?: RawNode };\n\n/**\n * Records `node` on `fn` and returns the same function. The property is\n * non-enumerable, so spreading, `Object.keys` and `JSON.stringify` are\n * unaffected. A later call replaces an earlier one.\n */\nexport const attachNode = <F extends Fn>(fn: F, node: RawNode): F => {\n Object.defineProperty(fn, NODE_KEY, {\n value: node,\n enumerable: false,\n writable: false,\n configurable: true,\n });\n return fn;\n};\n\n/** Returns the node recorded on `fn`, or `undefined` for plain functions. */\nexport const readNode = (fn: unknown): RawNode | undefined =>\n typeof fn === \"function\" && Object.hasOwn(fn, NODE_KEY)\n ? (fn as WithNode)[NODE_KEY]\n : undefined;\n","/**\n * The function's own name, unless it carries no information: empty,\n * \"anonymous\", or the \"bound x\" name given by `Function.prototype.bind`.\n */\nexport const usableName = (fn: { name: string }): string | undefined => {\n const { name } = fn;\n return name === \"\" || name === \"anonymous\" || name.startsWith(\"bound \")\n ? undefined\n : name;\n};\n","import type { Rule } from \"../types\";\nimport { usableName } from \"./labels\";\nimport { type Fn, type GraphNode, type RuleGraph, readNode } from \"./node\";\n\n/**\n * Builds the public graph. Unlabelled functions get `rule #n`, numbered in\n * depth-first order (a branch's predicate before its sides) so that the same\n * pipeline always yields the same labels.\n */\nconst createBuilder = () => {\n let unlabelled = 0;\n const labelOf = (fn: Fn, explicit?: string) =>\n explicit ?? usableName(fn) ?? `rule #${++unlabelled}`;\n\n /**\n * `hint` is a label offered by an enclosing `withDebug`: it names a leaf\n * rule that has no explicit label, ahead of the function's own name.\n */\n const build = (fn: Fn, id: string, hint?: string): GraphNode => {\n const raw = readNode(fn);\n\n // Any function without a recorded structure is a leaf rule.\n if (!raw || raw.kind === \"rule\") {\n return {\n id,\n kind: \"rule\",\n label: labelOf(fn, raw?.label ?? hint),\n ...(raw?.params ? { params: { ...raw.params } } : {}),\n };\n }\n\n switch (raw.kind) {\n case \"sequence\":\n return {\n id,\n kind: \"sequence\",\n via: raw.via,\n steps: raw.steps.map((step, index) =>\n build(step, `${id}.steps.${index}`),\n ),\n };\n case \"branch\": {\n const test = labelOf(raw.test, readLabel(raw.test));\n return {\n id,\n kind: \"branch\",\n test,\n ...(raw.ifTrue ? { ifTrue: build(raw.ifTrue, `${id}.ifTrue`) } : {}),\n ...(raw.ifFalse\n ? { ifFalse: build(raw.ifFalse, `${id}.ifFalse`) }\n : {}),\n };\n }\n case \"all\":\n case \"any\":\n return {\n id,\n kind: raw.kind,\n rules: raw.rules.map((rule, index) =>\n build(rule, `${id}.rules.${index}`),\n ),\n };\n case \"not\":\n return { id, kind: \"not\", rule: build(raw.rule, `${id}.rule`) };\n case \"fallback\": {\n // Numbered in execution order: main, then the guard, then the fallback.\n const main = build(raw.main, `${id}.main`);\n const guard = raw.guard && labelOf(raw.guard, readLabel(raw.guard));\n return {\n id,\n kind: \"fallback\",\n main,\n ...(guard ? { guard } : {}),\n fallback: build(raw.fallback, `${id}.fallback`),\n };\n }\n case \"field\": {\n const getter = labelOf(raw.getter, readLabel(raw.getter));\n return {\n id,\n kind: \"field\",\n getter,\n rule: build(raw.rule, `${id}.rule`),\n };\n }\n case \"effect\":\n return {\n id,\n kind: \"effect\",\n label: labelOf(raw.effect, readLabel(raw.effect)),\n };\n case \"decorator\": {\n const debugName =\n raw.decorator === \"debug\" ? raw.params.name : undefined;\n return {\n id,\n kind: \"decorator\",\n decorator: raw.decorator,\n params: { ...raw.params },\n rule: build(\n raw.rule,\n `${id}.rule`,\n typeof debugName === \"string\" ? debugName : hint,\n ),\n };\n }\n case \"switch\": {\n const selector = labelOf(raw.selector, readLabel(raw.selector));\n return {\n id,\n kind: \"switch\",\n selector,\n cases: Reflect.ownKeys(raw.cases).map((key, index) => ({\n key: String(key),\n node: build(raw.cases[key] as Fn, `${id}.cases.${index}`),\n })),\n ...(raw.default\n ? { default: build(raw.default, `${id}.default`) }\n : {}),\n ...(raw.defaultError !== undefined\n ? { defaultError: describeError(raw.defaultError) }\n : {}),\n };\n }\n }\n };\n\n return build;\n};\n\n/** Strings are shown as-is; anything else is never stringified (it could run user code). */\nconst describeError = (error: unknown) =>\n typeof error === \"string\" ? error : \"custom error\";\n\nconst readLabel = (fn: Fn) => {\n const raw = readNode(fn);\n return raw?.kind === \"rule\" ? raw.label : undefined;\n};\n\n/**\n * Describes a rule as a JSON-serializable graph, without running it.\n *\n * Rules built with this package's combinators are described structurally; any\n * other function (including your own wrappers) is a single leaf rule.\n *\n * @example\n * const graph = toGraph(pipeRules([hasItems, withinLimit]));\n * // { version: 1, root: { kind: \"sequence\", steps: [...] } }\n * @caveats\n * - Nothing is executed: rules, predicates and accessors are never called.\n * - Anonymous functions are labelled `rule #n`; use `named` for a real name.\n */\nexport const toGraph = <TInput, TError, TContext>(\n rule: Rule<TInput, TError, TContext>,\n): RuleGraph => ({ version: 1, root: createBuilder()(rule, \"root\") });\n"],"mappings":"AAWA,MAAaA,EAAc,GACzB,OAAO,SAASC,CAAK,EAAIA,EAAQ,OAAOA,CAAK,EA+IlCC,EAA0B,OAAO,IAC5C,wBACF,EASaC,GAA4B,EAAO,KAC9C,OAAO,eAAeC,EAAIF,EAAU,CAClC,MAAOG,EACP,WAAY,GACZ,SAAU,GACV,aAAc,EAChB,CAAC,EACMD,GAIIE,EAAY,GACvB,OAAOF,GAAO,YAAc,OAAO,OAAOA,EAAIF,CAAQ,EACjDE,EAAgBF,GACjB,IAAA,GChLOK,EAAc,GAA6C,CACtE,GAAM,CAAE,QAASH,EACjB,OAAOI,IAAS,IAAMA,IAAS,aAAeA,EAAK,WAAW,QAAQ,EAClE,IAAA,GACAA,CACN,ECAMC,MAAsB,CAC1B,IAAIC,EAAa,EACXC,GAAW,EAAQ,IACvBC,GAAYL,EAAWH,CAAE,GAAK,SAAS,EAAEM,IAMrCG,GAAS,EAAQ,EAAY,IAA6B,CAC9D,IAAMC,EAAMR,EAASF,CAAE,EAGvB,GAAI,CAACU,GAAOA,EAAI,OAAS,OACvB,MAAO,CACL,KACA,KAAM,OACN,MAAOH,EAAQP,EAAIU,GAAK,OAASC,CAAI,EACrC,GAAID,GAAK,OAAS,CAAE,OAAQ,CAAE,GAAGA,EAAI,MAAO,CAAE,EAAI,CAAC,CACrD,EAGF,OAAQA,EAAI,KAAZ,CACE,IAAK,WACH,MAAO,CACL,KACA,KAAM,WACN,IAAKA,EAAI,IACT,MAAOA,EAAI,MAAM,KAAK,EAAM,IAC1BD,EAAMG,EAAM,GAAGC,EAAG,SAASC,GAAO,CACpC,CACF,EACF,IAAK,SAEH,MAAO,CACL,KACA,KAAM,SACN,KAJWP,EAAQG,EAAI,KAAMK,EAAUL,EAAI,IAAI,CAI5C,EACH,GAAIA,EAAI,OAAS,CAAE,OAAQD,EAAMC,EAAI,OAAQ,GAAGG,EAAG,QAAQ,CAAE,EAAI,CAAC,EAClE,GAAIH,EAAI,QACJ,CAAE,QAASD,EAAMC,EAAI,QAAS,GAAGG,EAAG,SAAS,CAAE,EAC/C,CAAC,CACP,EAEF,IAAK,MACL,IAAK,MACH,MAAO,CACL,KACA,KAAMH,EAAI,KACV,MAAOA,EAAI,MAAM,KAAK,EAAM,IAC1BD,EAAMO,EAAM,GAAGH,EAAG,SAASC,GAAO,CACpC,CACF,EACF,IAAK,MACH,MAAO,CAAE,KAAI,KAAM,MAAO,KAAML,EAAMC,EAAI,KAAM,GAAGG,EAAG,MAAM,CAAE,EAChE,IAAK,WAAY,CAEf,IAAMI,EAAOR,EAAMC,EAAI,KAAM,GAAGG,EAAG,MAAM,EACnCK,EAAQR,EAAI,OAASH,EAAQG,EAAI,MAAOK,EAAUL,EAAI,KAAK,CAAC,EAClE,MAAO,CACL,KACA,KAAM,WACN,OACA,GAAIQ,EAAQ,CAAE,OAAM,EAAI,CAAC,EACzB,SAAUT,EAAMC,EAAI,SAAU,GAAGG,EAAG,UAAU,CAChD,CACF,CACA,IAAK,QAEH,MAAO,CACL,KACA,KAAM,QACN,OAJaN,EAAQG,EAAI,OAAQK,EAAUL,EAAI,MAAM,CAIhD,EACL,KAAMD,EAAMC,EAAI,KAAM,GAAGG,EAAG,MAAM,CACpC,EAEF,IAAK,SACH,MAAO,CACL,KACA,KAAM,SACN,MAAON,EAAQG,EAAI,OAAQK,EAAUL,EAAI,MAAM,CAAC,CAClD,EACF,IAAK,YAAa,CAChB,IAAMS,EACJT,EAAI,YAAc,QAAUA,EAAI,OAAO,KAAO,IAAA,GAChD,MAAO,CACL,KACA,KAAM,YACN,UAAWA,EAAI,UACf,OAAQ,CAAE,GAAGA,EAAI,MAAO,EACxB,KAAMD,EACJC,EAAI,KACJ,GAAGG,EAAG,OACN,OAAOM,GAAc,SAAWA,EAAYR,CAC9C,CACF,CACF,CACA,IAAK,SAEH,MAAO,CACL,KACA,KAAM,SACN,SAJeJ,EAAQG,EAAI,SAAUK,EAAUL,EAAI,QAAQ,CAIpD,EACP,MAAO,QAAQ,QAAQA,EAAI,KAAK,CAAC,CAAC,KAAK,EAAK,KAAW,CACrD,IAAK,OAAOU,CAAG,EACf,KAAMX,EAAMC,EAAI,MAAMU,GAAY,GAAGP,EAAG,SAASC,GAAO,CAC1D,EAAE,EACF,GAAIJ,EAAI,QACJ,CAAE,QAASD,EAAMC,EAAI,QAAS,GAAGG,EAAG,SAAS,CAAE,EAC/C,CAAC,EACL,GAAIH,EAAI,eAAiB,IAAA,GAErB,CAAC,EADD,CAAE,aAAcW,EAAcX,EAAI,YAAY,CAAE,CAEtD,CAEJ,CACF,EAEA,OAAOD,CACT,EAGMY,EAAiB,GACrB,OAAOC,GAAU,SAAWA,EAAQ,eAEhCP,EAAa,GAAW,CAC5B,IAAML,EAAMR,EAASF,CAAE,EACvB,OAAOU,GAAK,OAAS,OAASA,EAAI,MAAQ,IAAA,EAC5C,EAeaa,EACX,IACe,CAAE,QAAS,EAAG,KAAMlB,EAAc,CAAC,CAACW,EAAM,MAAM,CAAE,G"}