@pipelex/mthds-form 0.2.0 → 0.4.0

package/dist/chunk-WXBSM2CE.js

@@ -0,0 +1,201 @@
+import { inflateAllInputs, deflateAllInputs } from './chunk-7BMOPXDY.js';
+import { isFilled } from './chunk-PM55AHRO.js';
+import { buildRunFields } from './chunk-VMLXO5JS.js';
+import { isOptionalInput, isPluralInput } from './chunk-HARYEWNG.js';
+import { ownProp } from './chunk-V3OV2XQT.js';
+
+// src/core/values.ts
+function wrapContent(field, value) {
+  return field.contentKey === void 0 ? value : { [field.contentKey]: value };
+}
+function unwrapContent(field, value) {
+  const key = field.contentKey;
+  if (key === void 0 || !value || typeof value !== "object" || Array.isArray(value))
+    return value;
+  return ownProp(value, key);
+}
+var MAX_UNWRAP_DEPTH = 8;
+function textFromStored(value, depth = 0) {
+  if (value == null) return void 0;
+  if (typeof value === "string") return value;
+  if (typeof value === "number" || typeof value === "boolean") return String(value);
+  if (typeof value !== "object" || depth >= MAX_UNWRAP_DEPTH) return void 0;
+  const envelope = value;
+  if ("text" in envelope) return textFromStored(envelope.text, depth + 1);
+  if ("content" in envelope) return textFromStored(envelope.content, depth + 1);
+  return void 0;
+}
+function fromRjsf(field, value) {
+  switch (field.kind) {
+    case "text":
+    case "prose":
+      return textFromStored(value);
+    case "number": {
+      const raw = unwrapContent(field, value);
+      if (typeof raw === "number") return Number.isFinite(raw) ? raw : void 0;
+      if (typeof raw === "string" && raw.trim() !== "") {
+        const parsed = Number(raw);
+        return Number.isFinite(parsed) ? parsed : void 0;
+      }
+      return void 0;
+    }
+    case "boolean": {
+      const raw = unwrapContent(field, value);
+      return typeof raw === "boolean" ? raw : void 0;
+    }
+    case "unknown":
+      if (typeof value === "string") return value;
+      if (value == null) return void 0;
+      if (typeof value === "object") {
+        try {
+          return JSON.stringify(value, null, 2);
+        } catch {
+          return void 0;
+        }
+      }
+      return String(value);
+    case "document":
+    case "image": {
+      if (value && typeof value === "object") {
+        const o = value;
+        return o.url ? { url: String(o.url), filename: o.filename } : void 0;
+      }
+      return typeof value === "string" && value ? { url: value } : void 0;
+    }
+    case "object": {
+      const obj = value && typeof value === "object" ? value : {};
+      const out = {};
+      for (const child of field.fields) out[child.name] = fromRjsf(child, ownProp(obj, child.name));
+      return out;
+    }
+    case "list": {
+      const arr = Array.isArray(value) ? value : [];
+      return arr.map((item) => fromRjsf(field.item, item));
+    }
+    default:
+      return value;
+  }
+}
+function toRjsf(field, value, collapseEmpty = true) {
+  switch (field.kind) {
+    case "text":
+    case "prose":
+      return wrapContent(field, typeof value === "string" ? value : "");
+    case "number":
+      return typeof value === "number" && Number.isFinite(value) ? wrapContent(field, value) : void 0;
+    case "boolean":
+      return typeof value === "boolean" ? wrapContent(field, value) : void 0;
+    case "unknown":
+      return typeof value === "string" ? value : "";
+    case "document":
+    case "image": {
+      const url = value && typeof value === "object" ? value.url : value;
+      const filename = value && typeof value === "object" ? value.filename : void 0;
+      return { url: url ? String(url) : "", ...filename ? { filename } : {} };
+    }
+    case "object": {
+      const obj = value && typeof value === "object" ? value : {};
+      const out = {};
+      for (const child of field.fields) out[child.name] = toRjsf(child, ownProp(obj, child.name));
+      return collapseEmpty && !isFilled(out) ? void 0 : out;
+    }
+    case "list": {
+      const arr = Array.isArray(value) ? value : [];
+      return arr.map((item) => toRjsf(field.item, item, false));
+    }
+    default:
+      return value;
+  }
+}
+function runValuesFromStore(inputData, fields, inputSchemas) {
+  const full = inflateAllInputs(inputData ?? {}, inputSchemas);
+  const out = {};
+  for (const field of fields) out[field.name] = fromRjsf(field, ownProp(full, field.name));
+  return out;
+}
+function rjsfDataFromRunValues(values, fields) {
+  const full = {};
+  for (const field of fields) full[field.name] = toRjsf(field, ownProp(values, field.name));
+  return full;
+}
+function storeInputDataFromRunValues(values, fields, inputSchemas) {
+  return deflateAllInputs(rjsfDataFromRunValues(values, fields), inputSchemas);
+}
+function apiInputsFromRunValues(values, fields, inputSchemas) {
+  const out = {};
+  for (const field of fields) {
+    const schema = ownProp(inputSchemas, field.name);
+    if (!schema) continue;
+    const value = ownProp(values, field.name);
+    if (isOptionalInput(schema) && !isFilled(value)) continue;
+    if (isPluralInput(schema) && !isFilled(value)) {
+      out[field.name] = [];
+      continue;
+    }
+    out[field.name] = { concept: schema.concept_ref, content: toRjsf(field, value) };
+  }
+  return out;
+}
+function hasWorkingMemoryRoot(value) {
+  return !!value && typeof value === "object" && "working_memory" in value && !!value.working_memory && typeof value.working_memory.root === "object";
+}
+function entryConceptRef(data) {
+  if (!data || typeof data !== "object") return void 0;
+  const raw = data.concept;
+  if (raw && typeof raw === "object")
+    return (raw.concept_code ?? raw.code) || void 0;
+  if (typeof raw === "string") return raw;
+  return data.concept_code || void 0;
+}
+function outputsFromPipeOutput(pipeOutput, inputKeys) {
+  if (!hasWorkingMemoryRoot(pipeOutput)) return null;
+  const wm = pipeOutput.working_memory;
+  const entries = Object.entries(wm.root).filter(([key]) => !inputKeys.includes(key));
+  if (entries.length === 0) return null;
+  const toEntry = ([key, data]) => ({
+    key,
+    conceptRef: entryConceptRef(data),
+    value: data?.content ?? data
+  });
+  const mainKey = wm.aliases?.["main_stuff"];
+  const mainEntry = mainKey && Object.prototype.hasOwnProperty.call(wm.root, mainKey) ? [mainKey, wm.root[mainKey]] : entries[entries.length - 1];
+  const intermediates = entries.filter(([key]) => key !== mainEntry[0]).map(toEntry);
+  return { main: toEntry(mainEntry), intermediates };
+}
+function inputDataFromWorkingMemory(workingMemory, inputSchemas) {
+  const root = workingMemory?.root;
+  if (!root || typeof root !== "object") return null;
+  const full = {};
+  let found = false;
+  for (const key of Object.keys(inputSchemas)) {
+    const entry = ownProp(root, key);
+    if (entry && typeof entry === "object" && "content" in entry) {
+      full[key] = entry.content;
+      found = true;
+    }
+  }
+  if (!found) return null;
+  return deflateAllInputs(full, inputSchemas);
+}
+function fieldsForContract(contract) {
+  return contract?.inputs ? buildRunFields(contract.inputs) : [];
+}
+function setValueAtPath(root, path, value) {
+  const head = path[0];
+  if (head === void 0) return root;
+  const rest = path.slice(1);
+  if (rest.length === 0) return { ...root, [head]: value };
+  const nextSeg = rest[0];
+  const child = root[head];
+  if (/^\d+$/.test(nextSeg)) {
+    const arr = Array.isArray(child) ? child.slice() : [];
+    const idx = Number(nextSeg);
+    arr[idx] = rest.length === 1 ? value : setValueAtPath(arr[idx] ?? {}, rest.slice(1), value);
+    return { ...root, [head]: arr };
+  }
+  return { ...root, [head]: setValueAtPath(child ?? {}, rest, value) };
+}
+
+export { apiInputsFromRunValues, fieldsForContract, inputDataFromWorkingMemory, outputsFromPipeOutput, rjsfDataFromRunValues, runValuesFromStore, setValueAtPath, storeInputDataFromRunValues };
+//# sourceMappingURL=chunk-WXBSM2CE.js.map
+//# sourceMappingURL=chunk-WXBSM2CE.js.map

