typebars 1.1.0 → 1.1.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (11) hide show
  1. package/dist/cjs/analyzer.js +1 -1
  2. package/dist/cjs/analyzer.js.map +1 -1
  3. package/dist/cjs/parser.d.ts +8 -0
  4. package/dist/cjs/parser.js +1 -1
  5. package/dist/cjs/parser.js.map +1 -1
  6. package/dist/esm/analyzer.js +1 -1
  7. package/dist/esm/analyzer.js.map +1 -1
  8. package/dist/esm/parser.d.ts +8 -0
  9. package/dist/esm/parser.js +1 -1
  10. package/dist/esm/parser.js.map +1 -1
  11. package/package.json +1 -1
package/dist/esm/analyzer.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"sources":["../../src/analyzer.ts"],"sourcesContent":["import type { JSONSchema7 } from \"json-schema\";\nimport { dispatchAnalyze } from \"./dispatch.ts\";\nimport {\n\tcreateMissingArgumentMessage,\n\tcreatePropertyNotFoundMessage,\n\tcreateRootPathTraversalMessage,\n\tcreateTypeMismatchMessage,\n\tcreateUnanalyzableMessage,\n\tcreateUnknownHelperMessage,\n} from \"./errors\";\nimport { DefaultHelpers } from \"./helpers/default-helpers.ts\";\nimport { MapHelpers } from \"./helpers/map-helpers.ts\";\nimport {\n\tdetectLiteralType,\n\textractExpressionIdentifier,\n\textractPathSegments,\n\tgetEffectiveBody,\n\tgetEffectivelySingleBlock,\n\tgetEffectivelySingleExpression,\n\tisRootPathTraversal,\n\tisRootSegments,\n\tisThisExpression,\n\tparse,\n} from \"./parser\";\nimport {\n\tfindConditionalSchemaLocations,\n\tisPropertyRequired,\n\tresolveArrayItems,\n\tresolveSchemaPath,\n\tsimplifySchema,\n} from \"./schema-resolver\";\nimport type {\n\tAnalysisResult,\n\tDiagnosticCode,\n\tDiagnosticDetails,\n\tHelperDefinition,\n\tTemplateDiagnostic,\n\tTemplateInput,\n} from \"./types.ts\";\nimport {\n\tdeepEqual,\n\textractSourceSnippet,\n\tgetSchemaPropertyNames,\n} from \"./utils\";\n\n// ─── Static Analyzer ─────────────────────────────────────────────────────────\n// Static analysis of a Handlebars template against a JSON Schema v7\n// describing the available context.\n//\n// Merged architecture (v2):\n// A single AST traversal performs both **validation** and **return type\n// inference** simultaneously. This eliminates duplication between the former\n// `validate*` and `infer*` functions and improves performance by avoiding\n// a double traversal.\n//\n// Context:\n// The analysis context uses a **save/restore** pattern instead of creating\n// new objects on each recursion (`{ ...ctx, current: X }`). This reduces\n// GC pressure for deeply nested templates.\n//\n// ─── Template Identifiers ────────────────────────────────────────────────────\n// The `{{key:N}}` syntax allows referencing a variable from a specific\n// schema, identified by an integer N. The optional `identifierSchemas`\n// parameter provides a mapping `{ [id]: JSONSchema7 }`.\n//\n// Resolution rules:\n// - `{{meetingId}}` → validated against `inputSchema` (standard behavior)\n// - `{{meetingId:1}}` → validated against `identifierSchemas[1]`\n// - `{{meetingId:1}}` without `identifierSchemas[1]` → error\n\n// ─── Internal Types ──────────────────────────────────────────────────────────\n\n/** Context passed recursively during AST traversal */\ninterface AnalysisContext {\n\t/** Root schema (for resolving $refs) */\n\troot: JSONSchema7;\n\t/** Current context schema (changes with #each, #with) — mutated via save/restore */\n\tcurrent: JSONSchema7;\n\t/** Diagnostics accumulator */\n\tdiagnostics: TemplateDiagnostic[];\n\t/** Full template source (for extracting error snippets) */\n\ttemplate: string;\n\t/** Schemas by template identifier (for the {{key:N}} syntax) */\n\tidentifierSchemas?: Record<number, JSONSchema7>;\n\t/** Registered custom helpers (for static analysis) */\n\thelpers?: Map<string, HelperDefinition>;\n\t/**\n\t * Explicit coercion schema provided by the caller.\n\t * When set, static literal values like `\"123\"` will respect the type\n\t * declared in this schema instead of being auto-detected by\n\t * `detectLiteralType`. Unlike the previous `expectedOutputType`,\n\t * this is NEVER derived from the inputSchema — it must be explicitly\n\t * provided via the `coerceSchema` option.\n\t */\n\tcoerceSchema?: JSONSchema7;\n}\n\n// ─── Public API ──────────────────────────────────────────────────────────────\n\n/** Options for the standalone `analyze()` function */\nexport interface AnalyzeOptions {\n\t/** Schemas by template identifier (for the `{{key:N}}` syntax) */\n\tidentifierSchemas?: Record<number, JSONSchema7>;\n\t/**\n\t * Explicit coercion schema. When provided, static literal values\n\t * will respect the types declared in this schema instead of being\n\t * auto-detected by `detectLiteralType`.\n\t *\n\t * This schema is independent from the `inputSchema` (which describes\n\t * available variables) — it only controls the output type inference\n\t * for static content.\n\t */\n\tcoerceSchema?: JSONSchema7;\n\t/**\n\t * When `true`, properties whose values contain Handlebars expressions\n\t * (i.e. any `{{…}}` syntax) are excluded from the output schema.\n\t *\n\t * Only the properties with static values (literals, plain strings\n\t * without expressions) are retained. This is useful when you want\n\t * the output schema to describe only the known, compile-time-constant\n\t * portion of the template.\n\t *\n\t * This option only has an effect on **object** and **array** templates.\n\t * A root-level string template with expressions is analyzed normally\n\t * (there is no parent property to exclude it from).\n\t *\n\t * @default false\n\t */\n\texcludeTemplateExpression?: boolean;\n}\n\n// ─── Coerce Text Value ──────────────────────────────────────────────────────\n\n/**\n * Parses a raw text string into the appropriate JS primitive according to the\n * target JSON Schema type. Used when `coerceSchema` overrides the default\n * `detectLiteralType` inference for static literal values.\n */\nfunction coerceTextValue(\n\ttext: string,\n\ttargetType: \"string\" | \"number\" | \"integer\" | \"boolean\" | \"null\",\n): string | number | boolean | null | undefined {\n\tswitch (targetType) {\n\t\tcase \"number\":\n\t\tcase \"integer\": {\n\t\t\tif (text === \"\") return undefined;\n\t\t\tconst num = Number(text);\n\t\t\tif (Number.isNaN(num)) return undefined;\n\t\t\tif (targetType === \"integer\" && !Number.isInteger(num)) return undefined;\n\t\t\treturn num;\n\t\t}\n\t\tcase \"boolean\": {\n\t\t\tconst lower = text.toLowerCase();\n\t\t\tif (lower === \"true\") return true;\n\t\t\tif (lower === \"false\") return false;\n\t\t\treturn undefined;\n\t\t}\n\t\tcase \"null\":\n\t\t\treturn null;\n\t\tdefault:\n\t\t\treturn text;\n\t}\n}\n\n/**\n * Statically analyzes a template against a JSON Schema v7 describing the\n * available context.\n *\n * Backward-compatible version — parses the template internally.\n * Uses `dispatchAnalyze` for the recursive array/object/literal dispatching,\n * delegating only the string (template) case to `analyzeFromAst`.\n *\n * @param template - The template string (e.g. `\"Hello {{user.name}}\"`)\n * @param inputSchema - JSON Schema v7 describing the available variables\n * @param options - (optional) Analysis options (identifierSchemas, coerceSchema)\n * @returns An `AnalysisResult` containing validity, diagnostics, and the\n * inferred output schema.\n */\nexport function analyze(\n\ttemplate: TemplateInput,\n\tinputSchema: JSONSchema7 = {},\n\toptions?: AnalyzeOptions,\n): AnalysisResult {\n\treturn dispatchAnalyze(\n\t\ttemplate,\n\t\toptions,\n\t\t// String handler — parse and analyze the AST\n\t\t(tpl, coerceSchema) => {\n\t\t\tconst ast = parse(tpl);\n\t\t\treturn analyzeFromAst(ast, tpl, inputSchema, {\n\t\t\t\tidentifierSchemas: options?.identifierSchemas,\n\t\t\t\tcoerceSchema,\n\t\t\t});\n\t\t},\n\t\t// Recursive handler — re-enter analyze() for child elements\n\t\t(child, childOptions) => analyze(child, inputSchema, childOptions),\n\t);\n}\n\n/**\n * Statically analyzes a template from an already-parsed AST.\n *\n * This is the internal function used by `Typebars.compile()` and\n * `CompiledTemplate.analyze()` to avoid costly re-parsing.\n *\n * @param ast - The already-parsed Handlebars AST\n * @param template - The template source (for error snippets)\n * @param inputSchema - JSON Schema v7 describing the available variables\n * @param options - Additional options\n * @returns An `AnalysisResult`\n */\nexport function analyzeFromAst(\n\tast: hbs.AST.Program,\n\ttemplate: string,\n\tinputSchema: JSONSchema7 = {},\n\toptions?: {\n\t\tidentifierSchemas?: Record<number, JSONSchema7>;\n\t\thelpers?: Map<string, HelperDefinition>;\n\t\t/**\n\t\t * Explicit coercion schema. When set, static literal values will\n\t\t * respect the types declared in this schema instead of auto-detecting.\n\t\t * Unlike `expectedOutputType`, this is NEVER derived from inputSchema.\n\t\t */\n\t\tcoerceSchema?: JSONSchema7;\n\t},\n): AnalysisResult {\n\t// ── Initialize the diagnostic context FIRST ────────────────────────\n\tconst ctx: AnalysisContext = {\n\t\troot: inputSchema,\n\t\tcurrent: inputSchema,\n\t\tdiagnostics: [],\n\t\ttemplate,\n\t\tidentifierSchemas: options?.identifierSchemas,\n\t\thelpers: options?.helpers,\n\t\tcoerceSchema: options?.coerceSchema,\n\t};\n\n\t// ── Detect unsupported schema features as diagnostics ──────────────\n\t// Conditional schemas (if/then/else) are non-resolvable without runtime\n\t// data. Instead of throwing, we collect structured diagnostics so the\n\t// caller receives a standard AnalysisResult.\n\tconst conditionalLocations = findConditionalSchemaLocations(inputSchema);\n\tfor (const loc of conditionalLocations) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNSUPPORTED_SCHEMA\",\n\t\t\t\"error\",\n\t\t\t`Unsupported JSON Schema feature: \"${loc.keyword}\" at \"${loc.schemaPath}\". ` +\n\t\t\t\t\"Conditional schemas (if/then/else) cannot be resolved during static analysis \" +\n\t\t\t\t\"because they depend on runtime data. Consider using oneOf/anyOf combinators instead.\",\n\t\t\tundefined,\n\t\t\t{ path: loc.schemaPath },\n\t\t);\n\t}\n\n\tif (options?.identifierSchemas) {\n\t\tfor (const [id, idSchema] of Object.entries(options.identifierSchemas)) {\n\t\t\tconst idLocations = findConditionalSchemaLocations(\n\t\t\t\tidSchema,\n\t\t\t\t`/identifierSchemas/${id}`,\n\t\t\t);\n\t\t\tfor (const loc of idLocations) {\n\t\t\t\taddDiagnostic(\n\t\t\t\t\tctx,\n\t\t\t\t\t\"UNSUPPORTED_SCHEMA\",\n\t\t\t\t\t\"error\",\n\t\t\t\t\t`Unsupported JSON Schema feature: \"${loc.keyword}\" at \"${loc.schemaPath}\". ` +\n\t\t\t\t\t\t\"Conditional schemas (if/then/else) cannot be resolved during static analysis \" +\n\t\t\t\t\t\t\"because they depend on runtime data. Consider using oneOf/anyOf combinators instead.\",\n\t\t\t\t\tundefined,\n\t\t\t\t\t{ path: loc.schemaPath },\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t}\n\n\t// If unsupported schemas were found, return early with valid: false\n\tif (ctx.diagnostics.length > 0) {\n\t\treturn {\n\t\t\tvalid: false,\n\t\t\tdiagnostics: ctx.diagnostics,\n\t\t\toutputSchema: {},\n\t\t};\n\t}\n\n\t// Single pass: type inference + validation in one traversal.\n\tconst outputSchema = inferProgramType(ast, ctx);\n\n\tconst hasErrors = ctx.diagnostics.some((d) => d.severity === \"error\");\n\n\treturn {\n\t\tvalid: !hasErrors,\n\t\tdiagnostics: ctx.diagnostics,\n\t\toutputSchema: simplifySchema(outputSchema),\n\t};\n}\n\n// ─── Unified AST Traversal ───────────────────────────────────────────────────\n// A single set of functions handles both validation (emitting diagnostics)\n// and type inference (returning a JSONSchema7).\n//\n// Main functions:\n// - `inferProgramType` — entry point for a Program (template body or block)\n// - `processStatement` — dispatches a statement (validation side-effects)\n// - `processMustache` — handles a MustacheStatement (expression or inline helper)\n// - `inferBlockType` — handles a BlockStatement (if, each, with, custom…)\n\n/**\n * Dispatches the processing of an individual statement.\n *\n * Called by `inferProgramType` in the \"mixed template\" case to validate\n * each statement while ignoring the returned type (the result is always\n * `string` for a mixed template).\n *\n * @returns The inferred schema for this statement, or `undefined` for\n * statements with no semantics (ContentStatement, CommentStatement).\n */\nfunction processStatement(\n\tstmt: hbs.AST.Statement,\n\tctx: AnalysisContext,\n): JSONSchema7 | undefined {\n\tswitch (stmt.type) {\n\t\tcase \"ContentStatement\":\n\t\tcase \"CommentStatement\":\n\t\t\t// Static text or comment — nothing to validate, no type to infer\n\t\t\treturn undefined;\n\n\t\tcase \"MustacheStatement\":\n\t\t\treturn processMustache(stmt as hbs.AST.MustacheStatement, ctx);\n\n\t\tcase \"BlockStatement\":\n\t\t\treturn inferBlockType(stmt as hbs.AST.BlockStatement, ctx);\n\n\t\tdefault:\n\t\t\t// Unrecognized AST node — emit a warning rather than an error\n\t\t\t// to avoid blocking on future Handlebars extensions.\n\t\t\taddDiagnostic(\n\t\t\t\tctx,\n\t\t\t\t\"UNANALYZABLE\",\n\t\t\t\t\"warning\",\n\t\t\t\t`Unsupported AST node type: \"${stmt.type}\"`,\n\t\t\t\tstmt,\n\t\t\t);\n\t\t\treturn undefined;\n\t}\n}\n\n/**\n * Processes a MustacheStatement `{{expression}}` or `{{helper arg}}`.\n *\n * Distinguishes two cases:\n * 1. **Simple expression** (`{{name}}`, `{{user.age}}`) — resolution in the schema\n * 2. **Inline helper** (`{{uppercase name}}`) — params > 0 or hash present\n *\n * @returns The inferred schema for this expression\n */\nfunction processMustache(\n\tstmt: hbs.AST.MustacheStatement,\n\tctx: AnalysisContext,\n): JSONSchema7 {\n\t// Sub-expressions (nested helpers) are not supported for static\n\t// analysis — emit a warning.\n\tif (stmt.path.type === \"SubExpression\") {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNANALYZABLE\",\n\t\t\t\"warning\",\n\t\t\t\"Sub-expressions are not statically analyzable\",\n\t\t\tstmt,\n\t\t);\n\t\treturn {};\n\t}\n\n\t// ── Inline helper detection ──────────────────────────────────────────────\n\t// If the MustacheStatement has parameters or a hash, it's a helper call\n\t// (e.g. `{{uppercase name}}`), not a simple expression.\n\tif (stmt.params.length > 0 || stmt.hash) {\n\t\tconst helperName = getExpressionName(stmt.path);\n\n\t\t// ── Special-case: map helper ─────────────────────────────────────\n\t\t// The `map` helper requires deep static analysis that the generic\n\t\t// helper path cannot perform: it must resolve the first argument as\n\t\t// an array-of-objects schema, then resolve the second argument (a\n\t\t// property name) within the item schema to infer the output type\n\t\t// `{ type: \"array\", items: <property schema> }`.\n\t\tif (helperName === MapHelpers.MAP_HELPER_NAME) {\n\t\t\treturn processMapHelper(stmt, ctx);\n\t\t}\n\n\t\t// ── Special-case: default helper ─────────────────────────────────\n\t\t// The `default` helper requires deep static analysis: the return\n\t\t// type is the union of all argument types, and the chain must\n\t\t// terminate with a guaranteed (non-optional) value.\n\t\tif (helperName === DefaultHelpers.DEFAULT_HELPER_NAME) {\n\t\t\treturn processDefaultHelper(stmt, ctx);\n\t\t}\n\n\t\t// Check if the helper is registered\n\t\tconst helper = ctx.helpers?.get(helperName);\n\t\tif (helper) {\n\t\t\tconst helperParams = helper.params;\n\n\t\t\t// ── Check the number of required parameters ──────────────\n\t\t\tif (helperParams) {\n\t\t\t\tconst requiredCount = helperParams.filter((p) => !p.optional).length;\n\t\t\t\tif (stmt.params.length < requiredCount) {\n\t\t\t\t\taddDiagnostic(\n\t\t\t\t\t\tctx,\n\t\t\t\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\t\t\t\"error\",\n\t\t\t\t\t\t`Helper \"${helperName}\" expects at least ${requiredCount} argument(s), but got ${stmt.params.length}`,\n\t\t\t\t\t\tstmt,\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\thelperName,\n\t\t\t\t\t\t\texpected: `${requiredCount} argument(s)`,\n\t\t\t\t\t\t\tactual: `${stmt.params.length} argument(s)`,\n\t\t\t\t\t\t},\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// ── Validate each parameter (existence + type) ───────────────\n\t\t\tfor (let i = 0; i < stmt.params.length; i++) {\n\t\t\t\tconst resolvedSchema = resolveExpressionWithDiagnostics(\n\t\t\t\t\tstmt.params[i] as hbs.AST.Expression,\n\t\t\t\t\tctx,\n\t\t\t\t\tstmt,\n\t\t\t\t);\n\n\t\t\t\t// Check type compatibility if the helper declares the\n\t\t\t\t// expected type for this parameter\n\t\t\t\tconst helperParam = helperParams?.[i];\n\t\t\t\tif (resolvedSchema && helperParam?.type) {\n\t\t\t\t\tconst expectedType = helperParam.type;\n\t\t\t\t\tif (!isParamTypeCompatible(resolvedSchema, expectedType)) {\n\t\t\t\t\t\tconst paramName = helperParam.name;\n\t\t\t\t\t\taddDiagnostic(\n\t\t\t\t\t\t\tctx,\n\t\t\t\t\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\t\t\t\t\"error\",\n\t\t\t\t\t\t\t`Helper \"${helperName}\" parameter \"${paramName}\" expects ${schemaTypeLabel(expectedType)}, but got ${schemaTypeLabel(resolvedSchema)}`,\n\t\t\t\t\t\t\tstmt,\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\thelperName,\n\t\t\t\t\t\t\t\texpected: schemaTypeLabel(expectedType),\n\t\t\t\t\t\t\t\tactual: schemaTypeLabel(resolvedSchema),\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn helper.returnType ?? { type: \"string\" };\n\t\t}\n\n\t\t// Unknown inline helper — warning\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_HELPER\",\n\t\t\t\"warning\",\n\t\t\t`Unknown inline helper \"${helperName}\" — cannot analyze statically`,\n\t\t\tstmt,\n\t\t\t{ helperName },\n\t\t);\n\t\treturn { type: \"string\" };\n\t}\n\n\t// ── Simple expression ────────────────────────────────────────────────────\n\tconst resolved = resolveExpressionWithDiagnostics(stmt.path, ctx, stmt) ?? {};\n\n\t// When the expression points to an optional property (not in `required`),\n\t// the output can be null at runtime. Wrap the resolved schema with null\n\t// so the output schema accurately reflects this.\n\t// $root returns the entire context — optionality does not apply.\n\tif (stmt.path.type === \"PathExpression\") {\n\t\tconst segments = extractPathSegments(stmt.path);\n\t\tif (segments.length > 0) {\n\t\t\tconst { cleanSegments, identifier } =\n\t\t\t\textractExpressionIdentifier(segments);\n\t\t\tif (!isRootSegments(cleanSegments)) {\n\t\t\t\tlet targetSchema =\n\t\t\t\t\tidentifier !== null\n\t\t\t\t\t\t? ctx.identifierSchemas?.[identifier]\n\t\t\t\t\t\t: ctx.current;\n\t\t\t\t// For aggregated identifiers (array schema), check optionality\n\t\t\t\t// within the items schema, not the array itself.\n\t\t\t\tif (targetSchema && identifier !== null) {\n\t\t\t\t\tconst itemSchema = resolveArrayItems(targetSchema, ctx.root);\n\t\t\t\t\tif (itemSchema !== undefined) {\n\t\t\t\t\t\ttargetSchema = itemSchema;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (targetSchema && !isPathFullyRequired(targetSchema, cleanSegments)) {\n\t\t\t\t\treturn withNullType(resolved);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn resolved;\n}\n\n// ─── map helper — special-case analysis ──────────────────────────────────────\n// Validates the arguments and infers the precise return type:\n// {{ map <arrayPath> <propertyName> }}\n// → { type: \"array\", items: <schema of the property in the item> }\n//\n// Validation rules:\n// 1. Exactly 2 arguments are required\n// 2. The first argument must resolve to an array schema\n// 3. The array items must be an object schema\n// 4. The second argument must be a string literal (property name)\n// 5. The property must exist in the item schema\n\nfunction processMapHelper(\n\tstmt: hbs.AST.MustacheStatement,\n\tctx: AnalysisContext,\n): JSONSchema7 {\n\tconst helperName = MapHelpers.MAP_HELPER_NAME;\n\n\t// ── 1. Check argument count ──────────────────────────────────────────\n\tif (stmt.params.length < 2) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" expects at least 2 argument(s), but got ${stmt.params.length}`,\n\t\t\tstmt,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"2 argument(s)\",\n\t\t\t\tactual: `${stmt.params.length} argument(s)`,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 2. Resolve the first argument (collection path) ──────────────────\n\tconst collectionExpr = stmt.params[0] as hbs.AST.Expression;\n\tconst collectionSchema = resolveExpressionWithDiagnostics(\n\t\tcollectionExpr,\n\t\tctx,\n\t\tstmt,\n\t);\n\n\tif (!collectionSchema) {\n\t\t// Path resolution failed — diagnostic already emitted\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 3. Validate that the collection is an array ──────────────────────\n\tconst itemSchema = resolveArrayItems(collectionSchema, ctx.root);\n\tif (!itemSchema) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" parameter \"collection\" expects an array, but got ${schemaTypeLabel(collectionSchema)}`,\n\t\t\tstmt,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"array\",\n\t\t\t\tactual: schemaTypeLabel(collectionSchema),\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 4. Validate that the items are objects ───────────────────────────\n\t// If the items are arrays (e.g. from a nested map), flatten one level\n\t// to match the runtime `flat(1)` behavior and use the inner items instead.\n\tlet effectiveItemSchema = itemSchema;\n\tconst itemType = effectiveItemSchema.type;\n\tif (\n\t\titemType === \"array\" ||\n\t\t(Array.isArray(itemType) && itemType.includes(\"array\"))\n\t) {\n\t\tconst innerItems = resolveArrayItems(effectiveItemSchema, ctx.root);\n\t\tif (innerItems) {\n\t\t\teffectiveItemSchema = innerItems;\n\t\t\t// Emit an informational warning so consumers know the flatten happened\n\t\t\taddDiagnostic(\n\t\t\t\tctx,\n\t\t\t\t\"MAP_IMPLICIT_FLATTEN\",\n\t\t\t\t\"warning\",\n\t\t\t\t`The \"${helperName}\" helper will automatically flatten the input array one level before mapping. ` +\n\t\t\t\t\t`The item type \"${Array.isArray(itemType) ? itemType.join(\" | \") : itemType}\" was unwrapped to its inner items schema.`,\n\t\t\t\tstmt,\n\t\t\t\t{\n\t\t\t\t\thelperName,\n\t\t\t\t\texpected: \"object\",\n\t\t\t\t\tactual: schemaTypeLabel(effectiveItemSchema),\n\t\t\t\t},\n\t\t\t);\n\t\t}\n\t}\n\n\tconst effectiveItemType = effectiveItemSchema.type;\n\tconst isObject =\n\t\teffectiveItemType === \"object\" ||\n\t\t(Array.isArray(effectiveItemType) &&\n\t\t\teffectiveItemType.includes(\"object\")) ||\n\t\t// If no type but has properties, treat as object\n\t\t(!effectiveItemType && effectiveItemSchema.properties !== undefined);\n\n\tif (!isObject && effectiveItemType !== undefined) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" expects an array of objects, but the array items have type \"${schemaTypeLabel(effectiveItemSchema)}\"`,\n\t\t\tstmt,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"object\",\n\t\t\t\tactual: schemaTypeLabel(effectiveItemSchema),\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 5. Validate the second argument (property name) ──────────────────\n\tconst propertyExpr = stmt.params[1] as hbs.AST.Expression;\n\n\t// The property name MUST be a StringLiteral (quoted string like `\"name\"`).\n\t// A bare identifier like `name` is parsed by Handlebars as a PathExpression,\n\t// which would be resolved as a data path at runtime — yielding `undefined`\n\t// when the identifier doesn't exist in the top-level context. This is a\n\t// common mistake, so we provide a clear error message guiding the user.\n\tlet propertyName: string | undefined;\n\n\tif (propertyExpr.type === \"PathExpression\") {\n\t\tconst bare = (propertyExpr as hbs.AST.PathExpression).original;\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" parameter \"property\" must be a quoted string. ` +\n\t\t\t\t`Use {{ ${helperName} … \"${bare}\" }} instead of {{ ${helperName} … ${bare} }}`,\n\t\t\tstmt,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: 'StringLiteral (e.g. \"property\")',\n\t\t\t\tactual: `PathExpression (${bare})`,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\tif (propertyExpr.type === \"StringLiteral\") {\n\t\tpropertyName = (propertyExpr as hbs.AST.StringLiteral).value;\n\t}\n\n\tif (!propertyName) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" parameter \"property\" expects a quoted string literal, but got ${propertyExpr.type}`,\n\t\t\tstmt,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: 'StringLiteral (e.g. \"property\")',\n\t\t\t\tactual: propertyExpr.type,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 6. Resolve the property within the item schema ───────────────────\n\tconst propertySchema = resolveSchemaPath(effectiveItemSchema, [propertyName]);\n\tif (!propertySchema) {\n\t\tconst availableProperties = getSchemaPropertyNames(effectiveItemSchema);\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_PROPERTY\",\n\t\t\t\"error\",\n\t\t\tcreatePropertyNotFoundMessage(propertyName, availableProperties),\n\t\t\tstmt,\n\t\t\t{\n\t\t\t\tpath: propertyName,\n\t\t\t\tavailableProperties,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 7. Return the inferred output schema ─────────────────────────────\n\treturn { type: \"array\", items: propertySchema };\n}\n\n// ─── default helper — special-case analysis ──────────────────────────────────\n// Validates the arguments and infers the return type as the union of all\n// argument types. The chain must terminate with a guaranteed value.\n//\n// Validation rules:\n// 1. At least 2 arguments are required\n// 2. All arguments must be type-compatible\n// 3. The chain must end with a guaranteed value (literal, required property,\n// or sub-expression)\n\n/**\n * Analyzes a `default` helper MustacheStatement and returns the inferred\n * output schema. Shared logic with `processDefaultSubExpression`.\n */\nfunction processDefaultHelper(\n\tstmt: hbs.AST.MustacheStatement,\n\tctx: AnalysisContext,\n): JSONSchema7 {\n\treturn analyzeDefaultArgs(stmt.params as hbs.AST.Expression[], ctx, stmt);\n}\n\n/**\n * Analyzes a `default` helper SubExpression and returns the inferred\n * output schema.\n */\nfunction processDefaultSubExpression(\n\texpr: hbs.AST.SubExpression,\n\tctx: AnalysisContext,\n\tparentNode?: hbs.AST.Node,\n): JSONSchema7 {\n\treturn analyzeDefaultArgs(\n\t\texpr.params as hbs.AST.Expression[],\n\t\tctx,\n\t\tparentNode ?? expr,\n\t);\n}\n\n/**\n * Core analysis logic for the `default` helper (shared by Mustache and\n * SubExpression paths).\n *\n * 1. Validates argument count (≥ 2)\n * 2. Resolves the schema of each argument\n * 3. Checks type compatibility between all arguments\n * 4. Verifies that at least one argument is guaranteed (non-optional)\n * 5. Returns the simplified union of all argument types\n */\nfunction analyzeDefaultArgs(\n\tparams: hbs.AST.Expression[],\n\tctx: AnalysisContext,\n\tnode: hbs.AST.Node,\n): JSONSchema7 {\n\tconst helperName = DefaultHelpers.DEFAULT_HELPER_NAME;\n\n\t// ── 1. Check argument count ──────────────────────────────────────────\n\tif (params.length < 2) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" expects at least 2 argument(s), but got ${params.length}`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"2 argument(s)\",\n\t\t\t\tactual: `${params.length} argument(s)`,\n\t\t\t},\n\t\t);\n\t\treturn {};\n\t}\n\n\t// ── 2. Resolve the schema of each argument ───────────────────────────\n\tconst resolvedSchemas: JSONSchema7[] = [];\n\tlet hasGuaranteedValue = false;\n\n\tfor (let i = 0; i < params.length; i++) {\n\t\tconst param = params[i] as hbs.AST.Expression;\n\t\tconst resolvedSchema = resolveExpressionWithDiagnostics(param, ctx, node);\n\n\t\tif (resolvedSchema) {\n\t\t\tresolvedSchemas.push(resolvedSchema);\n\t\t}\n\n\t\t// ── 3. Check if this argument is guaranteed ──────────────────────\n\t\tif (isGuaranteedExpression(param, ctx)) {\n\t\t\thasGuaranteedValue = true;\n\t\t}\n\t}\n\n\t// ── 4. Check type compatibility between all arguments ────────────────\n\t// All arguments must be compatible with each other. We compare each\n\t// pair of resolved schemas (only those with type info).\n\tif (resolvedSchemas.length >= 2) {\n\t\tconst firstWithType = resolvedSchemas.find((s) => s.type);\n\t\tif (firstWithType) {\n\t\t\tfor (let i = 0; i < resolvedSchemas.length; i++) {\n\t\t\t\tconst schema = resolvedSchemas[i] as JSONSchema7;\n\t\t\t\tif (schema.type && !isParamTypeCompatible(schema, firstWithType)) {\n\t\t\t\t\taddDiagnostic(\n\t\t\t\t\t\tctx,\n\t\t\t\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\t\t\t\"error\",\n\t\t\t\t\t\t`Helper \"${helperName}\" argument ${i + 1} has type ${schemaTypeLabel(schema)}, incompatible with ${schemaTypeLabel(firstWithType)}`,\n\t\t\t\t\t\tnode,\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\thelperName,\n\t\t\t\t\t\t\texpected: schemaTypeLabel(firstWithType),\n\t\t\t\t\t\t\tactual: schemaTypeLabel(schema),\n\t\t\t\t\t\t},\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// ── 5. Verify the chain terminates with a guaranteed value ───────────\n\tif (!hasGuaranteedValue) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"DEFAULT_NO_GUARANTEED_VALUE\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" argument chain has no guaranteed fallback — ` +\n\t\t\t\t\"the last argument must be a literal or a non-optional property\",\n\t\t\tnode,\n\t\t\t{ helperName },\n\t\t);\n\t}\n\n\t// ── 6. Return the union of all argument types ────────────────────────\n\tif (resolvedSchemas.length === 0) return {};\n\tif (resolvedSchemas.length === 1) return resolvedSchemas[0] as JSONSchema7;\n\n\treturn simplifySchema({ oneOf: resolvedSchemas });\n}\n\n/**\n * Determines whether a template expression is **guaranteed** to produce a\n * non-nullish value at runtime.\n *\n * An expression is guaranteed when:\n * - It is a literal (StringLiteral, NumberLiteral, BooleanLiteral)\n * - It is a SubExpression (helpers always return a value)\n * - It is a PathExpression pointing to a **required** property in the schema\n */\nfunction isGuaranteedExpression(\n\texpr: hbs.AST.Expression,\n\tctx: AnalysisContext,\n): boolean {\n\t// Literals are always guaranteed\n\tif (\n\t\texpr.type === \"StringLiteral\" ||\n\t\texpr.type === \"NumberLiteral\" ||\n\t\texpr.type === \"BooleanLiteral\"\n\t) {\n\t\treturn true;\n\t}\n\n\t// Sub-expressions (helper calls) are considered guaranteed\n\tif (expr.type === \"SubExpression\") {\n\t\treturn true;\n\t}\n\n\t// PathExpression: check if the property is required in the schema\n\tif (expr.type === \"PathExpression\") {\n\t\tconst segments = extractPathSegments(expr);\n\t\tif (segments.length === 0) return false;\n\n\t\tconst { cleanSegments } = extractExpressionIdentifier(segments);\n\t\treturn isPropertyRequired(ctx.current, cleanSegments);\n\t}\n\n\treturn false;\n}\n\n/**\n * Checks whether a resolved type is compatible with the type expected\n * by a helper parameter.\n *\n * Compatibility rules:\n * - If either schema has no `type`, validation is not possible → compatible\n * - `integer` is compatible with `number` (integer ⊂ number)\n * - For multiple types (e.g. `[\"string\", \"number\"]`), at least one resolved\n * type must match one expected type\n */\nfunction isParamTypeCompatible(\n\tresolved: JSONSchema7,\n\texpected: JSONSchema7,\n): boolean {\n\t// If either has no type info, we cannot validate\n\tif (!expected.type || !resolved.type) return true;\n\n\tconst expectedTypes = Array.isArray(expected.type)\n\t\t? expected.type\n\t\t: [expected.type];\n\tconst resolvedTypes = Array.isArray(resolved.type)\n\t\t? resolved.type\n\t\t: [resolved.type];\n\n\t// At least one resolved type must be compatible with one expected type\n\treturn resolvedTypes.some((rt) =>\n\t\texpectedTypes.some(\n\t\t\t(et) =>\n\t\t\t\trt === et ||\n\t\t\t\t// integer is a subtype of number\n\t\t\t\t(et === \"number\" && rt === \"integer\") ||\n\t\t\t\t(et === \"integer\" && rt === \"number\"),\n\t\t),\n\t);\n}\n\n/**\n * Infers the output type of a `Program` (template body or block body).\n *\n * Handles 4 cases, from most specific to most general:\n *\n * 1. **Single expression** `{{expr}}` → type of the expression\n * 2. **Single block** `{{#if}}…{{/if}}` → type of the block\n * 3. **Pure text content** → literal detection (number, boolean, null)\n * 4. **Mixed template** → always `string` (concatenation)\n *\n * Validation is performed alongside inference: each expression and block\n * is validated during processing.\n */\nfunction inferProgramType(\n\tprogram: hbs.AST.Program,\n\tctx: AnalysisContext,\n): JSONSchema7 {\n\tconst effective = getEffectiveBody(program);\n\n\t// No significant statements → empty string\n\tif (effective.length === 0) {\n\t\treturn { type: \"string\" };\n\t}\n\n\t// ── Case 1: single expression {{expr}} ─────────────────────────────────\n\tconst singleExpr = getEffectivelySingleExpression(program);\n\tif (singleExpr) {\n\t\treturn processMustache(singleExpr, ctx);\n\t}\n\n\t// ── Case 2: single block {{#if}}, {{#each}}, {{#with}}, … ──────────────\n\tconst singleBlock = getEffectivelySingleBlock(program);\n\tif (singleBlock) {\n\t\treturn inferBlockType(singleBlock, ctx);\n\t}\n\n\t// ── Case 3: only ContentStatements (no expressions) ────────────────────\n\t// If the concatenated (trimmed) text is a typed literal (number, boolean,\n\t// null), we infer the corresponding type.\n\tconst allContent = effective.every((s) => s.type === \"ContentStatement\");\n\tif (allContent) {\n\t\tconst text = effective\n\t\t\t.map((s) => (s as hbs.AST.ContentStatement).value)\n\t\t\t.join(\"\")\n\t\t\t.trim();\n\n\t\tif (text === \"\") return { type: \"string\" };\n\n\t\t// If an explicit coerceSchema was provided and declares a specific\n\t\t// primitive type, respect it instead of auto-detecting. For example,\n\t\t// \"123\" with coerceSchema `{ type: \"string\" }` should stay \"string\".\n\t\t// This only applies when coerceSchema is explicitly set — the\n\t\t// inputSchema is NEVER used for coercion.\n\t\t//\n\t\t// Only the **type** is extracted from coerceSchema. Value-level\n\t\t// constraints (enum, const, format, pattern, minLength, …) are NOT\n\t\t// propagated because they describe what the *consumer* accepts, not\n\t\t// what the literal *produces*. The actual literal value is set as\n\t\t// `const` so downstream compatibility checkers can detect mismatches.\n\t\tconst coercedType = ctx.coerceSchema?.type;\n\t\tif (\n\t\t\ttypeof coercedType === \"string\" &&\n\t\t\t(coercedType === \"string\" ||\n\t\t\t\tcoercedType === \"number\" ||\n\t\t\t\tcoercedType === \"integer\" ||\n\t\t\t\tcoercedType === \"boolean\" ||\n\t\t\t\tcoercedType === \"null\")\n\t\t) {\n\t\t\tconst coercedValue = coerceTextValue(text, coercedType);\n\t\t\treturn { type: coercedType, const: coercedValue } as JSONSchema7;\n\t\t}\n\n\t\tconst literalType = detectLiteralType(text);\n\t\tif (literalType) return { type: literalType };\n\t}\n\n\t// ── Case 4: multiple blocks only (no significant text between them) ────\n\t// When the effective body consists entirely of BlockStatements, gather\n\t// each block's inferred type and combine them via oneOf. This handles\n\t// templates like:\n\t// {{#if showName}}{{name}}{{/if}}\n\t// {{#if showAge}}{{age}}{{/if}}\n\t// where the output could be string OR number depending on which branch\n\t// is active.\n\tconst allBlocks = effective.every((s) => s.type === \"BlockStatement\");\n\tif (allBlocks) {\n\t\tconst types: JSONSchema7[] = [];\n\t\tfor (const stmt of effective) {\n\t\t\tconst t = inferBlockType(stmt as hbs.AST.BlockStatement, ctx);\n\t\t\tif (t) types.push(t);\n\t\t}\n\t\tif (types.length === 1) return types[0] as JSONSchema7;\n\t\tif (types.length > 1) return simplifySchema({ oneOf: types });\n\t\treturn { type: \"string\" };\n\t}\n\n\t// ── Case 5: mixed template (text + expressions, blocks…) ───────────────\n\t// Traverse all statements for validation (side-effects: diagnostics).\n\t// The result is always string (concatenation).\n\tfor (const stmt of program.body) {\n\t\tprocessStatement(stmt, ctx);\n\t}\n\treturn { type: \"string\" };\n}\n\n/**\n * Infers the output type of a BlockStatement and validates its content.\n *\n * Supports built-in helpers (`if`, `unless`, `each`, `with`) and custom\n * helpers registered via `Typebars.registerHelper()`.\n *\n * Uses the **save/restore** pattern for context: instead of creating a new\n * object `{ ...ctx, current: X }` on each recursion, we save `ctx.current`,\n * mutate it, process the body, then restore. This reduces GC pressure for\n * deeply nested templates.\n */\nfunction inferBlockType(\n\tstmt: hbs.AST.BlockStatement,\n\tctx: AnalysisContext,\n): JSONSchema7 {\n\tconst helperName = getBlockHelperName(stmt);\n\n\tswitch (helperName) {\n\t\t// ── if / unless ──────────────────────────────────────────────────────\n\t\t// Validate the condition argument, then infer types from both branches.\n\t\tcase \"if\":\n\t\tcase \"unless\": {\n\t\t\tconst arg = getBlockArgument(stmt);\n\t\t\tif (arg) {\n\t\t\t\tresolveExpressionWithDiagnostics(arg, ctx, stmt);\n\t\t\t} else {\n\t\t\t\taddDiagnostic(\n\t\t\t\t\tctx,\n\t\t\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\t\t\"error\",\n\t\t\t\t\tcreateMissingArgumentMessage(helperName),\n\t\t\t\t\tstmt,\n\t\t\t\t\t{ helperName },\n\t\t\t\t);\n\t\t\t}\n\n\t\t\t// Infer the type of the \"then\" branch\n\t\t\tconst thenType = inferProgramType(stmt.program, ctx);\n\n\t\t\tif (stmt.inverse) {\n\t\t\t\tconst elseType = inferProgramType(stmt.inverse, ctx);\n\t\t\t\t// If both branches have the same type → single type\n\t\t\t\tif (deepEqual(thenType, elseType)) return thenType;\n\t\t\t\t// Otherwise → union of both types\n\t\t\t\treturn simplifySchema({ oneOf: [thenType, elseType] });\n\t\t\t}\n\n\t\t\t// No else branch → the result is the type of the then branch\n\t\t\t// (conceptually optional, but Handlebars returns \"\" for falsy)\n\t\t\treturn thenType;\n\t\t}\n\n\t\t// ── each ─────────────────────────────────────────────────────────────\n\t\t// Resolve the collection schema, then validate the body with the item\n\t\t// schema as the new context.\n\t\tcase \"each\": {\n\t\t\tconst arg = getBlockArgument(stmt);\n\t\t\tif (!arg) {\n\t\t\t\taddDiagnostic(\n\t\t\t\t\tctx,\n\t\t\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\t\t\"error\",\n\t\t\t\t\tcreateMissingArgumentMessage(\"each\"),\n\t\t\t\t\tstmt,\n\t\t\t\t\t{ helperName: \"each\" },\n\t\t\t\t);\n\t\t\t\t// Validate the body with an empty context (best-effort)\n\t\t\t\tconst saved = ctx.current;\n\t\t\t\tctx.current = {};\n\t\t\t\tinferProgramType(stmt.program, ctx);\n\t\t\t\tctx.current = saved;\n\t\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\t\t\t\treturn { type: \"string\" };\n\t\t\t}\n\n\t\t\tconst collectionSchema = resolveExpressionWithDiagnostics(arg, ctx, stmt);\n\t\t\tif (!collectionSchema) {\n\t\t\t\t// The path could not be resolved — diagnostic already emitted.\n\t\t\t\tconst saved = ctx.current;\n\t\t\t\tctx.current = {};\n\t\t\t\tinferProgramType(stmt.program, ctx);\n\t\t\t\tctx.current = saved;\n\t\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\t\t\t\treturn { type: \"string\" };\n\t\t\t}\n\n\t\t\t// Resolve the schema of the array elements\n\t\t\tconst itemSchema = resolveArrayItems(collectionSchema, ctx.root);\n\t\t\tif (!itemSchema) {\n\t\t\t\taddDiagnostic(\n\t\t\t\t\tctx,\n\t\t\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\t\t\"error\",\n\t\t\t\t\tcreateTypeMismatchMessage(\n\t\t\t\t\t\t\"each\",\n\t\t\t\t\t\t\"an array\",\n\t\t\t\t\t\tschemaTypeLabel(collectionSchema),\n\t\t\t\t\t),\n\t\t\t\t\tstmt,\n\t\t\t\t\t{\n\t\t\t\t\t\thelperName: \"each\",\n\t\t\t\t\t\texpected: \"array\",\n\t\t\t\t\t\tactual: schemaTypeLabel(collectionSchema),\n\t\t\t\t\t},\n\t\t\t\t);\n\t\t\t\t// Validate the body with an empty context (best-effort)\n\t\t\t\tconst saved = ctx.current;\n\t\t\t\tctx.current = {};\n\t\t\t\tinferProgramType(stmt.program, ctx);\n\t\t\t\tctx.current = saved;\n\t\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\t\t\t\treturn { type: \"string\" };\n\t\t\t}\n\n\t\t\t// Validate the body with the item schema as the new context\n\t\t\tconst saved = ctx.current;\n\t\t\tctx.current = itemSchema;\n\t\t\tinferProgramType(stmt.program, ctx);\n\t\t\tctx.current = saved;\n\n\t\t\t// The inverse branch ({{else}}) keeps the parent context\n\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\n\t\t\t// An each concatenates renders → always string\n\t\t\treturn { type: \"string\" };\n\t\t}\n\n\t\t// ── with ─────────────────────────────────────────────────────────────\n\t\t// Resolve the inner schema, then validate the body with it as the\n\t\t// new context.\n\t\tcase \"with\": {\n\t\t\tconst arg = getBlockArgument(stmt);\n\t\t\tif (!arg) {\n\t\t\t\taddDiagnostic(\n\t\t\t\t\tctx,\n\t\t\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\t\t\"error\",\n\t\t\t\t\tcreateMissingArgumentMessage(\"with\"),\n\t\t\t\t\tstmt,\n\t\t\t\t\t{ helperName: \"with\" },\n\t\t\t\t);\n\t\t\t\t// Validate the body with an empty context\n\t\t\t\tconst saved = ctx.current;\n\t\t\t\tctx.current = {};\n\t\t\t\tconst result = inferProgramType(stmt.program, ctx);\n\t\t\t\tctx.current = saved;\n\t\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\t\t\t\treturn result;\n\t\t\t}\n\n\t\t\tconst innerSchema = resolveExpressionWithDiagnostics(arg, ctx, stmt);\n\n\t\t\tconst saved = ctx.current;\n\t\t\tctx.current = innerSchema ?? {};\n\t\t\tconst result = inferProgramType(stmt.program, ctx);\n\t\t\tctx.current = saved;\n\n\t\t\t// The inverse branch keeps the parent context\n\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\n\t\t\treturn result;\n\t\t}\n\n\t\t// ── Custom or unknown helper ─────────────────────────────────────────\n\t\tdefault: {\n\t\t\tconst helper = ctx.helpers?.get(helperName);\n\t\t\tif (helper) {\n\t\t\t\t// Registered custom helper — validate parameters\n\t\t\t\tfor (const param of stmt.params) {\n\t\t\t\t\tresolveExpressionWithDiagnostics(\n\t\t\t\t\t\tparam as hbs.AST.Expression,\n\t\t\t\t\t\tctx,\n\t\t\t\t\t\tstmt,\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\t// Validate the body with the current context\n\t\t\t\tinferProgramType(stmt.program, ctx);\n\t\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\t\t\t\treturn helper.returnType ?? { type: \"string\" };\n\t\t\t}\n\n\t\t\t// Unknown helper — warning\n\t\t\taddDiagnostic(\n\t\t\t\tctx,\n\t\t\t\t\"UNKNOWN_HELPER\",\n\t\t\t\t\"warning\",\n\t\t\t\tcreateUnknownHelperMessage(helperName),\n\t\t\t\tstmt,\n\t\t\t\t{ helperName },\n\t\t\t);\n\t\t\t// Still validate the body with the current context (best-effort)\n\t\t\tinferProgramType(stmt.program, ctx);\n\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\t\t\treturn { type: \"string\" };\n\t\t}\n\t}\n}\n\n// ─── Expression Resolution ───────────────────────────────────────────────────\n\n/**\n * Resolves an AST expression to a sub-schema, emitting a diagnostic\n * if the path cannot be resolved.\n *\n * Handles the `{{key:N}}` syntax:\n * - If the expression has an identifier N → resolution in `identifierSchemas[N]`\n * - If identifier N has no associated schema → error\n * - If no identifier → resolution in `ctx.current` (standard behavior)\n *\n * @returns The resolved sub-schema, or `undefined` if the path is invalid.\n */\nfunction resolveExpressionWithDiagnostics(\n\texpr: hbs.AST.Expression,\n\tctx: AnalysisContext,\n\t/** Parent AST node (for diagnostic location) */\n\tparentNode?: hbs.AST.Node,\n): JSONSchema7 | undefined {\n\t// Handle `this` / `.` → return the current context\n\tif (isThisExpression(expr)) {\n\t\treturn ctx.current;\n\t}\n\n\t// ── SubExpression (nested helper call, e.g. `(lt account.balance 500)`) ──\n\tif (expr.type === \"SubExpression\") {\n\t\treturn resolveSubExpression(expr as hbs.AST.SubExpression, ctx, parentNode);\n\t}\n\n\tconst segments = extractPathSegments(expr);\n\tif (segments.length === 0) {\n\t\t// Expression that is not a PathExpression (e.g. literal)\n\t\tif (expr.type === \"StringLiteral\") return { type: \"string\" };\n\t\tif (expr.type === \"NumberLiteral\") return { type: \"number\" };\n\t\tif (expr.type === \"BooleanLiteral\") return { type: \"boolean\" };\n\t\tif (expr.type === \"NullLiteral\") return { type: \"null\" };\n\t\tif (expr.type === \"UndefinedLiteral\") return {};\n\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNANALYZABLE\",\n\t\t\t\"warning\",\n\t\t\tcreateUnanalyzableMessage(expr.type),\n\t\t\tparentNode ?? expr,\n\t\t);\n\t\treturn undefined;\n\t}\n\n\t// ── Identifier extraction ──────────────────────────────────────────────\n\t// Extract the `:N` suffix BEFORE checking for `$root` so that both\n\t// `{{$root}}` and `{{$root:2}}` are handled uniformly.\n\tconst { cleanSegments, identifier } = extractExpressionIdentifier(segments);\n\n\t// ── $root token ──────────────────────────────────────────────────────\n\t// Path traversal ($root.name, $root.address.city) is always forbidden,\n\t// regardless of whether an identifier is present.\n\tif (isRootPathTraversal(cleanSegments)) {\n\t\tconst fullPath = cleanSegments.join(\".\");\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"ROOT_PATH_TRAVERSAL\",\n\t\t\t\"error\",\n\t\t\tcreateRootPathTraversalMessage(fullPath),\n\t\t\tparentNode ?? expr,\n\t\t\t{ path: fullPath },\n\t\t);\n\t\treturn undefined;\n\t}\n\n\t// `{{$root}}` → return the entire current context schema\n\t// `{{$root:N}}` → return the entire schema for identifier N\n\tif (isRootSegments(cleanSegments)) {\n\t\tif (identifier !== null) {\n\t\t\treturn resolveRootWithIdentifier(identifier, ctx, parentNode ?? expr);\n\t\t}\n\t\treturn ctx.current;\n\t}\n\n\tif (identifier !== null) {\n\t\t// The expression uses the {{key:N}} syntax — resolve from\n\t\t// the schema of identifier N.\n\t\treturn resolveWithIdentifier(\n\t\t\tcleanSegments,\n\t\t\tidentifier,\n\t\t\tctx,\n\t\t\tparentNode ?? expr,\n\t\t);\n\t}\n\n\t// ── Standard resolution (no identifier) ────────────────────────────────\n\tconst resolved = resolveSchemaPath(ctx.current, cleanSegments);\n\tif (resolved === undefined) {\n\t\tconst fullPath = cleanSegments.join(\".\");\n\t\tconst availableProperties = getSchemaPropertyNames(ctx.current);\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_PROPERTY\",\n\t\t\t\"error\",\n\t\t\tcreatePropertyNotFoundMessage(fullPath, availableProperties),\n\t\t\tparentNode ?? expr,\n\t\t\t{ path: fullPath, availableProperties },\n\t\t);\n\t\treturn undefined;\n\t}\n\n\treturn resolved;\n}\n\n/**\n * Resolves `{{$root:N}}` — returns the **entire** schema for identifier N.\n *\n * This is the identifier-aware counterpart of returning `ctx.current` for\n * a plain `{{$root}}`. Instead of navigating into properties, it returns\n * the identifier's root schema directly.\n *\n * When the identifier schema is an array (aggregated multi-version data),\n * the full array schema is returned as-is — the caller receives the\n * complete `{ type: \"array\", items: ... }` schema.\n *\n * Emits an error diagnostic if:\n * - No `identifierSchemas` were provided\n * - Identifier N has no associated schema\n */\nfunction resolveRootWithIdentifier(\n\tidentifier: number,\n\tctx: AnalysisContext,\n\tnode: hbs.AST.Node,\n): JSONSchema7 | undefined {\n\t// No identifierSchemas provided at all\n\tif (!ctx.identifierSchemas) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"MISSING_IDENTIFIER_SCHEMAS\",\n\t\t\t\"error\",\n\t\t\t`Property \"$root:${identifier}\" uses an identifier but no identifier schemas were provided`,\n\t\t\tnode,\n\t\t\t{ path: `$root:${identifier}`, identifier },\n\t\t);\n\t\treturn undefined;\n\t}\n\n\t// The identifier does not exist in the provided schemas\n\tconst idSchema = ctx.identifierSchemas[identifier];\n\tif (!idSchema) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_IDENTIFIER\",\n\t\t\t\"error\",\n\t\t\t`Property \"$root:${identifier}\" references identifier ${identifier} but no schema exists for this identifier`,\n\t\t\tnode,\n\t\t\t{ path: `$root:${identifier}`, identifier },\n\t\t);\n\t\treturn undefined;\n\t}\n\n\t// Return the entire schema for identifier N.\n\t// For aggregated identifiers (array schemas), this returns the full\n\t// array schema — e.g. { type: \"array\", items: { type: \"object\", ... } }\n\treturn idSchema;\n}\n\n/**\n * Resolves an expression with identifier `{{key:N}}` by looking up the\n * schema associated with identifier N.\n *\n * When the identifier schema is an array (aggregated multi-version data),\n * the property is resolved within the array's `items` schema, and the\n * result is wrapped in `{ type: \"array\", items: <resolved> }`. This\n * models the runtime behavior where `{{accountId:4}}` on an array of\n * objects extracts the property from each element, producing an array.\n *\n * Emits an error diagnostic if:\n * - No `identifierSchemas` were provided\n * - Identifier N has no associated schema\n * - The property does not exist in the identifier's schema\n */\nfunction resolveWithIdentifier(\n\tcleanSegments: string[],\n\tidentifier: number,\n\tctx: AnalysisContext,\n\tnode: hbs.AST.Node,\n): JSONSchema7 | undefined {\n\tconst fullPath = cleanSegments.join(\".\");\n\n\t// No identifierSchemas provided at all\n\tif (!ctx.identifierSchemas) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"MISSING_IDENTIFIER_SCHEMAS\",\n\t\t\t\"error\",\n\t\t\t`Property \"${fullPath}:${identifier}\" uses an identifier but no identifier schemas were provided`,\n\t\t\tnode,\n\t\t\t{ path: `${fullPath}:${identifier}`, identifier },\n\t\t);\n\t\treturn undefined;\n\t}\n\n\t// The identifier does not exist in the provided schemas\n\tconst idSchema = ctx.identifierSchemas[identifier];\n\tif (!idSchema) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_IDENTIFIER\",\n\t\t\t\"error\",\n\t\t\t`Property \"${fullPath}:${identifier}\" references identifier ${identifier} but no schema exists for this identifier`,\n\t\t\tnode,\n\t\t\t{ path: `${fullPath}:${identifier}`, identifier },\n\t\t);\n\t\treturn undefined;\n\t}\n\n\t// ── Aggregated identifier (array schema) ─────────────────────────────\n\t// When the identifier schema is an array of objects (e.g. from a\n\t// multi-versioned workflow node), resolve the property within the\n\t// items schema and wrap the result in an array type.\n\t//\n\t// Example: identifierSchemas[4] = { type: \"array\", items: { type: \"object\",\n\t// properties: { accountId: { type: \"string\" } } } }\n\t// Expression: {{accountId:4}}\n\t// Result: { type: \"array\", items: { type: \"string\" } }\n\tconst itemSchema = resolveArrayItems(idSchema, ctx.root);\n\tif (itemSchema !== undefined) {\n\t\t// The identifier schema is an array — resolve within items\n\t\tconst resolved = resolveSchemaPath(itemSchema, cleanSegments);\n\t\tif (resolved === undefined) {\n\t\t\tconst availableProperties = getSchemaPropertyNames(itemSchema);\n\t\t\taddDiagnostic(\n\t\t\t\tctx,\n\t\t\t\t\"IDENTIFIER_PROPERTY_NOT_FOUND\",\n\t\t\t\t\"error\",\n\t\t\t\t`Property \"${fullPath}\" does not exist in the items schema for identifier ${identifier}`,\n\t\t\t\tnode,\n\t\t\t\t{\n\t\t\t\t\tpath: fullPath,\n\t\t\t\t\tidentifier,\n\t\t\t\t\tavailableProperties,\n\t\t\t\t},\n\t\t\t);\n\t\t\treturn undefined;\n\t\t}\n\t\t// Wrap the resolved property schema in an array\n\t\treturn { type: \"array\", items: resolved };\n\t}\n\n\t// ── Standard identifier (single object schema) ───────────────────────\n\t// Resolve the path within the identifier's schema directly.\n\tconst resolved = resolveSchemaPath(idSchema, cleanSegments);\n\tif (resolved === undefined) {\n\t\tconst availableProperties = getSchemaPropertyNames(idSchema);\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"IDENTIFIER_PROPERTY_NOT_FOUND\",\n\t\t\t\"error\",\n\t\t\t`Property \"${fullPath}\" does not exist in the schema for identifier ${identifier}`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\tpath: fullPath,\n\t\t\t\tidentifier,\n\t\t\t\tavailableProperties,\n\t\t\t},\n\t\t);\n\t\treturn undefined;\n\t}\n\n\treturn resolved;\n}\n\n// ─── Nullable Schema Wrapping ────────────────────────────────────────────────\n\n/**\n * Wraps a JSON Schema with `null` to indicate the value can be nullish.\n *\n * - If the schema already includes `null`, it is returned as-is.\n * - For schemas with a simple `type` string, the type becomes an array\n * (e.g. `{ type: \"string\" }` → `{ type: [\"string\", \"null\"] }`).\n * - For schemas with a type array, `\"null\"` is appended.\n * - For complex schemas (oneOf, anyOf, etc.), a `oneOf` wrapper is used.\n */\nfunction withNullType(schema: JSONSchema7): JSONSchema7 {\n\tif (schema.type === \"null\") return schema;\n\n\tif (typeof schema.type === \"string\") {\n\t\treturn { ...schema, type: [schema.type, \"null\"] };\n\t}\n\n\tif (Array.isArray(schema.type)) {\n\t\tif (schema.type.includes(\"null\")) return schema;\n\t\treturn { ...schema, type: [...schema.type, \"null\"] };\n\t}\n\n\t// Complex schema (oneOf, anyOf, allOf, etc.) — wrap with oneOf\n\treturn simplifySchema({ oneOf: [schema, { type: \"null\" }] });\n}\n\n/**\n * Checks whether EVERY segment along a property path is required.\n *\n * Unlike `isPropertyRequired` (which only checks the last segment),\n * this function verifies that no intermediate segment is optional.\n * If any segment along the path is optional, the entire expression\n * can produce `null`/`undefined` at runtime.\n *\n * Example: for path `[\"user\", \"name\"]`, checks both that `user` is\n * required in the root schema AND that `name` is required in `user`.\n */\nfunction isPathFullyRequired(schema: JSONSchema7, segments: string[]): boolean {\n\tfor (let i = 1; i <= segments.length; i++) {\n\t\tif (!isPropertyRequired(schema, segments.slice(0, i))) return false;\n\t}\n\treturn true;\n}\n\n// ─── Utilities ───────────────────────────────────────────────────────────────\n\n/**\n * Extracts the first argument of a BlockStatement.\n *\n * In the Handlebars AST, for `{{#if active}}`:\n * - `stmt.path` → PathExpression(\"if\") ← the helper name\n * - `stmt.params[0]` → PathExpression(\"active\") ← the actual argument\n *\n * @returns The argument expression, or `undefined` if the block has no argument.\n */\n// ─── SubExpression Resolution ────────────────────────────────────────────────\n\n/**\n * Resolves a SubExpression (nested helper call) such as `(lt account.balance 500)`.\n *\n * This mirrors the helper-call logic in `processMustache` but applies to\n * expressions used as arguments (e.g. inside `{{#if (lt a b)}}`).\n *\n * Steps:\n * 1. Extract the helper name from the SubExpression's path.\n * 2. Look up the helper in `ctx.helpers`.\n * 3. Validate argument count and types.\n * 4. Return the helper's declared `returnType` (defaults to `{ type: \"string\" }`).\n */\nfunction resolveSubExpression(\n\texpr: hbs.AST.SubExpression,\n\tctx: AnalysisContext,\n\tparentNode?: hbs.AST.Node,\n): JSONSchema7 | undefined {\n\tconst helperName = getExpressionName(expr.path);\n\n\t// ── Special-case: map helper ─────────────────────────────────────\n\t// The `map` helper requires deep static analysis to infer the\n\t// precise return type `{ type: \"array\", items: <property schema> }`.\n\t// The generic path would only return `{ type: \"array\" }` (the static\n\t// returnType), losing the item schema needed by nested map calls.\n\tif (helperName === MapHelpers.MAP_HELPER_NAME) {\n\t\treturn processMapSubExpression(expr, ctx, parentNode);\n\t}\n\n\t// ── Special-case: default helper ─────────────────────────────────\n\tif (helperName === DefaultHelpers.DEFAULT_HELPER_NAME) {\n\t\treturn processDefaultSubExpression(expr, ctx, parentNode);\n\t}\n\n\tconst helper = ctx.helpers?.get(helperName);\n\tif (!helper) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_HELPER\",\n\t\t\t\"warning\",\n\t\t\t`Unknown sub-expression helper \"${helperName}\" — cannot analyze statically`,\n\t\t\tparentNode ?? expr,\n\t\t\t{ helperName },\n\t\t);\n\t\treturn { type: \"string\" };\n\t}\n\n\tconst helperParams = helper.params;\n\n\t// ── Check the number of required parameters ──────────────────────\n\tif (helperParams) {\n\t\tconst requiredCount = helperParams.filter((p) => !p.optional).length;\n\t\tif (expr.params.length < requiredCount) {\n\t\t\taddDiagnostic(\n\t\t\t\tctx,\n\t\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\t\"error\",\n\t\t\t\t`Helper \"${helperName}\" expects at least ${requiredCount} argument(s), but got ${expr.params.length}`,\n\t\t\t\tparentNode ?? expr,\n\t\t\t\t{\n\t\t\t\t\thelperName,\n\t\t\t\t\texpected: `${requiredCount} argument(s)`,\n\t\t\t\t\tactual: `${expr.params.length} argument(s)`,\n\t\t\t\t},\n\t\t\t);\n\t\t}\n\t}\n\n\t// ── Validate each parameter (existence + type) ───────────────────\n\tfor (let i = 0; i < expr.params.length; i++) {\n\t\tconst resolvedSchema = resolveExpressionWithDiagnostics(\n\t\t\texpr.params[i] as hbs.AST.Expression,\n\t\t\tctx,\n\t\t\tparentNode ?? expr,\n\t\t);\n\n\t\tconst helperParam = helperParams?.[i];\n\t\tif (resolvedSchema && helperParam?.type) {\n\t\t\tconst expectedType = helperParam.type;\n\t\t\tif (!isParamTypeCompatible(resolvedSchema, expectedType)) {\n\t\t\t\tconst paramName = helperParam.name;\n\t\t\t\taddDiagnostic(\n\t\t\t\t\tctx,\n\t\t\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\t\t\"error\",\n\t\t\t\t\t`Helper \"${helperName}\" parameter \"${paramName}\" expects ${schemaTypeLabel(expectedType)}, but got ${schemaTypeLabel(resolvedSchema)}`,\n\t\t\t\t\tparentNode ?? expr,\n\t\t\t\t\t{\n\t\t\t\t\t\thelperName,\n\t\t\t\t\t\texpected: schemaTypeLabel(expectedType),\n\t\t\t\t\t\tactual: schemaTypeLabel(resolvedSchema),\n\t\t\t\t\t},\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn helper.returnType ?? { type: \"string\" };\n}\n\n// ─── map helper — sub-expression analysis ────────────────────────────────────\n// Mirrors processMapHelper but for SubExpression nodes (e.g.\n// `(map users 'cartItems')` used as an argument to another helper).\n// This enables nested map: `{{ map (map users 'cartItems') 'productId' }}`\n\nfunction processMapSubExpression(\n\texpr: hbs.AST.SubExpression,\n\tctx: AnalysisContext,\n\tparentNode?: hbs.AST.Node,\n): JSONSchema7 {\n\tconst helperName = MapHelpers.MAP_HELPER_NAME;\n\tconst node = parentNode ?? expr;\n\n\t// ── 1. Check argument count ──────────────────────────────────────────\n\tif (expr.params.length < 2) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" expects at least 2 argument(s), but got ${expr.params.length}`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"2 argument(s)\",\n\t\t\t\tactual: `${expr.params.length} argument(s)`,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 2. Resolve the first argument (collection path) ──────────────────\n\tconst collectionExpr = expr.params[0] as hbs.AST.Expression;\n\tconst collectionSchema = resolveExpressionWithDiagnostics(\n\t\tcollectionExpr,\n\t\tctx,\n\t\tnode,\n\t);\n\n\tif (!collectionSchema) {\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 3. Validate that the collection is an array ──────────────────────\n\tconst itemSchema = resolveArrayItems(collectionSchema, ctx.root);\n\tif (!itemSchema) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" parameter \"collection\" expects an array, but got ${schemaTypeLabel(collectionSchema)}`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"array\",\n\t\t\t\tactual: schemaTypeLabel(collectionSchema),\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 4. Validate that the items are objects ───────────────────────────\n\t// If the items are arrays (e.g. from a nested map), flatten one level\n\t// to match the runtime `flat(1)` behavior and use the inner items instead.\n\tlet effectiveItemSchema = itemSchema;\n\tconst itemType = effectiveItemSchema.type;\n\tif (\n\t\titemType === \"array\" ||\n\t\t(Array.isArray(itemType) && itemType.includes(\"array\"))\n\t) {\n\t\tconst innerItems = resolveArrayItems(effectiveItemSchema, ctx.root);\n\t\tif (innerItems) {\n\t\t\teffectiveItemSchema = innerItems;\n\t\t}\n\t}\n\n\tconst effectiveItemType = effectiveItemSchema.type;\n\tconst isObject =\n\t\teffectiveItemType === \"object\" ||\n\t\t(Array.isArray(effectiveItemType) &&\n\t\t\teffectiveItemType.includes(\"object\")) ||\n\t\t(!effectiveItemType && effectiveItemSchema.properties !== undefined);\n\n\tif (!isObject && effectiveItemType !== undefined) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" expects an array of objects, but the array items have type \"${schemaTypeLabel(effectiveItemSchema)}\"`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"object\",\n\t\t\t\tactual: schemaTypeLabel(effectiveItemSchema),\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 5. Validate the second argument (property name) ──────────────────\n\tconst propertyExpr = expr.params[1] as hbs.AST.Expression;\n\tlet propertyName: string | undefined;\n\n\tif (propertyExpr.type === \"PathExpression\") {\n\t\tconst bare = (propertyExpr as hbs.AST.PathExpression).original;\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" parameter \"property\" must be a quoted string. ` +\n\t\t\t\t`Use (${helperName} … \"${bare}\") instead of (${helperName} … ${bare})`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: 'StringLiteral (e.g. \"property\")',\n\t\t\t\tactual: `PathExpression (${bare})`,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\tif (propertyExpr.type === \"StringLiteral\") {\n\t\tpropertyName = (propertyExpr as hbs.AST.StringLiteral).value;\n\t}\n\n\tif (!propertyName) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" parameter \"property\" expects a quoted string literal, but got ${propertyExpr.type}`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: 'StringLiteral (e.g. \"property\")',\n\t\t\t\tactual: propertyExpr.type,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 6. Resolve the property within the item schema ───────────────────\n\tconst propertySchema = resolveSchemaPath(effectiveItemSchema, [propertyName]);\n\tif (!propertySchema) {\n\t\tconst availableProperties = getSchemaPropertyNames(effectiveItemSchema);\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_PROPERTY\",\n\t\t\t\"error\",\n\t\t\tcreatePropertyNotFoundMessage(propertyName, availableProperties),\n\t\t\tnode,\n\t\t\t{\n\t\t\t\tpath: propertyName,\n\t\t\t\tavailableProperties,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 7. Return the inferred output schema ─────────────────────────────\n\treturn { type: \"array\", items: propertySchema };\n}\n\nfunction getBlockArgument(\n\tstmt: hbs.AST.BlockStatement,\n): hbs.AST.Expression | undefined {\n\treturn stmt.params[0] as hbs.AST.Expression | undefined;\n}\n\n/**\n * Retrieves the helper name from a BlockStatement (e.g. \"if\", \"each\", \"with\").\n */\nfunction getBlockHelperName(stmt: hbs.AST.BlockStatement): string {\n\tif (stmt.path.type === \"PathExpression\") {\n\t\treturn (stmt.path as hbs.AST.PathExpression).original;\n\t}\n\treturn \"\";\n}\n\n/**\n * Retrieves the name of an expression (first segment of the PathExpression).\n * Used to identify inline helpers.\n */\nfunction getExpressionName(expr: hbs.AST.Expression): string {\n\tif (expr.type === \"PathExpression\") {\n\t\treturn (expr as hbs.AST.PathExpression).original;\n\t}\n\treturn \"\";\n}\n\n/**\n * Adds an enriched diagnostic to the analysis context.\n *\n * Each diagnostic includes:\n * - A machine-readable `code` for the frontend\n * - A human-readable `message` describing the problem\n * - A `source` snippet from the template (if the position is available)\n * - Structured `details` for debugging\n */\nfunction addDiagnostic(\n\tctx: AnalysisContext,\n\tcode: DiagnosticCode,\n\tseverity: \"error\" | \"warning\",\n\tmessage: string,\n\tnode?: hbs.AST.Node,\n\tdetails?: DiagnosticDetails,\n): void {\n\tconst diagnostic: TemplateDiagnostic = { severity, code, message };\n\n\t// Extract the position and source snippet if available\n\tif (node && \"loc\" in node && node.loc) {\n\t\tdiagnostic.loc = {\n\t\t\tstart: { line: node.loc.start.line, column: node.loc.start.column },\n\t\t\tend: { line: node.loc.end.line, column: node.loc.end.column },\n\t\t};\n\t\t// Extract the template fragment around the error\n\t\tdiagnostic.source = extractSourceSnippet(ctx.template, diagnostic.loc);\n\t}\n\n\tif (details) {\n\t\tdiagnostic.details = details;\n\t}\n\n\tctx.diagnostics.push(diagnostic);\n}\n\n/**\n * Returns a human-readable label for a schema's type (for error messages).\n */\nfunction schemaTypeLabel(schema: JSONSchema7): string {\n\tif (schema.type) {\n\t\treturn Array.isArray(schema.type) ? schema.type.join(\" | \") : schema.type;\n\t}\n\tif (schema.oneOf) return \"oneOf(...)\";\n\tif (schema.anyOf) return \"anyOf(...)\";\n\tif (schema.allOf) return \"allOf(...)\";\n\tif (schema.enum) return \"enum\";\n\treturn \"unknown\";\n}\n\n// ─── Export for Internal Use ─────────────────────────────────────────────────\n// `inferBlockType` is exported to allow targeted unit tests\n// on block type inference.\nexport { inferBlockType };\n"],"names":["dispatchAnalyze","createMissingArgumentMessage","createPropertyNotFoundMessage","createRootPathTraversalMessage","createTypeMismatchMessage","createUnanalyzableMessage","createUnknownHelperMessage","DefaultHelpers","MapHelpers","detectLiteralType","extractExpressionIdentifier","extractPathSegments","getEffectiveBody","getEffectivelySingleBlock","getEffectivelySingleExpression","isRootPathTraversal","isRootSegments","isThisExpression","parse","findConditionalSchemaLocations","isPropertyRequired","resolveArrayItems","resolveSchemaPath","simplifySchema","deepEqual","extractSourceSnippet","getSchemaPropertyNames","coerceTextValue","text","targetType","undefined","num","Number","isNaN","isInteger","lower","toLowerCase","analyze","template","inputSchema","options","tpl","coerceSchema","ast","analyzeFromAst","identifierSchemas","child","childOptions","ctx","root","current","diagnostics","helpers","conditionalLocations","loc","addDiagnostic","keyword","schemaPath","path","id","idSchema","Object","entries","idLocations","length","valid","outputSchema","inferProgramType","hasErrors","some","d","severity","processStatement","stmt","type","processMustache","inferBlockType","params","hash","helperName","getExpressionName","MAP_HELPER_NAME","processMapHelper","DEFAULT_HELPER_NAME","processDefaultHelper","helper","get","helperParams","requiredCount","filter","p","optional","expected","actual","i","resolvedSchema","resolveExpressionWithDiagnostics","helperParam","expectedType","isParamTypeCompatible","paramName","name","schemaTypeLabel","returnType","resolved","segments","cleanSegments","identifier","targetSchema","itemSchema","isPathFullyRequired","withNullType","collectionExpr","collectionSchema","effectiveItemSchema","itemType","Array","isArray","includes","innerItems","join","effectiveItemType","isObject","properties","propertyExpr","propertyName","bare","original","value","propertySchema","availableProperties","items","analyzeDefaultArgs","processDefaultSubExpression","expr","parentNode","node","resolvedSchemas","hasGuaranteedValue","param","push","isGuaranteedExpression","firstWithType","find","s","schema","oneOf","expectedTypes","resolvedTypes","rt","et","program","effective","singleExpr","singleBlock","allContent","every","map","trim","coercedType","coercedValue","const","literalType","allBlocks","types","t","body","getBlockHelperName","arg","getBlockArgument","thenType","inverse","elseType","saved","result","innerSchema","resolveSubExpression","fullPath","resolveRootWithIdentifier","resolveWithIdentifier","slice","processMapSubExpression","code","message","details","diagnostic","start","line","column","end","source","anyOf","allOf","enum"],"mappings":"AACA,OAASA,eAAe,KAAQ,eAAgB,AAChD,QACCC,4BAA4B,CAC5BC,6BAA6B,CAC7BC,8BAA8B,CAC9BC,yBAAyB,CACzBC,yBAAyB,CACzBC,0BAA0B,KACpB,UAAW,AAClB,QAASC,cAAc,KAAQ,8BAA+B,AAC9D,QAASC,UAAU,KAAQ,0BAA2B,AACtD,QACCC,iBAAiB,CACjBC,2BAA2B,CAC3BC,mBAAmB,CACnBC,gBAAgB,CAChBC,yBAAyB,CACzBC,8BAA8B,CAC9BC,mBAAmB,CACnBC,cAAc,CACdC,gBAAgB,CAChBC,KAAK,KACC,UAAW,AAClB,QACCC,8BAA8B,CAC9BC,kBAAkB,CAClBC,iBAAiB,CACjBC,iBAAiB,CACjBC,cAAc,KACR,mBAAoB,AAS3B,QACCC,SAAS,CACTC,oBAAoB,CACpBC,sBAAsB,KAChB,SAAU,CA+FjB,SAASC,gBACRC,IAAY,CACZC,UAAgE,EAEhE,OAAQA,YACP,IAAK,SACL,IAAK,UAAW,CACf,GAAID,OAAS,GAAI,OAAOE,UACxB,MAAMC,IAAMC,OAAOJ,MACnB,GAAII,OAAOC,KAAK,CAACF,KAAM,OAAOD,UAC9B,GAAID,aAAe,WAAa,CAACG,OAAOE,SAAS,CAACH,KAAM,OAAOD,UAC/D,OAAOC,GACR,CACA,IAAK,UAAW,CACf,MAAMI,MAAQP,KAAKQ,WAAW,GAC9B,GAAID,QAAU,OAAQ,OAAO,KAC7B,GAAIA,QAAU,QAAS,OAAO,MAC9B,OAAOL,SACR,CACA,IAAK,OACJ,OAAO,IACR,SACC,OAAOF,IACT,CACD,CAgBA,OAAO,SAASS,QACfC,QAAuB,CACvBC,YAA2B,CAAC,CAAC,CAC7BC,OAAwB,EAExB,OAAOxC,gBACNsC,SACAE,QAEA,CAACC,IAAKC,gBACL,MAAMC,IAAMzB,MAAMuB,KAClB,OAAOG,eAAeD,IAAKF,IAAKF,YAAa,CAC5CM,kBAAmBL,SAASK,kBAC5BH,YACD,EACD,EAEA,CAACI,MAAOC,eAAiBV,QAAQS,MAAOP,YAAaQ,cAEvD,CAcA,OAAO,SAASH,eACfD,GAAoB,CACpBL,QAAgB,CAChBC,YAA2B,CAAC,CAAC,CAC7BC,OASC,EAGD,MAAMQ,IAAuB,CAC5BC,KAAMV,YACNW,QAASX,YACTY,YAAa,EAAE,CACfb,SACAO,kBAAmBL,SAASK,kBAC5BO,QAASZ,SAASY,QAClBV,aAAcF,SAASE,YACxB,EAMA,MAAMW,qBAAuBlC,+BAA+BoB,aAC5D,IAAK,MAAMe,OAAOD,qBAAsB,CACvCE,cACCP,IACA,qBACA,QACA,CAAC,kCAAkC,EAAEM,IAAIE,OAAO,CAAC,MAAM,EAAEF,IAAIG,UAAU,CAAC,GAAG,CAAC,CAC3E,gFACA,uFACD3B,UACA,CAAE4B,KAAMJ,IAAIG,UAAU,AAAC,EAEzB,CAEA,GAAIjB,SAASK,kBAAmB,CAC/B,IAAK,KAAM,CAACc,GAAIC,SAAS,GAAIC,OAAOC,OAAO,CAACtB,QAAQK,iBAAiB,EAAG,CACvE,MAAMkB,YAAc5C,+BACnByC,SACA,CAAC,mBAAmB,EAAED,GAAG,CAAC,EAE3B,IAAK,MAAML,OAAOS,YAAa,CAC9BR,cACCP,IACA,qBACA,QACA,CAAC,kCAAkC,EAAEM,IAAIE,OAAO,CAAC,MAAM,EAAEF,IAAIG,UAAU,CAAC,GAAG,CAAC,CAC3E,gFACA,uFACD3B,UACA,CAAE4B,KAAMJ,IAAIG,UAAU,AAAC,EAEzB,CACD,CACD,CAGA,GAAIT,IAAIG,WAAW,CAACa,MAAM,CAAG,EAAG,CAC/B,MAAO,CACNC,MAAO,MACPd,YAAaH,IAAIG,WAAW,CAC5Be,aAAc,CAAC,CAChB,CACD,CAGA,MAAMA,aAAeC,iBAAiBxB,IAAKK,KAE3C,MAAMoB,UAAYpB,IAAIG,WAAW,CAACkB,IAAI,CAAC,AAACC,GAAMA,EAAEC,QAAQ,GAAK,SAE7D,MAAO,CACNN,MAAO,CAACG,UACRjB,YAAaH,IAAIG,WAAW,CAC5Be,aAAc3C,eAAe2C,aAC9B,CACD,CAsBA,SAASM,iBACRC,IAAuB,CACvBzB,GAAoB,EAEpB,OAAQyB,KAAKC,IAAI,EAChB,IAAK,mBACL,IAAK,mBAEJ,OAAO5C,SAER,KAAK,oBACJ,OAAO6C,gBAAgBF,KAAmCzB,IAE3D,KAAK,iBACJ,OAAO4B,eAAeH,KAAgCzB,IAEvD,SAGCO,cACCP,IACA,eACA,UACA,CAAC,4BAA4B,EAAEyB,KAAKC,IAAI,CAAC,CAAC,CAAC,CAC3CD,MAED,OAAO3C,SACT,CACD,CAWA,SAAS6C,gBACRF,IAA+B,CAC/BzB,GAAoB,EAIpB,GAAIyB,KAAKf,IAAI,CAACgB,IAAI,GAAK,gBAAiB,CACvCnB,cACCP,IACA,eACA,UACA,gDACAyB,MAED,MAAO,CAAC,CACT,CAKA,GAAIA,KAAKI,MAAM,CAACb,MAAM,CAAG,GAAKS,KAAKK,IAAI,CAAE,CACxC,MAAMC,WAAaC,kBAAkBP,KAAKf,IAAI,EAQ9C,GAAIqB,aAAevE,WAAWyE,eAAe,CAAE,CAC9C,OAAOC,iBAAiBT,KAAMzB,IAC/B,CAMA,GAAI+B,aAAexE,eAAe4E,mBAAmB,CAAE,CACtD,OAAOC,qBAAqBX,KAAMzB,IACnC,CAGA,MAAMqC,OAASrC,IAAII,OAAO,EAAEkC,IAAIP,YAChC,GAAIM,OAAQ,CACX,MAAME,aAAeF,OAAOR,MAAM,CAGlC,GAAIU,aAAc,CACjB,MAAMC,cAAgBD,aAAaE,MAAM,CAAC,AAACC,GAAM,CAACA,EAAEC,QAAQ,EAAE3B,MAAM,CACpE,GAAIS,KAAKI,MAAM,CAACb,MAAM,CAAGwB,cAAe,CACvCjC,cACCP,IACA,mBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,mBAAmB,EAAES,cAAc,sBAAsB,EAAEf,KAAKI,MAAM,CAACb,MAAM,CAAC,CAAC,CACrGS,KACA,CACCM,WACAa,SAAU,CAAC,EAAEJ,cAAc,YAAY,CAAC,CACxCK,OAAQ,CAAC,EAAEpB,KAAKI,MAAM,CAACb,MAAM,CAAC,YAAY,CAAC,AAC5C,EAEF,CACD,CAGA,IAAK,IAAI8B,EAAI,EAAGA,EAAIrB,KAAKI,MAAM,CAACb,MAAM,CAAE8B,IAAK,CAC5C,MAAMC,eAAiBC,iCACtBvB,KAAKI,MAAM,CAACiB,EAAE,CACd9C,IACAyB,MAKD,MAAMwB,YAAcV,cAAc,CAACO,EAAE,CACrC,GAAIC,gBAAkBE,aAAavB,KAAM,CACxC,MAAMwB,aAAeD,YAAYvB,IAAI,CACrC,GAAI,CAACyB,sBAAsBJ,eAAgBG,cAAe,CACzD,MAAME,UAAYH,YAAYI,IAAI,CAClC9C,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,aAAa,EAAEqB,UAAU,UAAU,EAAEE,gBAAgBJ,cAAc,UAAU,EAAEI,gBAAgBP,gBAAgB,CAAC,CACtItB,KACA,CACCM,WACAa,SAAUU,gBAAgBJ,cAC1BL,OAAQS,gBAAgBP,eACzB,EAEF,CACD,CACD,CAEA,OAAOV,OAAOkB,UAAU,EAAI,CAAE7B,KAAM,QAAS,CAC9C,CAGAnB,cACCP,IACA,iBACA,UACA,CAAC,uBAAuB,EAAE+B,WAAW,6BAA6B,CAAC,CACnEN,KACA,CAAEM,UAAW,GAEd,MAAO,CAAEL,KAAM,QAAS,CACzB,CAGA,MAAM8B,SAAWR,iCAAiCvB,KAAKf,IAAI,CAAEV,IAAKyB,OAAS,CAAC,EAM5E,GAAIA,KAAKf,IAAI,CAACgB,IAAI,GAAK,iBAAkB,CACxC,MAAM+B,SAAW9F,oBAAoB8D,KAAKf,IAAI,EAC9C,GAAI+C,SAASzC,MAAM,CAAG,EAAG,CACxB,KAAM,CAAE0C,aAAa,CAAEC,UAAU,CAAE,CAClCjG,4BAA4B+F,UAC7B,GAAI,CAACzF,eAAe0F,eAAgB,CACnC,IAAIE,aACHD,aAAe,KACZ3D,IAAIH,iBAAiB,EAAE,CAAC8D,WAAW,CACnC3D,IAAIE,OAAO,CAGf,GAAI0D,cAAgBD,aAAe,KAAM,CACxC,MAAME,WAAaxF,kBAAkBuF,aAAc5D,IAAIC,IAAI,EAC3D,GAAI4D,aAAe/E,UAAW,CAC7B8E,aAAeC,UAChB,CACD,CACA,GAAID,cAAgB,CAACE,oBAAoBF,aAAcF,eAAgB,CACtE,OAAOK,aAAaP,SACrB,CACD,CACD,CACD,CAEA,OAAOA,QACR,CAcA,SAAStB,iBACRT,IAA+B,CAC/BzB,GAAoB,EAEpB,MAAM+B,WAAavE,WAAWyE,eAAe,CAG7C,GAAIR,KAAKI,MAAM,CAACb,MAAM,CAAG,EAAG,CAC3BT,cACCP,IACA,mBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,0CAA0C,EAAEN,KAAKI,MAAM,CAACb,MAAM,CAAC,CAAC,CACtFS,KACA,CACCM,WACAa,SAAU,gBACVC,OAAQ,CAAC,EAAEpB,KAAKI,MAAM,CAACb,MAAM,CAAC,YAAY,CAAC,AAC5C,GAED,MAAO,CAAEU,KAAM,OAAQ,CACxB,CAGA,MAAMsC,eAAiBvC,KAAKI,MAAM,CAAC,EAAE,CACrC,MAAMoC,iBAAmBjB,iCACxBgB,eACAhE,IACAyB,MAGD,GAAI,CAACwC,iBAAkB,CAEtB,MAAO,CAAEvC,KAAM,OAAQ,CACxB,CAGA,MAAMmC,WAAaxF,kBAAkB4F,iBAAkBjE,IAAIC,IAAI,EAC/D,GAAI,CAAC4D,WAAY,CAChBtD,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,mDAAmD,EAAEuB,gBAAgBW,kBAAkB,CAAC,CAC9GxC,KACA,CACCM,WACAa,SAAU,QACVC,OAAQS,gBAAgBW,iBACzB,GAED,MAAO,CAAEvC,KAAM,OAAQ,CACxB,CAKA,IAAIwC,oBAAsBL,WAC1B,MAAMM,SAAWD,oBAAoBxC,IAAI,CACzC,GACCyC,WAAa,SACZC,MAAMC,OAAO,CAACF,WAAaA,SAASG,QAAQ,CAAC,SAC7C,CACD,MAAMC,WAAalG,kBAAkB6F,oBAAqBlE,IAAIC,IAAI,EAClE,GAAIsE,WAAY,CACfL,oBAAsBK,WAEtBhE,cACCP,IACA,uBACA,UACA,CAAC,KAAK,EAAE+B,WAAW,8EAA8E,CAAC,CACjG,CAAC,eAAe,EAAEqC,MAAMC,OAAO,CAACF,UAAYA,SAASK,IAAI,CAAC,OAASL,SAAS,0CAA0C,CAAC,CACxH1C,KACA,CACCM,WACAa,SAAU,SACVC,OAAQS,gBAAgBY,oBACzB,EAEF,CACD,CAEA,MAAMO,kBAAoBP,oBAAoBxC,IAAI,CAClD,MAAMgD,SACLD,oBAAsB,UACrBL,MAAMC,OAAO,CAACI,oBACdA,kBAAkBH,QAAQ,CAAC,WAE3B,CAACG,mBAAqBP,oBAAoBS,UAAU,GAAK7F,UAE3D,GAAI,CAAC4F,UAAYD,oBAAsB3F,UAAW,CACjDyB,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,8DAA8D,EAAEuB,gBAAgBY,qBAAqB,CAAC,CAAC,CAC7HzC,KACA,CACCM,WACAa,SAAU,SACVC,OAAQS,gBAAgBY,oBACzB,GAED,MAAO,CAAExC,KAAM,OAAQ,CACxB,CAGA,MAAMkD,aAAenD,KAAKI,MAAM,CAAC,EAAE,CAOnC,IAAIgD,aAEJ,GAAID,aAAalD,IAAI,GAAK,iBAAkB,CAC3C,MAAMoD,KAAO,AAACF,aAAwCG,QAAQ,CAC9DxE,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,gDAAgD,CAAC,CACtE,CAAC,OAAO,EAAEA,WAAW,IAAI,EAAE+C,KAAK,mBAAmB,EAAE/C,WAAW,GAAG,EAAE+C,KAAK,GAAG,CAAC,CAC/ErD,KACA,CACCM,WACAa,SAAU,kCACVC,OAAQ,CAAC,gBAAgB,EAAEiC,KAAK,CAAC,CAAC,AACnC,GAED,MAAO,CAAEpD,KAAM,OAAQ,CACxB,CAEA,GAAIkD,aAAalD,IAAI,GAAK,gBAAiB,CAC1CmD,aAAe,AAACD,aAAuCI,KAAK,AAC7D,CAEA,GAAI,CAACH,aAAc,CAClBtE,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,gEAAgE,EAAE6C,aAAalD,IAAI,CAAC,CAAC,CAC3GD,KACA,CACCM,WACAa,SAAU,kCACVC,OAAQ+B,aAAalD,IAAI,AAC1B,GAED,MAAO,CAAEA,KAAM,OAAQ,CACxB,CAGA,MAAMuD,eAAiB3G,kBAAkB4F,oBAAqB,CAACW,aAAa,EAC5E,GAAI,CAACI,eAAgB,CACpB,MAAMC,oBAAsBxG,uBAAuBwF,qBACnD3D,cACCP,IACA,mBACA,QACA9C,8BAA8B2H,aAAcK,qBAC5CzD,KACA,CACCf,KAAMmE,aACNK,mBACD,GAED,MAAO,CAAExD,KAAM,OAAQ,CACxB,CAGA,MAAO,CAAEA,KAAM,QAASyD,MAAOF,cAAe,CAC/C,CAgBA,SAAS7C,qBACRX,IAA+B,CAC/BzB,GAAoB,EAEpB,OAAOoF,mBAAmB3D,KAAKI,MAAM,CAA0B7B,IAAKyB,KACrE,CAMA,SAAS4D,4BACRC,IAA2B,CAC3BtF,GAAoB,CACpBuF,UAAyB,EAEzB,OAAOH,mBACNE,KAAKzD,MAAM,CACX7B,IACAuF,YAAcD,KAEhB,CAYA,SAASF,mBACRvD,MAA4B,CAC5B7B,GAAoB,CACpBwF,IAAkB,EAElB,MAAMzD,WAAaxE,eAAe4E,mBAAmB,CAGrD,GAAIN,OAAOb,MAAM,CAAG,EAAG,CACtBT,cACCP,IACA,mBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,0CAA0C,EAAEF,OAAOb,MAAM,CAAC,CAAC,CACjFwE,KACA,CACCzD,WACAa,SAAU,gBACVC,OAAQ,CAAC,EAAEhB,OAAOb,MAAM,CAAC,YAAY,CAAC,AACvC,GAED,MAAO,CAAC,CACT,CAGA,MAAMyE,gBAAiC,EAAE,CACzC,IAAIC,mBAAqB,MAEzB,IAAK,IAAI5C,EAAI,EAAGA,EAAIjB,OAAOb,MAAM,CAAE8B,IAAK,CACvC,MAAM6C,MAAQ9D,MAAM,CAACiB,EAAE,CACvB,MAAMC,eAAiBC,iCAAiC2C,MAAO3F,IAAKwF,MAEpE,GAAIzC,eAAgB,CACnB0C,gBAAgBG,IAAI,CAAC7C,eACtB,CAGA,GAAI8C,uBAAuBF,MAAO3F,KAAM,CACvC0F,mBAAqB,IACtB,CACD,CAKA,GAAID,gBAAgBzE,MAAM,EAAI,EAAG,CAChC,MAAM8E,cAAgBL,gBAAgBM,IAAI,CAAC,AAACC,GAAMA,EAAEtE,IAAI,EACxD,GAAIoE,cAAe,CAClB,IAAK,IAAIhD,EAAI,EAAGA,EAAI2C,gBAAgBzE,MAAM,CAAE8B,IAAK,CAChD,MAAMmD,OAASR,eAAe,CAAC3C,EAAE,CACjC,GAAImD,OAAOvE,IAAI,EAAI,CAACyB,sBAAsB8C,OAAQH,eAAgB,CACjEvF,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,WAAW,EAAEe,EAAI,EAAE,UAAU,EAAEQ,gBAAgB2C,QAAQ,oBAAoB,EAAE3C,gBAAgBwC,eAAe,CAAC,CACnIN,KACA,CACCzD,WACAa,SAAUU,gBAAgBwC,eAC1BjD,OAAQS,gBAAgB2C,OACzB,EAEF,CACD,CACD,CACD,CAGA,GAAI,CAACP,mBAAoB,CACxBnF,cACCP,IACA,8BACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,8CAA8C,CAAC,CACpE,iEACDyD,KACA,CAAEzD,UAAW,EAEf,CAGA,GAAI0D,gBAAgBzE,MAAM,GAAK,EAAG,MAAO,CAAC,EAC1C,GAAIyE,gBAAgBzE,MAAM,GAAK,EAAG,OAAOyE,eAAe,CAAC,EAAE,CAE3D,OAAOlH,eAAe,CAAE2H,MAAOT,eAAgB,EAChD,CAWA,SAASI,uBACRP,IAAwB,CACxBtF,GAAoB,EAGpB,GACCsF,KAAK5D,IAAI,GAAK,iBACd4D,KAAK5D,IAAI,GAAK,iBACd4D,KAAK5D,IAAI,GAAK,iBACb,CACD,OAAO,IACR,CAGA,GAAI4D,KAAK5D,IAAI,GAAK,gBAAiB,CAClC,OAAO,IACR,CAGA,GAAI4D,KAAK5D,IAAI,GAAK,iBAAkB,CACnC,MAAM+B,SAAW9F,oBAAoB2H,MACrC,GAAI7B,SAASzC,MAAM,GAAK,EAAG,OAAO,MAElC,KAAM,CAAE0C,aAAa,CAAE,CAAGhG,4BAA4B+F,UACtD,OAAOrF,mBAAmB4B,IAAIE,OAAO,CAAEwD,cACxC,CAEA,OAAO,KACR,CAYA,SAASP,sBACRK,QAAqB,CACrBZ,QAAqB,EAGrB,GAAI,CAACA,SAASlB,IAAI,EAAI,CAAC8B,SAAS9B,IAAI,CAAE,OAAO,KAE7C,MAAMyE,cAAgB/B,MAAMC,OAAO,CAACzB,SAASlB,IAAI,EAC9CkB,SAASlB,IAAI,CACb,CAACkB,SAASlB,IAAI,CAAC,CAClB,MAAM0E,cAAgBhC,MAAMC,OAAO,CAACb,SAAS9B,IAAI,EAC9C8B,SAAS9B,IAAI,CACb,CAAC8B,SAAS9B,IAAI,CAAC,CAGlB,OAAO0E,cAAc/E,IAAI,CAAC,AAACgF,IAC1BF,cAAc9E,IAAI,CACjB,AAACiF,IACAD,KAAOC,IAENA,KAAO,UAAYD,KAAO,WAC1BC,KAAO,WAAaD,KAAO,UAGhC,CAeA,SAASlF,iBACRoF,OAAwB,CACxBvG,GAAoB,EAEpB,MAAMwG,UAAY5I,iBAAiB2I,SAGnC,GAAIC,UAAUxF,MAAM,GAAK,EAAG,CAC3B,MAAO,CAAEU,KAAM,QAAS,CACzB,CAGA,MAAM+E,WAAa3I,+BAA+ByI,SAClD,GAAIE,WAAY,CACf,OAAO9E,gBAAgB8E,WAAYzG,IACpC,CAGA,MAAM0G,YAAc7I,0BAA0B0I,SAC9C,GAAIG,YAAa,CAChB,OAAO9E,eAAe8E,YAAa1G,IACpC,CAKA,MAAM2G,WAAaH,UAAUI,KAAK,CAAC,AAACZ,GAAMA,EAAEtE,IAAI,GAAK,oBACrD,GAAIiF,WAAY,CACf,MAAM/H,KAAO4H,UACXK,GAAG,CAAC,AAACb,GAAM,AAACA,EAA+BhB,KAAK,EAChDR,IAAI,CAAC,IACLsC,IAAI,GAEN,GAAIlI,OAAS,GAAI,MAAO,CAAE8C,KAAM,QAAS,EAazC,MAAMqF,YAAc/G,IAAIN,YAAY,EAAEgC,KACtC,GACC,OAAOqF,cAAgB,UACtBA,CAAAA,cAAgB,UAChBA,cAAgB,UAChBA,cAAgB,WAChBA,cAAgB,WAChBA,cAAgB,MAAK,EACrB,CACD,MAAMC,aAAerI,gBAAgBC,KAAMmI,aAC3C,MAAO,CAAErF,KAAMqF,YAAaE,MAAOD,YAAa,CACjD,CAEA,MAAME,YAAczJ,kBAAkBmB,MACtC,GAAIsI,YAAa,MAAO,CAAExF,KAAMwF,WAAY,CAC7C,CAUA,MAAMC,UAAYX,UAAUI,KAAK,CAAC,AAACZ,GAAMA,EAAEtE,IAAI,GAAK,kBACpD,GAAIyF,UAAW,CACd,MAAMC,MAAuB,EAAE,CAC/B,IAAK,MAAM3F,QAAQ+E,UAAW,CAC7B,MAAMa,EAAIzF,eAAeH,KAAgCzB,KACzD,GAAIqH,EAAGD,MAAMxB,IAAI,CAACyB,EACnB,CACA,GAAID,MAAMpG,MAAM,GAAK,EAAG,OAAOoG,KAAK,CAAC,EAAE,CACvC,GAAIA,MAAMpG,MAAM,CAAG,EAAG,OAAOzC,eAAe,CAAE2H,MAAOkB,KAAM,GAC3D,MAAO,CAAE1F,KAAM,QAAS,CACzB,CAKA,IAAK,MAAMD,QAAQ8E,QAAQe,IAAI,CAAE,CAChC9F,iBAAiBC,KAAMzB,IACxB,CACA,MAAO,CAAE0B,KAAM,QAAS,CACzB,CAaA,SAASE,eACRH,IAA4B,CAC5BzB,GAAoB,EAEpB,MAAM+B,WAAawF,mBAAmB9F,MAEtC,OAAQM,YAGP,IAAK,KACL,IAAK,SAAU,CACd,MAAMyF,IAAMC,iBAAiBhG,MAC7B,GAAI+F,IAAK,CACRxE,iCAAiCwE,IAAKxH,IAAKyB,KAC5C,KAAO,CACNlB,cACCP,IACA,mBACA,QACA/C,6BAA6B8E,YAC7BN,KACA,CAAEM,UAAW,EAEf,CAGA,MAAM2F,SAAWvG,iBAAiBM,KAAK8E,OAAO,CAAEvG,KAEhD,GAAIyB,KAAKkG,OAAO,CAAE,CACjB,MAAMC,SAAWzG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KAEhD,GAAIxB,UAAUkJ,SAAUE,UAAW,OAAOF,SAE1C,OAAOnJ,eAAe,CAAE2H,MAAO,CAACwB,SAAUE,SAAS,AAAC,EACrD,CAIA,OAAOF,QACR,CAKA,IAAK,OAAQ,CACZ,MAAMF,IAAMC,iBAAiBhG,MAC7B,GAAI,CAAC+F,IAAK,CACTjH,cACCP,IACA,mBACA,QACA/C,6BAA6B,QAC7BwE,KACA,CAAEM,WAAY,MAAO,GAGtB,MAAM8F,MAAQ7H,IAAIE,OAAO,AACzBF,CAAAA,IAAIE,OAAO,CAAG,CAAC,EACfiB,iBAAiBM,KAAK8E,OAAO,CAAEvG,IAC/BA,CAAAA,IAAIE,OAAO,CAAG2H,MACd,GAAIpG,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KACjD,MAAO,CAAE0B,KAAM,QAAS,CACzB,CAEA,MAAMuC,iBAAmBjB,iCAAiCwE,IAAKxH,IAAKyB,MACpE,GAAI,CAACwC,iBAAkB,CAEtB,MAAM4D,MAAQ7H,IAAIE,OAAO,AACzBF,CAAAA,IAAIE,OAAO,CAAG,CAAC,EACfiB,iBAAiBM,KAAK8E,OAAO,CAAEvG,IAC/BA,CAAAA,IAAIE,OAAO,CAAG2H,MACd,GAAIpG,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KACjD,MAAO,CAAE0B,KAAM,QAAS,CACzB,CAGA,MAAMmC,WAAaxF,kBAAkB4F,iBAAkBjE,IAAIC,IAAI,EAC/D,GAAI,CAAC4D,WAAY,CAChBtD,cACCP,IACA,gBACA,QACA5C,0BACC,OACA,WACAkG,gBAAgBW,mBAEjBxC,KACA,CACCM,WAAY,OACZa,SAAU,QACVC,OAAQS,gBAAgBW,iBACzB,GAGD,MAAM4D,MAAQ7H,IAAIE,OAAO,AACzBF,CAAAA,IAAIE,OAAO,CAAG,CAAC,EACfiB,iBAAiBM,KAAK8E,OAAO,CAAEvG,IAC/BA,CAAAA,IAAIE,OAAO,CAAG2H,MACd,GAAIpG,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KACjD,MAAO,CAAE0B,KAAM,QAAS,CACzB,CAGA,MAAMmG,MAAQ7H,IAAIE,OAAO,AACzBF,CAAAA,IAAIE,OAAO,CAAG2D,WACd1C,iBAAiBM,KAAK8E,OAAO,CAAEvG,IAC/BA,CAAAA,IAAIE,OAAO,CAAG2H,MAGd,GAAIpG,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KAGjD,MAAO,CAAE0B,KAAM,QAAS,CACzB,CAKA,IAAK,OAAQ,CACZ,MAAM8F,IAAMC,iBAAiBhG,MAC7B,GAAI,CAAC+F,IAAK,CACTjH,cACCP,IACA,mBACA,QACA/C,6BAA6B,QAC7BwE,KACA,CAAEM,WAAY,MAAO,GAGtB,MAAM8F,MAAQ7H,IAAIE,OAAO,AACzBF,CAAAA,IAAIE,OAAO,CAAG,CAAC,EACf,MAAM4H,OAAS3G,iBAAiBM,KAAK8E,OAAO,CAAEvG,IAC9CA,CAAAA,IAAIE,OAAO,CAAG2H,MACd,GAAIpG,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KACjD,OAAO8H,MACR,CAEA,MAAMC,YAAc/E,iCAAiCwE,IAAKxH,IAAKyB,MAE/D,MAAMoG,MAAQ7H,IAAIE,OAAO,AACzBF,CAAAA,IAAIE,OAAO,CAAG6H,aAAe,CAAC,EAC9B,MAAMD,OAAS3G,iBAAiBM,KAAK8E,OAAO,CAAEvG,IAC9CA,CAAAA,IAAIE,OAAO,CAAG2H,MAGd,GAAIpG,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KAEjD,OAAO8H,MACR,CAGA,QAAS,CACR,MAAMzF,OAASrC,IAAII,OAAO,EAAEkC,IAAIP,YAChC,GAAIM,OAAQ,CAEX,IAAK,MAAMsD,SAASlE,KAAKI,MAAM,CAAE,CAChCmB,iCACC2C,MACA3F,IACAyB,KAEF,CAEAN,iBAAiBM,KAAK8E,OAAO,CAAEvG,KAC/B,GAAIyB,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KACjD,OAAOqC,OAAOkB,UAAU,EAAI,CAAE7B,KAAM,QAAS,CAC9C,CAGAnB,cACCP,IACA,iBACA,UACA1C,2BAA2ByE,YAC3BN,KACA,CAAEM,UAAW,GAGdZ,iBAAiBM,KAAK8E,OAAO,CAAEvG,KAC/B,GAAIyB,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KACjD,MAAO,CAAE0B,KAAM,QAAS,CACzB,CACD,CACD,CAeA,SAASsB,iCACRsC,IAAwB,CACxBtF,GAAoB,CAEpBuF,UAAyB,EAGzB,GAAItH,iBAAiBqH,MAAO,CAC3B,OAAOtF,IAAIE,OAAO,AACnB,CAGA,GAAIoF,KAAK5D,IAAI,GAAK,gBAAiB,CAClC,OAAOsG,qBAAqB1C,KAA+BtF,IAAKuF,WACjE,CAEA,MAAM9B,SAAW9F,oBAAoB2H,MACrC,GAAI7B,SAASzC,MAAM,GAAK,EAAG,CAE1B,GAAIsE,KAAK5D,IAAI,GAAK,gBAAiB,MAAO,CAAEA,KAAM,QAAS,EAC3D,GAAI4D,KAAK5D,IAAI,GAAK,gBAAiB,MAAO,CAAEA,KAAM,QAAS,EAC3D,GAAI4D,KAAK5D,IAAI,GAAK,iBAAkB,MAAO,CAAEA,KAAM,SAAU,EAC7D,GAAI4D,KAAK5D,IAAI,GAAK,cAAe,MAAO,CAAEA,KAAM,MAAO,EACvD,GAAI4D,KAAK5D,IAAI,GAAK,mBAAoB,MAAO,CAAC,EAE9CnB,cACCP,IACA,eACA,UACA3C,0BAA0BiI,KAAK5D,IAAI,EACnC6D,YAAcD,MAEf,OAAOxG,SACR,CAKA,KAAM,CAAE4E,aAAa,CAAEC,UAAU,CAAE,CAAGjG,4BAA4B+F,UAKlE,GAAI1F,oBAAoB2F,eAAgB,CACvC,MAAMuE,SAAWvE,cAAcc,IAAI,CAAC,KACpCjE,cACCP,IACA,sBACA,QACA7C,+BAA+B8K,UAC/B1C,YAAcD,KACd,CAAE5E,KAAMuH,QAAS,GAElB,OAAOnJ,SACR,CAIA,GAAId,eAAe0F,eAAgB,CAClC,GAAIC,aAAe,KAAM,CACxB,OAAOuE,0BAA0BvE,WAAY3D,IAAKuF,YAAcD,KACjE,CACA,OAAOtF,IAAIE,OAAO,AACnB,CAEA,GAAIyD,aAAe,KAAM,CAGxB,OAAOwE,sBACNzE,cACAC,WACA3D,IACAuF,YAAcD,KAEhB,CAGA,MAAM9B,SAAWlF,kBAAkB0B,IAAIE,OAAO,CAAEwD,eAChD,GAAIF,WAAa1E,UAAW,CAC3B,MAAMmJ,SAAWvE,cAAcc,IAAI,CAAC,KACpC,MAAMU,oBAAsBxG,uBAAuBsB,IAAIE,OAAO,EAC9DK,cACCP,IACA,mBACA,QACA9C,8BAA8B+K,SAAU/C,qBACxCK,YAAcD,KACd,CAAE5E,KAAMuH,SAAU/C,mBAAoB,GAEvC,OAAOpG,SACR,CAEA,OAAO0E,QACR,CAiBA,SAAS0E,0BACRvE,UAAkB,CAClB3D,GAAoB,CACpBwF,IAAkB,EAGlB,GAAI,CAACxF,IAAIH,iBAAiB,CAAE,CAC3BU,cACCP,IACA,6BACA,QACA,CAAC,gBAAgB,EAAE2D,WAAW,4DAA4D,CAAC,CAC3F6B,KACA,CAAE9E,KAAM,CAAC,MAAM,EAAEiD,WAAW,CAAC,CAAEA,UAAW,GAE3C,OAAO7E,SACR,CAGA,MAAM8B,SAAWZ,IAAIH,iBAAiB,CAAC8D,WAAW,CAClD,GAAI,CAAC/C,SAAU,CACdL,cACCP,IACA,qBACA,QACA,CAAC,gBAAgB,EAAE2D,WAAW,wBAAwB,EAAEA,WAAW,yCAAyC,CAAC,CAC7G6B,KACA,CAAE9E,KAAM,CAAC,MAAM,EAAEiD,WAAW,CAAC,CAAEA,UAAW,GAE3C,OAAO7E,SACR,CAKA,OAAO8B,QACR,CAiBA,SAASuH,sBACRzE,aAAuB,CACvBC,UAAkB,CAClB3D,GAAoB,CACpBwF,IAAkB,EAElB,MAAMyC,SAAWvE,cAAcc,IAAI,CAAC,KAGpC,GAAI,CAACxE,IAAIH,iBAAiB,CAAE,CAC3BU,cACCP,IACA,6BACA,QACA,CAAC,UAAU,EAAEiI,SAAS,CAAC,EAAEtE,WAAW,4DAA4D,CAAC,CACjG6B,KACA,CAAE9E,KAAM,CAAC,EAAEuH,SAAS,CAAC,EAAEtE,WAAW,CAAC,CAAEA,UAAW,GAEjD,OAAO7E,SACR,CAGA,MAAM8B,SAAWZ,IAAIH,iBAAiB,CAAC8D,WAAW,CAClD,GAAI,CAAC/C,SAAU,CACdL,cACCP,IACA,qBACA,QACA,CAAC,UAAU,EAAEiI,SAAS,CAAC,EAAEtE,WAAW,wBAAwB,EAAEA,WAAW,yCAAyC,CAAC,CACnH6B,KACA,CAAE9E,KAAM,CAAC,EAAEuH,SAAS,CAAC,EAAEtE,WAAW,CAAC,CAAEA,UAAW,GAEjD,OAAO7E,SACR,CAWA,MAAM+E,WAAaxF,kBAAkBuC,SAAUZ,IAAIC,IAAI,EACvD,GAAI4D,aAAe/E,UAAW,CAE7B,MAAM0E,SAAWlF,kBAAkBuF,WAAYH,eAC/C,GAAIF,WAAa1E,UAAW,CAC3B,MAAMoG,oBAAsBxG,uBAAuBmF,YACnDtD,cACCP,IACA,gCACA,QACA,CAAC,UAAU,EAAEiI,SAAS,oDAAoD,EAAEtE,WAAW,CAAC,CACxF6B,KACA,CACC9E,KAAMuH,SACNtE,WACAuB,mBACD,GAED,OAAOpG,SACR,CAEA,MAAO,CAAE4C,KAAM,QAASyD,MAAO3B,QAAS,CACzC,CAIA,MAAMA,SAAWlF,kBAAkBsC,SAAU8C,eAC7C,GAAIF,WAAa1E,UAAW,CAC3B,MAAMoG,oBAAsBxG,uBAAuBkC,UACnDL,cACCP,IACA,gCACA,QACA,CAAC,UAAU,EAAEiI,SAAS,8CAA8C,EAAEtE,WAAW,CAAC,CAClF6B,KACA,CACC9E,KAAMuH,SACNtE,WACAuB,mBACD,GAED,OAAOpG,SACR,CAEA,OAAO0E,QACR,CAaA,SAASO,aAAakC,MAAmB,EACxC,GAAIA,OAAOvE,IAAI,GAAK,OAAQ,OAAOuE,OAEnC,GAAI,OAAOA,OAAOvE,IAAI,GAAK,SAAU,CACpC,MAAO,CAAE,GAAGuE,MAAM,CAAEvE,KAAM,CAACuE,OAAOvE,IAAI,CAAE,OAAO,AAAC,CACjD,CAEA,GAAI0C,MAAMC,OAAO,CAAC4B,OAAOvE,IAAI,EAAG,CAC/B,GAAIuE,OAAOvE,IAAI,CAAC4C,QAAQ,CAAC,QAAS,OAAO2B,OACzC,MAAO,CAAE,GAAGA,MAAM,CAAEvE,KAAM,IAAIuE,OAAOvE,IAAI,CAAE,OAAO,AAAC,CACpD,CAGA,OAAOnD,eAAe,CAAE2H,MAAO,CAACD,OAAQ,CAAEvE,KAAM,MAAO,EAAE,AAAC,EAC3D,CAaA,SAASoC,oBAAoBmC,MAAmB,CAAExC,QAAkB,EACnE,IAAK,IAAIX,EAAI,EAAGA,GAAKW,SAASzC,MAAM,CAAE8B,IAAK,CAC1C,GAAI,CAAC1E,mBAAmB6H,OAAQxC,SAAS2E,KAAK,CAAC,EAAGtF,IAAK,OAAO,KAC/D,CACA,OAAO,IACR,CA2BA,SAASkF,qBACR1C,IAA2B,CAC3BtF,GAAoB,CACpBuF,UAAyB,EAEzB,MAAMxD,WAAaC,kBAAkBsD,KAAK5E,IAAI,EAO9C,GAAIqB,aAAevE,WAAWyE,eAAe,CAAE,CAC9C,OAAOoG,wBAAwB/C,KAAMtF,IAAKuF,WAC3C,CAGA,GAAIxD,aAAexE,eAAe4E,mBAAmB,CAAE,CACtD,OAAOkD,4BAA4BC,KAAMtF,IAAKuF,WAC/C,CAEA,MAAMlD,OAASrC,IAAII,OAAO,EAAEkC,IAAIP,YAChC,GAAI,CAACM,OAAQ,CACZ9B,cACCP,IACA,iBACA,UACA,CAAC,+BAA+B,EAAE+B,WAAW,6BAA6B,CAAC,CAC3EwD,YAAcD,KACd,CAAEvD,UAAW,GAEd,MAAO,CAAEL,KAAM,QAAS,CACzB,CAEA,MAAMa,aAAeF,OAAOR,MAAM,CAGlC,GAAIU,aAAc,CACjB,MAAMC,cAAgBD,aAAaE,MAAM,CAAC,AAACC,GAAM,CAACA,EAAEC,QAAQ,EAAE3B,MAAM,CACpE,GAAIsE,KAAKzD,MAAM,CAACb,MAAM,CAAGwB,cAAe,CACvCjC,cACCP,IACA,mBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,mBAAmB,EAAES,cAAc,sBAAsB,EAAE8C,KAAKzD,MAAM,CAACb,MAAM,CAAC,CAAC,CACrGuE,YAAcD,KACd,CACCvD,WACAa,SAAU,CAAC,EAAEJ,cAAc,YAAY,CAAC,CACxCK,OAAQ,CAAC,EAAEyC,KAAKzD,MAAM,CAACb,MAAM,CAAC,YAAY,CAAC,AAC5C,EAEF,CACD,CAGA,IAAK,IAAI8B,EAAI,EAAGA,EAAIwC,KAAKzD,MAAM,CAACb,MAAM,CAAE8B,IAAK,CAC5C,MAAMC,eAAiBC,iCACtBsC,KAAKzD,MAAM,CAACiB,EAAE,CACd9C,IACAuF,YAAcD,MAGf,MAAMrC,YAAcV,cAAc,CAACO,EAAE,CACrC,GAAIC,gBAAkBE,aAAavB,KAAM,CACxC,MAAMwB,aAAeD,YAAYvB,IAAI,CACrC,GAAI,CAACyB,sBAAsBJ,eAAgBG,cAAe,CACzD,MAAME,UAAYH,YAAYI,IAAI,CAClC9C,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,aAAa,EAAEqB,UAAU,UAAU,EAAEE,gBAAgBJ,cAAc,UAAU,EAAEI,gBAAgBP,gBAAgB,CAAC,CACtIwC,YAAcD,KACd,CACCvD,WACAa,SAAUU,gBAAgBJ,cAC1BL,OAAQS,gBAAgBP,eACzB,EAEF,CACD,CACD,CAEA,OAAOV,OAAOkB,UAAU,EAAI,CAAE7B,KAAM,QAAS,CAC9C,CAOA,SAAS2G,wBACR/C,IAA2B,CAC3BtF,GAAoB,CACpBuF,UAAyB,EAEzB,MAAMxD,WAAavE,WAAWyE,eAAe,CAC7C,MAAMuD,KAAOD,YAAcD,KAG3B,GAAIA,KAAKzD,MAAM,CAACb,MAAM,CAAG,EAAG,CAC3BT,cACCP,IACA,mBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,0CAA0C,EAAEuD,KAAKzD,MAAM,CAACb,MAAM,CAAC,CAAC,CACtFwE,KACA,CACCzD,WACAa,SAAU,gBACVC,OAAQ,CAAC,EAAEyC,KAAKzD,MAAM,CAACb,MAAM,CAAC,YAAY,CAAC,AAC5C,GAED,MAAO,CAAEU,KAAM,OAAQ,CACxB,CAGA,MAAMsC,eAAiBsB,KAAKzD,MAAM,CAAC,EAAE,CACrC,MAAMoC,iBAAmBjB,iCACxBgB,eACAhE,IACAwF,MAGD,GAAI,CAACvB,iBAAkB,CACtB,MAAO,CAAEvC,KAAM,OAAQ,CACxB,CAGA,MAAMmC,WAAaxF,kBAAkB4F,iBAAkBjE,IAAIC,IAAI,EAC/D,GAAI,CAAC4D,WAAY,CAChBtD,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,mDAAmD,EAAEuB,gBAAgBW,kBAAkB,CAAC,CAC9GuB,KACA,CACCzD,WACAa,SAAU,QACVC,OAAQS,gBAAgBW,iBACzB,GAED,MAAO,CAAEvC,KAAM,OAAQ,CACxB,CAKA,IAAIwC,oBAAsBL,WAC1B,MAAMM,SAAWD,oBAAoBxC,IAAI,CACzC,GACCyC,WAAa,SACZC,MAAMC,OAAO,CAACF,WAAaA,SAASG,QAAQ,CAAC,SAC7C,CACD,MAAMC,WAAalG,kBAAkB6F,oBAAqBlE,IAAIC,IAAI,EAClE,GAAIsE,WAAY,CACfL,oBAAsBK,UACvB,CACD,CAEA,MAAME,kBAAoBP,oBAAoBxC,IAAI,CAClD,MAAMgD,SACLD,oBAAsB,UACrBL,MAAMC,OAAO,CAACI,oBACdA,kBAAkBH,QAAQ,CAAC,WAC3B,CAACG,mBAAqBP,oBAAoBS,UAAU,GAAK7F,UAE3D,GAAI,CAAC4F,UAAYD,oBAAsB3F,UAAW,CACjDyB,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,8DAA8D,EAAEuB,gBAAgBY,qBAAqB,CAAC,CAAC,CAC7HsB,KACA,CACCzD,WACAa,SAAU,SACVC,OAAQS,gBAAgBY,oBACzB,GAED,MAAO,CAAExC,KAAM,OAAQ,CACxB,CAGA,MAAMkD,aAAeU,KAAKzD,MAAM,CAAC,EAAE,CACnC,IAAIgD,aAEJ,GAAID,aAAalD,IAAI,GAAK,iBAAkB,CAC3C,MAAMoD,KAAO,AAACF,aAAwCG,QAAQ,CAC9DxE,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,gDAAgD,CAAC,CACtE,CAAC,KAAK,EAAEA,WAAW,IAAI,EAAE+C,KAAK,eAAe,EAAE/C,WAAW,GAAG,EAAE+C,KAAK,CAAC,CAAC,CACvEU,KACA,CACCzD,WACAa,SAAU,kCACVC,OAAQ,CAAC,gBAAgB,EAAEiC,KAAK,CAAC,CAAC,AACnC,GAED,MAAO,CAAEpD,KAAM,OAAQ,CACxB,CAEA,GAAIkD,aAAalD,IAAI,GAAK,gBAAiB,CAC1CmD,aAAe,AAACD,aAAuCI,KAAK,AAC7D,CAEA,GAAI,CAACH,aAAc,CAClBtE,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,gEAAgE,EAAE6C,aAAalD,IAAI,CAAC,CAAC,CAC3G8D,KACA,CACCzD,WACAa,SAAU,kCACVC,OAAQ+B,aAAalD,IAAI,AAC1B,GAED,MAAO,CAAEA,KAAM,OAAQ,CACxB,CAGA,MAAMuD,eAAiB3G,kBAAkB4F,oBAAqB,CAACW,aAAa,EAC5E,GAAI,CAACI,eAAgB,CACpB,MAAMC,oBAAsBxG,uBAAuBwF,qBACnD3D,cACCP,IACA,mBACA,QACA9C,8BAA8B2H,aAAcK,qBAC5CM,KACA,CACC9E,KAAMmE,aACNK,mBACD,GAED,MAAO,CAAExD,KAAM,OAAQ,CACxB,CAGA,MAAO,CAAEA,KAAM,QAASyD,MAAOF,cAAe,CAC/C,CAEA,SAASwC,iBACRhG,IAA4B,EAE5B,OAAOA,KAAKI,MAAM,CAAC,EAAE,AACtB,CAKA,SAAS0F,mBAAmB9F,IAA4B,EACvD,GAAIA,KAAKf,IAAI,CAACgB,IAAI,GAAK,iBAAkB,CACxC,OAAO,AAACD,KAAKf,IAAI,CAA4BqE,QAAQ,AACtD,CACA,MAAO,EACR,CAMA,SAAS/C,kBAAkBsD,IAAwB,EAClD,GAAIA,KAAK5D,IAAI,GAAK,iBAAkB,CACnC,OAAO,AAAC4D,KAAgCP,QAAQ,AACjD,CACA,MAAO,EACR,CAWA,SAASxE,cACRP,GAAoB,CACpBsI,IAAoB,CACpB/G,QAA6B,CAC7BgH,OAAe,CACf/C,IAAmB,CACnBgD,OAA2B,EAE3B,MAAMC,WAAiC,CAAElH,SAAU+G,KAAMC,OAAQ,EAGjE,GAAI/C,MAAQ,QAASA,MAAQA,KAAKlF,GAAG,CAAE,CACtCmI,WAAWnI,GAAG,CAAG,CAChBoI,MAAO,CAAEC,KAAMnD,KAAKlF,GAAG,CAACoI,KAAK,CAACC,IAAI,CAAEC,OAAQpD,KAAKlF,GAAG,CAACoI,KAAK,CAACE,MAAM,AAAC,EAClEC,IAAK,CAAEF,KAAMnD,KAAKlF,GAAG,CAACuI,GAAG,CAACF,IAAI,CAAEC,OAAQpD,KAAKlF,GAAG,CAACuI,GAAG,CAACD,MAAM,AAAC,CAC7D,CAEAH,CAAAA,WAAWK,MAAM,CAAGrK,qBAAqBuB,IAAIV,QAAQ,CAAEmJ,WAAWnI,GAAG,CACtE,CAEA,GAAIkI,QAAS,CACZC,WAAWD,OAAO,CAAGA,OACtB,CAEAxI,IAAIG,WAAW,CAACyF,IAAI,CAAC6C,WACtB,CAKA,SAASnF,gBAAgB2C,MAAmB,EAC3C,GAAIA,OAAOvE,IAAI,CAAE,CAChB,OAAO0C,MAAMC,OAAO,CAAC4B,OAAOvE,IAAI,EAAIuE,OAAOvE,IAAI,CAAC8C,IAAI,CAAC,OAASyB,OAAOvE,IAAI,AAC1E,CACA,GAAIuE,OAAOC,KAAK,CAAE,MAAO,aACzB,GAAID,OAAO8C,KAAK,CAAE,MAAO,aACzB,GAAI9C,OAAO+C,KAAK,CAAE,MAAO,aACzB,GAAI/C,OAAOgD,IAAI,CAAE,MAAO,OACxB,MAAO,SACR,CAKA,OAASrH,cAAc,CAAG"}
1
+ {"version":3,"sources":["../../src/analyzer.ts"],"sourcesContent":["import type { JSONSchema7 } from \"json-schema\";\nimport { dispatchAnalyze } from \"./dispatch.ts\";\nimport {\n\tcreateMissingArgumentMessage,\n\tcreatePropertyNotFoundMessage,\n\tcreateRootPathTraversalMessage,\n\tcreateTypeMismatchMessage,\n\tcreateUnanalyzableMessage,\n\tcreateUnknownHelperMessage,\n} from \"./errors\";\nimport { DefaultHelpers } from \"./helpers/default-helpers.ts\";\nimport { MapHelpers } from \"./helpers/map-helpers.ts\";\nimport {\n\tdetectLiteralType,\n\textractExpressionIdentifier,\n\textractPathSegments,\n\tgetEffectiveBody,\n\tgetEffectivelySingleBlock,\n\tgetEffectivelySingleExpression,\n\tisDataExpression,\n\tisRootPathTraversal,\n\tisRootSegments,\n\tisThisExpression,\n\tparse,\n} from \"./parser\";\nimport {\n\tfindConditionalSchemaLocations,\n\tisPropertyRequired,\n\tresolveArrayItems,\n\tresolveSchemaPath,\n\tsimplifySchema,\n} from \"./schema-resolver\";\nimport type {\n\tAnalysisResult,\n\tDiagnosticCode,\n\tDiagnosticDetails,\n\tHelperDefinition,\n\tTemplateDiagnostic,\n\tTemplateInput,\n} from \"./types.ts\";\nimport {\n\tdeepEqual,\n\textractSourceSnippet,\n\tgetSchemaPropertyNames,\n} from \"./utils\";\n\n// ─── Static Analyzer ─────────────────────────────────────────────────────────\n// Static analysis of a Handlebars template against a JSON Schema v7\n// describing the available context.\n//\n// Merged architecture (v2):\n// A single AST traversal performs both **validation** and **return type\n// inference** simultaneously. This eliminates duplication between the former\n// `validate*` and `infer*` functions and improves performance by avoiding\n// a double traversal.\n//\n// Context:\n// The analysis context uses a **save/restore** pattern instead of creating\n// new objects on each recursion (`{ ...ctx, current: X }`). This reduces\n// GC pressure for deeply nested templates.\n//\n// ─── Template Identifiers ────────────────────────────────────────────────────\n// The `{{key:N}}` syntax allows referencing a variable from a specific\n// schema, identified by an integer N. The optional `identifierSchemas`\n// parameter provides a mapping `{ [id]: JSONSchema7 }`.\n//\n// Resolution rules:\n// - `{{meetingId}}` → validated against `inputSchema` (standard behavior)\n// - `{{meetingId:1}}` → validated against `identifierSchemas[1]`\n// - `{{meetingId:1}}` without `identifierSchemas[1]` → error\n\n// ─── Internal Types ──────────────────────────────────────────────────────────\n\n/** Context passed recursively during AST traversal */\ninterface AnalysisContext {\n\t/** Root schema (for resolving $refs) */\n\troot: JSONSchema7;\n\t/** Current context schema (changes with #each, #with) — mutated via save/restore */\n\tcurrent: JSONSchema7;\n\t/** Diagnostics accumulator */\n\tdiagnostics: TemplateDiagnostic[];\n\t/** Full template source (for extracting error snippets) */\n\ttemplate: string;\n\t/** Schemas by template identifier (for the {{key:N}} syntax) */\n\tidentifierSchemas?: Record<number, JSONSchema7>;\n\t/** Registered custom helpers (for static analysis) */\n\thelpers?: Map<string, HelperDefinition>;\n\t/**\n\t * Explicit coercion schema provided by the caller.\n\t * When set, static literal values like `\"123\"` will respect the type\n\t * declared in this schema instead of being auto-detected by\n\t * `detectLiteralType`. Unlike the previous `expectedOutputType`,\n\t * this is NEVER derived from the inputSchema — it must be explicitly\n\t * provided via the `coerceSchema` option.\n\t */\n\tcoerceSchema?: JSONSchema7;\n}\n\n// ─── Public API ──────────────────────────────────────────────────────────────\n\n/** Options for the standalone `analyze()` function */\nexport interface AnalyzeOptions {\n\t/** Schemas by template identifier (for the `{{key:N}}` syntax) */\n\tidentifierSchemas?: Record<number, JSONSchema7>;\n\t/**\n\t * Explicit coercion schema. When provided, static literal values\n\t * will respect the types declared in this schema instead of being\n\t * auto-detected by `detectLiteralType`.\n\t *\n\t * This schema is independent from the `inputSchema` (which describes\n\t * available variables) — it only controls the output type inference\n\t * for static content.\n\t */\n\tcoerceSchema?: JSONSchema7;\n\t/**\n\t * When `true`, properties whose values contain Handlebars expressions\n\t * (i.e. any `{{…}}` syntax) are excluded from the output schema.\n\t *\n\t * Only the properties with static values (literals, plain strings\n\t * without expressions) are retained. This is useful when you want\n\t * the output schema to describe only the known, compile-time-constant\n\t * portion of the template.\n\t *\n\t * This option only has an effect on **object** and **array** templates.\n\t * A root-level string template with expressions is analyzed normally\n\t * (there is no parent property to exclude it from).\n\t *\n\t * @default false\n\t */\n\texcludeTemplateExpression?: boolean;\n}\n\n// ─── Coerce Text Value ──────────────────────────────────────────────────────\n\n/**\n * Parses a raw text string into the appropriate JS primitive according to the\n * target JSON Schema type. Used when `coerceSchema` overrides the default\n * `detectLiteralType` inference for static literal values.\n */\nfunction coerceTextValue(\n\ttext: string,\n\ttargetType: \"string\" | \"number\" | \"integer\" | \"boolean\" | \"null\",\n): string | number | boolean | null | undefined {\n\tswitch (targetType) {\n\t\tcase \"number\":\n\t\tcase \"integer\": {\n\t\t\tif (text === \"\") return undefined;\n\t\t\tconst num = Number(text);\n\t\t\tif (Number.isNaN(num)) return undefined;\n\t\t\tif (targetType === \"integer\" && !Number.isInteger(num)) return undefined;\n\t\t\treturn num;\n\t\t}\n\t\tcase \"boolean\": {\n\t\t\tconst lower = text.toLowerCase();\n\t\t\tif (lower === \"true\") return true;\n\t\t\tif (lower === \"false\") return false;\n\t\t\treturn undefined;\n\t\t}\n\t\tcase \"null\":\n\t\t\treturn null;\n\t\tdefault:\n\t\t\treturn text;\n\t}\n}\n\n/**\n * Statically analyzes a template against a JSON Schema v7 describing the\n * available context.\n *\n * Backward-compatible version — parses the template internally.\n * Uses `dispatchAnalyze` for the recursive array/object/literal dispatching,\n * delegating only the string (template) case to `analyzeFromAst`.\n *\n * @param template - The template string (e.g. `\"Hello {{user.name}}\"`)\n * @param inputSchema - JSON Schema v7 describing the available variables\n * @param options - (optional) Analysis options (identifierSchemas, coerceSchema)\n * @returns An `AnalysisResult` containing validity, diagnostics, and the\n * inferred output schema.\n */\nexport function analyze(\n\ttemplate: TemplateInput,\n\tinputSchema: JSONSchema7 = {},\n\toptions?: AnalyzeOptions,\n): AnalysisResult {\n\treturn dispatchAnalyze(\n\t\ttemplate,\n\t\toptions,\n\t\t// String handler — parse and analyze the AST\n\t\t(tpl, coerceSchema) => {\n\t\t\tconst ast = parse(tpl);\n\t\t\treturn analyzeFromAst(ast, tpl, inputSchema, {\n\t\t\t\tidentifierSchemas: options?.identifierSchemas,\n\t\t\t\tcoerceSchema,\n\t\t\t});\n\t\t},\n\t\t// Recursive handler — re-enter analyze() for child elements\n\t\t(child, childOptions) => analyze(child, inputSchema, childOptions),\n\t);\n}\n\n/**\n * Statically analyzes a template from an already-parsed AST.\n *\n * This is the internal function used by `Typebars.compile()` and\n * `CompiledTemplate.analyze()` to avoid costly re-parsing.\n *\n * @param ast - The already-parsed Handlebars AST\n * @param template - The template source (for error snippets)\n * @param inputSchema - JSON Schema v7 describing the available variables\n * @param options - Additional options\n * @returns An `AnalysisResult`\n */\nexport function analyzeFromAst(\n\tast: hbs.AST.Program,\n\ttemplate: string,\n\tinputSchema: JSONSchema7 = {},\n\toptions?: {\n\t\tidentifierSchemas?: Record<number, JSONSchema7>;\n\t\thelpers?: Map<string, HelperDefinition>;\n\t\t/**\n\t\t * Explicit coercion schema. When set, static literal values will\n\t\t * respect the types declared in this schema instead of auto-detecting.\n\t\t * Unlike `expectedOutputType`, this is NEVER derived from inputSchema.\n\t\t */\n\t\tcoerceSchema?: JSONSchema7;\n\t},\n): AnalysisResult {\n\t// ── Initialize the diagnostic context FIRST ────────────────────────\n\tconst ctx: AnalysisContext = {\n\t\troot: inputSchema,\n\t\tcurrent: inputSchema,\n\t\tdiagnostics: [],\n\t\ttemplate,\n\t\tidentifierSchemas: options?.identifierSchemas,\n\t\thelpers: options?.helpers,\n\t\tcoerceSchema: options?.coerceSchema,\n\t};\n\n\t// ── Detect unsupported schema features as diagnostics ──────────────\n\t// Conditional schemas (if/then/else) are non-resolvable without runtime\n\t// data. Instead of throwing, we collect structured diagnostics so the\n\t// caller receives a standard AnalysisResult.\n\tconst conditionalLocations = findConditionalSchemaLocations(inputSchema);\n\tfor (const loc of conditionalLocations) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNSUPPORTED_SCHEMA\",\n\t\t\t\"error\",\n\t\t\t`Unsupported JSON Schema feature: \"${loc.keyword}\" at \"${loc.schemaPath}\". ` +\n\t\t\t\t\"Conditional schemas (if/then/else) cannot be resolved during static analysis \" +\n\t\t\t\t\"because they depend on runtime data. Consider using oneOf/anyOf combinators instead.\",\n\t\t\tundefined,\n\t\t\t{ path: loc.schemaPath },\n\t\t);\n\t}\n\n\tif (options?.identifierSchemas) {\n\t\tfor (const [id, idSchema] of Object.entries(options.identifierSchemas)) {\n\t\t\tconst idLocations = findConditionalSchemaLocations(\n\t\t\t\tidSchema,\n\t\t\t\t`/identifierSchemas/${id}`,\n\t\t\t);\n\t\t\tfor (const loc of idLocations) {\n\t\t\t\taddDiagnostic(\n\t\t\t\t\tctx,\n\t\t\t\t\t\"UNSUPPORTED_SCHEMA\",\n\t\t\t\t\t\"error\",\n\t\t\t\t\t`Unsupported JSON Schema feature: \"${loc.keyword}\" at \"${loc.schemaPath}\". ` +\n\t\t\t\t\t\t\"Conditional schemas (if/then/else) cannot be resolved during static analysis \" +\n\t\t\t\t\t\t\"because they depend on runtime data. Consider using oneOf/anyOf combinators instead.\",\n\t\t\t\t\tundefined,\n\t\t\t\t\t{ path: loc.schemaPath },\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t}\n\n\t// If unsupported schemas were found, return early with valid: false\n\tif (ctx.diagnostics.length > 0) {\n\t\treturn {\n\t\t\tvalid: false,\n\t\t\tdiagnostics: ctx.diagnostics,\n\t\t\toutputSchema: {},\n\t\t};\n\t}\n\n\t// Single pass: type inference + validation in one traversal.\n\tconst outputSchema = inferProgramType(ast, ctx);\n\n\tconst hasErrors = ctx.diagnostics.some((d) => d.severity === \"error\");\n\n\treturn {\n\t\tvalid: !hasErrors,\n\t\tdiagnostics: ctx.diagnostics,\n\t\toutputSchema: simplifySchema(outputSchema),\n\t};\n}\n\n// ─── Unified AST Traversal ───────────────────────────────────────────────────\n// A single set of functions handles both validation (emitting diagnostics)\n// and type inference (returning a JSONSchema7).\n//\n// Main functions:\n// - `inferProgramType` — entry point for a Program (template body or block)\n// - `processStatement` — dispatches a statement (validation side-effects)\n// - `processMustache` — handles a MustacheStatement (expression or inline helper)\n// - `inferBlockType` — handles a BlockStatement (if, each, with, custom…)\n\n/**\n * Dispatches the processing of an individual statement.\n *\n * Called by `inferProgramType` in the \"mixed template\" case to validate\n * each statement while ignoring the returned type (the result is always\n * `string` for a mixed template).\n *\n * @returns The inferred schema for this statement, or `undefined` for\n * statements with no semantics (ContentStatement, CommentStatement).\n */\nfunction processStatement(\n\tstmt: hbs.AST.Statement,\n\tctx: AnalysisContext,\n): JSONSchema7 | undefined {\n\tswitch (stmt.type) {\n\t\tcase \"ContentStatement\":\n\t\tcase \"CommentStatement\":\n\t\t\t// Static text or comment — nothing to validate, no type to infer\n\t\t\treturn undefined;\n\n\t\tcase \"MustacheStatement\":\n\t\t\treturn processMustache(stmt as hbs.AST.MustacheStatement, ctx);\n\n\t\tcase \"BlockStatement\":\n\t\t\treturn inferBlockType(stmt as hbs.AST.BlockStatement, ctx);\n\n\t\tdefault:\n\t\t\t// Unrecognized AST node — emit a warning rather than an error\n\t\t\t// to avoid blocking on future Handlebars extensions.\n\t\t\taddDiagnostic(\n\t\t\t\tctx,\n\t\t\t\t\"UNANALYZABLE\",\n\t\t\t\t\"warning\",\n\t\t\t\t`Unsupported AST node type: \"${stmt.type}\"`,\n\t\t\t\tstmt,\n\t\t\t);\n\t\t\treturn undefined;\n\t}\n}\n\n/**\n * Processes a MustacheStatement `{{expression}}` or `{{helper arg}}`.\n *\n * Distinguishes two cases:\n * 1. **Simple expression** (`{{name}}`, `{{user.age}}`) — resolution in the schema\n * 2. **Inline helper** (`{{uppercase name}}`) — params > 0 or hash present\n *\n * @returns The inferred schema for this expression\n */\nfunction processMustache(\n\tstmt: hbs.AST.MustacheStatement,\n\tctx: AnalysisContext,\n): JSONSchema7 {\n\t// Sub-expressions (nested helpers) are not supported for static\n\t// analysis — emit a warning.\n\tif (stmt.path.type === \"SubExpression\") {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNANALYZABLE\",\n\t\t\t\"warning\",\n\t\t\t\"Sub-expressions are not statically analyzable\",\n\t\t\tstmt,\n\t\t);\n\t\treturn {};\n\t}\n\n\t// ── Inline helper detection ──────────────────────────────────────────────\n\t// If the MustacheStatement has parameters or a hash, it's a helper call\n\t// (e.g. `{{uppercase name}}`), not a simple expression.\n\tif (stmt.params.length > 0 || stmt.hash) {\n\t\tconst helperName = getExpressionName(stmt.path);\n\n\t\t// ── Special-case: map helper ─────────────────────────────────────\n\t\t// The `map` helper requires deep static analysis that the generic\n\t\t// helper path cannot perform: it must resolve the first argument as\n\t\t// an array-of-objects schema, then resolve the second argument (a\n\t\t// property name) within the item schema to infer the output type\n\t\t// `{ type: \"array\", items: <property schema> }`.\n\t\tif (helperName === MapHelpers.MAP_HELPER_NAME) {\n\t\t\treturn processMapHelper(stmt, ctx);\n\t\t}\n\n\t\t// ── Special-case: default helper ─────────────────────────────────\n\t\t// The `default` helper requires deep static analysis: the return\n\t\t// type is the union of all argument types, and the chain must\n\t\t// terminate with a guaranteed (non-optional) value.\n\t\tif (helperName === DefaultHelpers.DEFAULT_HELPER_NAME) {\n\t\t\treturn processDefaultHelper(stmt, ctx);\n\t\t}\n\n\t\t// Check if the helper is registered\n\t\tconst helper = ctx.helpers?.get(helperName);\n\t\tif (helper) {\n\t\t\tconst helperParams = helper.params;\n\n\t\t\t// ── Check the number of required parameters ──────────────\n\t\t\tif (helperParams) {\n\t\t\t\tconst requiredCount = helperParams.filter((p) => !p.optional).length;\n\t\t\t\tif (stmt.params.length < requiredCount) {\n\t\t\t\t\taddDiagnostic(\n\t\t\t\t\t\tctx,\n\t\t\t\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\t\t\t\"error\",\n\t\t\t\t\t\t`Helper \"${helperName}\" expects at least ${requiredCount} argument(s), but got ${stmt.params.length}`,\n\t\t\t\t\t\tstmt,\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\thelperName,\n\t\t\t\t\t\t\texpected: `${requiredCount} argument(s)`,\n\t\t\t\t\t\t\tactual: `${stmt.params.length} argument(s)`,\n\t\t\t\t\t\t},\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// ── Validate each parameter (existence + type) ───────────────\n\t\t\tfor (let i = 0; i < stmt.params.length; i++) {\n\t\t\t\tconst resolvedSchema = resolveExpressionWithDiagnostics(\n\t\t\t\t\tstmt.params[i] as hbs.AST.Expression,\n\t\t\t\t\tctx,\n\t\t\t\t\tstmt,\n\t\t\t\t);\n\n\t\t\t\t// Check type compatibility if the helper declares the\n\t\t\t\t// expected type for this parameter\n\t\t\t\tconst helperParam = helperParams?.[i];\n\t\t\t\tif (resolvedSchema && helperParam?.type) {\n\t\t\t\t\tconst expectedType = helperParam.type;\n\t\t\t\t\tif (!isParamTypeCompatible(resolvedSchema, expectedType)) {\n\t\t\t\t\t\tconst paramName = helperParam.name;\n\t\t\t\t\t\taddDiagnostic(\n\t\t\t\t\t\t\tctx,\n\t\t\t\t\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\t\t\t\t\"error\",\n\t\t\t\t\t\t\t`Helper \"${helperName}\" parameter \"${paramName}\" expects ${schemaTypeLabel(expectedType)}, but got ${schemaTypeLabel(resolvedSchema)}`,\n\t\t\t\t\t\t\tstmt,\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\thelperName,\n\t\t\t\t\t\t\t\texpected: schemaTypeLabel(expectedType),\n\t\t\t\t\t\t\t\tactual: schemaTypeLabel(resolvedSchema),\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn helper.returnType ?? { type: \"string\" };\n\t\t}\n\n\t\t// Unknown inline helper — warning\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_HELPER\",\n\t\t\t\"warning\",\n\t\t\t`Unknown inline helper \"${helperName}\" — cannot analyze statically`,\n\t\t\tstmt,\n\t\t\t{ helperName },\n\t\t);\n\t\treturn { type: \"string\" };\n\t}\n\n\t// ── Simple expression ────────────────────────────────────────────────────\n\tconst resolved = resolveExpressionWithDiagnostics(stmt.path, ctx, stmt) ?? {};\n\n\t// @data variables (@index, @first, @last, @key) are runtime-provided —\n\t// optionality checks against the input schema do not apply.\n\tif (isDataExpression(stmt.path)) {\n\t\treturn resolved;\n\t}\n\n\t// When the expression points to an optional property (not in `required`),\n\t// the output can be null at runtime. Wrap the resolved schema with null\n\t// so the output schema accurately reflects this.\n\t// $root returns the entire context — optionality does not apply.\n\tif (stmt.path.type === \"PathExpression\") {\n\t\tconst segments = extractPathSegments(stmt.path);\n\t\tif (segments.length > 0) {\n\t\t\tconst { cleanSegments, identifier } =\n\t\t\t\textractExpressionIdentifier(segments);\n\t\t\tif (!isRootSegments(cleanSegments)) {\n\t\t\t\tlet targetSchema =\n\t\t\t\t\tidentifier !== null\n\t\t\t\t\t\t? ctx.identifierSchemas?.[identifier]\n\t\t\t\t\t\t: ctx.current;\n\t\t\t\t// For aggregated identifiers (array schema), check optionality\n\t\t\t\t// within the items schema, not the array itself.\n\t\t\t\tif (targetSchema && identifier !== null) {\n\t\t\t\t\tconst itemSchema = resolveArrayItems(targetSchema, ctx.root);\n\t\t\t\t\tif (itemSchema !== undefined) {\n\t\t\t\t\t\ttargetSchema = itemSchema;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (targetSchema && !isPathFullyRequired(targetSchema, cleanSegments)) {\n\t\t\t\t\treturn withNullType(resolved);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn resolved;\n}\n\n// ─── map helper — special-case analysis ──────────────────────────────────────\n// Validates the arguments and infers the precise return type:\n// {{ map <arrayPath> <propertyName> }}\n// → { type: \"array\", items: <schema of the property in the item> }\n//\n// Validation rules:\n// 1. Exactly 2 arguments are required\n// 2. The first argument must resolve to an array schema\n// 3. The array items must be an object schema\n// 4. The second argument must be a string literal (property name)\n// 5. The property must exist in the item schema\n\nfunction processMapHelper(\n\tstmt: hbs.AST.MustacheStatement,\n\tctx: AnalysisContext,\n): JSONSchema7 {\n\tconst helperName = MapHelpers.MAP_HELPER_NAME;\n\n\t// ── 1. Check argument count ──────────────────────────────────────────\n\tif (stmt.params.length < 2) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" expects at least 2 argument(s), but got ${stmt.params.length}`,\n\t\t\tstmt,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"2 argument(s)\",\n\t\t\t\tactual: `${stmt.params.length} argument(s)`,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 2. Resolve the first argument (collection path) ──────────────────\n\tconst collectionExpr = stmt.params[0] as hbs.AST.Expression;\n\tconst collectionSchema = resolveExpressionWithDiagnostics(\n\t\tcollectionExpr,\n\t\tctx,\n\t\tstmt,\n\t);\n\n\tif (!collectionSchema) {\n\t\t// Path resolution failed — diagnostic already emitted\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 3. Validate that the collection is an array ──────────────────────\n\tconst itemSchema = resolveArrayItems(collectionSchema, ctx.root);\n\tif (!itemSchema) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" parameter \"collection\" expects an array, but got ${schemaTypeLabel(collectionSchema)}`,\n\t\t\tstmt,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"array\",\n\t\t\t\tactual: schemaTypeLabel(collectionSchema),\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 4. Validate that the items are objects ───────────────────────────\n\t// If the items are arrays (e.g. from a nested map), flatten one level\n\t// to match the runtime `flat(1)` behavior and use the inner items instead.\n\tlet effectiveItemSchema = itemSchema;\n\tconst itemType = effectiveItemSchema.type;\n\tif (\n\t\titemType === \"array\" ||\n\t\t(Array.isArray(itemType) && itemType.includes(\"array\"))\n\t) {\n\t\tconst innerItems = resolveArrayItems(effectiveItemSchema, ctx.root);\n\t\tif (innerItems) {\n\t\t\teffectiveItemSchema = innerItems;\n\t\t\t// Emit an informational warning so consumers know the flatten happened\n\t\t\taddDiagnostic(\n\t\t\t\tctx,\n\t\t\t\t\"MAP_IMPLICIT_FLATTEN\",\n\t\t\t\t\"warning\",\n\t\t\t\t`The \"${helperName}\" helper will automatically flatten the input array one level before mapping. ` +\n\t\t\t\t\t`The item type \"${Array.isArray(itemType) ? itemType.join(\" | \") : itemType}\" was unwrapped to its inner items schema.`,\n\t\t\t\tstmt,\n\t\t\t\t{\n\t\t\t\t\thelperName,\n\t\t\t\t\texpected: \"object\",\n\t\t\t\t\tactual: schemaTypeLabel(effectiveItemSchema),\n\t\t\t\t},\n\t\t\t);\n\t\t}\n\t}\n\n\tconst effectiveItemType = effectiveItemSchema.type;\n\tconst isObject =\n\t\teffectiveItemType === \"object\" ||\n\t\t(Array.isArray(effectiveItemType) &&\n\t\t\teffectiveItemType.includes(\"object\")) ||\n\t\t// If no type but has properties, treat as object\n\t\t(!effectiveItemType && effectiveItemSchema.properties !== undefined);\n\n\tif (!isObject && effectiveItemType !== undefined) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" expects an array of objects, but the array items have type \"${schemaTypeLabel(effectiveItemSchema)}\"`,\n\t\t\tstmt,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"object\",\n\t\t\t\tactual: schemaTypeLabel(effectiveItemSchema),\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 5. Validate the second argument (property name) ──────────────────\n\tconst propertyExpr = stmt.params[1] as hbs.AST.Expression;\n\n\t// The property name MUST be a StringLiteral (quoted string like `\"name\"`).\n\t// A bare identifier like `name` is parsed by Handlebars as a PathExpression,\n\t// which would be resolved as a data path at runtime — yielding `undefined`\n\t// when the identifier doesn't exist in the top-level context. This is a\n\t// common mistake, so we provide a clear error message guiding the user.\n\tlet propertyName: string | undefined;\n\n\tif (propertyExpr.type === \"PathExpression\") {\n\t\tconst bare = (propertyExpr as hbs.AST.PathExpression).original;\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" parameter \"property\" must be a quoted string. ` +\n\t\t\t\t`Use {{ ${helperName} … \"${bare}\" }} instead of {{ ${helperName} … ${bare} }}`,\n\t\t\tstmt,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: 'StringLiteral (e.g. \"property\")',\n\t\t\t\tactual: `PathExpression (${bare})`,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\tif (propertyExpr.type === \"StringLiteral\") {\n\t\tpropertyName = (propertyExpr as hbs.AST.StringLiteral).value;\n\t}\n\n\tif (!propertyName) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" parameter \"property\" expects a quoted string literal, but got ${propertyExpr.type}`,\n\t\t\tstmt,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: 'StringLiteral (e.g. \"property\")',\n\t\t\t\tactual: propertyExpr.type,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 6. Resolve the property within the item schema ───────────────────\n\tconst propertySchema = resolveSchemaPath(effectiveItemSchema, [propertyName]);\n\tif (!propertySchema) {\n\t\tconst availableProperties = getSchemaPropertyNames(effectiveItemSchema);\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_PROPERTY\",\n\t\t\t\"error\",\n\t\t\tcreatePropertyNotFoundMessage(propertyName, availableProperties),\n\t\t\tstmt,\n\t\t\t{\n\t\t\t\tpath: propertyName,\n\t\t\t\tavailableProperties,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 7. Return the inferred output schema ─────────────────────────────\n\treturn { type: \"array\", items: propertySchema };\n}\n\n// ─── default helper — special-case analysis ──────────────────────────────────\n// Validates the arguments and infers the return type as the union of all\n// argument types. The chain must terminate with a guaranteed value.\n//\n// Validation rules:\n// 1. At least 2 arguments are required\n// 2. All arguments must be type-compatible\n// 3. The chain must end with a guaranteed value (literal, required property,\n// or sub-expression)\n\n/**\n * Analyzes a `default` helper MustacheStatement and returns the inferred\n * output schema. Shared logic with `processDefaultSubExpression`.\n */\nfunction processDefaultHelper(\n\tstmt: hbs.AST.MustacheStatement,\n\tctx: AnalysisContext,\n): JSONSchema7 {\n\treturn analyzeDefaultArgs(stmt.params as hbs.AST.Expression[], ctx, stmt);\n}\n\n/**\n * Analyzes a `default` helper SubExpression and returns the inferred\n * output schema.\n */\nfunction processDefaultSubExpression(\n\texpr: hbs.AST.SubExpression,\n\tctx: AnalysisContext,\n\tparentNode?: hbs.AST.Node,\n): JSONSchema7 {\n\treturn analyzeDefaultArgs(\n\t\texpr.params as hbs.AST.Expression[],\n\t\tctx,\n\t\tparentNode ?? expr,\n\t);\n}\n\n/**\n * Core analysis logic for the `default` helper (shared by Mustache and\n * SubExpression paths).\n *\n * 1. Validates argument count (≥ 2)\n * 2. Resolves the schema of each argument\n * 3. Checks type compatibility between all arguments\n * 4. Verifies that at least one argument is guaranteed (non-optional)\n * 5. Returns the simplified union of all argument types\n */\nfunction analyzeDefaultArgs(\n\tparams: hbs.AST.Expression[],\n\tctx: AnalysisContext,\n\tnode: hbs.AST.Node,\n): JSONSchema7 {\n\tconst helperName = DefaultHelpers.DEFAULT_HELPER_NAME;\n\n\t// ── 1. Check argument count ──────────────────────────────────────────\n\tif (params.length < 2) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" expects at least 2 argument(s), but got ${params.length}`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"2 argument(s)\",\n\t\t\t\tactual: `${params.length} argument(s)`,\n\t\t\t},\n\t\t);\n\t\treturn {};\n\t}\n\n\t// ── 2. Resolve the schema of each argument ───────────────────────────\n\tconst resolvedSchemas: JSONSchema7[] = [];\n\tlet hasGuaranteedValue = false;\n\n\tfor (let i = 0; i < params.length; i++) {\n\t\tconst param = params[i] as hbs.AST.Expression;\n\t\tconst resolvedSchema = resolveExpressionWithDiagnostics(param, ctx, node);\n\n\t\tif (resolvedSchema) {\n\t\t\tresolvedSchemas.push(resolvedSchema);\n\t\t}\n\n\t\t// ── 3. Check if this argument is guaranteed ──────────────────────\n\t\tif (isGuaranteedExpression(param, ctx)) {\n\t\t\thasGuaranteedValue = true;\n\t\t}\n\t}\n\n\t// ── 4. Check type compatibility between all arguments ────────────────\n\t// All arguments must be compatible with each other. We compare each\n\t// pair of resolved schemas (only those with type info).\n\tif (resolvedSchemas.length >= 2) {\n\t\tconst firstWithType = resolvedSchemas.find((s) => s.type);\n\t\tif (firstWithType) {\n\t\t\tfor (let i = 0; i < resolvedSchemas.length; i++) {\n\t\t\t\tconst schema = resolvedSchemas[i] as JSONSchema7;\n\t\t\t\tif (schema.type && !isParamTypeCompatible(schema, firstWithType)) {\n\t\t\t\t\taddDiagnostic(\n\t\t\t\t\t\tctx,\n\t\t\t\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\t\t\t\"error\",\n\t\t\t\t\t\t`Helper \"${helperName}\" argument ${i + 1} has type ${schemaTypeLabel(schema)}, incompatible with ${schemaTypeLabel(firstWithType)}`,\n\t\t\t\t\t\tnode,\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\thelperName,\n\t\t\t\t\t\t\texpected: schemaTypeLabel(firstWithType),\n\t\t\t\t\t\t\tactual: schemaTypeLabel(schema),\n\t\t\t\t\t\t},\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// ── 5. Verify the chain terminates with a guaranteed value ───────────\n\tif (!hasGuaranteedValue) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"DEFAULT_NO_GUARANTEED_VALUE\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" argument chain has no guaranteed fallback — ` +\n\t\t\t\t\"the last argument must be a literal or a non-optional property\",\n\t\t\tnode,\n\t\t\t{ helperName },\n\t\t);\n\t}\n\n\t// ── 6. Return the union of all argument types ────────────────────────\n\tif (resolvedSchemas.length === 0) return {};\n\tif (resolvedSchemas.length === 1) return resolvedSchemas[0] as JSONSchema7;\n\n\treturn simplifySchema({ oneOf: resolvedSchemas });\n}\n\n/**\n * Determines whether a template expression is **guaranteed** to produce a\n * non-nullish value at runtime.\n *\n * An expression is guaranteed when:\n * - It is a literal (StringLiteral, NumberLiteral, BooleanLiteral)\n * - It is a SubExpression (helpers always return a value)\n * - It is a PathExpression pointing to a **required** property in the schema\n */\nfunction isGuaranteedExpression(\n\texpr: hbs.AST.Expression,\n\tctx: AnalysisContext,\n): boolean {\n\t// Literals are always guaranteed\n\tif (\n\t\texpr.type === \"StringLiteral\" ||\n\t\texpr.type === \"NumberLiteral\" ||\n\t\texpr.type === \"BooleanLiteral\"\n\t) {\n\t\treturn true;\n\t}\n\n\t// Sub-expressions (helper calls) are considered guaranteed\n\tif (expr.type === \"SubExpression\") {\n\t\treturn true;\n\t}\n\n\t// PathExpression: check if the property is required in the schema\n\tif (expr.type === \"PathExpression\") {\n\t\tconst segments = extractPathSegments(expr);\n\t\tif (segments.length === 0) return false;\n\n\t\tconst { cleanSegments } = extractExpressionIdentifier(segments);\n\t\treturn isPropertyRequired(ctx.current, cleanSegments);\n\t}\n\n\treturn false;\n}\n\n/**\n * Checks whether a resolved type is compatible with the type expected\n * by a helper parameter.\n *\n * Compatibility rules:\n * - If either schema has no `type`, validation is not possible → compatible\n * - `integer` is compatible with `number` (integer ⊂ number)\n * - For multiple types (e.g. `[\"string\", \"number\"]`), at least one resolved\n * type must match one expected type\n */\nfunction isParamTypeCompatible(\n\tresolved: JSONSchema7,\n\texpected: JSONSchema7,\n): boolean {\n\t// If either has no type info, we cannot validate\n\tif (!expected.type || !resolved.type) return true;\n\n\tconst expectedTypes = Array.isArray(expected.type)\n\t\t? expected.type\n\t\t: [expected.type];\n\tconst resolvedTypes = Array.isArray(resolved.type)\n\t\t? resolved.type\n\t\t: [resolved.type];\n\n\t// At least one resolved type must be compatible with one expected type\n\treturn resolvedTypes.some((rt) =>\n\t\texpectedTypes.some(\n\t\t\t(et) =>\n\t\t\t\trt === et ||\n\t\t\t\t// integer is a subtype of number\n\t\t\t\t(et === \"number\" && rt === \"integer\") ||\n\t\t\t\t(et === \"integer\" && rt === \"number\"),\n\t\t),\n\t);\n}\n\n/**\n * Infers the output type of a `Program` (template body or block body).\n *\n * Handles 4 cases, from most specific to most general:\n *\n * 1. **Single expression** `{{expr}}` → type of the expression\n * 2. **Single block** `{{#if}}…{{/if}}` → type of the block\n * 3. **Pure text content** → literal detection (number, boolean, null)\n * 4. **Mixed template** → always `string` (concatenation)\n *\n * Validation is performed alongside inference: each expression and block\n * is validated during processing.\n */\nfunction inferProgramType(\n\tprogram: hbs.AST.Program,\n\tctx: AnalysisContext,\n): JSONSchema7 {\n\tconst effective = getEffectiveBody(program);\n\n\t// No significant statements → empty string\n\tif (effective.length === 0) {\n\t\treturn { type: \"string\" };\n\t}\n\n\t// ── Case 1: single expression {{expr}} ─────────────────────────────────\n\tconst singleExpr = getEffectivelySingleExpression(program);\n\tif (singleExpr) {\n\t\treturn processMustache(singleExpr, ctx);\n\t}\n\n\t// ── Case 2: single block {{#if}}, {{#each}}, {{#with}}, … ──────────────\n\tconst singleBlock = getEffectivelySingleBlock(program);\n\tif (singleBlock) {\n\t\treturn inferBlockType(singleBlock, ctx);\n\t}\n\n\t// ── Case 3: only ContentStatements (no expressions) ────────────────────\n\t// If the concatenated (trimmed) text is a typed literal (number, boolean,\n\t// null), we infer the corresponding type.\n\tconst allContent = effective.every((s) => s.type === \"ContentStatement\");\n\tif (allContent) {\n\t\tconst text = effective\n\t\t\t.map((s) => (s as hbs.AST.ContentStatement).value)\n\t\t\t.join(\"\")\n\t\t\t.trim();\n\n\t\tif (text === \"\") return { type: \"string\" };\n\n\t\t// If an explicit coerceSchema was provided and declares a specific\n\t\t// primitive type, respect it instead of auto-detecting. For example,\n\t\t// \"123\" with coerceSchema `{ type: \"string\" }` should stay \"string\".\n\t\t// This only applies when coerceSchema is explicitly set — the\n\t\t// inputSchema is NEVER used for coercion.\n\t\t//\n\t\t// Only the **type** is extracted from coerceSchema. Value-level\n\t\t// constraints (enum, const, format, pattern, minLength, …) are NOT\n\t\t// propagated because they describe what the *consumer* accepts, not\n\t\t// what the literal *produces*. The actual literal value is set as\n\t\t// `const` so downstream compatibility checkers can detect mismatches.\n\t\tconst coercedType = ctx.coerceSchema?.type;\n\t\tif (\n\t\t\ttypeof coercedType === \"string\" &&\n\t\t\t(coercedType === \"string\" ||\n\t\t\t\tcoercedType === \"number\" ||\n\t\t\t\tcoercedType === \"integer\" ||\n\t\t\t\tcoercedType === \"boolean\" ||\n\t\t\t\tcoercedType === \"null\")\n\t\t) {\n\t\t\tconst coercedValue = coerceTextValue(text, coercedType);\n\t\t\treturn { type: coercedType, const: coercedValue } as JSONSchema7;\n\t\t}\n\n\t\tconst literalType = detectLiteralType(text);\n\t\tif (literalType) return { type: literalType };\n\t}\n\n\t// ── Case 4: multiple blocks only (no significant text between them) ────\n\t// When the effective body consists entirely of BlockStatements, gather\n\t// each block's inferred type and combine them via oneOf. This handles\n\t// templates like:\n\t// {{#if showName}}{{name}}{{/if}}\n\t// {{#if showAge}}{{age}}{{/if}}\n\t// where the output could be string OR number depending on which branch\n\t// is active.\n\tconst allBlocks = effective.every((s) => s.type === \"BlockStatement\");\n\tif (allBlocks) {\n\t\tconst types: JSONSchema7[] = [];\n\t\tfor (const stmt of effective) {\n\t\t\tconst t = inferBlockType(stmt as hbs.AST.BlockStatement, ctx);\n\t\t\tif (t) types.push(t);\n\t\t}\n\t\tif (types.length === 1) return types[0] as JSONSchema7;\n\t\tif (types.length > 1) return simplifySchema({ oneOf: types });\n\t\treturn { type: \"string\" };\n\t}\n\n\t// ── Case 5: mixed template (text + expressions, blocks…) ───────────────\n\t// Traverse all statements for validation (side-effects: diagnostics).\n\t// The result is always string (concatenation).\n\tfor (const stmt of program.body) {\n\t\tprocessStatement(stmt, ctx);\n\t}\n\treturn { type: \"string\" };\n}\n\n/**\n * Infers the output type of a BlockStatement and validates its content.\n *\n * Supports built-in helpers (`if`, `unless`, `each`, `with`) and custom\n * helpers registered via `Typebars.registerHelper()`.\n *\n * Uses the **save/restore** pattern for context: instead of creating a new\n * object `{ ...ctx, current: X }` on each recursion, we save `ctx.current`,\n * mutate it, process the body, then restore. This reduces GC pressure for\n * deeply nested templates.\n */\nfunction inferBlockType(\n\tstmt: hbs.AST.BlockStatement,\n\tctx: AnalysisContext,\n): JSONSchema7 {\n\tconst helperName = getBlockHelperName(stmt);\n\n\tswitch (helperName) {\n\t\t// ── if / unless ──────────────────────────────────────────────────────\n\t\t// Validate the condition argument, then infer types from both branches.\n\t\tcase \"if\":\n\t\tcase \"unless\": {\n\t\t\tconst arg = getBlockArgument(stmt);\n\t\t\tif (arg) {\n\t\t\t\tresolveExpressionWithDiagnostics(arg, ctx, stmt);\n\t\t\t} else {\n\t\t\t\taddDiagnostic(\n\t\t\t\t\tctx,\n\t\t\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\t\t\"error\",\n\t\t\t\t\tcreateMissingArgumentMessage(helperName),\n\t\t\t\t\tstmt,\n\t\t\t\t\t{ helperName },\n\t\t\t\t);\n\t\t\t}\n\n\t\t\t// Infer the type of the \"then\" branch\n\t\t\tconst thenType = inferProgramType(stmt.program, ctx);\n\n\t\t\tif (stmt.inverse) {\n\t\t\t\tconst elseType = inferProgramType(stmt.inverse, ctx);\n\t\t\t\t// If both branches have the same type → single type\n\t\t\t\tif (deepEqual(thenType, elseType)) return thenType;\n\t\t\t\t// Otherwise → union of both types\n\t\t\t\treturn simplifySchema({ oneOf: [thenType, elseType] });\n\t\t\t}\n\n\t\t\t// No else branch → the result is the type of the then branch\n\t\t\t// (conceptually optional, but Handlebars returns \"\" for falsy)\n\t\t\treturn thenType;\n\t\t}\n\n\t\t// ── each ─────────────────────────────────────────────────────────────\n\t\t// Resolve the collection schema, then validate the body with the item\n\t\t// schema as the new context.\n\t\tcase \"each\": {\n\t\t\tconst arg = getBlockArgument(stmt);\n\t\t\tif (!arg) {\n\t\t\t\taddDiagnostic(\n\t\t\t\t\tctx,\n\t\t\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\t\t\"error\",\n\t\t\t\t\tcreateMissingArgumentMessage(\"each\"),\n\t\t\t\t\tstmt,\n\t\t\t\t\t{ helperName: \"each\" },\n\t\t\t\t);\n\t\t\t\t// Validate the body with an empty context (best-effort)\n\t\t\t\tconst saved = ctx.current;\n\t\t\t\tctx.current = {};\n\t\t\t\tinferProgramType(stmt.program, ctx);\n\t\t\t\tctx.current = saved;\n\t\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\t\t\t\treturn { type: \"string\" };\n\t\t\t}\n\n\t\t\tconst collectionSchema = resolveExpressionWithDiagnostics(arg, ctx, stmt);\n\t\t\tif (!collectionSchema) {\n\t\t\t\t// The path could not be resolved — diagnostic already emitted.\n\t\t\t\tconst saved = ctx.current;\n\t\t\t\tctx.current = {};\n\t\t\t\tinferProgramType(stmt.program, ctx);\n\t\t\t\tctx.current = saved;\n\t\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\t\t\t\treturn { type: \"string\" };\n\t\t\t}\n\n\t\t\t// Resolve the schema of the array elements\n\t\t\tconst itemSchema = resolveArrayItems(collectionSchema, ctx.root);\n\t\t\tif (!itemSchema) {\n\t\t\t\taddDiagnostic(\n\t\t\t\t\tctx,\n\t\t\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\t\t\"error\",\n\t\t\t\t\tcreateTypeMismatchMessage(\n\t\t\t\t\t\t\"each\",\n\t\t\t\t\t\t\"an array\",\n\t\t\t\t\t\tschemaTypeLabel(collectionSchema),\n\t\t\t\t\t),\n\t\t\t\t\tstmt,\n\t\t\t\t\t{\n\t\t\t\t\t\thelperName: \"each\",\n\t\t\t\t\t\texpected: \"array\",\n\t\t\t\t\t\tactual: schemaTypeLabel(collectionSchema),\n\t\t\t\t\t},\n\t\t\t\t);\n\t\t\t\t// Validate the body with an empty context (best-effort)\n\t\t\t\tconst saved = ctx.current;\n\t\t\t\tctx.current = {};\n\t\t\t\tinferProgramType(stmt.program, ctx);\n\t\t\t\tctx.current = saved;\n\t\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\t\t\t\treturn { type: \"string\" };\n\t\t\t}\n\n\t\t\t// Validate the body with the item schema as the new context\n\t\t\tconst saved = ctx.current;\n\t\t\tctx.current = itemSchema;\n\t\t\tinferProgramType(stmt.program, ctx);\n\t\t\tctx.current = saved;\n\n\t\t\t// The inverse branch ({{else}}) keeps the parent context\n\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\n\t\t\t// An each concatenates renders → always string\n\t\t\treturn { type: \"string\" };\n\t\t}\n\n\t\t// ── with ─────────────────────────────────────────────────────────────\n\t\t// Resolve the inner schema, then validate the body with it as the\n\t\t// new context.\n\t\tcase \"with\": {\n\t\t\tconst arg = getBlockArgument(stmt);\n\t\t\tif (!arg) {\n\t\t\t\taddDiagnostic(\n\t\t\t\t\tctx,\n\t\t\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\t\t\"error\",\n\t\t\t\t\tcreateMissingArgumentMessage(\"with\"),\n\t\t\t\t\tstmt,\n\t\t\t\t\t{ helperName: \"with\" },\n\t\t\t\t);\n\t\t\t\t// Validate the body with an empty context\n\t\t\t\tconst saved = ctx.current;\n\t\t\t\tctx.current = {};\n\t\t\t\tconst result = inferProgramType(stmt.program, ctx);\n\t\t\t\tctx.current = saved;\n\t\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\t\t\t\treturn result;\n\t\t\t}\n\n\t\t\tconst innerSchema = resolveExpressionWithDiagnostics(arg, ctx, stmt);\n\n\t\t\tconst saved = ctx.current;\n\t\t\tctx.current = innerSchema ?? {};\n\t\t\tconst result = inferProgramType(stmt.program, ctx);\n\t\t\tctx.current = saved;\n\n\t\t\t// The inverse branch keeps the parent context\n\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\n\t\t\treturn result;\n\t\t}\n\n\t\t// ── Custom or unknown helper ─────────────────────────────────────────\n\t\tdefault: {\n\t\t\tconst helper = ctx.helpers?.get(helperName);\n\t\t\tif (helper) {\n\t\t\t\t// Registered custom helper — validate parameters\n\t\t\t\tfor (const param of stmt.params) {\n\t\t\t\t\tresolveExpressionWithDiagnostics(\n\t\t\t\t\t\tparam as hbs.AST.Expression,\n\t\t\t\t\t\tctx,\n\t\t\t\t\t\tstmt,\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\t// Validate the body with the current context\n\t\t\t\tinferProgramType(stmt.program, ctx);\n\t\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\t\t\t\treturn helper.returnType ?? { type: \"string\" };\n\t\t\t}\n\n\t\t\t// Unknown helper — warning\n\t\t\taddDiagnostic(\n\t\t\t\tctx,\n\t\t\t\t\"UNKNOWN_HELPER\",\n\t\t\t\t\"warning\",\n\t\t\t\tcreateUnknownHelperMessage(helperName),\n\t\t\t\tstmt,\n\t\t\t\t{ helperName },\n\t\t\t);\n\t\t\t// Still validate the body with the current context (best-effort)\n\t\t\tinferProgramType(stmt.program, ctx);\n\t\t\tif (stmt.inverse) inferProgramType(stmt.inverse, ctx);\n\t\t\treturn { type: \"string\" };\n\t\t}\n\t}\n}\n\n// ─── Expression Resolution ───────────────────────────────────────────────────\n\n/**\n * Resolves an AST expression to a sub-schema, emitting a diagnostic\n * if the path cannot be resolved.\n *\n * Handles the `{{key:N}}` syntax:\n * - If the expression has an identifier N → resolution in `identifierSchemas[N]`\n * - If identifier N has no associated schema → error\n * - If no identifier → resolution in `ctx.current` (standard behavior)\n *\n * @returns The resolved sub-schema, or `undefined` if the path is invalid.\n */\n\n// ─── @data variable types ────────────────────────────────────────────────────\n// Handlebars injects these variables inside block helpers at runtime.\n// We map each known variable to its static type so the analyzer can\n// validate templates that use them without false UNKNOWN_PROPERTY errors.\n\nconst DATA_VARIABLE_SCHEMAS: Record<string, JSONSchema7> = {\n\tindex: { type: \"number\" },\n\tfirst: { type: \"boolean\" },\n\tlast: { type: \"boolean\" },\n\tkey: { type: \"string\" },\n};\n\n/**\n * Returns the inferred schema for a Handlebars `@data` variable.\n * Known variables (`@index`, `@first`, `@last`, `@key`) return their\n * concrete type; unknown `@data` variables return the open schema `{}`\n * (any type) to avoid blocking valid templates.\n */\nfunction resolveDataExpression(expr: hbs.AST.PathExpression): JSONSchema7 {\n\tconst name = expr.parts[0];\n\tif (name && name in DATA_VARIABLE_SCHEMAS) {\n\t\treturn DATA_VARIABLE_SCHEMAS[name] as JSONSchema7;\n\t}\n\t// Unknown @data variable — return open schema (best-effort)\n\treturn {};\n}\n\nfunction resolveExpressionWithDiagnostics(\n\texpr: hbs.AST.Expression,\n\tctx: AnalysisContext,\n\t/** Parent AST node (for diagnostic location) */\n\tparentNode?: hbs.AST.Node,\n): JSONSchema7 | undefined {\n\t// Handle `this` / `.` → return the current context\n\tif (isThisExpression(expr)) {\n\t\treturn ctx.current;\n\t}\n\n\t// ── Handlebars @data variables (@index, @first, @last, @key) ────────────\n\t// These are runtime-provided by Handlebars inside block helpers (e.g.\n\t// `#each`). They are NOT part of the user's input schema, so we must\n\t// short-circuit here to avoid false UNKNOWN_PROPERTY diagnostics.\n\tif (isDataExpression(expr)) {\n\t\treturn resolveDataExpression(expr as hbs.AST.PathExpression);\n\t}\n\n\t// ── SubExpression (nested helper call, e.g. `(lt account.balance 500)`) ──\n\tif (expr.type === \"SubExpression\") {\n\t\treturn resolveSubExpression(expr as hbs.AST.SubExpression, ctx, parentNode);\n\t}\n\n\tconst segments = extractPathSegments(expr);\n\tif (segments.length === 0) {\n\t\t// Expression that is not a PathExpression (e.g. literal)\n\t\tif (expr.type === \"StringLiteral\") return { type: \"string\" };\n\t\tif (expr.type === \"NumberLiteral\") return { type: \"number\" };\n\t\tif (expr.type === \"BooleanLiteral\") return { type: \"boolean\" };\n\t\tif (expr.type === \"NullLiteral\") return { type: \"null\" };\n\t\tif (expr.type === \"UndefinedLiteral\") return {};\n\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNANALYZABLE\",\n\t\t\t\"warning\",\n\t\t\tcreateUnanalyzableMessage(expr.type),\n\t\t\tparentNode ?? expr,\n\t\t);\n\t\treturn undefined;\n\t}\n\n\t// ── Identifier extraction ──────────────────────────────────────────────\n\t// Extract the `:N` suffix BEFORE checking for `$root` so that both\n\t// `{{$root}}` and `{{$root:2}}` are handled uniformly.\n\tconst { cleanSegments, identifier } = extractExpressionIdentifier(segments);\n\n\t// ── $root token ──────────────────────────────────────────────────────\n\t// Path traversal ($root.name, $root.address.city) is always forbidden,\n\t// regardless of whether an identifier is present.\n\tif (isRootPathTraversal(cleanSegments)) {\n\t\tconst fullPath = cleanSegments.join(\".\");\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"ROOT_PATH_TRAVERSAL\",\n\t\t\t\"error\",\n\t\t\tcreateRootPathTraversalMessage(fullPath),\n\t\t\tparentNode ?? expr,\n\t\t\t{ path: fullPath },\n\t\t);\n\t\treturn undefined;\n\t}\n\n\t// `{{$root}}` → return the entire current context schema\n\t// `{{$root:N}}` → return the entire schema for identifier N\n\tif (isRootSegments(cleanSegments)) {\n\t\tif (identifier !== null) {\n\t\t\treturn resolveRootWithIdentifier(identifier, ctx, parentNode ?? expr);\n\t\t}\n\t\treturn ctx.current;\n\t}\n\n\tif (identifier !== null) {\n\t\t// The expression uses the {{key:N}} syntax — resolve from\n\t\t// the schema of identifier N.\n\t\treturn resolveWithIdentifier(\n\t\t\tcleanSegments,\n\t\t\tidentifier,\n\t\t\tctx,\n\t\t\tparentNode ?? expr,\n\t\t);\n\t}\n\n\t// ── Standard resolution (no identifier) ────────────────────────────────\n\tconst resolved = resolveSchemaPath(ctx.current, cleanSegments);\n\tif (resolved === undefined) {\n\t\tconst fullPath = cleanSegments.join(\".\");\n\t\tconst availableProperties = getSchemaPropertyNames(ctx.current);\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_PROPERTY\",\n\t\t\t\"error\",\n\t\t\tcreatePropertyNotFoundMessage(fullPath, availableProperties),\n\t\t\tparentNode ?? expr,\n\t\t\t{ path: fullPath, availableProperties },\n\t\t);\n\t\treturn undefined;\n\t}\n\n\treturn resolved;\n}\n\n/**\n * Resolves `{{$root:N}}` — returns the **entire** schema for identifier N.\n *\n * This is the identifier-aware counterpart of returning `ctx.current` for\n * a plain `{{$root}}`. Instead of navigating into properties, it returns\n * the identifier's root schema directly.\n *\n * When the identifier schema is an array (aggregated multi-version data),\n * the full array schema is returned as-is — the caller receives the\n * complete `{ type: \"array\", items: ... }` schema.\n *\n * Emits an error diagnostic if:\n * - No `identifierSchemas` were provided\n * - Identifier N has no associated schema\n */\nfunction resolveRootWithIdentifier(\n\tidentifier: number,\n\tctx: AnalysisContext,\n\tnode: hbs.AST.Node,\n): JSONSchema7 | undefined {\n\t// No identifierSchemas provided at all\n\tif (!ctx.identifierSchemas) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"MISSING_IDENTIFIER_SCHEMAS\",\n\t\t\t\"error\",\n\t\t\t`Property \"$root:${identifier}\" uses an identifier but no identifier schemas were provided`,\n\t\t\tnode,\n\t\t\t{ path: `$root:${identifier}`, identifier },\n\t\t);\n\t\treturn undefined;\n\t}\n\n\t// The identifier does not exist in the provided schemas\n\tconst idSchema = ctx.identifierSchemas[identifier];\n\tif (!idSchema) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_IDENTIFIER\",\n\t\t\t\"error\",\n\t\t\t`Property \"$root:${identifier}\" references identifier ${identifier} but no schema exists for this identifier`,\n\t\t\tnode,\n\t\t\t{ path: `$root:${identifier}`, identifier },\n\t\t);\n\t\treturn undefined;\n\t}\n\n\t// Return the entire schema for identifier N.\n\t// For aggregated identifiers (array schemas), this returns the full\n\t// array schema — e.g. { type: \"array\", items: { type: \"object\", ... } }\n\treturn idSchema;\n}\n\n/**\n * Resolves an expression with identifier `{{key:N}}` by looking up the\n * schema associated with identifier N.\n *\n * When the identifier schema is an array (aggregated multi-version data),\n * the property is resolved within the array's `items` schema, and the\n * result is wrapped in `{ type: \"array\", items: <resolved> }`. This\n * models the runtime behavior where `{{accountId:4}}` on an array of\n * objects extracts the property from each element, producing an array.\n *\n * Emits an error diagnostic if:\n * - No `identifierSchemas` were provided\n * - Identifier N has no associated schema\n * - The property does not exist in the identifier's schema\n */\nfunction resolveWithIdentifier(\n\tcleanSegments: string[],\n\tidentifier: number,\n\tctx: AnalysisContext,\n\tnode: hbs.AST.Node,\n): JSONSchema7 | undefined {\n\tconst fullPath = cleanSegments.join(\".\");\n\n\t// No identifierSchemas provided at all\n\tif (!ctx.identifierSchemas) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"MISSING_IDENTIFIER_SCHEMAS\",\n\t\t\t\"error\",\n\t\t\t`Property \"${fullPath}:${identifier}\" uses an identifier but no identifier schemas were provided`,\n\t\t\tnode,\n\t\t\t{ path: `${fullPath}:${identifier}`, identifier },\n\t\t);\n\t\treturn undefined;\n\t}\n\n\t// The identifier does not exist in the provided schemas\n\tconst idSchema = ctx.identifierSchemas[identifier];\n\tif (!idSchema) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_IDENTIFIER\",\n\t\t\t\"error\",\n\t\t\t`Property \"${fullPath}:${identifier}\" references identifier ${identifier} but no schema exists for this identifier`,\n\t\t\tnode,\n\t\t\t{ path: `${fullPath}:${identifier}`, identifier },\n\t\t);\n\t\treturn undefined;\n\t}\n\n\t// ── Aggregated identifier (array schema) ─────────────────────────────\n\t// When the identifier schema is an array of objects (e.g. from a\n\t// multi-versioned workflow node), resolve the property within the\n\t// items schema and wrap the result in an array type.\n\t//\n\t// Example: identifierSchemas[4] = { type: \"array\", items: { type: \"object\",\n\t// properties: { accountId: { type: \"string\" } } } }\n\t// Expression: {{accountId:4}}\n\t// Result: { type: \"array\", items: { type: \"string\" } }\n\tconst itemSchema = resolveArrayItems(idSchema, ctx.root);\n\tif (itemSchema !== undefined) {\n\t\t// The identifier schema is an array — resolve within items\n\t\tconst resolved = resolveSchemaPath(itemSchema, cleanSegments);\n\t\tif (resolved === undefined) {\n\t\t\tconst availableProperties = getSchemaPropertyNames(itemSchema);\n\t\t\taddDiagnostic(\n\t\t\t\tctx,\n\t\t\t\t\"IDENTIFIER_PROPERTY_NOT_FOUND\",\n\t\t\t\t\"error\",\n\t\t\t\t`Property \"${fullPath}\" does not exist in the items schema for identifier ${identifier}`,\n\t\t\t\tnode,\n\t\t\t\t{\n\t\t\t\t\tpath: fullPath,\n\t\t\t\t\tidentifier,\n\t\t\t\t\tavailableProperties,\n\t\t\t\t},\n\t\t\t);\n\t\t\treturn undefined;\n\t\t}\n\t\t// Wrap the resolved property schema in an array\n\t\treturn { type: \"array\", items: resolved };\n\t}\n\n\t// ── Standard identifier (single object schema) ───────────────────────\n\t// Resolve the path within the identifier's schema directly.\n\tconst resolved = resolveSchemaPath(idSchema, cleanSegments);\n\tif (resolved === undefined) {\n\t\tconst availableProperties = getSchemaPropertyNames(idSchema);\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"IDENTIFIER_PROPERTY_NOT_FOUND\",\n\t\t\t\"error\",\n\t\t\t`Property \"${fullPath}\" does not exist in the schema for identifier ${identifier}`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\tpath: fullPath,\n\t\t\t\tidentifier,\n\t\t\t\tavailableProperties,\n\t\t\t},\n\t\t);\n\t\treturn undefined;\n\t}\n\n\treturn resolved;\n}\n\n// ─── Nullable Schema Wrapping ────────────────────────────────────────────────\n\n/**\n * Wraps a JSON Schema with `null` to indicate the value can be nullish.\n *\n * - If the schema already includes `null`, it is returned as-is.\n * - For schemas with a simple `type` string, the type becomes an array\n * (e.g. `{ type: \"string\" }` → `{ type: [\"string\", \"null\"] }`).\n * - For schemas with a type array, `\"null\"` is appended.\n * - For complex schemas (oneOf, anyOf, etc.), a `oneOf` wrapper is used.\n */\nfunction withNullType(schema: JSONSchema7): JSONSchema7 {\n\tif (schema.type === \"null\") return schema;\n\n\tif (typeof schema.type === \"string\") {\n\t\treturn { ...schema, type: [schema.type, \"null\"] };\n\t}\n\n\tif (Array.isArray(schema.type)) {\n\t\tif (schema.type.includes(\"null\")) return schema;\n\t\treturn { ...schema, type: [...schema.type, \"null\"] };\n\t}\n\n\t// Complex schema (oneOf, anyOf, allOf, etc.) — wrap with oneOf\n\treturn simplifySchema({ oneOf: [schema, { type: \"null\" }] });\n}\n\n/**\n * Checks whether EVERY segment along a property path is required.\n *\n * Unlike `isPropertyRequired` (which only checks the last segment),\n * this function verifies that no intermediate segment is optional.\n * If any segment along the path is optional, the entire expression\n * can produce `null`/`undefined` at runtime.\n *\n * Intrinsic array accesses (`.length`, `.[N]`) are always considered\n * required — they are synthesized by the schema resolver and do not\n * appear in any `required` array.\n *\n * Example: for path `[\"user\", \"name\"]`, checks both that `user` is\n * required in the root schema AND that `name` is required in `user`.\n */\nfunction isPathFullyRequired(schema: JSONSchema7, segments: string[]): boolean {\n\tfor (let i = 1; i <= segments.length; i++) {\n\t\tif (!isPropertyRequired(schema, segments.slice(0, i))) {\n\t\t\t// Intrinsic array access: .length and .[N] are always available\n\t\t\t// on array schemas. They are not listed in `required` because\n\t\t\t// they are synthesized by the schema resolver, not real properties.\n\t\t\tif (i >= 2) {\n\t\t\t\tconst parentSchema = resolveSchemaPath(\n\t\t\t\t\tschema,\n\t\t\t\t\tsegments.slice(0, i - 1),\n\t\t\t\t);\n\t\t\t\tif (parentSchema && parentSchema.type === \"array\") {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n// ─── Utilities ───────────────────────────────────────────────────────────────\n\n/**\n * Extracts the first argument of a BlockStatement.\n *\n * In the Handlebars AST, for `{{#if active}}`:\n * - `stmt.path` → PathExpression(\"if\") ← the helper name\n * - `stmt.params[0]` → PathExpression(\"active\") ← the actual argument\n *\n * @returns The argument expression, or `undefined` if the block has no argument.\n */\n// ─── SubExpression Resolution ────────────────────────────────────────────────\n\n/**\n * Resolves a SubExpression (nested helper call) such as `(lt account.balance 500)`.\n *\n * This mirrors the helper-call logic in `processMustache` but applies to\n * expressions used as arguments (e.g. inside `{{#if (lt a b)}}`).\n *\n * Steps:\n * 1. Extract the helper name from the SubExpression's path.\n * 2. Look up the helper in `ctx.helpers`.\n * 3. Validate argument count and types.\n * 4. Return the helper's declared `returnType` (defaults to `{ type: \"string\" }`).\n */\nfunction resolveSubExpression(\n\texpr: hbs.AST.SubExpression,\n\tctx: AnalysisContext,\n\tparentNode?: hbs.AST.Node,\n): JSONSchema7 | undefined {\n\tconst helperName = getExpressionName(expr.path);\n\n\t// ── Special-case: map helper ─────────────────────────────────────\n\t// The `map` helper requires deep static analysis to infer the\n\t// precise return type `{ type: \"array\", items: <property schema> }`.\n\t// The generic path would only return `{ type: \"array\" }` (the static\n\t// returnType), losing the item schema needed by nested map calls.\n\tif (helperName === MapHelpers.MAP_HELPER_NAME) {\n\t\treturn processMapSubExpression(expr, ctx, parentNode);\n\t}\n\n\t// ── Special-case: default helper ─────────────────────────────────\n\tif (helperName === DefaultHelpers.DEFAULT_HELPER_NAME) {\n\t\treturn processDefaultSubExpression(expr, ctx, parentNode);\n\t}\n\n\tconst helper = ctx.helpers?.get(helperName);\n\tif (!helper) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_HELPER\",\n\t\t\t\"warning\",\n\t\t\t`Unknown sub-expression helper \"${helperName}\" — cannot analyze statically`,\n\t\t\tparentNode ?? expr,\n\t\t\t{ helperName },\n\t\t);\n\t\treturn { type: \"string\" };\n\t}\n\n\tconst helperParams = helper.params;\n\n\t// ── Check the number of required parameters ──────────────────────\n\tif (helperParams) {\n\t\tconst requiredCount = helperParams.filter((p) => !p.optional).length;\n\t\tif (expr.params.length < requiredCount) {\n\t\t\taddDiagnostic(\n\t\t\t\tctx,\n\t\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\t\"error\",\n\t\t\t\t`Helper \"${helperName}\" expects at least ${requiredCount} argument(s), but got ${expr.params.length}`,\n\t\t\t\tparentNode ?? expr,\n\t\t\t\t{\n\t\t\t\t\thelperName,\n\t\t\t\t\texpected: `${requiredCount} argument(s)`,\n\t\t\t\t\tactual: `${expr.params.length} argument(s)`,\n\t\t\t\t},\n\t\t\t);\n\t\t}\n\t}\n\n\t// ── Validate each parameter (existence + type) ───────────────────\n\tfor (let i = 0; i < expr.params.length; i++) {\n\t\tconst resolvedSchema = resolveExpressionWithDiagnostics(\n\t\t\texpr.params[i] as hbs.AST.Expression,\n\t\t\tctx,\n\t\t\tparentNode ?? expr,\n\t\t);\n\n\t\tconst helperParam = helperParams?.[i];\n\t\tif (resolvedSchema && helperParam?.type) {\n\t\t\tconst expectedType = helperParam.type;\n\t\t\tif (!isParamTypeCompatible(resolvedSchema, expectedType)) {\n\t\t\t\tconst paramName = helperParam.name;\n\t\t\t\taddDiagnostic(\n\t\t\t\t\tctx,\n\t\t\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\t\t\"error\",\n\t\t\t\t\t`Helper \"${helperName}\" parameter \"${paramName}\" expects ${schemaTypeLabel(expectedType)}, but got ${schemaTypeLabel(resolvedSchema)}`,\n\t\t\t\t\tparentNode ?? expr,\n\t\t\t\t\t{\n\t\t\t\t\t\thelperName,\n\t\t\t\t\t\texpected: schemaTypeLabel(expectedType),\n\t\t\t\t\t\tactual: schemaTypeLabel(resolvedSchema),\n\t\t\t\t\t},\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn helper.returnType ?? { type: \"string\" };\n}\n\n// ─── map helper — sub-expression analysis ────────────────────────────────────\n// Mirrors processMapHelper but for SubExpression nodes (e.g.\n// `(map users 'cartItems')` used as an argument to another helper).\n// This enables nested map: `{{ map (map users 'cartItems') 'productId' }}`\n\nfunction processMapSubExpression(\n\texpr: hbs.AST.SubExpression,\n\tctx: AnalysisContext,\n\tparentNode?: hbs.AST.Node,\n): JSONSchema7 {\n\tconst helperName = MapHelpers.MAP_HELPER_NAME;\n\tconst node = parentNode ?? expr;\n\n\t// ── 1. Check argument count ──────────────────────────────────────────\n\tif (expr.params.length < 2) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"MISSING_ARGUMENT\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" expects at least 2 argument(s), but got ${expr.params.length}`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"2 argument(s)\",\n\t\t\t\tactual: `${expr.params.length} argument(s)`,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 2. Resolve the first argument (collection path) ──────────────────\n\tconst collectionExpr = expr.params[0] as hbs.AST.Expression;\n\tconst collectionSchema = resolveExpressionWithDiagnostics(\n\t\tcollectionExpr,\n\t\tctx,\n\t\tnode,\n\t);\n\n\tif (!collectionSchema) {\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 3. Validate that the collection is an array ──────────────────────\n\tconst itemSchema = resolveArrayItems(collectionSchema, ctx.root);\n\tif (!itemSchema) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" parameter \"collection\" expects an array, but got ${schemaTypeLabel(collectionSchema)}`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"array\",\n\t\t\t\tactual: schemaTypeLabel(collectionSchema),\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 4. Validate that the items are objects ───────────────────────────\n\t// If the items are arrays (e.g. from a nested map), flatten one level\n\t// to match the runtime `flat(1)` behavior and use the inner items instead.\n\tlet effectiveItemSchema = itemSchema;\n\tconst itemType = effectiveItemSchema.type;\n\tif (\n\t\titemType === \"array\" ||\n\t\t(Array.isArray(itemType) && itemType.includes(\"array\"))\n\t) {\n\t\tconst innerItems = resolveArrayItems(effectiveItemSchema, ctx.root);\n\t\tif (innerItems) {\n\t\t\teffectiveItemSchema = innerItems;\n\t\t}\n\t}\n\n\tconst effectiveItemType = effectiveItemSchema.type;\n\tconst isObject =\n\t\teffectiveItemType === \"object\" ||\n\t\t(Array.isArray(effectiveItemType) &&\n\t\t\teffectiveItemType.includes(\"object\")) ||\n\t\t(!effectiveItemType && effectiveItemSchema.properties !== undefined);\n\n\tif (!isObject && effectiveItemType !== undefined) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" expects an array of objects, but the array items have type \"${schemaTypeLabel(effectiveItemSchema)}\"`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: \"object\",\n\t\t\t\tactual: schemaTypeLabel(effectiveItemSchema),\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 5. Validate the second argument (property name) ──────────────────\n\tconst propertyExpr = expr.params[1] as hbs.AST.Expression;\n\tlet propertyName: string | undefined;\n\n\tif (propertyExpr.type === \"PathExpression\") {\n\t\tconst bare = (propertyExpr as hbs.AST.PathExpression).original;\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" parameter \"property\" must be a quoted string. ` +\n\t\t\t\t`Use (${helperName} … \"${bare}\") instead of (${helperName} … ${bare})`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: 'StringLiteral (e.g. \"property\")',\n\t\t\t\tactual: `PathExpression (${bare})`,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\tif (propertyExpr.type === \"StringLiteral\") {\n\t\tpropertyName = (propertyExpr as hbs.AST.StringLiteral).value;\n\t}\n\n\tif (!propertyName) {\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"TYPE_MISMATCH\",\n\t\t\t\"error\",\n\t\t\t`Helper \"${helperName}\" parameter \"property\" expects a quoted string literal, but got ${propertyExpr.type}`,\n\t\t\tnode,\n\t\t\t{\n\t\t\t\thelperName,\n\t\t\t\texpected: 'StringLiteral (e.g. \"property\")',\n\t\t\t\tactual: propertyExpr.type,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 6. Resolve the property within the item schema ───────────────────\n\tconst propertySchema = resolveSchemaPath(effectiveItemSchema, [propertyName]);\n\tif (!propertySchema) {\n\t\tconst availableProperties = getSchemaPropertyNames(effectiveItemSchema);\n\t\taddDiagnostic(\n\t\t\tctx,\n\t\t\t\"UNKNOWN_PROPERTY\",\n\t\t\t\"error\",\n\t\t\tcreatePropertyNotFoundMessage(propertyName, availableProperties),\n\t\t\tnode,\n\t\t\t{\n\t\t\t\tpath: propertyName,\n\t\t\t\tavailableProperties,\n\t\t\t},\n\t\t);\n\t\treturn { type: \"array\" };\n\t}\n\n\t// ── 7. Return the inferred output schema ─────────────────────────────\n\treturn { type: \"array\", items: propertySchema };\n}\n\nfunction getBlockArgument(\n\tstmt: hbs.AST.BlockStatement,\n): hbs.AST.Expression | undefined {\n\treturn stmt.params[0] as hbs.AST.Expression | undefined;\n}\n\n/**\n * Retrieves the helper name from a BlockStatement (e.g. \"if\", \"each\", \"with\").\n */\nfunction getBlockHelperName(stmt: hbs.AST.BlockStatement): string {\n\tif (stmt.path.type === \"PathExpression\") {\n\t\treturn (stmt.path as hbs.AST.PathExpression).original;\n\t}\n\treturn \"\";\n}\n\n/**\n * Retrieves the name of an expression (first segment of the PathExpression).\n * Used to identify inline helpers.\n */\nfunction getExpressionName(expr: hbs.AST.Expression): string {\n\tif (expr.type === \"PathExpression\") {\n\t\treturn (expr as hbs.AST.PathExpression).original;\n\t}\n\treturn \"\";\n}\n\n/**\n * Adds an enriched diagnostic to the analysis context.\n *\n * Each diagnostic includes:\n * - A machine-readable `code` for the frontend\n * - A human-readable `message` describing the problem\n * - A `source` snippet from the template (if the position is available)\n * - Structured `details` for debugging\n */\nfunction addDiagnostic(\n\tctx: AnalysisContext,\n\tcode: DiagnosticCode,\n\tseverity: \"error\" | \"warning\",\n\tmessage: string,\n\tnode?: hbs.AST.Node,\n\tdetails?: DiagnosticDetails,\n): void {\n\tconst diagnostic: TemplateDiagnostic = { severity, code, message };\n\n\t// Extract the position and source snippet if available\n\tif (node && \"loc\" in node && node.loc) {\n\t\tdiagnostic.loc = {\n\t\t\tstart: { line: node.loc.start.line, column: node.loc.start.column },\n\t\t\tend: { line: node.loc.end.line, column: node.loc.end.column },\n\t\t};\n\t\t// Extract the template fragment around the error\n\t\tdiagnostic.source = extractSourceSnippet(ctx.template, diagnostic.loc);\n\t}\n\n\tif (details) {\n\t\tdiagnostic.details = details;\n\t}\n\n\tctx.diagnostics.push(diagnostic);\n}\n\n/**\n * Returns a human-readable label for a schema's type (for error messages).\n */\nfunction schemaTypeLabel(schema: JSONSchema7): string {\n\tif (schema.type) {\n\t\treturn Array.isArray(schema.type) ? schema.type.join(\" | \") : schema.type;\n\t}\n\tif (schema.oneOf) return \"oneOf(...)\";\n\tif (schema.anyOf) return \"anyOf(...)\";\n\tif (schema.allOf) return \"allOf(...)\";\n\tif (schema.enum) return \"enum\";\n\treturn \"unknown\";\n}\n\n// ─── Export for Internal Use ─────────────────────────────────────────────────\n// `inferBlockType` is exported to allow targeted unit tests\n// on block type inference.\nexport { inferBlockType };\n"],"names":["dispatchAnalyze","createMissingArgumentMessage","createPropertyNotFoundMessage","createRootPathTraversalMessage","createTypeMismatchMessage","createUnanalyzableMessage","createUnknownHelperMessage","DefaultHelpers","MapHelpers","detectLiteralType","extractExpressionIdentifier","extractPathSegments","getEffectiveBody","getEffectivelySingleBlock","getEffectivelySingleExpression","isDataExpression","isRootPathTraversal","isRootSegments","isThisExpression","parse","findConditionalSchemaLocations","isPropertyRequired","resolveArrayItems","resolveSchemaPath","simplifySchema","deepEqual","extractSourceSnippet","getSchemaPropertyNames","coerceTextValue","text","targetType","undefined","num","Number","isNaN","isInteger","lower","toLowerCase","analyze","template","inputSchema","options","tpl","coerceSchema","ast","analyzeFromAst","identifierSchemas","child","childOptions","ctx","root","current","diagnostics","helpers","conditionalLocations","loc","addDiagnostic","keyword","schemaPath","path","id","idSchema","Object","entries","idLocations","length","valid","outputSchema","inferProgramType","hasErrors","some","d","severity","processStatement","stmt","type","processMustache","inferBlockType","params","hash","helperName","getExpressionName","MAP_HELPER_NAME","processMapHelper","DEFAULT_HELPER_NAME","processDefaultHelper","helper","get","helperParams","requiredCount","filter","p","optional","expected","actual","i","resolvedSchema","resolveExpressionWithDiagnostics","helperParam","expectedType","isParamTypeCompatible","paramName","name","schemaTypeLabel","returnType","resolved","segments","cleanSegments","identifier","targetSchema","itemSchema","isPathFullyRequired","withNullType","collectionExpr","collectionSchema","effectiveItemSchema","itemType","Array","isArray","includes","innerItems","join","effectiveItemType","isObject","properties","propertyExpr","propertyName","bare","original","value","propertySchema","availableProperties","items","analyzeDefaultArgs","processDefaultSubExpression","expr","parentNode","node","resolvedSchemas","hasGuaranteedValue","param","push","isGuaranteedExpression","firstWithType","find","s","schema","oneOf","expectedTypes","resolvedTypes","rt","et","program","effective","singleExpr","singleBlock","allContent","every","map","trim","coercedType","coercedValue","const","literalType","allBlocks","types","t","body","getBlockHelperName","arg","getBlockArgument","thenType","inverse","elseType","saved","result","innerSchema","DATA_VARIABLE_SCHEMAS","index","first","last","key","resolveDataExpression","parts","resolveSubExpression","fullPath","resolveRootWithIdentifier","resolveWithIdentifier","slice","parentSchema","processMapSubExpression","code","message","details","diagnostic","start","line","column","end","source","anyOf","allOf","enum"],"mappings":"AACA,OAASA,eAAe,KAAQ,eAAgB,AAChD,QACCC,4BAA4B,CAC5BC,6BAA6B,CAC7BC,8BAA8B,CAC9BC,yBAAyB,CACzBC,yBAAyB,CACzBC,0BAA0B,KACpB,UAAW,AAClB,QAASC,cAAc,KAAQ,8BAA+B,AAC9D,QAASC,UAAU,KAAQ,0BAA2B,AACtD,QACCC,iBAAiB,CACjBC,2BAA2B,CAC3BC,mBAAmB,CACnBC,gBAAgB,CAChBC,yBAAyB,CACzBC,8BAA8B,CAC9BC,gBAAgB,CAChBC,mBAAmB,CACnBC,cAAc,CACdC,gBAAgB,CAChBC,KAAK,KACC,UAAW,AAClB,QACCC,8BAA8B,CAC9BC,kBAAkB,CAClBC,iBAAiB,CACjBC,iBAAiB,CACjBC,cAAc,KACR,mBAAoB,AAS3B,QACCC,SAAS,CACTC,oBAAoB,CACpBC,sBAAsB,KAChB,SAAU,CA+FjB,SAASC,gBACRC,IAAY,CACZC,UAAgE,EAEhE,OAAQA,YACP,IAAK,SACL,IAAK,UAAW,CACf,GAAID,OAAS,GAAI,OAAOE,UACxB,MAAMC,IAAMC,OAAOJ,MACnB,GAAII,OAAOC,KAAK,CAACF,KAAM,OAAOD,UAC9B,GAAID,aAAe,WAAa,CAACG,OAAOE,SAAS,CAACH,KAAM,OAAOD,UAC/D,OAAOC,GACR,CACA,IAAK,UAAW,CACf,MAAMI,MAAQP,KAAKQ,WAAW,GAC9B,GAAID,QAAU,OAAQ,OAAO,KAC7B,GAAIA,QAAU,QAAS,OAAO,MAC9B,OAAOL,SACR,CACA,IAAK,OACJ,OAAO,IACR,SACC,OAAOF,IACT,CACD,CAgBA,OAAO,SAASS,QACfC,QAAuB,CACvBC,YAA2B,CAAC,CAAC,CAC7BC,OAAwB,EAExB,OAAOzC,gBACNuC,SACAE,QAEA,CAACC,IAAKC,gBACL,MAAMC,IAAMzB,MAAMuB,KAClB,OAAOG,eAAeD,IAAKF,IAAKF,YAAa,CAC5CM,kBAAmBL,SAASK,kBAC5BH,YACD,EACD,EAEA,CAACI,MAAOC,eAAiBV,QAAQS,MAAOP,YAAaQ,cAEvD,CAcA,OAAO,SAASH,eACfD,GAAoB,CACpBL,QAAgB,CAChBC,YAA2B,CAAC,CAAC,CAC7BC,OASC,EAGD,MAAMQ,IAAuB,CAC5BC,KAAMV,YACNW,QAASX,YACTY,YAAa,EAAE,CACfb,SACAO,kBAAmBL,SAASK,kBAC5BO,QAASZ,SAASY,QAClBV,aAAcF,SAASE,YACxB,EAMA,MAAMW,qBAAuBlC,+BAA+BoB,aAC5D,IAAK,MAAMe,OAAOD,qBAAsB,CACvCE,cACCP,IACA,qBACA,QACA,CAAC,kCAAkC,EAAEM,IAAIE,OAAO,CAAC,MAAM,EAAEF,IAAIG,UAAU,CAAC,GAAG,CAAC,CAC3E,gFACA,uFACD3B,UACA,CAAE4B,KAAMJ,IAAIG,UAAU,AAAC,EAEzB,CAEA,GAAIjB,SAASK,kBAAmB,CAC/B,IAAK,KAAM,CAACc,GAAIC,SAAS,GAAIC,OAAOC,OAAO,CAACtB,QAAQK,iBAAiB,EAAG,CACvE,MAAMkB,YAAc5C,+BACnByC,SACA,CAAC,mBAAmB,EAAED,GAAG,CAAC,EAE3B,IAAK,MAAML,OAAOS,YAAa,CAC9BR,cACCP,IACA,qBACA,QACA,CAAC,kCAAkC,EAAEM,IAAIE,OAAO,CAAC,MAAM,EAAEF,IAAIG,UAAU,CAAC,GAAG,CAAC,CAC3E,gFACA,uFACD3B,UACA,CAAE4B,KAAMJ,IAAIG,UAAU,AAAC,EAEzB,CACD,CACD,CAGA,GAAIT,IAAIG,WAAW,CAACa,MAAM,CAAG,EAAG,CAC/B,MAAO,CACNC,MAAO,MACPd,YAAaH,IAAIG,WAAW,CAC5Be,aAAc,CAAC,CAChB,CACD,CAGA,MAAMA,aAAeC,iBAAiBxB,IAAKK,KAE3C,MAAMoB,UAAYpB,IAAIG,WAAW,CAACkB,IAAI,CAAC,AAACC,GAAMA,EAAEC,QAAQ,GAAK,SAE7D,MAAO,CACNN,MAAO,CAACG,UACRjB,YAAaH,IAAIG,WAAW,CAC5Be,aAAc3C,eAAe2C,aAC9B,CACD,CAsBA,SAASM,iBACRC,IAAuB,CACvBzB,GAAoB,EAEpB,OAAQyB,KAAKC,IAAI,EAChB,IAAK,mBACL,IAAK,mBAEJ,OAAO5C,SAER,KAAK,oBACJ,OAAO6C,gBAAgBF,KAAmCzB,IAE3D,KAAK,iBACJ,OAAO4B,eAAeH,KAAgCzB,IAEvD,SAGCO,cACCP,IACA,eACA,UACA,CAAC,4BAA4B,EAAEyB,KAAKC,IAAI,CAAC,CAAC,CAAC,CAC3CD,MAED,OAAO3C,SACT,CACD,CAWA,SAAS6C,gBACRF,IAA+B,CAC/BzB,GAAoB,EAIpB,GAAIyB,KAAKf,IAAI,CAACgB,IAAI,GAAK,gBAAiB,CACvCnB,cACCP,IACA,eACA,UACA,gDACAyB,MAED,MAAO,CAAC,CACT,CAKA,GAAIA,KAAKI,MAAM,CAACb,MAAM,CAAG,GAAKS,KAAKK,IAAI,CAAE,CACxC,MAAMC,WAAaC,kBAAkBP,KAAKf,IAAI,EAQ9C,GAAIqB,aAAexE,WAAW0E,eAAe,CAAE,CAC9C,OAAOC,iBAAiBT,KAAMzB,IAC/B,CAMA,GAAI+B,aAAezE,eAAe6E,mBAAmB,CAAE,CACtD,OAAOC,qBAAqBX,KAAMzB,IACnC,CAGA,MAAMqC,OAASrC,IAAII,OAAO,EAAEkC,IAAIP,YAChC,GAAIM,OAAQ,CACX,MAAME,aAAeF,OAAOR,MAAM,CAGlC,GAAIU,aAAc,CACjB,MAAMC,cAAgBD,aAAaE,MAAM,CAAC,AAACC,GAAM,CAACA,EAAEC,QAAQ,EAAE3B,MAAM,CACpE,GAAIS,KAAKI,MAAM,CAACb,MAAM,CAAGwB,cAAe,CACvCjC,cACCP,IACA,mBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,mBAAmB,EAAES,cAAc,sBAAsB,EAAEf,KAAKI,MAAM,CAACb,MAAM,CAAC,CAAC,CACrGS,KACA,CACCM,WACAa,SAAU,CAAC,EAAEJ,cAAc,YAAY,CAAC,CACxCK,OAAQ,CAAC,EAAEpB,KAAKI,MAAM,CAACb,MAAM,CAAC,YAAY,CAAC,AAC5C,EAEF,CACD,CAGA,IAAK,IAAI8B,EAAI,EAAGA,EAAIrB,KAAKI,MAAM,CAACb,MAAM,CAAE8B,IAAK,CAC5C,MAAMC,eAAiBC,iCACtBvB,KAAKI,MAAM,CAACiB,EAAE,CACd9C,IACAyB,MAKD,MAAMwB,YAAcV,cAAc,CAACO,EAAE,CACrC,GAAIC,gBAAkBE,aAAavB,KAAM,CACxC,MAAMwB,aAAeD,YAAYvB,IAAI,CACrC,GAAI,CAACyB,sBAAsBJ,eAAgBG,cAAe,CACzD,MAAME,UAAYH,YAAYI,IAAI,CAClC9C,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,aAAa,EAAEqB,UAAU,UAAU,EAAEE,gBAAgBJ,cAAc,UAAU,EAAEI,gBAAgBP,gBAAgB,CAAC,CACtItB,KACA,CACCM,WACAa,SAAUU,gBAAgBJ,cAC1BL,OAAQS,gBAAgBP,eACzB,EAEF,CACD,CACD,CAEA,OAAOV,OAAOkB,UAAU,EAAI,CAAE7B,KAAM,QAAS,CAC9C,CAGAnB,cACCP,IACA,iBACA,UACA,CAAC,uBAAuB,EAAE+B,WAAW,6BAA6B,CAAC,CACnEN,KACA,CAAEM,UAAW,GAEd,MAAO,CAAEL,KAAM,QAAS,CACzB,CAGA,MAAM8B,SAAWR,iCAAiCvB,KAAKf,IAAI,CAAEV,IAAKyB,OAAS,CAAC,EAI5E,GAAI3D,iBAAiB2D,KAAKf,IAAI,EAAG,CAChC,OAAO8C,QACR,CAMA,GAAI/B,KAAKf,IAAI,CAACgB,IAAI,GAAK,iBAAkB,CACxC,MAAM+B,SAAW/F,oBAAoB+D,KAAKf,IAAI,EAC9C,GAAI+C,SAASzC,MAAM,CAAG,EAAG,CACxB,KAAM,CAAE0C,aAAa,CAAEC,UAAU,CAAE,CAClClG,4BAA4BgG,UAC7B,GAAI,CAACzF,eAAe0F,eAAgB,CACnC,IAAIE,aACHD,aAAe,KACZ3D,IAAIH,iBAAiB,EAAE,CAAC8D,WAAW,CACnC3D,IAAIE,OAAO,CAGf,GAAI0D,cAAgBD,aAAe,KAAM,CACxC,MAAME,WAAaxF,kBAAkBuF,aAAc5D,IAAIC,IAAI,EAC3D,GAAI4D,aAAe/E,UAAW,CAC7B8E,aAAeC,UAChB,CACD,CACA,GAAID,cAAgB,CAACE,oBAAoBF,aAAcF,eAAgB,CACtE,OAAOK,aAAaP,SACrB,CACD,CACD,CACD,CAEA,OAAOA,QACR,CAcA,SAAStB,iBACRT,IAA+B,CAC/BzB,GAAoB,EAEpB,MAAM+B,WAAaxE,WAAW0E,eAAe,CAG7C,GAAIR,KAAKI,MAAM,CAACb,MAAM,CAAG,EAAG,CAC3BT,cACCP,IACA,mBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,0CAA0C,EAAEN,KAAKI,MAAM,CAACb,MAAM,CAAC,CAAC,CACtFS,KACA,CACCM,WACAa,SAAU,gBACVC,OAAQ,CAAC,EAAEpB,KAAKI,MAAM,CAACb,MAAM,CAAC,YAAY,CAAC,AAC5C,GAED,MAAO,CAAEU,KAAM,OAAQ,CACxB,CAGA,MAAMsC,eAAiBvC,KAAKI,MAAM,CAAC,EAAE,CACrC,MAAMoC,iBAAmBjB,iCACxBgB,eACAhE,IACAyB,MAGD,GAAI,CAACwC,iBAAkB,CAEtB,MAAO,CAAEvC,KAAM,OAAQ,CACxB,CAGA,MAAMmC,WAAaxF,kBAAkB4F,iBAAkBjE,IAAIC,IAAI,EAC/D,GAAI,CAAC4D,WAAY,CAChBtD,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,mDAAmD,EAAEuB,gBAAgBW,kBAAkB,CAAC,CAC9GxC,KACA,CACCM,WACAa,SAAU,QACVC,OAAQS,gBAAgBW,iBACzB,GAED,MAAO,CAAEvC,KAAM,OAAQ,CACxB,CAKA,IAAIwC,oBAAsBL,WAC1B,MAAMM,SAAWD,oBAAoBxC,IAAI,CACzC,GACCyC,WAAa,SACZC,MAAMC,OAAO,CAACF,WAAaA,SAASG,QAAQ,CAAC,SAC7C,CACD,MAAMC,WAAalG,kBAAkB6F,oBAAqBlE,IAAIC,IAAI,EAClE,GAAIsE,WAAY,CACfL,oBAAsBK,WAEtBhE,cACCP,IACA,uBACA,UACA,CAAC,KAAK,EAAE+B,WAAW,8EAA8E,CAAC,CACjG,CAAC,eAAe,EAAEqC,MAAMC,OAAO,CAACF,UAAYA,SAASK,IAAI,CAAC,OAASL,SAAS,0CAA0C,CAAC,CACxH1C,KACA,CACCM,WACAa,SAAU,SACVC,OAAQS,gBAAgBY,oBACzB,EAEF,CACD,CAEA,MAAMO,kBAAoBP,oBAAoBxC,IAAI,CAClD,MAAMgD,SACLD,oBAAsB,UACrBL,MAAMC,OAAO,CAACI,oBACdA,kBAAkBH,QAAQ,CAAC,WAE3B,CAACG,mBAAqBP,oBAAoBS,UAAU,GAAK7F,UAE3D,GAAI,CAAC4F,UAAYD,oBAAsB3F,UAAW,CACjDyB,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,8DAA8D,EAAEuB,gBAAgBY,qBAAqB,CAAC,CAAC,CAC7HzC,KACA,CACCM,WACAa,SAAU,SACVC,OAAQS,gBAAgBY,oBACzB,GAED,MAAO,CAAExC,KAAM,OAAQ,CACxB,CAGA,MAAMkD,aAAenD,KAAKI,MAAM,CAAC,EAAE,CAOnC,IAAIgD,aAEJ,GAAID,aAAalD,IAAI,GAAK,iBAAkB,CAC3C,MAAMoD,KAAO,AAACF,aAAwCG,QAAQ,CAC9DxE,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,gDAAgD,CAAC,CACtE,CAAC,OAAO,EAAEA,WAAW,IAAI,EAAE+C,KAAK,mBAAmB,EAAE/C,WAAW,GAAG,EAAE+C,KAAK,GAAG,CAAC,CAC/ErD,KACA,CACCM,WACAa,SAAU,kCACVC,OAAQ,CAAC,gBAAgB,EAAEiC,KAAK,CAAC,CAAC,AACnC,GAED,MAAO,CAAEpD,KAAM,OAAQ,CACxB,CAEA,GAAIkD,aAAalD,IAAI,GAAK,gBAAiB,CAC1CmD,aAAe,AAACD,aAAuCI,KAAK,AAC7D,CAEA,GAAI,CAACH,aAAc,CAClBtE,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,gEAAgE,EAAE6C,aAAalD,IAAI,CAAC,CAAC,CAC3GD,KACA,CACCM,WACAa,SAAU,kCACVC,OAAQ+B,aAAalD,IAAI,AAC1B,GAED,MAAO,CAAEA,KAAM,OAAQ,CACxB,CAGA,MAAMuD,eAAiB3G,kBAAkB4F,oBAAqB,CAACW,aAAa,EAC5E,GAAI,CAACI,eAAgB,CACpB,MAAMC,oBAAsBxG,uBAAuBwF,qBACnD3D,cACCP,IACA,mBACA,QACA/C,8BAA8B4H,aAAcK,qBAC5CzD,KACA,CACCf,KAAMmE,aACNK,mBACD,GAED,MAAO,CAAExD,KAAM,OAAQ,CACxB,CAGA,MAAO,CAAEA,KAAM,QAASyD,MAAOF,cAAe,CAC/C,CAgBA,SAAS7C,qBACRX,IAA+B,CAC/BzB,GAAoB,EAEpB,OAAOoF,mBAAmB3D,KAAKI,MAAM,CAA0B7B,IAAKyB,KACrE,CAMA,SAAS4D,4BACRC,IAA2B,CAC3BtF,GAAoB,CACpBuF,UAAyB,EAEzB,OAAOH,mBACNE,KAAKzD,MAAM,CACX7B,IACAuF,YAAcD,KAEhB,CAYA,SAASF,mBACRvD,MAA4B,CAC5B7B,GAAoB,CACpBwF,IAAkB,EAElB,MAAMzD,WAAazE,eAAe6E,mBAAmB,CAGrD,GAAIN,OAAOb,MAAM,CAAG,EAAG,CACtBT,cACCP,IACA,mBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,0CAA0C,EAAEF,OAAOb,MAAM,CAAC,CAAC,CACjFwE,KACA,CACCzD,WACAa,SAAU,gBACVC,OAAQ,CAAC,EAAEhB,OAAOb,MAAM,CAAC,YAAY,CAAC,AACvC,GAED,MAAO,CAAC,CACT,CAGA,MAAMyE,gBAAiC,EAAE,CACzC,IAAIC,mBAAqB,MAEzB,IAAK,IAAI5C,EAAI,EAAGA,EAAIjB,OAAOb,MAAM,CAAE8B,IAAK,CACvC,MAAM6C,MAAQ9D,MAAM,CAACiB,EAAE,CACvB,MAAMC,eAAiBC,iCAAiC2C,MAAO3F,IAAKwF,MAEpE,GAAIzC,eAAgB,CACnB0C,gBAAgBG,IAAI,CAAC7C,eACtB,CAGA,GAAI8C,uBAAuBF,MAAO3F,KAAM,CACvC0F,mBAAqB,IACtB,CACD,CAKA,GAAID,gBAAgBzE,MAAM,EAAI,EAAG,CAChC,MAAM8E,cAAgBL,gBAAgBM,IAAI,CAAC,AAACC,GAAMA,EAAEtE,IAAI,EACxD,GAAIoE,cAAe,CAClB,IAAK,IAAIhD,EAAI,EAAGA,EAAI2C,gBAAgBzE,MAAM,CAAE8B,IAAK,CAChD,MAAMmD,OAASR,eAAe,CAAC3C,EAAE,CACjC,GAAImD,OAAOvE,IAAI,EAAI,CAACyB,sBAAsB8C,OAAQH,eAAgB,CACjEvF,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,WAAW,EAAEe,EAAI,EAAE,UAAU,EAAEQ,gBAAgB2C,QAAQ,oBAAoB,EAAE3C,gBAAgBwC,eAAe,CAAC,CACnIN,KACA,CACCzD,WACAa,SAAUU,gBAAgBwC,eAC1BjD,OAAQS,gBAAgB2C,OACzB,EAEF,CACD,CACD,CACD,CAGA,GAAI,CAACP,mBAAoB,CACxBnF,cACCP,IACA,8BACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,8CAA8C,CAAC,CACpE,iEACDyD,KACA,CAAEzD,UAAW,EAEf,CAGA,GAAI0D,gBAAgBzE,MAAM,GAAK,EAAG,MAAO,CAAC,EAC1C,GAAIyE,gBAAgBzE,MAAM,GAAK,EAAG,OAAOyE,eAAe,CAAC,EAAE,CAE3D,OAAOlH,eAAe,CAAE2H,MAAOT,eAAgB,EAChD,CAWA,SAASI,uBACRP,IAAwB,CACxBtF,GAAoB,EAGpB,GACCsF,KAAK5D,IAAI,GAAK,iBACd4D,KAAK5D,IAAI,GAAK,iBACd4D,KAAK5D,IAAI,GAAK,iBACb,CACD,OAAO,IACR,CAGA,GAAI4D,KAAK5D,IAAI,GAAK,gBAAiB,CAClC,OAAO,IACR,CAGA,GAAI4D,KAAK5D,IAAI,GAAK,iBAAkB,CACnC,MAAM+B,SAAW/F,oBAAoB4H,MACrC,GAAI7B,SAASzC,MAAM,GAAK,EAAG,OAAO,MAElC,KAAM,CAAE0C,aAAa,CAAE,CAAGjG,4BAA4BgG,UACtD,OAAOrF,mBAAmB4B,IAAIE,OAAO,CAAEwD,cACxC,CAEA,OAAO,KACR,CAYA,SAASP,sBACRK,QAAqB,CACrBZ,QAAqB,EAGrB,GAAI,CAACA,SAASlB,IAAI,EAAI,CAAC8B,SAAS9B,IAAI,CAAE,OAAO,KAE7C,MAAMyE,cAAgB/B,MAAMC,OAAO,CAACzB,SAASlB,IAAI,EAC9CkB,SAASlB,IAAI,CACb,CAACkB,SAASlB,IAAI,CAAC,CAClB,MAAM0E,cAAgBhC,MAAMC,OAAO,CAACb,SAAS9B,IAAI,EAC9C8B,SAAS9B,IAAI,CACb,CAAC8B,SAAS9B,IAAI,CAAC,CAGlB,OAAO0E,cAAc/E,IAAI,CAAC,AAACgF,IAC1BF,cAAc9E,IAAI,CACjB,AAACiF,IACAD,KAAOC,IAENA,KAAO,UAAYD,KAAO,WAC1BC,KAAO,WAAaD,KAAO,UAGhC,CAeA,SAASlF,iBACRoF,OAAwB,CACxBvG,GAAoB,EAEpB,MAAMwG,UAAY7I,iBAAiB4I,SAGnC,GAAIC,UAAUxF,MAAM,GAAK,EAAG,CAC3B,MAAO,CAAEU,KAAM,QAAS,CACzB,CAGA,MAAM+E,WAAa5I,+BAA+B0I,SAClD,GAAIE,WAAY,CACf,OAAO9E,gBAAgB8E,WAAYzG,IACpC,CAGA,MAAM0G,YAAc9I,0BAA0B2I,SAC9C,GAAIG,YAAa,CAChB,OAAO9E,eAAe8E,YAAa1G,IACpC,CAKA,MAAM2G,WAAaH,UAAUI,KAAK,CAAC,AAACZ,GAAMA,EAAEtE,IAAI,GAAK,oBACrD,GAAIiF,WAAY,CACf,MAAM/H,KAAO4H,UACXK,GAAG,CAAC,AAACb,GAAM,AAACA,EAA+BhB,KAAK,EAChDR,IAAI,CAAC,IACLsC,IAAI,GAEN,GAAIlI,OAAS,GAAI,MAAO,CAAE8C,KAAM,QAAS,EAazC,MAAMqF,YAAc/G,IAAIN,YAAY,EAAEgC,KACtC,GACC,OAAOqF,cAAgB,UACtBA,CAAAA,cAAgB,UAChBA,cAAgB,UAChBA,cAAgB,WAChBA,cAAgB,WAChBA,cAAgB,MAAK,EACrB,CACD,MAAMC,aAAerI,gBAAgBC,KAAMmI,aAC3C,MAAO,CAAErF,KAAMqF,YAAaE,MAAOD,YAAa,CACjD,CAEA,MAAME,YAAc1J,kBAAkBoB,MACtC,GAAIsI,YAAa,MAAO,CAAExF,KAAMwF,WAAY,CAC7C,CAUA,MAAMC,UAAYX,UAAUI,KAAK,CAAC,AAACZ,GAAMA,EAAEtE,IAAI,GAAK,kBACpD,GAAIyF,UAAW,CACd,MAAMC,MAAuB,EAAE,CAC/B,IAAK,MAAM3F,QAAQ+E,UAAW,CAC7B,MAAMa,EAAIzF,eAAeH,KAAgCzB,KACzD,GAAIqH,EAAGD,MAAMxB,IAAI,CAACyB,EACnB,CACA,GAAID,MAAMpG,MAAM,GAAK,EAAG,OAAOoG,KAAK,CAAC,EAAE,CACvC,GAAIA,MAAMpG,MAAM,CAAG,EAAG,OAAOzC,eAAe,CAAE2H,MAAOkB,KAAM,GAC3D,MAAO,CAAE1F,KAAM,QAAS,CACzB,CAKA,IAAK,MAAMD,QAAQ8E,QAAQe,IAAI,CAAE,CAChC9F,iBAAiBC,KAAMzB,IACxB,CACA,MAAO,CAAE0B,KAAM,QAAS,CACzB,CAaA,SAASE,eACRH,IAA4B,CAC5BzB,GAAoB,EAEpB,MAAM+B,WAAawF,mBAAmB9F,MAEtC,OAAQM,YAGP,IAAK,KACL,IAAK,SAAU,CACd,MAAMyF,IAAMC,iBAAiBhG,MAC7B,GAAI+F,IAAK,CACRxE,iCAAiCwE,IAAKxH,IAAKyB,KAC5C,KAAO,CACNlB,cACCP,IACA,mBACA,QACAhD,6BAA6B+E,YAC7BN,KACA,CAAEM,UAAW,EAEf,CAGA,MAAM2F,SAAWvG,iBAAiBM,KAAK8E,OAAO,CAAEvG,KAEhD,GAAIyB,KAAKkG,OAAO,CAAE,CACjB,MAAMC,SAAWzG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KAEhD,GAAIxB,UAAUkJ,SAAUE,UAAW,OAAOF,SAE1C,OAAOnJ,eAAe,CAAE2H,MAAO,CAACwB,SAAUE,SAAS,AAAC,EACrD,CAIA,OAAOF,QACR,CAKA,IAAK,OAAQ,CACZ,MAAMF,IAAMC,iBAAiBhG,MAC7B,GAAI,CAAC+F,IAAK,CACTjH,cACCP,IACA,mBACA,QACAhD,6BAA6B,QAC7ByE,KACA,CAAEM,WAAY,MAAO,GAGtB,MAAM8F,MAAQ7H,IAAIE,OAAO,AACzBF,CAAAA,IAAIE,OAAO,CAAG,CAAC,EACfiB,iBAAiBM,KAAK8E,OAAO,CAAEvG,IAC/BA,CAAAA,IAAIE,OAAO,CAAG2H,MACd,GAAIpG,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KACjD,MAAO,CAAE0B,KAAM,QAAS,CACzB,CAEA,MAAMuC,iBAAmBjB,iCAAiCwE,IAAKxH,IAAKyB,MACpE,GAAI,CAACwC,iBAAkB,CAEtB,MAAM4D,MAAQ7H,IAAIE,OAAO,AACzBF,CAAAA,IAAIE,OAAO,CAAG,CAAC,EACfiB,iBAAiBM,KAAK8E,OAAO,CAAEvG,IAC/BA,CAAAA,IAAIE,OAAO,CAAG2H,MACd,GAAIpG,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KACjD,MAAO,CAAE0B,KAAM,QAAS,CACzB,CAGA,MAAMmC,WAAaxF,kBAAkB4F,iBAAkBjE,IAAIC,IAAI,EAC/D,GAAI,CAAC4D,WAAY,CAChBtD,cACCP,IACA,gBACA,QACA7C,0BACC,OACA,WACAmG,gBAAgBW,mBAEjBxC,KACA,CACCM,WAAY,OACZa,SAAU,QACVC,OAAQS,gBAAgBW,iBACzB,GAGD,MAAM4D,MAAQ7H,IAAIE,OAAO,AACzBF,CAAAA,IAAIE,OAAO,CAAG,CAAC,EACfiB,iBAAiBM,KAAK8E,OAAO,CAAEvG,IAC/BA,CAAAA,IAAIE,OAAO,CAAG2H,MACd,GAAIpG,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KACjD,MAAO,CAAE0B,KAAM,QAAS,CACzB,CAGA,MAAMmG,MAAQ7H,IAAIE,OAAO,AACzBF,CAAAA,IAAIE,OAAO,CAAG2D,WACd1C,iBAAiBM,KAAK8E,OAAO,CAAEvG,IAC/BA,CAAAA,IAAIE,OAAO,CAAG2H,MAGd,GAAIpG,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KAGjD,MAAO,CAAE0B,KAAM,QAAS,CACzB,CAKA,IAAK,OAAQ,CACZ,MAAM8F,IAAMC,iBAAiBhG,MAC7B,GAAI,CAAC+F,IAAK,CACTjH,cACCP,IACA,mBACA,QACAhD,6BAA6B,QAC7ByE,KACA,CAAEM,WAAY,MAAO,GAGtB,MAAM8F,MAAQ7H,IAAIE,OAAO,AACzBF,CAAAA,IAAIE,OAAO,CAAG,CAAC,EACf,MAAM4H,OAAS3G,iBAAiBM,KAAK8E,OAAO,CAAEvG,IAC9CA,CAAAA,IAAIE,OAAO,CAAG2H,MACd,GAAIpG,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KACjD,OAAO8H,MACR,CAEA,MAAMC,YAAc/E,iCAAiCwE,IAAKxH,IAAKyB,MAE/D,MAAMoG,MAAQ7H,IAAIE,OAAO,AACzBF,CAAAA,IAAIE,OAAO,CAAG6H,aAAe,CAAC,EAC9B,MAAMD,OAAS3G,iBAAiBM,KAAK8E,OAAO,CAAEvG,IAC9CA,CAAAA,IAAIE,OAAO,CAAG2H,MAGd,GAAIpG,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KAEjD,OAAO8H,MACR,CAGA,QAAS,CACR,MAAMzF,OAASrC,IAAII,OAAO,EAAEkC,IAAIP,YAChC,GAAIM,OAAQ,CAEX,IAAK,MAAMsD,SAASlE,KAAKI,MAAM,CAAE,CAChCmB,iCACC2C,MACA3F,IACAyB,KAEF,CAEAN,iBAAiBM,KAAK8E,OAAO,CAAEvG,KAC/B,GAAIyB,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KACjD,OAAOqC,OAAOkB,UAAU,EAAI,CAAE7B,KAAM,QAAS,CAC9C,CAGAnB,cACCP,IACA,iBACA,UACA3C,2BAA2B0E,YAC3BN,KACA,CAAEM,UAAW,GAGdZ,iBAAiBM,KAAK8E,OAAO,CAAEvG,KAC/B,GAAIyB,KAAKkG,OAAO,CAAExG,iBAAiBM,KAAKkG,OAAO,CAAE3H,KACjD,MAAO,CAAE0B,KAAM,QAAS,CACzB,CACD,CACD,CAqBA,MAAMsG,sBAAqD,CAC1DC,MAAO,CAAEvG,KAAM,QAAS,EACxBwG,MAAO,CAAExG,KAAM,SAAU,EACzByG,KAAM,CAAEzG,KAAM,SAAU,EACxB0G,IAAK,CAAE1G,KAAM,QAAS,CACvB,EAQA,SAAS2G,sBAAsB/C,IAA4B,EAC1D,MAAMjC,KAAOiC,KAAKgD,KAAK,CAAC,EAAE,CAC1B,GAAIjF,MAAQA,QAAQ2E,sBAAuB,CAC1C,OAAOA,qBAAqB,CAAC3E,KAAK,AACnC,CAEA,MAAO,CAAC,CACT,CAEA,SAASL,iCACRsC,IAAwB,CACxBtF,GAAoB,CAEpBuF,UAAyB,EAGzB,GAAItH,iBAAiBqH,MAAO,CAC3B,OAAOtF,IAAIE,OAAO,AACnB,CAMA,GAAIpC,iBAAiBwH,MAAO,CAC3B,OAAO+C,sBAAsB/C,KAC9B,CAGA,GAAIA,KAAK5D,IAAI,GAAK,gBAAiB,CAClC,OAAO6G,qBAAqBjD,KAA+BtF,IAAKuF,WACjE,CAEA,MAAM9B,SAAW/F,oBAAoB4H,MACrC,GAAI7B,SAASzC,MAAM,GAAK,EAAG,CAE1B,GAAIsE,KAAK5D,IAAI,GAAK,gBAAiB,MAAO,CAAEA,KAAM,QAAS,EAC3D,GAAI4D,KAAK5D,IAAI,GAAK,gBAAiB,MAAO,CAAEA,KAAM,QAAS,EAC3D,GAAI4D,KAAK5D,IAAI,GAAK,iBAAkB,MAAO,CAAEA,KAAM,SAAU,EAC7D,GAAI4D,KAAK5D,IAAI,GAAK,cAAe,MAAO,CAAEA,KAAM,MAAO,EACvD,GAAI4D,KAAK5D,IAAI,GAAK,mBAAoB,MAAO,CAAC,EAE9CnB,cACCP,IACA,eACA,UACA5C,0BAA0BkI,KAAK5D,IAAI,EACnC6D,YAAcD,MAEf,OAAOxG,SACR,CAKA,KAAM,CAAE4E,aAAa,CAAEC,UAAU,CAAE,CAAGlG,4BAA4BgG,UAKlE,GAAI1F,oBAAoB2F,eAAgB,CACvC,MAAM8E,SAAW9E,cAAcc,IAAI,CAAC,KACpCjE,cACCP,IACA,sBACA,QACA9C,+BAA+BsL,UAC/BjD,YAAcD,KACd,CAAE5E,KAAM8H,QAAS,GAElB,OAAO1J,SACR,CAIA,GAAId,eAAe0F,eAAgB,CAClC,GAAIC,aAAe,KAAM,CACxB,OAAO8E,0BAA0B9E,WAAY3D,IAAKuF,YAAcD,KACjE,CACA,OAAOtF,IAAIE,OAAO,AACnB,CAEA,GAAIyD,aAAe,KAAM,CAGxB,OAAO+E,sBACNhF,cACAC,WACA3D,IACAuF,YAAcD,KAEhB,CAGA,MAAM9B,SAAWlF,kBAAkB0B,IAAIE,OAAO,CAAEwD,eAChD,GAAIF,WAAa1E,UAAW,CAC3B,MAAM0J,SAAW9E,cAAcc,IAAI,CAAC,KACpC,MAAMU,oBAAsBxG,uBAAuBsB,IAAIE,OAAO,EAC9DK,cACCP,IACA,mBACA,QACA/C,8BAA8BuL,SAAUtD,qBACxCK,YAAcD,KACd,CAAE5E,KAAM8H,SAAUtD,mBAAoB,GAEvC,OAAOpG,SACR,CAEA,OAAO0E,QACR,CAiBA,SAASiF,0BACR9E,UAAkB,CAClB3D,GAAoB,CACpBwF,IAAkB,EAGlB,GAAI,CAACxF,IAAIH,iBAAiB,CAAE,CAC3BU,cACCP,IACA,6BACA,QACA,CAAC,gBAAgB,EAAE2D,WAAW,4DAA4D,CAAC,CAC3F6B,KACA,CAAE9E,KAAM,CAAC,MAAM,EAAEiD,WAAW,CAAC,CAAEA,UAAW,GAE3C,OAAO7E,SACR,CAGA,MAAM8B,SAAWZ,IAAIH,iBAAiB,CAAC8D,WAAW,CAClD,GAAI,CAAC/C,SAAU,CACdL,cACCP,IACA,qBACA,QACA,CAAC,gBAAgB,EAAE2D,WAAW,wBAAwB,EAAEA,WAAW,yCAAyC,CAAC,CAC7G6B,KACA,CAAE9E,KAAM,CAAC,MAAM,EAAEiD,WAAW,CAAC,CAAEA,UAAW,GAE3C,OAAO7E,SACR,CAKA,OAAO8B,QACR,CAiBA,SAAS8H,sBACRhF,aAAuB,CACvBC,UAAkB,CAClB3D,GAAoB,CACpBwF,IAAkB,EAElB,MAAMgD,SAAW9E,cAAcc,IAAI,CAAC,KAGpC,GAAI,CAACxE,IAAIH,iBAAiB,CAAE,CAC3BU,cACCP,IACA,6BACA,QACA,CAAC,UAAU,EAAEwI,SAAS,CAAC,EAAE7E,WAAW,4DAA4D,CAAC,CACjG6B,KACA,CAAE9E,KAAM,CAAC,EAAE8H,SAAS,CAAC,EAAE7E,WAAW,CAAC,CAAEA,UAAW,GAEjD,OAAO7E,SACR,CAGA,MAAM8B,SAAWZ,IAAIH,iBAAiB,CAAC8D,WAAW,CAClD,GAAI,CAAC/C,SAAU,CACdL,cACCP,IACA,qBACA,QACA,CAAC,UAAU,EAAEwI,SAAS,CAAC,EAAE7E,WAAW,wBAAwB,EAAEA,WAAW,yCAAyC,CAAC,CACnH6B,KACA,CAAE9E,KAAM,CAAC,EAAE8H,SAAS,CAAC,EAAE7E,WAAW,CAAC,CAAEA,UAAW,GAEjD,OAAO7E,SACR,CAWA,MAAM+E,WAAaxF,kBAAkBuC,SAAUZ,IAAIC,IAAI,EACvD,GAAI4D,aAAe/E,UAAW,CAE7B,MAAM0E,SAAWlF,kBAAkBuF,WAAYH,eAC/C,GAAIF,WAAa1E,UAAW,CAC3B,MAAMoG,oBAAsBxG,uBAAuBmF,YACnDtD,cACCP,IACA,gCACA,QACA,CAAC,UAAU,EAAEwI,SAAS,oDAAoD,EAAE7E,WAAW,CAAC,CACxF6B,KACA,CACC9E,KAAM8H,SACN7E,WACAuB,mBACD,GAED,OAAOpG,SACR,CAEA,MAAO,CAAE4C,KAAM,QAASyD,MAAO3B,QAAS,CACzC,CAIA,MAAMA,SAAWlF,kBAAkBsC,SAAU8C,eAC7C,GAAIF,WAAa1E,UAAW,CAC3B,MAAMoG,oBAAsBxG,uBAAuBkC,UACnDL,cACCP,IACA,gCACA,QACA,CAAC,UAAU,EAAEwI,SAAS,8CAA8C,EAAE7E,WAAW,CAAC,CAClF6B,KACA,CACC9E,KAAM8H,SACN7E,WACAuB,mBACD,GAED,OAAOpG,SACR,CAEA,OAAO0E,QACR,CAaA,SAASO,aAAakC,MAAmB,EACxC,GAAIA,OAAOvE,IAAI,GAAK,OAAQ,OAAOuE,OAEnC,GAAI,OAAOA,OAAOvE,IAAI,GAAK,SAAU,CACpC,MAAO,CAAE,GAAGuE,MAAM,CAAEvE,KAAM,CAACuE,OAAOvE,IAAI,CAAE,OAAO,AAAC,CACjD,CAEA,GAAI0C,MAAMC,OAAO,CAAC4B,OAAOvE,IAAI,EAAG,CAC/B,GAAIuE,OAAOvE,IAAI,CAAC4C,QAAQ,CAAC,QAAS,OAAO2B,OACzC,MAAO,CAAE,GAAGA,MAAM,CAAEvE,KAAM,IAAIuE,OAAOvE,IAAI,CAAE,OAAO,AAAC,CACpD,CAGA,OAAOnD,eAAe,CAAE2H,MAAO,CAACD,OAAQ,CAAEvE,KAAM,MAAO,EAAE,AAAC,EAC3D,CAiBA,SAASoC,oBAAoBmC,MAAmB,CAAExC,QAAkB,EACnE,IAAK,IAAIX,EAAI,EAAGA,GAAKW,SAASzC,MAAM,CAAE8B,IAAK,CAC1C,GAAI,CAAC1E,mBAAmB6H,OAAQxC,SAASkF,KAAK,CAAC,EAAG7F,IAAK,CAItD,GAAIA,GAAK,EAAG,CACX,MAAM8F,aAAetK,kBACpB2H,OACAxC,SAASkF,KAAK,CAAC,EAAG7F,EAAI,IAEvB,GAAI8F,cAAgBA,aAAalH,IAAI,GAAK,QAAS,CAClD,QACD,CACD,CACA,OAAO,KACR,CACD,CACA,OAAO,IACR,CA2BA,SAAS6G,qBACRjD,IAA2B,CAC3BtF,GAAoB,CACpBuF,UAAyB,EAEzB,MAAMxD,WAAaC,kBAAkBsD,KAAK5E,IAAI,EAO9C,GAAIqB,aAAexE,WAAW0E,eAAe,CAAE,CAC9C,OAAO4G,wBAAwBvD,KAAMtF,IAAKuF,WAC3C,CAGA,GAAIxD,aAAezE,eAAe6E,mBAAmB,CAAE,CACtD,OAAOkD,4BAA4BC,KAAMtF,IAAKuF,WAC/C,CAEA,MAAMlD,OAASrC,IAAII,OAAO,EAAEkC,IAAIP,YAChC,GAAI,CAACM,OAAQ,CACZ9B,cACCP,IACA,iBACA,UACA,CAAC,+BAA+B,EAAE+B,WAAW,6BAA6B,CAAC,CAC3EwD,YAAcD,KACd,CAAEvD,UAAW,GAEd,MAAO,CAAEL,KAAM,QAAS,CACzB,CAEA,MAAMa,aAAeF,OAAOR,MAAM,CAGlC,GAAIU,aAAc,CACjB,MAAMC,cAAgBD,aAAaE,MAAM,CAAC,AAACC,GAAM,CAACA,EAAEC,QAAQ,EAAE3B,MAAM,CACpE,GAAIsE,KAAKzD,MAAM,CAACb,MAAM,CAAGwB,cAAe,CACvCjC,cACCP,IACA,mBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,mBAAmB,EAAES,cAAc,sBAAsB,EAAE8C,KAAKzD,MAAM,CAACb,MAAM,CAAC,CAAC,CACrGuE,YAAcD,KACd,CACCvD,WACAa,SAAU,CAAC,EAAEJ,cAAc,YAAY,CAAC,CACxCK,OAAQ,CAAC,EAAEyC,KAAKzD,MAAM,CAACb,MAAM,CAAC,YAAY,CAAC,AAC5C,EAEF,CACD,CAGA,IAAK,IAAI8B,EAAI,EAAGA,EAAIwC,KAAKzD,MAAM,CAACb,MAAM,CAAE8B,IAAK,CAC5C,MAAMC,eAAiBC,iCACtBsC,KAAKzD,MAAM,CAACiB,EAAE,CACd9C,IACAuF,YAAcD,MAGf,MAAMrC,YAAcV,cAAc,CAACO,EAAE,CACrC,GAAIC,gBAAkBE,aAAavB,KAAM,CACxC,MAAMwB,aAAeD,YAAYvB,IAAI,CACrC,GAAI,CAACyB,sBAAsBJ,eAAgBG,cAAe,CACzD,MAAME,UAAYH,YAAYI,IAAI,CAClC9C,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,aAAa,EAAEqB,UAAU,UAAU,EAAEE,gBAAgBJ,cAAc,UAAU,EAAEI,gBAAgBP,gBAAgB,CAAC,CACtIwC,YAAcD,KACd,CACCvD,WACAa,SAAUU,gBAAgBJ,cAC1BL,OAAQS,gBAAgBP,eACzB,EAEF,CACD,CACD,CAEA,OAAOV,OAAOkB,UAAU,EAAI,CAAE7B,KAAM,QAAS,CAC9C,CAOA,SAASmH,wBACRvD,IAA2B,CAC3BtF,GAAoB,CACpBuF,UAAyB,EAEzB,MAAMxD,WAAaxE,WAAW0E,eAAe,CAC7C,MAAMuD,KAAOD,YAAcD,KAG3B,GAAIA,KAAKzD,MAAM,CAACb,MAAM,CAAG,EAAG,CAC3BT,cACCP,IACA,mBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,0CAA0C,EAAEuD,KAAKzD,MAAM,CAACb,MAAM,CAAC,CAAC,CACtFwE,KACA,CACCzD,WACAa,SAAU,gBACVC,OAAQ,CAAC,EAAEyC,KAAKzD,MAAM,CAACb,MAAM,CAAC,YAAY,CAAC,AAC5C,GAED,MAAO,CAAEU,KAAM,OAAQ,CACxB,CAGA,MAAMsC,eAAiBsB,KAAKzD,MAAM,CAAC,EAAE,CACrC,MAAMoC,iBAAmBjB,iCACxBgB,eACAhE,IACAwF,MAGD,GAAI,CAACvB,iBAAkB,CACtB,MAAO,CAAEvC,KAAM,OAAQ,CACxB,CAGA,MAAMmC,WAAaxF,kBAAkB4F,iBAAkBjE,IAAIC,IAAI,EAC/D,GAAI,CAAC4D,WAAY,CAChBtD,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,mDAAmD,EAAEuB,gBAAgBW,kBAAkB,CAAC,CAC9GuB,KACA,CACCzD,WACAa,SAAU,QACVC,OAAQS,gBAAgBW,iBACzB,GAED,MAAO,CAAEvC,KAAM,OAAQ,CACxB,CAKA,IAAIwC,oBAAsBL,WAC1B,MAAMM,SAAWD,oBAAoBxC,IAAI,CACzC,GACCyC,WAAa,SACZC,MAAMC,OAAO,CAACF,WAAaA,SAASG,QAAQ,CAAC,SAC7C,CACD,MAAMC,WAAalG,kBAAkB6F,oBAAqBlE,IAAIC,IAAI,EAClE,GAAIsE,WAAY,CACfL,oBAAsBK,UACvB,CACD,CAEA,MAAME,kBAAoBP,oBAAoBxC,IAAI,CAClD,MAAMgD,SACLD,oBAAsB,UACrBL,MAAMC,OAAO,CAACI,oBACdA,kBAAkBH,QAAQ,CAAC,WAC3B,CAACG,mBAAqBP,oBAAoBS,UAAU,GAAK7F,UAE3D,GAAI,CAAC4F,UAAYD,oBAAsB3F,UAAW,CACjDyB,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,8DAA8D,EAAEuB,gBAAgBY,qBAAqB,CAAC,CAAC,CAC7HsB,KACA,CACCzD,WACAa,SAAU,SACVC,OAAQS,gBAAgBY,oBACzB,GAED,MAAO,CAAExC,KAAM,OAAQ,CACxB,CAGA,MAAMkD,aAAeU,KAAKzD,MAAM,CAAC,EAAE,CACnC,IAAIgD,aAEJ,GAAID,aAAalD,IAAI,GAAK,iBAAkB,CAC3C,MAAMoD,KAAO,AAACF,aAAwCG,QAAQ,CAC9DxE,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,gDAAgD,CAAC,CACtE,CAAC,KAAK,EAAEA,WAAW,IAAI,EAAE+C,KAAK,eAAe,EAAE/C,WAAW,GAAG,EAAE+C,KAAK,CAAC,CAAC,CACvEU,KACA,CACCzD,WACAa,SAAU,kCACVC,OAAQ,CAAC,gBAAgB,EAAEiC,KAAK,CAAC,CAAC,AACnC,GAED,MAAO,CAAEpD,KAAM,OAAQ,CACxB,CAEA,GAAIkD,aAAalD,IAAI,GAAK,gBAAiB,CAC1CmD,aAAe,AAACD,aAAuCI,KAAK,AAC7D,CAEA,GAAI,CAACH,aAAc,CAClBtE,cACCP,IACA,gBACA,QACA,CAAC,QAAQ,EAAE+B,WAAW,gEAAgE,EAAE6C,aAAalD,IAAI,CAAC,CAAC,CAC3G8D,KACA,CACCzD,WACAa,SAAU,kCACVC,OAAQ+B,aAAalD,IAAI,AAC1B,GAED,MAAO,CAAEA,KAAM,OAAQ,CACxB,CAGA,MAAMuD,eAAiB3G,kBAAkB4F,oBAAqB,CAACW,aAAa,EAC5E,GAAI,CAACI,eAAgB,CACpB,MAAMC,oBAAsBxG,uBAAuBwF,qBACnD3D,cACCP,IACA,mBACA,QACA/C,8BAA8B4H,aAAcK,qBAC5CM,KACA,CACC9E,KAAMmE,aACNK,mBACD,GAED,MAAO,CAAExD,KAAM,OAAQ,CACxB,CAGA,MAAO,CAAEA,KAAM,QAASyD,MAAOF,cAAe,CAC/C,CAEA,SAASwC,iBACRhG,IAA4B,EAE5B,OAAOA,KAAKI,MAAM,CAAC,EAAE,AACtB,CAKA,SAAS0F,mBAAmB9F,IAA4B,EACvD,GAAIA,KAAKf,IAAI,CAACgB,IAAI,GAAK,iBAAkB,CACxC,OAAO,AAACD,KAAKf,IAAI,CAA4BqE,QAAQ,AACtD,CACA,MAAO,EACR,CAMA,SAAS/C,kBAAkBsD,IAAwB,EAClD,GAAIA,KAAK5D,IAAI,GAAK,iBAAkB,CACnC,OAAO,AAAC4D,KAAgCP,QAAQ,AACjD,CACA,MAAO,EACR,CAWA,SAASxE,cACRP,GAAoB,CACpB8I,IAAoB,CACpBvH,QAA6B,CAC7BwH,OAAe,CACfvD,IAAmB,CACnBwD,OAA2B,EAE3B,MAAMC,WAAiC,CAAE1H,SAAUuH,KAAMC,OAAQ,EAGjE,GAAIvD,MAAQ,QAASA,MAAQA,KAAKlF,GAAG,CAAE,CACtC2I,WAAW3I,GAAG,CAAG,CAChB4I,MAAO,CAAEC,KAAM3D,KAAKlF,GAAG,CAAC4I,KAAK,CAACC,IAAI,CAAEC,OAAQ5D,KAAKlF,GAAG,CAAC4I,KAAK,CAACE,MAAM,AAAC,EAClEC,IAAK,CAAEF,KAAM3D,KAAKlF,GAAG,CAAC+I,GAAG,CAACF,IAAI,CAAEC,OAAQ5D,KAAKlF,GAAG,CAAC+I,GAAG,CAACD,MAAM,AAAC,CAC7D,CAEAH,CAAAA,WAAWK,MAAM,CAAG7K,qBAAqBuB,IAAIV,QAAQ,CAAE2J,WAAW3I,GAAG,CACtE,CAEA,GAAI0I,QAAS,CACZC,WAAWD,OAAO,CAAGA,OACtB,CAEAhJ,IAAIG,WAAW,CAACyF,IAAI,CAACqD,WACtB,CAKA,SAAS3F,gBAAgB2C,MAAmB,EAC3C,GAAIA,OAAOvE,IAAI,CAAE,CAChB,OAAO0C,MAAMC,OAAO,CAAC4B,OAAOvE,IAAI,EAAIuE,OAAOvE,IAAI,CAAC8C,IAAI,CAAC,OAASyB,OAAOvE,IAAI,AAC1E,CACA,GAAIuE,OAAOC,KAAK,CAAE,MAAO,aACzB,GAAID,OAAOsD,KAAK,CAAE,MAAO,aACzB,GAAItD,OAAOuD,KAAK,CAAE,MAAO,aACzB,GAAIvD,OAAOwD,IAAI,CAAE,MAAO,OACxB,MAAO,SACR,CAKA,OAAS7H,cAAc,CAAG"}
package/dist/esm/parser.d.ts CHANGED
@@ -38,6 +38,14 @@ export declare function extractPathSegments(expr: hbs.AST.Expression): string[];
38
38
  * (used inside `{{#each}}` blocks).
