synapse-react-client 4.0.38 → 4.0.41

package/dist/components/QueryBuilder/queryBuilderOperations.js

@@ -0,0 +1,203 @@
+import { newQBNodeId as e } from "./queryBuilderId.js";
+import { isQBGroup as t } from "./QueryBuilderTypes.js";
+//#region src/components/QueryBuilder/queryBuilderOperations.ts
+function n(e) {
+	if (e == null || e.endsWith("_LIST")) return "is_any_of";
+	switch (e) {
+		case "INTEGER":
+		case "DOUBLE":
+		case "DATE":
+		case "DATE_TIME": return "between";
+		case "BOOLEAN": return "equal";
+		case "STRING": return "contains";
+		default: return "is_any_of";
+	}
+}
+function r(t, r) {
+	return {
+		kind: "condition",
+		id: e(),
+		columnName: t,
+		columnType: r,
+		op: n(r),
+		values: [],
+		rangeMin: null,
+		rangeMax: null,
+		text: null
+	};
+}
+function i(t = "AND") {
+	return {
+		kind: "group",
+		id: e(),
+		combinator: t,
+		not: !1,
+		children: []
+	};
+}
+function a() {
+	return {
+		...i(),
+		children: [r(null, null)]
+	};
+}
+function o(e, t, n, i) {
+	return y(e, t, r(n, i));
+}
+function s(e, t) {
+	return y(e, t, i());
+}
+function c(e, t, n, r) {
+	return b(e, t, (e) => {
+		let t = T(e.children.length, n), i = [
+			...e.children.slice(0, t),
+			r,
+			...e.children.slice(t)
+		];
+		return {
+			...e,
+			children: i
+		};
+	});
+}
+function l(e, t) {
+	return b(e, t, (e) => ({
+		...e,
+		children: []
+	}));
+}
+function u(e, t, n) {
+	return x(e, t, (e) => e.kind === "condition" ? {
+		...e,
+		...n
+	} : e);
+}
+function d(e, t, n) {
+	return b(e, t, (e) => ({
+		...e,
+		...n
+	}));
+}
+function f(e, t) {
+	if (e.id === t) return e;
+	let n = S(e, t);
+	return n == null ? e : b(e, n.parentId, (e) => ({
+		...e,
+		children: e.children.filter((e) => e.id !== t)
+	}));
+}
+function p(e, t, n, r) {
+	if (t === e.id || t === n) return e;
+	let i = S(e, t);
+	if (i == null) return e;
+	let a = C(e, n);
+	if (a == null || i.node.kind === "group" && w(i.node, n)) return e;
+	let o = i.parentId === n, s = T(o ? a.children.length - 1 : a.children.length, r);
+	return o && s === i.index ? e : c(b(e, i.parentId, (e) => ({
+		...e,
+		children: e.children.filter((e) => e.id !== t)
+	})), n, s, i.node);
+}
+function m(e, t, n) {
+	return C(e, n) == null ? e : p(e, t, n, 0);
+}
+function h(e, n) {
+	let r = [], i = (e) => {
+		n(e) && r.push(e), t(e) && e.children.forEach(i);
+	};
+	return i(e), r;
+}
+function g(e) {
+	return h(e, (e) => e.kind === "condition").some((e) => _(e));
+}
+function _(e) {
+	if (e.columnName == null) return !1;
+	switch (e.op) {
+		case "has_value":
+		case "no_value": return !0;
+		case "is_any_of":
+		case "is_all_of":
+		case "equal":
+		case "not_equal": return e.values.length > 0;
+		case "between": return !v(e.rangeMin) && !v(e.rangeMax);
+		case "gt":
+		case "gte": return !v(e.rangeMin);
+		case "lt":
+		case "lte": return !v(e.rangeMax);
+		case "contains":
+		case "starts_with":
+		case "ends_with":
+		case "is_exactly": return !v(e.text);
+		default: return e.op, !1;
+	}
+}
+function v(e) {
+	return e == null || e === "";
+}
+function y(e, t, n) {
+	return b(e, t, (e) => ({
+		...e,
+		children: [n, ...e.children]
+	}));
+}
+function b(e, t, n) {
+	return x(e, t, (e) => e.kind === "group" ? n(e) : e);
+}
+function x(e, n, r) {
+	if (e.id === n) {
+		let n = r(e);
+		return t(n) ? n : e;
+	}
+	let i = !1, a = e.children.map((e) => {
+		if (e.id === n) {
+			let t = r(e);
+			return t !== e && (i = !0), t;
+		}
+		if (t(e)) {
+			let t = x(e, n, r);
+			return t !== e && (i = !0), t;
+		}
+		return e;
+	});
+	return i ? {
+		...e,
+		children: a
+	} : e;
+}
+function S(e, n) {
+	let r = (e) => {
+		for (let i = 0; i < e.children.length; i++) {
+			let a = e.children[i];
+			if (a.id === n) return {
+				node: a,
+				parentId: e.id,
+				index: i
+			};
+			if (t(a)) {
+				let e = r(a);
+				if (e) return e;
+			}
+		}
+		return null;
+	};
+	return r(e);
+}
+function C(e, n) {
+	if (e.id === n) return e;
+	for (let r of e.children) if (t(r)) {
+		let e = C(r, n);
+		if (e) return e;
+	}
+	return null;
+}
+function w(e, n) {
+	for (let r of e.children) if (r.id === n || t(r) && w(r, n)) return !0;
+	return !1;
+}
+function T(e, t) {
+	return !Number.isFinite(t) || t < 0 ? 0 : Math.min(e, Math.trunc(t));
+}
+//#endregion
+export { s as addChildGroup, o as addConditionToGroup, l as clearGroup, n as defaultOpForColumnType, a as defaultQBGroup, h as findNodes, g as hasCompleteCondition, c as insertNodeAt, p as moveNode, m as moveNodeIntoGroup, r as newBlankCondition, i as newEmptyGroup, f as removeNode, u as updateCondition, d as updateGroup };
+
+//# sourceMappingURL=queryBuilderOperations.js.map