package/dist/chunk-WXBSM2CE.js.map

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,99 @@
+import { prepareSchemaForRjsf } from './chunk-KFZ5MZOM.js';
+import { pruneEmptyOptionals, healStringWrappers } from './chunk-7BMOPXDY.js';
+import { isFilled, mustBeFilled, fieldFilled } from './chunk-PM55AHRO.js';
+import { buildRunFields } from './chunk-VMLXO5JS.js';
+import { inputMustBeFilled, isOptionalInput, isPluralInput } from './chunk-HARYEWNG.js';
+import { ownProp } from './chunk-V3OV2XQT.js';
+import { validateRunInputsSchema } from './chunk-VTPUDBSJ.js';
+
+// src/core/gate.ts
+function buildRunInputsSchema(inputs) {
+  const properties = {};
+  const required = [];
+  for (const [varName, input] of Object.entries(inputs)) {
+    const inputSchema = { ...input.json_schema };
+    inputSchema.title = varName;
+    if (input.concept_ref && input.concept_ref !== varName) {
+      inputSchema.description = input.concept_ref;
+    }
+    properties[varName] = inputSchema;
+    if (inputMustBeFilled(input)) required.push(varName);
+  }
+  return prepareSchemaForRjsf({ type: "object", properties, required });
+}
+function prepareRunInputs(data, schema) {
+  return pruneEmptyOptionals(healStringWrappers(data, schema), schema);
+}
+function validateRunInputs(preparedData, inputs, schema) {
+  const errors = validateRunInputsSchema(preparedData, schema);
+  if (errors.length === 0) return { isValid: true, missingInputs: [], errors: [] };
+  const record0 = typeof preparedData === "object" && preparedData !== null && !Array.isArray(preparedData) ? preparedData : void 0;
+  const missingInputs = [];
+  for (const [varName, input] of Object.entries(inputs)) {
+    if (!inputMustBeFilled(input)) continue;
+    const varData = ownProp(record0, varName);
+    if (varData == null) {
+      missingInputs.push(varName);
+      continue;
+    }
+    const inputSchema = input.json_schema;
+    const requiredFields = inputSchema.required || [];
+    if (requiredFields.length === 0) continue;
+    if (typeof varData !== "object") {
+      missingInputs.push(varName);
+      continue;
+    }
+    const record = varData;
+    if (requiredFields.some((f) => {
+      const child = ownProp(record, f);
+      return child === void 0 || child === "";
+    })) {
+      missingInputs.push(varName);
+    }
+  }
+  return { isValid: false, missingInputs, errors };
+}
+function apiInputsFromSchemaData(preparedData, inputs) {
+  const out = {};
+  for (const [varName, input] of Object.entries(inputs)) {
+    const raw = ownProp(preparedData, varName);
+    if (isOptionalInput(input) && !isFilled(raw)) continue;
+    if (isPluralInput(input) && !isFilled(raw)) {
+      out[varName] = [];
+      continue;
+    }
+    const content = isPluralInput(input) && !Array.isArray(raw) ? [] : raw;
+    out[varName] = { concept: input.concept_ref, content };
+  }
+  return out;
+}
+var SCHEMA_CACHE = /* @__PURE__ */ new WeakMap();
+function schemaForContract(contract) {
+  const cached = SCHEMA_CACHE.get(contract);
+  if (cached) return cached;
+  const schema = buildRunInputsSchema(contract.inputs);
+  SCHEMA_CACHE.set(contract, schema);
+  return schema;
+}
+function gateRunInputs(contract, data) {
+  const isRecord = typeof data === "object" && data !== null && !Array.isArray(data);
+  const payload = isRecord ? data : {};
+  const schema = schemaForContract(contract);
+  const preparedData = prepareRunInputs(payload, schema);
+  const verdict = validateRunInputs(isRecord ? preparedData : data, contract.inputs, schema);
+  if (!verdict.isValid) {
+    return {
+      ok: false,
+      missingInputs: verdict.missingInputs,
+      errors: verdict.errors,
+      preparedData
+    };
+  }
+  const missingInputs = buildRunFields(contract.inputs).filter((field) => mustBeFilled(field) || isFilled(ownProp(preparedData, field.name))).filter((field) => !fieldFilled(field, ownProp(preparedData, field.name))).map((field) => field.name);
+  if (missingInputs.length) return { ok: false, missingInputs, errors: [], preparedData };
+  return { ok: true, inputs: apiInputsFromSchemaData(preparedData, contract.inputs) };
+}
+
+export { apiInputsFromSchemaData, buildRunInputsSchema, gateRunInputs, prepareRunInputs, validateRunInputs };
+//# sourceMappingURL=chunk-XEPD5VJQ.js.map
+//# sourceMappingURL=chunk-XEPD5VJQ.js.map

