@pipelex/mthds-form 0.4.0 → 0.5.0

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@pipelex/mthds-form",
-  "version": "0.4.0",
+  "version": "0.5.0",
   "description": "Headless form kernel and control set for MTHDS method inputs",
   "license": "MIT",
   "repository": {
@@ -61,6 +61,7 @@
     "tailwind-merge": "^2.6.0"
   },
   "peerDependencies": {
+    "mthds": "^0.24.0",
     "react": "^19",
     "react-dom": "^19"
   },
@@ -83,6 +84,7 @@
     "@vitest/coverage-v8": "^4.1.0",
     "eslint": "^9.39.4",
     "jsdom": "^30.0.1",
+    "mthds": "^0.24.0",
     "prettier": "^3.8.1",
     "react": "^19",
     "react-dom": "^19",

package/dist/chunk-6XD6UZSU.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/core/descriptor.ts"],"names":[],"mappings":";AAkKO,SAAS,gBAAgB,KAAA,EAAkC;AAChE,EAAA,QAAQ,MAAM,IAAA;AAAM,IAClB,KAAK,MAAA;AAAA,IACL,KAAK,OAAA;AACH,MAAA,OAAO,MAAA;AAAA,IACT,KAAK,MAAA;AACH,MAAA,OAAO,MAAA;AAAA,IACT,KAAK,UAAA;AACH,MAAA,OAAO,UAAA;AAAA,IACT,KAAK,OAAA;AACH,MAAA,OAAO,OAAA;AAAA,IACT,KAAK,QAAA;AACH,MAAA,OAAO,QAAA;AAAA,IACT,KAAK,SAAA;AACH,MAAA,OAAO,SAAA;AAAA,IACT,KAAK,MAAA;AACH,MAAA,OAAO,QAAA;AAAA,IACT,KAAK,MAAA;AACH,MAAA,OAAO,MAAA;AAAA,IACT;AACE,MAAA,OAAO,YAAA;AAAA;AAEb","file":"chunk-6XD6UZSU.js","sourcesContent":["/**\n * The `RunField` descriptor - the consumer-facing currency of the form kernel.\n *\n * A method's inputs arrive from the API as a map of variable name →\n * `PipeInputContract` ({ concept_ref, json_schema }). That JSON Schema is rich\n * (Pydantic-generated) and not pleasant to render directly. `buildRunFields`\n * (in `derive.ts`) normalizes it once into a flat, recursive `RunField[]`\n * descriptor that the presentational field components consume - so the\n * components never touch raw JSON Schema, and stories can describe any input\n * shape declaratively.\n *\n * Pure module: no React, no API calls. Trivially unit-testable.\n */\n\nexport type RunFieldKind =\n  | 'text' // short single-line string\n  | 'prose' // long free-text (textarea)\n  | 'date' // a calendar date (schema `format: date` or `date-time`)\n  | 'number' // integer or float\n  | 'boolean' // true/false\n  | 'enum' // pick one of a fixed set\n  | 'document' // a file (PDF, docx…) by upload or URL\n  | 'image' // a file rendered with a preview\n  | 'object' // a structured concept with nested fields\n  | 'list' // an array of one element type\n  | 'unknown'; // anything we can't map → raw JSON escape hatch\n\nexport interface RunFieldCommon {\n  /** The variable identifier as written in the method (rendered in mono). */\n  name: string;\n  /** Human label; falls back to `name` when absent. */\n  title?: string;\n  /** The concept this input carries, e.g. `native.Document`, `demo.Invoice`. */\n  conceptRef?: string;\n  /** One-line helper text shown under the label. */\n  description?: string;\n  /** Required inputs always show; optional ones can collapse. */\n  required: boolean;\n  /**\n   * Whether Run waits for this input - set on TOP-LEVEL fields only, straight\n   * from `inputMustBeFilled` (see `mustBeFilled` in `readiness.ts` for why this\n   * is not the same question as `required`). Nested fields leave it undefined;\n   * they are gated through their parent's `fieldFilled`.\n   */\n  gating?: boolean;\n  /**\n   * The single property this field's value sits inside on the wire, when its\n   * concept declares a scalar content model: `native.Text` is `TextContent\n   * {text}`, `native.Number` is `NumberContent {number}`, `native.YesNo` is\n   * `YesNoContent {yes_no}`. The control still holds the plain scalar; the\n   * value bridge wraps into this property on the way out and unwraps on the way\n   * back in.\n   *\n   * A property NAME, never a schema - the descriptor stays the only currency\n   * and `buildRunFields` stays the only reader of JSON Schema. Absent whenever\n   * the value is already the whole content (a structured concept, a file, a\n   * child property of a structure): wrapping those would double-nest them.\n   */\n  contentKey?: string;\n}\n\nexport interface TextRunField extends RunFieldCommon {\n  kind: 'text';\n  placeholder?: string;\n}\n\nexport interface ProseRunField extends RunFieldCommon {\n  kind: 'prose';\n  placeholder?: string;\n}\n\nexport interface DateRunField extends RunFieldCommon {\n  kind: 'date';\n  /**\n   * True when the backing schema is `format: date-time`: the stored value is a\n   * full RFC 3339 timestamp (`2026-07-06T00:00:00Z`) so it passes the API's\n   * `date-time` validation, even though the control only asks for a day. False\n   * for a bare `format: date`, where the value stays `YYYY-MM-DD`.\n   */\n  datetime: boolean;\n}\n\nexport interface NumberRunField extends RunFieldCommon {\n  kind: 'number';\n  integer: boolean;\n  min?: number;\n  max?: number;\n}\n\nexport interface BooleanRunField extends RunFieldCommon {\n  kind: 'boolean';\n}\n\nexport interface EnumRunField extends RunFieldCommon {\n  kind: 'enum';\n  options: string[];\n}\n\nexport interface FileRunField extends RunFieldCommon {\n  kind: 'document' | 'image';\n  /** Accept hint shown to the user, e.g. \"PDF, PNG, JPG\". */\n  accept?: string;\n}\n\nexport interface ObjectRunField extends RunFieldCommon {\n  kind: 'object';\n  fields: RunField[];\n}\n\nexport interface ListRunField extends RunFieldCommon {\n  kind: 'list';\n  /** The element descriptor (its `name` is unused; the index labels items). */\n  item: RunField;\n  /**\n   * The FEWEST items the slot accepts, when the schema states a lower bound.\n   * Absent for a variable `Concept[]` list, which demands none.\n   *\n   * Read off the array schema's `minItems` rather than off the contract's\n   * `item_count`, which states the same number: this exists so `fieldFilled` can\n   * answer the question **ajv** answers, and `minItems` is the keyword ajv\n   * reads. pipelex emits `minItems`/`maxItems` = N for a `[N]` slot and neither\n   * for `[]`, so on a top-level slot the two sources agree by construction.\n   *\n   * A schema may still state a lower bound alone - `mapSchema` recurses, so a\n   * nested array inside a structured concept reaches here with whatever its\n   * model declared and no MTHDS multiplicity behind it. Gating on that bound is\n   * the same rule, and it is the direction that cannot leave readiness more\n   * permissive than the gate.\n   */\n  itemCount?: number;\n  /**\n   * The MOST items the slot accepts, off the schema's `maxItems`.\n   *\n   * A separate field because it is a separate fact, and conflating them is a\n   * bug that hides: `itemCount` was read as a minimum by readiness and as a\n   * maximum by the control that stops offering `Add`, which agree only while\n   * a contract states both bounds equal. A list told \"at least two\" was then\n   * presented as a list of exactly two.\n   */\n  maxItemCount?: number;\n}\n\nexport interface UnknownRunField extends RunFieldCommon {\n  kind: 'unknown';\n}\n\nexport type RunField =\n  | TextRunField\n  | ProseRunField\n  | DateRunField\n  | NumberRunField\n  | BooleanRunField\n  | EnumRunField\n  | FileRunField\n  | ObjectRunField\n  | ListRunField\n  | UnknownRunField;\n\n/** The short, friendly category label for a concept_ref (drives the pill dot). */\nexport type ConceptCategory =\n  'text' | 'date' | 'document' | 'image' | 'number' | 'boolean' | 'choice' | 'structured' | 'list';\n\nexport function conceptCategory(field: RunField): ConceptCategory {\n  switch (field.kind) {\n    case 'text':\n    case 'prose':\n      return 'text';\n    case 'date':\n      return 'date';\n    case 'document':\n      return 'document';\n    case 'image':\n      return 'image';\n    case 'number':\n      return 'number';\n    case 'boolean':\n      return 'boolean';\n    case 'enum':\n      return 'choice';\n    case 'list':\n      return 'list';\n    default:\n      return 'structured';\n  }\n}\n"]}

