synapse-react-client 4.0.38 → 4.0.40

package/dist/components/QueryBuilder/queryBuilderMetadata.js

@@ -0,0 +1,91 @@
+import { FRIENDLY_VALUE_NOT_SET as e } from "../../utils/SynapseConstants.js";
+//#region src/components/QueryBuilder/queryBuilderMetadata.ts
+function t(e, t) {
+	if (e?.endsWith("_LIST")) return "list";
+	if (t) return "enum";
+	if (e == null) return "unknown";
+	switch (e) {
+		case "BOOLEAN": return "boolean";
+		case "INTEGER":
+		case "DOUBLE":
+		case "DATE":
+		case "DATE_TIME": return "range";
+		case "STRING":
+		case "LARGETEXT":
+		case "LINK":
+		case "MEDIUMTEXT":
+		case "USERID":
+		case "ENTITYID":
+		case "EVALUATIONID":
+		case "SUBMISSIONID": return "text";
+		default: return "text";
+	}
+}
+function n(e) {
+	switch (e) {
+		case "enum": return [
+			"is_any_of",
+			"has_value",
+			"no_value"
+		];
+		case "list": return [
+			"is_any_of",
+			"is_all_of",
+			"has_value",
+			"no_value"
+		];
+		case "range": return [
+			"between",
+			"gt",
+			"gte",
+			"lt",
+			"lte",
+			"equal",
+			"not_equal",
+			"has_value",
+			"no_value"
+		];
+		case "boolean": return [
+			"equal",
+			"has_value",
+			"no_value"
+		];
+		case "text": return [
+			"contains",
+			"starts_with",
+			"ends_with",
+			"is_exactly",
+			"has_value",
+			"no_value"
+		];
+		case "unknown": return [];
+		default: return [];
+	}
+}
+function r(e) {
+	switch (e) {
+		case "is_any_of": return "is any of";
+		case "is_all_of": return "is all of";
+		case "between": return "between";
+		case "gt": return ">";
+		case "gte": return "≥";
+		case "lt": return "<";
+		case "lte": return "≤";
+		case "equal": return "equals";
+		case "not_equal": return "does not equal";
+		case "has_value": return "has value";
+		case "no_value": return "has no value";
+		case "contains": return "contains";
+		case "starts_with": return "starts with";
+		case "ends_with": return "ends with";
+		case "is_exactly": return "is exactly";
+		default: return e;
+	}
+}
+function i(t) {
+	return t === "org.sagebionetworks.UNDEFINED_NULL_NOTSET" ? e : t;
+}
+//#endregion
+export { n as availableOpsForKind, t as classifyColumn, i as labelForFacetValue, r as labelForOp };
+
+//# sourceMappingURL=queryBuilderMetadata.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"queryBuilderMetadata.js","names":[],"sources":["../../../src/components/QueryBuilder/queryBuilderMetadata.ts"],"sourcesContent":["/**\n * Column-kind classification and operator availability per kind. The QB uses\n * this both to populate the operator picker dropdown and to decide what shape\n * of value input to render.\n */\nimport {\n  FRIENDLY_VALUE_NOT_SET,\n  VALUE_NOT_SET,\n} from '../../utils/SynapseConstants'\nimport { QBConditionOp } from './QueryBuilderTypes'\n\n/** Categorization of columns for the QB UI. Not a synapse-types concept. */\nexport type QBColumnKind =\n  | 'enum'\n  | 'list'\n  | 'range'\n  | 'boolean'\n  | 'text'\n  | 'unknown'\n\n/**\n * Classify a column into a QB kind based on its `ColumnTypeEnum` string and\n * whether the column has a facet in the query result. `hasFacet` distinguishes\n * a faceted single-value column (`enum`) from a plain single-value column\n * (`text`).\n */\nexport function classifyColumn(\n  columnType: string | null,\n  hasFacet: boolean,\n): QBColumnKind {\n  // `_LIST` columns keep the `list` kind so `is_all_of` remains available.\n  if (columnType?.endsWith('_LIST')) return 'list'\n  // Any faceted column becomes an enum picker regardless of the raw column\n  // type (even when the type is unknown, e.g. when the QB tree was hydrated\n  // from `selectedFacets` without column-model context).\n  if (hasFacet) return 'enum'\n  if (columnType == null) return 'unknown'\n  switch (columnType) {\n    case 'BOOLEAN':\n      return 'boolean'\n    case 'INTEGER':\n    case 'DOUBLE':\n    case 'DATE':\n    case 'DATE_TIME':\n      return 'range'\n    case 'STRING':\n    case 'LARGETEXT':\n    case 'LINK':\n    case 'MEDIUMTEXT':\n    case 'USERID':\n    case 'ENTITYID':\n    case 'EVALUATIONID':\n    case 'SUBMISSIONID':\n      return 'text'\n    default:\n      return 'text'\n  }\n}\n\n/**\n * Ordered list of operators offered for a given column kind. Order controls\n * the operator picker dropdown ordering.\n */\nexport function availableOpsForKind(kind: QBColumnKind): QBConditionOp[] {\n  switch (kind) {\n    case 'enum':\n      return ['is_any_of', 'has_value', 'no_value']\n    case 'list':\n      return ['is_any_of', 'is_all_of', 'has_value', 'no_value']\n    case 'range':\n      return [\n        'between',\n        'gt',\n        'gte',\n        'lt',\n        'lte',\n        'equal',\n        'not_equal',\n        'has_value',\n        'no_value',\n      ]\n    case 'boolean':\n      return ['equal', 'has_value', 'no_value']\n    case 'text':\n      return [\n        'contains',\n        'starts_with',\n        'ends_with',\n        'is_exactly',\n        'has_value',\n        'no_value',\n      ]\n    case 'unknown':\n      // No column picked yet; offer nothing until one is selected.\n      return []\n    default:\n      kind satisfies never\n      return []\n  }\n}\n\n/** Human-readable label for an operator, shown in the operator picker. */\nexport function labelForOp(op: QBConditionOp): string {\n  switch (op) {\n    case 'is_any_of':\n      return 'is any of'\n    case 'is_all_of':\n      return 'is all of'\n    case 'between':\n      return 'between'\n    case 'gt':\n      return '>'\n    case 'gte':\n      return '≥'\n    case 'lt':\n      return '<'\n    case 'lte':\n      return '≤'\n    case 'equal':\n      return 'equals'\n    case 'not_equal':\n      return 'does not equal'\n    case 'has_value':\n      return 'has value'\n    case 'no_value':\n      return 'has no value'\n    case 'contains':\n      return 'contains'\n    case 'starts_with':\n      return 'starts with'\n    case 'ends_with':\n      return 'ends with'\n    case 'is_exactly':\n      return 'is exactly'\n    default:\n      op satisfies never\n      return op\n  }\n}\n\n/**\n * Returns the user-facing label for a raw facet value. Backend sentinels like\n * `VALUE_NOT_SET` display as `Not Assigned`; every other value renders as-is.\n * The underlying value stored on the QB condition is unchanged.\n */\nexport function labelForFacetValue(value: string): string {\n  return value === VALUE_NOT_SET ? FRIENDLY_VALUE_NOT_SET : value\n}\n"],"mappings":";;AA0BA,SAAgB,EACd,GACA,GACc;CAEd,IAAI,GAAY,SAAS,OAAO,GAAG,OAAO;CAI1C,IAAI,GAAU,OAAO;CACrB,IAAI,KAAc,MAAM,OAAO;CAC/B,QAAQ,GAAR;EACE,KAAK,WACH,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,aACH,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,gBACH,OAAO;EACT,SACE,OAAO;CACX;AACF;AAMA,SAAgB,EAAoB,GAAqC;CACvE,QAAQ,GAAR;EACE,KAAK,QACH,OAAO;GAAC;GAAa;GAAa;EAAU;EAC9C,KAAK,QACH,OAAO;GAAC;GAAa;GAAa;GAAa;EAAU;EAC3D,KAAK,SACH,OAAO;GACL;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EACF;EACF,KAAK,WACH,OAAO;GAAC;GAAS;GAAa;EAAU;EAC1C,KAAK,QACH,OAAO;GACL;GACA;GACA;GACA;GACA;GACA;EACF;EACF,KAAK,WAEH,OAAO,CAAC;EACV,SAEE,OAAO,CAAC;CACZ;AACF;AAGA,SAAgB,EAAW,GAA2B;CACpD,QAAQ,GAAR;EACE,KAAK,aACH,OAAO;EACT,KAAK,aACH,OAAO;EACT,KAAK,WACH,OAAO;EACT,KAAK,MACH,OAAO;EACT,KAAK,OACH,OAAO;EACT,KAAK,MACH,OAAO;EACT,KAAK,OACH,OAAO;EACT,KAAK,SACH,OAAO;EACT,KAAK,aACH,OAAO;EACT,KAAK,aACH,OAAO;EACT,KAAK,YACH,OAAO;EACT,KAAK,YACH,OAAO;EACT,KAAK,eACH,OAAO;EACT,KAAK,aACH,OAAO;EACT,KAAK,cACH,OAAO;EACT,SAEE,OAAO;CACX;AACF;AAOA,SAAgB,EAAmB,GAAuB;CACxD,OAAO,MAAA,8CAA0B,IAAyB;AAC5D"}

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

