@narrative.io/jsonforms-provider-protocols 3.0.0-beta.2 → 3.0.0-beta.20

package/dist/core/initFormData.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Initialize a form data object from a JSON Schema.
+ * Resolves $ref, const, default, oneOf/discriminator, and typed empty values.
+ *
+ * Optional fields (not listed in the parent schema's `required` array) that
+ * have no `const`, no single-value `enum`, and no `default` are omitted
+ * entirely from the result. This avoids seeding values (e.g. `null` for
+ * `type: "integer"`) that fail AJV's type check and surface spurious errors
+ * on untouched fields. Required fields retain legacy typed-empty seeding
+ * (`""`, `null`, `false`, `[]`) so that "is required" surfaces cleanly.
+ *
+ * @param schema - The full JSON Schema (must include $defs if $refs are used)
+ * @param seed   - Optional existing data to merge (seed values take priority)
+ * @returns A data object with schema-defined fields initialized
+ */
+export declare function initFormDataFromSchema(schema: Record<string, unknown>, seed?: Record<string, unknown>): Record<string, unknown>;
+//# sourceMappingURL=initFormData.d.ts.map

package/dist/core/initFormData.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"initFormData.d.ts","sourceRoot":"","sources":["../../src/core/initFormData.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC/B,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC7B,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CA0BzB"}

package/dist/core/initFormData.js

@@ -0,0 +1,99 @@
+import { resolveRef } from "./refs.js";
+function initFormDataFromSchema(schema, seed) {
+  const result = initProperty(schema, schema, seed, true);
+  const base = result && typeof result === "object" && !Array.isArray(result) ? result : {};
+  if (seed && typeof seed === "object") {
+    const schemaKeys = new Set(
+      Object.keys(
+        resolveRef(schema, schema)?.properties ?? {}
+      )
+    );
+    for (const key of Object.keys(seed)) {
+      if (!schemaKeys.has(key) && !(key in base)) {
+        base[key] = seed[key];
+      }
+    }
+  }
+  return base;
+}
+function initProperty(property, root, seed, required) {
+  if (!property || typeof property !== "object") {
+    return required ? null : void 0;
+  }
+  const resolved = resolveRef(property, root);
+  const type = resolved.type;
+  const isOneOf = Array.isArray(resolved.oneOf);
+  if (seed !== void 0 && seed !== null && type !== "object" && !isOneOf) {
+    return seed;
+  }
+  if ("const" in resolved) {
+    return resolved.const;
+  }
+  if (Array.isArray(resolved.enum) && resolved.enum.length === 1) {
+    return resolved.enum[0];
+  }
+  if ("default" in resolved) {
+    return resolved.default;
+  }
+  if (isOneOf) {
+    const value = initOneOf(resolved, root, seed, required);
+    if (!required && (value === void 0 || value !== null && typeof value === "object" && !Array.isArray(value) && Object.keys(value).length === 0)) {
+      return void 0;
+    }
+    return value;
+  }
+  if (type === "object") {
+    const obj = initObject(
+      resolved,
+      root,
+      seed,
+      required
+    );
+    if (!required && Object.keys(obj).length === 0) return void 0;
+    return obj;
+  }
+  if (!required) return void 0;
+  switch (type) {
+    case "array":
+      return seed !== void 0 && seed !== null ? seed : [];
+    case "string":
+      return "";
+    case "boolean":
+      return false;
+    case "number":
+    case "integer":
+    default:
+      return null;
+  }
+}
+function initObject(schema, root, seed, parentRequired) {
+  const properties = schema.properties;
+  if (!properties) {
+    return seed && typeof seed === "object" ? { ...seed } : {};
+  }
+  const requiredSet = new Set(
+    Array.isArray(schema.required) ? schema.required : []
+  );
+  const result = {};
+  for (const [key, propSchema] of Object.entries(properties)) {
+    const seedValue = seed && typeof seed === "object" ? seed[key] : void 0;
+    const effectiveRequired = parentRequired && requiredSet.has(key);
+    const value = initProperty(propSchema, root, seedValue, effectiveRequired);
+    if (value !== void 0) {
+      result[key] = value;
+    }
+  }
+  return result;
+}
+function initOneOf(schema, root, seed, required) {
+  const variants = schema.oneOf;
+  if (!variants || variants.length === 0) return required ? null : void 0;
+  const first = variants[0];
+  if (!first) return required ? null : void 0;
+  const firstVariant = resolveRef(first, root);
+  return initProperty(firstVariant, root, seed, required);
+}
+export {
+  initFormDataFromSchema
+};
+//# sourceMappingURL=initFormData.js.map

package/dist/core/initFormData.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"initFormData.js","sources":["../../src/core/initFormData.ts"],"sourcesContent":["/**\n * Initialize a form data object from a JSON Schema.\n * Resolves $ref, const, default, oneOf/discriminator, and typed empty values.\n *\n * Optional fields (not listed in the parent schema's `required` array) that\n * have no `const`, no single-value `enum`, and no `default` are omitted\n * entirely from the result. This avoids seeding values (e.g. `null` for\n * `type: \"integer\"`) that fail AJV's type check and surface spurious errors\n * on untouched fields. Required fields retain legacy typed-empty seeding\n * (`\"\"`, `null`, `false`, `[]`) so that \"is required\" surfaces cleanly.\n *\n * @param schema - The full JSON Schema (must include $defs if $refs are used)\n * @param seed   - Optional existing data to merge (seed values take priority)\n * @returns A data object with schema-defined fields initialized\n */\nexport function initFormDataFromSchema(\n  schema: Record<string, unknown>,\n  seed?: Record<string, unknown>,\n): Record<string, unknown> {\n  const result = initProperty(schema, schema, seed, true) as\n    | Record<string, unknown>\n    | undefined;\n\n  const base =\n    result && typeof result === \"object\" && !Array.isArray(result)\n      ? result\n      : {};\n\n  // Preserve seed keys not described by the schema's properties.\n  if (seed && typeof seed === \"object\") {\n    const schemaKeys = new Set(\n      Object.keys(\n        (resolveRef(schema, schema) as Record<string, unknown>)?.properties ??\n          {},\n      ),\n    );\n    for (const key of Object.keys(seed)) {\n      if (!schemaKeys.has(key) && !(key in base)) {\n        base[key] = seed[key];\n      }\n    }\n  }\n\n  return base;\n}\n\nimport { resolveRef } from \"./refs\";\n\n/**\n * Initialize a single property value based on its schema definition.\n * Returns `undefined` when the property is optional and has nothing\n * concrete to seed — the caller then omits the key from its result.\n */\nfunction initProperty(\n  property: Record<string, unknown>,\n  root: Record<string, unknown>,\n  seed: unknown,\n  required: boolean,\n): unknown {\n  if (!property || typeof property !== \"object\") {\n    return required ? null : undefined;\n  }\n\n  const resolved = resolveRef(property, root);\n  const type = resolved.type as string | undefined;\n  const isOneOf = Array.isArray(resolved.oneOf);\n\n  // Priority 1: seed wins for non-object, non-oneOf types. For oneOf we still\n  // descend so that a partial seed (e.g. `{value: 5}` missing the\n  // discriminator) picks up the variant's const/default for untouched fields.\n  if (seed !== undefined && seed !== null && type !== \"object\" && !isOneOf) {\n    return seed;\n  }\n\n  // Priority 2: const (schema-invariant — always set).\n  if (\"const\" in resolved) {\n    return resolved.const;\n  }\n\n  // Priority 3: single-value enum (same reasoning — only one valid value).\n  if (\n    Array.isArray(resolved.enum) &&\n    (resolved.enum as unknown[]).length === 1\n  ) {\n    return (resolved.enum as unknown[])[0];\n  }\n\n  // Priority 4: default (explicit author intent — always honored).\n  if (\"default\" in resolved) {\n    return resolved.default;\n  }\n\n  // Priority 5: oneOf. Recurse into the first variant, propagating the\n  // `required` flag so that the variant's own schema-declared required fields\n  // only get typed-empty seeding when the container is required. For optional\n  // containers, the variant's const / default / single-value enum still seed\n  // (author intent is unconditional) but typed-empty placeholders do not.\n  // If recursion yields nothing forced, we collapse back to undefined.\n  if (isOneOf) {\n    const value = initOneOf(resolved, root, seed, required);\n    if (\n      !required &&\n      (value === undefined ||\n        (value !== null &&\n          typeof value === \"object\" &&\n          !Array.isArray(value) &&\n          Object.keys(value as Record<string, unknown>).length === 0))\n    ) {\n      return undefined;\n    }\n    return value;\n  }\n\n  // Priority 6: objects recurse. The `required` flag propagates downward:\n  // inside an optional ancestor, nested required primitives also collapse,\n  // so an optional object with nested required fields stays absent instead\n  // of materializing a shell that AJV would flag.\n  if (type === \"object\") {\n    const obj = initObject(\n      resolved,\n      root,\n      seed as Record<string, unknown>,\n      required,\n    );\n    if (!required && Object.keys(obj).length === 0) return undefined;\n    return obj;\n  }\n\n  // Priority 7: optional primitives — omit.\n  if (!required) return undefined;\n\n  // Priority 8: required primitives — legacy typed empty.\n  switch (type) {\n    case \"array\":\n      return seed !== undefined && seed !== null ? seed : [];\n    case \"string\":\n      return \"\";\n    case \"boolean\":\n      return false;\n    case \"number\":\n    case \"integer\":\n    default:\n      return null;\n  }\n}\n\n/**\n * Initialize an object type by recursing into its properties.\n * Keys whose initialization returns `undefined` are omitted.\n *\n * `parentRequired` controls how schema.required propagates: a child is\n * treated as required only if both its parent is required AND it appears in\n * the parent's required array. Inside an optional ancestor the whole\n * subtree collapses (except for author-forced values: const, default,\n * single-value enum, or seeded values).\n */\nfunction initObject(\n  schema: Record<string, unknown>,\n  root: Record<string, unknown>,\n  seed: Record<string, unknown> | undefined,\n  parentRequired: boolean,\n): Record<string, unknown> {\n  const properties = schema.properties as\n    | Record<string, Record<string, unknown>>\n    | undefined;\n  if (!properties) {\n    return seed && typeof seed === \"object\" ? { ...seed } : {};\n  }\n\n  const requiredSet = new Set<string>(\n    Array.isArray(schema.required) ? (schema.required as string[]) : [],\n  );\n\n  const result: Record<string, unknown> = {};\n\n  for (const [key, propSchema] of Object.entries(properties)) {\n    const seedValue = seed && typeof seed === \"object\" ? seed[key] : undefined;\n    const effectiveRequired = parentRequired && requiredSet.has(key);\n    const value = initProperty(propSchema, root, seedValue, effectiveRequired);\n    if (value !== undefined) {\n      result[key] = value;\n    }\n  }\n\n  return result;\n}\n\n/**\n * Handle oneOf schemas — pick the first variant and initialize it.\n * `required` propagates: if the outer oneOf is required, the variant is\n * materialized with typed-empty seeding for its required fields; if optional,\n * only author-forced values (const / default / single-enum / seed) survive.\n */\nfunction initOneOf(\n  schema: Record<string, unknown>,\n  root: Record<string, unknown>,\n  seed: unknown,\n  required: boolean,\n): unknown {\n  const variants = schema.oneOf as Record<string, unknown>[];\n  if (!variants || variants.length === 0) return required ? null : undefined;\n\n  const first = variants[0];\n  if (!first) return required ? null : undefined;\n\n  const firstVariant = resolveRef(first, root);\n  return initProperty(firstVariant, root, seed, required);\n}\n"],"names":[],"mappings":";AAeO,SAAS,uBACd,QACA,MACyB;AACzB,QAAM,SAAS,aAAa,QAAQ,QAAQ,MAAM,IAAI;AAItD,QAAM,OACJ,UAAU,OAAO,WAAW,YAAY,CAAC,MAAM,QAAQ,MAAM,IACzD,SACA,CAAA;AAGN,MAAI,QAAQ,OAAO,SAAS,UAAU;AACpC,UAAM,aAAa,IAAI;AAAA,MACrB,OAAO;AAAA,QACJ,WAAW,QAAQ,MAAM,GAA+B,cACvD,CAAA;AAAA,MAAC;AAAA,IACL;AAEF,eAAW,OAAO,OAAO,KAAK,IAAI,GAAG;AACnC,UAAI,CAAC,WAAW,IAAI,GAAG,KAAK,EAAE,OAAO,OAAO;AAC1C,aAAK,GAAG,IAAI,KAAK,GAAG;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAAS,aACP,UACA,MACA,MACA,UACS;AACT,MAAI,CAAC,YAAY,OAAO,aAAa,UAAU;AAC7C,WAAO,WAAW,OAAO;AAAA,EAC3B;AAEA,QAAM,WAAW,WAAW,UAAU,IAAI;AAC1C,QAAM,OAAO,SAAS;AACtB,QAAM,UAAU,MAAM,QAAQ,SAAS,KAAK;AAK5C,MAAI,SAAS,UAAa,SAAS,QAAQ,SAAS,YAAY,CAAC,SAAS;AACxE,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,UAAU;AACvB,WAAO,SAAS;AAAA,EAClB;AAGA,MACE,MAAM,QAAQ,SAAS,IAAI,KAC1B,SAAS,KAAmB,WAAW,GACxC;AACA,WAAQ,SAAS,KAAmB,CAAC;AAAA,EACvC;AAGA,MAAI,aAAa,UAAU;AACzB,WAAO,SAAS;AAAA,EAClB;AAQA,MAAI,SAAS;AACX,UAAM,QAAQ,UAAU,UAAU,MAAM,MAAM,QAAQ;AACtD,QACE,CAAC,aACA,UAAU,UACR,UAAU,QACT,OAAO,UAAU,YACjB,CAAC,MAAM,QAAQ,KAAK,KACpB,OAAO,KAAK,KAAgC,EAAE,WAAW,IAC7D;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAMA,MAAI,SAAS,UAAU;AACrB,UAAM,MAAM;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAEF,QAAI,CAAC,YAAY,OAAO,KAAK,GAAG,EAAE,WAAW,EAAG,QAAO;AACvD,WAAO;AAAA,EACT;AAGA,MAAI,CAAC,SAAU,QAAO;AAGtB,UAAQ,MAAA;AAAA,IACN,KAAK;AACH,aAAO,SAAS,UAAa,SAAS,OAAO,OAAO,CAAA;AAAA,IACtD,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AAAA,IACL;AACE,aAAO;AAAA,EAAA;AAEb;AAYA,SAAS,WACP,QACA,MACA,MACA,gBACyB;AACzB,QAAM,aAAa,OAAO;AAG1B,MAAI,CAAC,YAAY;AACf,WAAO,QAAQ,OAAO,SAAS,WAAW,EAAE,GAAG,KAAA,IAAS,CAAA;AAAA,EAC1D;AAEA,QAAM,cAAc,IAAI;AAAA,IACtB,MAAM,QAAQ,OAAO,QAAQ,IAAK,OAAO,WAAwB,CAAA;AAAA,EAAC;AAGpE,QAAM,SAAkC,CAAA;AAExC,aAAW,CAAC,KAAK,UAAU,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC1D,UAAM,YAAY,QAAQ,OAAO,SAAS,WAAW,KAAK,GAAG,IAAI;AACjE,UAAM,oBAAoB,kBAAkB,YAAY,IAAI,GAAG;AAC/D,UAAM,QAAQ,aAAa,YAAY,MAAM,WAAW,iBAAiB;AACzE,QAAI,UAAU,QAAW;AACvB,aAAO,GAAG,IAAI;AAAA,IAChB;AAAA,EACF;AAEA,SAAO;AACT;AAQA,SAAS,UACP,QACA,MACA,MACA,UACS;AACT,QAAM,WAAW,OAAO;AACxB,MAAI,CAAC,YAAY,SAAS,WAAW,EAAG,QAAO,WAAW,OAAO;AAEjE,QAAM,QAAQ,SAAS,CAAC;AACxB,MAAI,CAAC,MAAO,QAAO,WAAW,OAAO;AAErC,QAAM,eAAe,WAAW,OAAO,IAAI;AAC3C,SAAO,aAAa,cAAc,MAAM,MAAM,QAAQ;AACxD;"}