package/dist/chunk-7BMOPXDY.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/core/wire-format.ts"],"names":[],"mappings":";;;;;;AA0BA,SAAS,cAAc,WAAA,EAA+D;AACpF,EAAA,MAAM,EAAE,IAAA,EAAM,MAAA,EAAO,GAAI,iBAAiB,WAAW,CAAA;AACrD,EAAA,OAAO,EAAE,MAAA,EAAQ,WAAA,EAAa,IAAA,IAAQ,EAAA,EAAG;AAC3C;AAEA,IAAM,aAAA,GAAgB,iBAAA;AACtB,IAAM,qBAAA,GAAwB,yBAAA;AAgBvB,SAAS,YAAA,CAAa,OAAgB,WAAA,EAA8B;AACzE,EAAA,MAAM,EAAE,MAAA,EAAQ,WAAA,EAAY,GAAI,cAAc,WAAW,CAAA;AAEzD,EAAA,IAAI,MAAA,EAAQ;AACV,IAAA,MAAM,QAAQ,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAI,QAAQ,EAAC;AAG9C,IAAA,OAAO,MAAM,GAAA,CAAI,CAAC,SAAS,eAAA,CAAgB,IAAA,EAAM,WAAW,CAAC,CAAA;AAAA,EAC/D;AAEA,EAAA,OAAO,kBAAA,CAAmB,OAAO,WAAW,CAAA;AAC9C;AAGA,SAAS,eAAA,CAAgB,OAAgB,OAAA,EAA0B;AACjE,EAAA,IAAI,aAAA,CAAc,OAAO,CAAA,EAAG;AAC1B,IAAA,IAAI,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,IAAY,UAAU,KAAA,EAAO;AACzD,MAAA,OAAQ,KAAA,CAA2B,IAAA;AAAA,IACrC;AACA,IAAA,OAAO,OAAO,KAAA,KAAU,QAAA,GAAW,KAAA,GAAQ,MAAA,CAAO,SAAS,EAAE,CAAA;AAAA,EAC/D;AAEA,EAAA,IAAI,qBAAA,CAAsB,OAAO,CAAA,EAAG;AAElC,IAAA,IAAI,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,IAAY,SAAS,KAAA,EAAO;AACxD,MAAA,OAAQ,KAAA,CAA0B,GAAA;AAAA,IACpC;AACA,IAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,KAAA;AACtC,IAAA,OAAO,EAAA;AAAA,EACT;AAUA,EAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,iBAAA,CAAkB,KAAK,CAAA,EAAE;AACtD;AAEA,SAAS,kBAAA,CAAmB,OAAgB,OAAA,EAA0B;AACpE,EAAA,IAAI,aAAA,CAAc,OAAO,CAAA,EAAG;AAE1B,IAAA,IAAI,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,IAAY,UAAU,KAAA,EAAO;AACzD,MAAA,OAAQ,KAAA,CAA2B,IAAA;AAAA,IACrC;AAEA,IAAA,OAAO,OAAO,KAAA,KAAU,QAAA,GAAW,KAAA,GAAQ,MAAA,CAAO,SAAS,EAAE,CAAA;AAAA,EAC/D;AAEA,EAAA,IAAI,qBAAA,CAAsB,OAAO,CAAA,EAAG;AAGlC,IAAA,IAAI,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,IAAY,SAAS,KAAA,EAAO;AACxD,MAAA,OAAQ,KAAA,CAA0B,GAAA;AAAA,IACpC;AAEA,IAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,KAAA;AACtC,IAAA,OAAO,EAAA;AAAA,EACT;AAUA,EAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,iBAAA,CAAkB,KAAK,CAAA,EAAE;AACtD;AAeO,SAAS,YAAA,CAAa,OAAgB,WAAA,EAA8B;AACzE,EAAA,MAAM,EAAE,MAAA,EAAQ,WAAA,EAAY,GAAI,cAAc,WAAW,CAAA;AAEzD,EAAA,IAAI,MAAA,EAAQ;AAKV,IAAA,MAAM,SAAA,GAAY,aAAA,CAAc,KAAK,CAAA,GAAI,MAAM,OAAA,GAAU,KAAA;AAEzD,IAAA,IAAI,KAAA;AACJ,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,SAAS,CAAA,EAAG;AAC5B,MAAA,KAAA,GAAQ,SAAA;AAAA,IACV,CAAA,MAAA,IAAW,SAAA,IAAa,IAAA,IAAQ,OAAO,cAAc,QAAA,EAAU;AAE7D,MAAA,KAAA,GAAQ,CAAC,SAAS,CAAA;AAAA,IACpB,CAAA,MAAO;AACL,MAAA,KAAA,GAAQ,EAAC;AAAA,IACX;AACA,IAAA,OAAO,MAAM,GAAA,CAAI,CAAC,SAAS,kBAAA,CAAmB,IAAA,EAAM,WAAW,CAAC,CAAA;AAAA,EAClE;AAEA,EAAA,OAAO,kBAAA,CAAmB,OAAO,WAAW,CAAA;AAC9C;AAGA,IAAM,eAAA,mBAAkB,IAAI,GAAA,CAAI,CAAC,KAAA,EAAO,cAAc,WAAA,EAAa,UAAA,EAAY,OAAA,EAAS,SAAS,CAAC,CAAA;AAGlG,SAAS,kBAAkB,GAAA,EAAuC;AAChE,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,eAAA,CAAgB,GAAA,CAAI,CAAC,CAAC,CAAA;AAC5D;AAQA,SAAS,cAAc,KAAA,EAAgE;AACrF,EAAA,OACE,CAAC,CAAC,KAAA,IACF,OAAO,KAAA,KAAU,QAAA,IACjB,SAAA,IAAa,KAAA,IACb,SAAA,IAAa,KAAA,IACb,OAAQ,KAAA,CAA+B,OAAA,KAAY,QAAA;AAEvD;AAEA,SAAS,kBAAA,CAAmB,OAAgB,OAAA,EAA0B;AAGpE,EAAA,IAAI,aAAA,CAAc,KAAK,CAAA,KAAM,aAAA,CAAc,OAAO,CAAA,IAAK,qBAAA,CAAsB,OAAO,CAAA,CAAA,EAAI;AACtF,IAAA,OAAO,kBAAA,CAAmB,KAAA,CAAM,OAAA,EAAS,OAAO,CAAA;AAAA,EAClD;AAEA,EAAA,IAAI,aAAA,CAAc,OAAO,CAAA,EAAG;AAE1B,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,MAAA,OAAO,EAAE,MAAM,KAAA,EAAM;AAAA,IACvB;AAEA,IAAA,IAAI,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,IAAY,UAAU,KAAA,EAAO;AACzD,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,OAAO,EAAE,MAAM,EAAA,EAAG;AAAA,EACpB;AAEA,EAAA,IAAI,qBAAA,CAAsB,OAAO,CAAA,EAAG;AAElC,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,MAAA,OAAO,EAAE,KAAK,KAAA,EAAM;AAAA,IACtB;AAEA,IAAA,IAAI,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,IAAY,SAAS,KAAA,EAAO;AACxD,MAAA,OAAO,KAAA;AAAA,IACT;AAGA,IAAA,IAAI,SAAS,OAAO,KAAA,KAAU,QAAA,IAAY,iBAAA,CAAkB,KAAgC,CAAA,EAAG;AAC7F,MAAA,OAAO,EAAE,GAAI,KAAA,EAAmC,GAAA,EAAK,EAAA,EAAG;AAAA,IAC1D;AACA,IAAA,OAAO,EAAE,KAAK,EAAA,EAAG;AAAA,EACnB;AAYA,EAAA,OAAO,kBAAkB,KAAK,CAAA;AAChC;AAIA,SAAS,kBAAkB,KAAA,EAAyB;AAClD,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,OAAO,aAAA,CAAc,OAAO,CAAA,EAAG;AAC7B,IAAA,OAAA,GAAU,OAAA,CAAQ,OAAA;AAAA,EACpB;AAEA,EAAA,IAAI,OAAA,IAAW,OAAO,OAAA,KAAY,QAAA,IAAY,CAAC,MAAM,OAAA,CAAQ,OAAO,CAAA,IAAK,SAAA,IAAa,OAAA,EAAS;AAC7F,IAAA,OAAQ,OAAA,CAAiC,OAAA;AAAA,EAC3C;AACA,EAAA,OAAO,OAAA;AACT;AAcO,SAAS,mBAAmB,MAAA,EAA6B;AAC9D,EAAA,MAAM,OAAO,MAAA,CAAO,WAAA;AAGpB,EAAA,IAAI,CAAC,MAAM,OAAO,EAAA;AAClB,EAAA,IAAI,CAAC,KAAK,QAAA,CAAS,IAAI,KAAM,MAAA,CAAO,WAAA,EAAyC,SAAS,OAAA,EAAS;AAC7F,IAAA,OAAO,IAAA,GAAO,IAAA;AAAA,EAChB;AACA,EAAA,OAAO,IAAA;AACT;AAQO,SAAS,gBAAA,CACd,UACA,YAAA,EACyB;AACzB,EAAA,MAAM,SAAkC,EAAC;AACzC,EAAA,KAAA,MAAW,CAAC,SAAA,EAAW,MAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,YAAY,CAAA,EAAG;AAC9D,IAAA,MAAA,CAAO,SAAS,IAAI,YAAA,CAAa,OAAA,CAAQ,UAAU,SAAS,CAAA,EAAG,kBAAA,CAAmB,MAAM,CAAC,CAAA;AAAA,EAC3F;AACA,EAAA,OAAO,MAAA;AACT;AAWO,SAAS,kBAAA,CACd,KAAA,EACA,SAAA,EACA,IAAA,EACS;AACT,EAAA,IAAI,CAAC,SAAA,IAAa,KAAA,IAAS,IAAA,EAAM,OAAO,KAAA;AAMxC,EAAA,MAAM,OAAA,GAAU,QAAQ,iBAAA,CAAkB,SAAA,EAAW,EAAC,EAAG,EAAE,cAAA,EAAgB,KAAA,EAAO,CAAA;AAClF,EAAA,MAAM,MAAA,GAAS,wBAAA,CAAyB,SAAA,EAAW,OAAO,CAAA;AAC1D,EAAA,MAAM,IAAA,GAAO,aAAa,MAAM,CAAA;AAehC,EAAA,IAAI,SAAS,QAAA,IAAY,MAAA,CAAO,WAAW,MAAA,IAAU,OAAO,UAAU,QAAA,EAAU;AAC9E,IAAA,OAAO,cAAA,CAAe,KAAK,CAAA,IAAK,KAAA;AAAA,EAClC;AAEA,EAAA,IAAI,SAAS,QAAA,EAAU;AACrB,IAAA,IACE,OAAO,KAAA,KAAU,QAAA,IACjB,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA,IACpB,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,CAAE,MAAA,KAAW,KAC9B,OAAQ,KAAA,CAA6B,SAAS,QAAA,EAC9C;AACA,MAAA,OAAQ,KAAA,CAA2B,IAAA;AAAA,IACrC;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI,IAAA,KAAS,YAAY,OAAO,KAAA,KAAU,YAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAC3E,IAAA,MAAM,QAAQ,MAAA,CAAO,UAAA;AACrB,IAAA,IAAI,CAAC,OAAO,OAAO,KAAA;AACnB,IAAA,MAAM,GAAA,GAAM,EAAE,GAAI,KAAA,EAAkC;AACpD,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,UAAU,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AACrD,MAAA,IAAI,UAAA,CAAW,GAAA,EAAK,GAAG,CAAA,EAAG,GAAA,CAAI,GAAG,CAAA,GAAI,kBAAA,CAAmB,GAAA,CAAI,GAAG,CAAA,EAAG,UAAA,EAAY,OAAO,CAAA;AAAA,IACvF;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AACA,EAAA,IAAI,IAAA,KAAS,OAAA,IAAW,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAC5C,IAAA,MAAM,QAAQ,MAAA,CAAO,KAAA;AACrB,IAAA,OAAO,KAAA,CAAM,IAAI,CAAC,IAAA,KAAS,mBAAmB,IAAA,EAAM,KAAA,EAAO,OAAO,CAAC,CAAA;AAAA,EACrE;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,oBAAoB,KAAA,EAAyB;AACpD,EAAA,IAAI,UAAU,EAAA,IAAM,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,QAAW,OAAO,IAAA;AAalE,EAAA,OAAO,OAAO,KAAA,KAAU,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,CAAE,MAAA,KAAW,CAAA;AAC7F;AAsBO,SAAS,mBAAA,CACd,KAAA,EACA,SAAA,EACA,IAAA,EACS;AACT,EAAA,IAAI,CAAC,SAAA,IAAa,KAAA,IAAS,IAAA,EAAM,OAAO,KAAA;AAExC,EAAA,MAAM,OAAA,GAAU,QAAQ,iBAAA,CAAkB,SAAA,EAAW,EAAC,EAAG,EAAE,cAAA,EAAgB,KAAA,EAAO,CAAA;AAClF,EAAA,MAAM,MAAA,GAAS,wBAAA,CAAyB,SAAA,EAAW,OAAO,CAAA;AAC1D,EAAA,MAAM,IAAA,GAAO,aAAa,MAAM,CAAA;AAEhC,EAAA,IAAI,IAAA,KAAS,OAAA,IAAW,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAC5C,IAAA,MAAM,QAAQ,MAAA,CAAO,KAAA;AACrB,IAAA,OAAO,KAAA,CAAM,IAAI,CAAC,IAAA,KAAS,oBAAoB,IAAA,EAAM,KAAA,EAAO,OAAO,CAAC,CAAA;AAAA,EACtE;AACA,EAAA,IAAI,IAAA,KAAS,YAAY,OAAO,KAAA,KAAU,YAAY,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG,OAAO,KAAA;AAEnF,EAAA,MAAM,QAAQ,MAAA,CAAO,UAAA;AACrB,EAAA,IAAI,CAAC,OAAO,OAAO,KAAA;AACnB,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,KAAA,CAAM,OAAA,CAAQ,MAAA,CAAO,QAAQ,CAAA,GAAK,MAAA,CAAO,QAAA,GAAwB,EAAE,CAAA;AAC5F,EAAA,MAAM,MAA+B,EAAC;AACtC,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,GAAG,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAgC,CAAA,EAAG;AACzE,IAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,KAAA,EAAO,GAAG,CAAA;AACrC,IAAA,IAAI,CAAC,UAAA,EAAY;AACf,MAAA,GAAA,CAAI,GAAG,CAAA,GAAI,GAAA;AACX,MAAA;AAAA,IACF;AACA,IAAA,MAAM,MAAA,GAAS,mBAAA,CAAoB,GAAA,EAAK,UAAA,EAAY,OAAO,CAAA;AAC3D,IAAA,IAAI,oBAAoB,MAAM,CAAA,IAAK,CAAC,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA,EAAG;AACvD,IAAA,GAAA,CAAI,GAAG,CAAA,GAAI,MAAA;AAAA,EACb;AACA,EAAA,OAAO,GAAA;AACT;AAMO,SAAS,gBAAA,CACd,gBACA,YAAA,EACyB;AACzB,EAAA,MAAM,SAAkC,EAAC;AACzC,EAAA,KAAA,MAAW,CAAC,SAAA,EAAW,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,cAAc,CAAA,EAAG;AAC/D,IAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,YAAA,EAAc,SAAS,CAAA;AAC9C,IAAA,IAAI,MAAA,EAAQ;AACV,MAAA,MAAA,CAAO,SAAS,CAAA,GAAI,kBAAA;AAAA,QAClB,YAAA,CAAa,KAAA,EAAO,kBAAA,CAAmB,MAAM,CAAC,CAAA;AAAA,QAC9C,MAAA,CAAO;AAAA,OACT;AAAA,IACF,CAAA,MAAO;AAEL,MAAA,MAAA,CAAO,SAAS,CAAA,GAAI,KAAA;AAAA,IACtB;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT","file":"chunk-7BMOPXDY.js","sourcesContent":["/**\n * Converts between the simplified inputs.json format and the full RJSF form format.\n *\n * The inputs.json file uses a SIMPLIFIED format for users:\n * - Text:       \"my text\"                     (instead of { text: \"my text\" })\n * - Document:   \"file.pdf\" or { url: \"...\" }  (instead of { url: \"...\", ... })\n * - Image:      same as Document\n * - Text[]:     [\"t1\", \"t2\"]\n * - Document[]: [\"f1.pdf\"] or [{ url: \"...\" }]\n * - Custom:     { concept, content }           (no simplification)\n *\n * The RJSF form uses the FULL concept structure from the json_schema.\n *\n * Two directions:\n * - deflate: form (full) → inputs.json (simplified) - for writing inputs.json / API calls\n * - inflate: inputs.json (simplified) → form (full)  - for populating the form from inputs.json\n */\n\nimport { asCalendarDate } from './date-format';\nimport { isWireDocumentLikeConcept, isWireTextConcept, splitListConcept } from './native-concepts';\nimport { hasOwnProp, ownProp } from './own-property';\nimport { collectSchemaDefs, resolveSchemaIndirection, schemaTypeOf } from './schema-utils';\n\n/** The wire-format view of the native-concept taxonomy (which concept codes use\n *  simplified formats) lives in `native-concepts.ts` - including the record of\n *  where it drifts from the field mapper's view. */\nfunction isListConcept(conceptCode: string): { isList: boolean; baseConcept: string } {\n  const { base, isList } = splitListConcept(conceptCode);\n  return { isList, baseConcept: base ?? '' };\n}\n\nconst isTextConcept = isWireTextConcept;\nconst isDocumentLikeConcept = isWireDocumentLikeConcept;\n\n// ─── Deflate: form (full) → inputs.json (simplified) ──────────────────────\n\n/**\n * Convert a single form value to the simplified inputs.json format.\n * Used when writing inputs.json and when calling the run API.\n *\n * Rules:\n * - Text { text: \"hello\" } → \"hello\"\n * - Document { url: \"file.pdf\", ... } → \"file.pdf\" (if only url) or { url, ... }\n * - Image: same as Document\n * - Page: same as Document\n * - List types → array of deflated items\n * - Custom → { concept, content }\n */\nexport function deflateInput(value: unknown, conceptCode: string): unknown {\n  const { isList, baseConcept } = isListConcept(conceptCode);\n\n  if (isList) {\n    const items = Array.isArray(value) ? value : [];\n    // pipelex accepts Sequence[str] for list inputs, not list of dicts.\n    // Always simplify list items to their scalar form (URL string for docs, plain string for text).\n    return items.map((item) => deflateListItem(item, baseConcept));\n  }\n\n  return deflateSingleValue(value, baseConcept);\n}\n\n/** Deflate a single item within a list - always reduces to the simplest scalar form. */\nfunction deflateListItem(value: unknown, concept: string): unknown {\n  if (isTextConcept(concept)) {\n    if (value && typeof value === 'object' && 'text' in value) {\n      return (value as { text: string }).text;\n    }\n    return typeof value === 'string' ? value : String(value ?? '');\n  }\n\n  if (isDocumentLikeConcept(concept)) {\n    // Always extract just the URL for list items - pipelex resolves metadata at runtime\n    if (value && typeof value === 'object' && 'url' in value) {\n      return (value as { url: string }).url;\n    }\n    if (typeof value === 'string') return value;\n    return '';\n  }\n\n  // Custom structured concept → { concept, content }.\n  //\n  // IDEMPOTENT ON PURPOSE - see `unwrapAllWrappers`. Wrapping unconditionally\n  // corrupted persisted inputs: a host panel seeds the form with the RAW\n  // stored value when the input schemas aren't loaded yet (no dry run yet),\n  // so the form could hold an ALREADY-wrapped value; the next change deflated\n  // it again and saved `{ concept, content: { concept, content: {...} } }`.\n  // Wrapping exactly once, whatever we're handed, makes that unreachable.\n  return { concept, content: unwrapAllWrappers(value) };\n}\n\nfunction deflateSingleValue(value: unknown, concept: string): unknown {\n  if (isTextConcept(concept)) {\n    // { text: \"hello\" } → \"hello\"\n    if (value && typeof value === 'object' && 'text' in value) {\n      return (value as { text: string }).text;\n    }\n    // Already a string (passthrough)\n    return typeof value === 'string' ? value : String(value ?? '');\n  }\n\n  if (isDocumentLikeConcept(concept)) {\n    // Always extract just the URL - pipelex resolves metadata at runtime.\n    // A bare dict without a 'concept' key is rejected by StuffFactory.\n    if (value && typeof value === 'object' && 'url' in value) {\n      return (value as { url: string }).url;\n    }\n    // Already a string URL (passthrough)\n    if (typeof value === 'string') return value;\n    return '';\n  }\n\n  // Custom structured concept → { concept, content }.\n  //\n  // IDEMPOTENT ON PURPOSE - see `unwrapAllWrappers`. Wrapping unconditionally\n  // corrupted persisted inputs: a host panel seeds the form with the RAW\n  // stored value when the input schemas aren't loaded yet (no dry run yet),\n  // so the form could hold an ALREADY-wrapped value; the next change deflated\n  // it again and saved `{ concept, content: { concept, content: {...} } }`.\n  // Wrapping exactly once, whatever we're handed, makes that unreachable.\n  return { concept, content: unwrapAllWrappers(value) };\n}\n\n// ─── Inflate: inputs.json (simplified) → form (full) ──────────────────────\n\n/**\n * Convert a simplified inputs.json value to the full form structure.\n * Used when populating the RJSF form from inputs.json.\n *\n * Rules:\n * - \"hello\" → { text: \"hello\" } (for Text concepts)\n * - \"file.pdf\" → { url: \"file.pdf\" } (for Document/Image/Page concepts)\n * - { url: \"...\" } → passthrough (already full)\n * - [\"t1\", \"t2\"] → inflated array of items\n * - { concept, content } → content (for custom concepts)\n */\nexport function inflateInput(value: unknown, conceptCode: string): unknown {\n  const { isList, baseConcept } = isListConcept(conceptCode);\n\n  if (isList) {\n    // The sandbox may write the wrapped form at the LIST level:\n    // { concept: \"native.Document\", content: [item, item] } - pipelex accepts it.\n    // Unwrap before the array check, otherwise the wrapper itself gets treated\n    // as a single list item and inflates to one empty entry.\n    const unwrapped = isWrappedForm(value) ? value.content : value;\n    // Handle: array (correct), single object (legacy/form default), or null/undefined\n    let items: unknown[];\n    if (Array.isArray(unwrapped)) {\n      items = unwrapped;\n    } else if (unwrapped != null && typeof unwrapped === 'object') {\n      // Single object instead of array (e.g., {\"url\": \"\"} from form default) - wrap it\n      items = [unwrapped];\n    } else {\n      items = [];\n    }\n    return items.map((item) => inflateSingleValue(item, baseConcept));\n  }\n\n  return inflateSingleValue(value, baseConcept);\n}\n\n/** Known optional fields on DocumentContent (from pipelex Pydantic model). */\nconst DOCUMENT_FIELDS = new Set(['url', 'public_url', 'mime_type', 'filename', 'title', 'snippet']);\n\n/** Returns true if the object looks like a DocumentContent (has any known doc field). */\nfunction looksLikeDocument(obj: Record<string, unknown>): boolean {\n  return Object.keys(obj).some((k) => DOCUMENT_FIELDS.has(k));\n}\n\n/**\n * Detect the fully-qualified wrapper form `{ concept: \"...\", content: ... }`.\n * pipelex accepts this for any concept (native or custom), and the mthds-inputs\n * agent skill writes it by default for disambiguation. We unwrap before applying\n * concept-specific inflation so the form populates correctly.\n */\nfunction isWrappedForm(value: unknown): value is { concept: string; content: unknown } {\n  return (\n    !!value &&\n    typeof value === 'object' &&\n    'concept' in value &&\n    'content' in value &&\n    typeof (value as { concept: unknown }).concept === 'string'\n  );\n}\n\nfunction inflateSingleValue(value: unknown, concept: string): unknown {\n  // Unwrap { concept, content } for native concepts - the content IS the value.\n  // For custom concepts we unwrap below (historical behaviour) but after concept-specific checks.\n  if (isWrappedForm(value) && (isTextConcept(concept) || isDocumentLikeConcept(concept))) {\n    return inflateSingleValue(value.content, concept);\n  }\n\n  if (isTextConcept(concept)) {\n    // \"hello\" → { text: \"hello\" }\n    if (typeof value === 'string') {\n      return { text: value };\n    }\n    // Already full structure { text: \"...\" }\n    if (value && typeof value === 'object' && 'text' in value) {\n      return value;\n    }\n    return { text: '' };\n  }\n\n  if (isDocumentLikeConcept(concept)) {\n    // \"file.pdf\" → { url: \"file.pdf\" }\n    if (typeof value === 'string') {\n      return { url: value };\n    }\n    // Already full structure { url: \"...\" }\n    if (value && typeof value === 'object' && 'url' in value) {\n      return value;\n    }\n    // Object without url key but with other document fields (e.g. from RJSF defaults)\n    // Ensure the required url field is present\n    if (value && typeof value === 'object' && looksLikeDocument(value as Record<string, unknown>)) {\n      return { ...(value as Record<string, unknown>), url: '' };\n    }\n    return { url: '' };\n  }\n\n  // Custom structured: unwrap { concept, content } → content.\n  //\n  // Unwrap REPEATEDLY. `deflateSingleValue` used to wrap unconditionally, so a\n  // form change made while the input schemas weren't loaded yet re-wrapped an\n  // already-wrapped value and persisted `{ concept, content: { concept,\n  // content: {...} } }` to DynamoDB. Unwrapping a single level left the FORM\n  // holding `{ concept, content }` - properties no schema declares, so RJSF\n  // matched nothing and rendered every field empty, with the real values\n  // sitting one level deeper. Deflate is idempotent now, but the corrupted\n  // shape survives in persisted inputData, so this heals it on read.\n  return unwrapAllWrappers(value);\n}\n\n/** Strip every `{ concept, content }` layer - one, or the double wrap a\n *  non-idempotent deflate persisted. */\nfunction unwrapAllWrappers(value: unknown): unknown {\n  let current = value;\n  while (isWrappedForm(current)) {\n    current = current.content;\n  }\n  // A `{ content }` with no `concept` is the historical half-wrapper.\n  if (current && typeof current === 'object' && !Array.isArray(current) && 'content' in current) {\n    return (current as { content: unknown }).content;\n  }\n  return current;\n}\n\n// ─── Schema helpers ─────────────────────────────────────────────────────\n\ninterface InputSchema {\n  concept_ref: string;\n  json_schema?: Record<string, unknown>;\n}\n\n/**\n * The validation API returns concept_ref WITHOUT the [] suffix for list inputs.\n * The array-ness is only encoded in json_schema.type === \"array\".\n * This helper resolves the correct concept ref by checking the schema.\n */\nexport function resolveConceptCode(schema: InputSchema): string {\n  const code = schema.concept_ref;\n  // Defensive: a malformed/partial contract entry (missing concept) must\n  // degrade, never throw and blank the whole input panel.\n  if (!code) return '';\n  if (!code.endsWith('[]') && (schema.json_schema as Record<string, unknown>)?.type === 'array') {\n    return code + '[]';\n  }\n  return code;\n}\n\n// ─── Batch helpers for full inputData objects ────────────────────────────\n\n/**\n * Deflate all inputs from form format to simplified inputs.json format.\n * Used by InputConfigPanel when preparing data for the run API.\n */\nexport function deflateAllInputs(\n  formData: Record<string, unknown>,\n  inputSchemas: Record<string, InputSchema>,\n): Record<string, unknown> {\n  const result: Record<string, unknown> = {};\n  for (const [stuffName, schema] of Object.entries(inputSchemas)) {\n    result[stuffName] = deflateInput(ownProp(formData, stuffName), resolveConceptCode(schema));\n  }\n  return result;\n}\n\n/**\n * Heal values against their json_schema: the run-form bridge used to\n * double-wrap plain string properties as `{ text: \"...\" }` (fixed in\n * run-values.ts, but the corrupted shape survives in persisted inputData -\n * store and server copies). Wherever the schema expects a string but the\n * value is a lone `{ text: string }` wrapper, unwrap it. Walks nested\n * objects and arrays, resolving `#/$defs/...` refs against the root schema;\n * anything already valid passes through untouched.\n */\nexport function healStringWrappers(\n  value: unknown,\n  rawSchema: Record<string, unknown> | undefined,\n  defs?: Record<string, Record<string, unknown>>,\n): unknown {\n  if (!rawSchema || value == null) return value;\n\n  // Resolve $ref / nullable-anyOf indirection (Pydantic emits `{$ref}` for\n  // nested models and `anyOf: [T, {type:'null'}]` for optionals). The `$defs`\n  // walk deliberately keeps its historical no-array-traversal mode - see\n  // `CollectDefsOptions` in schema-utils.\n  const allDefs = defs ?? collectSchemaDefs(rawSchema, {}, { traverseArrays: false });\n  const schema = resolveSchemaIndirection(rawSchema, allDefs);\n  const type = schemaTypeOf(schema);\n\n  // A `format: date` field takes a calendar date ALONE. `DateContent` in pipelex\n  // enforces that with a `mode=\"before\"` validator (`_reject_lax_temporal`) that\n  // deliberately closes pydantic's lax coercion - a datetime string on `date`\n  // would silently drop its time and offset (DT3, \"no silent midnight\"), so the\n  // runner answers a 500, not a coercion.\n  //\n  // An agent-written or hand-written inputs.json says `\"2026-07-06T00:00:00Z\"`\n  // anyway - that is how every system exports a date. So NORMALIZE it here to\n  // the day it denotes rather than forwarding it to fail at the runner: the\n  // padding is noise, and dropping noise is not the fidelity loss DT3 forbids.\n  // A value carrying a REAL time (15:40) returns null and is left untouched -\n  // it must fail, because silently discarding it is precisely the corruption\n  // the rule exists to prevent.\n  if (type === 'string' && schema.format === 'date' && typeof value === 'string') {\n    return asCalendarDate(value) ?? value;\n  }\n\n  if (type === 'string') {\n    if (\n      typeof value === 'object' &&\n      !Array.isArray(value) &&\n      Object.keys(value).length === 1 &&\n      typeof (value as { text?: unknown }).text === 'string'\n    ) {\n      return (value as { text: string }).text;\n    }\n    return value;\n  }\n  if (type === 'object' && typeof value === 'object' && !Array.isArray(value)) {\n    const props = schema.properties as Record<string, Record<string, unknown>> | undefined;\n    if (!props) return value;\n    const out = { ...(value as Record<string, unknown>) };\n    for (const [key, propSchema] of Object.entries(props)) {\n      if (hasOwnProp(out, key)) out[key] = healStringWrappers(out[key], propSchema, allDefs);\n    }\n    return out;\n  }\n  if (type === 'array' && Array.isArray(value)) {\n    const items = schema.items as Record<string, unknown> | undefined;\n    return value.map((item) => healStringWrappers(item, items, allDefs));\n  }\n  return value;\n}\n\n/** Nothing left worth sending, once this value has itself been pruned. */\nfunction isEmptyAfterPruning(value: unknown): boolean {\n  if (value === '' || value === null || value === undefined) return true;\n  // An object whose every property was itself pruned away carries nothing, and\n  // that is what an untouched OPTIONAL STRUCTURED input looks like by the time\n  // it reaches here - a shell of empty children, emptied out. Keeping the `{}`\n  // handed it to ajv against the concept's full schema, which rejected the run\n  // for a required child of an input the method said may be omitted. Dropping\n  // it is the same judgement the wire payload already makes one step later\n  // (`apiInputsFromSchemaData` omits it as unfilled); making the prune agree is\n  // what stops the gate from failing a run it was about to omit anyway.\n  //\n  // An empty ARRAY is deliberately NOT empty: a plural slot is never absent in\n  // MTHDS - its empty form IS the empty list - so dropping it would invent an\n  // absence the method cannot express.\n  return typeof value === 'object' && !Array.isArray(value) && Object.keys(value).length === 0;\n}\n\n/**\n * Drop optional properties the user never filled, so an untouched field cannot\n * fail validation or reach the API as an empty string.\n *\n * RJSF fills EVERY unset string property with `\"\"` on mount. That is harmless\n * for a plain string, but `prepareSchemaForRjsf` collapses pydantic's\n * `anyOf: [T, null]` by dropping the null branch, so an optional *constrained*\n * field - `DateContent.time`, declared `datetime.time | None` and rendered\n * `{ type: \"string\", format: \"time\" }` - is left demanding a well-formed time.\n * `\"\"` is not one, and the run was blocked on a field the user never opened.\n *\n * Pruning is the semantically correct repair, not a validation dodge: for\n * pipelex an absent optional field IS `None`, and `\"\"` would fail pydantic at\n * the runner just as it fails ajv here. Only properties absent from their\n * parent's `required` are dropped - an empty REQUIRED field must still fail, so\n * the user is told about it.\n *\n * What counts as empty is `isEmptyAfterPruning`, and it includes an optional\n * STRUCTURE the user never opened, on exactly the same grounds.\n */\nexport function pruneEmptyOptionals(\n  value: unknown,\n  rawSchema: Record<string, unknown> | undefined,\n  defs?: Record<string, Record<string, unknown>>,\n): unknown {\n  if (!rawSchema || value == null) return value;\n\n  const allDefs = defs ?? collectSchemaDefs(rawSchema, {}, { traverseArrays: false });\n  const schema = resolveSchemaIndirection(rawSchema, allDefs);\n  const type = schemaTypeOf(schema);\n\n  if (type === 'array' && Array.isArray(value)) {\n    const items = schema.items as Record<string, unknown> | undefined;\n    return value.map((item) => pruneEmptyOptionals(item, items, allDefs));\n  }\n  if (type !== 'object' || typeof value !== 'object' || Array.isArray(value)) return value;\n\n  const props = schema.properties as Record<string, Record<string, unknown>> | undefined;\n  if (!props) return value;\n  const required = new Set(Array.isArray(schema.required) ? (schema.required as string[]) : []);\n  const out: Record<string, unknown> = {};\n  for (const [key, raw] of Object.entries(value as Record<string, unknown>)) {\n    const propSchema = ownProp(props, key);\n    if (!propSchema) {\n      out[key] = raw;\n      continue;\n    }\n    const pruned = pruneEmptyOptionals(raw, propSchema, allDefs);\n    if (isEmptyAfterPruning(pruned) && !required.has(key)) continue;\n    out[key] = pruned;\n  }\n  return out;\n}\n\n/**\n * Inflate all inputs from simplified inputs.json format to form format.\n * Used by onInputUpdate when receiving inputs.json changes from the sandbox.\n */\nexport function inflateAllInputs(\n  simplifiedData: Record<string, unknown>,\n  inputSchemas: Record<string, InputSchema>,\n): Record<string, unknown> {\n  const result: Record<string, unknown> = {};\n  for (const [stuffName, value] of Object.entries(simplifiedData)) {\n    const schema = ownProp(inputSchemas, stuffName);\n    if (schema) {\n      result[stuffName] = healStringWrappers(\n        inflateInput(value, resolveConceptCode(schema)),\n        schema.json_schema,\n      );\n    } else {\n      // Unknown input - pass through unchanged\n      result[stuffName] = value;\n    }\n  }\n  return result;\n}\n"]}

