@flanksource/clicky-ui 0.3.18 → 0.3.19

package/dist/components/jsonPathTree.cjs

@@ -0,0 +1,189 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const SIMPLE_PROPERTY = /^[A-Za-z_$][A-Za-z0-9_$]*$/;
+const DEFAULT_MAX_DEPTH = 12;
+const DEFAULT_MAX_OBJECT_PROPERTIES = 100;
+const DEFAULT_MAX_CHILDREN = 1e3;
+function jsonPathKind(value) {
+  if (Array.isArray(value)) return "array";
+  return value !== null && typeof value === "object" ? "object" : "scalar";
+}
+function appendJSONPath(path, key) {
+  if (typeof key === "number") return `${path}[${key}]`;
+  return SIMPLE_PROPERTY.test(key) ? `${path}.${key}` : `${path}[${JSON.stringify(key)}]`;
+}
+function summarizeJSON(value) {
+  if (Array.isArray(value)) return `[${value.length} item${value.length === 1 ? "" : "s"}]`;
+  if (value !== null && typeof value === "object") {
+    const count = Object.keys(value).length;
+    return `{${count} ${count === 1 ? "property" : "properties"}}`;
+  }
+  if (typeof value === "string") return JSON.stringify(value.length > 80 ? `${value.slice(0, 77)}…` : value);
+  return String(value);
+}
+function entryCount(value) {
+  if (Array.isArray(value)) return value.length;
+  if (value !== null && typeof value === "object") return Object.keys(value).length;
+  return 0;
+}
+function buildJSONPathNode(value, path, depth, options = {}) {
+  const {
+    maxDepth = DEFAULT_MAX_DEPTH,
+    maxObjectProperties = DEFAULT_MAX_OBJECT_PROPERTIES,
+    arrayMode = "first"
+  } = options;
+  const kind = jsonPathKind(value);
+  const node = {
+    key: path,
+    path,
+    value,
+    kind,
+    summary: summarizeJSON(value),
+    childCount: entryCount(value)
+  };
+  if (kind === "scalar" || depth >= maxDepth) return node;
+  const entries = Array.isArray(value) ? arrayMode === "all" ? value.map((entry, index) => [index, entry]) : value.length > 0 ? [[0, value[0]]] : [] : Object.entries(value).slice(0, maxObjectProperties);
+  node.children = entries.map(
+    ([key, child]) => buildJSONPathNode(child, appendJSONPath(path, key), depth + 1, options)
+  );
+  return node;
+}
+function createLazyJSONPathTree(json, options = {}) {
+  const { maxChildren = DEFAULT_MAX_CHILDREN, parseEmbeddedJSON = true, keyPrefix = "" } = options;
+  const nodes = /* @__PURE__ */ new Map();
+  const decoded = /* @__PURE__ */ new Map();
+  function embedded(node2) {
+    if (!parseEmbeddedJSON || typeof node2.value !== "string") return void 0;
+    if (decoded.has(node2.key)) return decoded.get(node2.key);
+    const text = node2.value.trim();
+    let parsed = void 0;
+    if (text.startsWith("{") || text.startsWith("[")) {
+      try {
+        const candidate = JSON.parse(text);
+        if (jsonPathKind(candidate) !== "scalar") parsed = candidate;
+      } catch {
+        parsed = void 0;
+      }
+    }
+    decoded.set(node2.key, parsed);
+    return parsed;
+  }
+  function contents(node2) {
+    const inner = embedded(node2);
+    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;
+    return scope;
+  }
+  function node(value, path, key, root) {
+    const cached = nodes.get(key);
+    if (cached) return cached;
+    const created = {
+      key,
+      path,
+      value,
+      kind: jsonPathKind(value),
+      summary: summarizeJSON(value),
+      childCount: entryCount(value)
+    };
+    if (root !== void 0) created.root = root;
+    nodes.set(key, created);
+    return created;
+  }
+  function entriesOf(value) {
+    if (Array.isArray(value)) return value.map((entry, index) => [index, entry]);
+    if (value !== null && typeof value === "object") return Object.entries(value);
+    return [];
+  }
+  function materializeChildren(parent) {
+    if (parent.children) return parent.children;
+    const scope = contents(parent);
+    const entries = entriesOf(scope.value);
+    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);
+    });
+    if (limit < entries.length) {
+      children.push({
+        key: `${parent.key}>…`,
+        path: scope.path,
+        value: void 0,
+        kind: "more",
+        summary: `${entries.length - limit} more not shown — address them by index`,
+        childCount: entries.length - limit
+      });
+    }
+    parent.children = children;
+    return children;
+  }
+  function expandable(node2) {
+    if (node2.kind === "more") return false;
+    if (node2.kind !== "scalar") return node2.childCount > 0;
+    const inner = embedded(node2);
+    return inner !== void 0 && entryCount(inner) > 0;
+  }
+  const rootNode = node(json, "$", `${keyPrefix}$`, void 0);
+  return {
+    roots: json === void 0 ? [] : [rootNode],
+    getChildren: (node2) => node2.children,
+    hasMoreChildren: (node2) => node2.children === void 0 && expandable(node2),
+    loadChildren: (parent) => Promise.resolve(materializeChildren(parent)),
+    materializePath: (expression) => {
+      const segments = literalSegments(expression);
+      if (!segments) return void 0;
+      let current = rootNode;
+      for (const segment of segments) {
+        const target = appendJSONPath(contents(current).path, segment);
+        const next = materializeChildren(current).find((child) => child.path === target);
+        if (!next) return void 0;
+        current = next;
+      }
+      return current;
+    }
+  };
+}
+function sourceColumn(path) {
+  var _a;
+  return (_a = literalSegments(path)) == null ? void 0 : _a.slice(0, 1).map(String)[0];
+}
+function literalSegments(expression) {
+  let rest = expression.trim();
+  if (rest === "") return void 0;
+  if (!rest.startsWith("$")) return void 0;
+  rest = rest.slice(1);
+  const segments = [];
+  while (rest.length > 0) {
+    if (rest.startsWith("..")) return void 0;
+    if (rest.startsWith(".")) {
+      const match = /^\.([A-Za-z_$][A-Za-z0-9_$]*)/.exec(rest);
+      if (!match) return void 0;
+      segments.push(match[1]);
+      rest = rest.slice(match[0].length);
+      continue;
+    }
+    if (rest.startsWith("[")) {
+      const close = rest.indexOf("]");
+      if (close < 0) return void 0;
+      const inner = rest.slice(1, close).trim();
+      if (/^\d+$/.test(inner)) segments.push(Number(inner));
+      else if (/^"(?:[^"\\]|\\.)*"$/.test(inner)) segments.push(JSON.parse(inner));
+      else if (/^'[^']*'$/.test(inner)) segments.push(inner.slice(1, -1));
+      else return void 0;
+      rest = rest.slice(close + 1);
+      continue;
+    }
+    return void 0;
+  }
+  return segments;
+}
+exports.DEFAULT_MAX_CHILDREN = DEFAULT_MAX_CHILDREN;
+exports.DEFAULT_MAX_DEPTH = DEFAULT_MAX_DEPTH;
+exports.DEFAULT_MAX_OBJECT_PROPERTIES = DEFAULT_MAX_OBJECT_PROPERTIES;
+exports.appendJSONPath = appendJSONPath;
+exports.buildJSONPathNode = buildJSONPathNode;
+exports.createLazyJSONPathTree = createLazyJSONPathTree;
+exports.jsonPathKind = jsonPathKind;
+exports.literalSegments = literalSegments;
+exports.summarizeJSON = summarizeJSON;
+//# sourceMappingURL=jsonPathTree.cjs.map