package/dist/core/projection.d.ts

@@ -27,6 +27,10 @@ export declare function setProjectedValue(data: unknown, path: string, value: un
  * Resolve the schema at the projected path.
  * Numeric segments traverse into `items` (array item schema).
  * String segments traverse into `properties[segment]`.
+ *
+ * Dereferences `$ref` nodes transparently at every step, and falls through
+ * to `oneOf` / `anyOf` / `allOf` branches when a segment can't resolve
+ * directly — picks the first branch that satisfies the navigation.
  */
 export declare function getProjectedSchema(schema: Record<string, any>, path: string): Record<string, any>;
 //# sourceMappingURL=projection.d.ts.map

package/dist/core/projection.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"projection.d.ts","sourceRoot":"","sources":["../../src/core/projection.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,MAAM,MAAM,iBAAiB,GAAG,MAAM,GAAG,MAAM,CAAC;AAEhD;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,iBAAiB,EAAE,CAMrE;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,OAAO,EACb,IAAI,EAAE,MAAM,GACX,OAAO,CAiBT;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,OAAO,EACb,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,OAAO,GACb,OAAO,CAGT;AAkCD;;;;GAIG;AACH,wBAAgB,kBAAkB,CAEhC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAC3B,IAAI,EAAE,MAAM,GAEX,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CA8BrB"}
+{"version":3,"file":"projection.d.ts","sourceRoot":"","sources":["../../src/core/projection.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AAEH,MAAM,MAAM,iBAAiB,GAAG,MAAM,GAAG,MAAM,CAAC;AAEhD;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,iBAAiB,EAAE,CAMrE;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAiBtE;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,OAAO,EACb,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,OAAO,GACb,OAAO,CAGT;AAqCD;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAEhC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAC3B,IAAI,EAAE,MAAM,GAEX,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAmCrB"}

package/dist/core/projection.js

@@ -1,3 +1,4 @@
+import { deref, tryCombinatorBranches } from "./refs.js";
 function parseProjectionPath(path) {
   if (!path) return [];
   return path.split(".").map((s) => {
@@ -46,24 +47,26 @@ function getProjectedSchema(schema, path) {
   const segments = parseProjectionPath(path);
   let current = schema;
   for (const seg of segments) {
+    current = deref(current, schema);
     if (!current) return {};
-    if (typeof seg === "number") {
-      const items = current.items;
-      if (items && typeof items === "object") {
-        current = items;
-      } else {
-        return {};
-      }
-    } else {
-      const properties = current.properties;
-      if (properties && properties[seg]) {
-        current = properties[seg];
-      } else {
-        return {};
+    const navigate = (node) => {
+      if (typeof seg === "number") {
+        const items = node.items;
+        return items && typeof items === "object" ? items : void 0;
       }
+      const properties = node.properties;
+      if (properties && properties[seg]) return properties[seg];
+      return void 0;
+    };
+    let next = navigate(current);
+    if (next === void 0) {
+      next = tryCombinatorBranches(current, schema, navigate);
     }
+    if (!next) return {};
+    current = next;
   }
-  return current;
+  const resolved = deref(current, schema);
+  return resolved ?? {};
 }
 export {
   getProjectedSchema,

package/dist/core/projection.js.map

@@ -1 +1 @@
-{"version":3,"file":"projection.js","sources":["../../src/core/projection.ts"],"sourcesContent":["/**\n * Projection utilities for navigating complex data structures\n * through a dot-separated path where numeric segments are array indices.\n *\n * Examples:\n *   \"0\"                → first element of an array\n *   \"include\"          → the `include` property of an object\n *   \"0.video_rate_usd\" → nested property inside the first array element\n */\n\nexport type ProjectionSegment = string | number;\n\n/**\n * Parse a projection path string into typed segments.\n * Numeric strings become numbers (array indices), others stay as strings (object keys).\n */\nexport function parseProjectionPath(path: string): ProjectionSegment[] {\n  if (!path) return [];\n  return path.split(\".\").map((s) => {\n    const n = Number(s);\n    return Number.isInteger(n) && n >= 0 ? n : s;\n  });\n}\n\n/**\n * Read a value from `data` by following the projection path.\n * Returns `undefined` if any segment along the path is missing.\n */\nexport function getProjectedValue(\n  data: unknown,\n  path: string,\n): unknown {\n  const segments = parseProjectionPath(path);\n  let current: unknown = data;\n\n  for (const seg of segments) {\n    if (current === null || current === undefined) return undefined;\n\n    if (typeof seg === \"number\") {\n      if (!Array.isArray(current)) return undefined;\n      current = current[seg];\n    } else {\n      if (typeof current !== \"object\") return undefined;\n      current = (current as Record<string, unknown>)[seg];\n    }\n  }\n\n  return current;\n}\n\n/**\n * Immutably set a value at the projection path, preserving all sibling data.\n * Constructs missing intermediate structures (arrays for numeric segments, objects for string segments).\n */\nexport function setProjectedValue(\n  data: unknown,\n  path: string,\n  value: unknown,\n): unknown {\n  const segments = parseProjectionPath(path);\n  return setAtPath(data, segments, 0, value);\n}\n\nfunction setAtPath(\n  current: unknown,\n  segments: ProjectionSegment[],\n  index: number,\n  value: unknown,\n): unknown {\n  if (index === segments.length) {\n    return value;\n  }\n\n  const seg = segments[index]!;\n\n  if (typeof seg === \"number\") {\n    // Array index — ensure we have an array\n    const arr = Array.isArray(current) ? [...current] : [];\n    // Pad array if index is out of bounds\n    while (arr.length <= seg) {\n      arr.push(undefined);\n    }\n    arr[seg] = setAtPath(arr[seg], segments, index + 1, value);\n    return arr;\n  } else {\n    // Object key — ensure we have an object\n    const obj: Record<string, unknown> =\n      current !== null && current !== undefined && typeof current === \"object\" && !Array.isArray(current)\n        ? { ...(current as Record<string, unknown>) }\n        : {};\n    obj[seg] = setAtPath(obj[seg], segments, index + 1, value);\n    return obj;\n  }\n}\n\n/**\n * Resolve the schema at the projected path.\n * Numeric segments traverse into `items` (array item schema).\n * String segments traverse into `properties[segment]`.\n */\nexport function getProjectedSchema(\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  schema: Record<string, any>,\n  path: string,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n): Record<string, any> {\n  const segments = parseProjectionPath(path);\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  let current: Record<string, any> = schema;\n\n  for (const seg of segments) {\n    if (!current) return {};\n\n    if (typeof seg === \"number\") {\n      // Array index → traverse into items schema\n      const items = current.items;\n      if (items && typeof items === \"object\") {\n        current = items as Record<string, unknown>;\n      } else {\n        return {};\n      }\n    } else {\n      // Object key → traverse into properties[key]\n      const properties = current.properties as\n        | Record<string, Record<string, unknown>>\n        | undefined;\n      if (properties && properties[seg]) {\n        current = properties[seg];\n      } else {\n        return {};\n      }\n    }\n  }\n\n  return current;\n}\n"],"names":[],"mappings":"AAgBO,SAAS,oBAAoB,MAAmC;AACrE,MAAI,CAAC,KAAM,QAAO,CAAA;AAClB,SAAO,KAAK,MAAM,GAAG,EAAE,IAAI,CAAC,MAAM;AAChC,UAAM,IAAI,OAAO,CAAC;AAClB,WAAO,OAAO,UAAU,CAAC,KAAK,KAAK,IAAI,IAAI;AAAA,EAC7C,CAAC;AACH;AAMO,SAAS,kBACd,MACA,MACS;AACT,QAAM,WAAW,oBAAoB,IAAI;AACzC,MAAI,UAAmB;AAEvB,aAAW,OAAO,UAAU;AAC1B,QAAI,YAAY,QAAQ,YAAY,OAAW,QAAO;AAEtD,QAAI,OAAO,QAAQ,UAAU;AAC3B,UAAI,CAAC,MAAM,QAAQ,OAAO,EAAG,QAAO;AACpC,gBAAU,QAAQ,GAAG;AAAA,IACvB,OAAO;AACL,UAAI,OAAO,YAAY,SAAU,QAAO;AACxC,gBAAW,QAAoC,GAAG;AAAA,IACpD;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,kBACd,MACA,MACA,OACS;AACT,QAAM,WAAW,oBAAoB,IAAI;AACzC,SAAO,UAAU,MAAM,UAAU,GAAG,KAAK;AAC3C;AAEA,SAAS,UACP,SACA,UACA,OACA,OACS;AACT,MAAI,UAAU,SAAS,QAAQ;AAC7B,WAAO;AAAA,EACT;AAEA,QAAM,MAAM,SAAS,KAAK;AAE1B,MAAI,OAAO,QAAQ,UAAU;AAE3B,UAAM,MAAM,MAAM,QAAQ,OAAO,IAAI,CAAC,GAAG,OAAO,IAAI,CAAA;AAEpD,WAAO,IAAI,UAAU,KAAK;AACxB,UAAI,KAAK,MAAS;AAAA,IACpB;AACA,QAAI,GAAG,IAAI,UAAU,IAAI,GAAG,GAAG,UAAU,QAAQ,GAAG,KAAK;AACzD,WAAO;AAAA,EACT,OAAO;AAEL,UAAM,MACJ,YAAY,QAAQ,YAAY,UAAa,OAAO,YAAY,YAAY,CAAC,MAAM,QAAQ,OAAO,IAC9F,EAAE,GAAI,QAAA,IACN,CAAA;AACN,QAAI,GAAG,IAAI,UAAU,IAAI,GAAG,GAAG,UAAU,QAAQ,GAAG,KAAK;AACzD,WAAO;AAAA,EACT;AACF;AAOO,SAAS,mBAEd,QACA,MAEqB;AACrB,QAAM,WAAW,oBAAoB,IAAI;AAEzC,MAAI,UAA+B;AAEnC,aAAW,OAAO,UAAU;AAC1B,QAAI,CAAC,QAAS,QAAO,CAAA;AAErB,QAAI,OAAO,QAAQ,UAAU;AAE3B,YAAM,QAAQ,QAAQ;AACtB,UAAI,SAAS,OAAO,UAAU,UAAU;AACtC,kBAAU;AAAA,MACZ,OAAO;AACL,eAAO,CAAA;AAAA,MACT;AAAA,IACF,OAAO;AAEL,YAAM,aAAa,QAAQ;AAG3B,UAAI,cAAc,WAAW,GAAG,GAAG;AACjC,kBAAU,WAAW,GAAG;AAAA,MAC1B,OAAO;AACL,eAAO,CAAA;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;"}
+{"version":3,"file":"projection.js","sources":["../../src/core/projection.ts"],"sourcesContent":["import { deref as derefSchema, tryCombinatorBranches } from \"./refs\";\n\n/**\n * Projection utilities for navigating complex data structures\n * through a dot-separated path where numeric segments are array indices.\n *\n * Examples:\n *   \"0\"                → first element of an array\n *   \"include\"          → the `include` property of an object\n *   \"0.video_rate_usd\" → nested property inside the first array element\n */\n\nexport type ProjectionSegment = string | number;\n\n/**\n * Parse a projection path string into typed segments.\n * Numeric strings become numbers (array indices), others stay as strings (object keys).\n */\nexport function parseProjectionPath(path: string): ProjectionSegment[] {\n  if (!path) return [];\n  return path.split(\".\").map((s) => {\n    const n = Number(s);\n    return Number.isInteger(n) && n >= 0 ? n : s;\n  });\n}\n\n/**\n * Read a value from `data` by following the projection path.\n * Returns `undefined` if any segment along the path is missing.\n */\nexport function getProjectedValue(data: unknown, path: string): unknown {\n  const segments = parseProjectionPath(path);\n  let current: unknown = data;\n\n  for (const seg of segments) {\n    if (current === null || current === undefined) return undefined;\n\n    if (typeof seg === \"number\") {\n      if (!Array.isArray(current)) return undefined;\n      current = current[seg];\n    } else {\n      if (typeof current !== \"object\") return undefined;\n      current = (current as Record<string, unknown>)[seg];\n    }\n  }\n\n  return current;\n}\n\n/**\n * Immutably set a value at the projection path, preserving all sibling data.\n * Constructs missing intermediate structures (arrays for numeric segments, objects for string segments).\n */\nexport function setProjectedValue(\n  data: unknown,\n  path: string,\n  value: unknown,\n): unknown {\n  const segments = parseProjectionPath(path);\n  return setAtPath(data, segments, 0, value);\n}\n\nfunction setAtPath(\n  current: unknown,\n  segments: ProjectionSegment[],\n  index: number,\n  value: unknown,\n): unknown {\n  if (index === segments.length) {\n    return value;\n  }\n\n  const seg = segments[index]!;\n\n  if (typeof seg === \"number\") {\n    // Array index — ensure we have an array\n    const arr = Array.isArray(current) ? [...current] : [];\n    // Pad array if index is out of bounds\n    while (arr.length <= seg) {\n      arr.push(undefined);\n    }\n    arr[seg] = setAtPath(arr[seg], segments, index + 1, value);\n    return arr;\n  } else {\n    // Object key — ensure we have an object\n    const obj: Record<string, unknown> =\n      current !== null &&\n      current !== undefined &&\n      typeof current === \"object\" &&\n      !Array.isArray(current)\n        ? { ...(current as Record<string, unknown>) }\n        : {};\n    obj[seg] = setAtPath(obj[seg], segments, index + 1, value);\n    return obj;\n  }\n}\n\n/**\n * Resolve the schema at the projected path.\n * Numeric segments traverse into `items` (array item schema).\n * String segments traverse into `properties[segment]`.\n *\n * Dereferences `$ref` nodes transparently at every step, and falls through\n * to `oneOf` / `anyOf` / `allOf` branches when a segment can't resolve\n * directly — picks the first branch that satisfies the navigation.\n */\nexport function getProjectedSchema(\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  schema: Record<string, any>,\n  path: string,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n): Record<string, any> {\n  const segments = parseProjectionPath(path);\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  let current: Record<string, any> | undefined = schema;\n\n  for (const seg of segments) {\n    current = derefSchema(current, schema);\n    if (!current) return {};\n\n    const navigate = (\n      node: Record<string, unknown>,\n    ): Record<string, unknown> | undefined => {\n      if (typeof seg === \"number\") {\n        const items = (node as { items?: unknown }).items;\n        return items && typeof items === \"object\"\n          ? (items as Record<string, unknown>)\n          : undefined;\n      }\n      const properties = (node as { properties?: unknown }).properties as\n        | Record<string, Record<string, unknown>>\n        | undefined;\n      if (properties && properties[seg]) return properties[seg];\n      return undefined;\n    };\n\n    let next = navigate(current);\n    if (next === undefined) {\n      next = tryCombinatorBranches(current, schema, navigate);\n    }\n    if (!next) return {};\n    current = next;\n  }\n\n  const resolved = derefSchema(current, schema);\n  return resolved ?? {};\n}\n"],"names":["derefSchema"],"mappings":";AAkBO,SAAS,oBAAoB,MAAmC;AACrE,MAAI,CAAC,KAAM,QAAO,CAAA;AAClB,SAAO,KAAK,MAAM,GAAG,EAAE,IAAI,CAAC,MAAM;AAChC,UAAM,IAAI,OAAO,CAAC;AAClB,WAAO,OAAO,UAAU,CAAC,KAAK,KAAK,IAAI,IAAI;AAAA,EAC7C,CAAC;AACH;AAMO,SAAS,kBAAkB,MAAe,MAAuB;AACtE,QAAM,WAAW,oBAAoB,IAAI;AACzC,MAAI,UAAmB;AAEvB,aAAW,OAAO,UAAU;AAC1B,QAAI,YAAY,QAAQ,YAAY,OAAW,QAAO;AAEtD,QAAI,OAAO,QAAQ,UAAU;AAC3B,UAAI,CAAC,MAAM,QAAQ,OAAO,EAAG,QAAO;AACpC,gBAAU,QAAQ,GAAG;AAAA,IACvB,OAAO;AACL,UAAI,OAAO,YAAY,SAAU,QAAO;AACxC,gBAAW,QAAoC,GAAG;AAAA,IACpD;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,kBACd,MACA,MACA,OACS;AACT,QAAM,WAAW,oBAAoB,IAAI;AACzC,SAAO,UAAU,MAAM,UAAU,GAAG,KAAK;AAC3C;AAEA,SAAS,UACP,SACA,UACA,OACA,OACS;AACT,MAAI,UAAU,SAAS,QAAQ;AAC7B,WAAO;AAAA,EACT;AAEA,QAAM,MAAM,SAAS,KAAK;AAE1B,MAAI,OAAO,QAAQ,UAAU;AAE3B,UAAM,MAAM,MAAM,QAAQ,OAAO,IAAI,CAAC,GAAG,OAAO,IAAI,CAAA;AAEpD,WAAO,IAAI,UAAU,KAAK;AACxB,UAAI,KAAK,MAAS;AAAA,IACpB;AACA,QAAI,GAAG,IAAI,UAAU,IAAI,GAAG,GAAG,UAAU,QAAQ,GAAG,KAAK;AACzD,WAAO;AAAA,EACT,OAAO;AAEL,UAAM,MACJ,YAAY,QACZ,YAAY,UACZ,OAAO,YAAY,YACnB,CAAC,MAAM,QAAQ,OAAO,IAClB,EAAE,GAAI,QAAA,IACN,CAAA;AACN,QAAI,GAAG,IAAI,UAAU,IAAI,GAAG,GAAG,UAAU,QAAQ,GAAG,KAAK;AACzD,WAAO;AAAA,EACT;AACF;AAWO,SAAS,mBAEd,QACA,MAEqB;AACrB,QAAM,WAAW,oBAAoB,IAAI;AAEzC,MAAI,UAA2C;AAE/C,aAAW,OAAO,UAAU;AAC1B,cAAUA,MAAY,SAAS,MAAM;AACrC,QAAI,CAAC,QAAS,QAAO,CAAA;AAErB,UAAM,WAAW,CACf,SACwC;AACxC,UAAI,OAAO,QAAQ,UAAU;AAC3B,cAAM,QAAS,KAA6B;AAC5C,eAAO,SAAS,OAAO,UAAU,WAC5B,QACD;AAAA,MACN;AACA,YAAM,aAAc,KAAkC;AAGtD,UAAI,cAAc,WAAW,GAAG,EAAG,QAAO,WAAW,GAAG;AACxD,aAAO;AAAA,IACT;AAEA,QAAI,OAAO,SAAS,OAAO;AAC3B,QAAI,SAAS,QAAW;AACtB,aAAO,sBAAsB,SAAS,QAAQ,QAAQ;AAAA,IACxD;AACA,QAAI,CAAC,KAAM,QAAO,CAAA;AAClB,cAAU;AAAA,EACZ;AAEA,QAAM,WAAWA,MAAY,SAAS,MAAM;AAC5C,SAAO,YAAY,CAAA;AACrB;"}

package/dist/core/refs.d.ts

@@ -0,0 +1,58 @@
+/**
+ * JSON Schema $ref resolution helpers.
+ *
+ * Supports the pointer grammar used across consumer schemas:
+ *   - "#/$defs/Name"
+ *   - "#/properties/foo/items"
+ *
+ * External refs (URIs, file refs) are intentionally out of scope. A ref that
+ * doesn't resolve leaves the node untouched — callers can still inspect the
+ * unresolved `$ref` for debugging.
+ */
+/**
+ * Resolve a JSON pointer (`#/a/b/c`) against an object. Returns the node at
+ * that path, or `undefined` if any segment is missing or the pointer doesn't
+ * start with `#/`.
+ */
+export declare function resolvePointer(obj: Record<string, unknown>, pointer: string): unknown;
+/**
+ * Dereference a schema node along a chain of `$ref`s. Follows `A → B → C`
+ * transitively. A cycle (same `$ref` seen twice in one chain) returns the
+ * last unresolved node rather than hanging. An unresolvable pointer returns
+ * the current node unchanged.
+ */
+export declare function resolveRef(property: Record<string, unknown>, root: Record<string, unknown>, seen?: Set<string>): Record<string, unknown>;
+/**
+ * Convenience wrapper around `resolveRef` that starts a fresh cycle-detection
+ * set. Intended for schema walkers that need to dereference at every step;
+ * each call is an independent resolution.
+ */
+export declare function deref(node: Record<string, any> | undefined, root: Record<string, any>): Record<string, any> | undefined;
+/**
+ * Try to navigate a segment through a schema node's combinator branches
+ * (`oneOf` / `anyOf` / `allOf`) when direct navigation has failed.
+ *
+ * Semantics: for walker purposes (renderer-tester matching), we only need
+ * ONE concrete schema that satisfies the next navigation step. First-match
+ * by structural shape wins, same convention as `initOneOf` uses for seeding.
+ *
+ * @param node     the schema node to search (already dereffed by caller)
+ * @param root     the root schema, for dereferencing branch `$ref`s
+ * @param tryFn    predicate that attempts navigation on a candidate branch
+ *                 and returns the navigated value, or `undefined` if the
+ *                 branch doesn't have what the caller's looking for
+ * @param depth    recursion depth (capped at `COMBINATOR_DEPTH_LIMIT`)
+ */
+export declare function tryCombinatorBranches<T>(node: Record<string, any> | undefined, root: Record<string, any>, tryFn: (candidate: Record<string, any>) => T | undefined, depth?: number): T | undefined;
+/**
+ * Recursively dereference every `$ref` in a schema subtree, producing a
+ * concrete schema with no remaining refs. Cycles along any single chain are
+ * handled by leaving the first recursion back into a seen ref as the
+ * unresolved node — matching `resolveRef`'s semantics.
+ *
+ * Intended for use at API boundaries (e.g. `resolveScopeSchema`'s return)
+ * so downstream walkers can operate on self-contained schemas without
+ * needing the original root.
+ */
+export declare function deepDeref(node: any, root: Record<string, any>, seen?: Set<string>): any;
+//# sourceMappingURL=refs.d.ts.map

package/dist/core/refs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"refs.d.ts","sourceRoot":"","sources":["../../src/core/refs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC5B,OAAO,EAAE,MAAM,GACd,OAAO,CAYT;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CACxB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACjC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC7B,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GACjB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAczB;AAED;;;;GAIG;AACH,wBAAgB,KAAK,CAEnB,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,SAAS,EAErC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAExB,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,SAAS,CAGjC;AASD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAErC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,SAAS,EAErC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAEzB,KAAK,EAAE,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,SAAS,EACxD,KAAK,SAAI,GACR,CAAC,GAAG,SAAS,CAoBf;AAED;;;;;;;;;GASG;AACH,wBAAgB,SAAS,CAEvB,IAAI,EAAE,GAAG,EAET,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EACzB,IAAI,GAAE,GAAG,CAAC,MAAM,CAAa,GAE5B,GAAG,CAoBL"}

package/dist/core/refs.js

@@ -0,0 +1,70 @@
+function resolvePointer(obj, pointer) {
+  if (!pointer.startsWith("#/")) return void 0;
+  const parts = pointer.slice(2).split("/");
+  let current = obj;
+  for (const part of parts) {
+    if (current && typeof current === "object" && part in current) {
+      current = current[part];
+    } else {
+      return void 0;
+    }
+  }
+  return current;
+}
+function resolveRef(property, root, seen) {
+  if (!property || typeof property !== "object") return property;
+  const ref = property.$ref;
+  if (!ref) return property;
+  const visited = seen ?? /* @__PURE__ */ new Set();
+  if (visited.has(ref)) return property;
+  visited.add(ref);
+  const resolved = resolvePointer(root, ref);
+  if (!resolved) return property;
+  return resolveRef(resolved, root, visited);
+}
+function deref(node, root) {
+  if (!node || typeof node !== "object") return node;
+  return resolveRef(node, root);
+}
+const COMBINATOR_DEPTH_LIMIT = 8;
+function tryCombinatorBranches(node, root, tryFn, depth = 0) {
+  if (depth > COMBINATOR_DEPTH_LIMIT) return void 0;
+  if (!node || typeof node !== "object") return void 0;
+  const branches = node.oneOf || node.anyOf || node.allOf;
+  if (!Array.isArray(branches)) return void 0;
+  for (const raw of branches) {
+    const branch = deref(raw, root);
+    if (!branch || typeof branch !== "object") continue;
+    const direct = tryFn(branch);
+    if (direct !== void 0) return direct;
+    const nested = tryCombinatorBranches(branch, root, tryFn, depth + 1);
+    if (nested !== void 0) return nested;
+  }
+  return void 0;
+}
+function deepDeref(node, root, seen = /* @__PURE__ */ new Set()) {
+  if (!node || typeof node !== "object") return node;
+  if (Array.isArray(node)) return node.map((n) => deepDeref(n, root, seen));
+  const ref = node.$ref;
+  if (typeof ref === "string") {
+    if (seen.has(ref)) return node;
+    const resolved = resolvePointer(root, ref);
+    if (!resolved || typeof resolved !== "object") return node;
+    const nextSeen = new Set(seen);
+    nextSeen.add(ref);
+    return deepDeref(resolved, root, nextSeen);
+  }
+  const result = {};
+  for (const [key, value] of Object.entries(node)) {
+    result[key] = deepDeref(value, root, seen);
+  }
+  return result;
+}
+export {
+  deepDeref,
+  deref,
+  resolvePointer,
+  resolveRef,
+  tryCombinatorBranches
+};
+//# sourceMappingURL=refs.js.map

package/dist/core/refs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"refs.js","sources":["../../src/core/refs.ts"],"sourcesContent":["/**\n * JSON Schema $ref resolution helpers.\n *\n * Supports the pointer grammar used across consumer schemas:\n *   - \"#/$defs/Name\"\n *   - \"#/properties/foo/items\"\n *\n * External refs (URIs, file refs) are intentionally out of scope. A ref that\n * doesn't resolve leaves the node untouched — callers can still inspect the\n * unresolved `$ref` for debugging.\n */\n\n/**\n * Resolve a JSON pointer (`#/a/b/c`) against an object. Returns the node at\n * that path, or `undefined` if any segment is missing or the pointer doesn't\n * start with `#/`.\n */\nexport function resolvePointer(\n  obj: Record<string, unknown>,\n  pointer: string,\n): unknown {\n  if (!pointer.startsWith(\"#/\")) return undefined;\n  const parts = pointer.slice(2).split(\"/\");\n  let current: unknown = obj;\n  for (const part of parts) {\n    if (current && typeof current === \"object\" && part in current) {\n      current = (current as Record<string, unknown>)[part];\n    } else {\n      return undefined;\n    }\n  }\n  return current;\n}\n\n/**\n * Dereference a schema node along a chain of `$ref`s. Follows `A → B → C`\n * transitively. A cycle (same `$ref` seen twice in one chain) returns the\n * last unresolved node rather than hanging. An unresolvable pointer returns\n * the current node unchanged.\n */\nexport function resolveRef(\n  property: Record<string, unknown>,\n  root: Record<string, unknown>,\n  seen?: Set<string>,\n): Record<string, unknown> {\n  if (!property || typeof property !== \"object\") return property;\n\n  const ref = property.$ref as string | undefined;\n  if (!ref) return property;\n\n  const visited = seen ?? new Set<string>();\n  if (visited.has(ref)) return property;\n  visited.add(ref);\n\n  const resolved = resolvePointer(root, ref);\n  if (!resolved) return property;\n\n  return resolveRef(resolved as Record<string, unknown>, root, visited);\n}\n\n/**\n * Convenience wrapper around `resolveRef` that starts a fresh cycle-detection\n * set. Intended for schema walkers that need to dereference at every step;\n * each call is an independent resolution.\n */\nexport function deref(\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  node: Record<string, any> | undefined,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  root: Record<string, any>,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n): Record<string, any> | undefined {\n  if (!node || typeof node !== \"object\") return node;\n  return resolveRef(node, root) as Record<string, unknown> | undefined;\n}\n\n/**\n * Depth limit for combinator (oneOf/anyOf/allOf) branch descent. Schemas\n * rarely nest combinators beyond one or two levels; this guard protects\n * against pathological nesting and cycles (e.g. `oneOf: [$ref back to self]`).\n */\nconst COMBINATOR_DEPTH_LIMIT = 8;\n\n/**\n * Try to navigate a segment through a schema node's combinator branches\n * (`oneOf` / `anyOf` / `allOf`) when direct navigation has failed.\n *\n * Semantics: for walker purposes (renderer-tester matching), we only need\n * ONE concrete schema that satisfies the next navigation step. First-match\n * by structural shape wins, same convention as `initOneOf` uses for seeding.\n *\n * @param node     the schema node to search (already dereffed by caller)\n * @param root     the root schema, for dereferencing branch `$ref`s\n * @param tryFn    predicate that attempts navigation on a candidate branch\n *                 and returns the navigated value, or `undefined` if the\n *                 branch doesn't have what the caller's looking for\n * @param depth    recursion depth (capped at `COMBINATOR_DEPTH_LIMIT`)\n */\nexport function tryCombinatorBranches<T>(\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  node: Record<string, any> | undefined,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  root: Record<string, any>,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  tryFn: (candidate: Record<string, any>) => T | undefined,\n  depth = 0,\n): T | undefined {\n  if (depth > COMBINATOR_DEPTH_LIMIT) return undefined;\n  if (!node || typeof node !== \"object\") return undefined;\n\n  const branches = (node.oneOf || node.anyOf || node.allOf) as\n    | Record<string, unknown>[]\n    | undefined;\n  if (!Array.isArray(branches)) return undefined;\n\n  for (const raw of branches) {\n    const branch = deref(raw as Record<string, unknown>, root);\n    if (!branch || typeof branch !== \"object\") continue;\n\n    const direct = tryFn(branch);\n    if (direct !== undefined) return direct;\n\n    const nested = tryCombinatorBranches(branch, root, tryFn, depth + 1);\n    if (nested !== undefined) return nested;\n  }\n  return undefined;\n}\n\n/**\n * Recursively dereference every `$ref` in a schema subtree, producing a\n * concrete schema with no remaining refs. Cycles along any single chain are\n * handled by leaving the first recursion back into a seen ref as the\n * unresolved node — matching `resolveRef`'s semantics.\n *\n * Intended for use at API boundaries (e.g. `resolveScopeSchema`'s return)\n * so downstream walkers can operate on self-contained schemas without\n * needing the original root.\n */\nexport function deepDeref(\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  node: any,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  root: Record<string, any>,\n  seen: Set<string> = new Set(),\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n): any {\n  if (!node || typeof node !== \"object\") return node;\n  if (Array.isArray(node)) return node.map((n) => deepDeref(n, root, seen));\n\n  const ref = (node as Record<string, unknown>).$ref as string | undefined;\n  if (typeof ref === \"string\") {\n    if (seen.has(ref)) return node;\n    const resolved = resolvePointer(root, ref);\n    if (!resolved || typeof resolved !== \"object\") return node;\n    const nextSeen = new Set(seen);\n    nextSeen.add(ref);\n    return deepDeref(resolved, root, nextSeen);\n  }\n\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  const result: Record<string, any> = {};\n  for (const [key, value] of Object.entries(node)) {\n    result[key] = deepDeref(value, root, seen);\n  }\n  return result;\n}\n"],"names":[],"mappings":"AAiBO,SAAS,eACd,KACA,SACS;AACT,MAAI,CAAC,QAAQ,WAAW,IAAI,EAAG,QAAO;AACtC,QAAM,QAAQ,QAAQ,MAAM,CAAC,EAAE,MAAM,GAAG;AACxC,MAAI,UAAmB;AACvB,aAAW,QAAQ,OAAO;AACxB,QAAI,WAAW,OAAO,YAAY,YAAY,QAAQ,SAAS;AAC7D,gBAAW,QAAoC,IAAI;AAAA,IACrD,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAQO,SAAS,WACd,UACA,MACA,MACyB;AACzB,MAAI,CAAC,YAAY,OAAO,aAAa,SAAU,QAAO;AAEtD,QAAM,MAAM,SAAS;AACrB,MAAI,CAAC,IAAK,QAAO;AAEjB,QAAM,UAAU,QAAQ,oBAAI,IAAA;AAC5B,MAAI,QAAQ,IAAI,GAAG,EAAG,QAAO;AAC7B,UAAQ,IAAI,GAAG;AAEf,QAAM,WAAW,eAAe,MAAM,GAAG;AACzC,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO,WAAW,UAAqC,MAAM,OAAO;AACtE;AAOO,SAAS,MAEd,MAEA,MAEiC;AACjC,MAAI,CAAC,QAAQ,OAAO,SAAS,SAAU,QAAO;AAC9C,SAAO,WAAW,MAAM,IAAI;AAC9B;AAOA,MAAM,yBAAyB;AAiBxB,SAAS,sBAEd,MAEA,MAEA,OACA,QAAQ,GACO;AACf,MAAI,QAAQ,uBAAwB,QAAO;AAC3C,MAAI,CAAC,QAAQ,OAAO,SAAS,SAAU,QAAO;AAE9C,QAAM,WAAY,KAAK,SAAS,KAAK,SAAS,KAAK;AAGnD,MAAI,CAAC,MAAM,QAAQ,QAAQ,EAAG,QAAO;AAErC,aAAW,OAAO,UAAU;AAC1B,UAAM,SAAS,MAAM,KAAgC,IAAI;AACzD,QAAI,CAAC,UAAU,OAAO,WAAW,SAAU;AAE3C,UAAM,SAAS,MAAM,MAAM;AAC3B,QAAI,WAAW,OAAW,QAAO;AAEjC,UAAM,SAAS,sBAAsB,QAAQ,MAAM,OAAO,QAAQ,CAAC;AACnE,QAAI,WAAW,OAAW,QAAO;AAAA,EACnC;AACA,SAAO;AACT;AAYO,SAAS,UAEd,MAEA,MACA,OAAoB,oBAAI,OAEnB;AACL,MAAI,CAAC,QAAQ,OAAO,SAAS,SAAU,QAAO;AAC9C,MAAI,MAAM,QAAQ,IAAI,EAAG,QAAO,KAAK,IAAI,CAAC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC;AAExE,QAAM,MAAO,KAAiC;AAC9C,MAAI,OAAO,QAAQ,UAAU;AAC3B,QAAI,KAAK,IAAI,GAAG,EAAG,QAAO;AAC1B,UAAM,WAAW,eAAe,MAAM,GAAG;AACzC,QAAI,CAAC,YAAY,OAAO,aAAa,SAAU,QAAO;AACtD,UAAM,WAAW,IAAI,IAAI,IAAI;AAC7B,aAAS,IAAI,GAAG;AAChB,WAAO,UAAU,UAAU,MAAM,QAAQ;AAAA,EAC3C;AAGA,QAAM,SAA8B,CAAA;AACpC,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC/C,WAAO,GAAG,IAAI,UAAU,OAAO,MAAM,IAAI;AAAA,EAC3C;AACA,SAAO;AACT;"}

package/dist/core/resolveScope.d.ts

@@ -6,6 +6,12 @@
  *   - "properties" segments navigate into object `.properties`
  *   - "items" segments navigate into array `.items`
  *   - all other segments index directly into the current object
+ *
+ * Dereferences `$ref` nodes transparently at every step, and falls through
+ * to `oneOf` / `anyOf` / `allOf` branches when a segment can't resolve
+ * directly — picks the first branch that satisfies the navigation. The
+ * returned schema is deep-dereferenced so downstream walkers can operate on
+ * a self-contained sub-schema without needing the original root.
  */
 export declare function resolveScopeSchema(scope: string, rootSchema: Record<string, any>): Record<string, any> | undefined;
 //# sourceMappingURL=resolveScope.d.ts.map

package/dist/core/resolveScope.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"resolveScope.d.ts","sourceRoot":"","sources":["../../src/core/resolveScope.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,MAAM,EAEb,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAE9B,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,SAAS,CAwBjC"}
+{"version":3,"file":"resolveScope.d.ts","sourceRoot":"","sources":["../../src/core/resolveScope.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,MAAM,EAEb,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAE9B,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,SAAS,CA+BjC"}

package/dist/core/resolveScope.js

@@ -1,20 +1,26 @@
+import { deepDeref, deref, tryCombinatorBranches } from "./refs.js";
 function resolveScopeSchema(scope, rootSchema) {
   if (!scope || !rootSchema) return void 0;
   const path = scope.replace(/^#\/?/, "");
-  if (!path) return rootSchema;
+  if (!path) return deepDeref(rootSchema, rootSchema);
   const segments = path.split("/");
   let current = rootSchema;
   for (const segment of segments) {
+    current = deref(current, rootSchema);
     if (!current || typeof current !== "object") return void 0;
-    if (segment === "properties") {
-      current = current.properties;
-    } else if (segment === "items") {
-      current = current.items;
-    } else {
-      current = current[segment];
+    const navigate = (node) => {
+      if (segment === "properties") return node.properties;
+      if (segment === "items") return node.items;
+      return node[segment];
+    };
+    let next = navigate(current);
+    if (next === void 0) {
+      next = tryCombinatorBranches(current, rootSchema, navigate);
     }
+    if (next === void 0) return void 0;
+    current = next;
   }
-  return current;
+  return deepDeref(current, rootSchema);
 }
 export {
   resolveScopeSchema

package/dist/core/resolveScope.js.map

@@ -1 +1 @@
-{"version":3,"file":"resolveScope.js","sources":["../../src/core/resolveScope.ts"],"sourcesContent":["/**\n * Resolve a JSON Forms scope path to its schema within a root schema.\n * Handles nested paths like \"#/properties/parent/properties/child\".\n *\n * Follows JSON Schema structure:\n *   - \"properties\" segments navigate into object `.properties`\n *   - \"items\" segments navigate into array `.items`\n *   - all other segments index directly into the current object\n */\nexport function resolveScopeSchema(\n  scope: string,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  rootSchema: Record<string, any>,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n): Record<string, any> | undefined {\n  if (!scope || !rootSchema) return undefined;\n\n  // Remove the leading \"#/\" and split into segments\n  const path = scope.replace(/^#\\/?/, \"\");\n  if (!path) return rootSchema;\n\n  const segments = path.split(\"/\");\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  let current: any = rootSchema;\n\n  for (const segment of segments) {\n    if (!current || typeof current !== \"object\") return undefined;\n\n    if (segment === \"properties\") {\n      current = current.properties;\n    } else if (segment === \"items\") {\n      current = current.items;\n    } else {\n      current = current[segment];\n    }\n  }\n\n  return current;\n}\n"],"names":[],"mappings":"AASO,SAAS,mBACd,OAEA,YAEiC;AACjC,MAAI,CAAC,SAAS,CAAC,WAAY,QAAO;AAGlC,QAAM,OAAO,MAAM,QAAQ,SAAS,EAAE;AACtC,MAAI,CAAC,KAAM,QAAO;AAElB,QAAM,WAAW,KAAK,MAAM,GAAG;AAE/B,MAAI,UAAe;AAEnB,aAAW,WAAW,UAAU;AAC9B,QAAI,CAAC,WAAW,OAAO,YAAY,SAAU,QAAO;AAEpD,QAAI,YAAY,cAAc;AAC5B,gBAAU,QAAQ;AAAA,IACpB,WAAW,YAAY,SAAS;AAC9B,gBAAU,QAAQ;AAAA,IACpB,OAAO;AACL,gBAAU,QAAQ,OAAO;AAAA,IAC3B;AAAA,EACF;AAEA,SAAO;AACT;"}
+{"version":3,"file":"resolveScope.js","sources":["../../src/core/resolveScope.ts"],"sourcesContent":["import { deepDeref, deref, tryCombinatorBranches } from \"./refs\";\n\n/**\n * Resolve a JSON Forms scope path to its schema within a root schema.\n * Handles nested paths like \"#/properties/parent/properties/child\".\n *\n * Follows JSON Schema structure:\n *   - \"properties\" segments navigate into object `.properties`\n *   - \"items\" segments navigate into array `.items`\n *   - all other segments index directly into the current object\n *\n * Dereferences `$ref` nodes transparently at every step, and falls through\n * to `oneOf` / `anyOf` / `allOf` branches when a segment can't resolve\n * directly — picks the first branch that satisfies the navigation. The\n * returned schema is deep-dereferenced so downstream walkers can operate on\n * a self-contained sub-schema without needing the original root.\n */\nexport function resolveScopeSchema(\n  scope: string,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  rootSchema: Record<string, any>,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n): Record<string, any> | undefined {\n  if (!scope || !rootSchema) return undefined;\n\n  // Remove the leading \"#/\" and split into segments\n  const path = scope.replace(/^#\\/?/, \"\");\n  if (!path) return deepDeref(rootSchema, rootSchema);\n\n  const segments = path.split(\"/\");\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  let current: any = rootSchema;\n\n  for (const segment of segments) {\n    current = deref(current, rootSchema);\n    if (!current || typeof current !== \"object\") return undefined;\n\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    const navigate = (node: Record<string, any>): unknown => {\n      if (segment === \"properties\") return node.properties;\n      if (segment === \"items\") return node.items;\n      return node[segment];\n    };\n\n    let next = navigate(current);\n    if (next === undefined) {\n      next = tryCombinatorBranches(current, rootSchema, navigate);\n    }\n    if (next === undefined) return undefined;\n    current = next;\n  }\n\n  return deepDeref(current, rootSchema);\n}\n"],"names":[],"mappings":";AAiBO,SAAS,mBACd,OAEA,YAEiC;AACjC,MAAI,CAAC,SAAS,CAAC,WAAY,QAAO;AAGlC,QAAM,OAAO,MAAM,QAAQ,SAAS,EAAE;AACtC,MAAI,CAAC,KAAM,QAAO,UAAU,YAAY,UAAU;AAElD,QAAM,WAAW,KAAK,MAAM,GAAG;AAE/B,MAAI,UAAe;AAEnB,aAAW,WAAW,UAAU;AAC9B,cAAU,MAAM,SAAS,UAAU;AACnC,QAAI,CAAC,WAAW,OAAO,YAAY,SAAU,QAAO;AAGpD,UAAM,WAAW,CAAC,SAAuC;AACvD,UAAI,YAAY,aAAc,QAAO,KAAK;AAC1C,UAAI,YAAY,QAAS,QAAO,KAAK;AACrC,aAAO,KAAK,OAAO;AAAA,IACrB;AAEA,QAAI,OAAO,SAAS,OAAO;AAC3B,QAAI,SAAS,QAAW;AACtB,aAAO,sBAAsB,SAAS,YAAY,QAAQ;AAAA,IAC5D;AACA,QAAI,SAAS,OAAW,QAAO;AAC/B,cAAU;AAAA,EACZ;AAEA,SAAO,UAAU,SAAS,UAAU;AACtC;"}

package/dist/core/transforms.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"transforms.d.ts","sourceRoot":"","sources":["../../src/core/transforms.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,gBAAiB,SAAQ,SAAS;IACjD,IAAI,EAAE,SAAS,CAAC;IAChB,GAAG,EAAE,MAAM,CAAC;IACZ,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,MAAM,cAAc,GAAG,IAAI,GAAG,KAAK,GAAG,OAAO,GAAG,UAAU,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,UAAU,CAAC;AAE5G,MAAM,WAAW,eAAe;IAC9B,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,CAAC,EAAE,cAAc,CAAC;IAC1B,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC;CACpB;AAED,MAAM,WAAW,eAAgB,SAAQ,SAAS;IAChD,IAAI,EAAE,QAAQ,CAAC;IACf,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC;IACnB,UAAU,CAAC,EAAE,eAAe,EAAE,CAAC;CAChC;AAED,MAAM,MAAM,aAAa,GAAG,gBAAgB,GAAG,eAAe,CAAC;AAE/D,MAAM,MAAM,iBAAiB,GAAG,aAAa,EAAE,CAAC;AAMhD;;GAEG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,OAAO,EAAE,EAChB,QAAQ,EAAE,iBAAiB,GAC1B,OAAO,EAAE,CAYX"}
+{"version":3,"file":"transforms.d.ts","sourceRoot":"","sources":["../../src/core/transforms.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,gBAAiB,SAAQ,SAAS;IACjD,IAAI,EAAE,SAAS,CAAC;IAChB,GAAG,EAAE,MAAM,CAAC;IACZ,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,MAAM,cAAc,GACtB,IAAI,GACJ,KAAK,GACL,OAAO,GACP,UAAU,GACV,IAAI,GACJ,KAAK,GACL,IAAI,GACJ,KAAK,GACL,UAAU,CAAC;AAEf,MAAM,WAAW,eAAe;IAC9B,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,CAAC,EAAE,cAAc,CAAC;IAC1B,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC;CACpB;AAED,MAAM,WAAW,eAAgB,SAAQ,SAAS;IAChD,IAAI,EAAE,QAAQ,CAAC;IACf,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC;IACnB,UAAU,CAAC,EAAE,eAAe,EAAE,CAAC;CAChC;AAED,MAAM,MAAM,aAAa,GAAG,gBAAgB,GAAG,eAAe,CAAC;AAE/D,MAAM,MAAM,iBAAiB,GAAG,aAAa,EAAE,CAAC;AAMhD;;GAEG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,OAAO,EAAE,EAChB,QAAQ,EAAE,iBAAiB,GAC1B,OAAO,EAAE,CAYX"}

package/dist/core/transforms.js

@@ -113,7 +113,9 @@ function filterTransform(items, config) {
   return items.filter((item) => {
     if (typeof item !== "object" || item === null) return false;
     const itemObj = item;
-    return conditions.every((condition) => evaluateCondition(itemObj, condition));
+    return conditions.every(
+      (condition) => evaluateCondition(itemObj, condition)
+    );
   });
 }
 transformRegistry["flatten"] = flattenTransform;

package/dist/core/transforms.js.map

@@ -1 +1 @@
-{"version":3,"file":"transforms.js","sources":["../../src/core/transforms.ts"],"sourcesContent":["/**\n * Transform pipeline system for manipulating API response data\n * Transforms are applied sequentially in the order they appear in the pipeline\n */\n\nexport interface Transform {\n  name: string;\n  [key: string]: unknown;\n}\n\nexport interface FlattenTransform extends Transform {\n  name: \"flatten\";\n  key: string; // The key containing the nested array to flatten\n  labelFormat?: string; // Optional format string like \"{parent.name} → {name}\"\n}\n\nexport type FilterOperator = \"eq\" | \"neq\" | \"empty\" | \"notEmpty\" | \"gt\" | \"gte\" | \"lt\" | \"lte\" | \"contains\";\n\nexport interface FilterCondition {\n  key: string;\n  operator?: FilterOperator; // Defaults to \"eq\" when values is provided, \"exists\" behavior when neither\n  values?: unknown[];\n}\n\nexport interface FilterTransform extends Transform {\n  name: \"filter\";\n  key?: string; // Legacy: single key to check\n  values?: unknown[]; // Legacy: single values array\n  conditions?: FilterCondition[]; // Multi-condition filter (AND logic)\n}\n\nexport type TransformStep = FlattenTransform | FilterTransform;\n\nexport type TransformPipeline = TransformStep[];\n\ntype TransformFunction = (items: unknown[], config: Transform) => unknown[];\n\nconst transformRegistry: Record<string, TransformFunction> = {};\n\n/**\n * Apply a pipeline of transforms to data\n */\nexport function applyTransformPipeline(\n  items: unknown[],\n  pipeline: TransformPipeline,\n): unknown[] {\n  let result = items;\n\n  for (const transform of pipeline) {\n    const fn = transformRegistry[transform.name];\n    if (!fn) {\n      throw new Error(`Unknown transform: ${transform.name}`);\n    }\n    result = fn(result, transform);\n  }\n\n  return result;\n}\n\n/**\n * Flatten transform - recursively flattens nested arrays into a single level\n */\nfunction flattenTransform(items: unknown[], config: Transform): unknown[] {\n  const flattenConfig = config as FlattenTransform;\n  const { key, labelFormat } = flattenConfig;\n  const flattened: unknown[] = [];\n\n  function flattenRecursive(\n    item: unknown,\n    parent: Record<string, unknown> | null = null,\n    depth: number = 0,\n  ): void {\n    if (typeof item !== \"object\" || item === null) return;\n\n    const itemObj = item as Record<string, unknown>;\n\n    // Add the current item\n    if (labelFormat && parent) {\n      const formattedItem = { ...itemObj };\n\n      // Replace placeholders like {parent.name} and {name}\n      let formattedLabel = labelFormat;\n      formattedLabel = formattedLabel.replace(/\\{parent\\.(\\w+)\\}/g, (_, prop) =>\n        String(parent[prop] ?? \"\"),\n      );\n      formattedLabel = formattedLabel.replace(/\\{(\\w+)\\}/g, (_, prop) =>\n        String(itemObj[prop] ?? \"\"),\n      );\n\n      formattedItem._formattedLabel = formattedLabel;\n      formattedItem._parent = parent;\n      formattedItem._depth = depth;\n      flattened.push(formattedItem);\n    } else if (parent) {\n      // Child node with parent reference\n      flattened.push({\n        ...itemObj,\n        _parent: parent,\n        _depth: depth,\n      });\n    } else {\n      // Root node\n      flattened.push({\n        ...itemObj,\n        _depth: depth,\n      });\n    }\n\n    // Recursively flatten children\n    const children = itemObj[key];\n    if (Array.isArray(children)) {\n      for (const child of children) {\n        flattenRecursive(child, itemObj, depth + 1);\n      }\n    }\n  }\n\n  // Start flattening from root items\n  for (const item of items) {\n    flattenRecursive(item, null, 0);\n  }\n\n  return flattened;\n}\n\nfunction isEmpty(value: unknown): boolean {\n  if (value === null || value === undefined) return true;\n  if (Array.isArray(value)) return value.length === 0;\n  if (typeof value === \"string\") return value.length === 0;\n  return false;\n}\n\nfunction evaluateCondition(\n  itemObj: Record<string, unknown>,\n  condition: FilterCondition,\n): boolean {\n  const value = itemObj[condition.key];\n  const operator = condition.operator ?? (condition.values ? \"eq\" : \"eq\");\n\n  switch (operator) {\n    case \"eq\":\n      if (!condition.values || condition.values.length === 0) {\n        return condition.key in itemObj;\n      }\n      return condition.values.includes(value);\n    case \"neq\":\n      if (!condition.values || condition.values.length === 0) {\n        return !(condition.key in itemObj);\n      }\n      return !condition.values.includes(value);\n    case \"empty\":\n      return isEmpty(value);\n    case \"notEmpty\":\n      return !isEmpty(value);\n    case \"gt\":\n      return typeof value === \"number\" && condition.values !== undefined && value > (condition.values[0] as number);\n    case \"gte\":\n      return typeof value === \"number\" && condition.values !== undefined && value >= (condition.values[0] as number);\n    case \"lt\":\n      return typeof value === \"number\" && condition.values !== undefined && value < (condition.values[0] as number);\n    case \"lte\":\n      return typeof value === \"number\" && condition.values !== undefined && value <= (condition.values[0] as number);\n    case \"contains\":\n      if (typeof value === \"string\" && condition.values) {\n        return condition.values.some((v) => value.includes(String(v)));\n      }\n      if (Array.isArray(value) && condition.values) {\n        return condition.values.some((v) => value.includes(v));\n      }\n      return false;\n    default:\n      return false;\n  }\n}\n\n/**\n * Filter transform - filters items based on conditions\n *\n * Supports legacy single key/values syntax and new multi-condition syntax.\n * When using conditions, all conditions must match (AND logic).\n *\n * Operators:\n *   eq       - item[key] matches one of values (default)\n *   neq      - item[key] does NOT match any of values\n *   empty    - item[key] is null, undefined, empty array, or empty string\n *   notEmpty - inverse of empty\n *   gt       - item[key] > values[0]\n *   gte      - item[key] >= values[0]\n *   lt       - item[key] < values[0]\n *   lte      - item[key] <= values[0]\n *   contains - string includes substring, or array includes value\n */\nfunction filterTransform(items: unknown[], config: Transform): unknown[] {\n  const filterConfig = config as FilterTransform;\n\n  // Build conditions array from either new or legacy syntax\n  let conditions: FilterCondition[];\n\n  if (filterConfig.conditions) {\n    conditions = filterConfig.conditions;\n  } else if (filterConfig.key) {\n    // Legacy single key/values syntax\n    conditions = [{ key: filterConfig.key, values: filterConfig.values }];\n  } else {\n    return items;\n  }\n\n  return items.filter((item) => {\n    if (typeof item !== \"object\" || item === null) return false;\n    const itemObj = item as Record<string, unknown>;\n    return conditions.every((condition) => evaluateCondition(itemObj, condition));\n  });\n}\n\n// Register built-in transforms\ntransformRegistry[\"flatten\"] = flattenTransform;\ntransformRegistry[\"filter\"] = filterTransform;\n"],"names":[],"mappings":"AAqCA,MAAM,oBAAuD,CAAA;AAKtD,SAAS,uBACd,OACA,UACW;AACX,MAAI,SAAS;AAEb,aAAW,aAAa,UAAU;AAChC,UAAM,KAAK,kBAAkB,UAAU,IAAI;AAC3C,QAAI,CAAC,IAAI;AACP,YAAM,IAAI,MAAM,sBAAsB,UAAU,IAAI,EAAE;AAAA,IACxD;AACA,aAAS,GAAG,QAAQ,SAAS;AAAA,EAC/B;AAEA,SAAO;AACT;AAKA,SAAS,iBAAiB,OAAkB,QAA8B;AACxE,QAAM,gBAAgB;AACtB,QAAM,EAAE,KAAK,YAAA,IAAgB;AAC7B,QAAM,YAAuB,CAAA;AAE7B,WAAS,iBACP,MACA,SAAyC,MACzC,QAAgB,GACV;AACN,QAAI,OAAO,SAAS,YAAY,SAAS,KAAM;AAE/C,UAAM,UAAU;AAGhB,QAAI,eAAe,QAAQ;AACzB,YAAM,gBAAgB,EAAE,GAAG,QAAA;AAG3B,UAAI,iBAAiB;AACrB,uBAAiB,eAAe;AAAA,QAAQ;AAAA,QAAsB,CAAC,GAAG,SAChE,OAAO,OAAO,IAAI,KAAK,EAAE;AAAA,MAAA;AAE3B,uBAAiB,eAAe;AAAA,QAAQ;AAAA,QAAc,CAAC,GAAG,SACxD,OAAO,QAAQ,IAAI,KAAK,EAAE;AAAA,MAAA;AAG5B,oBAAc,kBAAkB;AAChC,oBAAc,UAAU;AACxB,oBAAc,SAAS;AACvB,gBAAU,KAAK,aAAa;AAAA,IAC9B,WAAW,QAAQ;AAEjB,gBAAU,KAAK;AAAA,QACb,GAAG;AAAA,QACH,SAAS;AAAA,QACT,QAAQ;AAAA,MAAA,CACT;AAAA,IACH,OAAO;AAEL,gBAAU,KAAK;AAAA,QACb,GAAG;AAAA,QACH,QAAQ;AAAA,MAAA,CACT;AAAA,IACH;AAGA,UAAM,WAAW,QAAQ,GAAG;AAC5B,QAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,iBAAW,SAAS,UAAU;AAC5B,yBAAiB,OAAO,SAAS,QAAQ,CAAC;AAAA,MAC5C;AAAA,IACF;AAAA,EACF;AAGA,aAAW,QAAQ,OAAO;AACxB,qBAAiB,MAAM,MAAM,CAAC;AAAA,EAChC;AAEA,SAAO;AACT;AAEA,SAAS,QAAQ,OAAyB;AACxC,MAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,WAAW;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO,MAAM,WAAW;AACvD,SAAO;AACT;AAEA,SAAS,kBACP,SACA,WACS;AACT,QAAM,QAAQ,QAAQ,UAAU,GAAG;AACnC,QAAM,WAAW,UAAU,aAAa,UAAU,SAAS,OAAO;AAElE,UAAQ,UAAA;AAAA,IACN,KAAK;AACH,UAAI,CAAC,UAAU,UAAU,UAAU,OAAO,WAAW,GAAG;AACtD,eAAO,UAAU,OAAO;AAAA,MAC1B;AACA,aAAO,UAAU,OAAO,SAAS,KAAK;AAAA,IACxC,KAAK;AACH,UAAI,CAAC,UAAU,UAAU,UAAU,OAAO,WAAW,GAAG;AACtD,eAAO,EAAE,UAAU,OAAO;AAAA,MAC5B;AACA,aAAO,CAAC,UAAU,OAAO,SAAS,KAAK;AAAA,IACzC,KAAK;AACH,aAAO,QAAQ,KAAK;AAAA,IACtB,KAAK;AACH,aAAO,CAAC,QAAQ,KAAK;AAAA,IACvB,KAAK;AACH,aAAO,OAAO,UAAU,YAAY,UAAU,WAAW,UAAa,QAAS,UAAU,OAAO,CAAC;AAAA,IACnG,KAAK;AACH,aAAO,OAAO,UAAU,YAAY,UAAU,WAAW,UAAa,SAAU,UAAU,OAAO,CAAC;AAAA,IACpG,KAAK;AACH,aAAO,OAAO,UAAU,YAAY,UAAU,WAAW,UAAa,QAAS,UAAU,OAAO,CAAC;AAAA,IACnG,KAAK;AACH,aAAO,OAAO,UAAU,YAAY,UAAU,WAAW,UAAa,SAAU,UAAU,OAAO,CAAC;AAAA,IACpG,KAAK;AACH,UAAI,OAAO,UAAU,YAAY,UAAU,QAAQ;AACjD,eAAO,UAAU,OAAO,KAAK,CAAC,MAAM,MAAM,SAAS,OAAO,CAAC,CAAC,CAAC;AAAA,MAC/D;AACA,UAAI,MAAM,QAAQ,KAAK,KAAK,UAAU,QAAQ;AAC5C,eAAO,UAAU,OAAO,KAAK,CAAC,MAAM,MAAM,SAAS,CAAC,CAAC;AAAA,MACvD;AACA,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EAAA;AAEb;AAmBA,SAAS,gBAAgB,OAAkB,QAA8B;AACvE,QAAM,eAAe;AAGrB,MAAI;AAEJ,MAAI,aAAa,YAAY;AAC3B,iBAAa,aAAa;AAAA,EAC5B,WAAW,aAAa,KAAK;AAE3B,iBAAa,CAAC,EAAE,KAAK,aAAa,KAAK,QAAQ,aAAa,QAAQ;AAAA,EACtE,OAAO;AACL,WAAO;AAAA,EACT;AAEA,SAAO,MAAM,OAAO,CAAC,SAAS;AAC5B,QAAI,OAAO,SAAS,YAAY,SAAS,KAAM,QAAO;AACtD,UAAM,UAAU;AAChB,WAAO,WAAW,MAAM,CAAC,cAAc,kBAAkB,SAAS,SAAS,CAAC;AAAA,EAC9E,CAAC;AACH;AAGA,kBAAkB,SAAS,IAAI;AAC/B,kBAAkB,QAAQ,IAAI;"}
+{"version":3,"file":"transforms.js","sources":["../../src/core/transforms.ts"],"sourcesContent":["/**\n * Transform pipeline system for manipulating API response data\n * Transforms are applied sequentially in the order they appear in the pipeline\n */\n\nexport interface Transform {\n  name: string;\n  [key: string]: unknown;\n}\n\nexport interface FlattenTransform extends Transform {\n  name: \"flatten\";\n  key: string; // The key containing the nested array to flatten\n  labelFormat?: string; // Optional format string like \"{parent.name} → {name}\"\n}\n\nexport type FilterOperator =\n  | \"eq\"\n  | \"neq\"\n  | \"empty\"\n  | \"notEmpty\"\n  | \"gt\"\n  | \"gte\"\n  | \"lt\"\n  | \"lte\"\n  | \"contains\";\n\nexport interface FilterCondition {\n  key: string;\n  operator?: FilterOperator; // Defaults to \"eq\" when values is provided, \"exists\" behavior when neither\n  values?: unknown[];\n}\n\nexport interface FilterTransform extends Transform {\n  name: \"filter\";\n  key?: string; // Legacy: single key to check\n  values?: unknown[]; // Legacy: single values array\n  conditions?: FilterCondition[]; // Multi-condition filter (AND logic)\n}\n\nexport type TransformStep = FlattenTransform | FilterTransform;\n\nexport type TransformPipeline = TransformStep[];\n\ntype TransformFunction = (items: unknown[], config: Transform) => unknown[];\n\nconst transformRegistry: Record<string, TransformFunction> = {};\n\n/**\n * Apply a pipeline of transforms to data\n */\nexport function applyTransformPipeline(\n  items: unknown[],\n  pipeline: TransformPipeline,\n): unknown[] {\n  let result = items;\n\n  for (const transform of pipeline) {\n    const fn = transformRegistry[transform.name];\n    if (!fn) {\n      throw new Error(`Unknown transform: ${transform.name}`);\n    }\n    result = fn(result, transform);\n  }\n\n  return result;\n}\n\n/**\n * Flatten transform - recursively flattens nested arrays into a single level\n */\nfunction flattenTransform(items: unknown[], config: Transform): unknown[] {\n  const flattenConfig = config as FlattenTransform;\n  const { key, labelFormat } = flattenConfig;\n  const flattened: unknown[] = [];\n\n  function flattenRecursive(\n    item: unknown,\n    parent: Record<string, unknown> | null = null,\n    depth: number = 0,\n  ): void {\n    if (typeof item !== \"object\" || item === null) return;\n\n    const itemObj = item as Record<string, unknown>;\n\n    // Add the current item\n    if (labelFormat && parent) {\n      const formattedItem = { ...itemObj };\n\n      // Replace placeholders like {parent.name} and {name}\n      let formattedLabel = labelFormat;\n      formattedLabel = formattedLabel.replace(/\\{parent\\.(\\w+)\\}/g, (_, prop) =>\n        String(parent[prop] ?? \"\"),\n      );\n      formattedLabel = formattedLabel.replace(/\\{(\\w+)\\}/g, (_, prop) =>\n        String(itemObj[prop] ?? \"\"),\n      );\n\n      formattedItem._formattedLabel = formattedLabel;\n      formattedItem._parent = parent;\n      formattedItem._depth = depth;\n      flattened.push(formattedItem);\n    } else if (parent) {\n      // Child node with parent reference\n      flattened.push({\n        ...itemObj,\n        _parent: parent,\n        _depth: depth,\n      });\n    } else {\n      // Root node\n      flattened.push({\n        ...itemObj,\n        _depth: depth,\n      });\n    }\n\n    // Recursively flatten children\n    const children = itemObj[key];\n    if (Array.isArray(children)) {\n      for (const child of children) {\n        flattenRecursive(child, itemObj, depth + 1);\n      }\n    }\n  }\n\n  // Start flattening from root items\n  for (const item of items) {\n    flattenRecursive(item, null, 0);\n  }\n\n  return flattened;\n}\n\nfunction isEmpty(value: unknown): boolean {\n  if (value === null || value === undefined) return true;\n  if (Array.isArray(value)) return value.length === 0;\n  if (typeof value === \"string\") return value.length === 0;\n  return false;\n}\n\nfunction evaluateCondition(\n  itemObj: Record<string, unknown>,\n  condition: FilterCondition,\n): boolean {\n  const value = itemObj[condition.key];\n  const operator = condition.operator ?? (condition.values ? \"eq\" : \"eq\");\n\n  switch (operator) {\n    case \"eq\":\n      if (!condition.values || condition.values.length === 0) {\n        return condition.key in itemObj;\n      }\n      return condition.values.includes(value);\n    case \"neq\":\n      if (!condition.values || condition.values.length === 0) {\n        return !(condition.key in itemObj);\n      }\n      return !condition.values.includes(value);\n    case \"empty\":\n      return isEmpty(value);\n    case \"notEmpty\":\n      return !isEmpty(value);\n    case \"gt\":\n      return (\n        typeof value === \"number\" &&\n        condition.values !== undefined &&\n        value > (condition.values[0] as number)\n      );\n    case \"gte\":\n      return (\n        typeof value === \"number\" &&\n        condition.values !== undefined &&\n        value >= (condition.values[0] as number)\n      );\n    case \"lt\":\n      return (\n        typeof value === \"number\" &&\n        condition.values !== undefined &&\n        value < (condition.values[0] as number)\n      );\n    case \"lte\":\n      return (\n        typeof value === \"number\" &&\n        condition.values !== undefined &&\n        value <= (condition.values[0] as number)\n      );\n    case \"contains\":\n      if (typeof value === \"string\" && condition.values) {\n        return condition.values.some((v) => value.includes(String(v)));\n      }\n      if (Array.isArray(value) && condition.values) {\n        return condition.values.some((v) => value.includes(v));\n      }\n      return false;\n    default:\n      return false;\n  }\n}\n\n/**\n * Filter transform - filters items based on conditions\n *\n * Supports legacy single key/values syntax and new multi-condition syntax.\n * When using conditions, all conditions must match (AND logic).\n *\n * Operators:\n *   eq       - item[key] matches one of values (default)\n *   neq      - item[key] does NOT match any of values\n *   empty    - item[key] is null, undefined, empty array, or empty string\n *   notEmpty - inverse of empty\n *   gt       - item[key] > values[0]\n *   gte      - item[key] >= values[0]\n *   lt       - item[key] < values[0]\n *   lte      - item[key] <= values[0]\n *   contains - string includes substring, or array includes value\n */\nfunction filterTransform(items: unknown[], config: Transform): unknown[] {\n  const filterConfig = config as FilterTransform;\n\n  // Build conditions array from either new or legacy syntax\n  let conditions: FilterCondition[];\n\n  if (filterConfig.conditions) {\n    conditions = filterConfig.conditions;\n  } else if (filterConfig.key) {\n    // Legacy single key/values syntax\n    conditions = [{ key: filterConfig.key, values: filterConfig.values }];\n  } else {\n    return items;\n  }\n\n  return items.filter((item) => {\n    if (typeof item !== \"object\" || item === null) return false;\n    const itemObj = item as Record<string, unknown>;\n    return conditions.every((condition) =>\n      evaluateCondition(itemObj, condition),\n    );\n  });\n}\n\n// Register built-in transforms\ntransformRegistry[\"flatten\"] = flattenTransform;\ntransformRegistry[\"filter\"] = filterTransform;\n"],"names":[],"mappings":"AA8CA,MAAM,oBAAuD,CAAA;AAKtD,SAAS,uBACd,OACA,UACW;AACX,MAAI,SAAS;AAEb,aAAW,aAAa,UAAU;AAChC,UAAM,KAAK,kBAAkB,UAAU,IAAI;AAC3C,QAAI,CAAC,IAAI;AACP,YAAM,IAAI,MAAM,sBAAsB,UAAU,IAAI,EAAE;AAAA,IACxD;AACA,aAAS,GAAG,QAAQ,SAAS;AAAA,EAC/B;AAEA,SAAO;AACT;AAKA,SAAS,iBAAiB,OAAkB,QAA8B;AACxE,QAAM,gBAAgB;AACtB,QAAM,EAAE,KAAK,YAAA,IAAgB;AAC7B,QAAM,YAAuB,CAAA;AAE7B,WAAS,iBACP,MACA,SAAyC,MACzC,QAAgB,GACV;AACN,QAAI,OAAO,SAAS,YAAY,SAAS,KAAM;AAE/C,UAAM,UAAU;AAGhB,QAAI,eAAe,QAAQ;AACzB,YAAM,gBAAgB,EAAE,GAAG,QAAA;AAG3B,UAAI,iBAAiB;AACrB,uBAAiB,eAAe;AAAA,QAAQ;AAAA,QAAsB,CAAC,GAAG,SAChE,OAAO,OAAO,IAAI,KAAK,EAAE;AAAA,MAAA;AAE3B,uBAAiB,eAAe;AAAA,QAAQ;AAAA,QAAc,CAAC,GAAG,SACxD,OAAO,QAAQ,IAAI,KAAK,EAAE;AAAA,MAAA;AAG5B,oBAAc,kBAAkB;AAChC,oBAAc,UAAU;AACxB,oBAAc,SAAS;AACvB,gBAAU,KAAK,aAAa;AAAA,IAC9B,WAAW,QAAQ;AAEjB,gBAAU,KAAK;AAAA,QACb,GAAG;AAAA,QACH,SAAS;AAAA,QACT,QAAQ;AAAA,MAAA,CACT;AAAA,IACH,OAAO;AAEL,gBAAU,KAAK;AAAA,QACb,GAAG;AAAA,QACH,QAAQ;AAAA,MAAA,CACT;AAAA,IACH;AAGA,UAAM,WAAW,QAAQ,GAAG;AAC5B,QAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,iBAAW,SAAS,UAAU;AAC5B,yBAAiB,OAAO,SAAS,QAAQ,CAAC;AAAA,MAC5C;AAAA,IACF;AAAA,EACF;AAGA,aAAW,QAAQ,OAAO;AACxB,qBAAiB,MAAM,MAAM,CAAC;AAAA,EAChC;AAEA,SAAO;AACT;AAEA,SAAS,QAAQ,OAAyB;AACxC,MAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,WAAW;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO,MAAM,WAAW;AACvD,SAAO;AACT;AAEA,SAAS,kBACP,SACA,WACS;AACT,QAAM,QAAQ,QAAQ,UAAU,GAAG;AACnC,QAAM,WAAW,UAAU,aAAa,UAAU,SAAS,OAAO;AAElE,UAAQ,UAAA;AAAA,IACN,KAAK;AACH,UAAI,CAAC,UAAU,UAAU,UAAU,OAAO,WAAW,GAAG;AACtD,eAAO,UAAU,OAAO;AAAA,MAC1B;AACA,aAAO,UAAU,OAAO,SAAS,KAAK;AAAA,IACxC,KAAK;AACH,UAAI,CAAC,UAAU,UAAU,UAAU,OAAO,WAAW,GAAG;AACtD,eAAO,EAAE,UAAU,OAAO;AAAA,MAC5B;AACA,aAAO,CAAC,UAAU,OAAO,SAAS,KAAK;AAAA,IACzC,KAAK;AACH,aAAO,QAAQ,KAAK;AAAA,IACtB,KAAK;AACH,aAAO,CAAC,QAAQ,KAAK;AAAA,IACvB,KAAK;AACH,aACE,OAAO,UAAU,YACjB,UAAU,WAAW,UACrB,QAAS,UAAU,OAAO,CAAC;AAAA,IAE/B,KAAK;AACH,aACE,OAAO,UAAU,YACjB,UAAU,WAAW,UACrB,SAAU,UAAU,OAAO,CAAC;AAAA,IAEhC,KAAK;AACH,aACE,OAAO,UAAU,YACjB,UAAU,WAAW,UACrB,QAAS,UAAU,OAAO,CAAC;AAAA,IAE/B,KAAK;AACH,aACE,OAAO,UAAU,YACjB,UAAU,WAAW,UACrB,SAAU,UAAU,OAAO,CAAC;AAAA,IAEhC,KAAK;AACH,UAAI,OAAO,UAAU,YAAY,UAAU,QAAQ;AACjD,eAAO,UAAU,OAAO,KAAK,CAAC,MAAM,MAAM,SAAS,OAAO,CAAC,CAAC,CAAC;AAAA,MAC/D;AACA,UAAI,MAAM,QAAQ,KAAK,KAAK,UAAU,QAAQ;AAC5C,eAAO,UAAU,OAAO,KAAK,CAAC,MAAM,MAAM,SAAS,CAAC,CAAC;AAAA,MACvD;AACA,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EAAA;AAEb;AAmBA,SAAS,gBAAgB,OAAkB,QAA8B;AACvE,QAAM,eAAe;AAGrB,MAAI;AAEJ,MAAI,aAAa,YAAY;AAC3B,iBAAa,aAAa;AAAA,EAC5B,WAAW,aAAa,KAAK;AAE3B,iBAAa,CAAC,EAAE,KAAK,aAAa,KAAK,QAAQ,aAAa,QAAQ;AAAA,EACtE,OAAO;AACL,WAAO;AAAA,EACT;AAEA,SAAO,MAAM,OAAO,CAAC,SAAS;AAC5B,QAAI,OAAO,SAAS,YAAY,SAAS,KAAM,QAAO;AACtD,UAAM,UAAU;AAChB,WAAO,WAAW;AAAA,MAAM,CAAC,cACvB,kBAAkB,SAAS,SAAS;AAAA,IAAA;AAAA,EAExC,CAAC;AACH;AAGA,kBAAkB,SAAS,IAAI;AAC/B,kBAAkB,QAAQ,IAAI;"}

package/dist/core/types.d.ts

@@ -47,5 +47,6 @@ export interface ConnectorDataLayer {
     dataset_id?: number;
     profile_id?: string;
     profile_name?: string;
+    datasetWriteMode?: "append" | "overwrite";
 }
 //# sourceMappingURL=types.d.ts.map

package/dist/core/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/core/types.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,YAAY,GAAG;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,OAAO,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC,CAAC;AACF,MAAM,MAAM,cAAc,GAAG;IAC3B,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,MAAM,MAAM,eAAe,GAAG;IAC5B,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,WAAW,CAAC;IACpB,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IACxB,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC,CAAC;AAEF,MAAM,WAAW,QAAQ,CAAC,GAAG,GAAG,OAAO;IACrC,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,eAAe,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;CAClE;AAED,MAAM,WAAW,eAAe;IAC9B,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,IAAI,CAAC,EAAE,UAAU,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,IAAI,CAAC,EAAE,OAAO,GAAG,SAAS,GAAG,OAAO,CAAC;CACtC;AAED,MAAM,MAAM,OAAO,GAAG;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC/B,CAAC;AAEF,MAAM,WAAW,UAAU;IACzB,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,CAAC;IACjC,MAAM,CAAC,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,CAAC;IACjC,KAAK,CAAC,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,CAAC;IAChC,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,kBAAkB;IACjC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/core/types.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,YAAY,GAAG;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,OAAO,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC,CAAC;AACF,MAAM,MAAM,cAAc,GAAG;IAC3B,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,MAAM,MAAM,eAAe,GAAG;IAC5B,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,WAAW,CAAC;IACpB,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IACxB,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC,CAAC;AAEF,MAAM,WAAW,QAAQ,CAAC,GAAG,GAAG,OAAO;IACrC,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,eAAe,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;CAClE;AAED,MAAM,WAAW,eAAe;IAC9B,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,IAAI,CAAC,EAAE,UAAU,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,IAAI,CAAC,EAAE,OAAO,GAAG,SAAS,GAAG,OAAO,CAAC;CACtC;AAED,MAAM,MAAM,OAAO,GAAG;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC/B,CAAC;AAEF,MAAM,WAAW,UAAU;IACzB,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,CAAC;IACjC,MAAM,CAAC,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,CAAC;IACjC,KAAK,CAAC,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,CAAC;IAChC,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,kBAAkB;IACjC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,gBAAgB,CAAC,EAAE,QAAQ,GAAG,WAAW,CAAC;CAC3C"}

package/dist/index.d.ts

@@ -8,7 +8,10 @@ export * from "./core/transforms";
 export * from "./core/projection";
 export * from "./core/resolveScope";
 export * from "./core/types";
+export { initFormDataFromSchema } from "./core/initFormData";
 export { RestApiProtocol } from "./protocols/rest_api";
+export { createNoEvalAjv, transformUnit, transformErrors, } from "./no-eval-ajv";
+export type { NoEvalAjv, NoEvalErrorObject, NoEvalValidateFunction, CreateNoEvalAjvOptions, } from "./no-eval-ajv";
 export { providerRenderers, primevueRenderers, ProviderAutocomplete, ProviderSelect, ProviderMultiSelect, useProvider, createDataLayer, useDataLayer, JfText, JfTextArea, JfNumber, JfEnum, JfEnumArray, JfBoolean, } from "./vue";
 export type { DataLayer } from "./vue";
 export interface ProviderConfig {

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,KAAK,CAAC;AAG/B,OAAO,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAIzD,OAAO,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AACrC,cAAc,iBAAiB,CAAC;AAChC,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AAEpC,cAAc,cAAc,CAAC;AAG7B,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAGvD,OAAO,EACL,iBAAiB,EACjB,iBAAiB,EACjB,oBAAoB,EACpB,cAAc,EACd,mBAAmB,EACnB,WAAW,EACX,eAAe,EACf,YAAY,EACZ,MAAM,EACN,UAAU,EACV,QAAQ,EACR,MAAM,EACN,WAAW,EACX,SAAS,GACV,MAAM,OAAO,CAAC;AACf,YAAY,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AAEvC,MAAM,WAAW,cAAc;IAC7B,SAAS,CAAC,EAAE,QAAQ,EAAE,CAAC;IACvB,IAAI,CAAC,EAAE,UAAU,CAAC;CACnB;;iBAGc,GAAG,SAAS,cAAc;;AADzC,wBAYE"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,KAAK,CAAC;AAG/B,OAAO,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAEzD,OAAO,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AACrC,cAAc,iBAAiB,CAAC;AAChC,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AAEpC,cAAc,cAAc,CAAC;AAC7B,OAAO,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAG7D,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAGvD,OAAO,EACL,eAAe,EACf,aAAa,EACb,eAAe,GAChB,MAAM,eAAe,CAAC;AACvB,YAAY,EACV,SAAS,EACT,iBAAiB,EACjB,sBAAsB,EACtB,sBAAsB,GACvB,MAAM,eAAe,CAAC;AAGvB,OAAO,EACL,iBAAiB,EACjB,iBAAiB,EACjB,oBAAoB,EACpB,cAAc,EACd,mBAAmB,EACnB,WAAW,EACX,eAAe,EACf,YAAY,EACZ,MAAM,EACN,UAAU,EACV,QAAQ,EACR,MAAM,EACN,WAAW,EACX,SAAS,GACV,MAAM,OAAO,CAAC;AACf,YAAY,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AAEvC,MAAM,WAAW,cAAc;IAC7B,SAAS,CAAC,EAAE,QAAQ,EAAE,CAAC;IACvB,IAAI,CAAC,EAAE,UAAU,CAAC;CACnB;;iBAGc,GAAG,SAAS,cAAc;;AADzC,wBAYE"}

package/dist/index.js

@@ -5,7 +5,9 @@ import { renderObj, renderTpl } from "./core/templating.js";
 import { applyTransformPipeline } from "./core/transforms.js";
 import { getProjectedSchema, getProjectedValue, parseProjectionPath, setProjectedValue } from "./core/projection.js";
 import { resolveScopeSchema } from "./core/resolveScope.js";
+import { initFormDataFromSchema } from "./core/initFormData.js";
 import { RestApiProtocol } from "./protocols/rest_api.js";
+import { createNoEvalAjv, transformErrors, transformUnit } from "./no-eval-ajv.js";
 import { providerRenderers } from "./vue/index.js";
 import { default as default2 } from "./vue/components/ProviderAutocomplete.vue.js";
 import { default as default3 } from "./vue/primevue/JfText.vue.js";
@@ -19,7 +21,6 @@ import { default as default9 } from "./vue/components/ProviderSelect.vue.js";
 import { default as default10 } from "./vue/components/ProviderMultiSelect.vue.js";
 import { useProvider } from "./vue/composables/useProvider.js";
 import { createDataLayer, useDataLayer } from "./vue/composables/useDataLayer.js";
-console.log("[jsonforms-provider-protocols] loaded v2.10.0 (symlink)");
 const index = {
   install(app, opts) {
     const reg = registry;
@@ -47,9 +48,11 @@ export {
   applyTransformPipeline,
   cache,
   createDataLayer,
+  createNoEvalAjv,
   index as default,
   getProjectedSchema,
   getProjectedValue,
+  initFormDataFromSchema,
   jp,
   parseProjectionPath,
   primevueRenderers,
@@ -59,6 +62,8 @@ export {
   renderTpl,
   resolveScopeSchema,
   setProjectedValue,
+  transformErrors,
+  transformUnit,
   useDataLayer,
   useProvider
 };