package/dist/chunk-HARYEWNG.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/core/contracts.ts"],"names":[],"mappings":";;;AAiFO,SAAS,YAAA,CAAa,QAAgB,QAAA,EAA0B;AACrE,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,QAAQ,CAAA,CAAA;AAC9B;AAkBO,SAAS,iBAAA,CACd,eAAA,EACA,MAAA,EACA,QAAA,EAC4B;AAC5B,EAAA,IAAI,CAAC,eAAA,IAAmB,CAAC,QAAA,EAAU,OAAO,MAAA;AAC1C,EAAA,IAAI,MAAA,EAAQ;AACV,IAAA,MAAM,QAAQ,OAAA,CAAQ,eAAA,EAAiB,YAAA,CAAa,MAAA,EAAQ,QAAQ,CAAC,CAAA;AACrE,IAAA,IAAI,OAAO,OAAO,KAAA;AAAA,EACpB;AACA,EAAA,OAAO,OAAA,CAAQ,iBAAiB,QAAQ,CAAA;AAC1C;AAWO,SAAS,gBAAgB,KAAA,EAAmC;AACjE,EAAA,OAAO,MAAM,QAAA,KAAa,UAAA;AAC5B;AAcO,SAAS,cAAc,KAAA,EAAmC;AAC/D,EAAA,OAAQ,KAAA,CAAM,aAAgD,IAAA,KAAS,OAAA;AACzE;AASO,SAAS,kBAAkB,KAAA,EAAmC;AACnE,EAAA,OAAO,MAAM,YAAA,KAAiB,OAAA;AAChC;AAqBO,SAAS,kBAAkB,KAAA,EAAmC;AACnE,EAAA,IAAI,eAAA,CAAgB,KAAK,CAAA,EAAG,OAAO,KAAA;AACnC,EAAA,OAAO,CAAC,aAAA,CAAc,KAAK,CAAA,IAAK,kBAAkB,KAAK,CAAA;AACzD","file":"chunk-HARYEWNG.js","sourcesContent":["/**\n * The typed `pipe_io_contracts` mirror and its gating predicates.\n *\n * Mirrors pipelex's `PipeIOContract` (pipelex/pipeline/pipe_io_contracts.py).\n * The SDK deliberately keeps `pipe_io_contracts` opaque, so the kernel is the\n * canonical TS home for this shape until the D-track specs it.\n *\n * The map itself is keyed by namespaced pipe ref (`<domain>.<pipe_code>`),\n * NOT bare pipe code - use `getPipeIOContract` to look entries up by the bare\n * codes the UI tracks.\n */\n\nimport { ownProp } from './own-property';\n\n/**\n * The authored presence marker on an input slot, verbatim.\n *\n * - `plain` - no marker: the caller must supply the input.\n * - `optional` (`?`) - the caller may omit it and the pipe handles the absence\n *   itself.\n * - `force` (`!`) - a use-site assertion that the value IS present. It must be\n *   supplied, exactly like `plain`; the distinction is the authored assertion,\n *   which lint and graph surfaces read and a form does not.\n */\nexport type InputPresence = 'plain' | 'optional' | 'force';\n\n/**\n * How many items a slot carries.\n *\n * - `single` - one item. `Concept[1]` is single too: no list framing.\n * - `variable` (`Concept[]`) - a list of any length, the empty list included.\n * - `fixed` (`Concept[N]`, N > 1) - a list of exactly `item_count` items.\n */\nexport type IOMultiplicity = 'single' | 'variable' | 'fixed';\n\nexport interface PipeInputContract {\n  concept_ref: string;\n  /** The declared presence marker - see `InputPresence`. */\n  presence: InputPresence;\n  /** The declared multiplicity - see `IOMultiplicity`. */\n  multiplicity: IOMultiplicity;\n  /**\n   * The exact item count, non-null exactly when `multiplicity` is `fixed`. The\n   * slot is always on the wire, `null` off the fixed arm.\n   */\n  item_count: number | null;\n  /**\n   * The input's JSON Schema. A plural slot (`variable` or `fixed`) is an array\n   * wrapper around the item schema, and a `fixed` one additionally carries\n   * `minItems` / `maxItems` set to `item_count` - which is what makes the gate's\n   * ajv pass enforce the declared count without the kernel restating it.\n   */\n  json_schema: Record<string, unknown>;\n}\n\nexport interface PipeOutputContract {\n  concept_ref: string;\n  multiplicity: IOMultiplicity;\n  /** As on the input: non-null exactly on the `fixed` arm, always on the wire. */\n  item_count: number | null;\n  /**\n   * `true` when the output is declared optional (`?`) - the pipe may resolve it\n   * as a recorded absence instead of a value.\n   *\n   * Deliberately still a boolean while the INPUT side carries three-valued\n   * `presence`: output presence is genuinely two-valued, because `!` is\n   * rejected on an output. The asymmetry is the wire's, not ours.\n   */\n  optional: boolean;\n}\n\nexport interface PipeIOContract {\n  inputs: Record<string, PipeInputContract>;\n  output: PipeOutputContract;\n}\n\n/** The `pipe_io_contracts` map: namespaced `pipe_ref` → IO contract. */\nexport type PipeIOContracts = Record<string, PipeIOContract>;\n\n/** Namespaced pipe ref (`<domain>.<pipe_code>`) - the identity convention the\n *  validate artifacts key on. */\nexport function buildPipeRef(domain: string, pipeCode: string): string {\n  return `${domain}.${pipeCode}`;\n}\n\n/**\n * Look up a pipe's IO contract by pipe code, tolerant of both key conventions.\n *\n * The map may be keyed by namespaced `pipe_ref` (`<domain>.<code>`, the\n * canonical convention) OR by bare pipe code - the current hosted `/validate`\n * keys `pipe_structures` by bare code, and methods persisted before the\n * pipe_ref re-keying also carry bare-code keys. Try the namespaced ref first\n * (when the caller supplies a domain), then fall back to the bare code.\n * Returns `undefined` (never crashes) when neither matches.\n *\n * Both lookups read OWN properties only. A bare index returned the inherited\n * `Object` constructor for a pipe code named `constructor` (or `toString`, …) -\n * a truthy non-contract that sailed straight through the `if (!contract)` guard\n * hosts are shown writing, so a pipe that does not exist rendered as one taking\n * no inputs instead of reaching the host's not-found path. See `ownProp`.\n */\nexport function getPipeIOContract(\n  pipeIoContracts: PipeIOContracts | null | undefined,\n  domain: string | null | undefined,\n  pipeCode: string | null | undefined,\n): PipeIOContract | undefined {\n  if (!pipeIoContracts || !pipeCode) return undefined;\n  if (domain) {\n    const byRef = ownProp(pipeIoContracts, buildPipeRef(domain, pipeCode));\n    if (byRef) return byRef;\n  }\n  return ownProp(pipeIoContracts, pipeCode);\n}\n\n/**\n * True when the method declared the input omittable (`?`).\n *\n * The ONE reader of `presence` in the package: everything that asks \"may this\n * be absent?\" - the descriptor's `required`, the gate's `required` list, the\n * payload builders that omit an unfilled input - goes through here, so a\n * marker the wire adds later cannot mean one thing on one surface and another\n * elsewhere. `force` (`!`) reads as NOT optional, like `plain`.\n */\nexport function isOptionalInput(input: PipeInputContract): boolean {\n  return input.presence === 'optional';\n}\n\n/**\n * True when the input carries a plural concept (`Image[]`, `Image[3]`): its\n * JSON Schema is an array wrapper.\n *\n * Deliberately a SCHEMA test rather than a read of the declared `multiplicity`,\n * even though the wire now states both. The schema is what `buildRunFields`\n * maps and therefore what the user is shown; a predicate reading the other\n * field could disagree with the rendered control, which is the exact failure\n * mode `mustBeFilled` (readiness.ts) exists to prevent. The two agree by\n * construction upstream - pipelex wraps the schema in an array exactly when it\n * reports `variable` or `fixed`.\n */\nexport function isPluralInput(input: PipeInputContract): boolean {\n  return (input.json_schema as { type?: unknown } | undefined)?.type === 'array';\n}\n\n/**\n * True when the slot declares an EXACT number of items (`Concept[N]`), whose\n * count is `item_count`.\n *\n * The distinction that matters to the gate: a variable list can legitimately be\n * empty, a fixed one cannot.\n */\nexport function isFixedCountInput(input: PipeInputContract): boolean {\n  return input.multiplicity === 'fixed';\n}\n\n/**\n * True when the user MUST put a value in before a run can start.\n *\n * Two declarations relieve an input of that duty, for different reasons:\n * - **optional (`?`)** - the method itself states the caller may omit it;\n * - **variable-plural (`[]`)** - the empty list is a legitimate value and the\n *   language cannot declare \"at least one\", so gating on it would invent a\n *   constraint the method never made.\n *\n * Everything else gates: `plain`, `force` (`!`), and a **fixed-count** list\n * (`[N]`), which is a list whose empty form the method has explicitly ruled out.\n * This is the derivation the input-form descriptor spec states for `gating`.\n *\n * Emptiness is all this predicate answers for - WHETHER a slot gates, never how\n * much it needs. A fixed-count list that holds fewer items than it declares\n * gates here and is refused by `fieldFilled`, which reads the declared count off\n * the descriptor's `itemCount`, and by the gate's ajv pass on the schema's\n * `minItems`. All three read the one number the method stated.\n */\nexport function inputMustBeFilled(input: PipeInputContract): boolean {\n  if (isOptionalInput(input)) return false;\n  return !isPluralInput(input) || isFixedCountInput(input);\n}\n"]}

package/dist/chunk-NMT7BRLO.js

@@ -1,40 +0,0 @@
-// src/core/native-concepts.ts
-function nativeSet(...names) {
-  return new Set(names.flatMap((n) => [n, `native.${n}`]));
-}
-var TEXT_CONCEPTS = nativeSet("Text");
-var DATE_CONCEPTS = nativeSet("Date");
-var HTML_CONCEPTS = nativeSet("HTML");
-var DOCUMENT_CONCEPTS = nativeSet("Document");
-var PAGE_CONCEPTS = nativeSet("Page");
-var IMAGE_CONCEPTS = nativeSet("Image");
-var NUMBER_CONCEPTS = nativeSet("Number");
-var YES_NO_CONCEPTS = nativeSet("YesNo");
-var FIELD_TEXT_CONCEPTS = /* @__PURE__ */ new Set([
-  ...TEXT_CONCEPTS,
-  ...DATE_CONCEPTS
-]);
-var FIELD_DOCUMENT_CONCEPTS = /* @__PURE__ */ new Set([
-  ...DOCUMENT_CONCEPTS,
-  ...PAGE_CONCEPTS
-]);
-function isWireTextConcept(concept) {
-  return TEXT_CONCEPTS.has(concept);
-}
-function isWireDocumentLikeConcept(concept) {
-  return DOCUMENT_CONCEPTS.has(concept) || IMAGE_CONCEPTS.has(concept) || PAGE_CONCEPTS.has(concept);
-}
-var TEXT_WRAPPER_CONCEPTS = /* @__PURE__ */ new Set([
-  ...TEXT_CONCEPTS,
-  ...DATE_CONCEPTS,
-  ...HTML_CONCEPTS
-]);
-function splitListConcept(conceptRef) {
-  if (!conceptRef) return { isList: false };
-  if (conceptRef.endsWith("[]")) return { base: conceptRef.slice(0, -2), isList: true };
-  return { base: conceptRef, isList: false };
-}
-
-export { DATE_CONCEPTS, DOCUMENT_CONCEPTS, FIELD_DOCUMENT_CONCEPTS, FIELD_TEXT_CONCEPTS, HTML_CONCEPTS, IMAGE_CONCEPTS, NUMBER_CONCEPTS, PAGE_CONCEPTS, TEXT_CONCEPTS, TEXT_WRAPPER_CONCEPTS, YES_NO_CONCEPTS, isWireDocumentLikeConcept, isWireTextConcept, splitListConcept };
-//# sourceMappingURL=chunk-NMT7BRLO.js.map
-//# sourceMappingURL=chunk-NMT7BRLO.js.map

package/dist/chunk-NMT7BRLO.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/core/native-concepts.ts"],"names":[],"mappings":";AAqCA,SAAS,aAAa,KAAA,EAAsC;AAC1D,EAAA,OAAO,IAAI,GAAA,CAAI,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,KAAM,CAAC,CAAA,EAAG,CAAA,OAAA,EAAU,CAAC,CAAA,CAAE,CAAC,CAAC,CAAA;AACzD;AAEO,IAAM,aAAA,GAAgB,UAAU,MAAM;AACtC,IAAM,aAAA,GAAgB,UAAU,MAAM;AAEtC,IAAM,aAAA,GAAgB,UAAU,MAAM;AACtC,IAAM,iBAAA,GAAoB,UAAU,UAAU;AAC9C,IAAM,aAAA,GAAgB,UAAU,MAAM;AACtC,IAAM,cAAA,GAAiB,UAAU,OAAO;AACxC,IAAM,eAAA,GAAkB,UAAU,QAAQ;AAC1C,IAAM,eAAA,GAAkB,UAAU,OAAO;AAMzC,IAAM,mBAAA,uBAA+C,GAAA,CAAI;AAAA,EAC9D,GAAG,aAAA;AAAA,EACH,GAAG;AACL,CAAC;AAGM,IAAM,uBAAA,uBAAmD,GAAA,CAAI;AAAA,EAClE,GAAG,iBAAA;AAAA,EACH,GAAG;AACL,CAAC;AAOM,SAAS,kBAAkB,OAAA,EAA0B;AAC1D,EAAA,OAAO,aAAA,CAAc,IAAI,OAAO,CAAA;AAClC;AAGO,SAAS,0BAA0B,OAAA,EAA0B;AAClE,EAAA,OACE,iBAAA,CAAkB,GAAA,CAAI,OAAO,CAAA,IAAK,cAAA,CAAe,IAAI,OAAO,CAAA,IAAK,aAAA,CAAc,GAAA,CAAI,OAAO,CAAA;AAE9F;AAmBO,IAAM,qBAAA,uBAAiD,GAAA,CAAI;AAAA,EAChE,GAAG,aAAA;AAAA,EACH,GAAG,aAAA;AAAA,EACH,GAAG;AACL,CAAC;AAKM,SAAS,iBAAiB,UAAA,EAG/B;AACA,EAAA,IAAI,CAAC,UAAA,EAAY,OAAO,EAAE,QAAQ,KAAA,EAAM;AACxC,EAAA,IAAI,UAAA,CAAW,QAAA,CAAS,IAAI,CAAA,EAAG,OAAO,EAAE,IAAA,EAAM,UAAA,CAAW,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,EAAG,QAAQ,IAAA,EAAK;AACpF,EAAA,OAAO,EAAE,IAAA,EAAM,UAAA,EAAY,MAAA,EAAQ,KAAA,EAAM;AAC3C","file":"chunk-NMT7BRLO.js","sourcesContent":["/**\n * The native-concept taxonomy, stated ONCE - with each call path's historical\n * view exported explicitly, because the three copies this consolidates had\n * DRIFTED and K1 preserved each path's observable behavior exactly (see\n * `concept-taxonomy-characterization.test.ts`).\n *\n * The sets below spell the codes MTHDS actually defines (the `native` domain of\n * the language spec). That is not pedantry: a set that named a concept the\n * language does not have is what broke `native.Number`, because the render path\n * knew the concept and the value path did not.\n *\n * The drift, recorded for M1 (where the server-derived descriptor retires this\n * module entirely):\n *\n * | concept | field mapper (render)     | wire format (deflate/inflate) | value bridge (content wrapper) |\n * | ------- | ------------------------- | ----------------------------- | ------------------------------ |\n * | Text    | text/prose                | bare string                   | `{text}`, from `TextContent`   |\n * | Number  | number                    | `{concept, content}`          | `{number}`, from `NumberContent` |\n * | YesNo   | boolean                   | `{concept, content}`          | `{yes_no}`, from `YesNoContent` |\n * | Date    | text/prose (NOT a picker) | CUSTOM `{concept, content}`   | `{text}` - WRONG, see below    |\n * | Html    | nested object             | `{concept, content}`          | -                              |\n * | Page    | document                  | document-like (bare URL)      | -                              |\n *\n * A `Date` input therefore ships as `{concept: \"native.Date\", content: {text}}`\n * today - consistent end-to-end, but not `DateContent {date, time}`. Changing\n * that is a wire-visible fix and belongs to M1, not here.\n *\n * `HTML_CONCEPTS` below spells the code `HTML`; the language spells it `Html`\n * (`NativeConceptCode.HTML = \"Html\"`), so the set matches nothing a real\n * contract carries and `native.Html` falls through to the generic object\n * dispatch - a nested card over `HtmlContent {inner_html, css_class}`, which\n * round-trips correctly. Correcting the spelling would route `native.Html` into\n * the prose-plus-`{text}` drift above and BREAK inputs that work today, so the\n * spelling is left alone deliberately and goes with the Date fix at M1.\n */\n\n/** Both spellings a concept ref uses: bare (`Text`) and namespaced (`native.Text`). */\nfunction nativeSet(...names: string[]): ReadonlySet<string> {\n  return new Set(names.flatMap((n) => [n, `native.${n}`]));\n}\n\nexport const TEXT_CONCEPTS = nativeSet('Text');\nexport const DATE_CONCEPTS = nativeSet('Date');\n/** Deliberately the code the language does NOT use - see the header. */\nexport const HTML_CONCEPTS = nativeSet('HTML');\nexport const DOCUMENT_CONCEPTS = nativeSet('Document');\nexport const PAGE_CONCEPTS = nativeSet('Page');\nexport const IMAGE_CONCEPTS = nativeSet('Image');\nexport const NUMBER_CONCEPTS = nativeSet('Number');\nexport const YES_NO_CONCEPTS = nativeSet('YesNo');\n\n// ─── The field mapper's view (field-model.ts) ───────────────────────────────\n\n/** Concepts the mapper renders as text/prose - `Date` deliberately included\n *  (a `native.Date` input renders as prose today, not as a date picker). */\nexport const FIELD_TEXT_CONCEPTS: ReadonlySet<string> = new Set([\n  ...TEXT_CONCEPTS,\n  ...DATE_CONCEPTS,\n]);\n\n/** Concepts the mapper renders as a document upload - `Page` folded in. */\nexport const FIELD_DOCUMENT_CONCEPTS: ReadonlySet<string> = new Set([\n  ...DOCUMENT_CONCEPTS,\n  ...PAGE_CONCEPTS,\n]);\n\n// ─── The wire format's view (input-format.ts) ───────────────────────────────\n\n/** True when the simplified wire form is a bare string (`{text} ↔ \"...\"`).\n *  `Date` is NOT here: it travels through the custom-concept `{concept,\n *  content}` branch (the drift the header records). */\nexport function isWireTextConcept(concept: string): boolean {\n  return TEXT_CONCEPTS.has(concept);\n}\n\n/** True when the simplified wire form is a bare URL string. */\nexport function isWireDocumentLikeConcept(concept: string): boolean {\n  return (\n    DOCUMENT_CONCEPTS.has(concept) || IMAGE_CONCEPTS.has(concept) || PAGE_CONCEPTS.has(concept)\n  );\n}\n\n// ─── The value bridge's view (run-values.ts) ────────────────────────────────\n\n/**\n * The FALLBACK text wrapper, for a text concept whose contract declares no\n * single-property content model to read the wrapper name off.\n *\n * The wrapper property is normally derived from the declared schema, in\n * `derive.ts`, and travels on the descriptor as `RunField.contentKey` - so the\n * value bridge wraps by name and holds no taxonomy of its own. This set is what\n * answers when that derivation finds nothing:\n *\n * - `native.Text` with a degenerate contract (a bare `{type: 'object'}`, or a\n *   bare `{type: 'string'}`) still wraps as `{text}`, as it always has;\n * - `native.Date` declares `DateContent {date, time}` - two properties, so no\n *   single wrapper - and this set is what keeps it wrapping as `{text}`. That\n *   is the recorded drift, preserved on purpose until M1.\n */\nexport const TEXT_WRAPPER_CONCEPTS: ReadonlySet<string> = new Set([\n  ...TEXT_CONCEPTS,\n  ...DATE_CONCEPTS,\n  ...HTML_CONCEPTS,\n]);\n\n// ─── List refs ──────────────────────────────────────────────────────────────\n\n/** A concept ref like `native.Document[]` → base `native.Document`, isList true. */\nexport function splitListConcept(conceptRef: string | undefined): {\n  base?: string;\n  isList: boolean;\n} {\n  if (!conceptRef) return { isList: false };\n  if (conceptRef.endsWith('[]')) return { base: conceptRef.slice(0, -2), isList: true };\n  return { base: conceptRef, isList: false };\n}\n"]}