package/dist/components/jsonPathTree.cjs.map

@@ -0,0 +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;;;;;;;;;;"}

package/dist/components/jsonPathTree.d.ts

@@ -0,0 +1,92 @@
+export declare const DEFAULT_MAX_DEPTH = 12;
+export declare const DEFAULT_MAX_OBJECT_PROPERTIES = 100;
+/**
+ * Entries the uncapped tree renders under one node before it stops and says so.
+ *
+ * Depth is what the playground removes the limit on; breadth still has to render
+ * as DOM rows the moment a node opens, and a hundred-thousand-element array
+ * would take the tab down. The remainder is reported in a visible row rather
+ * than dropped quietly — an index past it is still reachable by typing it.
+ */
+export declare const DEFAULT_MAX_CHILDREN = 1000;
+export type JSONPathNodeKind = "array" | "object" | "scalar" | "more";
+export interface JSONPathNode {
+    key: string;
+    path: string;
+    value: unknown;
+    kind: JSONPathNodeKind;
+    summary: string;
+    children?: JSONPathNode[];
+    /**
+     * The top-level column this node's path is rooted at, set only inside a
+     * subtree decoded out of a JSON-encoded string. Such a path cannot be read
+     * from the row directly — the backend reaches it by way of the column's
+     * `source`, so the two have to be committed together.
+     */
+    root?: string;
+    /** Number of entries the node holds, before any paging. */
+    childCount: number;
+}
+export interface BuildJSONPathNodeOptions {
+    maxDepth?: number;
+    maxObjectProperties?: number;
+    /** "first" exposes only element [0] of an array; "all" exposes every element. */
+    arrayMode?: "first" | "all";
+}
+export declare function jsonPathKind(value: unknown): JSONPathNodeKind;
+export declare function appendJSONPath(path: string, key: string | number): string;
+export declare function summarizeJSON(value: unknown): string;
+/**
+ * The eager, capped walk behind the inline dropdown. Deep, wide, or long values
+ * are truncated on purpose: the dropdown opens on a click and cannot afford to
+ * walk an arbitrary document first.
+ */
+export declare function buildJSONPathNode(value: unknown, path: string, depth: number, options?: BuildJSONPathNodeOptions): JSONPathNode;
+export interface LazyJSONPathTreeOptions {
+    maxChildren?: number;
+    /**
+     * Namespaces every node key. Two trees over different documents share their
+     * paths, and Tree keys its React elements by node key — without a distinct
+     * prefix, swapping the document underneath reuses the old subtree along with
+     * the children it had already loaded.
+     */
+    keyPrefix?: string;
+    /**
+     * Descend into a string that parses as JSON. Providers routinely hand back a
+     * document as an encoded column, and the backend already decodes one when a
+     * column names it as its `source` — without this the picker shows the single
+     * most interesting column in such a row as an opaque blob.
+     */
+    parseEmbeddedJSON?: boolean;
+}
+export interface LazyJSONPathTree {
+    roots: JSONPathNode[];
+    /** Children already materialised, or undefined while the branch is unopened. */
+    getChildren: (node: JSONPathNode) => JSONPathNode[] | undefined;
+    hasMoreChildren: (node: JSONPathNode) => boolean;
+    loadChildren: (node: JSONPathNode) => Promise<JSONPathNode[]>;
+    /**
+     * Materialise the branch a literal expression addresses and return its node,
+     * so a tree can reveal the value it opened with. Returns undefined for an
+     * expression that selects rather than addresses (a wildcard, a descent, a
+     * filter) or for one the document does not carry.
+     */
+    materializePath: (expression: string) => JSONPathNode | undefined;
+}
+/**
+ * An uncapped tree over `json`: every property, every array element, any depth.
+ *
+ * Nothing is walked until it is opened, so an arbitrarily deep or wide document
+ * costs only what the operator actually looks at. Nodes are cached by path so
+ * re-opening a branch returns the *same objects* — `TreeNode` compares the
+ * selected node by identity, and a rebuilt node would silently lose the
+ * highlight.
+ */
+export declare function createLazyJSONPathTree(json: unknown, options?: LazyJSONPathTreeOptions): LazyJSONPathTree;
+/**
+ * The literal key/index chain an expression addresses, or undefined when it
+ * selects instead — a wildcard, a descent, or a filter matches a set whose shape
+ * depends on the document, so there is no single branch to walk to.
+ */
+export declare function literalSegments(expression: string): Array<string | number> | undefined;
+//# sourceMappingURL=jsonPathTree.d.ts.map

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

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