package/dist/components/QueryBuilder/queryBuilderOperations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queryBuilderOperations.js","names":[],"sources":["../../../src/components/QueryBuilder/queryBuilderOperations.ts"],"sourcesContent":["import { newQBNodeId } from './queryBuilderId'\nimport {\n  isQBGroup,\n  QBCombinator,\n  QBCondition,\n  QBConditionOp,\n  QBGroup,\n  QBNode,\n} from './QueryBuilderTypes'\n\n// -----------------------------------------------------------------------------\n// Factories\n// -----------------------------------------------------------------------------\n\n/**\n * The initial `op` for a brand-new condition. When the user hasn't picked a\n * column yet the choice is arbitrary — the row's operator picker replaces it\n * as soon as the column is chosen — but we still need a valid discriminant\n * so the UI can render. `is_any_of` renders as a pill-based value input, which\n * degrades gracefully for a blank row.\n */\nexport function defaultOpForColumnType(\n  columnType: string | null,\n): QBConditionOp {\n  if (columnType == null) return 'is_any_of'\n  if (columnType.endsWith('_LIST')) return 'is_any_of'\n  switch (columnType) {\n    case 'INTEGER':\n    case 'DOUBLE':\n    case 'DATE':\n    case 'DATE_TIME':\n      return 'between'\n    case 'BOOLEAN':\n      return 'equal'\n    case 'STRING':\n      return 'contains'\n    default:\n      return 'is_any_of'\n  }\n}\n\nexport function newBlankCondition(\n  columnName: string | null,\n  columnType: string | null,\n): QBCondition {\n  return {\n    kind: 'condition',\n    id: newQBNodeId(),\n    columnName,\n    columnType,\n    op: defaultOpForColumnType(columnType),\n    values: [],\n    rangeMin: null,\n    rangeMax: null,\n    text: null,\n  }\n}\n\nexport function newEmptyGroup(combinator: QBCombinator = 'AND'): QBGroup {\n  return {\n    kind: 'group',\n    id: newQBNodeId(),\n    combinator,\n    not: false,\n    children: [],\n  }\n}\n\n/** Root group with a single blank condition — the QB's default startup state. */\nexport function defaultQBGroup(): QBGroup {\n  const root = newEmptyGroup()\n  return { ...root, children: [newBlankCondition(null, null)] }\n}\n\n// -----------------------------------------------------------------------------\n// Add / clear\n// -----------------------------------------------------------------------------\n\nexport function addConditionToGroup(\n  root: QBGroup,\n  targetGroupId: string,\n  columnName: string | null,\n  columnType: string | null,\n): QBGroup {\n  const condition = newBlankCondition(columnName, columnType)\n  return prependChild(root, targetGroupId, condition)\n}\n\nexport function addChildGroup(root: QBGroup, targetGroupId: string): QBGroup {\n  return prependChild(root, targetGroupId, newEmptyGroup())\n}\n\n/**\n * Insert `node` into the group identified by `targetGroupId` at\n * `targetIndex`. Semantics match `Array.prototype.splice(targetIndex, 0, node)`.\n * If the group can't be found, returns the tree unchanged.\n */\nexport function insertNodeAt(\n  root: QBGroup,\n  targetGroupId: string,\n  targetIndex: number,\n  node: QBNode,\n): QBGroup {\n  return mapGroup(root, targetGroupId, group => {\n    const clamped = clampInsertionIndex(group.children.length, targetIndex)\n    const nextChildren = [\n      ...group.children.slice(0, clamped),\n      node,\n      ...group.children.slice(clamped),\n    ]\n    return { ...group, children: nextChildren }\n  })\n}\n\n/**\n * Empty the children of the group identified by `nodeId`. If the id doesn't\n * match any group, returns the tree unchanged.\n */\nexport function clearGroup(root: QBGroup, nodeId: string): QBGroup {\n  return mapGroup(root, nodeId, group => ({ ...group, children: [] }))\n}\n\n// -----------------------------------------------------------------------------\n// Update\n// -----------------------------------------------------------------------------\n\nexport function updateCondition(\n  root: QBGroup,\n  nodeId: string,\n  patch: Partial<Omit<QBCondition, 'kind' | 'id'>>,\n): QBGroup {\n  return mapNode(root, nodeId, node =>\n    node.kind === 'condition' ? { ...node, ...patch } : node,\n  )\n}\n\nexport function updateGroup(\n  root: QBGroup,\n  nodeId: string,\n  patch: Partial<Omit<QBGroup, 'kind' | 'id' | 'children'>>,\n): QBGroup {\n  return mapGroup(root, nodeId, group => ({ ...group, ...patch }))\n}\n\n// -----------------------------------------------------------------------------\n// Remove\n// -----------------------------------------------------------------------------\n\n/**\n * Remove the node identified by `nodeId` from the tree. The root cannot be\n * removed — a request to remove the root returns the tree unchanged.\n */\nexport function removeNode(root: QBGroup, nodeId: string): QBGroup {\n  if (root.id === nodeId) return root\n  const location = findLocation(root, nodeId)\n  if (location == null) return root\n  return mapGroup(root, location.parentId, group => ({\n    ...group,\n    children: group.children.filter(child => child.id !== nodeId),\n  }))\n}\n\n// -----------------------------------------------------------------------------\n// Move (DnD)\n// -----------------------------------------------------------------------------\n\n/**\n * Move the node identified by `nodeId` to `targetIndex` of the group\n * identified by `targetGroupId`. `targetIndex` is the insertion index in the\n * target group's children *after* the node has been removed from its current\n * position — same semantics as `Array.prototype.splice(targetIndex, 0, node)`.\n *\n * Returns the tree unchanged if any of the following invariants would be\n * violated:\n * - `nodeId` is the root (root cannot be moved).\n * - `targetGroupId` is `nodeId` (a node can't be dropped into itself).\n * - `targetGroupId` is a descendant of `nodeId` (would create a cycle).\n * - The move is a no-op (target group + index equals current group + index).\n */\nexport function moveNode(\n  root: QBGroup,\n  nodeId: string,\n  targetGroupId: string,\n  targetIndex: number,\n): QBGroup {\n  if (nodeId === root.id) return root\n  if (nodeId === targetGroupId) return root\n\n  const source = findLocation(root, nodeId)\n  if (source == null) return root\n\n  const targetGroup = findGroup(root, targetGroupId)\n  if (targetGroup == null) return root\n\n  if (\n    source.node.kind === 'group' &&\n    containsDescendant(source.node, targetGroupId)\n  ) {\n    return root\n  }\n\n  const isSameParent = source.parentId === targetGroupId\n  const clampedTarget = clampInsertionIndex(\n    // When moving within the same parent, the effective target-array length\n    // after the node is removed is one shorter.\n    isSameParent\n      ? targetGroup.children.length - 1\n      : targetGroup.children.length,\n    targetIndex,\n  )\n  if (isSameParent && clampedTarget === source.index) return root\n\n  const withoutSource = mapGroup(root, source.parentId, group => ({\n    ...group,\n    children: group.children.filter(child => child.id !== nodeId),\n  }))\n  return insertNodeAt(withoutSource, targetGroupId, clampedTarget, source.node)\n}\n\n/**\n * Move the node identified by `nodeId` to the front of the group identified\n * by `groupId`.\n *\n * This is the operation behind drag-and-drop: only groups are drop targets,\n * so every drag resolves to \"put this node in that group\". The node always\n * lands first, matching where `addConditionToGroup` puts a new row — within\n * an AND/OR group the order carries no meaning, so there is nothing for a\n * drop position to express. Enforces the same invariants as `moveNode`, and\n * additionally returns the tree unchanged when `groupId` names something that\n * is not a group.\n */\nexport function moveNodeIntoGroup(\n  root: QBGroup,\n  nodeId: string,\n  groupId: string,\n): QBGroup {\n  if (findGroup(root, groupId) == null) return root\n  return moveNode(root, nodeId, groupId, 0)\n}\n\n// -----------------------------------------------------------------------------\n// Query helpers\n// -----------------------------------------------------------------------------\n\n/**\n * Find every node in the tree matching a predicate. Root is included.\n */\nexport function findNodes(\n  root: QBGroup,\n  predicate: (node: QBNode) => boolean,\n): QBNode[] {\n  const acc: QBNode[] = []\n  const visit = (node: QBNode) => {\n    if (predicate(node)) acc.push(node)\n    if (isQBGroup(node)) node.children.forEach(visit)\n  }\n  visit(root)\n  return acc\n}\n\n/**\n * Whether `root` (or any descendant) contains a condition with a resolvable,\n * complete filter — matches the design's \"at least one complete condition\"\n * requirement for `hasResettableFilters`.\n */\nexport function hasCompleteCondition(root: QBGroup): boolean {\n  return findNodes(root, node => node.kind === 'condition').some(condition =>\n    isConditionComplete(condition as QBCondition),\n  )\n}\n\nfunction isConditionComplete(condition: QBCondition): boolean {\n  if (condition.columnName == null) return false\n  switch (condition.op) {\n    case 'has_value':\n    case 'no_value':\n      return true\n    case 'is_any_of':\n    case 'is_all_of':\n    case 'equal':\n    case 'not_equal':\n      return condition.values.length > 0\n    case 'between':\n      return !isBlank(condition.rangeMin) && !isBlank(condition.rangeMax)\n    case 'gt':\n    case 'gte':\n      return !isBlank(condition.rangeMin)\n    case 'lt':\n    case 'lte':\n      return !isBlank(condition.rangeMax)\n    case 'contains':\n    case 'starts_with':\n    case 'ends_with':\n    case 'is_exactly':\n      return !isBlank(condition.text)\n    default:\n      condition.op satisfies never\n      return false\n  }\n}\n\nfunction isBlank(value: string | null | undefined): boolean {\n  return value == null || value === ''\n}\n\n// -----------------------------------------------------------------------------\n// Internal traversal helpers\n// -----------------------------------------------------------------------------\n\nfunction prependChild(root: QBGroup, groupId: string, node: QBNode): QBGroup {\n  return mapGroup(root, groupId, group => ({\n    ...group,\n    children: [node, ...group.children],\n  }))\n}\n\n/**\n * Replace the group identified by `targetId` with `transform(group)`. If the\n * id is not found, returns the tree unchanged (by reference).\n */\nfunction mapGroup(\n  root: QBGroup,\n  targetId: string,\n  transform: (group: QBGroup) => QBGroup,\n): QBGroup {\n  return mapNode(root, targetId, node =>\n    node.kind === 'group' ? transform(node) : node,\n  )\n}\n\n/**\n * Replace the node identified by `targetId` with `transform(node)`. If the id\n * matches root, the transformed root is returned. Structural sharing: only\n * the ancestor chain of the changed node is rebuilt; unaffected subtrees are\n * kept by reference.\n */\nfunction mapNode(\n  root: QBGroup,\n  targetId: string,\n  transform: (node: QBNode) => QBNode,\n): QBGroup {\n  if (root.id === targetId) {\n    const next = transform(root)\n    return isQBGroup(next) ? next : root\n  }\n  let changed = false\n  const nextChildren = root.children.map(child => {\n    if (child.id === targetId) {\n      const replaced = transform(child)\n      if (replaced !== child) changed = true\n      return replaced\n    }\n    if (isQBGroup(child)) {\n      const replaced = mapNode(child, targetId, transform)\n      if (replaced !== child) changed = true\n      return replaced\n    }\n    return child\n  })\n  return changed ? { ...root, children: nextChildren } : root\n}\n\ntype QBNodeLocation = {\n  node: QBNode\n  parentId: string\n  index: number\n}\n\nfunction findLocation(root: QBGroup, targetId: string): QBNodeLocation | null {\n  const visit = (group: QBGroup): QBNodeLocation | null => {\n    for (let index = 0; index < group.children.length; index++) {\n      const child = group.children[index]\n      if (child.id === targetId) {\n        return { node: child, parentId: group.id, index }\n      }\n      if (isQBGroup(child)) {\n        const nested = visit(child)\n        if (nested) return nested\n      }\n    }\n    return null\n  }\n  return visit(root)\n}\n\nfunction findGroup(root: QBGroup, targetId: string): QBGroup | null {\n  if (root.id === targetId) return root\n  for (const child of root.children) {\n    if (isQBGroup(child)) {\n      const nested = findGroup(child, targetId)\n      if (nested) return nested\n    }\n  }\n  return null\n}\n\nfunction containsDescendant(group: QBGroup, targetId: string): boolean {\n  for (const child of group.children) {\n    if (child.id === targetId) return true\n    if (isQBGroup(child) && containsDescendant(child, targetId)) return true\n  }\n  return false\n}\n\nfunction clampInsertionIndex(length: number, index: number): number {\n  if (!Number.isFinite(index) || index < 0) return 0\n  return Math.min(length, Math.trunc(index))\n}\n"],"mappings":";;;AAqBA,SAAgB,EACd,GACe;CAEf,IADI,KAAc,QACd,EAAW,SAAS,OAAO,GAAG,OAAO;CACzC,QAAQ,GAAR;EACE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,aACH,OAAO;EACT,KAAK,WACH,OAAO;EACT,KAAK,UACH,OAAO;EACT,SACE,OAAO;CACX;AACF;AAEA,SAAgB,EACd,GACA,GACa;CACb,OAAO;EACL,MAAM;EACN,IAAI,EAAY;EAChB;EACA;EACA,IAAI,EAAuB,CAAU;EACrC,QAAQ,CAAC;EACT,UAAU;EACV,UAAU;EACV,MAAM;CACR;AACF;AAEA,SAAgB,EAAc,IAA2B,OAAgB;CACvE,OAAO;EACL,MAAM;EACN,IAAI,EAAY;EAChB;EACA,KAAK;EACL,UAAU,CAAC;CACb;AACF;AAGA,SAAgB,IAA0B;CAExC,OAAO;EAAE,GADI,EACD;EAAM,UAAU,CAAC,EAAkB,MAAM,IAAI,CAAC;CAAE;AAC9D;AAMA,SAAgB,EACd,GACA,GACA,GACA,GACS;CAET,OAAO,EAAa,GAAM,GADR,EAAkB,GAAY,CACP,CAAS;AACpD;AAEA,SAAgB,EAAc,GAAe,GAAgC;CAC3E,OAAO,EAAa,GAAM,GAAe,EAAc,CAAC;AAC1D;AAOA,SAAgB,EACd,GACA,GACA,GACA,GACS;CACT,OAAO,EAAS,GAAM,IAAe,MAAS;EAC5C,IAAM,IAAU,EAAoB,EAAM,SAAS,QAAQ,CAAW,GAChE,IAAe;GACnB,GAAG,EAAM,SAAS,MAAM,GAAG,CAAO;GAClC;GACA,GAAG,EAAM,SAAS,MAAM,CAAO;EACjC;EACA,OAAO;GAAE,GAAG;GAAO,UAAU;EAAa;CAC5C,CAAC;AACH;AAMA,SAAgB,EAAW,GAAe,GAAyB;CACjE,OAAO,EAAS,GAAM,IAAQ,OAAU;EAAE,GAAG;EAAO,UAAU,CAAC;CAAE,EAAE;AACrE;AAMA,SAAgB,EACd,GACA,GACA,GACS;CACT,OAAO,EAAQ,GAAM,IAAQ,MAC3B,EAAK,SAAS,cAAc;EAAE,GAAG;EAAM,GAAG;CAAM,IAAI,CACtD;AACF;AAEA,SAAgB,EACd,GACA,GACA,GACS;CACT,OAAO,EAAS,GAAM,IAAQ,OAAU;EAAE,GAAG;EAAO,GAAG;CAAM,EAAE;AACjE;AAUA,SAAgB,EAAW,GAAe,GAAyB;CACjE,IAAI,EAAK,OAAO,GAAQ,OAAO;CAC/B,IAAM,IAAW,EAAa,GAAM,CAAM;CAE1C,OADI,KAAY,OAAa,IACtB,EAAS,GAAM,EAAS,WAAU,OAAU;EACjD,GAAG;EACH,UAAU,EAAM,SAAS,QAAO,MAAS,EAAM,OAAO,CAAM;CAC9D,EAAE;AACJ;AAmBA,SAAgB,EACd,GACA,GACA,GACA,GACS;CAET,IADI,MAAW,EAAK,MAChB,MAAW,GAAe,OAAO;CAErC,IAAM,IAAS,EAAa,GAAM,CAAM;CACxC,IAAI,KAAU,MAAM,OAAO;CAE3B,IAAM,IAAc,EAAU,GAAM,CAAa;CAGjD,IAFI,KAAe,QAGjB,EAAO,KAAK,SAAS,WACrB,EAAmB,EAAO,MAAM,CAAa,GAE7C,OAAO;CAGT,IAAM,IAAe,EAAO,aAAa,GACnC,IAAgB,EAGpB,IACI,EAAY,SAAS,SAAS,IAC9B,EAAY,SAAS,QACzB,CACF;CAOA,OANI,KAAgB,MAAkB,EAAO,QAAc,IAMpD,EAJe,EAAS,GAAM,EAAO,WAAU,OAAU;EAC9D,GAAG;EACH,UAAU,EAAM,SAAS,QAAO,MAAS,EAAM,OAAO,CAAM;CAC9D,EACoB,GAAe,GAAe,GAAe,EAAO,IAAI;AAC9E;AAcA,SAAgB,EACd,GACA,GACA,GACS;CAET,OADI,EAAU,GAAM,CAAO,KAAK,OAAa,IACtC,EAAS,GAAM,GAAQ,GAAS,CAAC;AAC1C;AASA,SAAgB,EACd,GACA,GACU;CACV,IAAM,IAAgB,CAAC,GACjB,KAAS,MAAiB;EAE9B,AADI,EAAU,CAAI,KAAG,EAAI,KAAK,CAAI,GAC9B,EAAU,CAAI,KAAG,EAAK,SAAS,QAAQ,CAAK;CAClD;CAEA,OADA,EAAM,CAAI,GACH;AACT;AAOA,SAAgB,EAAqB,GAAwB;CAC3D,OAAO,EAAU,IAAM,MAAQ,EAAK,SAAS,WAAW,EAAE,MAAK,MAC7D,EAAoB,CAAwB,CAC9C;AACF;AAEA,SAAS,EAAoB,GAAiC;CAC5D,IAAI,EAAU,cAAc,MAAM,OAAO;CACzC,QAAQ,EAAU,IAAlB;EACE,KAAK;EACL,KAAK,YACH,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,aACH,OAAO,EAAU,OAAO,SAAS;EACnC,KAAK,WACH,OAAO,CAAC,EAAQ,EAAU,QAAQ,KAAK,CAAC,EAAQ,EAAU,QAAQ;EACpE,KAAK;EACL,KAAK,OACH,OAAO,CAAC,EAAQ,EAAU,QAAQ;EACpC,KAAK;EACL,KAAK,OACH,OAAO,CAAC,EAAQ,EAAU,QAAQ;EACpC,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,cACH,OAAO,CAAC,EAAQ,EAAU,IAAI;EAChC,SAEE,OADA,EAAU,IACH;CACX;AACF;AAEA,SAAS,EAAQ,GAA2C;CAC1D,OAAO,KAAS,QAAQ,MAAU;AACpC;AAMA,SAAS,EAAa,GAAe,GAAiB,GAAuB;CAC3E,OAAO,EAAS,GAAM,IAAS,OAAU;EACvC,GAAG;EACH,UAAU,CAAC,GAAM,GAAG,EAAM,QAAQ;CACpC,EAAE;AACJ;AAMA,SAAS,EACP,GACA,GACA,GACS;CACT,OAAO,EAAQ,GAAM,IAAU,MAC7B,EAAK,SAAS,UAAU,EAAU,CAAI,IAAI,CAC5C;AACF;AAQA,SAAS,EACP,GACA,GACA,GACS;CACT,IAAI,EAAK,OAAO,GAAU;EACxB,IAAM,IAAO,EAAU,CAAI;EAC3B,OAAO,EAAU,CAAI,IAAI,IAAO;CAClC;CACA,IAAI,IAAU,IACR,IAAe,EAAK,SAAS,KAAI,MAAS;EAC9C,IAAI,EAAM,OAAO,GAAU;GACzB,IAAM,IAAW,EAAU,CAAK;GAEhC,OADI,MAAa,MAAO,IAAU,KAC3B;EACT;EACA,IAAI,EAAU,CAAK,GAAG;GACpB,IAAM,IAAW,EAAQ,GAAO,GAAU,CAAS;GAEnD,OADI,MAAa,MAAO,IAAU,KAC3B;EACT;EACA,OAAO;CACT,CAAC;CACD,OAAO,IAAU;EAAE,GAAG;EAAM,UAAU;CAAa,IAAI;AACzD;AAQA,SAAS,EAAa,GAAe,GAAyC;CAC5E,IAAM,KAAS,MAA0C;EACvD,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAM,SAAS,QAAQ,KAAS;GAC1D,IAAM,IAAQ,EAAM,SAAS;GAC7B,IAAI,EAAM,OAAO,GACf,OAAO;IAAE,MAAM;IAAO,UAAU,EAAM;IAAI;GAAM;GAElD,IAAI,EAAU,CAAK,GAAG;IACpB,IAAM,IAAS,EAAM,CAAK;IAC1B,IAAI,GAAQ,OAAO;GACrB;EACF;EACA,OAAO;CACT;CACA,OAAO,EAAM,CAAI;AACnB;AAEA,SAAS,EAAU,GAAe,GAAkC;CAClE,IAAI,EAAK,OAAO,GAAU,OAAO;CACjC,KAAK,IAAM,KAAS,EAAK,UACvB,IAAI,EAAU,CAAK,GAAG;EACpB,IAAM,IAAS,EAAU,GAAO,CAAQ;EACxC,IAAI,GAAQ,OAAO;CACrB;CAEF,OAAO;AACT;AAEA,SAAS,EAAmB,GAAgB,GAA2B;CACrE,KAAK,IAAM,KAAS,EAAM,UAExB,IADI,EAAM,OAAO,KACb,EAAU,CAAK,KAAK,EAAmB,GAAO,CAAQ,GAAG,OAAO;CAEtE,OAAO;AACT;AAEA,SAAS,EAAoB,GAAgB,GAAuB;CAElE,OADI,CAAC,OAAO,SAAS,CAAK,KAAK,IAAQ,IAAU,IAC1C,KAAK,IAAI,GAAQ,KAAK,MAAM,CAAK,CAAC;AAC3C"}