package/dist/chunk-O4O3QNVC.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/core/schema-utils.ts"],"names":[],"mappings":";AA6BO,SAAS,iBAAiB,MAAA,EAAgC;AAC/D,EAAA,MAAM,QAAQ,MAAA,CAAO,KAAA;AACrB,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,MAAA;AAClC,EAAA,MAAM,QAAA,GAAW,KAAA;AACjB,EAAA,MAAM,UAAU,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,EAAG,SAAS,MAAM,CAAA;AACzD,EAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,GAAG,UAAA,CAAW,MAAM,CAAA,EAAG,GAAG,OAAA,CAAQ,CAAC,CAAA,EAAE;AACxE,EAAA,OAAO,MAAA;AACT;AAEA,IAAM,eAAA,uBAAsB,GAAA,CAAI,CAAC,UAAU,QAAA,EAAU,SAAA,EAAW,SAAA,EAAW,MAAM,CAAC,CAAA;AAMlF,SAAS,kBAAkB,MAAA,EAA6B;AACtD,EAAA,MAAM,OAAO,MAAA,CAAO,IAAA;AACpB,EAAA,IAAI,OAAO,SAAS,QAAA,IAAY,CAAC,gBAAgB,GAAA,CAAI,IAAI,GAAG,OAAO,KAAA;AACnE,EAAA,MAAM,WAAA,uBAAkB,GAAA,CAAI,CAAC,QAAQ,SAAA,EAAW,aAAA,EAAe,OAAO,CAAC,CAAA;AACvE,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,MAAM,CAAA,CAAE,KAAA,CAAM,CAAC,GAAA,KAAQ,WAAA,CAAY,GAAA,CAAI,GAAG,CAAC,CAAA;AAChE;AASO,SAAS,aAAa,MAAA,EAAgC;AAC3D,EAAA,MAAM,QAAQ,MAAA,CAAO,KAAA;AACrB,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,MAAA;AAElC,EAAA,MAAM,QAAA,GAAW,KAAA;AAGjB,EAAA,IACE,QAAA,CAAS,KAAA;AAAA,IACP,CAAC,WAAW,OAAO,MAAA,KAAW,YAAY,MAAA,KAAW,IAAA,IAAQ,kBAAkB,MAAM;AAAA,GACvF,EACA;AACA,IAAA,MAAM,QAAkB,EAAC;AACzB,IAAA,IAAI,aAAA,GAAyB,MAAA;AAC7B,IAAA,KAAA,MAAW,UAAU,QAAA,EAAU;AAC7B,MAAA,KAAA,CAAM,IAAA,CAAK,OAAO,IAAc,CAAA;AAChC,MAAA,IAAI,MAAA,CAAO,OAAA,KAAY,MAAA,EAAW,aAAA,GAAgB,MAAA,CAAO,OAAA;AAAA,IAC3D;AACA,IAAA,MAAM,EAAE,KAAA,EAAO,CAAA,EAAG,GAAG,MAAK,GAAI,MAAA;AAC9B,IAAA,MAAM,MAAA,GAAqB,EAAE,GAAG,IAAA,EAAM,MAAM,KAAA,EAAM;AAClD,IAAA,IAAI,aAAA,KAAkB,MAAA,IAAa,MAAA,CAAO,OAAA,KAAY,MAAA,EAAW;AAC/D,MAAA,MAAA,CAAO,OAAA,GAAU,aAAA;AAAA,IACnB;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAGA,EAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG;AACzB,IAAA,MAAM,aAAa,QAAA,CAAS,IAAA;AAAA,MAC1B,CAAC,MAAM,OAAO,CAAA,KAAM,YAAY,CAAA,KAAM,IAAA,IAAQ,EAAE,IAAA,KAAS;AAAA,KAC3D;AACA,IAAA,MAAM,cAAc,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,MAAM,UAAU,CAAA;AACzD,IAAA,IAAI,UAAA,IAAc,WAAA,IAAe,OAAO,WAAA,KAAgB,QAAA,EAAU;AAChE,MAAA,MAAM,EAAE,KAAA,EAAO,CAAA,EAAG,GAAG,MAAK,GAAI,MAAA;AAC9B,MAAA,OAAO,EAAE,GAAG,IAAA,EAAM,GAAG,WAAA,EAAY;AAAA,IACnC;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,WAAW,MAAA,EAAgC;AAClD,EAAA,MAAM,EAAE,KAAA,EAAO,KAAA,EAAO,GAAG,MAAK,GAAI,MAAA;AAClC,EAAA,OAAO,IAAA;AACT;AAMO,SAAS,aAAa,MAAA,EAAwC;AACnE,EAAA,MAAM,IAAI,MAAA,CAAO,IAAA;AACjB,EAAA,IAAI,OAAO,CAAA,KAAM,QAAA,EAAU,OAAO,CAAA;AAClC,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,EAAG,OAAO,EAAE,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,KAAM,MAAM,CAAA;AACvD,EAAA,OAAO,MAAA;AACT;AAIO,SAAS,WAAA,CAAY,QAAoB,IAAA,EAA8C;AAC5F,EAAA,MAAM,MAAM,MAAA,CAAO,IAAA;AACnB,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,GAAA,CAAI,UAAA,CAAW,UAAU,CAAA,EAAG;AACzD,IAAA,MAAM,WAAW,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,UAAA,CAAW,MAAM,CAAC,CAAA;AAClD,IAAA,IAAI,QAAA,SAAiB,EAAE,GAAG,UAAU,GAAG,QAAA,CAAS,MAAM,CAAA,EAAE;AAAA,EAC1D;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,SAAS,MAAA,EAAgC;AAChD,EAAA,MAAM,EAAE,IAAA,EAAM,KAAA,EAAO,GAAG,MAAK,GAAI,MAAA;AACjC,EAAA,OAAO,IAAA;AACT;AAUO,SAAS,wBAAA,CACd,QACA,IAAA,EACY;AACZ,EAAA,IAAI,OAAA,GAAU,MAAA;AACd,EAAA,WAAS;AACP,IAAA,MAAM,MAAM,OAAA,CAAQ,IAAA;AACpB,IAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,GAAA,CAAI,UAAA,CAAW,UAAU,CAAA,EAAG;AACzD,MAAA,MAAM,WAAW,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,UAAA,CAAW,MAAM,CAAC,CAAA;AAClD,MAAA,IAAI,QAAA,EAAU;AACZ,QAAA,OAAA,GAAU,QAAA;AACV,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChC,MAAA,MAAM,OAAA,GAAW,QAAQ,KAAA,CAAuB,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,EAAG,SAAS,MAAM,CAAA;AAChF,MAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AACxB,QAAA,OAAA,GAAU,QAAQ,CAAC,CAAA;AACnB,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,OAAO,OAAA;AAAA,EACT;AACF;AAoBO,SAAS,iBAAA,CACd,MAAA,EACA,IAAA,EACA,OAAA,EAC4B;AAC5B,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AACjD,IAAA,IAAI,GAAA,KAAQ,OAAA,IAAW,KAAA,IAAS,OAAO,KAAA,KAAU,YAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAClF,MAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAmC,CAAA,EAAG;AAC7E,QAAA,IAAI,EAAE,IAAA,IAAQ,IAAA,CAAA,IAAS,GAAA,IAAO,OAAO,QAAQ,QAAA,EAAU;AACrD,UAAA,IAAA,CAAK,IAAI,CAAA,GAAI,GAAA;AACb,UAAA,iBAAA,CAAkB,GAAA,EAAK,MAAM,OAAO,CAAA;AAAA,QACtC;AAAA,MACF;AAAA,IACF,CAAA,MAAA,IAAW,SAAS,OAAO,KAAA,KAAU,YAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACtE,MAAA,iBAAA,CAAkB,KAAA,EAAqB,MAAM,OAAO,CAAA;AAAA,IACtD,WAAW,OAAA,CAAQ,cAAA,IAAkB,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAGzD,MAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,QAAA,IAAI,IAAA,IAAQ,OAAO,IAAA,KAAS,QAAA,EAAU;AACpC,UAAA,iBAAA,CAAkB,IAAA,EAAoB,MAAM,OAAO,CAAA;AAAA,QACrD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AASA,SAAS,kBAAA,CAAmB,QAAoB,SAAA,EAAmC;AACjF,EAAA,MAAM,MAAkB,EAAC;AACzB,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AACjD,IAAA,IAAI,GAAA,KAAQ,OAAA,IAAW,KAAA,IAAS,OAAO,KAAA,KAAU,YAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAClF,MAAA,KAAA,MAAW,CAAC,OAAA,EAAS,QAAQ,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAmB,CAAA,EAAG;AACrE,QAAA,IAAI,EAAE,OAAA,IAAW,SAAA,CAAA,IAAc,QAAA,IAAY,OAAO,aAAa,QAAA,EAAU;AACvE,UAAA,SAAA,CAAU,OAAO,IAAI,EAAC;AACtB,UAAA,SAAA,CAAU,OAAO,CAAA,GAAI,kBAAA,CAAmB,QAAA,EAAwB,SAAS,CAAA;AAAA,QAC3E;AAAA,MACF;AAAA,IAEF,CAAA,MAAA,IAAW,SAAS,OAAO,KAAA,KAAU,YAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACtE,MAAA,GAAA,CAAI,GAAG,CAAA,GAAI,kBAAA,CAAmB,KAAA,EAAqB,SAAS,CAAA;AAAA,IAC9D,CAAA,MAAA,IAAW,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAC/B,MAAA,GAAA,CAAI,GAAG,IAAI,KAAA,CAAM,GAAA;AAAA,QAAI,CAAC,IAAA,KACpB,IAAA,IAAQ,OAAO,SAAS,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,GACnD,kBAAA,CAAmB,IAAA,EAAoB,SAAS,CAAA,GAChD;AAAA,OACN;AAAA,IACF,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,GAAG,CAAA,GAAI,KAAA;AAAA,IACb;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAQO,SAAS,gBAAgB,MAAA,EAAgC;AAC9D,EAAA,MAAM,YAAwB,EAAC;AAC/B,EAAA,MAAM,QAAA,GAAW,kBAAA,CAAmB,MAAA,EAAQ,SAAS,CAAA;AACrD,EAAA,IAAI,MAAA,CAAO,IAAA,CAAK,SAAS,CAAA,CAAE,SAAS,CAAA,EAAG;AACrC,IAAA,QAAA,CAAS,KAAA,GAAQ,SAAA;AAAA,EACnB;AACA,EAAA,OAAO,QAAA;AACT","file":"chunk-O4O3QNVC.js","sourcesContent":["/**\n * The ONE place JSON-Schema plumbing lives for the run form kernel: nullable\n * `anyOf` collapsing, `$defs` collection/hoisting, `$ref` resolution, and type\n * extraction. Consolidated from three drifted private copies (`field-model.ts`,\n * `normalize-schema.ts`, `input-format.ts`) during the form-kernel extraction.\n *\n * Two collapse engines are exported ON PURPOSE - their semantics genuinely\n * differ, and each caller's observable behavior is characterized and preserved\n * (see `schema-utils-characterization.test.ts`):\n *\n * - `collapseNullable` (the field mapper's rule): collapse ONLY when exactly one\n *   non-null branch remains, dropping the null. A multi-branch union stays an\n *   `anyOf` and maps to the raw-JSON escape hatch.\n * - `flattenAnyOf` (the RJSF/ajv rule): a union of simple primitives becomes a\n *   `type` ARRAY (null preserved as a type entry - ajv validates `type:\n *   [\"number\",\"null\"]` natively); a 2-branch nullable non-primitive drops the\n *   null branch.\n *\n * Whether these converge (and which semantics win) is an M1 question, decided\n * when the descriptor derivation moves server-side - not silently here.\n */\n\nexport type JsonSchema = Record<string, unknown>;\n\n// ─── anyOf collapsing ────────────────────────────────────────────────────────\n\n/** Pydantic emits `anyOf: [T, {type:'null'}]` for Optional[T]; collapse to T.\n *  Collapses ONLY when exactly one non-null branch remains; the branch merges\n *  OVER the outer schema (its constraints win). */\nexport function collapseNullable(schema: JsonSchema): JsonSchema {\n  const anyOf = schema.anyOf;\n  if (!Array.isArray(anyOf)) return schema;\n  const branches = anyOf as JsonSchema[];\n  const nonNull = branches.filter((b) => b?.type !== 'null');\n  if (nonNull.length === 1) return { ...stripAnyOf(schema), ...nonNull[0] };\n  return schema;\n}\n\nconst PRIMITIVE_TYPES = new Set(['string', 'number', 'integer', 'boolean', 'null']);\n\n/**\n * An `anyOf` entry that is a simple primitive with no constraints:\n * `{type: \"string\"}` is simple, `{type: \"string\", maxLength: 10}` is not.\n */\nfunction isSimplePrimitive(schema: JsonSchema): boolean {\n  const type = schema.type;\n  if (typeof type !== 'string' || !PRIMITIVE_TYPES.has(type)) return false;\n  const allowedKeys = new Set(['type', 'default', 'description', 'title']);\n  return Object.keys(schema).every((key) => allowedKeys.has(key));\n}\n\n/**\n * The RJSF/ajv collapse: a union of simple primitives flattens to a `type`\n * array (`anyOf: [{string},{null}]` → `type: [\"string\",\"null\"]`, which RJSF\n * renders as a plain input instead of a sub-schema picker); an exactly-two\n * `[T, {null}]` union of anything else drops the null branch and merges T over\n * the outer schema. Anything else passes through unchanged.\n */\nexport function flattenAnyOf(schema: JsonSchema): JsonSchema {\n  const anyOf = schema.anyOf;\n  if (!Array.isArray(anyOf)) return schema;\n\n  const branches = anyOf as JsonSchema[];\n\n  // Case 1: all branches are simple primitives → type array.\n  if (\n    branches.every(\n      (branch) => typeof branch === 'object' && branch !== null && isSimplePrimitive(branch),\n    )\n  ) {\n    const types: string[] = [];\n    let mergedDefault: unknown = undefined;\n    for (const branch of branches) {\n      types.push(branch.type as string);\n      if (branch.default !== undefined) mergedDefault = branch.default;\n    }\n    const { anyOf: _, ...rest } = schema;\n    const result: JsonSchema = { ...rest, type: types };\n    if (mergedDefault !== undefined && result.default === undefined) {\n      result.default = mergedDefault;\n    }\n    return result;\n  }\n\n  // Case 2: exactly [T, {type: \"null\"}] - nullable non-primitive → drop null.\n  if (branches.length === 2) {\n    const nullBranch = branches.find(\n      (b) => typeof b === 'object' && b !== null && b.type === 'null',\n    );\n    const otherBranch = branches.find((b) => b !== nullBranch);\n    if (nullBranch && otherBranch && typeof otherBranch === 'object') {\n      const { anyOf: _, ...rest } = schema;\n      return { ...rest, ...otherBranch };\n    }\n  }\n\n  return schema;\n}\n\nfunction stripAnyOf(schema: JsonSchema): JsonSchema {\n  const { anyOf: _drop, ...rest } = schema;\n  return rest;\n}\n\n// ─── Type & $ref helpers ─────────────────────────────────────────────────────\n\n/** The schema's non-null type: a bare `type` string, or the first non-null\n *  entry of a `type` array (`[\"number\",\"null\"]` → `\"number\"`). */\nexport function schemaTypeOf(schema: JsonSchema): string | undefined {\n  const t = schema.type;\n  if (typeof t === 'string') return t;\n  if (Array.isArray(t)) return t.find((x) => x !== 'null') as string | undefined;\n  return undefined;\n}\n\n/** Resolve `{ $ref: \"#/$defs/Foo\" }` against a collected `$defs` map. Sibling\n *  keys on the referencing schema override the definition's. */\nexport function derefSchema(schema: JsonSchema, defs: Record<string, JsonSchema>): JsonSchema {\n  const ref = schema.$ref;\n  if (typeof ref === 'string' && ref.startsWith('#/$defs/')) {\n    const resolved = defs[ref.slice('#/$defs/'.length)];\n    if (resolved) return { ...resolved, ...stripRef(schema) };\n  }\n  return schema;\n}\n\nfunction stripRef(schema: JsonSchema): JsonSchema {\n  const { $ref: _drop, ...rest } = schema;\n  return rest;\n}\n\n/**\n * Resolve the indirection layers pydantic puts in front of a value schema - a\n * `#/$defs/...` ref, a nullable `anyOf: [T, {null}]` wrapper, or a stack of\n * both - until a plain schema remains. This is the resolver `healStringWrappers`\n * and `pruneEmptyOptionals` apply before reading `type`. Unlike `derefSchema`\n * it REPLACES the schema with the definition (no sibling merge) - exactly what\n * the callers did inline.\n */\nexport function resolveSchemaIndirection(\n  schema: JsonSchema,\n  defs: Record<string, JsonSchema>,\n): JsonSchema {\n  let current = schema;\n  for (;;) {\n    const ref = current.$ref;\n    if (typeof ref === 'string' && ref.startsWith('#/$defs/')) {\n      const resolved = defs[ref.slice('#/$defs/'.length)];\n      if (resolved) {\n        current = resolved;\n        continue;\n      }\n    }\n    if (Array.isArray(current.anyOf)) {\n      const nonNull = (current.anyOf as JsonSchema[]).filter((b) => b?.type !== 'null');\n      if (nonNull.length === 1) {\n        current = nonNull[0]!;\n        continue;\n      }\n    }\n    return current;\n  }\n}\n\n// ─── $defs collection ────────────────────────────────────────────────────────\n\nexport interface CollectDefsOptions {\n  /**\n   * Whether the walk descends into JSON arrays (`anyOf`/`allOf` branches,\n   * tuple `items`). The field mapper always has (so a def declared inside an\n   * `anyOf` branch resolves); the wire-format heal path historically has NOT -\n   * both behaviors are characterized, and each caller states its mode\n   * explicitly until M1 retires the difference.\n   */\n  traverseArrays: boolean;\n}\n\n/**\n * Collect every nested `$defs` entry into one flat map so `#/$defs/...` refs\n * resolve from anywhere. First definition of a name wins. The input schema is\n * NOT modified (see `hoistDefsToRoot` for the stripping variant).\n */\nexport function collectSchemaDefs(\n  schema: JsonSchema,\n  into: Record<string, JsonSchema>,\n  options: CollectDefsOptions,\n): Record<string, JsonSchema> {\n  for (const [key, value] of Object.entries(schema)) {\n    if (key === '$defs' && value && typeof value === 'object' && !Array.isArray(value)) {\n      for (const [name, def] of Object.entries(value as Record<string, JsonSchema>)) {\n        if (!(name in into) && def && typeof def === 'object') {\n          into[name] = def;\n          collectSchemaDefs(def, into, options);\n        }\n      }\n    } else if (value && typeof value === 'object' && !Array.isArray(value)) {\n      collectSchemaDefs(value as JsonSchema, into, options);\n    } else if (options.traverseArrays && Array.isArray(value)) {\n      // Any object item recurses - including a nested array, whose indices then\n      // walk as keys (matches the historical field-model walker exactly).\n      for (const item of value) {\n        if (item && typeof item === 'object') {\n          collectSchemaDefs(item as JsonSchema, into, options);\n        }\n      }\n    }\n  }\n  return into;\n}\n\n// ─── $defs hoisting (the RJSF wrapper-schema case) ──────────────────────────\n\n/**\n * Walk a schema, collect every `$defs` entry into `collected`, and return the\n * schema with those nested `$defs` STRIPPED. Cycle-safe: a def name is claimed\n * (placeholder) before its body is walked.\n */\nfunction walkAndCollectDefs(schema: JsonSchema, collected: JsonSchema): JsonSchema {\n  const out: JsonSchema = {};\n  for (const [key, value] of Object.entries(schema)) {\n    if (key === '$defs' && value && typeof value === 'object' && !Array.isArray(value)) {\n      for (const [defName, defValue] of Object.entries(value as JsonSchema)) {\n        if (!(defName in collected) && defValue && typeof defValue === 'object') {\n          collected[defName] = {};\n          collected[defName] = walkAndCollectDefs(defValue as JsonSchema, collected);\n        }\n      }\n      // Don't copy `$defs` into out - it's hoisted to the root.\n    } else if (value && typeof value === 'object' && !Array.isArray(value)) {\n      out[key] = walkAndCollectDefs(value as JsonSchema, collected);\n    } else if (Array.isArray(value)) {\n      out[key] = value.map((item) =>\n        item && typeof item === 'object' && !Array.isArray(item)\n          ? walkAndCollectDefs(item as JsonSchema, collected)\n          : item,\n      );\n    } else {\n      out[key] = value;\n    }\n  }\n  return out;\n}\n\n/**\n * Hoist every nested `$defs` to the schema root, so a wrapper schema composed\n * from several pydantic sub-schemas keeps its `#/$defs/...` refs resolvable.\n * (Pydantic emits one `$defs` per model; composing models as properties of a\n * wrapper object leaves those maps below the root the refs point to.)\n */\nexport function hoistDefsToRoot(schema: JsonSchema): JsonSchema {\n  const collected: JsonSchema = {};\n  const stripped = walkAndCollectDefs(schema, collected);\n  if (Object.keys(collected).length > 0) {\n    stripped.$defs = collected;\n  }\n  return stripped;\n}\n"]}

package/dist/chunk-VMLXO5JS.js

@@ -1,132 +0,0 @@
-import { collectSchemaDefs, collapseNullable, derefSchema, schemaTypeOf } from './chunk-O4O3QNVC.js';
-import { isOptionalInput, inputMustBeFilled } from './chunk-HARYEWNG.js';
-import { splitListConcept, FIELD_DOCUMENT_CONCEPTS, IMAGE_CONCEPTS, FIELD_TEXT_CONCEPTS, HTML_CONCEPTS, TEXT_WRAPPER_CONCEPTS, NUMBER_CONCEPTS, YES_NO_CONCEPTS } from './chunk-NMT7BRLO.js';
-
-// src/core/derive.ts
-function isDocumentObject(schema) {
-  const props = schema.properties;
-  return Boolean(props?.url);
-}
-function scalarWrapper(schema, ctx) {
-  const props = schema.properties;
-  const entries = props ? Object.entries(props) : [];
-  const only = entries.length === 1 ? entries[0] : void 0;
-  if (!only) return void 0;
-  const [key, propSchema] = only;
-  return { key, schema: collapseNullable(derefSchema(propSchema ?? {}, ctx.defs)) };
-}
-function mapSchema(name, conceptRef, rawSchema, required, ctx) {
-  const schema = collapseNullable(derefSchema(rawSchema, ctx.defs));
-  const common = {
-    name,
-    conceptRef,
-    description: typeof schema.description === "string" ? schema.description : void 0,
-    required
-  };
-  const { base, isList } = splitListConcept(conceptRef);
-  if (isList || schemaTypeOf(schema) === "array") {
-    const itemsSchema = schema.items ?? {};
-    const item = mapSchema(name, base, itemsSchema, true, { ...ctx, depth: ctx.depth + 1 });
-    const itemCount = numOrUndef(schema.minItems);
-    const maxItemCount = numOrUndef(schema.maxItems);
-    return {
-      ...common,
-      kind: "list",
-      item,
-      ...itemCount === void 0 ? {} : { itemCount },
-      ...maxItemCount === void 0 ? {} : { maxItemCount }
-    };
-  }
-  if (Array.isArray(schema.enum)) {
-    return { ...common, kind: "enum", options: schema.enum.map(String) };
-  }
-  if (base) {
-    if (FIELD_DOCUMENT_CONCEPTS.has(base))
-      return { ...common, kind: "document", accept: "PDF, DOCX, TXT" };
-    if (IMAGE_CONCEPTS.has(base)) return { ...common, kind: "image", accept: "PNG, JPG, WEBP" };
-    const wrapper = scalarWrapper(schema, ctx);
-    if (FIELD_TEXT_CONCEPTS.has(base) || HTML_CONCEPTS.has(base)) {
-      const contentKey = wrapper?.key ?? (TEXT_WRAPPER_CONCEPTS.has(base) ? "text" : void 0);
-      return ctx.depth === 0 ? { ...common, contentKey, kind: "prose" } : { ...common, contentKey, kind: "text" };
-    }
-    if (NUMBER_CONCEPTS.has(base))
-      return {
-        ...common,
-        contentKey: wrapper?.key,
-        kind: "number",
-        // `NumberContent.number` is `int | float`, an unresolvable union, so the
-        // control stays a float input. Constraints are read off the WRAPPED
-        // property - the wrapper object never carries them, which is why the
-        // outer schema always answered `undefined`.
-        integer: false,
-        min: numOrUndef(wrapper?.schema.minimum ?? schema.minimum),
-        max: numOrUndef(wrapper?.schema.maximum ?? schema.maximum)
-      };
-    if (YES_NO_CONCEPTS.has(base)) return { ...common, contentKey: wrapper?.key, kind: "boolean" };
-  }
-  if (isDocumentObject(schema)) {
-    return { ...common, kind: "document", accept: "PDF, DOCX, TXT" };
-  }
-  const type = schemaTypeOf(schema);
-  switch (type) {
-    case "string": {
-      if (base && (FIELD_DOCUMENT_CONCEPTS.has(base) || base === "native.Document"))
-        return { ...common, kind: "document", accept: "PDF, DOCX, TXT" };
-      if (schema.format === "date" || schema.format === "date-time")
-        return { ...common, kind: "date", datetime: schema.format === "date-time" };
-      const long = base && FIELD_TEXT_CONCEPTS.has(base) ? ctx.depth === 0 : typeof schema.maxLength === "number" ? schema.maxLength > 120 : false;
-      return long ? { ...common, kind: "prose" } : { ...common, kind: "text", placeholder: void 0 };
-    }
-    case "integer":
-      return {
-        ...common,
-        kind: "number",
-        integer: true,
-        min: numOrUndef(schema.minimum),
-        max: numOrUndef(schema.maximum)
-      };
-    case "number":
-      return {
-        ...common,
-        kind: "number",
-        integer: false,
-        min: numOrUndef(schema.minimum),
-        max: numOrUndef(schema.maximum)
-      };
-    case "boolean":
-      return { ...common, kind: "boolean" };
-    case "object": {
-      const props = schema.properties ?? {};
-      const req = new Set(Array.isArray(schema.required) ? schema.required : []);
-      const fields = Object.entries(props).map(
-        ([fieldName, fieldSchema]) => mapSchema(fieldName, void 0, fieldSchema, req.has(fieldName), {
-          ...ctx,
-          depth: ctx.depth + 1
-        })
-      );
-      return { ...common, kind: "object", fields };
-    }
-    default:
-      if (base && FIELD_TEXT_CONCEPTS.has(base))
-        return ctx.depth === 0 ? { ...common, kind: "prose" } : { ...common, kind: "text" };
-      return { ...common, kind: "unknown" };
-  }
-}
-function numOrUndef(v) {
-  return typeof v === "number" ? v : void 0;
-}
-function buildRunFields(inputs) {
-  return Object.entries(inputs).map(([name, input]) => {
-    const defs = {};
-    collectSchemaDefs(input.json_schema, defs, { traverseArrays: true });
-    const field = mapSchema(name, input.concept_ref, input.json_schema, !isOptionalInput(input), {
-      defs,
-      depth: 0
-    });
-    return { ...field, gating: inputMustBeFilled(input) };
-  });
-}
-
-export { buildRunFields };
-//# sourceMappingURL=chunk-VMLXO5JS.js.map
-//# sourceMappingURL=chunk-VMLXO5JS.js.map