package/dist/components/jsonPathTree.js

@@ -0,0 +1,189 @@
+const SIMPLE_PROPERTY = /^[A-Za-z_$][A-Za-z0-9_$]*$/;
+const DEFAULT_MAX_DEPTH = 12;
+const DEFAULT_MAX_OBJECT_PROPERTIES = 100;
+const DEFAULT_MAX_CHILDREN = 1e3;
+function jsonPathKind(value) {
+  if (Array.isArray(value)) return "array";
+  return value !== null && typeof value === "object" ? "object" : "scalar";
+}
+function appendJSONPath(path, key) {
+  if (typeof key === "number") return `${path}[${key}]`;
+  return SIMPLE_PROPERTY.test(key) ? `${path}.${key}` : `${path}[${JSON.stringify(key)}]`;
+}
+function summarizeJSON(value) {
+  if (Array.isArray(value)) return `[${value.length} item${value.length === 1 ? "" : "s"}]`;
+  if (value !== null && typeof value === "object") {
+    const count = Object.keys(value).length;
+    return `{${count} ${count === 1 ? "property" : "properties"}}`;
+  }
+  if (typeof value === "string") return JSON.stringify(value.length > 80 ? `${value.slice(0, 77)}…` : value);
+  return String(value);
+}
+function entryCount(value) {
+  if (Array.isArray(value)) return value.length;
+  if (value !== null && typeof value === "object") return Object.keys(value).length;
+  return 0;
+}
+function buildJSONPathNode(value, path, depth, options = {}) {
+  const {
+    maxDepth = DEFAULT_MAX_DEPTH,
+    maxObjectProperties = DEFAULT_MAX_OBJECT_PROPERTIES,
+    arrayMode = "first"
+  } = options;
+  const kind = jsonPathKind(value);
+  const node = {
+    key: path,
+    path,
+    value,
+    kind,
+    summary: summarizeJSON(value),
+    childCount: entryCount(value)
+  };
+  if (kind === "scalar" || depth >= maxDepth) return node;
+  const entries = Array.isArray(value) ? arrayMode === "all" ? value.map((entry, index) => [index, entry]) : value.length > 0 ? [[0, value[0]]] : [] : Object.entries(value).slice(0, maxObjectProperties);
+  node.children = entries.map(
+    ([key, child]) => buildJSONPathNode(child, appendJSONPath(path, key), depth + 1, options)
+  );
+  return node;
+}
+function createLazyJSONPathTree(json, options = {}) {
+  const { maxChildren = DEFAULT_MAX_CHILDREN, parseEmbeddedJSON = true, keyPrefix = "" } = options;
+  const nodes = /* @__PURE__ */ new Map();
+  const decoded = /* @__PURE__ */ new Map();
+  function embedded(node2) {
+    if (!parseEmbeddedJSON || typeof node2.value !== "string") return void 0;
+    if (decoded.has(node2.key)) return decoded.get(node2.key);
+    const text = node2.value.trim();
+    let parsed = void 0;
+    if (text.startsWith("{") || text.startsWith("[")) {
+      try {
+        const candidate = JSON.parse(text);
+        if (jsonPathKind(candidate) !== "scalar") parsed = candidate;
+      } catch {
+        parsed = void 0;
+      }
+    }
+    decoded.set(node2.key, parsed);
+    return parsed;
+  }
+  function contents(node2) {
+    const inner = embedded(node2);
+    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;
+    return scope;
+  }
+  function node(value, path, key, root) {
+    const cached = nodes.get(key);
+    if (cached) return cached;
+    const created = {
+      key,
+      path,
+      value,
+      kind: jsonPathKind(value),
+      summary: summarizeJSON(value),
+      childCount: entryCount(value)
+    };
+    if (root !== void 0) created.root = root;
+    nodes.set(key, created);
+    return created;
+  }
+  function entriesOf(value) {
+    if (Array.isArray(value)) return value.map((entry, index) => [index, entry]);
+    if (value !== null && typeof value === "object") return Object.entries(value);
+    return [];
+  }
+  function materializeChildren(parent) {
+    if (parent.children) return parent.children;
+    const scope = contents(parent);
+    const entries = entriesOf(scope.value);
+    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);
+    });
+    if (limit < entries.length) {
+      children.push({
+        key: `${parent.key}>…`,
+        path: scope.path,
+        value: void 0,
+        kind: "more",
+        summary: `${entries.length - limit} more not shown — address them by index`,
+        childCount: entries.length - limit
+      });
+    }
+    parent.children = children;
+    return children;
+  }
+  function expandable(node2) {
+    if (node2.kind === "more") return false;
+    if (node2.kind !== "scalar") return node2.childCount > 0;
+    const inner = embedded(node2);
+    return inner !== void 0 && entryCount(inner) > 0;
+  }
+  const rootNode = node(json, "$", `${keyPrefix}$`, void 0);
+  return {
+    roots: json === void 0 ? [] : [rootNode],
+    getChildren: (node2) => node2.children,
+    hasMoreChildren: (node2) => node2.children === void 0 && expandable(node2),
+    loadChildren: (parent) => Promise.resolve(materializeChildren(parent)),
+    materializePath: (expression) => {
+      const segments = literalSegments(expression);
+      if (!segments) return void 0;
+      let current = rootNode;
+      for (const segment of segments) {
+        const target = appendJSONPath(contents(current).path, segment);
+        const next = materializeChildren(current).find((child) => child.path === target);
+        if (!next) return void 0;
+        current = next;
+      }
+      return current;
+    }
+  };
+}
+function sourceColumn(path) {
+  var _a;
+  return (_a = literalSegments(path)) == null ? void 0 : _a.slice(0, 1).map(String)[0];
+}
+function literalSegments(expression) {
+  let rest = expression.trim();
+  if (rest === "") return void 0;
+  if (!rest.startsWith("$")) return void 0;
+  rest = rest.slice(1);
+  const segments = [];
+  while (rest.length > 0) {
+    if (rest.startsWith("..")) return void 0;
+    if (rest.startsWith(".")) {
+      const match = /^\.([A-Za-z_$][A-Za-z0-9_$]*)/.exec(rest);
+      if (!match) return void 0;
+      segments.push(match[1]);
+      rest = rest.slice(match[0].length);
+      continue;
+    }
+    if (rest.startsWith("[")) {
+      const close = rest.indexOf("]");
+      if (close < 0) return void 0;
+      const inner = rest.slice(1, close).trim();
+      if (/^\d+$/.test(inner)) segments.push(Number(inner));
+      else if (/^"(?:[^"\\]|\\.)*"$/.test(inner)) segments.push(JSON.parse(inner));
+      else if (/^'[^']*'$/.test(inner)) segments.push(inner.slice(1, -1));
+      else return void 0;
+      rest = rest.slice(close + 1);
+      continue;
+    }
+    return void 0;
+  }
+  return segments;
+}
+export {
+  DEFAULT_MAX_CHILDREN,
+  DEFAULT_MAX_DEPTH,
+  DEFAULT_MAX_OBJECT_PROPERTIES,
+  appendJSONPath,
+  buildJSONPathNode,
+  createLazyJSONPathTree,
+  jsonPathKind,
+  literalSegments,
+  summarizeJSON
+};
+//# sourceMappingURL=jsonPathTree.js.map