@@ -0,0 +1,58 @@
+import { QBCombinator, QBCondition, QBConditionOp, QBGroup, QBNode } from './QueryBuilderTypes';
+/**
+ * The initial `op` for a brand-new condition. When the user hasn't picked a
+ * column yet the choice is arbitrary — the row's operator picker replaces it
+ * as soon as the column is chosen — but we still need a valid discriminant
+ * so the UI can render. `is_any_of` renders as a pill-based value input, which
+ * degrades gracefully for a blank row.
+ */
+export declare function defaultOpForColumnType(columnType: string | null): QBConditionOp;
+export declare function newBlankCondition(columnName: string | null, columnType: string | null): QBCondition;
+export declare function newEmptyGroup(combinator?: QBCombinator): QBGroup;
+/** Root group with a single blank condition — the QB's default startup state. */
+export declare function defaultQBGroup(): QBGroup;
+export declare function addConditionToGroup(root: QBGroup, targetGroupId: string, columnName: string | null, columnType: string | null): QBGroup;
+export declare function addChildGroup(root: QBGroup, targetGroupId: string): QBGroup;
+/**
+ * Insert `node` into the group identified by `targetGroupId` at
+ * `targetIndex`. Semantics match `Array.prototype.splice(targetIndex, 0, node)`.
+ * If the group can't be found, returns the tree unchanged.
+ */
+export declare function insertNodeAt(root: QBGroup, targetGroupId: string, targetIndex: number, node: QBNode): QBGroup;
+/**
+ * Empty the children of the group identified by `nodeId`. If the id doesn't
+ * match any group, returns the tree unchanged.
+ */
+export declare function clearGroup(root: QBGroup, nodeId: string): QBGroup;
+export declare function updateCondition(root: QBGroup, nodeId: string, patch: Partial<Omit<QBCondition, 'kind' | 'id'>>): QBGroup;
+export declare function updateGroup(root: QBGroup, nodeId: string, patch: Partial<Omit<QBGroup, 'kind' | 'id' | 'children'>>): QBGroup;
+/**
+ * Remove the node identified by `nodeId` from the tree. The root cannot be
+ * removed — a request to remove the root returns the tree unchanged.
+ */
+export declare function removeNode(root: QBGroup, nodeId: string): QBGroup;
+/**
+ * Move the node identified by `nodeId` to `targetIndex` of the group
+ * identified by `targetGroupId`. `targetIndex` is the insertion index in the
+ * target group's children *after* the node has been removed from its current
+ * position — same semantics as `Array.prototype.splice(targetIndex, 0, node)`.
+ *
+ * Returns the tree unchanged if any of the following invariants would be
+ * violated:
+ * - `nodeId` is the root (root cannot be moved).
+ * - `targetGroupId` is `nodeId` (a node can't be dropped into itself).
+ * - `targetGroupId` is a descendant of `nodeId` (would create a cycle).
+ * - The move is a no-op (target group + index equals current group + index).
+ */
+export declare function moveNode(root: QBGroup, nodeId: string, targetGroupId: string, targetIndex: number): QBGroup;
+/**
+ * Find every node in the tree matching a predicate. Root is included.
+ */
+export declare function findNodes(root: QBGroup, predicate: (node: QBNode) => boolean): QBNode[];
+/**
+ * Whether `root` (or any descendant) contains a condition with a resolvable,
+ * complete filter — matches the design's "at least one complete condition"
+ * requirement for `hasResettableFilters`.
+ */
+export declare function hasCompleteCondition(root: QBGroup): boolean;
+//# sourceMappingURL=queryBuilderOperations.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"queryBuilderOperations.d.ts","sourceRoot":"","sources":["../../../src/components/QueryBuilder/queryBuilderOperations.ts"],"names":[],"mappings":"AACA,OAAO,EAEL,YAAY,EACZ,WAAW,EACX,aAAa,EACb,OAAO,EACP,MAAM,EACP,MAAM,qBAAqB,CAAA;AAM5B;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CACpC,UAAU,EAAE,MAAM,GAAG,IAAI,GACxB,aAAa,CAgBf;AAED,wBAAgB,iBAAiB,CAC/B,UAAU,EAAE,MAAM,GAAG,IAAI,EACzB,UAAU,EAAE,MAAM,GAAG,IAAI,GACxB,WAAW,CAYb;AAED,wBAAgB,aAAa,CAAC,UAAU,GAAE,YAAoB,GAAG,OAAO,CAQvE;AAED,iFAAiF;AACjF,wBAAgB,cAAc,IAAI,OAAO,CAGxC;AAMD,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,OAAO,EACb,aAAa,EAAE,MAAM,EACrB,UAAU,EAAE,MAAM,GAAG,IAAI,EACzB,UAAU,EAAE,MAAM,GAAG,IAAI,GACxB,OAAO,CAGT;AAED,wBAAgB,aAAa,CAAC,IAAI,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,GAAG,OAAO,CAE3E;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAC1B,IAAI,EAAE,OAAO,EACb,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,EACnB,IAAI,EAAE,MAAM,GACX,OAAO,CAUT;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAEjE;AAMD,wBAAgB,eAAe,CAC7B,IAAI,EAAE,OAAO,EACb,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,GAC/C,OAAO,CAIT;AAED,wBAAgB,WAAW,CACzB,IAAI,EAAE,OAAO,EACb,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,GAAG,UAAU,CAAC,CAAC,GACxD,OAAO,CAET;AAMD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAQjE;AAMD;;;;;;;;;;;;GAYG;AACH,wBAAgB,QAAQ,CACtB,IAAI,EAAE,OAAO,EACb,MAAM,EAAE,MAAM,EACd,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,GAClB,OAAO,CAiCT;AAMD;;GAEG;AACH,wBAAgB,SAAS,CACvB,IAAI,EAAE,OAAO,EACb,SAAS,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,GACnC,MAAM,EAAE,CAQV;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,OAAO,GAAG,OAAO,CAI3D"}