package/dist/chunk-VMLXO5JS.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/core/derive.ts"],"names":[],"mappings":";;;;;AA6CA,SAAS,iBAAiB,MAAA,EAA6B;AACrD,EAAA,MAAM,QAAQ,MAAA,CAAO,UAAA;AACrB,EAAA,OAAO,OAAA,CAAQ,OAAO,GAAG,CAAA;AAC3B;AAwBA,SAAS,aAAA,CACP,QACA,GAAA,EACiD;AACjD,EAAA,MAAM,QAAQ,MAAA,CAAO,UAAA;AACrB,EAAA,MAAM,UAAU,KAAA,GAAQ,MAAA,CAAO,OAAA,CAAQ,KAAK,IAAI,EAAC;AACjD,EAAA,MAAM,OAAO,OAAA,CAAQ,MAAA,KAAW,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,GAAI,MAAA;AACjD,EAAA,IAAI,CAAC,MAAM,OAAO,MAAA;AAClB,EAAA,MAAM,CAAC,GAAA,EAAK,UAAU,CAAA,GAAI,IAAA;AAC1B,EAAA,OAAO,EAAE,GAAA,EAAK,MAAA,EAAQ,gBAAA,CAAiB,WAAA,CAAY,UAAA,IAAc,EAAC,EAAG,GAAA,CAAI,IAAI,CAAC,CAAA,EAAE;AAClF;AAGA,SAAS,SAAA,CACP,IAAA,EACA,UAAA,EACA,SAAA,EACA,UACA,GAAA,EACU;AACV,EAAA,MAAM,SAAS,gBAAA,CAAiB,WAAA,CAAY,SAAA,EAAW,GAAA,CAAI,IAAI,CAAC,CAAA;AAOhE,EAAA,MAAM,MAAA,GAAyB;AAAA,IAC7B,IAAA;AAAA,IACA,UAAA;AAAA,IACA,aAAa,OAAO,MAAA,CAAO,WAAA,KAAgB,QAAA,GAAW,OAAO,WAAA,GAAc,MAAA;AAAA,IAC3E;AAAA,GACF;AAEA,EAAA,MAAM,EAAE,IAAA,EAAM,MAAA,EAAO,GAAI,iBAAiB,UAAU,CAAA;AAGpD,EAAA,IAAI,MAAA,IAAU,YAAA,CAAa,MAAM,CAAA,KAAM,OAAA,EAAS;AAC9C,IAAA,MAAM,WAAA,GAAe,MAAA,CAAO,KAAA,IAAwB,EAAC;AACrD,IAAA,MAAM,IAAA,GAAO,SAAA,CAAU,IAAA,EAAM,IAAA,EAAM,WAAA,EAAa,IAAA,EAAM,EAAE,GAAG,GAAA,EAAK,KAAA,EAAO,GAAA,CAAI,KAAA,GAAQ,GAAG,CAAA;AAOtF,IAAA,MAAM,SAAA,GAAY,UAAA,CAAW,MAAA,CAAO,QAAQ,CAAA;AAC5C,IAAA,MAAM,YAAA,GAAe,UAAA,CAAW,MAAA,CAAO,QAAQ,CAAA;AAC/C,IAAA,OAAO;AAAA,MACL,GAAG,MAAA;AAAA,MACH,IAAA,EAAM,MAAA;AAAA,MACN,IAAA;AAAA,MACA,GAAI,SAAA,KAAc,MAAA,GAAY,EAAC,GAAI,EAAE,SAAA,EAAU;AAAA,MAC/C,GAAI,YAAA,KAAiB,MAAA,GAAY,EAAC,GAAI,EAAE,YAAA;AAAa,KACvD;AAAA,EACF;AAGA,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,MAAA,CAAO,IAAI,CAAA,EAAG;AAC9B,IAAA,OAAO,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,MAAA,EAAQ,SAAS,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA,EAAE;AAAA,EACrE;AAGA,EAAA,IAAI,IAAA,EAAM;AACR,IAAA,IAAI,uBAAA,CAAwB,IAAI,IAAI,CAAA;AAClC,MAAA,OAAO,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,UAAA,EAAY,QAAQ,gBAAA,EAAiB;AACjE,IAAA,IAAI,cAAA,CAAe,GAAA,CAAI,IAAI,CAAA,EAAG,OAAO,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,OAAA,EAAS,MAAA,EAAQ,gBAAA,EAAiB;AAM1F,IAAA,MAAM,OAAA,GAAU,aAAA,CAAc,MAAA,EAAQ,GAAG,CAAA;AAEzC,IAAA,IAAI,oBAAoB,GAAA,CAAI,IAAI,KAAK,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA,EAAG;AAI5D,MAAA,MAAM,aAAa,OAAA,EAAS,GAAA,KAAQ,sBAAsB,GAAA,CAAI,IAAI,IAAI,MAAA,GAAS,MAAA,CAAA;AAC/E,MAAA,OAAO,GAAA,CAAI,KAAA,KAAU,CAAA,GACjB,EAAE,GAAG,MAAA,EAAQ,UAAA,EAAY,IAAA,EAAM,OAAA,KAC/B,EAAE,GAAG,MAAA,EAAQ,UAAA,EAAY,MAAM,MAAA,EAAO;AAAA,IAC5C;AACA,IAAA,IAAI,eAAA,CAAgB,IAAI,IAAI,CAAA;AAC1B,MAAA,OAAO;AAAA,QACL,GAAG,MAAA;AAAA,QACH,YAAY,OAAA,EAAS,GAAA;AAAA,QACrB,IAAA,EAAM,QAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAKN,OAAA,EAAS,KAAA;AAAA,QACT,KAAK,UAAA,CAAW,OAAA,EAAS,MAAA,CAAO,OAAA,IAAW,OAAO,OAAO,CAAA;AAAA,QACzD,KAAK,UAAA,CAAW,OAAA,EAAS,MAAA,CAAO,OAAA,IAAW,OAAO,OAAO;AAAA,OAC3D;AACF,IAAA,IAAI,eAAA,CAAgB,GAAA,CAAI,IAAI,CAAA,EAAG,OAAO,EAAE,GAAG,MAAA,EAAQ,UAAA,EAAY,OAAA,EAAS,GAAA,EAAK,IAAA,EAAM,SAAA,EAAU;AAAA,EAC/F;AAGA,EAAA,IAAI,gBAAA,CAAiB,MAAM,CAAA,EAAG;AAC5B,IAAA,OAAO,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,UAAA,EAAY,QAAQ,gBAAA,EAAiB;AAAA,EACjE;AAEA,EAAA,MAAM,IAAA,GAAO,aAAa,MAAM,CAAA;AAChC,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,QAAA,EAAU;AACb,MAAA,IAAI,IAAA,KAAS,uBAAA,CAAwB,GAAA,CAAI,IAAI,KAAK,IAAA,KAAS,iBAAA,CAAA;AACzD,QAAA,OAAO,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,UAAA,EAAY,QAAQ,gBAAA,EAAiB;AAIjE,MAAA,IAAI,MAAA,CAAO,MAAA,KAAW,MAAA,IAAU,MAAA,CAAO,MAAA,KAAW,WAAA;AAChD,QAAA,OAAO,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,QAAQ,QAAA,EAAU,MAAA,CAAO,WAAW,WAAA,EAAY;AAI5E,MAAA,MAAM,IAAA,GACJ,IAAA,IAAQ,mBAAA,CAAoB,GAAA,CAAI,IAAI,CAAA,GAChC,GAAA,CAAI,KAAA,KAAU,CAAA,GACd,OAAO,MAAA,CAAO,SAAA,KAAc,QAAA,GAC1B,MAAA,CAAO,YAAY,GAAA,GACnB,KAAA;AACR,MAAA,OAAO,IAAA,GACH,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,OAAA,EAAQ,GAC3B,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,MAAA,EAAQ,aAAa,MAAA,EAAU;AAAA,IACxD;AAAA,IACA,KAAK,SAAA;AACH,MAAA,OAAO;AAAA,QACL,GAAG,MAAA;AAAA,QACH,IAAA,EAAM,QAAA;AAAA,QACN,OAAA,EAAS,IAAA;AAAA,QACT,GAAA,EAAK,UAAA,CAAW,MAAA,CAAO,OAAO,CAAA;AAAA,QAC9B,GAAA,EAAK,UAAA,CAAW,MAAA,CAAO,OAAO;AAAA,OAChC;AAAA,IACF,KAAK,QAAA;AACH,MAAA,OAAO;AAAA,QACL,GAAG,MAAA;AAAA,QACH,IAAA,EAAM,QAAA;AAAA,QACN,OAAA,EAAS,KAAA;AAAA,QACT,GAAA,EAAK,UAAA,CAAW,MAAA,CAAO,OAAO,CAAA;AAAA,QAC9B,GAAA,EAAK,UAAA,CAAW,MAAA,CAAO,OAAO;AAAA,OAChC;AAAA,IACF,KAAK,SAAA;AACH,MAAA,OAAO,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,SAAA,EAAU;AAAA,IACtC,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,KAAA,GAAS,MAAA,CAAO,UAAA,IAA6C,EAAC;AACpE,MAAA,MAAM,GAAA,GAAM,IAAI,GAAA,CAAI,KAAA,CAAM,OAAA,CAAQ,MAAA,CAAO,QAAQ,CAAA,GAAK,MAAA,CAAO,QAAA,GAAwB,EAAE,CAAA;AACvF,MAAA,MAAM,MAAA,GAAS,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,CAAE,GAAA;AAAA,QAAI,CAAC,CAAC,SAAA,EAAW,WAAW,CAAA,KAC/D,SAAA,CAAU,SAAA,EAAW,MAAA,EAAW,WAAA,EAAa,GAAA,CAAI,GAAA,CAAI,SAAS,CAAA,EAAG;AAAA,UAC/D,GAAG,GAAA;AAAA,UACH,KAAA,EAAO,IAAI,KAAA,GAAQ;AAAA,SACpB;AAAA,OACH;AACA,MAAA,OAAO,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,UAAU,MAAA,EAAO;AAAA,IAC7C;AAAA,IACA;AAGE,MAAA,IAAI,IAAA,IAAQ,mBAAA,CAAoB,GAAA,CAAI,IAAI,CAAA;AACtC,QAAA,OAAO,GAAA,CAAI,KAAA,KAAU,CAAA,GAAI,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,OAAA,EAAQ,GAAI,EAAE,GAAG,MAAA,EAAQ,MAAM,MAAA,EAAO;AACpF,MAAA,OAAO,EAAE,GAAG,MAAA,EAAQ,IAAA,EAAM,SAAA,EAAU;AAAA;AAE1C;AAEA,SAAS,WAAW,CAAA,EAAgC;AAClD,EAAA,OAAO,OAAO,CAAA,KAAM,QAAA,GAAW,CAAA,GAAI,MAAA;AACrC;AAMO,SAAS,eAAe,MAAA,EAAuD;AACpF,EAAA,OAAO,MAAA,CAAO,QAAQ,MAAM,CAAA,CAAE,IAAI,CAAC,CAAC,IAAA,EAAM,KAAK,CAAA,KAAM;AACnD,IAAA,MAAM,OAAmC,EAAC;AAC1C,IAAA,iBAAA,CAAkB,MAAM,WAAA,EAAa,IAAA,EAAM,EAAE,cAAA,EAAgB,MAAM,CAAA;AAEnE,IAAA,MAAM,KAAA,GAAQ,SAAA,CAAU,IAAA,EAAM,KAAA,CAAM,WAAA,EAAa,MAAM,WAAA,EAAa,CAAC,eAAA,CAAgB,KAAK,CAAA,EAAG;AAAA,MAC3F,IAAA;AAAA,MACA,KAAA,EAAO;AAAA,KACR,CAAA;AAGD,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,MAAA,EAAQ,iBAAA,CAAkB,KAAK,CAAA,EAAE;AAAA,EACtD,CAAC,CAAA;AACH","file":"chunk-VMLXO5JS.js","sourcesContent":["/**\n * The ONE derivation function: `PipeInputContract` map → `RunField[]`.\n *\n * Everything heuristic stays module-private behind `buildRunFields`: the\n * native-concept taxonomy, `isDocumentObject`, the depth-based prose/label\n * rule, the `accept` strings, list splitting. Nothing here is exported except\n * the function itself - so the M1 milestone can swap the source of the\n * descriptor (server-derived) without touching consumers.\n */\n\nimport { inputMustBeFilled, isOptionalInput, type PipeInputContract } from './contracts';\nimport type { RunField, RunFieldCommon } from './descriptor';\nimport {\n  FIELD_DOCUMENT_CONCEPTS,\n  FIELD_TEXT_CONCEPTS,\n  HTML_CONCEPTS,\n  IMAGE_CONCEPTS,\n  NUMBER_CONCEPTS,\n  splitListConcept,\n  TEXT_WRAPPER_CONCEPTS,\n  YES_NO_CONCEPTS,\n} from './native-concepts';\nimport {\n  collapseNullable,\n  collectSchemaDefs,\n  derefSchema,\n  schemaTypeOf,\n  type JsonSchema,\n} from './schema-utils';\n\n// Native concepts arrive as their pydantic wrapper schema (e.g. native.Text is\n// `TextContent {text}`, native.Document is `DocumentContent {url,…}`), NOT a bare\n// primitive - so we map them by concept_ref, before the generic schema-type\n// dispatch, or they'd all render as nested objects. The taxonomy lives in\n// `native-concepts.ts`, which also records where this mapper's view drifts from\n// the wire format's.\n\n/**\n * A url-bearing object renders as a document field. This is `Boolean(\n * schema.properties?.url)` and nothing more: the historical description check\n * (\"storage url\" / \"document url\") was followed by `|| 'url' in props`, which\n * made it unreachable. Stated honestly as the heuristic it is - M1 replaces it\n * with the server-derived descriptor; narrowing it to the description match is\n * a recorded M1 option, not a K1 change.\n */\nfunction isDocumentObject(schema: JsonSchema): boolean {\n  const props = schema.properties as Record<string, JsonSchema> | undefined;\n  return Boolean(props?.url);\n}\n\ninterface MapCtx {\n  defs: Record<string, JsonSchema>;\n  depth: number;\n}\n\n/**\n * The single property a pydantic scalar content model holds its value in -\n * `TextContent {text}`, `NumberContent {number}`, `YesNoContent {yes_no}`.\n *\n * A native scalar's value does NOT sit at the top of its declared schema, and\n * this is where that is discovered: from the CONTRACT, not from a hand-kept\n * list of which concepts wrap. Keeping such a list is what broke `native.Number`\n * - the render taxonomy knew the concept, the wrapper taxonomy did not, so a\n * number reached the gate bare and failed against `NumberContent`. Reading the\n * declared shape covers a concept nobody remembered to add.\n *\n * A wrapper is a schema declaring EXACTLY ONE property. A multi-property content\n * model (`DateContent {date, time}`, `HtmlContent {inner_html, css_class}`) is\n * not one and deliberately answers `undefined`; so does a contract that declares\n * no properties at all. The returned `schema` is the WRAPPED property's, which\n * is where its constraints live.\n */\nfunction scalarWrapper(\n  schema: JsonSchema,\n  ctx: MapCtx,\n): { key: string; schema: JsonSchema } | undefined {\n  const props = schema.properties as Record<string, JsonSchema> | undefined;\n  const entries = props ? Object.entries(props) : [];\n  const only = entries.length === 1 ? entries[0] : undefined;\n  if (!only) return undefined;\n  const [key, propSchema] = only;\n  return { key, schema: collapseNullable(derefSchema(propSchema ?? {}, ctx.defs)) };\n}\n\n/** Build the recursive RunField for a single resolved schema node. */\nfunction mapSchema(\n  name: string,\n  conceptRef: string | undefined,\n  rawSchema: JsonSchema,\n  required: boolean,\n  ctx: MapCtx,\n): RunField {\n  const schema = collapseNullable(derefSchema(rawSchema, ctx.defs));\n  // The LABEL is always the stuff name (the variable key) - that's what\n  // identifies the input in the method. We deliberately do NOT use\n  // `schema.title`, which is the pydantic model name (TextContent, ImageContent,\n  // DocumentContent…) and would mask the stuff name. The concept pill carries\n  // the type instead. `title` stays undefined here so FieldShell falls back to\n  // `name`; list items still pass `title: ''` to suppress the per-row label.\n  const common: RunFieldCommon = {\n    name,\n    conceptRef,\n    description: typeof schema.description === 'string' ? schema.description : undefined,\n    required,\n  };\n\n  const { base, isList } = splitListConcept(conceptRef);\n\n  // List concepts (native.Text[], demo.Invoice[]) and array schemas.\n  if (isList || schemaTypeOf(schema) === 'array') {\n    const itemsSchema = (schema.items as JsonSchema) ?? {};\n    const item = mapSchema(name, base, itemsSchema, true, { ...ctx, depth: ctx.depth + 1 });\n    // A declared count (`Concept[N]`) reaches the descriptor from the schema\n    // keywords ajv itself reads - see `ListRunField.itemCount`. BOTH bounds\n    // travel, because they are two facts: a `[N]` slot states them equal, but\n    // this mapper also walks nested arrays, whose model may have stated only\n    // one. Carrying a single number forced readiness and the control to read it\n    // as a minimum and a maximum respectively.\n    const itemCount = numOrUndef(schema.minItems);\n    const maxItemCount = numOrUndef(schema.maxItems);\n    return {\n      ...common,\n      kind: 'list',\n      item,\n      ...(itemCount === undefined ? {} : { itemCount }),\n      ...(maxItemCount === undefined ? {} : { maxItemCount }),\n    };\n  }\n\n  // Enum (a custom concept may refine a native with a fixed value set).\n  if (Array.isArray(schema.enum)) {\n    return { ...common, kind: 'enum', options: schema.enum.map(String) };\n  }\n\n  // Native concepts: map by concept_ref regardless of the wrapper schema shape.\n  if (base) {\n    if (FIELD_DOCUMENT_CONCEPTS.has(base))\n      return { ...common, kind: 'document', accept: 'PDF, DOCX, TXT' };\n    if (IMAGE_CONCEPTS.has(base)) return { ...common, kind: 'image', accept: 'PNG, JPG, WEBP' };\n\n    // The three native scalars render as a bare control but travel inside the\n    // content model their concept declares. `contentKey` carries that property\n    // name to the value bridge, which is how the control can hold `2` while the\n    // wire carries `{number: 2}`.\n    const wrapper = scalarWrapper(schema, ctx);\n\n    if (FIELD_TEXT_CONCEPTS.has(base) || HTML_CONCEPTS.has(base)) {\n      // `Date` declares two properties, so no wrapper is found for it and the\n      // `{text}` fallback answers instead - the recorded drift, kept until the\n      // derivation swap (see `native-concepts.ts`).\n      const contentKey = wrapper?.key ?? (TEXT_WRAPPER_CONCEPTS.has(base) ? 'text' : undefined);\n      return ctx.depth === 0\n        ? { ...common, contentKey, kind: 'prose' }\n        : { ...common, contentKey, kind: 'text' };\n    }\n    if (NUMBER_CONCEPTS.has(base))\n      return {\n        ...common,\n        contentKey: wrapper?.key,\n        kind: 'number',\n        // `NumberContent.number` is `int | float`, an unresolvable union, so the\n        // control stays a float input. Constraints are read off the WRAPPED\n        // property - the wrapper object never carries them, which is why the\n        // outer schema always answered `undefined`.\n        integer: false,\n        min: numOrUndef(wrapper?.schema.minimum ?? schema.minimum),\n        max: numOrUndef(wrapper?.schema.maximum ?? schema.maximum),\n      };\n    if (YES_NO_CONCEPTS.has(base)) return { ...common, contentKey: wrapper?.key, kind: 'boolean' };\n  }\n\n  // A custom concept whose schema looks like DocumentContent (refines Document).\n  if (isDocumentObject(schema)) {\n    return { ...common, kind: 'document', accept: 'PDF, DOCX, TXT' };\n  }\n\n  const type = schemaTypeOf(schema);\n  switch (type) {\n    case 'string': {\n      if (base && (FIELD_DOCUMENT_CONCEPTS.has(base) || base === 'native.Document'))\n        return { ...common, kind: 'document', accept: 'PDF, DOCX, TXT' };\n      // A `date` structure field compiles to a `format: date`/`date-time`\n      // string. Render it as a real date picker so the user picks a day - no\n      // hand-typed timestamps - and stores a value the API accepts.\n      if (schema.format === 'date' || schema.format === 'date-time')\n        return { ...common, kind: 'date', datetime: schema.format === 'date-time' };\n      // A top-level Text input is usually the main prompt (roomy textarea); the\n      // same concept nested in a concept/list is usually a short attribute\n      // (name, label) and reads better as a single line.\n      const long =\n        base && FIELD_TEXT_CONCEPTS.has(base)\n          ? ctx.depth === 0\n          : typeof schema.maxLength === 'number'\n            ? schema.maxLength > 120\n            : false;\n      return long\n        ? { ...common, kind: 'prose' }\n        : { ...common, kind: 'text', placeholder: undefined };\n    }\n    case 'integer':\n      return {\n        ...common,\n        kind: 'number',\n        integer: true,\n        min: numOrUndef(schema.minimum),\n        max: numOrUndef(schema.maximum),\n      };\n    case 'number':\n      return {\n        ...common,\n        kind: 'number',\n        integer: false,\n        min: numOrUndef(schema.minimum),\n        max: numOrUndef(schema.maximum),\n      };\n    case 'boolean':\n      return { ...common, kind: 'boolean' };\n    case 'object': {\n      const props = (schema.properties as Record<string, JsonSchema>) ?? {};\n      const req = new Set(Array.isArray(schema.required) ? (schema.required as string[]) : []);\n      const fields = Object.entries(props).map(([fieldName, fieldSchema]) =>\n        mapSchema(fieldName, undefined, fieldSchema, req.has(fieldName), {\n          ...ctx,\n          depth: ctx.depth + 1,\n        }),\n      );\n      return { ...common, kind: 'object', fields };\n    }\n    default:\n      // A bare `native.Text` concept may arrive as `{type:'string'}` (handled\n      // above) but a custom concept with no resolvable shape lands here.\n      if (base && FIELD_TEXT_CONCEPTS.has(base))\n        return ctx.depth === 0 ? { ...common, kind: 'prose' } : { ...common, kind: 'text' };\n      return { ...common, kind: 'unknown' };\n  }\n}\n\nfunction numOrUndef(v: unknown): number | undefined {\n  return typeof v === 'number' ? v : undefined;\n}\n\n/**\n * Convert the API's per-input contracts into the runner's field descriptors.\n * The map's insertion order is preserved (required-first is the caller's job).\n */\nexport function buildRunFields(inputs: Record<string, PipeInputContract>): RunField[] {\n  return Object.entries(inputs).map(([name, input]) => {\n    const defs: Record<string, JsonSchema> = {};\n    collectSchemaDefs(input.json_schema, defs, { traverseArrays: true });\n    // A top-level input is required unless the method declared it optional (`?`).\n    const field = mapSchema(name, input.concept_ref, input.json_schema, !isOptionalInput(input), {\n      defs,\n      depth: 0,\n    });\n    // Whether Run gates on it is a SEPARATE question, and it is answered by the\n    // contract, not by the shape we mapped it to - see `mustBeFilled`.\n    return { ...field, gating: inputMustBeFilled(input) };\n  });\n}\n"]}

