@flanksource/clicky-ui 0.3.21 → 0.3.23

package/dist/components/json-schema-form-utils.cjs

@@ -2,7 +2,7 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const utils = require("../lib/utils.cjs");
 const jsonSchemaFormSize = require("./json-schema-form-size.cjs");
-const INPUT_BASE = "w-full min-w-0 rounded-md border border-input bg-background text-foreground outline-none placeholder:text-muted-foreground disabled:cursor-not-allowed disabled:bg-muted/40 focus-visible:ring-2 focus-visible:ring-ring";
+const INPUT_BASE = "w-full min-w-0 rounded-md border border-input bg-background text-foreground outline-none placeholder:text-placeholder disabled:cursor-not-allowed disabled:bg-muted/40 focus-visible:ring-2 focus-visible:ring-ring";
 function inputClass(size) {
   return utils.cn(INPUT_BASE, jsonSchemaFormSize.inputSizeClass[size]);
 }
@@ -39,8 +39,9 @@ function toText(value) {
   if (typeof value === "object") return "";
   return String(value);
 }
-function isPlainObject(value) {
-  return typeof value === "object" && value !== null && !Array.isArray(value);
+function toStringArray(value) {
+  if (!Array.isArray(value)) return [];
+  return value.filter((entry) => typeof entry === "string");
 }
 function hasObjectItemProperties(items) {
   return !!items && !!items.properties && Object.keys(items.properties).length > 0;
@@ -61,13 +62,6 @@ const DEFAULT_COLUMN_MIN_WIDTH = "15rem";
 function cssLength(value, fallback) {
   return typeof value === "string" && value.trim() ? value.trim() : fallback;
 }
-function duplicateIndex(items, index) {
-  const source = items[index];
-  const copy = Array.isArray(source) ? [...source] : isPlainObject(source) ? { ...source } : source;
-  const next = [...items];
-  next.splice(index + 1, 0, copy);
-  return next;
-}
 function withSyntheticValue(options, value) {
   if (!value || options.some((o) => o.value === value)) return options;
   return [{ value, label: value }, ...options];
@@ -128,19 +122,6 @@ function softError(field) {
   }
   return void 0;
 }
-function setIndex(arr, i, v) {
-  return arr.map((x, idx) => idx === i ? v : x);
-}
-function removeIndex(arr, i) {
-  return arr.filter((_, idx) => idx !== i);
-}
-function moveItem(arr, from, to) {
-  if (to < 0 || to >= arr.length) return arr;
-  const next = [...arr];
-  const [moved] = next.splice(from, 1);
-  next.splice(to, 0, moved);
-  return next;
-}
 function seedFromSchema(schema) {
   if (schema.default !== void 0) return schema.default;
   const type = Array.isArray(schema.type) ? schema.type[0] : schema.type;
@@ -153,27 +134,23 @@ exports.DEFAULT_COLUMN_MIN_WIDTH = DEFAULT_COLUMN_MIN_WIDTH;
 exports.comboboxAriaProps = comboboxAriaProps;
 exports.cssLength = cssLength;
 exports.defaultPlaceholder = defaultPlaceholder;
-exports.duplicateIndex = duplicateIndex;
 exports.fieldAriaProps = fieldAriaProps;
 exports.fieldErrorId = fieldErrorId;
 exports.fieldInputId = fieldInputId;
 exports.hasObjectItemProperties = hasObjectItemProperties;
 exports.inputClass = inputClass;
 exports.isEmptyValue = isEmptyValue;
-exports.isPlainObject = isPlainObject;
 exports.keyPickerOptions = keyPickerOptions;
 exports.matchesFieldFilter = matchesFieldFilter;
-exports.moveItem = moveItem;
 exports.normalizeColSpan = normalizeColSpan;
 exports.normalizeColumns = normalizeColumns;
 exports.orderByClickyOrder = orderByClickyOrder;
 exports.orderByPriority = orderByPriority;
 exports.orderByXOrder = orderByXOrder;
 exports.orderRequiredFirst = orderRequiredFirst;
-exports.removeIndex = removeIndex;
 exports.seedFromSchema = seedFromSchema;
-exports.setIndex = setIndex;
 exports.softError = softError;
+exports.toStringArray = toStringArray;
 exports.toText = toText;
 exports.withSyntheticValue = withSyntheticValue;
 //# sourceMappingURL=json-schema-form-utils.cjs.map

package/dist/components/json-schema-form-utils.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"json-schema-form-utils.cjs","sources":["../../src/components/json-schema-form-utils.ts"],"sourcesContent":["import { cn } from \"../lib/utils\";\nimport { inputSizeClass, type FormSize } from \"./json-schema-form-size\";\nimport type {\n  FieldControl,\n  FieldOption,\n  GridColumns,\n  JsonSchemaProperty,\n} from \"./json-schema-form-types\";\n\n// Non-size styling shared by every text-like input box; the size token supplies\n// height, horizontal padding, and text size (see inputSizeClass).\nconst INPUT_BASE =\n  \"w-full min-w-0 rounded-md border border-input bg-background text-foreground outline-none placeholder:text-muted-foreground disabled:cursor-not-allowed disabled:bg-muted/40 focus-visible:ring-2 focus-visible:ring-ring\";\n\nexport function inputClass(size: FormSize): string {\n  return cn(INPUT_BASE, inputSizeClass[size]);\n}\n\n// encodeIdPart escapes one path token (or the id prefix) injectively: every\n// character outside [A-Za-z0-9] becomes `_<hex char code>_`, and the empty token\n// — a legal JSON Schema property name — becomes a lone `_`. The escape is\n// self-delimiting (it always starts and ends with `_`, and a literal `_` escapes\n// to `_5f_`), so distinct tokens can never share an encoding and `-` stays free\n// as a segment separator. Percent-encoding was rejected because `%` in an id,\n// while legal HTML, has to be escaped again inside a `#id` CSS selector; this\n// alphabet ([A-Za-z0-9_-]) is safe as-is for `document.querySelector`.\nfunction encodeIdPart(value: string): string {\n  if (value === \"\") return \"_\";\n  return value.replace(/[^A-Za-z0-9]/g, (char) => `_${char.charCodeAt(0).toString(16)}_`);\n}\n\n// fieldInputId derives a control's DOM id from its JSON-pointer instance path,\n// not from its leaf key: a schema that repeats a property name under two parents\n// (e.g. /journalLine1/asset and /journalLine2/asset) must not produce the same\n// id, or every `label[for]` binds to the first control. Each decoded pointer\n// token is escaped with encodeIdPart and joined with \"-\", so distinct paths\n// always produce distinct ids: \"/asset-class\", \"/asset_class\", \"/asset.class\"\n// and \"/asset/class\" are four different ids, and an empty token is preserved\n// (\"/a//b\" ≠ \"/a/b\"). The prefix is escaped the same way, so prefix \"a\" + \"/b-c\"\n// cannot collide with prefix \"a-b\" + \"/c\".\nexport function fieldInputId(instancePath: string, prefix?: string): string {\n  const tokens = instancePath === \"\" ? [] : instancePath.replace(/^\\//, \"\").split(\"/\");\n  const safe = tokens\n    .map((token) => encodeIdPart(token.replaceAll(\"~1\", \"/\").replaceAll(\"~0\", \"~\")))\n    .join(\"-\");\n  return prefix ? `jsf-${encodeIdPart(prefix)}-${safe}` : `jsf-${safe}`;\n}\n\n// fieldErrorId names the element that holds a field's validation messages, so a\n// control can point at it with aria-describedby.\nexport function fieldErrorId(fieldId: string): string {\n  return `${fieldId}-error`;\n}\n\n// fieldAriaProps is the assistive-technology half of a control: the visual `*`\n// and red message mean nothing to a screen reader on their own, so every\n// editable control spreads these onto its input element.\nexport function fieldAriaProps(\n  field: FieldControl,\n  fieldId: string,\n): {\n  \"aria-required\"?: true;\n  \"aria-invalid\"?: true;\n  \"aria-describedby\"?: string;\n} {\n  return {\n    ...(field.required ? { \"aria-required\": true as const } : {}),\n    ...(field.invalid ? { \"aria-invalid\": true as const, \"aria-describedby\": fieldErrorId(fieldId) } : {}),\n  };\n}\n\n// comboboxAriaProps is the fieldAriaProps equivalent for Combobox, which takes\n// the same state as named props rather than raw aria-* attributes.\nexport function comboboxAriaProps(\n  field: FieldControl,\n  fieldId: string,\n): { ariaRequired?: true; invalid?: true; describedBy?: string } {\n  return {\n    ...(field.required ? { ariaRequired: true as const } : {}),\n    ...(field.invalid ? { invalid: true as const, describedBy: fieldErrorId(fieldId) } : {}),\n  };\n}\n\nexport function defaultPlaceholder(schema: JsonSchemaProperty): string {\n  if (schema.default != null && typeof schema.default !== \"object\") return String(schema.default);\n  return \"\";\n}\n\nexport function toText(value: unknown): string {\n  if (value === undefined || value === null) return \"\";\n  if (typeof value === \"object\") return \"\";\n  return String(value);\n}\n\nexport function isPlainObject(value: unknown): value is Record<string, unknown> {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\n// hasObjectItemProperties reports whether an array's items are objects with a\n// fixed `properties` set — the precondition for both the column-per-property\n// table and the summary-row accordion, which need to know the item's shape.\nexport function hasObjectItemProperties(\n  items: JsonSchemaProperty | undefined,\n): boolean {\n  return (\n    !!items && !!items.properties && Object.keys(items.properties).length > 0\n  );\n}\n\n// Object-level `x-columns`: how many equal columns to split a stacked object\n// into. \"auto\" fits as many as the width allows. A number is clamped to [1, 12]\n// (a standard 12-track grid, so a 3-across row of span-4 fields and a 4-across\n// row of span-3 fields share one object); anything invalid is a single column.\nexport function normalizeColumns(value: unknown): GridColumns {\n  if (value === \"auto\") return \"auto\";\n  const n = typeof value === \"number\" ? value : Number(value);\n  if (!Number.isFinite(n) || n < 1) return 1;\n  return Math.min(Math.trunc(n), 12);\n}\n\n// Per-field `x-col-span`: how many of the object's columns a field occupies.\n// \"full\" spans the whole row. Under `x-columns: \"auto\"` a numeric span cannot be\n// clamped against a track count that only exists at layout time, so it is capped\n// at the 12-track maximum instead. Invalid falls back to 1.\nexport function normalizeColSpan(\n  value: unknown,\n  columns: GridColumns,\n): number | \"full\" {\n  if (value === \"full\") return \"full\";\n  const n = typeof value === \"number\" ? value : Number(value);\n  if (!Number.isFinite(n) || n < 1) return 1;\n  return Math.min(Math.trunc(n), columns === \"auto\" ? 12 : columns);\n}\n\n// The `x-columns: \"auto\"` column floor: wide enough for a labelled control to\n// stay readable, narrow enough that a 1440px pane gets three columns, not two.\nexport const DEFAULT_COLUMN_MIN_WIDTH = \"15rem\";\n\n// cssLength guards a schema-supplied CSS length before it reaches an inline\n// style. Non-strings (and the empty string) fall back rather than emitting a\n// declaration the browser will drop.\nexport function cssLength(value: unknown, fallback: string): string {\n  return typeof value === \"string\" && value.trim() ? value.trim() : fallback;\n}\n\n// duplicateIndex copies the item at `index` and inserts the copy after it.\n// Plain objects and arrays are cloned one level deep so editing the copy cannot\n// write through to the original.\nexport function duplicateIndex<T>(items: T[], index: number): T[] {\n  const source = items[index];\n  const copy = Array.isArray(source)\n    ? ([...source] as T)\n    : isPlainObject(source)\n      ? ({ ...source } as T)\n      : source;\n  const next = [...items];\n  next.splice(index + 1, 0, copy as T);\n  return next;\n}\n\n// withSyntheticValue prepends the current value as an option when it is not in\n// the enum, so an out-of-enum value (e.g. a template token) still displays.\nexport function withSyntheticValue(options: FieldOption[], value: string): FieldOption[] {\n  if (!value || options.some((o) => o.value === value)) return options;\n  return [{ value, label: value }, ...options];\n}\n\n// keyPickerOptions narrows the map-key enum to keys not already used by another\n// entry, while always keeping this row's current key so it stays selectable.\nexport function keyPickerOptions(\n  options: FieldOption[],\n  usedKeys: string[],\n  currentKey: string,\n): FieldOption[] {\n  const taken = new Set(usedKeys.filter((k) => k !== currentKey));\n  return options.filter((o) => !taken.has(o.value));\n}\n\n// matchesFieldFilter reports whether a property should stay visible under the\n// display-options field filter: a case-insensitive substring match against the\n// field's key and its display label (`title` when set, otherwise the key). A\n// blank filter matches everything, so an empty box never hides fields.\nexport function matchesFieldFilter(\n  key: string,\n  prop: JsonSchemaProperty,\n  filter: string,\n): boolean {\n  const query = filter.trim().toLowerCase();\n  if (!query) return true;\n  const label = typeof prop.title === \"string\" && prop.title ? prop.title : key;\n  return key.toLowerCase().includes(query) || label.toLowerCase().includes(query);\n}\n\n// orderByXOrder reorders property entries by the schema's `x-order` hint: keys\n// named there render first (in that order), the rest keep document order. A\n// missing/empty hint is a no-op, so document order remains the default.\nexport function orderByXOrder<T>(entries: [string, T][], order: unknown): [string, T][] {\n  if (!Array.isArray(order) || order.length === 0) return entries;\n  const rank = new Map(\n    order.filter((k): k is string => typeof k === \"string\").map((k, i) => [k, i]),\n  );\n  const listed = entries\n    .filter(([key]) => rank.has(key))\n    .sort((a, b) => rank.get(a[0])! - rank.get(b[0])!);\n  const rest = entries.filter(([key]) => !rank.has(key));\n  return [...listed, ...rest];\n}\n\n// orderByClickyOrder stably sorts property entries by each property's numeric\n// `x-clicky-order` (lower first); entries without it keep their incoming order\n// after the ordered ones. An explicit index tie-break keeps it stable regardless\n// of the engine's sort stability. Unlike the object-level `x-order` array, this\n// composes across merged if/then branches because each property carries its own\n// order — the right tool when fields come from different (embedded) sources.\nexport function orderByClickyOrder(\n  entries: [string, JsonSchemaProperty][],\n): [string, JsonSchemaProperty][] {\n  const rank = (prop: JsonSchemaProperty): number => {\n    const o = prop[\"x-clicky-order\"];\n    return typeof o === \"number\" ? o : Number.POSITIVE_INFINITY;\n  };\n  return entries\n    .map((entry, index) => ({ entry, index, rank: rank(entry[1]) }))\n    .sort((a, b) => a.rank - b.rank || a.index - b.index)\n    .map((ranked) => ranked.entry);\n}\n\n// orderRequiredFirst stably partitions property entries so the keys named in\n// `required` come first (in their original order), then the rest (in theirs).\n// A stable two-pass partition, so it never reshuffles within either group.\nexport function orderRequiredFirst<T>(\n  entries: [string, T][],\n  required: string[],\n): [string, T][] {\n  const isRequired = new Set(required);\n  const head = entries.filter(([key]) => isRequired.has(key));\n  const tail = entries.filter(([key]) => !isRequired.has(key));\n  return [...head, ...tail];\n}\n\n// isEmptyValue reports whether a field's value carries no data, so priority\n// sorting can sink unfilled fields. Empty = undefined/null/\"\" plus empty arrays\n// and empty plain objects; `false` and `0` count as filled (they are choices).\nexport function isEmptyValue(value: unknown): boolean {\n  if (value === undefined || value === null || value === \"\") return true;\n  if (Array.isArray(value)) return value.length === 0;\n  if (typeof value === \"object\") return Object.keys(value).length === 0;\n  return false;\n}\n\n// orderByPriority sorts property entries so the fields that matter most surface\n// first, ranking each by a score: +2 if required, +1 if its value is non-empty.\n// Required-and-filled lead, then required-and-empty, then optional-and-filled,\n// then optional-and-empty. Ties keep their incoming order (explicit index\n// tie-break, so it does not depend on the engine's sort stability).\nexport function orderByPriority<T>(\n  entries: [string, T][],\n  required: string[],\n  values: Record<string, unknown>,\n): [string, T][] {\n  const isRequired = new Set(required);\n  const score = (key: string): number =>\n    (isRequired.has(key) ? 2 : 0) + (isEmptyValue(values[key]) ? 0 : 1);\n  return entries\n    .map((entry, index) => ({ entry, index, score: score(entry[0]) }))\n    .sort((a, b) => b.score - a.score || a.index - b.index)\n    .map((ranked) => ranked.entry);\n}\n\n// softError computes a display-only validation hint. It never blocks onChange.\n// Consumers suppress the unknown-enum hint by setting allowCustomValue.\nexport function softError(field: FieldControl): string | undefined {\n  const v = field.value;\n  const isEmpty = v === undefined || v === null || v === \"\";\n  if (field.required && isEmpty) return \"Required\";\n\n  if (field.kind === \"number\" && typeof field.minimum === \"number\" && typeof v === \"number\") {\n    if (v < field.minimum) return `Must be ≥ ${field.minimum}`;\n  }\n\n  if (field.kind === \"enum\" && !field.allowCustomValue && !isEmpty) {\n    const known = (field.options ?? []).some((o) => o.value === String(v));\n    if (!known) return \"Unknown value (allowed)\";\n  }\n  return undefined;\n}\n\n// Immutable array helpers used by the array control.\nexport function setIndex<T>(arr: T[], i: number, v: T): T[] {\n  return arr.map((x, idx) => (idx === i ? v : x));\n}\n\nexport function removeIndex<T>(arr: T[], i: number): T[] {\n  return arr.filter((_, idx) => idx !== i);\n}\n\nexport function moveItem<T>(arr: T[], from: number, to: number): T[] {\n  if (to < 0 || to >= arr.length) return arr;\n  const next = [...arr];\n  const [moved] = next.splice(from, 1);\n  next.splice(to, 0, moved as T);\n  return next;\n}\n\n// seedFromSchema produces the initial value for a freshly-added array item or\n// object field, honouring an explicit default.\nexport function seedFromSchema(schema: JsonSchemaProperty): unknown {\n  if (schema.default !== undefined) return schema.default;\n  const type = Array.isArray(schema.type) ? schema.type[0] : schema.type;\n  if (type === \"array\") return [];\n  if (type === \"object\") return {};\n  if (type === \"boolean\") return false;\n  // Numbers seed as \"\" so the soft Required hint can show without coercion\n  // surprises; the number control coerces on first real input.\n  return \"\";\n}\n"],"names":["cn","inputSizeClass"],"mappings":";;;;AAWA,MAAM,aACJ;AAEK,SAAS,WAAW,MAAwB;AACjD,SAAOA,SAAG,YAAYC,mBAAAA,eAAe,IAAI,CAAC;AAC5C;AAUA,SAAS,aAAa,OAAuB;AAC3C,MAAI,UAAU,GAAI,QAAO;AACzB,SAAO,MAAM,QAAQ,iBAAiB,CAAC,SAAS,IAAI,KAAK,WAAW,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG;AACxF;AAWO,SAAS,aAAa,cAAsB,QAAyB;AAC1E,QAAM,SAAS,iBAAiB,KAAK,KAAK,aAAa,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG;AACnF,QAAM,OAAO,OACV,IAAI,CAAC,UAAU,aAAa,MAAM,WAAW,MAAM,GAAG,EAAE,WAAW,MAAM,GAAG,CAAC,CAAC,EAC9E,KAAK,GAAG;AACX,SAAO,SAAS,OAAO,aAAa,MAAM,CAAC,IAAI,IAAI,KAAK,OAAO,IAAI;AACrE;AAIO,SAAS,aAAa,SAAyB;AACpD,SAAO,GAAG,OAAO;AACnB;AAKO,SAAS,eACd,OACA,SAKA;AACA,SAAO;AAAA,IACL,GAAI,MAAM,WAAW,EAAE,iBAAiB,KAAA,IAAkB,CAAA;AAAA,IAC1D,GAAI,MAAM,UAAU,EAAE,gBAAgB,MAAe,oBAAoB,aAAa,OAAO,MAAM,CAAA;AAAA,EAAC;AAExG;AAIO,SAAS,kBACd,OACA,SAC+D;AAC/D,SAAO;AAAA,IACL,GAAI,MAAM,WAAW,EAAE,cAAc,KAAA,IAAkB,CAAA;AAAA,IACvD,GAAI,MAAM,UAAU,EAAE,SAAS,MAAe,aAAa,aAAa,OAAO,MAAM,CAAA;AAAA,EAAC;AAE1F;AAEO,SAAS,mBAAmB,QAAoC;AACrE,MAAI,OAAO,WAAW,QAAQ,OAAO,OAAO,YAAY,SAAU,QAAO,OAAO,OAAO,OAAO;AAC9F,SAAO;AACT;AAEO,SAAS,OAAO,OAAwB;AAC7C,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,SAAO,OAAO,KAAK;AACrB;AAEO,SAAS,cAAc,OAAkD;AAC9E,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;AAKO,SAAS,wBACd,OACS;AACT,SACE,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,cAAc,OAAO,KAAK,MAAM,UAAU,EAAE,SAAS;AAE5E;AAMO,SAAS,iBAAiB,OAA6B;AAC5D,MAAI,UAAU,OAAQ,QAAO;AAC7B,QAAM,IAAI,OAAO,UAAU,WAAW,QAAQ,OAAO,KAAK;AAC1D,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,EAAG,QAAO;AACzC,SAAO,KAAK,IAAI,KAAK,MAAM,CAAC,GAAG,EAAE;AACnC;AAMO,SAAS,iBACd,OACA,SACiB;AACjB,MAAI,UAAU,OAAQ,QAAO;AAC7B,QAAM,IAAI,OAAO,UAAU,WAAW,QAAQ,OAAO,KAAK;AAC1D,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,EAAG,QAAO;AACzC,SAAO,KAAK,IAAI,KAAK,MAAM,CAAC,GAAG,YAAY,SAAS,KAAK,OAAO;AAClE;AAIO,MAAM,2BAA2B;AAKjC,SAAS,UAAU,OAAgB,UAA0B;AAClE,SAAO,OAAO,UAAU,YAAY,MAAM,SAAS,MAAM,SAAS;AACpE;AAKO,SAAS,eAAkB,OAAY,OAAoB;AAChE,QAAM,SAAS,MAAM,KAAK;AAC1B,QAAM,OAAO,MAAM,QAAQ,MAAM,IAC5B,CAAC,GAAG,MAAM,IACX,cAAc,MAAM,IACjB,EAAE,GAAG,WACN;AACN,QAAM,OAAO,CAAC,GAAG,KAAK;AACtB,OAAK,OAAO,QAAQ,GAAG,GAAG,IAAS;AACnC,SAAO;AACT;AAIO,SAAS,mBAAmB,SAAwB,OAA8B;AACvF,MAAI,CAAC,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,UAAU,KAAK,EAAG,QAAO;AAC7D,SAAO,CAAC,EAAE,OAAO,OAAO,MAAA,GAAS,GAAG,OAAO;AAC7C;AAIO,SAAS,iBACd,SACA,UACA,YACe;AACf,QAAM,QAAQ,IAAI,IAAI,SAAS,OAAO,CAAC,MAAM,MAAM,UAAU,CAAC;AAC9D,SAAO,QAAQ,OAAO,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,KAAK,CAAC;AAClD;AAMO,SAAS,mBACd,KACA,MACA,QACS;AACT,QAAM,QAAQ,OAAO,KAAA,EAAO,YAAA;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,QAAQ,OAAO,KAAK,UAAU,YAAY,KAAK,QAAQ,KAAK,QAAQ;AAC1E,SAAO,IAAI,YAAA,EAAc,SAAS,KAAK,KAAK,MAAM,YAAA,EAAc,SAAS,KAAK;AAChF;AAKO,SAAS,cAAiB,SAAwB,OAA+B;AACtF,MAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,EAAG,QAAO;AACxD,QAAM,OAAO,IAAI;AAAA,IACf,MAAM,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;AAAA,EAAA;AAE9E,QAAM,SAAS,QACZ,OAAO,CAAC,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,EAC/B,KAAK,CAAC,GAAG,MAAM,KAAK,IAAI,EAAE,CAAC,CAAC,IAAK,KAAK,IAAI,EAAE,CAAC,CAAC,CAAE;AACnD,QAAM,OAAO,QAAQ,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,IAAI,GAAG,CAAC;AACrD,SAAO,CAAC,GAAG,QAAQ,GAAG,IAAI;AAC5B;AAQO,SAAS,mBACd,SACgC;AAChC,QAAM,OAAO,CAAC,SAAqC;AACjD,UAAM,IAAI,KAAK,gBAAgB;AAC/B,WAAO,OAAO,MAAM,WAAW,IAAI,OAAO;AAAA,EAC5C;AACA,SAAO,QACJ,IAAI,CAAC,OAAO,WAAW,EAAE,OAAO,OAAO,MAAM,KAAK,MAAM,CAAC,CAAC,IAAI,EAC9D,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EACnD,IAAI,CAAC,WAAW,OAAO,KAAK;AACjC;AAKO,SAAS,mBACd,SACA,UACe;AACf,QAAM,aAAa,IAAI,IAAI,QAAQ;AACnC,QAAM,OAAO,QAAQ,OAAO,CAAC,CAAC,GAAG,MAAM,WAAW,IAAI,GAAG,CAAC;AAC1D,QAAM,OAAO,QAAQ,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,WAAW,IAAI,GAAG,CAAC;AAC3D,SAAO,CAAC,GAAG,MAAM,GAAG,IAAI;AAC1B;AAKO,SAAS,aAAa,OAAyB;AACpD,MAAI,UAAU,UAAa,UAAU,QAAQ,UAAU,GAAI,QAAO;AAClE,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,WAAW;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO,OAAO,KAAK,KAAK,EAAE,WAAW;AACpE,SAAO;AACT;AAOO,SAAS,gBACd,SACA,UACA,QACe;AACf,QAAM,aAAa,IAAI,IAAI,QAAQ;AACnC,QAAM,QAAQ,CAAC,SACZ,WAAW,IAAI,GAAG,IAAI,IAAI,MAAM,aAAa,OAAO,GAAG,CAAC,IAAI,IAAI;AACnE,SAAO,QACJ,IAAI,CAAC,OAAO,WAAW,EAAE,OAAO,OAAO,OAAO,MAAM,MAAM,CAAC,CAAC,IAAI,EAChE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EACrD,IAAI,CAAC,WAAW,OAAO,KAAK;AACjC;AAIO,SAAS,UAAU,OAAyC;AACjE,QAAM,IAAI,MAAM;AAChB,QAAM,UAAU,MAAM,UAAa,MAAM,QAAQ,MAAM;AACvD,MAAI,MAAM,YAAY,QAAS,QAAO;AAEtC,MAAI,MAAM,SAAS,YAAY,OAAO,MAAM,YAAY,YAAY,OAAO,MAAM,UAAU;AACzF,QAAI,IAAI,MAAM,QAAS,QAAO,aAAa,MAAM,OAAO;AAAA,EAC1D;AAEA,MAAI,MAAM,SAAS,UAAU,CAAC,MAAM,oBAAoB,CAAC,SAAS;AAChE,UAAM,SAAS,MAAM,WAAW,CAAA,GAAI,KAAK,CAAC,MAAM,EAAE,UAAU,OAAO,CAAC,CAAC;AACrE,QAAI,CAAC,MAAO,QAAO;AAAA,EACrB;AACA,SAAO;AACT;AAGO,SAAS,SAAY,KAAU,GAAW,GAAW;AAC1D,SAAO,IAAI,IAAI,CAAC,GAAG,QAAS,QAAQ,IAAI,IAAI,CAAE;AAChD;AAEO,SAAS,YAAe,KAAU,GAAgB;AACvD,SAAO,IAAI,OAAO,CAAC,GAAG,QAAQ,QAAQ,CAAC;AACzC;AAEO,SAAS,SAAY,KAAU,MAAc,IAAiB;AACnE,MAAI,KAAK,KAAK,MAAM,IAAI,OAAQ,QAAO;AACvC,QAAM,OAAO,CAAC,GAAG,GAAG;AACpB,QAAM,CAAC,KAAK,IAAI,KAAK,OAAO,MAAM,CAAC;AACnC,OAAK,OAAO,IAAI,GAAG,KAAU;AAC7B,SAAO;AACT;AAIO,SAAS,eAAe,QAAqC;AAClE,MAAI,OAAO,YAAY,OAAW,QAAO,OAAO;AAChD,QAAM,OAAO,MAAM,QAAQ,OAAO,IAAI,IAAI,OAAO,KAAK,CAAC,IAAI,OAAO;AAClE,MAAI,SAAS,QAAS,QAAO,CAAA;AAC7B,MAAI,SAAS,SAAU,QAAO,CAAA;AAC9B,MAAI,SAAS,UAAW,QAAO;AAG/B,SAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"json-schema-form-utils.cjs","sources":["../../src/components/json-schema-form-utils.ts"],"sourcesContent":["import { cn } from \"../lib/utils\";\nimport { inputSizeClass, type FormSize } from \"./json-schema-form-size\";\nimport type {\n  FieldControl,\n  FieldOption,\n  GridColumns,\n  JsonSchemaProperty,\n} from \"./json-schema-form-types\";\n\n// Non-size styling shared by every text-like input box; the size token supplies\n// height, horizontal padding, and text size (see inputSizeClass).\nconst INPUT_BASE =\n  \"w-full min-w-0 rounded-md border border-input bg-background text-foreground outline-none placeholder:text-placeholder disabled:cursor-not-allowed disabled:bg-muted/40 focus-visible:ring-2 focus-visible:ring-ring\";\n\nexport function inputClass(size: FormSize): string {\n  return cn(INPUT_BASE, inputSizeClass[size]);\n}\n\n// encodeIdPart escapes one path token (or the id prefix) injectively: every\n// character outside [A-Za-z0-9] becomes `_<hex char code>_`, and the empty token\n// — a legal JSON Schema property name — becomes a lone `_`. The escape is\n// self-delimiting (it always starts and ends with `_`, and a literal `_` escapes\n// to `_5f_`), so distinct tokens can never share an encoding and `-` stays free\n// as a segment separator. Percent-encoding was rejected because `%` in an id,\n// while legal HTML, has to be escaped again inside a `#id` CSS selector; this\n// alphabet ([A-Za-z0-9_-]) is safe as-is for `document.querySelector`.\nfunction encodeIdPart(value: string): string {\n  if (value === \"\") return \"_\";\n  return value.replace(/[^A-Za-z0-9]/g, (char) => `_${char.charCodeAt(0).toString(16)}_`);\n}\n\n// fieldInputId derives a control's DOM id from its JSON-pointer instance path,\n// not from its leaf key: a schema that repeats a property name under two parents\n// (e.g. /journalLine1/asset and /journalLine2/asset) must not produce the same\n// id, or every `label[for]` binds to the first control. Each decoded pointer\n// token is escaped with encodeIdPart and joined with \"-\", so distinct paths\n// always produce distinct ids: \"/asset-class\", \"/asset_class\", \"/asset.class\"\n// and \"/asset/class\" are four different ids, and an empty token is preserved\n// (\"/a//b\" ≠ \"/a/b\"). The prefix is escaped the same way, so prefix \"a\" + \"/b-c\"\n// cannot collide with prefix \"a-b\" + \"/c\".\nexport function fieldInputId(instancePath: string, prefix?: string): string {\n  const tokens = instancePath === \"\" ? [] : instancePath.replace(/^\\//, \"\").split(\"/\");\n  const safe = tokens\n    .map((token) => encodeIdPart(token.replaceAll(\"~1\", \"/\").replaceAll(\"~0\", \"~\")))\n    .join(\"-\");\n  return prefix ? `jsf-${encodeIdPart(prefix)}-${safe}` : `jsf-${safe}`;\n}\n\n// fieldErrorId names the element that holds a field's validation messages, so a\n// control can point at it with aria-describedby.\nexport function fieldErrorId(fieldId: string): string {\n  return `${fieldId}-error`;\n}\n\n// fieldAriaProps is the assistive-technology half of a control: the visual `*`\n// and red message mean nothing to a screen reader on their own, so every\n// editable control spreads these onto its input element.\nexport function fieldAriaProps(\n  field: FieldControl,\n  fieldId: string,\n): {\n  \"aria-required\"?: true;\n  \"aria-invalid\"?: true;\n  \"aria-describedby\"?: string;\n} {\n  return {\n    ...(field.required ? { \"aria-required\": true as const } : {}),\n    ...(field.invalid ? { \"aria-invalid\": true as const, \"aria-describedby\": fieldErrorId(fieldId) } : {}),\n  };\n}\n\n// comboboxAriaProps is the fieldAriaProps equivalent for Combobox, which takes\n// the same state as named props rather than raw aria-* attributes.\nexport function comboboxAriaProps(\n  field: FieldControl,\n  fieldId: string,\n): { ariaRequired?: true; invalid?: true; describedBy?: string } {\n  return {\n    ...(field.required ? { ariaRequired: true as const } : {}),\n    ...(field.invalid ? { invalid: true as const, describedBy: fieldErrorId(fieldId) } : {}),\n  };\n}\n\nexport function defaultPlaceholder(schema: JsonSchemaProperty): string {\n  if (schema.default != null && typeof schema.default !== \"object\") return String(schema.default);\n  return \"\";\n}\n\nexport function toText(value: unknown): string {\n  if (value === undefined || value === null) return \"\";\n  if (typeof value === \"object\") return \"\";\n  return String(value);\n}\n\n// toStringArray normalises the committed value of a multi-value control. The\n// schema types it as an array of strings, but a form mid-edit can hold anything,\n// so a non-string entry is dropped rather than rendered as a broken tag.\nexport function toStringArray(value: unknown): string[] {\n  if (!Array.isArray(value)) return [];\n  return value.filter((entry): entry is string => typeof entry === \"string\");\n}\n\n// hasObjectItemProperties reports whether an array's items are objects with a\n// fixed `properties` set — the precondition for both the column-per-property\n// table and the summary-row accordion, which need to know the item's shape.\nexport function hasObjectItemProperties(\n  items: JsonSchemaProperty | undefined,\n): boolean {\n  return (\n    !!items && !!items.properties && Object.keys(items.properties).length > 0\n  );\n}\n\n// Object-level `x-columns`: how many equal columns to split a stacked object\n// into. \"auto\" fits as many as the width allows. A number is clamped to [1, 12]\n// (a standard 12-track grid, so a 3-across row of span-4 fields and a 4-across\n// row of span-3 fields share one object); anything invalid is a single column.\nexport function normalizeColumns(value: unknown): GridColumns {\n  if (value === \"auto\") return \"auto\";\n  const n = typeof value === \"number\" ? value : Number(value);\n  if (!Number.isFinite(n) || n < 1) return 1;\n  return Math.min(Math.trunc(n), 12);\n}\n\n// Per-field `x-col-span`: how many of the object's columns a field occupies.\n// \"full\" spans the whole row. Under `x-columns: \"auto\"` a numeric span cannot be\n// clamped against a track count that only exists at layout time, so it is capped\n// at the 12-track maximum instead. Invalid falls back to 1.\nexport function normalizeColSpan(\n  value: unknown,\n  columns: GridColumns,\n): number | \"full\" {\n  if (value === \"full\") return \"full\";\n  const n = typeof value === \"number\" ? value : Number(value);\n  if (!Number.isFinite(n) || n < 1) return 1;\n  return Math.min(Math.trunc(n), columns === \"auto\" ? 12 : columns);\n}\n\n// The `x-columns: \"auto\"` column floor: wide enough for a labelled control to\n// stay readable, narrow enough that a 1440px pane gets three columns, not two.\nexport const DEFAULT_COLUMN_MIN_WIDTH = \"15rem\";\n\n// cssLength guards a schema-supplied CSS length before it reaches an inline\n// style. Non-strings (and the empty string) fall back rather than emitting a\n// declaration the browser will drop.\nexport function cssLength(value: unknown, fallback: string): string {\n  return typeof value === \"string\" && value.trim() ? value.trim() : fallback;\n}\n\n// withSyntheticValue prepends the current value as an option when it is not in\n// the enum, so an out-of-enum value (e.g. a template token) still displays.\nexport function withSyntheticValue(options: FieldOption[], value: string): FieldOption[] {\n  if (!value || options.some((o) => o.value === value)) return options;\n  return [{ value, label: value }, ...options];\n}\n\n// keyPickerOptions narrows the map-key enum to keys not already used by another\n// entry, while always keeping this row's current key so it stays selectable.\nexport function keyPickerOptions(\n  options: FieldOption[],\n  usedKeys: string[],\n  currentKey: string,\n): FieldOption[] {\n  const taken = new Set(usedKeys.filter((k) => k !== currentKey));\n  return options.filter((o) => !taken.has(o.value));\n}\n\n// matchesFieldFilter reports whether a property should stay visible under the\n// display-options field filter: a case-insensitive substring match against the\n// field's key and its display label (`title` when set, otherwise the key). A\n// blank filter matches everything, so an empty box never hides fields.\nexport function matchesFieldFilter(\n  key: string,\n  prop: JsonSchemaProperty,\n  filter: string,\n): boolean {\n  const query = filter.trim().toLowerCase();\n  if (!query) return true;\n  const label = typeof prop.title === \"string\" && prop.title ? prop.title : key;\n  return key.toLowerCase().includes(query) || label.toLowerCase().includes(query);\n}\n\n// orderByXOrder reorders property entries by the schema's `x-order` hint: keys\n// named there render first (in that order), the rest keep document order. A\n// missing/empty hint is a no-op, so document order remains the default.\nexport function orderByXOrder<T>(entries: [string, T][], order: unknown): [string, T][] {\n  if (!Array.isArray(order) || order.length === 0) return entries;\n  const rank = new Map(\n    order.filter((k): k is string => typeof k === \"string\").map((k, i) => [k, i]),\n  );\n  const listed = entries\n    .filter(([key]) => rank.has(key))\n    .sort((a, b) => rank.get(a[0])! - rank.get(b[0])!);\n  const rest = entries.filter(([key]) => !rank.has(key));\n  return [...listed, ...rest];\n}\n\n// orderByClickyOrder stably sorts property entries by each property's numeric\n// `x-clicky-order` (lower first); entries without it keep their incoming order\n// after the ordered ones. An explicit index tie-break keeps it stable regardless\n// of the engine's sort stability. Unlike the object-level `x-order` array, this\n// composes across merged if/then branches because each property carries its own\n// order — the right tool when fields come from different (embedded) sources.\nexport function orderByClickyOrder(\n  entries: [string, JsonSchemaProperty][],\n): [string, JsonSchemaProperty][] {\n  const rank = (prop: JsonSchemaProperty): number => {\n    const o = prop[\"x-clicky-order\"];\n    return typeof o === \"number\" ? o : Number.POSITIVE_INFINITY;\n  };\n  return entries\n    .map((entry, index) => ({ entry, index, rank: rank(entry[1]) }))\n    .sort((a, b) => a.rank - b.rank || a.index - b.index)\n    .map((ranked) => ranked.entry);\n}\n\n// orderRequiredFirst stably partitions property entries so the keys named in\n// `required` come first (in their original order), then the rest (in theirs).\n// A stable two-pass partition, so it never reshuffles within either group.\nexport function orderRequiredFirst<T>(\n  entries: [string, T][],\n  required: string[],\n): [string, T][] {\n  const isRequired = new Set(required);\n  const head = entries.filter(([key]) => isRequired.has(key));\n  const tail = entries.filter(([key]) => !isRequired.has(key));\n  return [...head, ...tail];\n}\n\n// isEmptyValue reports whether a field's value carries no data, so priority\n// sorting can sink unfilled fields. Empty = undefined/null/\"\" plus empty arrays\n// and empty plain objects; `false` and `0` count as filled (they are choices).\nexport function isEmptyValue(value: unknown): boolean {\n  if (value === undefined || value === null || value === \"\") return true;\n  if (Array.isArray(value)) return value.length === 0;\n  if (typeof value === \"object\") return Object.keys(value).length === 0;\n  return false;\n}\n\n// orderByPriority sorts property entries so the fields that matter most surface\n// first, ranking each by a score: +2 if required, +1 if its value is non-empty.\n// Required-and-filled lead, then required-and-empty, then optional-and-filled,\n// then optional-and-empty. Ties keep their incoming order (explicit index\n// tie-break, so it does not depend on the engine's sort stability).\nexport function orderByPriority<T>(\n  entries: [string, T][],\n  required: string[],\n  values: Record<string, unknown>,\n): [string, T][] {\n  const isRequired = new Set(required);\n  const score = (key: string): number =>\n    (isRequired.has(key) ? 2 : 0) + (isEmptyValue(values[key]) ? 0 : 1);\n  return entries\n    .map((entry, index) => ({ entry, index, score: score(entry[0]) }))\n    .sort((a, b) => b.score - a.score || a.index - b.index)\n    .map((ranked) => ranked.entry);\n}\n\n// softError computes a display-only validation hint. It never blocks onChange.\n// Consumers suppress the unknown-enum hint by setting allowCustomValue.\nexport function softError(field: FieldControl): string | undefined {\n  const v = field.value;\n  const isEmpty = v === undefined || v === null || v === \"\";\n  if (field.required && isEmpty) return \"Required\";\n\n  if (field.kind === \"number\" && typeof field.minimum === \"number\" && typeof v === \"number\") {\n    if (v < field.minimum) return `Must be ≥ ${field.minimum}`;\n  }\n\n  if (field.kind === \"enum\" && !field.allowCustomValue && !isEmpty) {\n    const known = (field.options ?? []).some((o) => o.value === String(v));\n    if (!known) return \"Unknown value (allowed)\";\n  }\n  return undefined;\n}\n\n// seedFromSchema produces the initial value for a freshly-added array item or\n// object field, honouring an explicit default.\nexport function seedFromSchema(schema: JsonSchemaProperty): unknown {\n  if (schema.default !== undefined) return schema.default;\n  const type = Array.isArray(schema.type) ? schema.type[0] : schema.type;\n  if (type === \"array\") return [];\n  if (type === \"object\") return {};\n  if (type === \"boolean\") return false;\n  // Numbers seed as \"\" so the soft Required hint can show without coercion\n  // surprises; the number control coerces on first real input.\n  return \"\";\n}\n"],"names":["cn","inputSizeClass"],"mappings":";;;;AAWA,MAAM,aACJ;AAEK,SAAS,WAAW,MAAwB;AACjD,SAAOA,SAAG,YAAYC,mBAAAA,eAAe,IAAI,CAAC;AAC5C;AAUA,SAAS,aAAa,OAAuB;AAC3C,MAAI,UAAU,GAAI,QAAO;AACzB,SAAO,MAAM,QAAQ,iBAAiB,CAAC,SAAS,IAAI,KAAK,WAAW,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG;AACxF;AAWO,SAAS,aAAa,cAAsB,QAAyB;AAC1E,QAAM,SAAS,iBAAiB,KAAK,KAAK,aAAa,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG;AACnF,QAAM,OAAO,OACV,IAAI,CAAC,UAAU,aAAa,MAAM,WAAW,MAAM,GAAG,EAAE,WAAW,MAAM,GAAG,CAAC,CAAC,EAC9E,KAAK,GAAG;AACX,SAAO,SAAS,OAAO,aAAa,MAAM,CAAC,IAAI,IAAI,KAAK,OAAO,IAAI;AACrE;AAIO,SAAS,aAAa,SAAyB;AACpD,SAAO,GAAG,OAAO;AACnB;AAKO,SAAS,eACd,OACA,SAKA;AACA,SAAO;AAAA,IACL,GAAI,MAAM,WAAW,EAAE,iBAAiB,KAAA,IAAkB,CAAA;AAAA,IAC1D,GAAI,MAAM,UAAU,EAAE,gBAAgB,MAAe,oBAAoB,aAAa,OAAO,MAAM,CAAA;AAAA,EAAC;AAExG;AAIO,SAAS,kBACd,OACA,SAC+D;AAC/D,SAAO;AAAA,IACL,GAAI,MAAM,WAAW,EAAE,cAAc,KAAA,IAAkB,CAAA;AAAA,IACvD,GAAI,MAAM,UAAU,EAAE,SAAS,MAAe,aAAa,aAAa,OAAO,MAAM,CAAA;AAAA,EAAC;AAE1F;AAEO,SAAS,mBAAmB,QAAoC;AACrE,MAAI,OAAO,WAAW,QAAQ,OAAO,OAAO,YAAY,SAAU,QAAO,OAAO,OAAO,OAAO;AAC9F,SAAO;AACT;AAEO,SAAS,OAAO,OAAwB;AAC7C,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,SAAO,OAAO,KAAK;AACrB;AAKO,SAAS,cAAc,OAA0B;AACtD,MAAI,CAAC,MAAM,QAAQ,KAAK,UAAU,CAAA;AAClC,SAAO,MAAM,OAAO,CAAC,UAA2B,OAAO,UAAU,QAAQ;AAC3E;AAKO,SAAS,wBACd,OACS;AACT,SACE,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,cAAc,OAAO,KAAK,MAAM,UAAU,EAAE,SAAS;AAE5E;AAMO,SAAS,iBAAiB,OAA6B;AAC5D,MAAI,UAAU,OAAQ,QAAO;AAC7B,QAAM,IAAI,OAAO,UAAU,WAAW,QAAQ,OAAO,KAAK;AAC1D,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,EAAG,QAAO;AACzC,SAAO,KAAK,IAAI,KAAK,MAAM,CAAC,GAAG,EAAE;AACnC;AAMO,SAAS,iBACd,OACA,SACiB;AACjB,MAAI,UAAU,OAAQ,QAAO;AAC7B,QAAM,IAAI,OAAO,UAAU,WAAW,QAAQ,OAAO,KAAK;AAC1D,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,EAAG,QAAO;AACzC,SAAO,KAAK,IAAI,KAAK,MAAM,CAAC,GAAG,YAAY,SAAS,KAAK,OAAO;AAClE;AAIO,MAAM,2BAA2B;AAKjC,SAAS,UAAU,OAAgB,UAA0B;AAClE,SAAO,OAAO,UAAU,YAAY,MAAM,SAAS,MAAM,SAAS;AACpE;AAIO,SAAS,mBAAmB,SAAwB,OAA8B;AACvF,MAAI,CAAC,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,UAAU,KAAK,EAAG,QAAO;AAC7D,SAAO,CAAC,EAAE,OAAO,OAAO,MAAA,GAAS,GAAG,OAAO;AAC7C;AAIO,SAAS,iBACd,SACA,UACA,YACe;AACf,QAAM,QAAQ,IAAI,IAAI,SAAS,OAAO,CAAC,MAAM,MAAM,UAAU,CAAC;AAC9D,SAAO,QAAQ,OAAO,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,KAAK,CAAC;AAClD;AAMO,SAAS,mBACd,KACA,MACA,QACS;AACT,QAAM,QAAQ,OAAO,KAAA,EAAO,YAAA;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,QAAQ,OAAO,KAAK,UAAU,YAAY,KAAK,QAAQ,KAAK,QAAQ;AAC1E,SAAO,IAAI,YAAA,EAAc,SAAS,KAAK,KAAK,MAAM,YAAA,EAAc,SAAS,KAAK;AAChF;AAKO,SAAS,cAAiB,SAAwB,OAA+B;AACtF,MAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,EAAG,QAAO;AACxD,QAAM,OAAO,IAAI;AAAA,IACf,MAAM,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;AAAA,EAAA;AAE9E,QAAM,SAAS,QACZ,OAAO,CAAC,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,EAC/B,KAAK,CAAC,GAAG,MAAM,KAAK,IAAI,EAAE,CAAC,CAAC,IAAK,KAAK,IAAI,EAAE,CAAC,CAAC,CAAE;AACnD,QAAM,OAAO,QAAQ,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,IAAI,GAAG,CAAC;AACrD,SAAO,CAAC,GAAG,QAAQ,GAAG,IAAI;AAC5B;AAQO,SAAS,mBACd,SACgC;AAChC,QAAM,OAAO,CAAC,SAAqC;AACjD,UAAM,IAAI,KAAK,gBAAgB;AAC/B,WAAO,OAAO,MAAM,WAAW,IAAI,OAAO;AAAA,EAC5C;AACA,SAAO,QACJ,IAAI,CAAC,OAAO,WAAW,EAAE,OAAO,OAAO,MAAM,KAAK,MAAM,CAAC,CAAC,IAAI,EAC9D,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EACnD,IAAI,CAAC,WAAW,OAAO,KAAK;AACjC;AAKO,SAAS,mBACd,SACA,UACe;AACf,QAAM,aAAa,IAAI,IAAI,QAAQ;AACnC,QAAM,OAAO,QAAQ,OAAO,CAAC,CAAC,GAAG,MAAM,WAAW,IAAI,GAAG,CAAC;AAC1D,QAAM,OAAO,QAAQ,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,WAAW,IAAI,GAAG,CAAC;AAC3D,SAAO,CAAC,GAAG,MAAM,GAAG,IAAI;AAC1B;AAKO,SAAS,aAAa,OAAyB;AACpD,MAAI,UAAU,UAAa,UAAU,QAAQ,UAAU,GAAI,QAAO;AAClE,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,WAAW;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO,OAAO,KAAK,KAAK,EAAE,WAAW;AACpE,SAAO;AACT;AAOO,SAAS,gBACd,SACA,UACA,QACe;AACf,QAAM,aAAa,IAAI,IAAI,QAAQ;AACnC,QAAM,QAAQ,CAAC,SACZ,WAAW,IAAI,GAAG,IAAI,IAAI,MAAM,aAAa,OAAO,GAAG,CAAC,IAAI,IAAI;AACnE,SAAO,QACJ,IAAI,CAAC,OAAO,WAAW,EAAE,OAAO,OAAO,OAAO,MAAM,MAAM,CAAC,CAAC,IAAI,EAChE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EACrD,IAAI,CAAC,WAAW,OAAO,KAAK;AACjC;AAIO,SAAS,UAAU,OAAyC;AACjE,QAAM,IAAI,MAAM;AAChB,QAAM,UAAU,MAAM,UAAa,MAAM,QAAQ,MAAM;AACvD,MAAI,MAAM,YAAY,QAAS,QAAO;AAEtC,MAAI,MAAM,SAAS,YAAY,OAAO,MAAM,YAAY,YAAY,OAAO,MAAM,UAAU;AACzF,QAAI,IAAI,MAAM,QAAS,QAAO,aAAa,MAAM,OAAO;AAAA,EAC1D;AAEA,MAAI,MAAM,SAAS,UAAU,CAAC,MAAM,oBAAoB,CAAC,SAAS;AAChE,UAAM,SAAS,MAAM,WAAW,CAAA,GAAI,KAAK,CAAC,MAAM,EAAE,UAAU,OAAO,CAAC,CAAC;AACrE,QAAI,CAAC,MAAO,QAAO;AAAA,EACrB;AACA,SAAO;AACT;AAIO,SAAS,eAAe,QAAqC;AAClE,MAAI,OAAO,YAAY,OAAW,QAAO,OAAO;AAChD,QAAM,OAAO,MAAM,QAAQ,OAAO,IAAI,IAAI,OAAO,KAAK,CAAC,IAAI,OAAO;AAClE,MAAI,SAAS,QAAS,QAAO,CAAA;AAC7B,MAAI,SAAS,SAAU,QAAO,CAAA;AAC9B,MAAI,SAAS,UAAW,QAAO;AAG/B,SAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/components/json-schema-form-utils.d.ts

@@ -15,13 +15,12 @@ export declare function comboboxAriaProps(field: FieldControl, fieldId: string):
 };
 export declare function defaultPlaceholder(schema: JsonSchemaProperty): string;
 export declare function toText(value: unknown): string;
-export declare function isPlainObject(value: unknown): value is Record<string, unknown>;
+export declare function toStringArray(value: unknown): string[];
 export declare function hasObjectItemProperties(items: JsonSchemaProperty | undefined): boolean;
 export declare function normalizeColumns(value: unknown): GridColumns;
 export declare function normalizeColSpan(value: unknown, columns: GridColumns): number | "full";
 export declare const DEFAULT_COLUMN_MIN_WIDTH = "15rem";
 export declare function cssLength(value: unknown, fallback: string): string;
-export declare function duplicateIndex<T>(items: T[], index: number): T[];
 export declare function withSyntheticValue(options: FieldOption[], value: string): FieldOption[];
 export declare function keyPickerOptions(options: FieldOption[], usedKeys: string[], currentKey: string): FieldOption[];
 export declare function matchesFieldFilter(key: string, prop: JsonSchemaProperty, filter: string): boolean;
@@ -31,8 +30,5 @@ export declare function orderRequiredFirst<T>(entries: [string, T][], required:
 export declare function isEmptyValue(value: unknown): boolean;
 export declare function orderByPriority<T>(entries: [string, T][], required: string[], values: Record<string, unknown>): [string, T][];
 export declare function softError(field: FieldControl): string | undefined;
-export declare function setIndex<T>(arr: T[], i: number, v: T): T[];
-export declare function removeIndex<T>(arr: T[], i: number): T[];
-export declare function moveItem<T>(arr: T[], from: number, to: number): T[];
 export declare function seedFromSchema(schema: JsonSchemaProperty): unknown;
 //# sourceMappingURL=json-schema-form-utils.d.ts.map

package/dist/components/json-schema-form-utils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"json-schema-form-utils.d.ts","sourceRoot":"","sources":["../../src/components/json-schema-form-utils.ts"],"names":[],"mappings":"AACA,OAAO,EAAkB,KAAK,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AACxE,OAAO,KAAK,EACV,YAAY,EACZ,WAAW,EACX,WAAW,EACX,kBAAkB,EACnB,MAAM,0BAA0B,CAAC;AAOlC,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAEjD;AAwBD,wBAAgB,YAAY,CAAC,YAAY,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAM1E;AAID,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAEpD;AAKD,wBAAgB,cAAc,CAC5B,KAAK,EAAE,YAAY,EACnB,OAAO,EAAE,MAAM,GACd;IACD,eAAe,CAAC,EAAE,IAAI,CAAC;IACvB,cAAc,CAAC,EAAE,IAAI,CAAC;IACtB,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC7B,CAKA;AAID,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,YAAY,EACnB,OAAO,EAAE,MAAM,GACd;IAAE,YAAY,CAAC,EAAE,IAAI,CAAC;IAAC,OAAO,CAAC,EAAE,IAAI,CAAC;IAAC,WAAW,CAAC,EAAE,MAAM,CAAA;CAAE,CAK/D;AAED,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,kBAAkB,GAAG,MAAM,CAGrE;AAED,wBAAgB,MAAM,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAI7C;AAED,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAE9E;AAKD,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,kBAAkB,GAAG,SAAS,GACpC,OAAO,CAIT;AAMD,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,WAAW,CAK5D;AAMD,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,OAAO,EACd,OAAO,EAAE,WAAW,GACnB,MAAM,GAAG,MAAM,CAKjB;AAID,eAAO,MAAM,wBAAwB,UAAU,CAAC;AAKhD,wBAAgB,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAElE;AAKD,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE,CAUhE;AAID,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,WAAW,EAAE,CAGvF;AAID,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,WAAW,EAAE,EACtB,QAAQ,EAAE,MAAM,EAAE,EAClB,UAAU,EAAE,MAAM,GACjB,WAAW,EAAE,CAGf;AAMD,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,kBAAkB,EACxB,MAAM,EAAE,MAAM,GACb,OAAO,CAKT;AAKD,wBAAgB,aAAa,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAUtF;AAQD,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,CAAC,MAAM,EAAE,kBAAkB,CAAC,EAAE,GACtC,CAAC,MAAM,EAAE,kBAAkB,CAAC,EAAE,CAShC;AAKD,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EACtB,QAAQ,EAAE,MAAM,EAAE,GACjB,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAKf;AAKD,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAKpD;AAOD,wBAAgB,eAAe,CAAC,CAAC,EAC/B,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EACtB,QAAQ,EAAE,MAAM,EAAE,EAClB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC9B,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAQf;AAID,wBAAgB,SAAS,CAAC,KAAK,EAAE,YAAY,GAAG,MAAM,GAAG,SAAS,CAcjE;AAGD,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAE1D;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,CAEvD;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,CAAC,EAAE,CAMnE;AAID,wBAAgB,cAAc,CAAC,MAAM,EAAE,kBAAkB,GAAG,OAAO,CASlE"}
+{"version":3,"file":"json-schema-form-utils.d.ts","sourceRoot":"","sources":["../../src/components/json-schema-form-utils.ts"],"names":[],"mappings":"AACA,OAAO,EAAkB,KAAK,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AACxE,OAAO,KAAK,EACV,YAAY,EACZ,WAAW,EACX,WAAW,EACX,kBAAkB,EACnB,MAAM,0BAA0B,CAAC;AAOlC,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAEjD;AAwBD,wBAAgB,YAAY,CAAC,YAAY,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAM1E;AAID,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAEpD;AAKD,wBAAgB,cAAc,CAC5B,KAAK,EAAE,YAAY,EACnB,OAAO,EAAE,MAAM,GACd;IACD,eAAe,CAAC,EAAE,IAAI,CAAC;IACvB,cAAc,CAAC,EAAE,IAAI,CAAC;IACtB,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC7B,CAKA;AAID,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,YAAY,EACnB,OAAO,EAAE,MAAM,GACd;IAAE,YAAY,CAAC,EAAE,IAAI,CAAC;IAAC,OAAO,CAAC,EAAE,IAAI,CAAC;IAAC,WAAW,CAAC,EAAE,MAAM,CAAA;CAAE,CAK/D;AAED,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,kBAAkB,GAAG,MAAM,CAGrE;AAED,wBAAgB,MAAM,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAI7C;AAKD,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,EAAE,CAGtD;AAKD,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,kBAAkB,GAAG,SAAS,GACpC,OAAO,CAIT;AAMD,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,WAAW,CAK5D;AAMD,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,OAAO,EACd,OAAO,EAAE,WAAW,GACnB,MAAM,GAAG,MAAM,CAKjB;AAID,eAAO,MAAM,wBAAwB,UAAU,CAAC;AAKhD,wBAAgB,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAElE;AAID,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,WAAW,EAAE,CAGvF;AAID,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,WAAW,EAAE,EACtB,QAAQ,EAAE,MAAM,EAAE,EAClB,UAAU,EAAE,MAAM,GACjB,WAAW,EAAE,CAGf;AAMD,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,kBAAkB,EACxB,MAAM,EAAE,MAAM,GACb,OAAO,CAKT;AAKD,wBAAgB,aAAa,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAUtF;AAQD,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,CAAC,MAAM,EAAE,kBAAkB,CAAC,EAAE,GACtC,CAAC,MAAM,EAAE,kBAAkB,CAAC,EAAE,CAShC;AAKD,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EACtB,QAAQ,EAAE,MAAM,EAAE,GACjB,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAKf;AAKD,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAKpD;AAOD,wBAAgB,eAAe,CAAC,CAAC,EAC/B,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EACtB,QAAQ,EAAE,MAAM,EAAE,EAClB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC9B,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAQf;AAID,wBAAgB,SAAS,CAAC,KAAK,EAAE,YAAY,GAAG,MAAM,GAAG,SAAS,CAcjE;AAID,wBAAgB,cAAc,CAAC,MAAM,EAAE,kBAAkB,GAAG,OAAO,CASlE"}

package/dist/components/json-schema-form-utils.js

@@ -1,6 +1,6 @@
 import { cn } from "../lib/utils.js";
 import { inputSizeClass } from "./json-schema-form-size.js";
-const INPUT_BASE = "w-full min-w-0 rounded-md border border-input bg-background text-foreground outline-none placeholder:text-muted-foreground disabled:cursor-not-allowed disabled:bg-muted/40 focus-visible:ring-2 focus-visible:ring-ring";
+const INPUT_BASE = "w-full min-w-0 rounded-md border border-input bg-background text-foreground outline-none placeholder:text-placeholder disabled:cursor-not-allowed disabled:bg-muted/40 focus-visible:ring-2 focus-visible:ring-ring";
 function inputClass(size) {
   return cn(INPUT_BASE, inputSizeClass[size]);
 }
@@ -37,8 +37,9 @@ function toText(value) {
   if (typeof value === "object") return "";
   return String(value);
 }
-function isPlainObject(value) {
-  return typeof value === "object" && value !== null && !Array.isArray(value);
+function toStringArray(value) {
+  if (!Array.isArray(value)) return [];
+  return value.filter((entry) => typeof entry === "string");
 }
 function hasObjectItemProperties(items) {
   return !!items && !!items.properties && Object.keys(items.properties).length > 0;
@@ -59,13 +60,6 @@ const DEFAULT_COLUMN_MIN_WIDTH = "15rem";
 function cssLength(value, fallback) {
   return typeof value === "string" && value.trim() ? value.trim() : fallback;
 }
-function duplicateIndex(items, index) {
-  const source = items[index];
-  const copy = Array.isArray(source) ? [...source] : isPlainObject(source) ? { ...source } : source;
-  const next = [...items];
-  next.splice(index + 1, 0, copy);
-  return next;
-}
 function withSyntheticValue(options, value) {
   if (!value || options.some((o) => o.value === value)) return options;
   return [{ value, label: value }, ...options];
@@ -126,19 +120,6 @@ function softError(field) {
   }
   return void 0;
 }
-function setIndex(arr, i, v) {
-  return arr.map((x, idx) => idx === i ? v : x);
-}
-function removeIndex(arr, i) {
-  return arr.filter((_, idx) => idx !== i);
-}
-function moveItem(arr, from, to) {
-  if (to < 0 || to >= arr.length) return arr;
-  const next = [...arr];
-  const [moved] = next.splice(from, 1);
-  next.splice(to, 0, moved);
-  return next;
-}
 function seedFromSchema(schema) {
   if (schema.default !== void 0) return schema.default;
   const type = Array.isArray(schema.type) ? schema.type[0] : schema.type;
@@ -152,27 +133,23 @@ export {
   comboboxAriaProps,
   cssLength,
   defaultPlaceholder,
-  duplicateIndex,
   fieldAriaProps,
   fieldErrorId,
   fieldInputId,
   hasObjectItemProperties,
   inputClass,
   isEmptyValue,
-  isPlainObject,
   keyPickerOptions,
   matchesFieldFilter,
-  moveItem,
   normalizeColSpan,
   normalizeColumns,
   orderByClickyOrder,
   orderByPriority,
   orderByXOrder,
   orderRequiredFirst,
-  removeIndex,
   seedFromSchema,
-  setIndex,
   softError,
+  toStringArray,
   toText,
   withSyntheticValue
 };

package/dist/components/json-schema-form-utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"json-schema-form-utils.js","sources":["../../src/components/json-schema-form-utils.ts"],"sourcesContent":["import { cn } from \"../lib/utils\";\nimport { inputSizeClass, type FormSize } from \"./json-schema-form-size\";\nimport type {\n  FieldControl,\n  FieldOption,\n  GridColumns,\n  JsonSchemaProperty,\n} from \"./json-schema-form-types\";\n\n// Non-size styling shared by every text-like input box; the size token supplies\n// height, horizontal padding, and text size (see inputSizeClass).\nconst INPUT_BASE =\n  \"w-full min-w-0 rounded-md border border-input bg-background text-foreground outline-none placeholder:text-muted-foreground disabled:cursor-not-allowed disabled:bg-muted/40 focus-visible:ring-2 focus-visible:ring-ring\";\n\nexport function inputClass(size: FormSize): string {\n  return cn(INPUT_BASE, inputSizeClass[size]);\n}\n\n// encodeIdPart escapes one path token (or the id prefix) injectively: every\n// character outside [A-Za-z0-9] becomes `_<hex char code>_`, and the empty token\n// — a legal JSON Schema property name — becomes a lone `_`. The escape is\n// self-delimiting (it always starts and ends with `_`, and a literal `_` escapes\n// to `_5f_`), so distinct tokens can never share an encoding and `-` stays free\n// as a segment separator. Percent-encoding was rejected because `%` in an id,\n// while legal HTML, has to be escaped again inside a `#id` CSS selector; this\n// alphabet ([A-Za-z0-9_-]) is safe as-is for `document.querySelector`.\nfunction encodeIdPart(value: string): string {\n  if (value === \"\") return \"_\";\n  return value.replace(/[^A-Za-z0-9]/g, (char) => `_${char.charCodeAt(0).toString(16)}_`);\n}\n\n// fieldInputId derives a control's DOM id from its JSON-pointer instance path,\n// not from its leaf key: a schema that repeats a property name under two parents\n// (e.g. /journalLine1/asset and /journalLine2/asset) must not produce the same\n// id, or every `label[for]` binds to the first control. Each decoded pointer\n// token is escaped with encodeIdPart and joined with \"-\", so distinct paths\n// always produce distinct ids: \"/asset-class\", \"/asset_class\", \"/asset.class\"\n// and \"/asset/class\" are four different ids, and an empty token is preserved\n// (\"/a//b\" ≠ \"/a/b\"). The prefix is escaped the same way, so prefix \"a\" + \"/b-c\"\n// cannot collide with prefix \"a-b\" + \"/c\".\nexport function fieldInputId(instancePath: string, prefix?: string): string {\n  const tokens = instancePath === \"\" ? [] : instancePath.replace(/^\\//, \"\").split(\"/\");\n  const safe = tokens\n    .map((token) => encodeIdPart(token.replaceAll(\"~1\", \"/\").replaceAll(\"~0\", \"~\")))\n    .join(\"-\");\n  return prefix ? `jsf-${encodeIdPart(prefix)}-${safe}` : `jsf-${safe}`;\n}\n\n// fieldErrorId names the element that holds a field's validation messages, so a\n// control can point at it with aria-describedby.\nexport function fieldErrorId(fieldId: string): string {\n  return `${fieldId}-error`;\n}\n\n// fieldAriaProps is the assistive-technology half of a control: the visual `*`\n// and red message mean nothing to a screen reader on their own, so every\n// editable control spreads these onto its input element.\nexport function fieldAriaProps(\n  field: FieldControl,\n  fieldId: string,\n): {\n  \"aria-required\"?: true;\n  \"aria-invalid\"?: true;\n  \"aria-describedby\"?: string;\n} {\n  return {\n    ...(field.required ? { \"aria-required\": true as const } : {}),\n    ...(field.invalid ? { \"aria-invalid\": true as const, \"aria-describedby\": fieldErrorId(fieldId) } : {}),\n  };\n}\n\n// comboboxAriaProps is the fieldAriaProps equivalent for Combobox, which takes\n// the same state as named props rather than raw aria-* attributes.\nexport function comboboxAriaProps(\n  field: FieldControl,\n  fieldId: string,\n): { ariaRequired?: true; invalid?: true; describedBy?: string } {\n  return {\n    ...(field.required ? { ariaRequired: true as const } : {}),\n    ...(field.invalid ? { invalid: true as const, describedBy: fieldErrorId(fieldId) } : {}),\n  };\n}\n\nexport function defaultPlaceholder(schema: JsonSchemaProperty): string {\n  if (schema.default != null && typeof schema.default !== \"object\") return String(schema.default);\n  return \"\";\n}\n\nexport function toText(value: unknown): string {\n  if (value === undefined || value === null) return \"\";\n  if (typeof value === \"object\") return \"\";\n  return String(value);\n}\n\nexport function isPlainObject(value: unknown): value is Record<string, unknown> {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\n// hasObjectItemProperties reports whether an array's items are objects with a\n// fixed `properties` set — the precondition for both the column-per-property\n// table and the summary-row accordion, which need to know the item's shape.\nexport function hasObjectItemProperties(\n  items: JsonSchemaProperty | undefined,\n): boolean {\n  return (\n    !!items && !!items.properties && Object.keys(items.properties).length > 0\n  );\n}\n\n// Object-level `x-columns`: how many equal columns to split a stacked object\n// into. \"auto\" fits as many as the width allows. A number is clamped to [1, 12]\n// (a standard 12-track grid, so a 3-across row of span-4 fields and a 4-across\n// row of span-3 fields share one object); anything invalid is a single column.\nexport function normalizeColumns(value: unknown): GridColumns {\n  if (value === \"auto\") return \"auto\";\n  const n = typeof value === \"number\" ? value : Number(value);\n  if (!Number.isFinite(n) || n < 1) return 1;\n  return Math.min(Math.trunc(n), 12);\n}\n\n// Per-field `x-col-span`: how many of the object's columns a field occupies.\n// \"full\" spans the whole row. Under `x-columns: \"auto\"` a numeric span cannot be\n// clamped against a track count that only exists at layout time, so it is capped\n// at the 12-track maximum instead. Invalid falls back to 1.\nexport function normalizeColSpan(\n  value: unknown,\n  columns: GridColumns,\n): number | \"full\" {\n  if (value === \"full\") return \"full\";\n  const n = typeof value === \"number\" ? value : Number(value);\n  if (!Number.isFinite(n) || n < 1) return 1;\n  return Math.min(Math.trunc(n), columns === \"auto\" ? 12 : columns);\n}\n\n// The `x-columns: \"auto\"` column floor: wide enough for a labelled control to\n// stay readable, narrow enough that a 1440px pane gets three columns, not two.\nexport const DEFAULT_COLUMN_MIN_WIDTH = \"15rem\";\n\n// cssLength guards a schema-supplied CSS length before it reaches an inline\n// style. Non-strings (and the empty string) fall back rather than emitting a\n// declaration the browser will drop.\nexport function cssLength(value: unknown, fallback: string): string {\n  return typeof value === \"string\" && value.trim() ? value.trim() : fallback;\n}\n\n// duplicateIndex copies the item at `index` and inserts the copy after it.\n// Plain objects and arrays are cloned one level deep so editing the copy cannot\n// write through to the original.\nexport function duplicateIndex<T>(items: T[], index: number): T[] {\n  const source = items[index];\n  const copy = Array.isArray(source)\n    ? ([...source] as T)\n    : isPlainObject(source)\n      ? ({ ...source } as T)\n      : source;\n  const next = [...items];\n  next.splice(index + 1, 0, copy as T);\n  return next;\n}\n\n// withSyntheticValue prepends the current value as an option when it is not in\n// the enum, so an out-of-enum value (e.g. a template token) still displays.\nexport function withSyntheticValue(options: FieldOption[], value: string): FieldOption[] {\n  if (!value || options.some((o) => o.value === value)) return options;\n  return [{ value, label: value }, ...options];\n}\n\n// keyPickerOptions narrows the map-key enum to keys not already used by another\n// entry, while always keeping this row's current key so it stays selectable.\nexport function keyPickerOptions(\n  options: FieldOption[],\n  usedKeys: string[],\n  currentKey: string,\n): FieldOption[] {\n  const taken = new Set(usedKeys.filter((k) => k !== currentKey));\n  return options.filter((o) => !taken.has(o.value));\n}\n\n// matchesFieldFilter reports whether a property should stay visible under the\n// display-options field filter: a case-insensitive substring match against the\n// field's key and its display label (`title` when set, otherwise the key). A\n// blank filter matches everything, so an empty box never hides fields.\nexport function matchesFieldFilter(\n  key: string,\n  prop: JsonSchemaProperty,\n  filter: string,\n): boolean {\n  const query = filter.trim().toLowerCase();\n  if (!query) return true;\n  const label = typeof prop.title === \"string\" && prop.title ? prop.title : key;\n  return key.toLowerCase().includes(query) || label.toLowerCase().includes(query);\n}\n\n// orderByXOrder reorders property entries by the schema's `x-order` hint: keys\n// named there render first (in that order), the rest keep document order. A\n// missing/empty hint is a no-op, so document order remains the default.\nexport function orderByXOrder<T>(entries: [string, T][], order: unknown): [string, T][] {\n  if (!Array.isArray(order) || order.length === 0) return entries;\n  const rank = new Map(\n    order.filter((k): k is string => typeof k === \"string\").map((k, i) => [k, i]),\n  );\n  const listed = entries\n    .filter(([key]) => rank.has(key))\n    .sort((a, b) => rank.get(a[0])! - rank.get(b[0])!);\n  const rest = entries.filter(([key]) => !rank.has(key));\n  return [...listed, ...rest];\n}\n\n// orderByClickyOrder stably sorts property entries by each property's numeric\n// `x-clicky-order` (lower first); entries without it keep their incoming order\n// after the ordered ones. An explicit index tie-break keeps it stable regardless\n// of the engine's sort stability. Unlike the object-level `x-order` array, this\n// composes across merged if/then branches because each property carries its own\n// order — the right tool when fields come from different (embedded) sources.\nexport function orderByClickyOrder(\n  entries: [string, JsonSchemaProperty][],\n): [string, JsonSchemaProperty][] {\n  const rank = (prop: JsonSchemaProperty): number => {\n    const o = prop[\"x-clicky-order\"];\n    return typeof o === \"number\" ? o : Number.POSITIVE_INFINITY;\n  };\n  return entries\n    .map((entry, index) => ({ entry, index, rank: rank(entry[1]) }))\n    .sort((a, b) => a.rank - b.rank || a.index - b.index)\n    .map((ranked) => ranked.entry);\n}\n\n// orderRequiredFirst stably partitions property entries so the keys named in\n// `required` come first (in their original order), then the rest (in theirs).\n// A stable two-pass partition, so it never reshuffles within either group.\nexport function orderRequiredFirst<T>(\n  entries: [string, T][],\n  required: string[],\n): [string, T][] {\n  const isRequired = new Set(required);\n  const head = entries.filter(([key]) => isRequired.has(key));\n  const tail = entries.filter(([key]) => !isRequired.has(key));\n  return [...head, ...tail];\n}\n\n// isEmptyValue reports whether a field's value carries no data, so priority\n// sorting can sink unfilled fields. Empty = undefined/null/\"\" plus empty arrays\n// and empty plain objects; `false` and `0` count as filled (they are choices).\nexport function isEmptyValue(value: unknown): boolean {\n  if (value === undefined || value === null || value === \"\") return true;\n  if (Array.isArray(value)) return value.length === 0;\n  if (typeof value === \"object\") return Object.keys(value).length === 0;\n  return false;\n}\n\n// orderByPriority sorts property entries so the fields that matter most surface\n// first, ranking each by a score: +2 if required, +1 if its value is non-empty.\n// Required-and-filled lead, then required-and-empty, then optional-and-filled,\n// then optional-and-empty. Ties keep their incoming order (explicit index\n// tie-break, so it does not depend on the engine's sort stability).\nexport function orderByPriority<T>(\n  entries: [string, T][],\n  required: string[],\n  values: Record<string, unknown>,\n): [string, T][] {\n  const isRequired = new Set(required);\n  const score = (key: string): number =>\n    (isRequired.has(key) ? 2 : 0) + (isEmptyValue(values[key]) ? 0 : 1);\n  return entries\n    .map((entry, index) => ({ entry, index, score: score(entry[0]) }))\n    .sort((a, b) => b.score - a.score || a.index - b.index)\n    .map((ranked) => ranked.entry);\n}\n\n// softError computes a display-only validation hint. It never blocks onChange.\n// Consumers suppress the unknown-enum hint by setting allowCustomValue.\nexport function softError(field: FieldControl): string | undefined {\n  const v = field.value;\n  const isEmpty = v === undefined || v === null || v === \"\";\n  if (field.required && isEmpty) return \"Required\";\n\n  if (field.kind === \"number\" && typeof field.minimum === \"number\" && typeof v === \"number\") {\n    if (v < field.minimum) return `Must be ≥ ${field.minimum}`;\n  }\n\n  if (field.kind === \"enum\" && !field.allowCustomValue && !isEmpty) {\n    const known = (field.options ?? []).some((o) => o.value === String(v));\n    if (!known) return \"Unknown value (allowed)\";\n  }\n  return undefined;\n}\n\n// Immutable array helpers used by the array control.\nexport function setIndex<T>(arr: T[], i: number, v: T): T[] {\n  return arr.map((x, idx) => (idx === i ? v : x));\n}\n\nexport function removeIndex<T>(arr: T[], i: number): T[] {\n  return arr.filter((_, idx) => idx !== i);\n}\n\nexport function moveItem<T>(arr: T[], from: number, to: number): T[] {\n  if (to < 0 || to >= arr.length) return arr;\n  const next = [...arr];\n  const [moved] = next.splice(from, 1);\n  next.splice(to, 0, moved as T);\n  return next;\n}\n\n// seedFromSchema produces the initial value for a freshly-added array item or\n// object field, honouring an explicit default.\nexport function seedFromSchema(schema: JsonSchemaProperty): unknown {\n  if (schema.default !== undefined) return schema.default;\n  const type = Array.isArray(schema.type) ? schema.type[0] : schema.type;\n  if (type === \"array\") return [];\n  if (type === \"object\") return {};\n  if (type === \"boolean\") return false;\n  // Numbers seed as \"\" so the soft Required hint can show without coercion\n  // surprises; the number control coerces on first real input.\n  return \"\";\n}\n"],"names":[],"mappings":";;AAWA,MAAM,aACJ;AAEK,SAAS,WAAW,MAAwB;AACjD,SAAO,GAAG,YAAY,eAAe,IAAI,CAAC;AAC5C;AAUA,SAAS,aAAa,OAAuB;AAC3C,MAAI,UAAU,GAAI,QAAO;AACzB,SAAO,MAAM,QAAQ,iBAAiB,CAAC,SAAS,IAAI,KAAK,WAAW,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG;AACxF;AAWO,SAAS,aAAa,cAAsB,QAAyB;AAC1E,QAAM,SAAS,iBAAiB,KAAK,KAAK,aAAa,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG;AACnF,QAAM,OAAO,OACV,IAAI,CAAC,UAAU,aAAa,MAAM,WAAW,MAAM,GAAG,EAAE,WAAW,MAAM,GAAG,CAAC,CAAC,EAC9E,KAAK,GAAG;AACX,SAAO,SAAS,OAAO,aAAa,MAAM,CAAC,IAAI,IAAI,KAAK,OAAO,IAAI;AACrE;AAIO,SAAS,aAAa,SAAyB;AACpD,SAAO,GAAG,OAAO;AACnB;AAKO,SAAS,eACd,OACA,SAKA;AACA,SAAO;AAAA,IACL,GAAI,MAAM,WAAW,EAAE,iBAAiB,KAAA,IAAkB,CAAA;AAAA,IAC1D,GAAI,MAAM,UAAU,EAAE,gBAAgB,MAAe,oBAAoB,aAAa,OAAO,MAAM,CAAA;AAAA,EAAC;AAExG;AAIO,SAAS,kBACd,OACA,SAC+D;AAC/D,SAAO;AAAA,IACL,GAAI,MAAM,WAAW,EAAE,cAAc,KAAA,IAAkB,CAAA;AAAA,IACvD,GAAI,MAAM,UAAU,EAAE,SAAS,MAAe,aAAa,aAAa,OAAO,MAAM,CAAA;AAAA,EAAC;AAE1F;AAEO,SAAS,mBAAmB,QAAoC;AACrE,MAAI,OAAO,WAAW,QAAQ,OAAO,OAAO,YAAY,SAAU,QAAO,OAAO,OAAO,OAAO;AAC9F,SAAO;AACT;AAEO,SAAS,OAAO,OAAwB;AAC7C,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,SAAO,OAAO,KAAK;AACrB;AAEO,SAAS,cAAc,OAAkD;AAC9E,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;AAKO,SAAS,wBACd,OACS;AACT,SACE,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,cAAc,OAAO,KAAK,MAAM,UAAU,EAAE,SAAS;AAE5E;AAMO,SAAS,iBAAiB,OAA6B;AAC5D,MAAI,UAAU,OAAQ,QAAO;AAC7B,QAAM,IAAI,OAAO,UAAU,WAAW,QAAQ,OAAO,KAAK;AAC1D,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,EAAG,QAAO;AACzC,SAAO,KAAK,IAAI,KAAK,MAAM,CAAC,GAAG,EAAE;AACnC;AAMO,SAAS,iBACd,OACA,SACiB;AACjB,MAAI,UAAU,OAAQ,QAAO;AAC7B,QAAM,IAAI,OAAO,UAAU,WAAW,QAAQ,OAAO,KAAK;AAC1D,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,EAAG,QAAO;AACzC,SAAO,KAAK,IAAI,KAAK,MAAM,CAAC,GAAG,YAAY,SAAS,KAAK,OAAO;AAClE;AAIO,MAAM,2BAA2B;AAKjC,SAAS,UAAU,OAAgB,UAA0B;AAClE,SAAO,OAAO,UAAU,YAAY,MAAM,SAAS,MAAM,SAAS;AACpE;AAKO,SAAS,eAAkB,OAAY,OAAoB;AAChE,QAAM,SAAS,MAAM,KAAK;AAC1B,QAAM,OAAO,MAAM,QAAQ,MAAM,IAC5B,CAAC,GAAG,MAAM,IACX,cAAc,MAAM,IACjB,EAAE,GAAG,WACN;AACN,QAAM,OAAO,CAAC,GAAG,KAAK;AACtB,OAAK,OAAO,QAAQ,GAAG,GAAG,IAAS;AACnC,SAAO;AACT;AAIO,SAAS,mBAAmB,SAAwB,OAA8B;AACvF,MAAI,CAAC,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,UAAU,KAAK,EAAG,QAAO;AAC7D,SAAO,CAAC,EAAE,OAAO,OAAO,MAAA,GAAS,GAAG,OAAO;AAC7C;AAIO,SAAS,iBACd,SACA,UACA,YACe;AACf,QAAM,QAAQ,IAAI,IAAI,SAAS,OAAO,CAAC,MAAM,MAAM,UAAU,CAAC;AAC9D,SAAO,QAAQ,OAAO,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,KAAK,CAAC;AAClD;AAMO,SAAS,mBACd,KACA,MACA,QACS;AACT,QAAM,QAAQ,OAAO,KAAA,EAAO,YAAA;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,QAAQ,OAAO,KAAK,UAAU,YAAY,KAAK,QAAQ,KAAK,QAAQ;AAC1E,SAAO,IAAI,YAAA,EAAc,SAAS,KAAK,KAAK,MAAM,YAAA,EAAc,SAAS,KAAK;AAChF;AAKO,SAAS,cAAiB,SAAwB,OAA+B;AACtF,MAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,EAAG,QAAO;AACxD,QAAM,OAAO,IAAI;AAAA,IACf,MAAM,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;AAAA,EAAA;AAE9E,QAAM,SAAS,QACZ,OAAO,CAAC,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,EAC/B,KAAK,CAAC,GAAG,MAAM,KAAK,IAAI,EAAE,CAAC,CAAC,IAAK,KAAK,IAAI,EAAE,CAAC,CAAC,CAAE;AACnD,QAAM,OAAO,QAAQ,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,IAAI,GAAG,CAAC;AACrD,SAAO,CAAC,GAAG,QAAQ,GAAG,IAAI;AAC5B;AAQO,SAAS,mBACd,SACgC;AAChC,QAAM,OAAO,CAAC,SAAqC;AACjD,UAAM,IAAI,KAAK,gBAAgB;AAC/B,WAAO,OAAO,MAAM,WAAW,IAAI,OAAO;AAAA,EAC5C;AACA,SAAO,QACJ,IAAI,CAAC,OAAO,WAAW,EAAE,OAAO,OAAO,MAAM,KAAK,MAAM,CAAC,CAAC,IAAI,EAC9D,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EACnD,IAAI,CAAC,WAAW,OAAO,KAAK;AACjC;AAKO,SAAS,mBACd,SACA,UACe;AACf,QAAM,aAAa,IAAI,IAAI,QAAQ;AACnC,QAAM,OAAO,QAAQ,OAAO,CAAC,CAAC,GAAG,MAAM,WAAW,IAAI,GAAG,CAAC;AAC1D,QAAM,OAAO,QAAQ,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,WAAW,IAAI,GAAG,CAAC;AAC3D,SAAO,CAAC,GAAG,MAAM,GAAG,IAAI;AAC1B;AAKO,SAAS,aAAa,OAAyB;AACpD,MAAI,UAAU,UAAa,UAAU,QAAQ,UAAU,GAAI,QAAO;AAClE,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,WAAW;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO,OAAO,KAAK,KAAK,EAAE,WAAW;AACpE,SAAO;AACT;AAOO,SAAS,gBACd,SACA,UACA,QACe;AACf,QAAM,aAAa,IAAI,IAAI,QAAQ;AACnC,QAAM,QAAQ,CAAC,SACZ,WAAW,IAAI,GAAG,IAAI,IAAI,MAAM,aAAa,OAAO,GAAG,CAAC,IAAI,IAAI;AACnE,SAAO,QACJ,IAAI,CAAC,OAAO,WAAW,EAAE,OAAO,OAAO,OAAO,MAAM,MAAM,CAAC,CAAC,IAAI,EAChE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EACrD,IAAI,CAAC,WAAW,OAAO,KAAK;AACjC;AAIO,SAAS,UAAU,OAAyC;AACjE,QAAM,IAAI,MAAM;AAChB,QAAM,UAAU,MAAM,UAAa,MAAM,QAAQ,MAAM;AACvD,MAAI,MAAM,YAAY,QAAS,QAAO;AAEtC,MAAI,MAAM,SAAS,YAAY,OAAO,MAAM,YAAY,YAAY,OAAO,MAAM,UAAU;AACzF,QAAI,IAAI,MAAM,QAAS,QAAO,aAAa,MAAM,OAAO;AAAA,EAC1D;AAEA,MAAI,MAAM,SAAS,UAAU,CAAC,MAAM,oBAAoB,CAAC,SAAS;AAChE,UAAM,SAAS,MAAM,WAAW,CAAA,GAAI,KAAK,CAAC,MAAM,EAAE,UAAU,OAAO,CAAC,CAAC;AACrE,QAAI,CAAC,MAAO,QAAO;AAAA,EACrB;AACA,SAAO;AACT;AAGO,SAAS,SAAY,KAAU,GAAW,GAAW;AAC1D,SAAO,IAAI,IAAI,CAAC,GAAG,QAAS,QAAQ,IAAI,IAAI,CAAE;AAChD;AAEO,SAAS,YAAe,KAAU,GAAgB;AACvD,SAAO,IAAI,OAAO,CAAC,GAAG,QAAQ,QAAQ,CAAC;AACzC;AAEO,SAAS,SAAY,KAAU,MAAc,IAAiB;AACnE,MAAI,KAAK,KAAK,MAAM,IAAI,OAAQ,QAAO;AACvC,QAAM,OAAO,CAAC,GAAG,GAAG;AACpB,QAAM,CAAC,KAAK,IAAI,KAAK,OAAO,MAAM,CAAC;AACnC,OAAK,OAAO,IAAI,GAAG,KAAU;AAC7B,SAAO;AACT;AAIO,SAAS,eAAe,QAAqC;AAClE,MAAI,OAAO,YAAY,OAAW,QAAO,OAAO;AAChD,QAAM,OAAO,MAAM,QAAQ,OAAO,IAAI,IAAI,OAAO,KAAK,CAAC,IAAI,OAAO;AAClE,MAAI,SAAS,QAAS,QAAO,CAAA;AAC7B,MAAI,SAAS,SAAU,QAAO,CAAA;AAC9B,MAAI,SAAS,UAAW,QAAO;AAG/B,SAAO;AACT;"}
+{"version":3,"file":"json-schema-form-utils.js","sources":["../../src/components/json-schema-form-utils.ts"],"sourcesContent":["import { cn } from \"../lib/utils\";\nimport { inputSizeClass, type FormSize } from \"./json-schema-form-size\";\nimport type {\n  FieldControl,\n  FieldOption,\n  GridColumns,\n  JsonSchemaProperty,\n} from \"./json-schema-form-types\";\n\n// Non-size styling shared by every text-like input box; the size token supplies\n// height, horizontal padding, and text size (see inputSizeClass).\nconst INPUT_BASE =\n  \"w-full min-w-0 rounded-md border border-input bg-background text-foreground outline-none placeholder:text-placeholder disabled:cursor-not-allowed disabled:bg-muted/40 focus-visible:ring-2 focus-visible:ring-ring\";\n\nexport function inputClass(size: FormSize): string {\n  return cn(INPUT_BASE, inputSizeClass[size]);\n}\n\n// encodeIdPart escapes one path token (or the id prefix) injectively: every\n// character outside [A-Za-z0-9] becomes `_<hex char code>_`, and the empty token\n// — a legal JSON Schema property name — becomes a lone `_`. The escape is\n// self-delimiting (it always starts and ends with `_`, and a literal `_` escapes\n// to `_5f_`), so distinct tokens can never share an encoding and `-` stays free\n// as a segment separator. Percent-encoding was rejected because `%` in an id,\n// while legal HTML, has to be escaped again inside a `#id` CSS selector; this\n// alphabet ([A-Za-z0-9_-]) is safe as-is for `document.querySelector`.\nfunction encodeIdPart(value: string): string {\n  if (value === \"\") return \"_\";\n  return value.replace(/[^A-Za-z0-9]/g, (char) => `_${char.charCodeAt(0).toString(16)}_`);\n}\n\n// fieldInputId derives a control's DOM id from its JSON-pointer instance path,\n// not from its leaf key: a schema that repeats a property name under two parents\n// (e.g. /journalLine1/asset and /journalLine2/asset) must not produce the same\n// id, or every `label[for]` binds to the first control. Each decoded pointer\n// token is escaped with encodeIdPart and joined with \"-\", so distinct paths\n// always produce distinct ids: \"/asset-class\", \"/asset_class\", \"/asset.class\"\n// and \"/asset/class\" are four different ids, and an empty token is preserved\n// (\"/a//b\" ≠ \"/a/b\"). The prefix is escaped the same way, so prefix \"a\" + \"/b-c\"\n// cannot collide with prefix \"a-b\" + \"/c\".\nexport function fieldInputId(instancePath: string, prefix?: string): string {\n  const tokens = instancePath === \"\" ? [] : instancePath.replace(/^\\//, \"\").split(\"/\");\n  const safe = tokens\n    .map((token) => encodeIdPart(token.replaceAll(\"~1\", \"/\").replaceAll(\"~0\", \"~\")))\n    .join(\"-\");\n  return prefix ? `jsf-${encodeIdPart(prefix)}-${safe}` : `jsf-${safe}`;\n}\n\n// fieldErrorId names the element that holds a field's validation messages, so a\n// control can point at it with aria-describedby.\nexport function fieldErrorId(fieldId: string): string {\n  return `${fieldId}-error`;\n}\n\n// fieldAriaProps is the assistive-technology half of a control: the visual `*`\n// and red message mean nothing to a screen reader on their own, so every\n// editable control spreads these onto its input element.\nexport function fieldAriaProps(\n  field: FieldControl,\n  fieldId: string,\n): {\n  \"aria-required\"?: true;\n  \"aria-invalid\"?: true;\n  \"aria-describedby\"?: string;\n} {\n  return {\n    ...(field.required ? { \"aria-required\": true as const } : {}),\n    ...(field.invalid ? { \"aria-invalid\": true as const, \"aria-describedby\": fieldErrorId(fieldId) } : {}),\n  };\n}\n\n// comboboxAriaProps is the fieldAriaProps equivalent for Combobox, which takes\n// the same state as named props rather than raw aria-* attributes.\nexport function comboboxAriaProps(\n  field: FieldControl,\n  fieldId: string,\n): { ariaRequired?: true; invalid?: true; describedBy?: string } {\n  return {\n    ...(field.required ? { ariaRequired: true as const } : {}),\n    ...(field.invalid ? { invalid: true as const, describedBy: fieldErrorId(fieldId) } : {}),\n  };\n}\n\nexport function defaultPlaceholder(schema: JsonSchemaProperty): string {\n  if (schema.default != null && typeof schema.default !== \"object\") return String(schema.default);\n  return \"\";\n}\n\nexport function toText(value: unknown): string {\n  if (value === undefined || value === null) return \"\";\n  if (typeof value === \"object\") return \"\";\n  return String(value);\n}\n\n// toStringArray normalises the committed value of a multi-value control. The\n// schema types it as an array of strings, but a form mid-edit can hold anything,\n// so a non-string entry is dropped rather than rendered as a broken tag.\nexport function toStringArray(value: unknown): string[] {\n  if (!Array.isArray(value)) return [];\n  return value.filter((entry): entry is string => typeof entry === \"string\");\n}\n\n// hasObjectItemProperties reports whether an array's items are objects with a\n// fixed `properties` set — the precondition for both the column-per-property\n// table and the summary-row accordion, which need to know the item's shape.\nexport function hasObjectItemProperties(\n  items: JsonSchemaProperty | undefined,\n): boolean {\n  return (\n    !!items && !!items.properties && Object.keys(items.properties).length > 0\n  );\n}\n\n// Object-level `x-columns`: how many equal columns to split a stacked object\n// into. \"auto\" fits as many as the width allows. A number is clamped to [1, 12]\n// (a standard 12-track grid, so a 3-across row of span-4 fields and a 4-across\n// row of span-3 fields share one object); anything invalid is a single column.\nexport function normalizeColumns(value: unknown): GridColumns {\n  if (value === \"auto\") return \"auto\";\n  const n = typeof value === \"number\" ? value : Number(value);\n  if (!Number.isFinite(n) || n < 1) return 1;\n  return Math.min(Math.trunc(n), 12);\n}\n\n// Per-field `x-col-span`: how many of the object's columns a field occupies.\n// \"full\" spans the whole row. Under `x-columns: \"auto\"` a numeric span cannot be\n// clamped against a track count that only exists at layout time, so it is capped\n// at the 12-track maximum instead. Invalid falls back to 1.\nexport function normalizeColSpan(\n  value: unknown,\n  columns: GridColumns,\n): number | \"full\" {\n  if (value === \"full\") return \"full\";\n  const n = typeof value === \"number\" ? value : Number(value);\n  if (!Number.isFinite(n) || n < 1) return 1;\n  return Math.min(Math.trunc(n), columns === \"auto\" ? 12 : columns);\n}\n\n// The `x-columns: \"auto\"` column floor: wide enough for a labelled control to\n// stay readable, narrow enough that a 1440px pane gets three columns, not two.\nexport const DEFAULT_COLUMN_MIN_WIDTH = \"15rem\";\n\n// cssLength guards a schema-supplied CSS length before it reaches an inline\n// style. Non-strings (and the empty string) fall back rather than emitting a\n// declaration the browser will drop.\nexport function cssLength(value: unknown, fallback: string): string {\n  return typeof value === \"string\" && value.trim() ? value.trim() : fallback;\n}\n\n// withSyntheticValue prepends the current value as an option when it is not in\n// the enum, so an out-of-enum value (e.g. a template token) still displays.\nexport function withSyntheticValue(options: FieldOption[], value: string): FieldOption[] {\n  if (!value || options.some((o) => o.value === value)) return options;\n  return [{ value, label: value }, ...options];\n}\n\n// keyPickerOptions narrows the map-key enum to keys not already used by another\n// entry, while always keeping this row's current key so it stays selectable.\nexport function keyPickerOptions(\n  options: FieldOption[],\n  usedKeys: string[],\n  currentKey: string,\n): FieldOption[] {\n  const taken = new Set(usedKeys.filter((k) => k !== currentKey));\n  return options.filter((o) => !taken.has(o.value));\n}\n\n// matchesFieldFilter reports whether a property should stay visible under the\n// display-options field filter: a case-insensitive substring match against the\n// field's key and its display label (`title` when set, otherwise the key). A\n// blank filter matches everything, so an empty box never hides fields.\nexport function matchesFieldFilter(\n  key: string,\n  prop: JsonSchemaProperty,\n  filter: string,\n): boolean {\n  const query = filter.trim().toLowerCase();\n  if (!query) return true;\n  const label = typeof prop.title === \"string\" && prop.title ? prop.title : key;\n  return key.toLowerCase().includes(query) || label.toLowerCase().includes(query);\n}\n\n// orderByXOrder reorders property entries by the schema's `x-order` hint: keys\n// named there render first (in that order), the rest keep document order. A\n// missing/empty hint is a no-op, so document order remains the default.\nexport function orderByXOrder<T>(entries: [string, T][], order: unknown): [string, T][] {\n  if (!Array.isArray(order) || order.length === 0) return entries;\n  const rank = new Map(\n    order.filter((k): k is string => typeof k === \"string\").map((k, i) => [k, i]),\n  );\n  const listed = entries\n    .filter(([key]) => rank.has(key))\n    .sort((a, b) => rank.get(a[0])! - rank.get(b[0])!);\n  const rest = entries.filter(([key]) => !rank.has(key));\n  return [...listed, ...rest];\n}\n\n// orderByClickyOrder stably sorts property entries by each property's numeric\n// `x-clicky-order` (lower first); entries without it keep their incoming order\n// after the ordered ones. An explicit index tie-break keeps it stable regardless\n// of the engine's sort stability. Unlike the object-level `x-order` array, this\n// composes across merged if/then branches because each property carries its own\n// order — the right tool when fields come from different (embedded) sources.\nexport function orderByClickyOrder(\n  entries: [string, JsonSchemaProperty][],\n): [string, JsonSchemaProperty][] {\n  const rank = (prop: JsonSchemaProperty): number => {\n    const o = prop[\"x-clicky-order\"];\n    return typeof o === \"number\" ? o : Number.POSITIVE_INFINITY;\n  };\n  return entries\n    .map((entry, index) => ({ entry, index, rank: rank(entry[1]) }))\n    .sort((a, b) => a.rank - b.rank || a.index - b.index)\n    .map((ranked) => ranked.entry);\n}\n\n// orderRequiredFirst stably partitions property entries so the keys named in\n// `required` come first (in their original order), then the rest (in theirs).\n// A stable two-pass partition, so it never reshuffles within either group.\nexport function orderRequiredFirst<T>(\n  entries: [string, T][],\n  required: string[],\n): [string, T][] {\n  const isRequired = new Set(required);\n  const head = entries.filter(([key]) => isRequired.has(key));\n  const tail = entries.filter(([key]) => !isRequired.has(key));\n  return [...head, ...tail];\n}\n\n// isEmptyValue reports whether a field's value carries no data, so priority\n// sorting can sink unfilled fields. Empty = undefined/null/\"\" plus empty arrays\n// and empty plain objects; `false` and `0` count as filled (they are choices).\nexport function isEmptyValue(value: unknown): boolean {\n  if (value === undefined || value === null || value === \"\") return true;\n  if (Array.isArray(value)) return value.length === 0;\n  if (typeof value === \"object\") return Object.keys(value).length === 0;\n  return false;\n}\n\n// orderByPriority sorts property entries so the fields that matter most surface\n// first, ranking each by a score: +2 if required, +1 if its value is non-empty.\n// Required-and-filled lead, then required-and-empty, then optional-and-filled,\n// then optional-and-empty. Ties keep their incoming order (explicit index\n// tie-break, so it does not depend on the engine's sort stability).\nexport function orderByPriority<T>(\n  entries: [string, T][],\n  required: string[],\n  values: Record<string, unknown>,\n): [string, T][] {\n  const isRequired = new Set(required);\n  const score = (key: string): number =>\n    (isRequired.has(key) ? 2 : 0) + (isEmptyValue(values[key]) ? 0 : 1);\n  return entries\n    .map((entry, index) => ({ entry, index, score: score(entry[0]) }))\n    .sort((a, b) => b.score - a.score || a.index - b.index)\n    .map((ranked) => ranked.entry);\n}\n\n// softError computes a display-only validation hint. It never blocks onChange.\n// Consumers suppress the unknown-enum hint by setting allowCustomValue.\nexport function softError(field: FieldControl): string | undefined {\n  const v = field.value;\n  const isEmpty = v === undefined || v === null || v === \"\";\n  if (field.required && isEmpty) return \"Required\";\n\n  if (field.kind === \"number\" && typeof field.minimum === \"number\" && typeof v === \"number\") {\n    if (v < field.minimum) return `Must be ≥ ${field.minimum}`;\n  }\n\n  if (field.kind === \"enum\" && !field.allowCustomValue && !isEmpty) {\n    const known = (field.options ?? []).some((o) => o.value === String(v));\n    if (!known) return \"Unknown value (allowed)\";\n  }\n  return undefined;\n}\n\n// seedFromSchema produces the initial value for a freshly-added array item or\n// object field, honouring an explicit default.\nexport function seedFromSchema(schema: JsonSchemaProperty): unknown {\n  if (schema.default !== undefined) return schema.default;\n  const type = Array.isArray(schema.type) ? schema.type[0] : schema.type;\n  if (type === \"array\") return [];\n  if (type === \"object\") return {};\n  if (type === \"boolean\") return false;\n  // Numbers seed as \"\" so the soft Required hint can show without coercion\n  // surprises; the number control coerces on first real input.\n  return \"\";\n}\n"],"names":[],"mappings":";;AAWA,MAAM,aACJ;AAEK,SAAS,WAAW,MAAwB;AACjD,SAAO,GAAG,YAAY,eAAe,IAAI,CAAC;AAC5C;AAUA,SAAS,aAAa,OAAuB;AAC3C,MAAI,UAAU,GAAI,QAAO;AACzB,SAAO,MAAM,QAAQ,iBAAiB,CAAC,SAAS,IAAI,KAAK,WAAW,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG;AACxF;AAWO,SAAS,aAAa,cAAsB,QAAyB;AAC1E,QAAM,SAAS,iBAAiB,KAAK,KAAK,aAAa,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG;AACnF,QAAM,OAAO,OACV,IAAI,CAAC,UAAU,aAAa,MAAM,WAAW,MAAM,GAAG,EAAE,WAAW,MAAM,GAAG,CAAC,CAAC,EAC9E,KAAK,GAAG;AACX,SAAO,SAAS,OAAO,aAAa,MAAM,CAAC,IAAI,IAAI,KAAK,OAAO,IAAI;AACrE;AAIO,SAAS,aAAa,SAAyB;AACpD,SAAO,GAAG,OAAO;AACnB;AAKO,SAAS,eACd,OACA,SAKA;AACA,SAAO;AAAA,IACL,GAAI,MAAM,WAAW,EAAE,iBAAiB,KAAA,IAAkB,CAAA;AAAA,IAC1D,GAAI,MAAM,UAAU,EAAE,gBAAgB,MAAe,oBAAoB,aAAa,OAAO,MAAM,CAAA;AAAA,EAAC;AAExG;AAIO,SAAS,kBACd,OACA,SAC+D;AAC/D,SAAO;AAAA,IACL,GAAI,MAAM,WAAW,EAAE,cAAc,KAAA,IAAkB,CAAA;AAAA,IACvD,GAAI,MAAM,UAAU,EAAE,SAAS,MAAe,aAAa,aAAa,OAAO,MAAM,CAAA;AAAA,EAAC;AAE1F;AAEO,SAAS,mBAAmB,QAAoC;AACrE,MAAI,OAAO,WAAW,QAAQ,OAAO,OAAO,YAAY,SAAU,QAAO,OAAO,OAAO,OAAO;AAC9F,SAAO;AACT;AAEO,SAAS,OAAO,OAAwB;AAC7C,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,SAAO,OAAO,KAAK;AACrB;AAKO,SAAS,cAAc,OAA0B;AACtD,MAAI,CAAC,MAAM,QAAQ,KAAK,UAAU,CAAA;AAClC,SAAO,MAAM,OAAO,CAAC,UAA2B,OAAO,UAAU,QAAQ;AAC3E;AAKO,SAAS,wBACd,OACS;AACT,SACE,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,cAAc,OAAO,KAAK,MAAM,UAAU,EAAE,SAAS;AAE5E;AAMO,SAAS,iBAAiB,OAA6B;AAC5D,MAAI,UAAU,OAAQ,QAAO;AAC7B,QAAM,IAAI,OAAO,UAAU,WAAW,QAAQ,OAAO,KAAK;AAC1D,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,EAAG,QAAO;AACzC,SAAO,KAAK,IAAI,KAAK,MAAM,CAAC,GAAG,EAAE;AACnC;AAMO,SAAS,iBACd,OACA,SACiB;AACjB,MAAI,UAAU,OAAQ,QAAO;AAC7B,QAAM,IAAI,OAAO,UAAU,WAAW,QAAQ,OAAO,KAAK;AAC1D,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,EAAG,QAAO;AACzC,SAAO,KAAK,IAAI,KAAK,MAAM,CAAC,GAAG,YAAY,SAAS,KAAK,OAAO;AAClE;AAIO,MAAM,2BAA2B;AAKjC,SAAS,UAAU,OAAgB,UAA0B;AAClE,SAAO,OAAO,UAAU,YAAY,MAAM,SAAS,MAAM,SAAS;AACpE;AAIO,SAAS,mBAAmB,SAAwB,OAA8B;AACvF,MAAI,CAAC,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,UAAU,KAAK,EAAG,QAAO;AAC7D,SAAO,CAAC,EAAE,OAAO,OAAO,MAAA,GAAS,GAAG,OAAO;AAC7C;AAIO,SAAS,iBACd,SACA,UACA,YACe;AACf,QAAM,QAAQ,IAAI,IAAI,SAAS,OAAO,CAAC,MAAM,MAAM,UAAU,CAAC;AAC9D,SAAO,QAAQ,OAAO,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,KAAK,CAAC;AAClD;AAMO,SAAS,mBACd,KACA,MACA,QACS;AACT,QAAM,QAAQ,OAAO,KAAA,EAAO,YAAA;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,QAAQ,OAAO,KAAK,UAAU,YAAY,KAAK,QAAQ,KAAK,QAAQ;AAC1E,SAAO,IAAI,YAAA,EAAc,SAAS,KAAK,KAAK,MAAM,YAAA,EAAc,SAAS,KAAK;AAChF;AAKO,SAAS,cAAiB,SAAwB,OAA+B;AACtF,MAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,EAAG,QAAO;AACxD,QAAM,OAAO,IAAI;AAAA,IACf,MAAM,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;AAAA,EAAA;AAE9E,QAAM,SAAS,QACZ,OAAO,CAAC,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,EAC/B,KAAK,CAAC,GAAG,MAAM,KAAK,IAAI,EAAE,CAAC,CAAC,IAAK,KAAK,IAAI,EAAE,CAAC,CAAC,CAAE;AACnD,QAAM,OAAO,QAAQ,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,IAAI,GAAG,CAAC;AACrD,SAAO,CAAC,GAAG,QAAQ,GAAG,IAAI;AAC5B;AAQO,SAAS,mBACd,SACgC;AAChC,QAAM,OAAO,CAAC,SAAqC;AACjD,UAAM,IAAI,KAAK,gBAAgB;AAC/B,WAAO,OAAO,MAAM,WAAW,IAAI,OAAO;AAAA,EAC5C;AACA,SAAO,QACJ,IAAI,CAAC,OAAO,WAAW,EAAE,OAAO,OAAO,MAAM,KAAK,MAAM,CAAC,CAAC,IAAI,EAC9D,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EACnD,IAAI,CAAC,WAAW,OAAO,KAAK;AACjC;AAKO,SAAS,mBACd,SACA,UACe;AACf,QAAM,aAAa,IAAI,IAAI,QAAQ;AACnC,QAAM,OAAO,QAAQ,OAAO,CAAC,CAAC,GAAG,MAAM,WAAW,IAAI,GAAG,CAAC;AAC1D,QAAM,OAAO,QAAQ,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,WAAW,IAAI,GAAG,CAAC;AAC3D,SAAO,CAAC,GAAG,MAAM,GAAG,IAAI;AAC1B;AAKO,SAAS,aAAa,OAAyB;AACpD,MAAI,UAAU,UAAa,UAAU,QAAQ,UAAU,GAAI,QAAO;AAClE,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,WAAW;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO,OAAO,KAAK,KAAK,EAAE,WAAW;AACpE,SAAO;AACT;AAOO,SAAS,gBACd,SACA,UACA,QACe;AACf,QAAM,aAAa,IAAI,IAAI,QAAQ;AACnC,QAAM,QAAQ,CAAC,SACZ,WAAW,IAAI,GAAG,IAAI,IAAI,MAAM,aAAa,OAAO,GAAG,CAAC,IAAI,IAAI;AACnE,SAAO,QACJ,IAAI,CAAC,OAAO,WAAW,EAAE,OAAO,OAAO,OAAO,MAAM,MAAM,CAAC,CAAC,IAAI,EAChE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EACrD,IAAI,CAAC,WAAW,OAAO,KAAK;AACjC;AAIO,SAAS,UAAU,OAAyC;AACjE,QAAM,IAAI,MAAM;AAChB,QAAM,UAAU,MAAM,UAAa,MAAM,QAAQ,MAAM;AACvD,MAAI,MAAM,YAAY,QAAS,QAAO;AAEtC,MAAI,MAAM,SAAS,YAAY,OAAO,MAAM,YAAY,YAAY,OAAO,MAAM,UAAU;AACzF,QAAI,IAAI,MAAM,QAAS,QAAO,aAAa,MAAM,OAAO;AAAA,EAC1D;AAEA,MAAI,MAAM,SAAS,UAAU,CAAC,MAAM,oBAAoB,CAAC,SAAS;AAChE,UAAM,SAAS,MAAM,WAAW,CAAA,GAAI,KAAK,CAAC,MAAM,EAAE,UAAU,OAAO,CAAC,CAAC;AACrE,QAAI,CAAC,MAAO,QAAO;AAAA,EACrB;AACA,SAAO;AACT;AAIO,SAAS,eAAe,QAAqC;AAClE,MAAI,OAAO,YAAY,OAAW,QAAO,OAAO;AAChD,QAAM,OAAO,MAAM,QAAQ,OAAO,IAAI,IAAI,OAAO,KAAK,CAAC,IAAI,OAAO;AAClE,MAAI,SAAS,QAAS,QAAO,CAAA;AAC7B,MAAI,SAAS,SAAU,QAAO,CAAA;AAC9B,MAAI,SAAS,UAAW,QAAO;AAG/B,SAAO;AACT;"}

package/dist/components/jsonPathTree.cjs

@@ -73,9 +73,15 @@ function createLazyJSONPathTree(json, options = {}) {
     const scope = inner === void 0 ? { value: node2.value, path: node2.path } : { value: inner, path: "$" };
     const root = inner === void 0 ? node2.root : node2.root ?? sourceColumn(node2.path);
     if (root !== void 0) scope.root = root;
+    const origin = inner === void 0 ? node2.origin : {
+      path: node2.path,
+      kind: jsonPathKind(inner),
+      ...node2.origin ? { outer: node2.origin } : {}
+    };
+    if (origin !== void 0) scope.origin = origin;
     return scope;
   }
-  function node(value, path, key, root) {
+  function node(value, path, key, root, origin) {
     const cached = nodes.get(key);
     if (cached) return cached;
     const created = {
@@ -87,6 +93,7 @@ function createLazyJSONPathTree(json, options = {}) {
       childCount: entryCount(value)
     };
     if (root !== void 0) created.root = root;
+    if (origin !== void 0) created.origin = origin;
     nodes.set(key, created);
     return created;
   }
@@ -102,7 +109,7 @@ function createLazyJSONPathTree(json, options = {}) {
     const limit = Math.min(entries.length, maxChildren);
     const children = entries.slice(0, limit).map(([key, value]) => {
       const path = appendJSONPath(scope.path, key);
-      return node(value, path, `${parent.key}>${path}`, scope.root);
+      return node(value, path, `${parent.key}>${path}`, scope.root, scope.origin);
     });
     if (limit < entries.length) {
       children.push({
@@ -123,7 +130,7 @@ function createLazyJSONPathTree(json, options = {}) {
     const inner = embedded(node2);
     return inner !== void 0 && entryCount(inner) > 0;
   }
-  const rootNode = node(json, "$", `${keyPrefix}$`, void 0);
+  const rootNode = node(json, "$", `${keyPrefix}$`, void 0, void 0);
   return {
     roots: json === void 0 ? [] : [rootNode],
     getChildren: (node2) => node2.children,

package/dist/components/jsonPathTree.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"jsonPathTree.cjs","sources":["../../src/components/jsonPathTree.ts"],"sourcesContent":["// The JSON→JSONPath tree model shared by the inline picker dropdown and the\n// full playground dialog.\n//\n// The two want opposite things from the same walk. The dropdown is a *preview*\n// of a row that has to render the instant it opens, so it builds eagerly and\n// pays for that with caps: depth, property count, and one array element. The\n// playground is a *browser* of the row, so it must have no caps at all — which\n// is only affordable if the walk is lazy, materialising a level at a time as the\n// operator opens it.\n\nconst SIMPLE_PROPERTY = /^[A-Za-z_$][A-Za-z0-9_$]*$/;\n\nexport const DEFAULT_MAX_DEPTH = 12;\nexport const DEFAULT_MAX_OBJECT_PROPERTIES = 100;\n/**\n * Entries the uncapped tree renders under one node before it stops and says so.\n *\n * Depth is what the playground removes the limit on; breadth still has to render\n * as DOM rows the moment a node opens, and a hundred-thousand-element array\n * would take the tab down. The remainder is reported in a visible row rather\n * than dropped quietly — an index past it is still reachable by typing it.\n */\nexport const DEFAULT_MAX_CHILDREN = 1000;\n\nexport type JSONPathNodeKind = \"array\" | \"object\" | \"scalar\" | \"more\";\n\nexport interface JSONPathNode {\n  key: string;\n  path: string;\n  value: unknown;\n  kind: JSONPathNodeKind;\n  summary: string;\n  children?: JSONPathNode[];\n  /**\n   * The top-level column this node's path is rooted at, set only inside a\n   * subtree decoded out of a JSON-encoded string. Such a path cannot be read\n   * from the row directly — the backend reaches it by way of the column's\n   * `source`, so the two have to be committed together.\n   */\n  root?: string;\n  /** Number of entries the node holds, before any paging. */\n  childCount: number;\n}\n\nexport interface BuildJSONPathNodeOptions {\n  maxDepth?: number;\n  maxObjectProperties?: number;\n  /** \"first\" exposes only element [0] of an array; \"all\" exposes every element. */\n  arrayMode?: \"first\" | \"all\";\n}\n\nexport function jsonPathKind(value: unknown): JSONPathNodeKind {\n  if (Array.isArray(value)) return \"array\";\n  return value !== null && typeof value === \"object\" ? \"object\" : \"scalar\";\n}\n\nexport function appendJSONPath(path: string, key: string | number): string {\n  if (typeof key === \"number\") return `${path}[${key}]`;\n  return SIMPLE_PROPERTY.test(key) ? `${path}.${key}` : `${path}[${JSON.stringify(key)}]`;\n}\n\nexport function summarizeJSON(value: unknown): string {\n  if (Array.isArray(value)) return `[${value.length} item${value.length === 1 ? \"\" : \"s\"}]`;\n  if (value !== null && typeof value === \"object\") {\n    const count = Object.keys(value).length;\n    return `{${count} ${count === 1 ? \"property\" : \"properties\"}}`;\n  }\n  if (typeof value === \"string\") return JSON.stringify(value.length > 80 ? `${value.slice(0, 77)}…` : value);\n  return String(value);\n}\n\nfunction entryCount(value: unknown): number {\n  if (Array.isArray(value)) return value.length;\n  if (value !== null && typeof value === \"object\") return Object.keys(value).length;\n  return 0;\n}\n\n/**\n * The eager, capped walk behind the inline dropdown. Deep, wide, or long values\n * are truncated on purpose: the dropdown opens on a click and cannot afford to\n * walk an arbitrary document first.\n */\nexport function buildJSONPathNode(\n  value: unknown,\n  path: string,\n  depth: number,\n  options: BuildJSONPathNodeOptions = {},\n): JSONPathNode {\n  const {\n    maxDepth = DEFAULT_MAX_DEPTH,\n    maxObjectProperties = DEFAULT_MAX_OBJECT_PROPERTIES,\n    arrayMode = \"first\",\n  } = options;\n  const kind = jsonPathKind(value);\n  const node: JSONPathNode = {\n    key: path,\n    path,\n    value,\n    kind,\n    summary: summarizeJSON(value),\n    childCount: entryCount(value),\n  };\n  if (kind === \"scalar\" || depth >= maxDepth) return node;\n  const entries = Array.isArray(value)\n    ? arrayMode === \"all\"\n      ? value.map((entry, index) => [index, entry] as const)\n      : value.length > 0\n        ? [[0, value[0]] as const]\n        : []\n    : Object.entries(value as Record<string, unknown>).slice(0, maxObjectProperties);\n  node.children = entries.map(([key, child]) =>\n    buildJSONPathNode(child, appendJSONPath(path, key), depth + 1, options),\n  );\n  return node;\n}\n\nexport interface LazyJSONPathTreeOptions {\n  maxChildren?: number;\n  /**\n   * Namespaces every node key. Two trees over different documents share their\n   * paths, and Tree keys its React elements by node key — without a distinct\n   * prefix, swapping the document underneath reuses the old subtree along with\n   * the children it had already loaded.\n   */\n  keyPrefix?: string;\n  /**\n   * Descend into a string that parses as JSON. Providers routinely hand back a\n   * document as an encoded column, and the backend already decodes one when a\n   * column names it as its `source` — without this the picker shows the single\n   * most interesting column in such a row as an opaque blob.\n   */\n  parseEmbeddedJSON?: boolean;\n}\n\nexport interface LazyJSONPathTree {\n  roots: JSONPathNode[];\n  /** Children already materialised, or undefined while the branch is unopened. */\n  getChildren: (node: JSONPathNode) => JSONPathNode[] | undefined;\n  hasMoreChildren: (node: JSONPathNode) => boolean;\n  loadChildren: (node: JSONPathNode) => Promise<JSONPathNode[]>;\n  /**\n   * Materialise the branch a literal expression addresses and return its node,\n   * so a tree can reveal the value it opened with. Returns undefined for an\n   * expression that selects rather than addresses (a wildcard, a descent, a\n   * filter) or for one the document does not carry.\n   */\n  materializePath: (expression: string) => JSONPathNode | undefined;\n}\n\n/**\n * An uncapped tree over `json`: every property, every array element, any depth.\n *\n * Nothing is walked until it is opened, so an arbitrarily deep or wide document\n * costs only what the operator actually looks at. Nodes are cached by path so\n * re-opening a branch returns the *same objects* — `TreeNode` compares the\n * selected node by identity, and a rebuilt node would silently lose the\n * highlight.\n */\nexport function createLazyJSONPathTree(\n  json: unknown,\n  options: LazyJSONPathTreeOptions = {},\n): LazyJSONPathTree {\n  const { maxChildren = DEFAULT_MAX_CHILDREN, parseEmbeddedJSON = true, keyPrefix = \"\" } = options;\n  const nodes = new Map<string, JSONPathNode>();\n\n  // hasMoreChildren runs on every render of every visible row, so the decode is\n  // memoised per node rather than re-parsing a long string each time.\n  const decoded = new Map<string, unknown>();\n\n  function embedded(node: JSONPathNode): unknown {\n    if (!parseEmbeddedJSON || typeof node.value !== \"string\") return undefined;\n    if (decoded.has(node.key)) return decoded.get(node.key);\n    const text = node.value.trim();\n    let parsed: unknown = undefined;\n    if (text.startsWith(\"{\") || text.startsWith(\"[\")) {\n      try {\n        const candidate: unknown = JSON.parse(text);\n        if (jsonPathKind(candidate) !== \"scalar\") parsed = candidate;\n      } catch {\n        parsed = undefined;\n      }\n    }\n    decoded.set(node.key, parsed);\n    return parsed;\n  }\n\n  // What a node's children are drawn from: its own value, or the document\n  // decoded out of it when it holds JSON as text. An embedded document restarts\n  // at `$` because that is where the backend evaluates it from once the column\n  // is named as a `source`.\n  function contents(node: JSONPathNode): { value: unknown; path: string; root?: string } {\n    const inner = embedded(node);\n    const scope: { value: unknown; path: string; root?: string } =\n      inner === undefined\n        ? { value: node.value, path: node.path }\n        : { value: inner, path: \"$\" };\n    const root = inner === undefined ? node.root : node.root ?? sourceColumn(node.path);\n    if (root !== undefined) scope.root = root;\n    return scope;\n  }\n\n  function node(\n    value: unknown,\n    path: string,\n    key: string,\n    root: string | undefined,\n  ): JSONPathNode {\n    const cached = nodes.get(key);\n    if (cached) return cached;\n    const created: JSONPathNode = {\n      key,\n      path,\n      value,\n      kind: jsonPathKind(value),\n      summary: summarizeJSON(value),\n      childCount: entryCount(value),\n    };\n    if (root !== undefined) created.root = root;\n    nodes.set(key, created);\n    return created;\n  }\n\n  function entriesOf(value: unknown): Array<readonly [string | number, unknown]> {\n    if (Array.isArray(value)) return value.map((entry, index) => [index, entry] as const);\n    if (value !== null && typeof value === \"object\") return Object.entries(value as Record<string, unknown>);\n    return [];\n  }\n\n  function materializeChildren(parent: JSONPathNode): JSONPathNode[] {\n    if (parent.children) return parent.children;\n    const scope = contents(parent);\n    const entries = entriesOf(scope.value);\n    const limit = Math.min(entries.length, maxChildren);\n    const children = entries.slice(0, limit).map(([key, value]) => {\n      const path = appendJSONPath(scope.path, key);\n      // The key namespaces on the parent so an embedded document — which\n      // restarts its paths at `$` — cannot collide with the outer row.\n      return node(value, path, `${parent.key}>${path}`, scope.root);\n    });\n    if (limit < entries.length) {\n      children.push({\n        key: `${parent.key}>…`,\n        path: scope.path,\n        value: undefined,\n        kind: \"more\",\n        summary: `${entries.length - limit} more not shown — address them by index`,\n        childCount: entries.length - limit,\n      });\n    }\n    parent.children = children;\n    return children;\n  }\n\n  function expandable(node: JSONPathNode): boolean {\n    if (node.kind === \"more\") return false;\n    if (node.kind !== \"scalar\") return node.childCount > 0;\n    const inner = embedded(node);\n    return inner !== undefined && entryCount(inner) > 0;\n  }\n\n  const rootNode = node(json, \"$\", `${keyPrefix}$`, undefined);\n\n  return {\n    roots: json === undefined ? [] : [rootNode],\n    getChildren: (node) => node.children,\n    hasMoreChildren: (node) => node.children === undefined && expandable(node),\n    loadChildren: (parent) => Promise.resolve(materializeChildren(parent)),\n    materializePath: (expression) => {\n      const segments = literalSegments(expression);\n      if (!segments) return undefined;\n      let current = rootNode;\n      for (const segment of segments) {\n        const target = appendJSONPath(contents(current).path, segment);\n        const next = materializeChildren(current).find((child) => child.path === target);\n        if (!next) return undefined;\n        current = next;\n      }\n      return current;\n    },\n  };\n}\n\n/** The top-level column a row-rooted path starts at, e.g. `$.payload.x` → `payload`. */\nfunction sourceColumn(path: string): string | undefined {\n  return literalSegments(path)?.slice(0, 1).map(String)[0];\n}\n\n/**\n * The literal key/index chain an expression addresses, or undefined when it\n * selects instead — a wildcard, a descent, or a filter matches a set whose shape\n * depends on the document, so there is no single branch to walk to.\n */\nexport function literalSegments(expression: string): Array<string | number> | undefined {\n  let rest = expression.trim();\n  if (rest === \"\") return undefined;\n  if (!rest.startsWith(\"$\")) return undefined;\n  rest = rest.slice(1);\n  const segments: Array<string | number> = [];\n  while (rest.length > 0) {\n    if (rest.startsWith(\"..\")) return undefined;\n    if (rest.startsWith(\".\")) {\n      const match = /^\\.([A-Za-z_$][A-Za-z0-9_$]*)/.exec(rest);\n      if (!match) return undefined;\n      segments.push(match[1]!);\n      rest = rest.slice(match[0].length);\n      continue;\n    }\n    if (rest.startsWith(\"[\")) {\n      const close = rest.indexOf(\"]\");\n      if (close < 0) return undefined;\n      const inner = rest.slice(1, close).trim();\n      if (/^\\d+$/.test(inner)) segments.push(Number(inner));\n      else if (/^\"(?:[^\"\\\\]|\\\\.)*\"$/.test(inner)) segments.push(JSON.parse(inner) as string);\n      else if (/^'[^']*'$/.test(inner)) segments.push(inner.slice(1, -1));\n      else return undefined;\n      rest = rest.slice(close + 1);\n      continue;\n    }\n    return undefined;\n  }\n  return segments;\n}\n"],"names":["node"],"mappings":";;AAUA,MAAM,kBAAkB;AAEjB,MAAM,oBAAoB;AAC1B,MAAM,gCAAgC;AAStC,MAAM,uBAAuB;AA6B7B,SAAS,aAAa,OAAkC;AAC7D,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,SAAO,UAAU,QAAQ,OAAO,UAAU,WAAW,WAAW;AAClE;AAEO,SAAS,eAAe,MAAc,KAA8B;AACzE,MAAI,OAAO,QAAQ,iBAAiB,GAAG,IAAI,IAAI,GAAG;AAClD,SAAO,gBAAgB,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,KAAK,UAAU,GAAG,CAAC;AACtF;AAEO,SAAS,cAAc,OAAwB;AACpD,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,IAAI,MAAM,MAAM,QAAQ,MAAM,WAAW,IAAI,KAAK,GAAG;AACtF,MAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;AAC/C,UAAM,QAAQ,OAAO,KAAK,KAAK,EAAE;AACjC,WAAO,IAAI,KAAK,IAAI,UAAU,IAAI,aAAa,YAAY;AAAA,EAC7D;AACA,MAAI,OAAO,UAAU,SAAU,QAAO,KAAK,UAAU,MAAM,SAAS,KAAK,GAAG,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,KAAK;AACzG,SAAO,OAAO,KAAK;AACrB;AAEA,SAAS,WAAW,OAAwB;AAC1C,MAAI,MAAM,QAAQ,KAAK,UAAU,MAAM;AACvC,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO,OAAO,KAAK,KAAK,EAAE;AAC3E,SAAO;AACT;AAOO,SAAS,kBACd,OACA,MACA,OACA,UAAoC,CAAA,GACtB;AACd,QAAM;AAAA,IACJ,WAAW;AAAA,IACX,sBAAsB;AAAA,IACtB,YAAY;AAAA,EAAA,IACV;AACJ,QAAM,OAAO,aAAa,KAAK;AAC/B,QAAM,OAAqB;AAAA,IACzB,KAAK;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,cAAc,KAAK;AAAA,IAC5B,YAAY,WAAW,KAAK;AAAA,EAAA;AAE9B,MAAI,SAAS,YAAY,SAAS,SAAU,QAAO;AACnD,QAAM,UAAU,MAAM,QAAQ,KAAK,IAC/B,cAAc,QACZ,MAAM,IAAI,CAAC,OAAO,UAAU,CAAC,OAAO,KAAK,CAAU,IACnD,MAAM,SAAS,IACb,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAU,IACvB,CAAA,IACJ,OAAO,QAAQ,KAAgC,EAAE,MAAM,GAAG,mBAAmB;AACjF,OAAK,WAAW,QAAQ;AAAA,IAAI,CAAC,CAAC,KAAK,KAAK,MACtC,kBAAkB,OAAO,eAAe,MAAM,GAAG,GAAG,QAAQ,GAAG,OAAO;AAAA,EAAA;AAExE,SAAO;AACT;AA4CO,SAAS,uBACd,MACA,UAAmC,IACjB;AAClB,QAAM,EAAE,cAAc,sBAAsB,oBAAoB,MAAM,YAAY,OAAO;AACzF,QAAM,4BAAY,IAAA;AAIlB,QAAM,8BAAc,IAAA;AAEpB,WAAS,SAASA,OAA6B;AAC7C,QAAI,CAAC,qBAAqB,OAAOA,MAAK,UAAU,SAAU,QAAO;AACjE,QAAI,QAAQ,IAAIA,MAAK,GAAG,EAAG,QAAO,QAAQ,IAAIA,MAAK,GAAG;AACtD,UAAM,OAAOA,MAAK,MAAM,KAAA;AACxB,QAAI,SAAkB;AACtB,QAAI,KAAK,WAAW,GAAG,KAAK,KAAK,WAAW,GAAG,GAAG;AAChD,UAAI;AACF,cAAM,YAAqB,KAAK,MAAM,IAAI;AAC1C,YAAI,aAAa,SAAS,MAAM,SAAU,UAAS;AAAA,MACrD,QAAQ;AACN,iBAAS;AAAA,MACX;AAAA,IACF;AACA,YAAQ,IAAIA,MAAK,KAAK,MAAM;AAC5B,WAAO;AAAA,EACT;AAMA,WAAS,SAASA,OAAqE;AACrF,UAAM,QAAQ,SAASA,KAAI;AAC3B,UAAM,QACJ,UAAU,SACN,EAAE,OAAOA,MAAK,OAAO,MAAMA,MAAK,SAChC,EAAE,OAAO,OAAO,MAAM,IAAA;AAC5B,UAAM,OAAO,UAAU,SAAYA,MAAK,OAAOA,MAAK,QAAQ,aAAaA,MAAK,IAAI;AAClF,QAAI,SAAS,OAAW,OAAM,OAAO;AACrC,WAAO;AAAA,EACT;AAEA,WAAS,KACP,OACA,MACA,KACA,MACc;AACd,UAAM,SAAS,MAAM,IAAI,GAAG;AAC5B,QAAI,OAAQ,QAAO;AACnB,UAAM,UAAwB;AAAA,MAC5B;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAM,aAAa,KAAK;AAAA,MACxB,SAAS,cAAc,KAAK;AAAA,MAC5B,YAAY,WAAW,KAAK;AAAA,IAAA;AAE9B,QAAI,SAAS,OAAW,SAAQ,OAAO;AACvC,UAAM,IAAI,KAAK,OAAO;AACtB,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,OAA4D;AAC7E,QAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,IAAI,CAAC,OAAO,UAAU,CAAC,OAAO,KAAK,CAAU;AACpF,QAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO,OAAO,QAAQ,KAAgC;AACvG,WAAO,CAAA;AAAA,EACT;AAEA,WAAS,oBAAoB,QAAsC;AACjE,QAAI,OAAO,SAAU,QAAO,OAAO;AACnC,UAAM,QAAQ,SAAS,MAAM;AAC7B,UAAM,UAAU,UAAU,MAAM,KAAK;AACrC,UAAM,QAAQ,KAAK,IAAI,QAAQ,QAAQ,WAAW;AAClD,UAAM,WAAW,QAAQ,MAAM,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM;AAC7D,YAAM,OAAO,eAAe,MAAM,MAAM,GAAG;AAG3C,aAAO,KAAK,OAAO,MAAM,GAAG,OAAO,GAAG,IAAI,IAAI,IAAI,MAAM,IAAI;AAAA,IAC9D,CAAC;AACD,QAAI,QAAQ,QAAQ,QAAQ;AAC1B,eAAS,KAAK;AAAA,QACZ,KAAK,GAAG,OAAO,GAAG;AAAA,QAClB,MAAM,MAAM;AAAA,QACZ,OAAO;AAAA,QACP,MAAM;AAAA,QACN,SAAS,GAAG,QAAQ,SAAS,KAAK;AAAA,QAClC,YAAY,QAAQ,SAAS;AAAA,MAAA,CAC9B;AAAA,IACH;AACA,WAAO,WAAW;AAClB,WAAO;AAAA,EACT;AAEA,WAAS,WAAWA,OAA6B;AAC/C,QAAIA,MAAK,SAAS,OAAQ,QAAO;AACjC,QAAIA,MAAK,SAAS,SAAU,QAAOA,MAAK,aAAa;AACrD,UAAM,QAAQ,SAASA,KAAI;AAC3B,WAAO,UAAU,UAAa,WAAW,KAAK,IAAI;AAAA,EACpD;AAEA,QAAM,WAAW,KAAK,MAAM,KAAK,GAAG,SAAS,KAAK,MAAS;AAE3D,SAAO;AAAA,IACL,OAAO,SAAS,SAAY,CAAA,IAAK,CAAC,QAAQ;AAAA,IAC1C,aAAa,CAACA,UAASA,MAAK;AAAA,IAC5B,iBAAiB,CAACA,UAASA,MAAK,aAAa,UAAa,WAAWA,KAAI;AAAA,IACzE,cAAc,CAAC,WAAW,QAAQ,QAAQ,oBAAoB,MAAM,CAAC;AAAA,IACrE,iBAAiB,CAAC,eAAe;AAC/B,YAAM,WAAW,gBAAgB,UAAU;AAC3C,UAAI,CAAC,SAAU,QAAO;AACtB,UAAI,UAAU;AACd,iBAAW,WAAW,UAAU;AAC9B,cAAM,SAAS,eAAe,SAAS,OAAO,EAAE,MAAM,OAAO;AAC7D,cAAM,OAAO,oBAAoB,OAAO,EAAE,KAAK,CAAC,UAAU,MAAM,SAAS,MAAM;AAC/E,YAAI,CAAC,KAAM,QAAO;AAClB,kBAAU;AAAA,MACZ;AACA,aAAO;AAAA,IACT;AAAA,EAAA;AAEJ;AAGA,SAAS,aAAa,MAAkC;;AACtD,UAAO,qBAAgB,IAAI,MAApB,mBAAuB,MAAM,GAAG,GAAG,IAAI,QAAQ;AACxD;AAOO,SAAS,gBAAgB,YAAwD;AACtF,MAAI,OAAO,WAAW,KAAA;AACtB,MAAI,SAAS,GAAI,QAAO;AACxB,MAAI,CAAC,KAAK,WAAW,GAAG,EAAG,QAAO;AAClC,SAAO,KAAK,MAAM,CAAC;AACnB,QAAM,WAAmC,CAAA;AACzC,SAAO,KAAK,SAAS,GAAG;AACtB,QAAI,KAAK,WAAW,IAAI,EAAG,QAAO;AAClC,QAAI,KAAK,WAAW,GAAG,GAAG;AACxB,YAAM,QAAQ,gCAAgC,KAAK,IAAI;AACvD,UAAI,CAAC,MAAO,QAAO;AACnB,eAAS,KAAK,MAAM,CAAC,CAAE;AACvB,aAAO,KAAK,MAAM,MAAM,CAAC,EAAE,MAAM;AACjC;AAAA,IACF;AACA,QAAI,KAAK,WAAW,GAAG,GAAG;AACxB,YAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,UAAI,QAAQ,EAAG,QAAO;AACtB,YAAM,QAAQ,KAAK,MAAM,GAAG,KAAK,EAAE,KAAA;AACnC,UAAI,QAAQ,KAAK,KAAK,YAAY,KAAK,OAAO,KAAK,CAAC;AAAA,eAC3C,sBAAsB,KAAK,KAAK,YAAY,KAAK,KAAK,MAAM,KAAK,CAAW;AAAA,eAC5E,YAAY,KAAK,KAAK,EAAG,UAAS,KAAK,MAAM,MAAM,GAAG,EAAE,CAAC;AAAA,UAC7D,QAAO;AACZ,aAAO,KAAK,MAAM,QAAQ,CAAC;AAC3B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;;;;;;;;;;"}
+{"version":3,"file":"jsonPathTree.cjs","sources":["../../src/components/jsonPathTree.ts"],"sourcesContent":["// The JSON→JSONPath tree model shared by the inline picker dropdown and the\n// full playground dialog.\n//\n// The two want opposite things from the same walk. The dropdown is a *preview*\n// of a row that has to render the instant it opens, so it builds eagerly and\n// pays for that with caps: depth, property count, and one array element. The\n// playground is a *browser* of the row, so it must have no caps at all — which\n// is only affordable if the walk is lazy, materialising a level at a time as the\n// operator opens it.\n\nconst SIMPLE_PROPERTY = /^[A-Za-z_$][A-Za-z0-9_$]*$/;\n\nexport const DEFAULT_MAX_DEPTH = 12;\nexport const DEFAULT_MAX_OBJECT_PROPERTIES = 100;\n/**\n * Entries the uncapped tree renders under one node before it stops and says so.\n *\n * Depth is what the playground removes the limit on; breadth still has to render\n * as DOM rows the moment a node opens, and a hundred-thousand-element array\n * would take the tab down. The remainder is reported in a visible row rather\n * than dropped quietly — an index past it is still reachable by typing it.\n */\nexport const DEFAULT_MAX_CHILDREN = 1000;\n\nexport type JSONPathNodeKind = \"array\" | \"object\" | \"scalar\" | \"more\";\n\nexport interface JSONPathNode {\n  key: string;\n  path: string;\n  value: unknown;\n  kind: JSONPathNodeKind;\n  summary: string;\n  children?: JSONPathNode[];\n  /**\n   * The top-level column this node's path is rooted at, set only inside a\n   * subtree decoded out of a JSON-encoded string. Such a path cannot be read\n   * from the row directly — the backend reaches it by way of the column's\n   * `source`, so the two have to be committed together.\n   */\n  root?: string;\n  /**\n   * The JSON-in-a-string boundaries crossed on the way down to this node,\n   * innermost first. `root` names only the top-level column, because that is\n   * what the backend's `source` takes — which loses the rest of the chain when\n   * the encoded value is nested, and says nothing about what it decoded to.\n   * A caller rebuilding an accessor needs both.\n   */\n  origin?: JSONPathOrigin;\n  /** Number of entries the node holds, before any paging. */\n  childCount: number;\n}\n\n/** One JSON-in-a-string boundary: where it was, and what came out of it. */\nexport interface JSONPathOrigin {\n  /** Path of the string node the document was decoded out of, in its own scope. */\n  path: string;\n  /** Kind of the decoded document — which decoder crosses this boundary. */\n  kind: \"array\" | \"object\";\n  /** The boundary enclosing this one, when JSON is encoded inside JSON. */\n  outer?: JSONPathOrigin;\n}\n\nexport interface BuildJSONPathNodeOptions {\n  maxDepth?: number;\n  maxObjectProperties?: number;\n  /** \"first\" exposes only element [0] of an array; \"all\" exposes every element. */\n  arrayMode?: \"first\" | \"all\";\n}\n\nexport function jsonPathKind(value: unknown): JSONPathNodeKind {\n  if (Array.isArray(value)) return \"array\";\n  return value !== null && typeof value === \"object\" ? \"object\" : \"scalar\";\n}\n\nexport function appendJSONPath(path: string, key: string | number): string {\n  if (typeof key === \"number\") return `${path}[${key}]`;\n  return SIMPLE_PROPERTY.test(key) ? `${path}.${key}` : `${path}[${JSON.stringify(key)}]`;\n}\n\nexport function summarizeJSON(value: unknown): string {\n  if (Array.isArray(value)) return `[${value.length} item${value.length === 1 ? \"\" : \"s\"}]`;\n  if (value !== null && typeof value === \"object\") {\n    const count = Object.keys(value).length;\n    return `{${count} ${count === 1 ? \"property\" : \"properties\"}}`;\n  }\n  if (typeof value === \"string\") return JSON.stringify(value.length > 80 ? `${value.slice(0, 77)}…` : value);\n  return String(value);\n}\n\nfunction entryCount(value: unknown): number {\n  if (Array.isArray(value)) return value.length;\n  if (value !== null && typeof value === \"object\") return Object.keys(value).length;\n  return 0;\n}\n\n/**\n * The eager, capped walk behind the inline dropdown. Deep, wide, or long values\n * are truncated on purpose: the dropdown opens on a click and cannot afford to\n * walk an arbitrary document first.\n */\nexport function buildJSONPathNode(\n  value: unknown,\n  path: string,\n  depth: number,\n  options: BuildJSONPathNodeOptions = {},\n): JSONPathNode {\n  const {\n    maxDepth = DEFAULT_MAX_DEPTH,\n    maxObjectProperties = DEFAULT_MAX_OBJECT_PROPERTIES,\n    arrayMode = \"first\",\n  } = options;\n  const kind = jsonPathKind(value);\n  const node: JSONPathNode = {\n    key: path,\n    path,\n    value,\n    kind,\n    summary: summarizeJSON(value),\n    childCount: entryCount(value),\n  };\n  if (kind === \"scalar\" || depth >= maxDepth) return node;\n  const entries = Array.isArray(value)\n    ? arrayMode === \"all\"\n      ? value.map((entry, index) => [index, entry] as const)\n      : value.length > 0\n        ? [[0, value[0]] as const]\n        : []\n    : Object.entries(value as Record<string, unknown>).slice(0, maxObjectProperties);\n  node.children = entries.map(([key, child]) =>\n    buildJSONPathNode(child, appendJSONPath(path, key), depth + 1, options),\n  );\n  return node;\n}\n\nexport interface LazyJSONPathTreeOptions {\n  maxChildren?: number;\n  /**\n   * Namespaces every node key. Two trees over different documents share their\n   * paths, and Tree keys its React elements by node key — without a distinct\n   * prefix, swapping the document underneath reuses the old subtree along with\n   * the children it had already loaded.\n   */\n  keyPrefix?: string;\n  /**\n   * Descend into a string that parses as JSON. Providers routinely hand back a\n   * document as an encoded column, and the backend already decodes one when a\n   * column names it as its `source` — without this the picker shows the single\n   * most interesting column in such a row as an opaque blob.\n   */\n  parseEmbeddedJSON?: boolean;\n}\n\nexport interface LazyJSONPathTree {\n  roots: JSONPathNode[];\n  /** Children already materialised, or undefined while the branch is unopened. */\n  getChildren: (node: JSONPathNode) => JSONPathNode[] | undefined;\n  hasMoreChildren: (node: JSONPathNode) => boolean;\n  loadChildren: (node: JSONPathNode) => Promise<JSONPathNode[]>;\n  /**\n   * Materialise the branch a literal expression addresses and return its node,\n   * so a tree can reveal the value it opened with. Returns undefined for an\n   * expression that selects rather than addresses (a wildcard, a descent, a\n   * filter) or for one the document does not carry.\n   */\n  materializePath: (expression: string) => JSONPathNode | undefined;\n}\n\n/**\n * An uncapped tree over `json`: every property, every array element, any depth.\n *\n * Nothing is walked until it is opened, so an arbitrarily deep or wide document\n * costs only what the operator actually looks at. Nodes are cached by path so\n * re-opening a branch returns the *same objects* — `TreeNode` compares the\n * selected node by identity, and a rebuilt node would silently lose the\n * highlight.\n */\nexport function createLazyJSONPathTree(\n  json: unknown,\n  options: LazyJSONPathTreeOptions = {},\n): LazyJSONPathTree {\n  const { maxChildren = DEFAULT_MAX_CHILDREN, parseEmbeddedJSON = true, keyPrefix = \"\" } = options;\n  const nodes = new Map<string, JSONPathNode>();\n\n  // hasMoreChildren runs on every render of every visible row, so the decode is\n  // memoised per node rather than re-parsing a long string each time.\n  const decoded = new Map<string, unknown>();\n\n  function embedded(node: JSONPathNode): unknown {\n    if (!parseEmbeddedJSON || typeof node.value !== \"string\") return undefined;\n    if (decoded.has(node.key)) return decoded.get(node.key);\n    const text = node.value.trim();\n    let parsed: unknown = undefined;\n    if (text.startsWith(\"{\") || text.startsWith(\"[\")) {\n      try {\n        const candidate: unknown = JSON.parse(text);\n        if (jsonPathKind(candidate) !== \"scalar\") parsed = candidate;\n      } catch {\n        parsed = undefined;\n      }\n    }\n    decoded.set(node.key, parsed);\n    return parsed;\n  }\n\n  // What a node's children are drawn from: its own value, or the document\n  // decoded out of it when it holds JSON as text. An embedded document restarts\n  // at `$` because that is where the backend evaluates it from once the column\n  // is named as a `source`.\n  function contents(node: JSONPathNode): {\n    value: unknown;\n    path: string;\n    root?: string;\n    origin?: JSONPathOrigin;\n  } {\n    const inner = embedded(node);\n    const scope: { value: unknown; path: string; root?: string; origin?: JSONPathOrigin } =\n      inner === undefined\n        ? { value: node.value, path: node.path }\n        : { value: inner, path: \"$\" };\n    const root = inner === undefined ? node.root : node.root ?? sourceColumn(node.path);\n    if (root !== undefined) scope.root = root;\n    // A boundary is only visible here: this is the one place that knows both\n    // which node held the text and what the text decoded to. embedded() has\n    // already rejected anything scalar, so the kind is array or object.\n    const origin =\n      inner === undefined\n        ? node.origin\n        : {\n            path: node.path,\n            kind: jsonPathKind(inner) as \"array\" | \"object\",\n            ...(node.origin ? { outer: node.origin } : {}),\n          };\n    if (origin !== undefined) scope.origin = origin;\n    return scope;\n  }\n\n  function node(\n    value: unknown,\n    path: string,\n    key: string,\n    root: string | undefined,\n    origin: JSONPathOrigin | undefined,\n  ): JSONPathNode {\n    const cached = nodes.get(key);\n    if (cached) return cached;\n    const created: JSONPathNode = {\n      key,\n      path,\n      value,\n      kind: jsonPathKind(value),\n      summary: summarizeJSON(value),\n      childCount: entryCount(value),\n    };\n    if (root !== undefined) created.root = root;\n    if (origin !== undefined) created.origin = origin;\n    nodes.set(key, created);\n    return created;\n  }\n\n  function entriesOf(value: unknown): Array<readonly [string | number, unknown]> {\n    if (Array.isArray(value)) return value.map((entry, index) => [index, entry] as const);\n    if (value !== null && typeof value === \"object\") return Object.entries(value as Record<string, unknown>);\n    return [];\n  }\n\n  function materializeChildren(parent: JSONPathNode): JSONPathNode[] {\n    if (parent.children) return parent.children;\n    const scope = contents(parent);\n    const entries = entriesOf(scope.value);\n    const limit = Math.min(entries.length, maxChildren);\n    const children = entries.slice(0, limit).map(([key, value]) => {\n      const path = appendJSONPath(scope.path, key);\n      // The key namespaces on the parent so an embedded document — which\n      // restarts its paths at `$` — cannot collide with the outer row.\n      return node(value, path, `${parent.key}>${path}`, scope.root, scope.origin);\n    });\n    if (limit < entries.length) {\n      children.push({\n        key: `${parent.key}>…`,\n        path: scope.path,\n        value: undefined,\n        kind: \"more\",\n        summary: `${entries.length - limit} more not shown — address them by index`,\n        childCount: entries.length - limit,\n      });\n    }\n    parent.children = children;\n    return children;\n  }\n\n  function expandable(node: JSONPathNode): boolean {\n    if (node.kind === \"more\") return false;\n    if (node.kind !== \"scalar\") return node.childCount > 0;\n    const inner = embedded(node);\n    return inner !== undefined && entryCount(inner) > 0;\n  }\n\n  const rootNode = node(json, \"$\", `${keyPrefix}$`, undefined, undefined);\n\n  return {\n    roots: json === undefined ? [] : [rootNode],\n    getChildren: (node) => node.children,\n    hasMoreChildren: (node) => node.children === undefined && expandable(node),\n    loadChildren: (parent) => Promise.resolve(materializeChildren(parent)),\n    materializePath: (expression) => {\n      const segments = literalSegments(expression);\n      if (!segments) return undefined;\n      let current = rootNode;\n      for (const segment of segments) {\n        const target = appendJSONPath(contents(current).path, segment);\n        const next = materializeChildren(current).find((child) => child.path === target);\n        if (!next) return undefined;\n        current = next;\n      }\n      return current;\n    },\n  };\n}\n\n/** The top-level column a row-rooted path starts at, e.g. `$.payload.x` → `payload`. */\nfunction sourceColumn(path: string): string | undefined {\n  return literalSegments(path)?.slice(0, 1).map(String)[0];\n}\n\n/**\n * The literal key/index chain an expression addresses, or undefined when it\n * selects instead — a wildcard, a descent, or a filter matches a set whose shape\n * depends on the document, so there is no single branch to walk to.\n */\nexport function literalSegments(expression: string): Array<string | number> | undefined {\n  let rest = expression.trim();\n  if (rest === \"\") return undefined;\n  if (!rest.startsWith(\"$\")) return undefined;\n  rest = rest.slice(1);\n  const segments: Array<string | number> = [];\n  while (rest.length > 0) {\n    if (rest.startsWith(\"..\")) return undefined;\n    if (rest.startsWith(\".\")) {\n      const match = /^\\.([A-Za-z_$][A-Za-z0-9_$]*)/.exec(rest);\n      if (!match) return undefined;\n      segments.push(match[1]!);\n      rest = rest.slice(match[0].length);\n      continue;\n    }\n    if (rest.startsWith(\"[\")) {\n      const close = rest.indexOf(\"]\");\n      if (close < 0) return undefined;\n      const inner = rest.slice(1, close).trim();\n      if (/^\\d+$/.test(inner)) segments.push(Number(inner));\n      else if (/^\"(?:[^\"\\\\]|\\\\.)*\"$/.test(inner)) segments.push(JSON.parse(inner) as string);\n      else if (/^'[^']*'$/.test(inner)) segments.push(inner.slice(1, -1));\n      else return undefined;\n      rest = rest.slice(close + 1);\n      continue;\n    }\n    return undefined;\n  }\n  return segments;\n}\n"],"names":["node"],"mappings":";;AAUA,MAAM,kBAAkB;AAEjB,MAAM,oBAAoB;AAC1B,MAAM,gCAAgC;AAStC,MAAM,uBAAuB;AA+C7B,SAAS,aAAa,OAAkC;AAC7D,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,SAAO,UAAU,QAAQ,OAAO,UAAU,WAAW,WAAW;AAClE;AAEO,SAAS,eAAe,MAAc,KAA8B;AACzE,MAAI,OAAO,QAAQ,iBAAiB,GAAG,IAAI,IAAI,GAAG;AAClD,SAAO,gBAAgB,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,KAAK,UAAU,GAAG,CAAC;AACtF;AAEO,SAAS,cAAc,OAAwB;AACpD,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,IAAI,MAAM,MAAM,QAAQ,MAAM,WAAW,IAAI,KAAK,GAAG;AACtF,MAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;AAC/C,UAAM,QAAQ,OAAO,KAAK,KAAK,EAAE;AACjC,WAAO,IAAI,KAAK,IAAI,UAAU,IAAI,aAAa,YAAY;AAAA,EAC7D;AACA,MAAI,OAAO,UAAU,SAAU,QAAO,KAAK,UAAU,MAAM,SAAS,KAAK,GAAG,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,KAAK;AACzG,SAAO,OAAO,KAAK;AACrB;AAEA,SAAS,WAAW,OAAwB;AAC1C,MAAI,MAAM,QAAQ,KAAK,UAAU,MAAM;AACvC,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO,OAAO,KAAK,KAAK,EAAE;AAC3E,SAAO;AACT;AAOO,SAAS,kBACd,OACA,MACA,OACA,UAAoC,CAAA,GACtB;AACd,QAAM;AAAA,IACJ,WAAW;AAAA,IACX,sBAAsB;AAAA,IACtB,YAAY;AAAA,EAAA,IACV;AACJ,QAAM,OAAO,aAAa,KAAK;AAC/B,QAAM,OAAqB;AAAA,IACzB,KAAK;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,cAAc,KAAK;AAAA,IAC5B,YAAY,WAAW,KAAK;AAAA,EAAA;AAE9B,MAAI,SAAS,YAAY,SAAS,SAAU,QAAO;AACnD,QAAM,UAAU,MAAM,QAAQ,KAAK,IAC/B,cAAc,QACZ,MAAM,IAAI,CAAC,OAAO,UAAU,CAAC,OAAO,KAAK,CAAU,IACnD,MAAM,SAAS,IACb,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAU,IACvB,CAAA,IACJ,OAAO,QAAQ,KAAgC,EAAE,MAAM,GAAG,mBAAmB;AACjF,OAAK,WAAW,QAAQ;AAAA,IAAI,CAAC,CAAC,KAAK,KAAK,MACtC,kBAAkB,OAAO,eAAe,MAAM,GAAG,GAAG,QAAQ,GAAG,OAAO;AAAA,EAAA;AAExE,SAAO;AACT;AA4CO,SAAS,uBACd,MACA,UAAmC,IACjB;AAClB,QAAM,EAAE,cAAc,sBAAsB,oBAAoB,MAAM,YAAY,OAAO;AACzF,QAAM,4BAAY,IAAA;AAIlB,QAAM,8BAAc,IAAA;AAEpB,WAAS,SAASA,OAA6B;AAC7C,QAAI,CAAC,qBAAqB,OAAOA,MAAK,UAAU,SAAU,QAAO;AACjE,QAAI,QAAQ,IAAIA,MAAK,GAAG,EAAG,QAAO,QAAQ,IAAIA,MAAK,GAAG;AACtD,UAAM,OAAOA,MAAK,MAAM,KAAA;AACxB,QAAI,SAAkB;AACtB,QAAI,KAAK,WAAW,GAAG,KAAK,KAAK,WAAW,GAAG,GAAG;AAChD,UAAI;AACF,cAAM,YAAqB,KAAK,MAAM,IAAI;AAC1C,YAAI,aAAa,SAAS,MAAM,SAAU,UAAS;AAAA,MACrD,QAAQ;AACN,iBAAS;AAAA,MACX;AAAA,IACF;AACA,YAAQ,IAAIA,MAAK,KAAK,MAAM;AAC5B,WAAO;AAAA,EACT;AAMA,WAAS,SAASA,OAKhB;AACA,UAAM,QAAQ,SAASA,KAAI;AAC3B,UAAM,QACJ,UAAU,SACN,EAAE,OAAOA,MAAK,OAAO,MAAMA,MAAK,SAChC,EAAE,OAAO,OAAO,MAAM,IAAA;AAC5B,UAAM,OAAO,UAAU,SAAYA,MAAK,OAAOA,MAAK,QAAQ,aAAaA,MAAK,IAAI;AAClF,QAAI,SAAS,OAAW,OAAM,OAAO;AAIrC,UAAM,SACJ,UAAU,SACNA,MAAK,SACL;AAAA,MACE,MAAMA,MAAK;AAAA,MACX,MAAM,aAAa,KAAK;AAAA,MACxB,GAAIA,MAAK,SAAS,EAAE,OAAOA,MAAK,OAAA,IAAW,CAAA;AAAA,IAAC;AAEpD,QAAI,WAAW,OAAW,OAAM,SAAS;AACzC,WAAO;AAAA,EACT;AAEA,WAAS,KACP,OACA,MACA,KACA,MACA,QACc;AACd,UAAM,SAAS,MAAM,IAAI,GAAG;AAC5B,QAAI,OAAQ,QAAO;AACnB,UAAM,UAAwB;AAAA,MAC5B;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAM,aAAa,KAAK;AAAA,MACxB,SAAS,cAAc,KAAK;AAAA,MAC5B,YAAY,WAAW,KAAK;AAAA,IAAA;AAE9B,QAAI,SAAS,OAAW,SAAQ,OAAO;AACvC,QAAI,WAAW,OAAW,SAAQ,SAAS;AAC3C,UAAM,IAAI,KAAK,OAAO;AACtB,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,OAA4D;AAC7E,QAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,IAAI,CAAC,OAAO,UAAU,CAAC,OAAO,KAAK,CAAU;AACpF,QAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO,OAAO,QAAQ,KAAgC;AACvG,WAAO,CAAA;AAAA,EACT;AAEA,WAAS,oBAAoB,QAAsC;AACjE,QAAI,OAAO,SAAU,QAAO,OAAO;AACnC,UAAM,QAAQ,SAAS,MAAM;AAC7B,UAAM,UAAU,UAAU,MAAM,KAAK;AACrC,UAAM,QAAQ,KAAK,IAAI,QAAQ,QAAQ,WAAW;AAClD,UAAM,WAAW,QAAQ,MAAM,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM;AAC7D,YAAM,OAAO,eAAe,MAAM,MAAM,GAAG;AAG3C,aAAO,KAAK,OAAO,MAAM,GAAG,OAAO,GAAG,IAAI,IAAI,IAAI,MAAM,MAAM,MAAM,MAAM;AAAA,IAC5E,CAAC;AACD,QAAI,QAAQ,QAAQ,QAAQ;AAC1B,eAAS,KAAK;AAAA,QACZ,KAAK,GAAG,OAAO,GAAG;AAAA,QAClB,MAAM,MAAM;AAAA,QACZ,OAAO;AAAA,QACP,MAAM;AAAA,QACN,SAAS,GAAG,QAAQ,SAAS,KAAK;AAAA,QAClC,YAAY,QAAQ,SAAS;AAAA,MAAA,CAC9B;AAAA,IACH;AACA,WAAO,WAAW;AAClB,WAAO;AAAA,EACT;AAEA,WAAS,WAAWA,OAA6B;AAC/C,QAAIA,MAAK,SAAS,OAAQ,QAAO;AACjC,QAAIA,MAAK,SAAS,SAAU,QAAOA,MAAK,aAAa;AACrD,UAAM,QAAQ,SAASA,KAAI;AAC3B,WAAO,UAAU,UAAa,WAAW,KAAK,IAAI;AAAA,EACpD;AAEA,QAAM,WAAW,KAAK,MAAM,KAAK,GAAG,SAAS,KAAK,QAAW,MAAS;AAEtE,SAAO;AAAA,IACL,OAAO,SAAS,SAAY,CAAA,IAAK,CAAC,QAAQ;AAAA,IAC1C,aAAa,CAACA,UAASA,MAAK;AAAA,IAC5B,iBAAiB,CAACA,UAASA,MAAK,aAAa,UAAa,WAAWA,KAAI;AAAA,IACzE,cAAc,CAAC,WAAW,QAAQ,QAAQ,oBAAoB,MAAM,CAAC;AAAA,IACrE,iBAAiB,CAAC,eAAe;AAC/B,YAAM,WAAW,gBAAgB,UAAU;AAC3C,UAAI,CAAC,SAAU,QAAO;AACtB,UAAI,UAAU;AACd,iBAAW,WAAW,UAAU;AAC9B,cAAM,SAAS,eAAe,SAAS,OAAO,EAAE,MAAM,OAAO;AAC7D,cAAM,OAAO,oBAAoB,OAAO,EAAE,KAAK,CAAC,UAAU,MAAM,SAAS,MAAM;AAC/E,YAAI,CAAC,KAAM,QAAO;AAClB,kBAAU;AAAA,MACZ;AACA,aAAO;AAAA,IACT;AAAA,EAAA;AAEJ;AAGA,SAAS,aAAa,MAAkC;;AACtD,UAAO,qBAAgB,IAAI,MAApB,mBAAuB,MAAM,GAAG,GAAG,IAAI,QAAQ;AACxD;AAOO,SAAS,gBAAgB,YAAwD;AACtF,MAAI,OAAO,WAAW,KAAA;AACtB,MAAI,SAAS,GAAI,QAAO;AACxB,MAAI,CAAC,KAAK,WAAW,GAAG,EAAG,QAAO;AAClC,SAAO,KAAK,MAAM,CAAC;AACnB,QAAM,WAAmC,CAAA;AACzC,SAAO,KAAK,SAAS,GAAG;AACtB,QAAI,KAAK,WAAW,IAAI,EAAG,QAAO;AAClC,QAAI,KAAK,WAAW,GAAG,GAAG;AACxB,YAAM,QAAQ,gCAAgC,KAAK,IAAI;AACvD,UAAI,CAAC,MAAO,QAAO;AACnB,eAAS,KAAK,MAAM,CAAC,CAAE;AACvB,aAAO,KAAK,MAAM,MAAM,CAAC,EAAE,MAAM;AACjC;AAAA,IACF;AACA,QAAI,KAAK,WAAW,GAAG,GAAG;AACxB,YAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,UAAI,QAAQ,EAAG,QAAO;AACtB,YAAM,QAAQ,KAAK,MAAM,GAAG,KAAK,EAAE,KAAA;AACnC,UAAI,QAAQ,KAAK,KAAK,YAAY,KAAK,OAAO,KAAK,CAAC;AAAA,eAC3C,sBAAsB,KAAK,KAAK,YAAY,KAAK,KAAK,MAAM,KAAK,CAAW;AAAA,eAC5E,YAAY,KAAK,KAAK,EAAG,UAAS,KAAK,MAAM,MAAM,GAAG,EAAE,CAAC;AAAA,UAC7D,QAAO;AACZ,aAAO,KAAK,MAAM,QAAQ,CAAC;AAC3B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;;;;;;;;;;"}

package/dist/components/jsonPathTree.d.ts

@@ -24,9 +24,26 @@ export interface JSONPathNode {
      * `source`, so the two have to be committed together.
      */
     root?: string;
+    /**
+     * The JSON-in-a-string boundaries crossed on the way down to this node,
+     * innermost first. `root` names only the top-level column, because that is
+     * what the backend's `source` takes — which loses the rest of the chain when
+     * the encoded value is nested, and says nothing about what it decoded to.
+     * A caller rebuilding an accessor needs both.
+     */
+    origin?: JSONPathOrigin;
     /** Number of entries the node holds, before any paging. */
     childCount: number;
 }
+/** One JSON-in-a-string boundary: where it was, and what came out of it. */
+export interface JSONPathOrigin {
+    /** Path of the string node the document was decoded out of, in its own scope. */
+    path: string;
+    /** Kind of the decoded document — which decoder crosses this boundary. */
+    kind: "array" | "object";
+    /** The boundary enclosing this one, when JSON is encoded inside JSON. */
+    outer?: JSONPathOrigin;
+}
 export interface BuildJSONPathNodeOptions {
     maxDepth?: number;
     maxObjectProperties?: number;

package/dist/components/jsonPathTree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"jsonPathTree.d.ts","sourceRoot":"","sources":["../../src/components/jsonPathTree.ts"],"names":[],"mappings":"AAYA,eAAO,MAAM,iBAAiB,KAAK,CAAC;AACpC,eAAO,MAAM,6BAA6B,MAAM,CAAC;AACjD;;;;;;;GAOG;AACH,eAAO,MAAM,oBAAoB,OAAO,CAAC;AAEzC,MAAM,MAAM,gBAAgB,GAAG,OAAO,GAAG,QAAQ,GAAG,QAAQ,GAAG,MAAM,CAAC;AAEtE,MAAM,WAAW,YAAY;IAC3B,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,OAAO,CAAC;IACf,IAAI,EAAE,gBAAgB,CAAC;IACvB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,YAAY,EAAE,CAAC;IAC1B;;;;;OAKG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,2DAA2D;IAC3D,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,wBAAwB;IACvC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,iFAAiF;IACjF,SAAS,CAAC,EAAE,OAAO,GAAG,KAAK,CAAC;CAC7B;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,gBAAgB,CAG7D;AAED,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAGzE;AAED,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAQpD;AAQD;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,OAAO,EACd,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,wBAA6B,GACrC,YAAY,CA2Bd;AAED,MAAM,WAAW,uBAAuB;IACtC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;;OAKG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;OAKG;IACH,iBAAiB,CAAC,EAAE,OAAO,CAAC;CAC7B;AAED,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,gFAAgF;IAChF,WAAW,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,YAAY,EAAE,GAAG,SAAS,CAAC;IAChE,eAAe,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,OAAO,CAAC;IACjD,YAAY,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;IAC9D;;;;;OAKG;IACH,eAAe,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,YAAY,GAAG,SAAS,CAAC;CACnE;AAED;;;;;;;;GAQG;AACH,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,OAAO,EACb,OAAO,GAAE,uBAA4B,GACpC,gBAAgB,CAuHlB;AAOD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,SAAS,CA6BtF"}
+{"version":3,"file":"jsonPathTree.d.ts","sourceRoot":"","sources":["../../src/components/jsonPathTree.ts"],"names":[],"mappings":"AAYA,eAAO,MAAM,iBAAiB,KAAK,CAAC;AACpC,eAAO,MAAM,6BAA6B,MAAM,CAAC;AACjD;;;;;;;GAOG;AACH,eAAO,MAAM,oBAAoB,OAAO,CAAC;AAEzC,MAAM,MAAM,gBAAgB,GAAG,OAAO,GAAG,QAAQ,GAAG,QAAQ,GAAG,MAAM,CAAC;AAEtE,MAAM,WAAW,YAAY;IAC3B,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,OAAO,CAAC;IACf,IAAI,EAAE,gBAAgB,CAAC;IACvB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,YAAY,EAAE,CAAC;IAC1B;;;;;OAKG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,cAAc,CAAC;IACxB,2DAA2D;IAC3D,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,4EAA4E;AAC5E,MAAM,WAAW,cAAc;IAC7B,iFAAiF;IACjF,IAAI,EAAE,MAAM,CAAC;IACb,0EAA0E;IAC1E,IAAI,EAAE,OAAO,GAAG,QAAQ,CAAC;IACzB,yEAAyE;IACzE,KAAK,CAAC,EAAE,cAAc,CAAC;CACxB;AAED,MAAM,WAAW,wBAAwB;IACvC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,iFAAiF;IACjF,SAAS,CAAC,EAAE,OAAO,GAAG,KAAK,CAAC;CAC7B;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,gBAAgB,CAG7D;AAED,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAGzE;AAED,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAQpD;AAQD;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,OAAO,EACd,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,wBAA6B,GACrC,YAAY,CA2Bd;AAED,MAAM,WAAW,uBAAuB;IACtC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;;OAKG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;OAKG;IACH,iBAAiB,CAAC,EAAE,OAAO,CAAC;CAC7B;AAED,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,gFAAgF;IAChF,WAAW,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,YAAY,EAAE,GAAG,SAAS,CAAC;IAChE,eAAe,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,OAAO,CAAC;IACjD,YAAY,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;IAC9D;;;;;OAKG;IACH,eAAe,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,YAAY,GAAG,SAAS,CAAC;CACnE;AAED;;;;;;;;GAQG;AACH,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,OAAO,EACb,OAAO,GAAE,uBAA4B,GACpC,gBAAgB,CA0IlB;AAOD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,SAAS,CA6BtF"}

package/dist/components/jsonPathTree.js

@@ -71,9 +71,15 @@ function createLazyJSONPathTree(json, options = {}) {
     const scope = inner === void 0 ? { value: node2.value, path: node2.path } : { value: inner, path: "$" };
     const root = inner === void 0 ? node2.root : node2.root ?? sourceColumn(node2.path);
     if (root !== void 0) scope.root = root;
+    const origin = inner === void 0 ? node2.origin : {
+      path: node2.path,
+      kind: jsonPathKind(inner),
+      ...node2.origin ? { outer: node2.origin } : {}
+    };
+    if (origin !== void 0) scope.origin = origin;
     return scope;
   }
-  function node(value, path, key, root) {
+  function node(value, path, key, root, origin) {
     const cached = nodes.get(key);
     if (cached) return cached;
     const created = {
@@ -85,6 +91,7 @@ function createLazyJSONPathTree(json, options = {}) {
       childCount: entryCount(value)
     };
     if (root !== void 0) created.root = root;
+    if (origin !== void 0) created.origin = origin;
     nodes.set(key, created);
     return created;
   }
@@ -100,7 +107,7 @@ function createLazyJSONPathTree(json, options = {}) {
     const limit = Math.min(entries.length, maxChildren);
     const children = entries.slice(0, limit).map(([key, value]) => {
       const path = appendJSONPath(scope.path, key);
-      return node(value, path, `${parent.key}>${path}`, scope.root);
+      return node(value, path, `${parent.key}>${path}`, scope.root, scope.origin);
     });
     if (limit < entries.length) {
       children.push({
@@ -121,7 +128,7 @@ function createLazyJSONPathTree(json, options = {}) {
     const inner = embedded(node2);
     return inner !== void 0 && entryCount(inner) > 0;
   }
-  const rootNode = node(json, "$", `${keyPrefix}$`, void 0);
+  const rootNode = node(json, "$", `${keyPrefix}$`, void 0, void 0);
   return {
     roots: json === void 0 ? [] : [rootNode],
     getChildren: (node2) => node2.children,