package/dist/components/QueryBuilder/queryBuilderOperations.js

@@ -0,0 +1,200 @@
+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 v(e, t, r(n, i));
+}
+function s(e, t) {
+	return v(e, t, i());
+}
+function c(e, t, n, r) {
+	return y(e, t, (e) => {
+		let t = w(e.children.length, n), i = [
+			...e.children.slice(0, t),
+			r,
+			...e.children.slice(t)
+		];
+		return {
+			...e,
+			children: i
+		};
+	});
+}
+function l(e, t) {
+	return y(e, t, (e) => ({
+		...e,
+		children: []
+	}));
+}
+function u(e, t, n) {
+	return b(e, t, (e) => e.kind === "condition" ? {
+		...e,
+		...n
+	} : e);
+}
+function d(e, t, n) {
+	return y(e, t, (e) => ({
+		...e,
+		...n
+	}));
+}
+function f(e, t) {
+	if (e.id === t) return e;
+	let n = x(e, t);
+	return n == null ? e : y(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 = x(e, t);
+	if (i == null) return e;
+	let a = S(e, n);
+	if (a == null || i.node.kind === "group" && C(i.node, n)) return e;
+	let o = i.parentId === n, s = w(o ? a.children.length - 1 : a.children.length, r);
+	return o && s === i.index ? e : c(y(e, i.parentId, (e) => ({
+		...e,
+		children: e.children.filter((e) => e.id !== t)
+	})), n, s, i.node);
+}
+function m(e, n) {
+	let r = [], i = (e) => {
+		n(e) && r.push(e), t(e) && e.children.forEach(i);
+	};
+	return i(e), r;
+}
+function h(e) {
+	return m(e, (e) => e.kind === "condition").some((e) => g(e));
+}
+function g(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 !_(e.rangeMin) && !_(e.rangeMax);
+		case "gt":
+		case "gte": return !_(e.rangeMin);
+		case "lt":
+		case "lte": return !_(e.rangeMax);
+		case "contains":
+		case "starts_with":
+		case "ends_with":
+		case "is_exactly": return !_(e.text);
+		default: return e.op, !1;
+	}
+}
+function _(e) {
+	return e == null || e === "";
+}
+function v(e, t, n) {
+	return y(e, t, (e) => ({
+		...e,
+		children: [n, ...e.children]
+	}));
+}
+function y(e, t, n) {
+	return b(e, t, (e) => e.kind === "group" ? n(e) : e);
+}
+function b(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 = b(e, n, r);
+			return t !== e && (i = !0), t;
+		}
+		return e;
+	});
+	return i ? {
+		...e,
+		children: a
+	} : e;
+}
+function x(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 S(e, n) {
+	if (e.id === n) return e;
+	for (let r of e.children) if (t(r)) {
+		let e = S(r, n);
+		if (e) return e;
+	}
+	return null;
+}
+function C(e, n) {
+	for (let r of e.children) if (r.id === n || t(r) && C(r, n)) return !0;
+	return !1;
+}
+function w(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, m as findNodes, h as hasCompleteCondition, c as insertNodeAt, p as moveNode, 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// 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;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"}