package/dist/components/jsonPathTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"jsonPathTree.js","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;AAjRxD;AAkRE,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/secret-form-extension.cjs

@@ -0,0 +1,30 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const react = require("react");
+const SecretFormField = require("./SecretFormField.cjs");
+function createSecretFormExtensions(options) {
+  const post = (field, nodes, context) => {
+    const component = field.schema["x-clicky-component"];
+    if (component !== "k8s-secret-selector" && component !== "k8s-url-selector") {
+      return nodes;
+    }
+    return {
+      label: nodes.label,
+      value: react.createElement(SecretFormField.SecretFormField, {
+        ...options,
+        field,
+        namespace: namespaceFor(options, context),
+        allowWorkload: component === "k8s-url-selector"
+      })
+    };
+  };
+  return { post: [post] };
+}
+function namespaceFor(options, context) {
+  var _a;
+  if (options.getNamespace) return options.getNamespace(context == null ? void 0 : context.rootValue);
+  const namespace = (_a = context == null ? void 0 : context.rootValue) == null ? void 0 : _a.namespace;
+  return typeof namespace === "string" ? namespace : "";
+}
+exports.createSecretFormExtensions = createSecretFormExtensions;
+//# sourceMappingURL=secret-form-extension.cjs.map

package/dist/components/secret-form-extension.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"secret-form-extension.cjs","sources":["../../src/components/secret-form-extension.ts"],"sourcesContent":["import { createElement } from \"react\";\nimport { SecretFormField } from \"./SecretFormField\";\nimport type {\n  PostExtension,\n  PostExtensionContext,\n} from \"./json-schema-form-types\";\nimport type { OnePasswordLoaders } from \"./OnePasswordSelector.model\";\nimport type {\n  KeyPreview,\n  SecretKind,\n  SecretResource,\n  SecretValueSource,\n} from \"./SecretKeySelector\";\nimport type {\n  WorkloadKind,\n  WorkloadResource,\n} from \"./workload-picker-utils\";\n\nexport type SecretFormLoaders = {\n  loadResources: (\n    kind: SecretKind,\n    namespace: string,\n  ) => Promise<SecretResource[]>;\n  loadKeyPreview: (\n    kind: SecretKind,\n    name: string,\n    namespace: string,\n  ) => Promise<KeyPreview[]>;\n  loadServiceAccounts: (namespace: string) => Promise<SecretResource[]>;\n  loadOnePasswordVaults: OnePasswordLoaders[\"loadVaults\"];\n  loadOnePasswordItems: OnePasswordLoaders[\"loadItems\"];\n  loadOnePasswordFields: OnePasswordLoaders[\"loadFields\"];\n  loadWorkloads: (\n    namespace: string,\n    kinds: WorkloadKind[],\n  ) => Promise<Record<WorkloadKind, WorkloadResource[]>>;\n};\n\nexport type SecretFormExtensionOptions = {\n  loaders: SecretFormLoaders;\n  secretSources?: SecretValueSource[];\n  urlSources?: SecretValueSource[];\n  getNamespace?: (rootValue: Record<string, unknown> | undefined) => string;\n};\n\nexport function createSecretFormExtensions(\n  options: SecretFormExtensionOptions,\n): { post: PostExtension[] } {\n  const post: PostExtension = (field, nodes, context) => {\n    const component = field.schema[\"x-clicky-component\"];\n    if (\n      component !== \"k8s-secret-selector\" &&\n      component !== \"k8s-url-selector\"\n    ) {\n      return nodes;\n    }\n    return {\n      label: nodes.label,\n      value: createElement(SecretFormField, {\n        ...options,\n        field,\n        namespace: namespaceFor(options, context),\n        allowWorkload: component === \"k8s-url-selector\",\n      }),\n    };\n  };\n  return { post: [post] };\n}\n\nfunction namespaceFor(\n  options: SecretFormExtensionOptions,\n  context: PostExtensionContext | undefined,\n): string {\n  if (options.getNamespace) return options.getNamespace(context?.rootValue);\n  const namespace = context?.rootValue?.namespace;\n  return typeof namespace === \"string\" ? namespace : \"\";\n}\n"],"names":["createElement","SecretFormField"],"mappings":";;;;AA6CO,SAAS,2BACd,SAC2B;AAC3B,QAAM,OAAsB,CAAC,OAAO,OAAO,YAAY;AACrD,UAAM,YAAY,MAAM,OAAO,oBAAoB;AACnD,QACE,cAAc,yBACd,cAAc,oBACd;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,MACL,OAAO,MAAM;AAAA,MACb,OAAOA,MAAAA,cAAcC,iCAAiB;AAAA,QACpC,GAAG;AAAA,QACH;AAAA,QACA,WAAW,aAAa,SAAS,OAAO;AAAA,QACxC,eAAe,cAAc;AAAA,MAAA,CAC9B;AAAA,IAAA;AAAA,EAEL;AACA,SAAO,EAAE,MAAM,CAAC,IAAI,EAAA;AACtB;AAEA,SAAS,aACP,SACA,SACQ;;AACR,MAAI,QAAQ,aAAc,QAAO,QAAQ,aAAa,mCAAS,SAAS;AACxE,QAAM,aAAY,wCAAS,cAAT,mBAAoB;AACtC,SAAO,OAAO,cAAc,WAAW,YAAY;AACrD;;"}