39
39
  */
40
40
  export declare function isThisExpression(expr: hbs.AST.Expression): boolean;
41
+ /**
42
+ * Checks whether an AST expression is a Handlebars `@data` variable
43
+ * (e.g. `@index`, `@first`, `@last`, `@key`).
44
+ *
45
+ * These variables are injected by Handlebars at runtime inside block helpers
46
+ * and are not part of the user-provided input schema.
47
+ */
48
+ export declare function isDataExpression(expr: hbs.AST.Expression): boolean;
41
49
  /**
42
50
  * Checks whether an AST expression is a `PathExpression` whose first
43
51
  * segment is the `$root` token.
package/dist/esm/parser.js CHANGED
@@ -1,2 +1,2 @@
1
- import Handlebars from"handlebars";import{TemplateParseError}from"./errors.js";export const ROOT_TOKEN="$root";const IDENTIFIER_RE=/^(.+):(-?\d+)$/;const NUMERIC_LITERAL_RE=/^-?\d+(\.\d+)?$/;export function parse(template){try{return Handlebars.parse(template)}catch(error){const message=error instanceof Error?error.message:String(error);const locMatch=message.match(/line\s+(\d+).*?column\s+(\d+)/i);const loc=locMatch?{line:parseInt(locMatch[1]??"0",10),column:parseInt(locMatch[2]??"0",10)}:undefined;throw new TemplateParseError(message,loc)}}export function isSingleExpression(ast){const{body}=ast;return body.length===1&&body[0]?.type==="MustacheStatement"}export function extractPathSegments(expr){if(expr.type==="PathExpression"){return expr.parts}return[]}export function isThisExpression(expr){if(expr.type!=="PathExpression")return false;const path=expr;return path.original==="this"||path.original==="."}export function isRootExpression(expr){if(expr.type!=="PathExpression")return false;const path=expr;return path.parts.length>0&&path.parts[0]===ROOT_TOKEN}export function isRootSegments(cleanSegments){return cleanSegments.length===1&&cleanSegments[0]===ROOT_TOKEN}export function isRootPathTraversal(cleanSegments){return cleanSegments.length>1&&cleanSegments[0]===ROOT_TOKEN}export function getEffectiveBody(program){return program.body.filter(s=>!(s.type==="ContentStatement"&&s.value.trim()===""))}export function getEffectivelySingleBlock(program){const effective=getEffectiveBody(program);if(effective.length===1&&effective[0]?.type==="BlockStatement"){return effective[0]}return null}export function getEffectivelySingleExpression(program){const effective=getEffectiveBody(program);if(effective.length===1&&effective[0]?.type==="MustacheStatement"){return effective[0]}return null}export function hasHandlebarsExpression(value){return value.includes("{{")}export function canUseFastPath(ast){return ast.body.every(s=>s.type==="ContentStatement"||s.type==="MustacheStatement"&&s.params.length===0&&!s.hash)}export function detectLiteralType(text){if(NUMERIC_LITERAL_RE.test(text))return"number";if(text==="true"||text==="false")return"boolean";if(text==="null")return"null";return null}export function coerceLiteral(raw){const trimmed=raw.trim();const type=detectLiteralType(trimmed);if(type==="number")return Number(trimmed);if(type==="boolean")return trimmed==="true";if(type==="null")return null;return raw}export function parseIdentifier(segment){const match=segment.match(IDENTIFIER_RE);if(match){return{key:match[1]??segment,identifier:parseInt(match[2]??"0",10)}}return{key:segment,identifier:null}}export function extractExpressionIdentifier(segments){if(segments.length===0){return{cleanSegments:[],identifier:null}}const lastSegment=segments[segments.length-1];const parsed=parseIdentifier(lastSegment);if(parsed.identifier!==null){const cleanSegments=[...segments.slice(0,-1),parsed.key];return{cleanSegments,identifier:parsed.identifier}}return{cleanSegments:segments,identifier:null}}
1
+ import Handlebars from"handlebars";import{TemplateParseError}from"./errors.js";export const ROOT_TOKEN="$root";const IDENTIFIER_RE=/^(.+):(-?\d+)$/;const NUMERIC_LITERAL_RE=/^-?\d+(\.\d+)?$/;export function parse(template){try{return Handlebars.parse(template)}catch(error){const message=error instanceof Error?error.message:String(error);const locMatch=message.match(/line\s+(\d+).*?column\s+(\d+)/i);const loc=locMatch?{line:parseInt(locMatch[1]??"0",10),column:parseInt(locMatch[2]??"0",10)}:undefined;throw new TemplateParseError(message,loc)}}export function isSingleExpression(ast){const{body}=ast;return body.length===1&&body[0]?.type==="MustacheStatement"}export function extractPathSegments(expr){if(expr.type==="PathExpression"){return expr.parts}return[]}export function isThisExpression(expr){if(expr.type!=="PathExpression")return false;const path=expr;return path.original==="this"||path.original==="."}export function isDataExpression(expr){if(expr.type!=="PathExpression")return false;return expr.data===true}export function isRootExpression(expr){if(expr.type!=="PathExpression")return false;const path=expr;return path.parts.length>0&&path.parts[0]===ROOT_TOKEN}export function isRootSegments(cleanSegments){return cleanSegments.length===1&&cleanSegments[0]===ROOT_TOKEN}export function isRootPathTraversal(cleanSegments){return cleanSegments.length>1&&cleanSegments[0]===ROOT_TOKEN}export function getEffectiveBody(program){return program.body.filter(s=>!(s.type==="ContentStatement"&&s.value.trim()===""))}export function getEffectivelySingleBlock(program){const effective=getEffectiveBody(program);if(effective.length===1&&effective[0]?.type==="BlockStatement"){return effective[0]}return null}export function getEffectivelySingleExpression(program){const effective=getEffectiveBody(program);if(effective.length===1&&effective[0]?.type==="MustacheStatement"){return effective[0]}return null}export function hasHandlebarsExpression(value){return value.includes("{{")}export function canUseFastPath(ast){return ast.body.every(s=>s.type==="ContentStatement"||s.type==="MustacheStatement"&&s.params.length===0&&!s.hash)}export function detectLiteralType(text){if(NUMERIC_LITERAL_RE.test(text))return"number";if(text==="true"||text==="false")return"boolean";if(text==="null")return"null";return null}export function coerceLiteral(raw){const trimmed=raw.trim();const type=detectLiteralType(trimmed);if(type==="number")return Number(trimmed);if(type==="boolean")return trimmed==="true";if(type==="null")return null;return raw}export function parseIdentifier(segment){const match=segment.match(IDENTIFIER_RE);if(match){return{key:match[1]??segment,identifier:parseInt(match[2]??"0",10)}}return{key:segment,identifier:null}}export function extractExpressionIdentifier(segments){if(segments.length===0){return{cleanSegments:[],identifier:null}}const lastSegment=segments[segments.length-1];const parsed=parseIdentifier(lastSegment);if(parsed.identifier!==null){const cleanSegments=[...segments.slice(0,-1),parsed.key];return{cleanSegments,identifier:parsed.identifier}}return{cleanSegments:segments,identifier:null}}
2
2
  //# sourceMappingURL=parser.js.map