package/dist/chunk-WXBSM2CE.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/core/values.ts"],"names":[],"mappings":";;;;;;;AA6CA,SAAS,WAAA,CAAY,OAAiB,KAAA,EAAyB;AAC7D,EAAA,OAAO,KAAA,CAAM,eAAe,MAAA,GAAY,KAAA,GAAQ,EAAE,CAAC,KAAA,CAAM,UAAU,GAAG,KAAA,EAAM;AAC9E;AAOA,SAAS,aAAA,CAAc,OAAiB,KAAA,EAAyB;AAC/D,EAAA,MAAM,MAAM,KAAA,CAAM,UAAA;AAClB,EAAA,IAAI,GAAA,KAAQ,UAAa,CAAC,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA;AACjF,IAAA,OAAO,KAAA;AACT,EAAA,OAAO,OAAA,CAAQ,OAAkC,GAAG,CAAA;AACtD;AAGA,IAAM,gBAAA,GAAmB,CAAA;AAgBzB,SAAS,cAAA,CAAe,KAAA,EAAgB,KAAA,GAAQ,CAAA,EAAuB;AACrE,EAAA,IAAI,KAAA,IAAS,MAAM,OAAO,MAAA;AAC1B,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,KAAA;AACtC,EAAA,IAAI,OAAO,UAAU,QAAA,IAAY,OAAO,UAAU,SAAA,EAAW,OAAO,OAAO,KAAK,CAAA;AAChF,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,IAAS,kBAAkB,OAAO,MAAA;AACnE,EAAA,MAAM,QAAA,GAAW,KAAA;AACjB,EAAA,IAAI,UAAU,QAAA,EAAU,OAAO,eAAe,QAAA,CAAS,IAAA,EAAM,QAAQ,CAAC,CAAA;AACtE,EAAA,IAAI,aAAa,QAAA,EAAU,OAAO,eAAe,QAAA,CAAS,OAAA,EAAS,QAAQ,CAAC,CAAA;AAC5E,EAAA,OAAO,MAAA;AACT;AAGA,SAAS,QAAA,CAAS,OAAiB,KAAA,EAAyB;AAC1D,EAAA,QAAQ,MAAM,IAAA;AAAM,IAClB,KAAK,MAAA;AAAA,IACL,KAAK,OAAA;AACH,MAAA,OAAO,eAAe,KAAK,CAAA;AAAA,IAC7B,KAAK,QAAA,EAAU;AAIb,MAAA,MAAM,GAAA,GAAM,aAAA,CAAc,KAAA,EAAO,KAAK,CAAA;AACtC,MAAA,IAAI,OAAO,QAAQ,QAAA,EAAU,OAAO,OAAO,QAAA,CAAS,GAAG,IAAI,GAAA,GAAM,MAAA;AACjE,MAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,GAAA,CAAI,IAAA,OAAW,EAAA,EAAI;AAChD,QAAA,MAAM,MAAA,GAAS,OAAO,GAAG,CAAA;AACzB,QAAA,OAAO,MAAA,CAAO,QAAA,CAAS,MAAM,CAAA,GAAI,MAAA,GAAS,MAAA;AAAA,MAC5C;AACA,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,IACA,KAAK,SAAA,EAAW;AAId,MAAA,MAAM,GAAA,GAAM,aAAA,CAAc,KAAA,EAAO,KAAK,CAAA;AACtC,MAAA,OAAO,OAAO,GAAA,KAAQ,SAAA,GAAY,GAAA,GAAM,MAAA;AAAA,IAC1C;AAAA,IACA,KAAK,SAAA;AAIH,MAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,KAAA;AACtC,MAAA,IAAI,KAAA,IAAS,MAAM,OAAO,MAAA;AAC1B,MAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,QAAA,IAAI;AACF,UAAA,OAAO,IAAA,CAAK,SAAA,CAAU,KAAA,EAAO,IAAA,EAAM,CAAC,CAAA;AAAA,QACtC,CAAA,CAAA,MAAQ;AACN,UAAA,OAAO,MAAA;AAAA,QACT;AAAA,MACF;AACA,MAAA,OAAO,OAAO,KAAK,CAAA;AAAA,IACrB,KAAK,UAAA;AAAA,IACL,KAAK,OAAA,EAAS;AACZ,MAAA,IAAI,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,EAAU;AACtC,QAAA,MAAM,CAAA,GAAI,KAAA;AACV,QAAA,OAAO,CAAA,CAAE,GAAA,GACL,EAAE,GAAA,EAAK,MAAA,CAAO,CAAA,CAAE,GAAG,CAAA,EAAG,QAAA,EAAU,CAAA,CAAE,QAAA,EAA+B,GACjE,MAAA;AAAA,MACN;AACA,MAAA,OAAO,OAAO,KAAA,KAAU,QAAA,IAAY,QAAQ,EAAE,GAAA,EAAK,OAAM,GAAI,MAAA;AAAA,IAC/D;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,MAAO,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,GAAW,QAAQ,EAAC;AAC3D,MAAA,MAAM,MAAY,EAAC;AACnB,MAAA,KAAA,MAAW,KAAA,IAAS,KAAA,CAAM,MAAA,EAAQ,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,GAAI,QAAA,CAAS,KAAA,EAAO,OAAA,CAAQ,GAAA,EAAK,KAAA,CAAM,IAAI,CAAC,CAAA;AAC5F,MAAA,OAAO,GAAA;AAAA,IACT;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,MAAM,MAAM,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAI,QAAQ,EAAC;AAC5C,MAAA,OAAO,GAAA,CAAI,IAAI,CAAC,IAAA,KAAS,SAAS,KAAA,CAAM,IAAA,EAAM,IAAI,CAAC,CAAA;AAAA,IACrD;AAAA,IACA;AACE,MAAA,OAAO,KAAA;AAAA;AAEb;AAUA,SAAS,MAAA,CAAO,KAAA,EAAiB,KAAA,EAAgB,aAAA,GAAgB,IAAA,EAAe;AAC9E,EAAA,QAAQ,MAAM,IAAA;AAAM,IAClB,KAAK,MAAA;AAAA,IACL,KAAK,OAAA;AACH,MAAA,OAAO,YAAY,KAAA,EAAO,OAAO,KAAA,KAAU,QAAA,GAAW,QAAQ,EAAE,CAAA;AAAA,IAClE,KAAK,QAAA;AAKH,MAAA,OAAO,OAAO,KAAA,KAAU,QAAA,IAAY,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,GACrD,WAAA,CAAY,KAAA,EAAO,KAAK,CAAA,GACxB,MAAA;AAAA,IACN,KAAK,SAAA;AAGH,MAAA,OAAO,OAAO,KAAA,KAAU,SAAA,GAAY,WAAA,CAAY,KAAA,EAAO,KAAK,CAAA,GAAI,MAAA;AAAA,IAClE,KAAK,SAAA;AACH,MAAA,OAAO,OAAO,KAAA,KAAU,QAAA,GAAW,KAAA,GAAQ,EAAA;AAAA,IAC7C,KAAK,UAAA;AAAA,IACL,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,MAAM,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,GAAY,MAA4B,GAAA,GAAM,KAAA;AACpF,MAAA,MAAM,WACJ,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,GAAY,MAAiC,QAAA,GAAW,MAAA;AACpF,MAAA,OAAO,EAAE,GAAA,EAAK,GAAA,GAAM,MAAA,CAAO,GAAG,CAAA,GAAI,EAAA,EAAI,GAAI,QAAA,GAAW,EAAE,QAAA,EAAS,GAAI,EAAC,EAAG;AAAA,IAC1E;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,MAAO,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,GAAW,QAAQ,EAAC;AAC3D,MAAA,MAAM,MAAY,EAAC;AACnB,MAAA,KAAA,MAAW,KAAA,IAAS,KAAA,CAAM,MAAA,EAAQ,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,GAAI,MAAA,CAAO,KAAA,EAAO,OAAA,CAAQ,GAAA,EAAK,KAAA,CAAM,IAAI,CAAC,CAAA;AAkB1F,MAAA,OAAO,aAAA,IAAiB,CAAC,QAAA,CAAS,GAAG,IAAI,MAAA,GAAY,GAAA;AAAA,IACvD;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,MAAM,MAAM,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAI,QAAQ,EAAC;AAO5C,MAAA,OAAO,GAAA,CAAI,IAAI,CAAC,IAAA,KAAS,OAAO,KAAA,CAAM,IAAA,EAAM,IAAA,EAAM,KAAK,CAAC,CAAA;AAAA,IAC1D;AAAA,IACA;AACE,MAAA,OAAO,KAAA;AAAA;AAEb;AAKO,SAAS,kBAAA,CACd,SAAA,EACA,MAAA,EACA,YAAA,EACM;AACN,EAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,SAAA,IAAa,IAAI,YAAY,CAAA;AAC3D,EAAA,MAAM,MAAY,EAAC;AACnB,EAAA,KAAA,MAAW,KAAA,IAAS,MAAA,EAAQ,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,GAAI,QAAA,CAAS,KAAA,EAAO,OAAA,CAAQ,IAAA,EAAM,KAAA,CAAM,IAAI,CAAC,CAAA;AACvF,EAAA,OAAO,GAAA;AACT;AAUO,SAAS,qBAAA,CAAsB,QAAc,MAAA,EAA0B;AAC5E,EAAA,MAAM,OAAa,EAAC;AACpB,EAAA,KAAA,MAAW,KAAA,IAAS,MAAA,EAAQ,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA,GAAI,MAAA,CAAO,KAAA,EAAO,OAAA,CAAQ,MAAA,EAAQ,KAAA,CAAM,IAAI,CAAC,CAAA;AACxF,EAAA,OAAO,IAAA;AACT;AAGO,SAAS,2BAAA,CACd,MAAA,EACA,MAAA,EACA,YAAA,EACM;AACN,EAAA,OAAO,gBAAA,CAAiB,qBAAA,CAAsB,MAAA,EAAQ,MAAM,GAAG,YAAY,CAAA;AAC7E;AAoBO,SAAS,sBAAA,CACd,MAAA,EACA,MAAA,EACA,YAAA,EACyB;AACzB,EAAA,MAAM,MAA+B,EAAC;AACtC,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,YAAA,EAAc,KAAA,CAAM,IAAI,CAAA;AAC/C,IAAA,IAAI,CAAC,MAAA,EAAQ;AACb,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,MAAA,EAAQ,KAAA,CAAM,IAAI,CAAA;AACxC,IAAA,IAAI,gBAAgB,MAAM,CAAA,IAAK,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG;AACjD,IAAA,IAAI,cAAc,MAAM,CAAA,IAAK,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG;AAC7C,MAAA,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,GAAI,EAAC;AACnB,MAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,GAAI,EAAE,OAAA,EAAS,MAAA,CAAO,WAAA,EAAa,OAAA,EAAS,MAAA,CAAO,KAAA,EAAO,KAAK,CAAA,EAAE;AAAA,EACjF;AACA,EAAA,OAAO,GAAA;AACT;AAyBA,SAAS,qBAAqB,KAAA,EAAsD;AAClF,EAAA,OACE,CAAC,CAAC,KAAA,IACF,OAAO,UAAU,QAAA,IACjB,gBAAA,IAAoB,KAAA,IACpB,CAAC,CAAE,KAAA,CAAkD,cAAA,IACrD,OAAQ,KAAA,CAAiD,eAAe,IAAA,KAAS,QAAA;AAErF;AAGA,SAAS,gBAAgB,IAAA,EAAmC;AAC1D,EAAA,IAAI,CAAC,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,MAAA;AAC9C,EAAA,MAAM,MAAO,IAAA,CAAuD,OAAA;AACpE,EAAA,IAAI,GAAA,IAAO,OAAO,GAAA,KAAQ,QAAA;AACxB,IAAA,OAAA,CACI,GAAA,CAAkC,YAAA,IAAiB,GAAA,CAA0B,IAAA,KAC/E,MAAA;AAEJ,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,GAAA;AACpC,EAAA,OAAQ,KAAmC,YAAA,IAAgB,MAAA;AAC7D;AASO,SAAS,qBAAA,CACd,YACA,SAAA,EAC4D;AAC5D,EAAA,IAAI,CAAC,oBAAA,CAAqB,UAAU,CAAA,EAAG,OAAO,IAAA;AAC9C,EAAA,MAAM,KAAK,UAAA,CAAW,cAAA;AAItB,EAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,EAAA,CAAG,IAAI,CAAA,CAAE,MAAA,CAAO,CAAC,CAAC,GAAG,CAAA,KAAM,CAAC,SAAA,CAAU,QAAA,CAAS,GAAG,CAAC,CAAA;AAClF,EAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAEjC,EAAA,MAAM,OAAA,GAAU,CAAC,CAAC,GAAA,EAAK,IAAI,CAAA,MAAuC;AAAA,IAChE,GAAA;AAAA,IACA,UAAA,EAAY,gBAAgB,IAAI,CAAA;AAAA,IAChC,KAAA,EAAQ,MAAgC,OAAA,IAAW;AAAA,GACrD,CAAA;AAGA,EAAA,MAAM,OAAA,GAAU,EAAA,CAAG,OAAA,GAAU,YAAY,CAAA;AACzC,EAAA,MAAM,SAAA,GACJ,WAAW,MAAA,CAAO,SAAA,CAAU,eAAe,IAAA,CAAK,EAAA,CAAG,MAAM,OAAO,CAAA,GAC5D,CAAC,OAAA,EAAS,EAAA,CAAG,KAAK,OAAO,CAAC,IAC1B,OAAA,CAAQ,OAAA,CAAQ,SAAS,CAAC,CAAA;AAChC,EAAA,MAAM,aAAA,GAAgB,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAC,GAAG,CAAA,KAAM,GAAA,KAAQ,SAAA,CAAU,CAAC,CAAC,CAAA,CAAE,IAAI,OAAO,CAAA;AAEjF,EAAA,OAAO,EAAE,IAAA,EAAM,OAAA,CAAQ,SAAS,GAAG,aAAA,EAAc;AACnD;AAUO,SAAS,0BAAA,CACd,eACA,YAAA,EACa;AACb,EAAA,MAAM,OAAQ,aAAA,EAAyE,IAAA;AACvF,EAAA,IAAI,CAAC,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,IAAA;AAC9C,EAAA,MAAM,OAAa,EAAC;AACpB,EAAA,IAAI,KAAA,GAAQ,KAAA;AACZ,EAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,YAAY,CAAA,EAAG;AAC3C,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,EAAM,GAAG,CAAA;AAC/B,IAAA,IAAI,KAAA,IAAS,OAAO,KAAA,KAAU,QAAA,IAAY,aAAa,KAAA,EAAO;AAC5D,MAAA,IAAA,CAAK,GAAG,IAAK,KAAA,CAA+B,OAAA;AAC5C,MAAA,KAAA,GAAQ,IAAA;AAAA,IACV;AAAA,EACF;AACA,EAAA,IAAI,CAAC,OAAO,OAAO,IAAA;AACnB,EAAA,OAAO,gBAAA,CAAiB,MAAM,YAAY,CAAA;AAC5C;AAGO,SAAS,kBAAkB,QAAA,EAAkD;AAClF,EAAA,OAAO,UAAU,MAAA,GAAS,cAAA,CAAe,QAAA,CAAS,MAAM,IAAI,EAAC;AAC/D;AAMO,SAAS,cAAA,CAAe,IAAA,EAAY,IAAA,EAAgB,KAAA,EAAsB;AAC/E,EAAA,MAAM,IAAA,GAAO,KAAK,CAAC,CAAA;AACnB,EAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAC/B,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AACzB,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,GAAG,IAAA,EAAM,CAAC,IAAI,GAAG,KAAA,EAAM;AAEvD,EAAA,MAAM,OAAA,GAAU,KAAK,CAAC,CAAA;AACtB,EAAA,MAAM,KAAA,GAAQ,KAAK,IAAI,CAAA;AACvB,EAAA,IAAI,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA,EAAG;AACzB,IAAA,MAAM,GAAA,GAAM,MAAM,OAAA,CAAQ,KAAK,IAAI,KAAA,CAAM,KAAA,KAAU,EAAC;AACpD,IAAA,MAAM,GAAA,GAAM,OAAO,OAAO,CAAA;AAC1B,IAAA,GAAA,CAAI,GAAG,CAAA,GACL,IAAA,CAAK,MAAA,KAAW,CAAA,GAAI,QAAQ,cAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,IAAc,EAAC,EAAG,IAAA,CAAK,KAAA,CAAM,CAAC,GAAG,KAAK,CAAA;AAC3F,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,CAAC,IAAI,GAAG,GAAA,EAAI;AAAA,EAChC;AACA,EAAA,OAAO,EAAE,GAAG,IAAA,EAAM,CAAC,IAAI,GAAG,cAAA,CAAgB,KAAA,IAAkB,EAAC,EAAG,IAAA,EAAM,KAAK,CAAA,EAAE;AAC/E","file":"chunk-WXBSM2CE.js","sourcesContent":["/**\n * Bridges the `MethodRunner`'s field values to the rest of the host.\n *\n * The method-store keeps inputs in the *simplified* format and runs send the\n * *full* RJSF form shape - both already handled by `inflate/deflateAllInputs`.\n * The only gap is that a few field controls use a friendlier value than RJSF: a\n * scalar is the bare scalar where the full shape is the content model its\n * concept declares (`{ text }`, `{ number }`, `{ yes_no }`), and a file is\n * `{ url, filename }`. `fromRjsf`/`toRjsf` translate just those, so store\n * reads/writes and run payloads stay byte-for-byte compatible with the proven\n * playground path.\n *\n * Which property a scalar wraps into is NOT decided here - it arrives on the\n * descriptor as `contentKey`, derived from the contract by `buildRunFields`.\n *\n * Pure module - no React, unit-tested.\n */\nimport type { RunField } from './descriptor';\nimport { buildRunFields } from './derive';\nimport { ownProp } from './own-property';\nimport { isFilled } from './readiness';\nimport { isOptionalInput, isPluralInput } from './contracts';\nimport { deflateAllInputs, inflateAllInputs } from './wire-format';\nimport type { PipeIOContract, PipeInputContract } from './contracts';\n\ntype Dict = Record<string, unknown>;\ntype InputSchemas = Record<string, PipeInputContract>;\n\n// ─── RJSF full shape  ↔  RunField value ──────────────────────────────────────\n\n/**\n * Put a scalar back inside the content model its concept declares:\n * `\"hi\"` → `{ text: \"hi\" }`, `2` → `{ number: 2 }`, `false` → `{ yes_no: false }`.\n *\n * The property name comes from the DESCRIPTOR (`contentKey`, stamped by\n * `buildRunFields` - the only reader of JSON Schema). This module holds no\n * taxonomy of its own, which is the point: the version that did held a list of\n * concepts that wrap, `native.Number` was missing from it, and every run\n * carrying a number was rejected by the gate against `NumberContent`.\n *\n * A field with no `contentKey` keeps its value plain. That is not an oversight\n * either - a child property of a structured concept, or a custom concept whose\n * schema is a bare string, IS its value, and wrapping it double-nests it\n * (`{ text: { text } }`) into a payload no schema accepts.\n */\nfunction wrapContent(field: RunField, value: unknown): unknown {\n  return field.contentKey === undefined ? value : { [field.contentKey]: value };\n}\n\n/**\n * The inverse. A value that is already bare passes through untouched: persisted\n * `inputData` predates the number and yes/no wrappers, and an inputs.json\n * written by hand or by an agent says `2`, not `{number: 2}`.\n */\nfunction unwrapContent(field: RunField, value: unknown): unknown {\n  const key = field.contentKey;\n  if (key === undefined || !value || typeof value !== 'object' || Array.isArray(value))\n    return value;\n  return ownProp(value as Record<string, unknown>, key);\n}\n\n/** How deep a nested `{ text: … }` / `{ content: … }` chain we bother unwrapping. */\nconst MAX_UNWRAP_DEPTH = 8;\n\n/**\n * Pull a plain string out of whatever the store hands a text field.\n *\n * Persisted `inputData` carries historical corruptions - a double-wrapped\n * `{ text: { text } }`, a `{ concept, content }` envelope that was never\n * deflated - and the old fallback ran `String()` over them, which renders the\n * literal `\"[object Object]\"` into the textarea. That is worse than showing\n * nothing: it looks exactly like content the user typed, and one keystroke\n * later it is content the user typed. So unwrap the envelopes we know, and give\n * up with `undefined` (an empty field) rather than displaying garbage.\n *\n * Genuine primitives still stringify - a number or a boolean in a text slot is\n * a value, not a wrapper.\n */\nfunction textFromStored(value: unknown, depth = 0): string | undefined {\n  if (value == null) return undefined;\n  if (typeof value === 'string') return value;\n  if (typeof value === 'number' || typeof value === 'boolean') return String(value);\n  if (typeof value !== 'object' || depth >= MAX_UNWRAP_DEPTH) return undefined;\n  const envelope = value as { text?: unknown; content?: unknown };\n  if ('text' in envelope) return textFromStored(envelope.text, depth + 1);\n  if ('content' in envelope) return textFromStored(envelope.content, depth + 1);\n  return undefined;\n}\n\n/** RJSF full form value → the runner's field value. */\nfunction fromRjsf(field: RunField, value: unknown): unknown {\n  switch (field.kind) {\n    case 'text':\n    case 'prose':\n      return textFromStored(value);\n    case 'number': {\n      // The control holds `number | undefined`. A numeric STRING is tolerated\n      // because that is what a hand-written inputs.json tends to carry; anything\n      // else empties the field rather than feeding NaN to a number input.\n      const raw = unwrapContent(field, value);\n      if (typeof raw === 'number') return Number.isFinite(raw) ? raw : undefined;\n      if (typeof raw === 'string' && raw.trim() !== '') {\n        const parsed = Number(raw);\n        return Number.isFinite(parsed) ? parsed : undefined;\n      }\n      return undefined;\n    }\n    case 'boolean': {\n      // Strictly a real boolean, deliberately: pipelex declares `YesNoContent.\n      // yes_no` with `strict=True` precisely to refuse \"yes\"/1/\"true\", and\n      // coercing here would smuggle back in what the runtime closed off.\n      const raw = unwrapContent(field, value);\n      return typeof raw === 'boolean' ? raw : undefined;\n    }\n    case 'unknown':\n      // The escape hatch is a raw-JSON textarea, so a structured value belongs\n      // there as JSON - `String(value)` would have shown \"[object Object]\" and\n      // thrown the actual value away.\n      if (typeof value === 'string') return value;\n      if (value == null) return undefined;\n      if (typeof value === 'object') {\n        try {\n          return JSON.stringify(value, null, 2);\n        } catch {\n          return undefined;\n        }\n      }\n      return String(value);\n    case 'document':\n    case 'image': {\n      if (value && typeof value === 'object') {\n        const o = value as { url?: unknown; filename?: unknown };\n        return o.url\n          ? { url: String(o.url), filename: o.filename as string | undefined }\n          : undefined;\n      }\n      return typeof value === 'string' && value ? { url: value } : undefined;\n    }\n    case 'object': {\n      const obj = (value && typeof value === 'object' ? value : {}) as Dict;\n      const out: Dict = {};\n      for (const child of field.fields) out[child.name] = fromRjsf(child, ownProp(obj, child.name));\n      return out;\n    }\n    case 'list': {\n      const arr = Array.isArray(value) ? value : [];\n      return arr.map((item) => fromRjsf(field.item, item));\n    }\n    default:\n      return value;\n  }\n}\n\n/**\n * The runner's field value → RJSF full form value (what runs/store expect).\n *\n * `collapseEmpty` is what a SINGULAR slot does and a LIST ITEM must not: an\n * untouched structure in a singular slot is absent, but an item exists only\n * because the user added it, so adding IS the touch. Only the structure case\n * reads the flag.\n */\nfunction toRjsf(field: RunField, value: unknown, collapseEmpty = true): unknown {\n  switch (field.kind) {\n    case 'text':\n    case 'prose':\n      return wrapContent(field, typeof value === 'string' ? value : '');\n    case 'number':\n      // An untouched number stays ABSENT rather than becoming an empty wrapper.\n      // The gate then does the right thing on both counts: it prunes an absent\n      // optional input, and it reports a required one as missing by name -\n      // where `{number: undefined}` would read as a malformed value instead.\n      return typeof value === 'number' && Number.isFinite(value)\n        ? wrapContent(field, value)\n        : undefined;\n    case 'boolean':\n      // `false` is a value, not an absence - hence the type test rather than a\n      // truthiness one.\n      return typeof value === 'boolean' ? wrapContent(field, value) : undefined;\n    case 'unknown':\n      return typeof value === 'string' ? value : '';\n    case 'document':\n    case 'image': {\n      const url = value && typeof value === 'object' ? (value as { url?: unknown }).url : value;\n      const filename =\n        value && typeof value === 'object' ? (value as { filename?: unknown }).filename : undefined;\n      return { url: url ? String(url) : '', ...(filename ? { filename } : {}) };\n    }\n    case 'object': {\n      const obj = (value && typeof value === 'object' ? value : {}) as Dict;\n      const out: Dict = {};\n      for (const child of field.fields) out[child.name] = toRjsf(child, ownProp(obj, child.name));\n      // A structure nobody put anything into stays ABSENT, exactly as an\n      // untouched number does above - it does NOT become a shell of empty\n      // children. Materializing that shell made an OPTIONAL structured input\n      // unrunnable whenever its concept declared a required child: readiness\n      // ignored the input (correctly - the method said it may be omitted), Run\n      // lit up, and the gate then judged an object the kernel had invented\n      // against the concept's full schema and rejected the run for a child the\n      // user was never asked to fill.\n      //\n      // Emptiness is `isFilled`, the SAME predicate readiness and the wire\n      // payload use, so the three cannot disagree about whether this input is\n      // there. Which also says what the touch is NOT: opening the optional\n      // disclosure is local view state the value never sees, so a section\n      // opened and left blank collapses exactly like one never opened. What\n      // keeps a structure is a VALUE in it - and then the whole shell survives,\n      // empty children and all, so a required child left blank still fails, and\n      // loudly.\n      return collapseEmpty && !isFilled(out) ? undefined : out;\n    }\n    case 'list': {\n      const arr = Array.isArray(value) ? value : [];\n      // An item is NEVER absent: it is in the array because the user added it,\n      // and `ListField`'s \"Add\" seeds an object item with `{}`. Letting it\n      // collapse the way an untouched singular slot does put `undefined` in the\n      // array, which ajv rejects as `must be object` - blocking an empty item\n      // the item schema allowed, and turning a required-child complaint into a\n      // type error that names nothing the user can act on.\n      return arr.map((item) => toRjsf(field.item, item, false));\n    }\n    default:\n      return value;\n  }\n}\n\n// ─── Store  ↔  RunField values ──────────────────────────────────────────────\n\n/** Seed the runner's form values from the method-store's simplified inputData. */\nexport function runValuesFromStore(\n  inputData: Dict | undefined,\n  fields: RunField[],\n  inputSchemas: InputSchemas,\n): Dict {\n  const full = inflateAllInputs(inputData ?? {}, inputSchemas);\n  const out: Dict = {};\n  for (const field of fields) out[field.name] = fromRjsf(field, ownProp(full, field.name));\n  return out;\n}\n\n/**\n * The runner's form values in **schema shape** - the same shape an RJSF panel\n * holds, and therefore the shape `gate.ts` validates against the per-input\n * JSON Schemas.\n *\n * Deliberately stops short of `deflateAllInputs`: deflation is the STORE's\n * compact form, and ajv validates the full one.\n */\nexport function rjsfDataFromRunValues(values: Dict, fields: RunField[]): Dict {\n  const full: Dict = {};\n  for (const field of fields) full[field.name] = toRjsf(field, ownProp(values, field.name));\n  return full;\n}\n\n/** Convert the runner's form values back to the store's simplified inputData. */\nexport function storeInputDataFromRunValues(\n  values: Dict,\n  fields: RunField[],\n  inputSchemas: InputSchemas,\n): Dict {\n  return deflateAllInputs(rjsfDataFromRunValues(values, fields), inputSchemas);\n}\n\n/**\n * Build the `{ concept, content }` map a run expects from the form values.\n *\n * The two ways a method says \"this may be nothing\" land differently on the wire,\n * and both matter:\n * - an **optional (`?`)** input left blank is OMITTED, so the runtime records a\n *   real absence the method can branch on - sending `{ text: \"\" }` would look\n *   like the caller supplied an empty string;\n * - a **plural (`[]`)** input keeps its key, because a plural slot is never\n *   absent - its empty form IS the empty list, and the runtime requires the key.\n *   When that list is EMPTY it is sent BARE, without the envelope: the envelope\n *   is the runtime's \"explicit form\", which bypasses the top-down shaper and\n *   hands the value to the bottom-up factory, and that factory types a list from\n *   its first item - so an empty list there raises \"Cannot create Stuff from\n *   empty list in content\". The bare form keeps the shaper, which reads the\n *   DECLARED concept and builds the empty list correctly. (pipelex/#1096 makes\n *   the envelope agree; the bare form runs today and stays correct after.)\n */\nexport function apiInputsFromRunValues(\n  values: Dict,\n  fields: RunField[],\n  inputSchemas: InputSchemas,\n): Record<string, unknown> {\n  const out: Record<string, unknown> = {};\n  for (const field of fields) {\n    const schema = ownProp(inputSchemas, field.name);\n    if (!schema) continue;\n    const value = ownProp(values, field.name);\n    if (isOptionalInput(schema) && !isFilled(value)) continue;\n    if (isPluralInput(schema) && !isFilled(value)) {\n      out[field.name] = [];\n      continue;\n    }\n    out[field.name] = { concept: schema.concept_ref, content: toRjsf(field, value) };\n  }\n  return out;\n}\n\n// ─── Pipe output → result entries ────────────────────────────────────────────\n\n/** One named output pulled out of a run's working memory, ready to render. */\nexport interface OutputEntry {\n  /** The output variable key (mono). */\n  key: string;\n  conceptRef?: string;\n  value: unknown;\n}\n\n/**\n * The slice of a serialized pipe output this module actually reads. Structural\n * on purpose: the SDK's `DictPipeOutput` is the host's wire type, and the kernel\n * must not depend on `@pipelex/sdk` - the guard below verifies the shape at\n * runtime anyway.\n */\ninterface PipeOutputWithWorkingMemory {\n  working_memory: {\n    root: Record<string, unknown>;\n    aliases?: Record<string, string>;\n  };\n}\n\nfunction hasWorkingMemoryRoot(value: unknown): value is PipeOutputWithWorkingMemory {\n  return (\n    !!value &&\n    typeof value === 'object' &&\n    'working_memory' in value &&\n    !!(value as { working_memory?: { root?: unknown } }).working_memory &&\n    typeof (value as { working_memory: { root?: unknown } }).working_memory.root === 'object'\n  );\n}\n\n/** The concept code of a working-memory entry (`{concept}` may be obj/str/absent). */\nfunction entryConceptRef(data: unknown): string | undefined {\n  if (!data || typeof data !== 'object') return undefined;\n  const raw = (data as { concept?: unknown; concept_code?: unknown }).concept;\n  if (raw && typeof raw === 'object')\n    return (\n      ((raw as { concept_code?: string }).concept_code ?? (raw as { code?: string }).code) ||\n      undefined\n    );\n  if (typeof raw === 'string') return raw;\n  return (data as { concept_code?: string }).concept_code || undefined;\n}\n\n/**\n * Split a run's pipe output into the main result and any intermediate outputs,\n * excluding the inputs. The main output's identity comes from the working\n * memory's `main_stuff` alias (the authoritative pointer to the output variable)\n * - so its label is the REAL stuff name, not a positional guess. Falls back to\n * the last produced stuff only when the alias is absent.\n */\nexport function outputsFromPipeOutput(\n  pipeOutput: unknown,\n  inputKeys: string[],\n): { main: OutputEntry; intermediates: OutputEntry[] } | null {\n  if (!hasWorkingMemoryRoot(pipeOutput)) return null;\n  const wm = pipeOutput.working_memory as {\n    root: Record<string, unknown>;\n    aliases?: Record<string, string>;\n  };\n  const entries = Object.entries(wm.root).filter(([key]) => !inputKeys.includes(key));\n  if (entries.length === 0) return null;\n\n  const toEntry = ([key, data]: [string, unknown]): OutputEntry => ({\n    key,\n    conceptRef: entryConceptRef(data),\n    value: (data as { content?: unknown })?.content ?? data,\n  });\n\n  // The real main-output name: `aliases.main_stuff` → its root key.\n  const mainKey = wm.aliases?.['main_stuff'];\n  const mainEntry: [string, unknown] =\n    mainKey && Object.prototype.hasOwnProperty.call(wm.root, mainKey)\n      ? [mainKey, wm.root[mainKey]]\n      : entries[entries.length - 1]!;\n  const intermediates = entries.filter(([key]) => key !== mainEntry[0]).map(toEntry);\n\n  return { main: toEntry(mainEntry), intermediates };\n}\n\n/**\n * Recover the inputs a run was executed with from its working memory. The run's\n * `working_memory.root` holds every named stuff - inputs AND outputs - keyed by\n * variable name; we pull the entries whose keys are declared inputs and deflate\n * their `content` (the full form shape) back into the store's simplified\n * `inputData`. Lets the runner repopulate the form for a past/shared run - the\n * inputs that produced the result. Returns `null` when no inputs are present.\n */\nexport function inputDataFromWorkingMemory(\n  workingMemory: unknown,\n  inputSchemas: InputSchemas,\n): Dict | null {\n  const root = (workingMemory as { root?: Record<string, unknown> } | null | undefined)?.root;\n  if (!root || typeof root !== 'object') return null;\n  const full: Dict = {};\n  let found = false;\n  for (const key of Object.keys(inputSchemas)) {\n    const entry = ownProp(root, key);\n    if (entry && typeof entry === 'object' && 'content' in entry) {\n      full[key] = (entry as { content: unknown }).content;\n      found = true;\n    }\n  }\n  if (!found) return null;\n  return deflateAllInputs(full, inputSchemas);\n}\n\n/** Field descriptors for a method's main pipe. */\nexport function fieldsForContract(contract: PipeIOContract | undefined): RunField[] {\n  return contract?.inputs ? buildRunFields(contract.inputs) : [];\n}\n\n/**\n * Immutably set a value at a dotted/indexed path (`a.0.b`). Used to write an\n * uploaded file's URL back to a field anywhere in the (possibly nested) tree.\n */\nexport function setValueAtPath(root: Dict, path: string[], value: unknown): Dict {\n  const head = path[0];\n  if (head === undefined) return root;\n  const rest = path.slice(1);\n  if (rest.length === 0) return { ...root, [head]: value };\n\n  const nextSeg = rest[0] as string;\n  const child = root[head];\n  if (/^\\d+$/.test(nextSeg)) {\n    const arr = Array.isArray(child) ? child.slice() : [];\n    const idx = Number(nextSeg);\n    arr[idx] =\n      rest.length === 1 ? value : setValueAtPath((arr[idx] as Dict) ?? {}, rest.slice(1), value);\n    return { ...root, [head]: arr };\n  }\n  return { ...root, [head]: setValueAtPath((child as Dict) ?? {}, rest, value) };\n}\n"]}