package/dist/components/secret-form-extension.d.ts

@@ -0,0 +1,23 @@
+import { PostExtension } from './json-schema-form-types';
+import { OnePasswordLoaders } from './OnePasswordSelector.model';
+import { KeyPreview, SecretKind, SecretResource, SecretValueSource } from './SecretKeySelector';
+import { WorkloadKind, WorkloadResource } from './workload-picker-utils';
+export type SecretFormLoaders = {
+    loadResources: (kind: SecretKind, namespace: string) => Promise<SecretResource[]>;
+    loadKeyPreview: (kind: SecretKind, name: string, namespace: string) => Promise<KeyPreview[]>;
+    loadServiceAccounts: (namespace: string) => Promise<SecretResource[]>;
+    loadOnePasswordVaults: OnePasswordLoaders["loadVaults"];
+    loadOnePasswordItems: OnePasswordLoaders["loadItems"];
+    loadOnePasswordFields: OnePasswordLoaders["loadFields"];
+    loadWorkloads: (namespace: string, kinds: WorkloadKind[]) => Promise<Record<WorkloadKind, WorkloadResource[]>>;
+};
+export type SecretFormExtensionOptions = {
+    loaders: SecretFormLoaders;
+    secretSources?: SecretValueSource[];
+    urlSources?: SecretValueSource[];
+    getNamespace?: (rootValue: Record<string, unknown> | undefined) => string;
+};
+export declare function createSecretFormExtensions(options: SecretFormExtensionOptions): {
+    post: PostExtension[];
+};
+//# sourceMappingURL=secret-form-extension.d.ts.map