package/dist/components/QueryBuilder/queryBuilderTranslation.d.ts

@@ -1,4 +1,5 @@
-import { FacetColumnRequest, QueryFilter } from '@sage-bionetworks/synapse-types';
+import { ColumnModel, FacetColumnRequest, QueryFilter } from '@sage-bionetworks/synapse-types';
+import { ReadonlyDeep } from 'type-fest';
 import { QBGroup, QBNode } from './QueryBuilderTypes';
 /** A multi-value list column is one whose column type ends in `_LIST`. */
 export declare function isListColumn(columnType: string | null): boolean;
@@ -44,5 +45,5 @@ export declare function apiFilterToQBNode(filter: QueryFilter): QBNode | null;
  * (as an AND-combined, non-negated group). The reverse direction is not
  * generally possible; a QB → facets switch clears the tree.
  */
-export declare function selectedFacetsToQBGroup(selectedFacets: FacetColumnRequest[]): QBGroup;
+export declare function selectedFacetsToQBGroup(selectedFacets: ReadonlyDeep<FacetColumnRequest[]>, columnModels?: ReadonlyDeep<ColumnModel[]>): QBGroup;
 //# sourceMappingURL=queryBuilderTranslation.d.ts.map

package/dist/components/QueryBuilder/queryBuilderTranslation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"queryBuilderTranslation.d.ts","sourceRoot":"","sources":["../../../src/components/QueryBuilder/queryBuilderTranslation.ts"],"names":[],"mappings":"AAAA,OAAO,EAKL,kBAAkB,EAGlB,WAAW,EACZ,MAAM,iCAAiC,CAAA;AAQxC,OAAO,EAA0B,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAA;AAW7E,0EAA0E;AAC1E,wBAAgB,YAAY,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,GAAG,OAAO,CAE/D;AAMD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAEhD;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAElD;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,GAAG;IACpD,EAAE,EAAE,UAAU,GAAG,aAAa,GAAG,WAAW,GAAG,YAAY,CAAA;IAC3D,IAAI,EAAE,MAAM,CAAA;CACb,CAUA;AAMD;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI,CAelE;AAwLD;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,WAAW,GAAG,MAAM,GAAG,IAAI,CAgCpE;AA8DD;;;;GAIG;AACH,wBAAgB,uBAAuB,CACrC,cAAc,EAAE,kBAAkB,EAAE,GACnC,OAAO,CAUT"}
+{"version":3,"file":"queryBuilderTranslation.d.ts","sourceRoot":"","sources":["../../../src/components/QueryBuilder/queryBuilderTranslation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,WAAW,EAKX,kBAAkB,EAGlB,WAAW,EACZ,MAAM,iCAAiC,CAAA;AACxC,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAA;AAQxC,OAAO,EAA0B,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAA;AAY7E,0EAA0E;AAC1E,wBAAgB,YAAY,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,GAAG,OAAO,CAE/D;AAMD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAEhD;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAElD;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,GAAG;IACpD,EAAE,EAAE,UAAU,GAAG,aAAa,GAAG,WAAW,GAAG,YAAY,CAAA;IAC3D,IAAI,EAAE,MAAM,CAAA;CACb,CAUA;AAMD;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI,CAelE;AAwLD;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,WAAW,GAAG,MAAM,GAAG,IAAI,CAgCpE;AA8DD;;;;GAIG;AACH,wBAAgB,uBAAuB,CACrC,cAAc,EAAE,YAAY,CAAC,kBAAkB,EAAE,CAAC,EAClD,YAAY,CAAC,EAAE,YAAY,CAAC,WAAW,EAAE,CAAC,GACzC,OAAO,CAkBT"}

package/dist/components/QueryBuilder/queryBuilderTranslation.js

@@ -1,19 +1,20 @@
 import { isColumnMultiValueFunctionQueryFilter as e, isColumnSingleValueQueryFilter as t, isFacetColumnRangeRequest as n, isFacetColumnValuesRequest as r, isFilterGroup as i } from "../../utils/types/IsType.js";
-import { isQBGroup as a } from "./QueryBuilderTypes.js";
-import { ColumnMultiValueFunction as o, ColumnSingleValueFilterOperator as s, FILTER_GROUP_CONCRETE_TYPE_VALUE as c } from "@sage-bionetworks/synapse-types";
+import { newQBNodeId as a } from "./queryBuilderId.js";
+import { isQBGroup as o } from "./QueryBuilderTypes.js";
+import { ColumnMultiValueFunction as s, ColumnSingleValueFilterOperator as c, FILTER_GROUP_CONCRETE_TYPE_VALUE as l } from "@sage-bionetworks/synapse-types";
 //#region src/components/QueryBuilder/queryBuilderTranslation.ts
-var l = "org.sagebionetworks.repo.model.table.ColumnSingleValueQueryFilter", u = "org.sagebionetworks.repo.model.table.ColumnMultiValueFunctionQueryFilter";
-function d(e) {
+var u = "org.sagebionetworks.repo.model.table.ColumnSingleValueQueryFilter", d = "org.sagebionetworks.repo.model.table.ColumnMultiValueFunctionQueryFilter";
+function f(e) {
 	return e?.endsWith("_LIST") ?? !1;
 }
-function f(e) {
+function p(e) {
 	return e.replace(/[\\%_]/g, (e) => "\\" + e);
 }
-function p(e) {
+function m(e) {
 	return e.replace(/\\([\\%_])/g, "$1");
 }
-function m(e) {
-	let t = e.startsWith("%"), n = /(?<!\\)%$/.test(e), r = p(e.slice(+!!t, n ? -1 : void 0));
+function h(e) {
+	let t = e.startsWith("%"), n = /(?<!\\)%$/.test(e), r = m(e.slice(+!!t, n ? -1 : void 0));
 	return t && n ? {
 		op: "contains",
 		text: r
@@ -28,89 +29,89 @@ function m(e) {
 		text: r
 	};
 }
-function h(e) {
-	if (a(e)) {
-		let t = e.children.map(h).filter((e) => e !== null);
+function g(e) {
+	if (o(e)) {
+		let t = e.children.map(g).filter((e) => e !== null);
 		return t.length === 0 ? null : {
-			concreteType: c,
+			concreteType: l,
 			operator: e.combinator,
 			not: e.not || void 0,
 			children: t
 		};
 	}
-	return g(e);
+	return _(e);
 }
-function g(e) {
-	let { columnName: t, columnType: n, op: r, values: i, rangeMin: a, rangeMax: o, text: c } = e;
+function _(e) {
+	let { columnName: t, columnType: n, op: r, values: i, rangeMin: a, rangeMax: o, text: s } = e;
 	if (t === null) return null;
 	switch (r) {
-		case "is_any_of": return v(t, n, i);
-		case "is_all_of": return i.length === 0 ? null : C(t, i);
-		case "between": return y(t, a, o);
-		case "gt": return w(t, a, s.GREATER_THAN);
-		case "gte": return w(t, a, s.GREATER_THAN_OR_EQUAL);
-		case "lt": return w(t, o, s.LESS_THAN);
-		case "lte": return w(t, o, s.LESS_THAN_OR_EQUAL);
-		case "equal": return b(t, i, s.EQUAL);
-		case "not_equal": return b(t, i, s.NOT_EQUAL);
-		case "has_value": return S(t, s.IS_NOT_NULL, []);
-		case "no_value": return S(t, s.IS_NULL, []);
-		case "contains": return x(t, c, (e) => `%${e}%`);
-		case "starts_with": return x(t, c, (e) => `${e}%`);
-		case "ends_with": return x(t, c, (e) => `%${e}`);
-		case "is_exactly": return _(c) ? null : S(t, s.EQUAL, [c]);
+		case "is_any_of": return y(t, n, i);
+		case "is_all_of": return i.length === 0 ? null : w(t, i);
+		case "between": return b(t, a, o);
+		case "gt": return T(t, a, c.GREATER_THAN);
+		case "gte": return T(t, a, c.GREATER_THAN_OR_EQUAL);
+		case "lt": return T(t, o, c.LESS_THAN);
+		case "lte": return T(t, o, c.LESS_THAN_OR_EQUAL);
+		case "equal": return x(t, i, c.EQUAL);
+		case "not_equal": return x(t, i, c.NOT_EQUAL);
+		case "has_value": return C(t, c.IS_NOT_NULL, []);
+		case "no_value": return C(t, c.IS_NULL, []);
+		case "contains": return S(t, s, (e) => `%${e}%`);
+		case "starts_with": return S(t, s, (e) => `${e}%`);
+		case "ends_with": return S(t, s, (e) => `%${e}`);
+		case "is_exactly": return v(s) ? null : C(t, c.EQUAL, [s]);
 		default: return console.warn(`conditionToApiFilter: unrecognized QB op, skipping condition for column "${t}"`, { op: r }), null;
 	}
 }
-function _(e) {
+function v(e) {
 	return e == null || e === "";
 }
-function v(e, t, n) {
-	return n.length === 0 ? null : d(t) ? C(e, n) : S(e, s.IN, n);
-}
 function y(e, t, n) {
-	return _(t) || _(n) ? null : S(e, s.BETWEEN, [t, n]);
+	return n.length === 0 ? null : f(t) ? w(e, n) : C(e, c.IN, n);
 }
 function b(e, t, n) {
-	return t.length === 0 ? null : S(e, n, [t[0]]);
+	return v(t) || v(n) ? null : C(e, c.BETWEEN, [t, n]);
 }
 function x(e, t, n) {
-	return _(t) ? null : S(e, s.LIKE, [n(f(t))]);
+	return t.length === 0 ? null : C(e, n, [t[0]]);
 }
 function S(e, t, n) {
+	return v(t) ? null : C(e, c.LIKE, [n(p(t))]);
+}
+function C(e, t, n) {
 	return {
-		concreteType: l,
+		concreteType: u,
 		columnName: e,
 		operator: t,
 		values: n
 	};
 }
-function C(e, t) {
+function w(e, t) {
 	return {
-		concreteType: u,
+		concreteType: d,
 		columnName: e,
-		function: o.HAS,
-		_function: o.HAS,
+		function: s.HAS,
+		_function: s.HAS,
 		values: t
 	};
 }
-function w(e, t, n) {
-	return t == null || t === "" ? null : S(e, n, [t]);
+function T(e, t, n) {
+	return t == null || t === "" ? null : C(e, n, [t]);
 }
-function T(n) {
+function E(n) {
 	if (i(n)) {
-		let e = (n.children ?? []).map(T).filter((e) => e !== null);
+		let e = (n.children ?? []).map(E).filter((e) => e !== null);
 		return {
 			kind: "group",
-			id: A(),
+			id: a(),
 			combinator: n.operator ?? "AND",
 			not: n.not ?? !1,
 			children: e
 		};
 	}
-	return t(n) ? E(n) : e(n) ? {
+	return t(n) ? D(n) : e(n) ? {
 		kind: "condition",
-		id: A(),
+		id: a(),
 		columnName: n.columnName,
 		columnType: null,
 		op: "is_any_of",
@@ -120,10 +121,10 @@ function T(n) {
 		text: null
 	} : null;
 }
-function E(e) {
+function D(e) {
 	let t = {
 		kind: "condition",
-		id: A(),
+		id: a(),
 		columnName: e.columnName,
 		columnType: null,
 		values: [],
@@ -132,57 +133,57 @@ function E(e) {
 		text: null
 	}, [n] = e.values;
 	switch (e.operator) {
-		case s.IN: return {
+		case c.IN: return {
 			...t,
 			op: "is_any_of",
 			values: [...e.values]
 		};
-		case s.EQUAL: return {
+		case c.EQUAL: return {
 			...t,
 			op: "equal",
 			values: [...e.values]
 		};
-		case s.NOT_EQUAL: return {
+		case c.NOT_EQUAL: return {
 			...t,
 			op: "not_equal",
 			values: [...e.values]
 		};
-		case s.GREATER_THAN: return {
+		case c.GREATER_THAN: return {
 			...t,
 			op: "gt",
 			rangeMin: n ?? null
 		};
-		case s.GREATER_THAN_OR_EQUAL: return {
+		case c.GREATER_THAN_OR_EQUAL: return {
 			...t,
 			op: "gte",
 			rangeMin: n ?? null
 		};
-		case s.LESS_THAN: return {
+		case c.LESS_THAN: return {
 			...t,
 			op: "lt",
 			rangeMax: n ?? null
 		};
-		case s.LESS_THAN_OR_EQUAL: return {
+		case c.LESS_THAN_OR_EQUAL: return {
 			...t,
 			op: "lte",
 			rangeMax: n ?? null
 		};
-		case s.BETWEEN: return {
+		case c.BETWEEN: return {
 			...t,
 			op: "between",
 			rangeMin: e.values[0] ?? null,
 			rangeMax: e.values[1] ?? null
 		};
-		case s.IS_NULL: return {
+		case c.IS_NULL: return {
 			...t,
 			op: "no_value"
 		};
-		case s.IS_NOT_NULL: return {
+		case c.IS_NOT_NULL: return {
 			...t,
 			op: "has_value"
 		};
-		case s.LIKE: {
-			let e = m(n ?? "");
+		case c.LIKE: {
+			let e = h(n ?? "");
 			return {
 				...t,
 				op: e.op,
@@ -195,21 +196,22 @@ function E(e) {
 		};
 	}
 }
-function D(e) {
+function O(e, t) {
+	let n = new Map((t ?? []).map((e) => [e.name, e.columnType]));
 	return {
 		kind: "group",
-		id: A(),
+		id: a(),
 		combinator: "AND",
 		not: !1,
-		children: e.map(O).filter((e) => e !== null)
+		children: e.map((e) => k(e, n.get(e.columnName) ?? null)).filter((e) => e !== null)
 	};
 }
-function O(e) {
+function k(e, t) {
 	if (r(e)) return !e.facetValues || e.facetValues.length === 0 ? null : {
 		kind: "condition",
-		id: A(),
+		id: a(),
 		columnName: e.columnName,
-		columnType: null,
+		columnType: t,
 		op: "is_any_of",
 		values: [...e.facetValues],
 		rangeMin: null,
@@ -217,28 +219,28 @@ function O(e) {
 		text: null
 	};
 	if (n(e)) {
-		let t = e.min != null && e.min !== "", n = e.max != null && e.max !== "";
-		if (!t && !n) return null;
-		let r = {
+		let n = e.min != null && e.min !== "", r = e.max != null && e.max !== "";
+		if (!n && !r) return null;
+		let i = {
 			kind: "condition",
-			id: A(),
+			id: a(),
 			columnName: e.columnName,
-			columnType: null,
+			columnType: t,
 			values: [],
 			text: null
 		};
-		return t && n ? {
-			...r,
+		return n && r ? {
+			...i,
 			op: "between",
 			rangeMin: e.min,
 			rangeMax: e.max
-		} : t ? {
-			...r,
+		} : n ? {
+			...i,
 			op: "gte",
 			rangeMin: e.min,
 			rangeMax: null
 		} : {
-			...r,
+			...i,
 			op: "lte",
 			rangeMin: null,
 			rangeMax: e.max
@@ -246,11 +248,7 @@ function O(e) {
 	}
 	return null;
 }
-var k = 0;
-function A() {
-	return typeof crypto < "u" && typeof crypto.randomUUID == "function" ? crypto.randomUUID() : (k += 1, `qb-${k}`);
-}
 //#endregion
-export { T as apiFilterToQBNode, m as classifyLikePattern, f as escapeLike, d as isListColumn, h as qbNodeToApiFilter, D as selectedFacetsToQBGroup, p as unescapeLike };
+export { E as apiFilterToQBNode, h as classifyLikePattern, p as escapeLike, f as isListColumn, g as qbNodeToApiFilter, O as selectedFacetsToQBGroup, m as unescapeLike };
 
 //# sourceMappingURL=queryBuilderTranslation.js.map