package/dist/chunk-XEPD5VJQ.js.map

@@ -0,0 +1 @@
+{"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/contracts.d.ts

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

package/dist/core/contracts.js

@@ -0,0 +1,4 @@
+export { buildPipeRef, getPipeIOContract, inputMustBeFilled, isFixedCountInput, isOptionalInput, isPluralInput } from '../chunk-HARYEWNG.js';
+import '../chunk-V3OV2XQT.js';
+//# sourceMappingURL=contracts.js.map
+//# sourceMappingURL=contracts.js.map

package/dist/core/contracts.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"contracts.js"}

package/dist/core/date-format.d.ts

@@ -0,0 +1,87 @@
+/**
+ * Pure conversions between a stored date value and what a native `<input
+ * type="date">` shows, plus the leniency rules our schema validation uses.
+ * Kept React-free so both the runner's `DateField` and the RJSF `DateWidget`
+ * share one source of truth (and it's trivially unit-tested).
+ *
+ * Two schema shapes reach us, and they are NOT interchangeable:
+ *   - an MTHDS `type = "date"` structure field compiles to `format: date-time`,
+ *     so its value round-trips as a full RFC 3339 timestamp;
+ *   - `native.Date`'s own `date` field is a python `datetime.date`, i.e.
+ *     `format: date` - a bare `YYYY-MM-DD`.
+ *
+ * ## Why these rules exist
+ *
+ * The runtime (pydantic) is LENIENT in both directions, and our client used to
+ * be stricter than the contract it was enforcing: `ajv`'s stock `format: "date"`
+ * accepts a bare `YYYY-MM-DD` and nothing else, so a hand-written
+ * `"2026-07-06T00:00:00Z"` in an `inputs.json` was rejected here even though
+ * pydantic accepts it happily and coerces it to `date(2026, 7, 6)`. The run
+ * never even reached the runner. These predicates mirror pydantic exactly
+ * (measured, not assumed):
+ *
+ *   format: date       "2026-07-06"                -> date(2026, 7, 6)
+ *                      "2026-07-06T00:00:00Z"      -> date(2026, 7, 6)
+ *                      "2026-07-06T00:00:00+02:00" -> date(2026, 7, 6)   (literal date, no UTC shift)
+ *                      "2026-07-06T15:40:00Z"      -> REJECTED "should have zero time"
+ *   format: date-time  "2026-07-06"                -> datetime(2026, 7, 6, 0, 0)
+ *                      "2026-07-06T00:00:00Z"      -> datetime(2026, 7, 6, 0, 0, tz)
+ *
+ * A midnight-padded timestamp is unambiguously "just a day", so take it. A real
+ * time is data - refusing it is the point (`DateContentError`: "no silent
+ * midnight"), because silently dropping 15:40 corrupts the value. And an
+ * ambiguous `06/07/2026` is never accepted by anyone: 6 July or June 7 depends
+ * on who's reading, and guessing wrong fails silently.
+ */
+/**
+ * The calendar day a value denotes, or `null` when it doesn't denote one.
+ * Accepts a bare date or a midnight-padded timestamp; the day is taken
+ * LITERALLY from the string (never shifted through a timezone), matching
+ * pydantic - `2026-07-06T00:00:00+02:00` is 2026-07-06, not the 5th.
+ */
+declare function asCalendarDate(value: string): string | null;
+/**
+ * The calendar day inside a value that carries a REAL time - precisely the case
+ * `asCalendarDate` refuses. `null` when the value isn't a timestamp at all, or
+ * when it IS already an acceptable day (nothing to report).
+ *
+ * This exists to EXPLAIN, never to coerce. `2026-07-06T14:30:00+02:00` is
+ * rejected for a `format: date` field, and the rejection is right (DT3, "no
+ * silent midnight" - dropping 14:30 corrupts the value). But telling the user
+ * "pick a valid date" while the picker shows them a perfectly good 06/07/2026
+ * reads as a lie: `toDateInputValue` renders the day, the stored value carries
+ * the time, and only one of those is what gets validated. Naming both the value
+ * we hold and the day it would have to become is what makes the error legible.
+ */
+declare function dayWithinDateTime(value: string): string | null;
+/**
+ * What `format: "date"` accepts: a bare `YYYY-MM-DD`, and nothing else.
+ *
+ * DO NOT relax this to take a midnight-padded timestamp. `DateContent` in
+ * pipelex carries a `mode="before"` field validator (`_reject_lax_temporal`)
+ * that deliberately CLOSES pydantic's lax coercion for exactly this case:
+ *
+ *   "A Date's `date` field takes a calendar date alone; a string carrying a
+ *    time (e.g. '2026-07-07T00:00:00') would drop it - put the time and offset
+ *    in `time` instead."
+ *
+ * That rule (DT3, "no silent midnight") is the concept's whole point, so a
+ * lenient client here does not help anyone: it just forwards the value and the
+ * runner answers with a 500 instead of the field saying so up front.
+ *
+ * The leniency belongs in `asCalendarDate` - normalize the pasted timestamp to
+ * the day it denotes, then this passes. Accept-and-fix, not accept-and-forward.
+ */
+declare function isAcceptableDate(value: string): boolean;
+/** What `format: "date-time"` should accept - a bare day is midnight. */
+declare function isAcceptableDateTime(value: string): boolean;
+/** The `YYYY-MM-DD` a native date input shows, from any stored date/date-time. */
+declare function toDateInputValue(value: string | undefined): string;
+/**
+ * The value to store for a picked day. A `date-time` field becomes midnight-UTC
+ * (`2026-07-06T00:00:00Z`); a plain `date` field keeps the bare `YYYY-MM-DD`.
+ * An empty day clears the value.
+ */
+declare function toStoredDateValue(day: string, datetime: boolean): string | undefined;
+
+export { asCalendarDate, dayWithinDateTime, isAcceptableDate, isAcceptableDateTime, toDateInputValue, toStoredDateValue };