package/dist/components/secret-form-extension.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"secret-form-extension.d.ts","sourceRoot":"","sources":["../../src/components/secret-form-extension.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACV,aAAa,EAEd,MAAM,0BAA0B,CAAC;AAClC,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACtE,OAAO,KAAK,EACV,UAAU,EACV,UAAU,EACV,cAAc,EACd,iBAAiB,EAClB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,KAAK,EACV,YAAY,EACZ,gBAAgB,EACjB,MAAM,yBAAyB,CAAC;AAEjC,MAAM,MAAM,iBAAiB,GAAG;IAC9B,aAAa,EAAE,CACb,IAAI,EAAE,UAAU,EAChB,SAAS,EAAE,MAAM,KACd,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;IAC/B,cAAc,EAAE,CACd,IAAI,EAAE,UAAU,EAChB,IAAI,EAAE,MAAM,EACZ,SAAS,EAAE,MAAM,KACd,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;IAC3B,mBAAmB,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;IACtE,qBAAqB,EAAE,kBAAkB,CAAC,YAAY,CAAC,CAAC;IACxD,oBAAoB,EAAE,kBAAkB,CAAC,WAAW,CAAC,CAAC;IACtD,qBAAqB,EAAE,kBAAkB,CAAC,YAAY,CAAC,CAAC;IACxD,aAAa,EAAE,CACb,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,YAAY,EAAE,KAClB,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,gBAAgB,EAAE,CAAC,CAAC,CAAC;CACxD,CAAC;AAEF,MAAM,MAAM,0BAA0B,GAAG;IACvC,OAAO,EAAE,iBAAiB,CAAC;IAC3B,aAAa,CAAC,EAAE,iBAAiB,EAAE,CAAC;IACpC,UAAU,CAAC,EAAE,iBAAiB,EAAE,CAAC;IACjC,YAAY,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,KAAK,MAAM,CAAC;CAC3E,CAAC;AAEF,wBAAgB,0BAA0B,CACxC,OAAO,EAAE,0BAA0B,GAClC;IAAE,IAAI,EAAE,aAAa,EAAE,CAAA;CAAE,CAoB3B"}