package/dist/chunk-XEPD5VJQ.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/core/gate.ts"],"names":[],"mappings":";;;;;;;;;AAqDO,SAAS,qBAAqB,MAAA,EAAiD;AACpF,EAAA,MAAM,aAAmB,EAAC;AAC1B,EAAA,MAAM,WAAqB,EAAC;AAE5B,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AACrD,IAAA,MAAM,WAAA,GAAc,EAAE,GAAG,KAAA,CAAM,WAAA,EAAY;AAC3C,IAAA,WAAA,CAAY,KAAA,GAAQ,OAAA;AACpB,IAAA,IAAI,KAAA,CAAM,WAAA,IAAe,KAAA,CAAM,WAAA,KAAgB,OAAA,EAAS;AACtD,MAAA,WAAA,CAAY,cAAc,KAAA,CAAM,WAAA;AAAA,IAClC;AACA,IAAA,UAAA,CAAW,OAAO,CAAA,GAAI,WAAA;AACtB,IAAA,IAAI,iBAAA,CAAkB,KAAK,CAAA,EAAG,QAAA,CAAS,KAAK,OAAO,CAAA;AAAA,EACrD;AAEA,EAAA,OAAO,qBAAqB,EAAE,IAAA,EAAM,QAAA,EAAU,UAAA,EAAY,UAAU,CAAA;AACtE;AAaO,SAAS,gBAAA,CAAiB,MAAY,MAAA,EAAoB;AAC/D,EAAA,OAAO,mBAAA,CAAoB,kBAAA,CAAmB,IAAA,EAAM,MAAM,GAAG,MAAM,CAAA;AACrE;AA8BO,SAAS,iBAAA,CACd,YAAA,EACA,MAAA,EACA,MAAA,EACkB;AAClB,EAAA,MAAM,MAAA,GAAS,uBAAA,CAAwB,YAAA,EAAc,MAAM,CAAA;AAC3D,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,aAAA,EAAe,EAAC,EAAG,MAAA,EAAQ,EAAC,EAAE;AAE/E,EAAA,MAAM,OAAA,GACJ,OAAO,YAAA,KAAiB,QAAA,IAAY,YAAA,KAAiB,IAAA,IAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,YAAY,CAAA,GACnF,YAAA,GACD,MAAA;AACN,EAAA,MAAM,gBAA0B,EAAC;AACjC,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AACrD,IAAA,IAAI,CAAC,iBAAA,CAAkB,KAAK,CAAA,EAAG;AAC/B,IAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,OAAA,EAAS,OAAO,CAAA;AAMxC,IAAA,IAAI,WAAW,IAAA,EAAM;AACnB,MAAA,aAAA,CAAc,KAAK,OAAO,CAAA;AAC1B,MAAA;AAAA,IACF;AACA,IAAA,MAAM,cAAc,KAAA,CAAM,WAAA;AAC1B,IAAA,MAAM,cAAA,GAAkB,WAAA,CAAY,QAAA,IAAyB,EAAC;AAC9D,IAAA,IAAI,cAAA,CAAe,WAAW,CAAA,EAAG;AACjC,IAAA,IAAI,OAAO,YAAY,QAAA,EAAU;AAC/B,MAAA,aAAA,CAAc,KAAK,OAAO,CAAA;AAC1B,MAAA;AAAA,IACF;AACA,IAAA,MAAM,MAAA,GAAS,OAAA;AACf,IAAA,IACE,cAAA,CAAe,IAAA,CAAK,CAAC,CAAA,KAAM;AACzB,MAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,MAAA,EAAQ,CAAC,CAAA;AAC/B,MAAA,OAAO,KAAA,KAAU,UAAa,KAAA,KAAU,EAAA;AAAA,IAC1C,CAAC,CAAA,EACD;AACA,MAAA,aAAA,CAAc,KAAK,OAAO,CAAA;AAAA,IAC5B;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,aAAA,EAAe,MAAA,EAAO;AACjD;AAyBO,SAAS,uBAAA,CACd,cACA,MAAA,EACM;AACN,EAAA,MAAM,MAAY,EAAC;AACnB,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AACrD,IAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,YAAA,EAAc,OAAO,CAAA;AACzC,IAAA,IAAI,gBAAgB,KAAK,CAAA,IAAK,CAAC,QAAA,CAAS,GAAG,CAAA,EAAG;AAC9C,IAAA,IAAI,cAAc,KAAK,CAAA,IAAK,CAAC,QAAA,CAAS,GAAG,CAAA,EAAG;AAC1C,MAAA,GAAA,CAAI,OAAO,IAAI,EAAC;AAChB,MAAA;AAAA,IACF;AACA,IAAA,MAAM,OAAA,GAAU,aAAA,CAAc,KAAK,CAAA,IAAK,CAAC,MAAM,OAAA,CAAQ,GAAG,CAAA,GAAI,EAAC,GAAI,GAAA;AACnE,IAAA,GAAA,CAAI,OAAO,CAAA,GAAI,EAAE,OAAA,EAAS,KAAA,CAAM,aAAa,OAAA,EAAQ;AAAA,EACvD;AACA,EAAA,OAAO,GAAA;AACT;AAkCA,IAAM,YAAA,uBAAmB,OAAA,EAA8B;AAEvD,SAAS,kBAAkB,QAAA,EAAgC;AACzD,EAAA,MAAM,MAAA,GAAS,YAAA,CAAa,GAAA,CAAI,QAAQ,CAAA;AACxC,EAAA,IAAI,QAAQ,OAAO,MAAA;AACnB,EAAA,MAAM,MAAA,GAAS,oBAAA,CAAqB,QAAA,CAAS,MAAM,CAAA;AACnD,EAAA,YAAA,CAAa,GAAA,CAAI,UAAU,MAAM,CAAA;AACjC,EAAA,OAAO,MAAA;AACT;AA+CO,SAAS,aAAA,CAAc,UAA0B,IAAA,EAAoC;AAC1F,EAAA,MAAM,QAAA,GAAW,OAAO,IAAA,KAAS,QAAA,IAAY,SAAS,IAAA,IAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA;AACjF,EAAA,MAAM,OAAA,GAAU,QAAA,GAAY,IAAA,GAAgB,EAAC;AAC7C,EAAA,MAAM,MAAA,GAAS,kBAAkB,QAAQ,CAAA;AACzC,EAAA,MAAM,YAAA,GAAe,gBAAA,CAAiB,OAAA,EAAS,MAAM,CAAA;AAGrD,EAAA,MAAM,UAAU,iBAAA,CAAkB,QAAA,GAAW,eAAe,IAAA,EAAM,QAAA,CAAS,QAAQ,MAAM,CAAA;AACzF,EAAA,IAAI,CAAC,QAAQ,OAAA,EAAS;AACpB,IAAA,OAAO;AAAA,MACL,EAAA,EAAI,KAAA;AAAA,MACJ,eAAe,OAAA,CAAQ,aAAA;AAAA,MACvB,QAAQ,OAAA,CAAQ,MAAA;AAAA,MAChB;AAAA,KACF;AAAA,EACF;AAcA,EAAA,MAAM,gBAAgB,cAAA,CAAe,QAAA,CAAS,MAAM,CAAA,CACjD,OAAO,CAAC,KAAA,KAAU,YAAA,CAAa,KAAK,KAAK,QAAA,CAAS,OAAA,CAAQ,YAAA,EAAc,KAAA,CAAM,IAAI,CAAC,CAAC,CAAA,CACpF,MAAA,CAAO,CAAC,KAAA,KAAU,CAAC,WAAA,CAAY,KAAA,EAAO,QAAQ,YAAA,EAAc,KAAA,CAAM,IAAI,CAAC,CAAC,CAAA,CACxE,GAAA,CAAI,CAAC,KAAA,KAAU,MAAM,IAAI,CAAA;AAC5B,EAAA,IAAI,aAAA,CAAc,MAAA,EAAQ,OAAO,EAAE,EAAA,EAAI,OAAO,aAAA,EAAe,MAAA,EAAQ,EAAC,EAAG,YAAA,EAAa;AAEtF,EAAA,OAAO,EAAE,IAAI,IAAA,EAAM,MAAA,EAAQ,wBAAwB,YAAA,EAAc,QAAA,CAAS,MAAM,CAAA,EAAE;AACpF","file":"chunk-XEPD5VJQ.js","sourcesContent":["/**\n * The gate every run passes through, whichever surface starts it.\n *\n * A host may offer more than one place to run a method - a schema-driven\n * inputs panel (an RJSF form) and a standalone run page (a bespoke field\n * renderer), say. **Only the rendering of inputs differs.** Everything between\n * \"the user pressed Run\" and \"the payload goes on the wire\" lives here, so\n * those surfaces cannot drift:\n *\n *   1. `buildRunInputsSchema` - the combined JSON Schema, whose `required` list\n *      is `inputMustBeFilled` (optional `?` and variable-plural `[]` never\n *      block; a fixed-count `[N]` list does).\n *   2. `prepareRunInputs` - heal legacy wrappers, then prune empty optionals.\n *   3. `validateRunInputs` - ajv, plus the missing-input scan that names the\n *      VARIABLE at fault.\n *   4. `apiInputsFromSchemaData` - the `{concept, content}` payload, built from\n *      the PREPARED data so the pruning reaches the wire too.\n *\n * **`gateRunInputs` is that whole chain as one call**, and it is what a server\n * should use. The four steps stay exported because a host that renders its own\n * panel needs the schema and the verdict separately, but assembling them is not\n * a host's job: the step between validation and the payload is an emptiness\n * check with four look-alike predicates to choose from, only two of which are\n * the ones the Run button reads, and choosing the near-miss pair produces a\n * server that is more permissive than the button in front of it.\n *\n * This module is pure: no React, no toasts, no i18n. Each caller renders the\n * verdict in its own idiom.\n */\nimport { inputMustBeFilled, isOptionalInput, isPluralInput } from './contracts';\nimport { buildRunFields } from './derive';\nimport { fieldFilled, isFilled, mustBeFilled } from './readiness';\nimport { validateRunInputsSchema, type RunInputError } from './gate-validator';\nimport { healStringWrappers, pruneEmptyOptionals } from './wire-format';\nimport { prepareSchemaForRjsf } from './normalize-schema';\nimport { ownProp } from './own-property';\nimport type { PipeIOContract, PipeInputContract } from './contracts';\n\ntype Dict = Record<string, unknown>;\n\n/**\n * Combine the per-input schemas into one object schema.\n *\n * Each input variable becomes a property, titled with the variable name and\n * described with the concept code. Only the inputs the method actually demands\n * land in `required` - an optional (`?`) or variable-plural (`[]`) input must\n * not block the form (see `inputMustBeFilled`).\n *\n * The per-input schema travels verbatim, which is how a fixed-count (`[N]`)\n * list's declared count reaches ajv: pipelex states it as `minItems`/`maxItems`\n * on the array wrapper, so the count is enforced here without the kernel\n * restating it.\n */\nexport function buildRunInputsSchema(inputs: Record<string, PipeInputContract>): Dict {\n  const properties: Dict = {};\n  const required: string[] = [];\n\n  for (const [varName, input] of Object.entries(inputs)) {\n    const inputSchema = { ...input.json_schema } as Dict;\n    inputSchema.title = varName;\n    if (input.concept_ref && input.concept_ref !== varName) {\n      inputSchema.description = input.concept_ref;\n    }\n    properties[varName] = inputSchema;\n    if (inputMustBeFilled(input)) required.push(varName);\n  }\n\n  return prepareSchemaForRjsf({ type: 'object', properties, required });\n}\n\n/**\n * Last-gate repair, in two passes against the exact schema ajv validates.\n *\n * 1. **HEAL** - persisted `inputData` may still carry the legacy double-wrapped\n *    `{ text: { text } }` shape (or a form's state may lag a store fix).\n * 2. **PRUNE** - RJSF fills every unset string with `\"\"` on mount, which an\n *    optional CONSTRAINED field rejects (`DateContent.time` is `format: \"time\"`)\n *    - blocking a run on a field the user never opened. An absent optional field\n *    is what pipelex means by `None` anyway, so dropping it is the semantically\n *    correct repair, not a validation dodge.\n */\nexport function prepareRunInputs(data: Dict, schema: Dict): Dict {\n  return pruneEmptyOptionals(healStringWrappers(data, schema), schema) as Dict;\n}\n\nexport interface RunInputsVerdict {\n  isValid: boolean;\n  /** Variable names the scan could pin a missing required field on. */\n  missingInputs: string[];\n  /** Raw ajv errors, for when the scan cannot name anything. */\n  errors: RunInputError[];\n}\n\n/**\n * Validate PREPARED data against the combined schema.\n *\n * `missingInputs` is reported by VARIABLE NAME - the name on the node the user\n * clicks - never by `concept_ref`, which used to produce \"Missing required\n * fields in: native.Text\" and named neither the input at fault nor, when several\n * inputs share a concept, which of them. Inputs the method declared omittable\n * are skipped: an empty `?` input is not a missing one.\n *\n * The scan can come up empty even on an invalid form (a wrong value shape, a\n * nested mismatch); `errors` is what the caller falls back to then, so a failure\n * is never undiagnosable.\n *\n * `preparedData` is `unknown` for the same reason `gateRunInputs`' `data` is: on\n * a public endpoint the body is whatever was sent, and ajv must be shown that\n * rather than a repair of it, or `must be object` is a verdict no caller can\n * ever receive. The name-the-variable scan below needs something indexable, so\n * a body that is not a record scans against nothing and names every input the\n * method demands - which is the honest answer for a body that carried none.\n */\nexport function validateRunInputs(\n  preparedData: unknown,\n  inputs: Record<string, PipeInputContract>,\n  schema: Dict,\n): RunInputsVerdict {\n  const errors = validateRunInputsSchema(preparedData, schema);\n  if (errors.length === 0) return { isValid: true, missingInputs: [], errors: [] };\n\n  const record0 =\n    typeof preparedData === 'object' && preparedData !== null && !Array.isArray(preparedData)\n      ? (preparedData as Dict)\n      : undefined;\n  const missingInputs: string[] = [];\n  for (const [varName, input] of Object.entries(inputs)) {\n    if (!inputMustBeFilled(input)) continue;\n    const varData = ownProp(record0, varName);\n    // A demanded input that is not there at all is missing whatever its concept\n    // declares inside. The check has to come BEFORE the required-children one:\n    // a struct whose concept demands no child used to fall out of the scan\n    // here, so the run was refused by the combined schema's `required` list\n    // while the scan named nothing and the caller could only quote ajv.\n    if (varData == null) {\n      missingInputs.push(varName);\n      continue;\n    }\n    const inputSchema = input.json_schema as Dict;\n    const requiredFields = (inputSchema.required as string[]) || [];\n    if (requiredFields.length === 0) continue;\n    if (typeof varData !== 'object') {\n      missingInputs.push(varName);\n      continue;\n    }\n    const record = varData as Dict;\n    if (\n      requiredFields.some((f) => {\n        const child = ownProp(record, f);\n        return child === undefined || child === '';\n      })\n    ) {\n      missingInputs.push(varName);\n    }\n  }\n\n  return { isValid: false, missingInputs, errors };\n}\n\n/**\n * Build the `{ concept, content }` map a run expects, from PREPARED data.\n *\n * The two ways a method says \"this may be nothing\" land differently on the wire:\n * - an **optional (`?`)** input left blank is OMITTED, so the runtime records a\n *   real absence the method can branch on - sending `{ text: \"\" }` would look\n *   like the caller supplied an empty string;\n * - a **plural (`[]`)** input keeps its key, because a plural slot is never\n *   absent - its empty form IS the empty list, and the runtime requires the key.\n *   When that list is EMPTY it is sent BARE, without the envelope: the envelope\n *   is the runtime's \"explicit form\", which bypasses the top-down shaper and\n *   hands the value to the bottom-up factory, and that factory types a list from\n *   its first item - so an empty list there raises \"Cannot create Stuff from\n *   empty list in content\". The bare form keeps the shaper, which reads the\n *   DECLARED concept and builds the empty list correctly. (pipelex/#1096 makes\n *   the envelope agree; the bare form runs today and stays correct after.)\n *\n * A fixed-count (`[N]`) list takes that same empty-list path, and an empty one\n * is not a payload the method can accept. It is unreachable through the gate,\n * which demands the input and rejects a short list on `minItems`; building the\n * payload straight from unvalidated data is what would reach it, and inventing\n * a different absence here would only hide that.\n */\nexport function apiInputsFromSchemaData(\n  preparedData: Dict,\n  inputs: Record<string, PipeInputContract>,\n): Dict {\n  const out: Dict = {};\n  for (const [varName, input] of Object.entries(inputs)) {\n    const raw = ownProp(preparedData, varName);\n    if (isOptionalInput(input) && !isFilled(raw)) continue;\n    if (isPluralInput(input) && !isFilled(raw)) {\n      out[varName] = [];\n      continue;\n    }\n    const content = isPluralInput(input) && !Array.isArray(raw) ? [] : raw;\n    out[varName] = { concept: input.concept_ref, content };\n  }\n  return out;\n}\n\n// ─── The whole chain, as one call ────────────────────────────────────────────\n\n/** The gate's verdict: the payload to send, or why the run may not start. */\nexport type RunInputsGateResult =\n  | { ok: true; inputs: Dict }\n  | {\n      ok: false;\n      /** Variable names the caller left empty or short. */\n      missingInputs: string[];\n      /** Raw ajv errors, for when the scan cannot name anything. */\n      errors: RunInputError[];\n      /** The repaired data the verdict was reached on - what\n       *  `describeValidationError` needs to quote the value it received. */\n      preparedData: Dict;\n    };\n\n/**\n * One schema object per contract, for the lifetime of the process.\n *\n * `buildRunInputsSchema` is a pure function of the contract, so rebuilding it is\n * *semantically* free - but validation runs through a module-level ajv whose\n * compiled-schema cache is keyed on **schema object identity** and is never\n * evicted. A fresh object per call therefore misses every time and retains\n * another compiled validator. On a publicly callable server endpoint that is\n * unbounded growth driven by the cheapest request there is: an empty body,\n * rejected in a fraction of a millisecond, costing nothing to send.\n *\n * Weakly keyed so the map never pins a contract that goes out of scope. The\n * schema a run has been gated against is pinned for the process lifetime anyway\n * by ajv's own cache; the point is that the NUMBER of them is bounded by the\n * number of distinct contracts rather than by traffic.\n */\nconst SCHEMA_CACHE = new WeakMap<PipeIOContract, Dict>();\n\nfunction schemaForContract(contract: PipeIOContract): Dict {\n  const cached = SCHEMA_CACHE.get(contract);\n  if (cached) return cached;\n  const schema = buildRunInputsSchema(contract.inputs);\n  SCHEMA_CACHE.set(contract, schema);\n  return schema;\n}\n\n/**\n * Gate a run: repair the caller's data, validate it against the contract,\n * refuse anything the Run button would have refused, and build the payload.\n *\n * Returns a verdict rather than throwing. A server endpoint must not throw\n * across the boundary to its client - frameworks routinely strip the message to\n * an opaque digest in a production build - and a rejection here is an ordinary\n * outcome, not an exceptional one.\n *\n * **`data` is `unknown` because that is what it is.** A run endpoint is public\n * and no framework enforces a declared parameter type, so the argument is\n * whatever the caller put in the body. The chain indexes the payload by\n * variable name without first checking it is indexable, so a `null` body would\n * throw *after* ajv had already reported `must be object` and before any\n * verdict came back.\n *\n * So the two uses are separated rather than collapsed into one repair. **ajv\n * judges the value the caller actually sent**, which is what makes `must be\n * object` the verdict for a body that is not one; the indexing that follows\n * uses a safe `{}` stand-in, which is what keeps the gate from throwing. Repair\n * FIRST - coercing a non-object to `{}` before validating - is the shape that\n * looks equivalent and is not: a contract whose inputs are all optional has an\n * empty `required` list, so `{}` validates, and `gateRunInputs(\"garbage\", …)`\n * came back `ok: true` on a body the caller never meant as a run. Fail-closed\n * costs a malformed caller an error it earned; the other direction bills a run.\n *\n * **The schema alone is not the rule.** ajv's `required` asserts only that a\n * key is PRESENT, and a content model carries no `minLength` - so a required\n * input that arrived empty (`{document: {url: \"\"}}`, `{text: {text: \"\"}}`)\n * satisfies the schema. That is the natural payload, not a contrived one:\n * `rjsfDataFromRunValues({}, fields)` emits exactly that when nothing is\n * selected. So the gate re-applies the emptiness rule using\n * `computeReadiness`'s OWN two functions over the same derived fields, which is\n * the only way to be sure the two sides cannot disagree.\n *\n * Picking a pair that merely looks equivalent is not enough, and this is the\n * whole reason the assembly lives here rather than in each host: the obvious\n * choice, `inputMustBeFilled` + `isFilled`, agrees on every leaf kind and\n * diverges on a structured concept in BOTH directions - `isFilled` on an object\n * is `some(child filled)` where `fieldFilled` is `every(required child\n * filled)`. That accepts a half-filled struct the browser refuses (a paid run\n * past a disabled button) and rejects a filled all-optional struct the browser\n * accepts. A host whose methods happen to use only native concepts has no test\n * that can catch either.\n */\nexport function gateRunInputs(contract: PipeIOContract, data: unknown): RunInputsGateResult {\n  const isRecord = typeof data === 'object' && data !== null && !Array.isArray(data);\n  const payload = isRecord ? (data as Dict) : {};\n  const schema = schemaForContract(contract);\n  const preparedData = prepareRunInputs(payload, schema);\n\n  // The value ajv is shown is the caller's, not the stand-in - see above.\n  const verdict = validateRunInputs(isRecord ? preparedData : data, contract.inputs, schema);\n  if (!verdict.isValid) {\n    return {\n      ok: false,\n      missingInputs: verdict.missingInputs,\n      errors: verdict.errors,\n      preparedData,\n    };\n  }\n\n  // The SELECTION is half the rule, and leaving it out is what made the two\n  // halves disagree. `computeReadiness` reckons with an input the method\n  // demands AND one it left optional that the user has touched - because a\n  // structure with something in it owes its concept every field the concept\n  // declares. Filtering on `mustBeFilled` alone dropped the second kind, so a\n  // half-filled optional struct was refused by the button and accepted here.\n  //\n  // ajv cannot cover for it: a required child that is a plain string arrives as\n  // `''`, which satisfies `required`. And the payload builder below then SENDS\n  // that input, because `isFilled` is exactly what it tests. Which is the rule\n  // stated properly: the gate holds to its concept precisely the inputs it is\n  // about to put on the wire, and nothing it will omit.\n  const missingInputs = buildRunFields(contract.inputs)\n    .filter((field) => mustBeFilled(field) || isFilled(ownProp(preparedData, field.name)))\n    .filter((field) => !fieldFilled(field, ownProp(preparedData, field.name)))\n    .map((field) => field.name);\n  if (missingInputs.length) return { ok: false, missingInputs, errors: [], preparedData };\n\n  return { ok: true, inputs: apiInputsFromSchemaData(preparedData, contract.inputs) };\n}\n"]}

package/dist/core/native-concepts.d.ts

@@ -1,78 +0,0 @@
-/**
- * The native-concept taxonomy, stated ONCE - with each call path's historical
- * view exported explicitly, because the three copies this consolidates had
- * DRIFTED and K1 preserved each path's observable behavior exactly (see
- * `concept-taxonomy-characterization.test.ts`).
- *
- * The sets below spell the codes MTHDS actually defines (the `native` domain of
- * the language spec). That is not pedantry: a set that named a concept the
- * language does not have is what broke `native.Number`, because the render path
- * knew the concept and the value path did not.
- *
- * The drift, recorded for M1 (where the server-derived descriptor retires this
- * module entirely):
- *
- * | concept | field mapper (render)     | wire format (deflate/inflate) | value bridge (content wrapper) |
- * | ------- | ------------------------- | ----------------------------- | ------------------------------ |
- * | Text    | text/prose                | bare string                   | `{text}`, from `TextContent`   |
- * | Number  | number                    | `{concept, content}`          | `{number}`, from `NumberContent` |
- * | YesNo   | boolean                   | `{concept, content}`          | `{yes_no}`, from `YesNoContent` |
- * | Date    | text/prose (NOT a picker) | CUSTOM `{concept, content}`   | `{text}` - WRONG, see below    |
- * | Html    | nested object             | `{concept, content}`          | -                              |
- * | Page    | document                  | document-like (bare URL)      | -                              |
- *
- * A `Date` input therefore ships as `{concept: "native.Date", content: {text}}`
- * today - consistent end-to-end, but not `DateContent {date, time}`. Changing
- * that is a wire-visible fix and belongs to M1, not here.
- *
- * `HTML_CONCEPTS` below spells the code `HTML`; the language spells it `Html`
- * (`NativeConceptCode.HTML = "Html"`), so the set matches nothing a real
- * contract carries and `native.Html` falls through to the generic object
- * dispatch - a nested card over `HtmlContent {inner_html, css_class}`, which
- * round-trips correctly. Correcting the spelling would route `native.Html` into
- * the prose-plus-`{text}` drift above and BREAK inputs that work today, so the
- * spelling is left alone deliberately and goes with the Date fix at M1.
- */
-declare const TEXT_CONCEPTS: ReadonlySet<string>;
-declare const DATE_CONCEPTS: ReadonlySet<string>;
-/** Deliberately the code the language does NOT use - see the header. */
-declare const HTML_CONCEPTS: ReadonlySet<string>;
-declare const DOCUMENT_CONCEPTS: ReadonlySet<string>;
-declare const PAGE_CONCEPTS: ReadonlySet<string>;
-declare const IMAGE_CONCEPTS: ReadonlySet<string>;
-declare const NUMBER_CONCEPTS: ReadonlySet<string>;
-declare const YES_NO_CONCEPTS: ReadonlySet<string>;
-/** Concepts the mapper renders as text/prose - `Date` deliberately included
- *  (a `native.Date` input renders as prose today, not as a date picker). */
-declare const FIELD_TEXT_CONCEPTS: ReadonlySet<string>;
-/** Concepts the mapper renders as a document upload - `Page` folded in. */
-declare const FIELD_DOCUMENT_CONCEPTS: ReadonlySet<string>;
-/** True when the simplified wire form is a bare string (`{text} ↔ "..."`).
- *  `Date` is NOT here: it travels through the custom-concept `{concept,
- *  content}` branch (the drift the header records). */
-declare function isWireTextConcept(concept: string): boolean;
-/** True when the simplified wire form is a bare URL string. */
-declare function isWireDocumentLikeConcept(concept: string): boolean;
-/**
- * The FALLBACK text wrapper, for a text concept whose contract declares no
- * single-property content model to read the wrapper name off.
- *
- * The wrapper property is normally derived from the declared schema, in
- * `derive.ts`, and travels on the descriptor as `RunField.contentKey` - so the
- * value bridge wraps by name and holds no taxonomy of its own. This set is what
- * answers when that derivation finds nothing:
- *
- * - `native.Text` with a degenerate contract (a bare `{type: 'object'}`, or a
- *   bare `{type: 'string'}`) still wraps as `{text}`, as it always has;
- * - `native.Date` declares `DateContent {date, time}` - two properties, so no
- *   single wrapper - and this set is what keeps it wrapping as `{text}`. That
- *   is the recorded drift, preserved on purpose until M1.
- */
-declare const TEXT_WRAPPER_CONCEPTS: ReadonlySet<string>;
-/** A concept ref like `native.Document[]` → base `native.Document`, isList true. */
-declare function splitListConcept(conceptRef: string | undefined): {
-    base?: string;
-    isList: boolean;
-};
-
-export { DATE_CONCEPTS, DOCUMENT_CONCEPTS, FIELD_DOCUMENT_CONCEPTS, FIELD_TEXT_CONCEPTS, HTML_CONCEPTS, IMAGE_CONCEPTS, NUMBER_CONCEPTS, PAGE_CONCEPTS, TEXT_CONCEPTS, TEXT_WRAPPER_CONCEPTS, YES_NO_CONCEPTS, isWireDocumentLikeConcept, isWireTextConcept, splitListConcept };