@platforma-sdk/model 1.58.5 → 1.58.9

package/dist/filters/distill.d.ts

@@ -1,8 +1,11 @@
-import { RootFilterSpec, type FilterSpec, type FilterSpecLeaf } from "@milaboratories/pl-model-common";
-import { InferFilterSpecLeaf } from "@milaboratories/pl-model-common";
+import { FilterSpec, FilterSpecLeaf, InferFilterSpecLeaf, RootFilterSpec } from "@milaboratories/pl-model-common";
+
+//#region src/filters/distill.d.ts
 /**
  * Strips non-FilterSpec metadata (whitelist approach) and removes
  * unfilled leaves (type is undefined or any required field is undefined).
  */
-export declare function distillFilterSpec<FS extends FilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>, R extends FS extends RootFilterSpec<FilterSpecLeaf<unknown>, unknown, unknown> ? RootFilterSpec<InferFilterSpecLeaf<FS>> : FilterSpec<InferFilterSpecLeaf<FS>>>(filter: null | undefined | FS): null | R;
+declare function distillFilterSpec<FS extends FilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>, R extends (FS extends RootFilterSpec<FilterSpecLeaf<unknown>, unknown, unknown> ? RootFilterSpec<InferFilterSpecLeaf<FS>> : FilterSpec<InferFilterSpecLeaf<FS>>)>(filter: null | undefined | FS): null | R;
+//#endregion
+export { distillFilterSpec };
 //# sourceMappingURL=distill.d.ts.map

package/dist/filters/distill.js

@@ -1,69 +1,69 @@
-import { traverseFilterSpec } from './traverse.js';
-import { isEmpty } from 'es-toolkit/compat';
+import { traverseFilterSpec } from "./traverse.js";
+import { isEmpty } from "es-toolkit/compat";
 
-/** Compile-time check: every key in the tuple is a valid leaf key (via satisfies). */
-const KNOWN_LEAF_KEYS_TUPLE = [
-    "n",
-    "x",
-    "rhs",
-    "type",
-    "value",
-    "column",
-    "minDiff",
-    "maxEdits",
-    "wildcard",
-    "replacement",
-    "substitutionsOnly",
-];
-const KNOWN_LEAF_KEYS = new Set(KNOWN_LEAF_KEYS_TUPLE);
+//#region src/filters/distill.ts
+const KNOWN_LEAF_KEYS = new Set([
+	"n",
+	"x",
+	"rhs",
+	"type",
+	"value",
+	"column",
+	"minDiff",
+	"maxEdits",
+	"wildcard",
+	"replacement",
+	"substitutionsOnly"
+]);
 /** Returns true if the leaf is filled — type is defined and no required fields are undefined. */
 function isFilledLeaf(node) {
-    if (node.type == null)
-        return false;
-    return !Object.values(node).some((value) => {
-        switch (typeof value) {
-            case "number":
-            case "boolean":
-                return false;
-            case "string":
-                return value.trim() === "";
-            default: // undefined, null, empty objects/arrays
-                return isEmpty(value);
-        }
-    });
+	if (node.type == null) return false;
+	return !Object.values(node).some((value) => {
+		switch (typeof value) {
+			case "number":
+			case "boolean": return false;
+			case "string": return value.trim() === "";
+			default: return isEmpty(value);
+		}
+	});
 }
 function distillLeaf(node) {
-    const result = {};
-    for (const [key, value] of Object.entries(node)) {
-        if (KNOWN_LEAF_KEYS.has(key)) {
-            result[key] = value;
-        }
-    }
-    return result;
+	const result = {};
+	for (const [key, value] of Object.entries(node)) if (KNOWN_LEAF_KEYS.has(key)) result[key] = value;
+	return result;
 }
 /**
- * Strips non-FilterSpec metadata (whitelist approach) and removes
- * unfilled leaves (type is undefined or any required field is undefined).
- */
+* Strips non-FilterSpec metadata (whitelist approach) and removes
+* unfilled leaves (type is undefined or any required field is undefined).
+*/
 function distillFilterSpec(filter) {
-    if (filter == null)
-        return null;
-    return traverseFilterSpec(filter, {
-        leaf: (leaf) => {
-            const distilled = distillLeaf(leaf);
-            return isFilledLeaf(distilled) ? distilled : null;
-        },
-        and: (results) => {
-            const filtered = results.filter((f) => f !== null);
-            return filtered.length === 0 ? null : { type: "and", filters: filtered };
-        },
-        or: (results) => {
-            const filtered = results.filter((f) => f !== null);
-            return filtered.length === 0 ? null : { type: "or", filters: filtered };
-        },
-        not: (result) => (result === null ? null : { type: "not", filter: result }),
-    });
+	if (filter == null) return null;
+	return traverseFilterSpec(filter, {
+		leaf: (leaf) => {
+			const distilled = distillLeaf(leaf);
+			return isFilledLeaf(distilled) ? distilled : null;
+		},
+		and: (results) => {
+			const filtered = results.filter((f) => f !== null);
+			return filtered.length === 0 ? null : {
+				type: "and",
+				filters: filtered
+			};
+		},
+		or: (results) => {
+			const filtered = results.filter((f) => f !== null);
+			return filtered.length === 0 ? null : {
+				type: "or",
+				filters: filtered
+			};
+		},
+		not: (result) => result === null ? null : {
+			type: "not",
+			filter: result
+		}
+	});
 }
 
+//#endregion
 export { distillFilterSpec };
-//# sourceMappingURL=distill.js.map
+//# sourceMappingURL=distill.js.map

package/dist/filters/distill.js.map

@@ -1 +1 @@
-{"version":3,"file":"distill.js","sources":["../../src/filters/distill.ts"],"sourcesContent":["import { DistributiveKeys, UnionToTuples } from \"@milaboratories/helpers\";\nimport {\n  RootFilterSpec,\n  type FilterSpec,\n  type FilterSpecLeaf,\n} from \"@milaboratories/pl-model-common\";\nimport { traverseFilterSpec } from \"./traverse\";\nimport { InferFilterSpecLeaf } from \"@milaboratories/pl-model-common\";\nimport { isEmpty } from \"es-toolkit/compat\";\n\n/** All possible field names that can appear in any FilterSpecLeaf variant. */\ntype FilterSpecLeafKey = DistributiveKeys<FilterSpecLeaf<string>>;\n\n/** Compile-time check: every key in the tuple is a valid leaf key (via satisfies). */\nconst KNOWN_LEAF_KEYS_TUPLE: UnionToTuples<FilterSpecLeafKey> = [\n  \"n\",\n  \"x\",\n  \"rhs\",\n  \"type\",\n  \"value\",\n  \"column\",\n  \"minDiff\",\n  \"maxEdits\",\n  \"wildcard\",\n  \"replacement\",\n  \"substitutionsOnly\",\n];\nconst KNOWN_LEAF_KEYS: Set<FilterSpecLeafKey> = new Set(KNOWN_LEAF_KEYS_TUPLE);\n\n/** Returns true if the leaf is filled — type is defined and no required fields are undefined. */\nfunction isFilledLeaf<T>(node: FilterSpecLeaf<T>): boolean {\n  if (node.type == null) return false;\n  return !Object.values(node).some((value) => {\n    switch (typeof value) {\n      case \"number\":\n      case \"boolean\":\n        return false;\n      case \"string\":\n        return value.trim() === \"\";\n      default: // undefined, null, empty objects/arrays\n        return isEmpty(value);\n    }\n  });\n}\n\nfunction distillLeaf<T>(node: FilterSpecLeaf<T>): FilterSpecLeaf<T> {\n  const result: Record<string, unknown> = {};\n  for (const [key, value] of Object.entries(node)) {\n    if (KNOWN_LEAF_KEYS.has(key as FilterSpecLeafKey)) {\n      result[key] = value;\n    }\n  }\n  return result as FilterSpecLeaf<T>;\n}\n\n/**\n * Strips non-FilterSpec metadata (whitelist approach) and removes\n * unfilled leaves (type is undefined or any required field is undefined).\n */\nexport function distillFilterSpec<\n  FS extends FilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>,\n  R extends FS extends RootFilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>\n    ? RootFilterSpec<InferFilterSpecLeaf<FS>>\n    : FilterSpec<InferFilterSpecLeaf<FS>>,\n>(filter: null | undefined | FS): null | R {\n  if (filter == null) return null;\n  return traverseFilterSpec<FS, null | R>(filter, {\n    leaf: (leaf) => {\n      const distilled = distillLeaf(leaf);\n      return isFilledLeaf(distilled) ? (distilled as R) : null;\n    },\n    and: (results) => {\n      const filtered = results.filter((f): f is NonNullable<typeof f> => f !== null);\n      return filtered.length === 0 ? null : ({ type: \"and\", filters: filtered } as R);\n    },\n    or: (results) => {\n      const filtered = results.filter((f): f is NonNullable<typeof f> => f !== null);\n      return filtered.length === 0 ? null : ({ type: \"or\", filters: filtered } as R);\n    },\n    not: (result) => (result === null ? null : ({ type: \"not\", filter: result } as R)),\n  });\n}\n"],"names":[],"mappings":";;;AAaA;AACA,MAAM,qBAAqB,GAAqC;IAC9D,GAAG;IACH,GAAG;IACH,KAAK;IACL,MAAM;IACN,OAAO;IACP,QAAQ;IACR,SAAS;IACT,UAAU;IACV,UAAU;IACV,aAAa;IACb,mBAAmB;CACpB;AACD,MAAM,eAAe,GAA2B,IAAI,GAAG,CAAC,qBAAqB,CAAC;AAE9E;AACA,SAAS,YAAY,CAAI,IAAuB,EAAA;AAC9C,IAAA,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI;AAAE,QAAA,OAAO,KAAK;AACnC,IAAA,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,KAAI;QACzC,QAAQ,OAAO,KAAK;AAClB,YAAA,KAAK,QAAQ;AACb,YAAA,KAAK,SAAS;AACZ,gBAAA,OAAO,KAAK;AACd,YAAA,KAAK,QAAQ;AACX,gBAAA,OAAO,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE;AAC5B,YAAA;AACE,gBAAA,OAAO,OAAO,CAAC,KAAK,CAAC;;AAE3B,IAAA,CAAC,CAAC;AACJ;AAEA,SAAS,WAAW,CAAI,IAAuB,EAAA;IAC7C,MAAM,MAAM,GAA4B,EAAE;AAC1C,IAAA,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;AAC/C,QAAA,IAAI,eAAe,CAAC,GAAG,CAAC,GAAwB,CAAC,EAAE;AACjD,YAAA,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK;QACrB;IACF;AACA,IAAA,OAAO,MAA2B;AACpC;AAEA;;;AAGG;AACG,SAAU,iBAAiB,CAK/B,MAA6B,EAAA;IAC7B,IAAI,MAAM,IAAI,IAAI;AAAE,QAAA,OAAO,IAAI;IAC/B,OAAO,kBAAkB,CAAe,MAAM,EAAE;AAC9C,QAAA,IAAI,EAAE,CAAC,IAAI,KAAI;AACb,YAAA,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC;AACnC,YAAA,OAAO,YAAY,CAAC,SAAS,CAAC,GAAI,SAAe,GAAG,IAAI;QAC1D,CAAC;AACD,QAAA,GAAG,EAAE,CAAC,OAAO,KAAI;AACf,YAAA,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAiC,CAAC,KAAK,IAAI,CAAC;YAC9E,OAAO,QAAQ,CAAC,MAAM,KAAK,CAAC,GAAG,IAAI,GAAI,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAQ;QACjF,CAAC;AACD,QAAA,EAAE,EAAE,CAAC,OAAO,KAAI;AACd,YAAA,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAiC,CAAC,KAAK,IAAI,CAAC;YAC9E,OAAO,QAAQ,CAAC,MAAM,KAAK,CAAC,GAAG,IAAI,GAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAQ;QAChF,CAAC;QACD,GAAG,EAAE,CAAC,MAAM,MAAM,MAAM,KAAK,IAAI,GAAG,IAAI,GAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAQ,CAAC;AACnF,KAAA,CAAC;AACJ;;;;"}
+{"version":3,"file":"distill.js","names":[],"sources":["../../src/filters/distill.ts"],"sourcesContent":["import { DistributiveKeys, UnionToTuples } from \"@milaboratories/helpers\";\nimport {\n  RootFilterSpec,\n  type FilterSpec,\n  type FilterSpecLeaf,\n} from \"@milaboratories/pl-model-common\";\nimport { traverseFilterSpec } from \"./traverse\";\nimport { InferFilterSpecLeaf } from \"@milaboratories/pl-model-common\";\nimport { isEmpty } from \"es-toolkit/compat\";\n\n/** All possible field names that can appear in any FilterSpecLeaf variant. */\ntype FilterSpecLeafKey = DistributiveKeys<FilterSpecLeaf<string>>;\n\n/** Compile-time check: every key in the tuple is a valid leaf key (via satisfies). */\nconst KNOWN_LEAF_KEYS_TUPLE: UnionToTuples<FilterSpecLeafKey> = [\n  \"n\",\n  \"x\",\n  \"rhs\",\n  \"type\",\n  \"value\",\n  \"column\",\n  \"minDiff\",\n  \"maxEdits\",\n  \"wildcard\",\n  \"replacement\",\n  \"substitutionsOnly\",\n];\nconst KNOWN_LEAF_KEYS: Set<FilterSpecLeafKey> = new Set(KNOWN_LEAF_KEYS_TUPLE);\n\n/** Returns true if the leaf is filled — type is defined and no required fields are undefined. */\nfunction isFilledLeaf<T>(node: FilterSpecLeaf<T>): boolean {\n  if (node.type == null) return false;\n  return !Object.values(node).some((value) => {\n    switch (typeof value) {\n      case \"number\":\n      case \"boolean\":\n        return false;\n      case \"string\":\n        return value.trim() === \"\";\n      default: // undefined, null, empty objects/arrays\n        return isEmpty(value);\n    }\n  });\n}\n\nfunction distillLeaf<T>(node: FilterSpecLeaf<T>): FilterSpecLeaf<T> {\n  const result: Record<string, unknown> = {};\n  for (const [key, value] of Object.entries(node)) {\n    if (KNOWN_LEAF_KEYS.has(key as FilterSpecLeafKey)) {\n      result[key] = value;\n    }\n  }\n  return result as FilterSpecLeaf<T>;\n}\n\n/**\n * Strips non-FilterSpec metadata (whitelist approach) and removes\n * unfilled leaves (type is undefined or any required field is undefined).\n */\nexport function distillFilterSpec<\n  FS extends FilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>,\n  R extends FS extends RootFilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>\n    ? RootFilterSpec<InferFilterSpecLeaf<FS>>\n    : FilterSpec<InferFilterSpecLeaf<FS>>,\n>(filter: null | undefined | FS): null | R {\n  if (filter == null) return null;\n  return traverseFilterSpec<FS, null | R>(filter, {\n    leaf: (leaf) => {\n      const distilled = distillLeaf(leaf);\n      return isFilledLeaf(distilled) ? (distilled as R) : null;\n    },\n    and: (results) => {\n      const filtered = results.filter((f): f is NonNullable<typeof f> => f !== null);\n      return filtered.length === 0 ? null : ({ type: \"and\", filters: filtered } as R);\n    },\n    or: (results) => {\n      const filtered = results.filter((f): f is NonNullable<typeof f> => f !== null);\n      return filtered.length === 0 ? null : ({ type: \"or\", filters: filtered } as R);\n    },\n    not: (result) => (result === null ? null : ({ type: \"not\", filter: result } as R)),\n  });\n}\n"],"mappings":";;;;AA2BA,MAAM,kBAA0C,IAAI,IAbY;CAC9D;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD,CAC6E;;AAG9E,SAAS,aAAgB,MAAkC;AACzD,KAAI,KAAK,QAAQ,KAAM,QAAO;AAC9B,QAAO,CAAC,OAAO,OAAO,KAAK,CAAC,MAAM,UAAU;AAC1C,UAAQ,OAAO,OAAf;GACE,KAAK;GACL,KAAK,UACH,QAAO;GACT,KAAK,SACH,QAAO,MAAM,MAAM,KAAK;GAC1B,QACE,QAAO,QAAQ,MAAM;;GAEzB;;AAGJ,SAAS,YAAe,MAA4C;CAClE,MAAM,SAAkC,EAAE;AAC1C,MAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,CAC7C,KAAI,gBAAgB,IAAI,IAAyB,CAC/C,QAAO,OAAO;AAGlB,QAAO;;;;;;AAOT,SAAgB,kBAKd,QAAyC;AACzC,KAAI,UAAU,KAAM,QAAO;AAC3B,QAAO,mBAAiC,QAAQ;EAC9C,OAAO,SAAS;GACd,MAAM,YAAY,YAAY,KAAK;AACnC,UAAO,aAAa,UAAU,GAAI,YAAkB;;EAEtD,MAAM,YAAY;GAChB,MAAM,WAAW,QAAQ,QAAQ,MAAkC,MAAM,KAAK;AAC9E,UAAO,SAAS,WAAW,IAAI,OAAQ;IAAE,MAAM;IAAO,SAAS;IAAU;;EAE3E,KAAK,YAAY;GACf,MAAM,WAAW,QAAQ,QAAQ,MAAkC,MAAM,KAAK;AAC9E,UAAO,SAAS,WAAW,IAAI,OAAQ;IAAE,MAAM;IAAM,SAAS;IAAU;;EAE1E,MAAM,WAAY,WAAW,OAAO,OAAQ;GAAE,MAAM;GAAO,QAAQ;GAAQ;EAC5E,CAAC"}

package/dist/filters/index.cjs

@@ -0,0 +1,4 @@
+const require_filterToQuery = require('./converters/filterToQuery.cjs');
+const require_filterUiToExpressionImpl = require('./converters/filterUiToExpressionImpl.cjs');
+require('./converters/index.cjs');
+const require_distill = require('./distill.cjs');

package/dist/filters/index.d.ts

@@ -1,4 +1,5 @@
-export * from "./converters";
-export * from "./distill";
-export * from "./types";
-//# sourceMappingURL=index.d.ts.map
+import { filterSpecToSpecQueryExpr } from "./converters/filterToQuery.js";
+import { FilterSpec, FilterSpecLeaf, FilterSpecNode, FilterSpecOfType, FilterSpecType, SimplifiedPColumnSpec, SimplifiedUniversalPColumnEntry } from "./types.js";
+import { convertFilterUiToExpressionImpl, convertFilterUiToExpressions } from "./converters/filterUiToExpressionImpl.js";
+import "./converters/index.js";
+import { distillFilterSpec } from "./distill.js";

package/dist/filters/index.js

@@ -0,0 +1,4 @@
+import { filterSpecToSpecQueryExpr } from "./converters/filterToQuery.js";
+import { convertFilterUiToExpressionImpl, convertFilterUiToExpressions } from "./converters/filterUiToExpressionImpl.js";
+import "./converters/index.js";
+import { distillFilterSpec } from "./distill.js";

package/dist/filters/traverse.cjs

@@ -1,53 +1,44 @@
-'use strict';
 
+//#region src/filters/traverse.ts
 /**
- * Recursively traverses a FilterSpec tree bottom-up, applying visitor callbacks.
- *
- * Entries with `{ type: undefined }` inside `and`/`or` arrays are skipped
- * (these represent unfilled filter slots in the UI).
- *
- * Traversal order:
- * 1. Recurse into child filters (`and`/`or`/`not`)
- * 2. Apply the corresponding visitor callback with already-traversed children
- * 3. For leaf nodes, call `leaf` directly
- */
+* Recursively traverses a FilterSpec tree bottom-up, applying visitor callbacks.
+*
+* Entries with `{ type: undefined }` inside `and`/`or` arrays are skipped
+* (these represent unfilled filter slots in the UI).
+*
+* Traversal order:
+* 1. Recurse into child filters (`and`/`or`/`not`)
+* 2. Apply the corresponding visitor callback with already-traversed children
+* 3. For leaf nodes, call `leaf` directly
+*/
 function traverseFilterSpec(filter, visitor) {
-    return traverseFilterSpecImpl(filter, visitor);
+	return traverseFilterSpecImpl(filter, visitor);
 }
 /** Internal implementation with simple generics for clean recursion. */
 function traverseFilterSpecImpl(filter, visitor) {
-    switch (filter.type) {
-        case "and":
-            return visitor.and(filter.filters
-                .filter((f) => f.type !== undefined)
-                .map((f) => traverseFilterSpecImpl(f, visitor)));
-        case "or":
-            return visitor.or(filter.filters
-                .filter((f) => f.type !== undefined)
-                .map((f) => traverseFilterSpecImpl(f, visitor)));
-        case "not":
-            return visitor.not(traverseFilterSpecImpl(filter.filter, visitor));
-        default:
-            return visitor.leaf(filter);
-    }
+	switch (filter.type) {
+		case "and": return visitor.and(filter.filters.filter((f) => f.type !== void 0).map((f) => traverseFilterSpecImpl(f, visitor)));
+		case "or": return visitor.or(filter.filters.filter((f) => f.type !== void 0).map((f) => traverseFilterSpecImpl(f, visitor)));
+		case "not": return visitor.not(traverseFilterSpecImpl(filter.filter, visitor));
+		default: return visitor.leaf(filter);
+	}
 }
 /** Collects all column references (`column` and `rhs` fields) from filter leaves. */
 function collectFilterSpecColumns(filter) {
-    return traverseFilterSpec(filter, {
-        leaf: (leaf) => {
-            const cols = [];
-            if ("column" in leaf && leaf.column !== undefined)
-                cols.push(leaf.column);
-            if ("rhs" in leaf && leaf.rhs !== undefined)
-                cols.push(leaf.rhs);
-            return cols;
-        },
-        and: (results) => results.flat(),
-        or: (results) => results.flat(),
-        not: (result) => result,
-    });
+	return traverseFilterSpec(filter, {
+		leaf: (leaf) => {
+			const cols = [];
+			if ("column" in leaf && leaf.column !== void 0) cols.push(leaf.column);
+			if ("rhs" in leaf && leaf.rhs !== void 0) cols.push(leaf.rhs);
+			return cols;
+		},
+		and: (results) => results.flat(),
+		or: (results) => results.flat(),
+		not: (result) => result
+	});
 }
 
+//#endregion
 exports.collectFilterSpecColumns = collectFilterSpecColumns;
 exports.traverseFilterSpec = traverseFilterSpec;
-//# sourceMappingURL=traverse.cjs.map
+//# sourceMappingURL=traverse.cjs.map

package/dist/filters/traverse.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"traverse.cjs","sources":["../../src/filters/traverse.ts"],"sourcesContent":["import type {\n  FilterSpec,\n  FilterSpecLeaf,\n  FilterSpecNode,\n  InferFilterSpecLeafColumn,\n} from \"@milaboratories/pl-model-common\";\nimport type {\n  InferFilterSpecCommonLeaf,\n  InferFilterSpecLeaf,\n} from \"@milaboratories/pl-model-common\";\n\nexport type FilterSpecVisitor<LeafArg, R> = {\n  /** Handle a leaf filter node. */\n  leaf: (leaf: LeafArg) => R;\n  /** Handle an AND node after children have been traversed. */\n  and: (results: R[]) => R;\n  /** Handle an OR node after children have been traversed. */\n  or: (results: R[]) => R;\n  /** Handle a NOT node after the inner filter has been traversed. */\n  not: (result: R) => R;\n};\n\n/**\n * Recursively traverses a FilterSpec tree bottom-up, applying visitor callbacks.\n *\n * Entries with `{ type: undefined }` inside `and`/`or` arrays are skipped\n * (these represent unfilled filter slots in the UI).\n *\n * Traversal order:\n * 1. Recurse into child filters (`and`/`or`/`not`)\n * 2. Apply the corresponding visitor callback with already-traversed children\n * 3. For leaf nodes, call `leaf` directly\n */\nexport function traverseFilterSpec<\n  F extends FilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>,\n  R,\n>(\n  filter: F,\n  visitor: FilterSpecVisitor<InferFilterSpecCommonLeaf<F> & InferFilterSpecLeaf<F>, R>,\n): R {\n  return traverseFilterSpecImpl(filter, visitor as FilterSpecVisitor<unknown, R>);\n}\n/** Internal implementation with simple generics for clean recursion. */\nfunction traverseFilterSpecImpl<R>(\n  filter: FilterSpecNode<FilterSpecLeaf<unknown>, unknown, unknown>,\n  visitor: FilterSpecVisitor<unknown, R>,\n): R {\n  switch (filter.type) {\n    case \"and\":\n      return visitor.and(\n        filter.filters\n          .filter((f) => f.type !== undefined)\n          .map((f) => traverseFilterSpecImpl(f, visitor)),\n      );\n    case \"or\":\n      return visitor.or(\n        filter.filters\n          .filter((f) => f.type !== undefined)\n          .map((f) => traverseFilterSpecImpl(f, visitor)),\n      );\n    case \"not\":\n      return visitor.not(traverseFilterSpecImpl(filter.filter, visitor));\n    default:\n      return visitor.leaf(filter);\n  }\n}\n\n/** Collects all column references (`column` and `rhs` fields) from filter leaves. */\nexport function collectFilterSpecColumns<\n  F extends FilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>,\n  R extends InferFilterSpecLeafColumn<F> = InferFilterSpecLeafColumn<F>,\n>(filter: F): R[] {\n  return traverseFilterSpec(filter, {\n    leaf: (leaf) => {\n      const cols: R[] = [];\n      if (\"column\" in leaf && leaf.column !== undefined) cols.push(leaf.column as R);\n      if (\"rhs\" in leaf && leaf.rhs !== undefined) cols.push(leaf.rhs as R);\n      return cols;\n    },\n    and: (results) => results.flat(),\n    or: (results) => results.flat(),\n    not: (result) => result,\n  });\n}\n"],"names":[],"mappings":";;AAsBA;;;;;;;;;;AAUG;AACG,SAAU,kBAAkB,CAIhC,MAAS,EACT,OAAoF,EAAA;AAEpF,IAAA,OAAO,sBAAsB,CAAC,MAAM,EAAE,OAAwC,CAAC;AACjF;AACA;AACA,SAAS,sBAAsB,CAC7B,MAAiE,EACjE,OAAsC,EAAA;AAEtC,IAAA,QAAQ,MAAM,CAAC,IAAI;AACjB,QAAA,KAAK,KAAK;AACR,YAAA,OAAO,OAAO,CAAC,GAAG,CAChB,MAAM,CAAC;iBACJ,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,SAAS;AAClC,iBAAA,GAAG,CAAC,CAAC,CAAC,KAAK,sBAAsB,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAClD;AACH,QAAA,KAAK,IAAI;AACP,YAAA,OAAO,OAAO,CAAC,EAAE,CACf,MAAM,CAAC;iBACJ,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,SAAS;AAClC,iBAAA,GAAG,CAAC,CAAC,CAAC,KAAK,sBAAsB,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAClD;AACH,QAAA,KAAK,KAAK;AACR,YAAA,OAAO,OAAO,CAAC,GAAG,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AACpE,QAAA;AACE,YAAA,OAAO,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;;AAEjC;AAEA;AACM,SAAU,wBAAwB,CAGtC,MAAS,EAAA;IACT,OAAO,kBAAkB,CAAC,MAAM,EAAE;AAChC,QAAA,IAAI,EAAE,CAAC,IAAI,KAAI;YACb,MAAM,IAAI,GAAQ,EAAE;YACpB,IAAI,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;AAAE,gBAAA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAW,CAAC;YAC9E,IAAI,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS;AAAE,gBAAA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAQ,CAAC;AACrE,YAAA,OAAO,IAAI;QACb,CAAC;QACD,GAAG,EAAE,CAAC,OAAO,KAAK,OAAO,CAAC,IAAI,EAAE;QAChC,EAAE,EAAE,CAAC,OAAO,KAAK,OAAO,CAAC,IAAI,EAAE;AAC/B,QAAA,GAAG,EAAE,CAAC,MAAM,KAAK,MAAM;AACxB,KAAA,CAAC;AACJ;;;;;"}
+{"version":3,"file":"traverse.cjs","names":[],"sources":["../../src/filters/traverse.ts"],"sourcesContent":["import type {\n  FilterSpec,\n  FilterSpecLeaf,\n  FilterSpecNode,\n  InferFilterSpecLeafColumn,\n} from \"@milaboratories/pl-model-common\";\nimport type {\n  InferFilterSpecCommonLeaf,\n  InferFilterSpecLeaf,\n} from \"@milaboratories/pl-model-common\";\n\nexport type FilterSpecVisitor<LeafArg, R> = {\n  /** Handle a leaf filter node. */\n  leaf: (leaf: LeafArg) => R;\n  /** Handle an AND node after children have been traversed. */\n  and: (results: R[]) => R;\n  /** Handle an OR node after children have been traversed. */\n  or: (results: R[]) => R;\n  /** Handle a NOT node after the inner filter has been traversed. */\n  not: (result: R) => R;\n};\n\n/**\n * Recursively traverses a FilterSpec tree bottom-up, applying visitor callbacks.\n *\n * Entries with `{ type: undefined }` inside `and`/`or` arrays are skipped\n * (these represent unfilled filter slots in the UI).\n *\n * Traversal order:\n * 1. Recurse into child filters (`and`/`or`/`not`)\n * 2. Apply the corresponding visitor callback with already-traversed children\n * 3. For leaf nodes, call `leaf` directly\n */\nexport function traverseFilterSpec<\n  F extends FilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>,\n  R,\n>(\n  filter: F,\n  visitor: FilterSpecVisitor<InferFilterSpecCommonLeaf<F> & InferFilterSpecLeaf<F>, R>,\n): R {\n  return traverseFilterSpecImpl(filter, visitor as FilterSpecVisitor<unknown, R>);\n}\n/** Internal implementation with simple generics for clean recursion. */\nfunction traverseFilterSpecImpl<R>(\n  filter: FilterSpecNode<FilterSpecLeaf<unknown>, unknown, unknown>,\n  visitor: FilterSpecVisitor<unknown, R>,\n): R {\n  switch (filter.type) {\n    case \"and\":\n      return visitor.and(\n        filter.filters\n          .filter((f) => f.type !== undefined)\n          .map((f) => traverseFilterSpecImpl(f, visitor)),\n      );\n    case \"or\":\n      return visitor.or(\n        filter.filters\n          .filter((f) => f.type !== undefined)\n          .map((f) => traverseFilterSpecImpl(f, visitor)),\n      );\n    case \"not\":\n      return visitor.not(traverseFilterSpecImpl(filter.filter, visitor));\n    default:\n      return visitor.leaf(filter);\n  }\n}\n\n/** Collects all column references (`column` and `rhs` fields) from filter leaves. */\nexport function collectFilterSpecColumns<\n  F extends FilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>,\n  R extends InferFilterSpecLeafColumn<F> = InferFilterSpecLeafColumn<F>,\n>(filter: F): R[] {\n  return traverseFilterSpec(filter, {\n    leaf: (leaf) => {\n      const cols: R[] = [];\n      if (\"column\" in leaf && leaf.column !== undefined) cols.push(leaf.column as R);\n      if (\"rhs\" in leaf && leaf.rhs !== undefined) cols.push(leaf.rhs as R);\n      return cols;\n    },\n    and: (results) => results.flat(),\n    or: (results) => results.flat(),\n    not: (result) => result,\n  });\n}\n"],"mappings":";;;;;;;;;;;;;AAiCA,SAAgB,mBAId,QACA,SACG;AACH,QAAO,uBAAuB,QAAQ,QAAyC;;;AAGjF,SAAS,uBACP,QACA,SACG;AACH,SAAQ,OAAO,MAAf;EACE,KAAK,MACH,QAAO,QAAQ,IACb,OAAO,QACJ,QAAQ,MAAM,EAAE,SAAS,OAAU,CACnC,KAAK,MAAM,uBAAuB,GAAG,QAAQ,CAAC,CAClD;EACH,KAAK,KACH,QAAO,QAAQ,GACb,OAAO,QACJ,QAAQ,MAAM,EAAE,SAAS,OAAU,CACnC,KAAK,MAAM,uBAAuB,GAAG,QAAQ,CAAC,CAClD;EACH,KAAK,MACH,QAAO,QAAQ,IAAI,uBAAuB,OAAO,QAAQ,QAAQ,CAAC;EACpE,QACE,QAAO,QAAQ,KAAK,OAAO;;;;AAKjC,SAAgB,yBAGd,QAAgB;AAChB,QAAO,mBAAmB,QAAQ;EAChC,OAAO,SAAS;GACd,MAAM,OAAY,EAAE;AACpB,OAAI,YAAY,QAAQ,KAAK,WAAW,OAAW,MAAK,KAAK,KAAK,OAAY;AAC9E,OAAI,SAAS,QAAQ,KAAK,QAAQ,OAAW,MAAK,KAAK,KAAK,IAAS;AACrE,UAAO;;EAET,MAAM,YAAY,QAAQ,MAAM;EAChC,KAAK,YAAY,QAAQ,MAAM;EAC/B,MAAM,WAAW;EAClB,CAAC"}

package/dist/filters/traverse.js

@@ -1,50 +1,42 @@
+//#region src/filters/traverse.ts
 /**
- * Recursively traverses a FilterSpec tree bottom-up, applying visitor callbacks.
- *
- * Entries with `{ type: undefined }` inside `and`/`or` arrays are skipped
- * (these represent unfilled filter slots in the UI).
- *
- * Traversal order:
- * 1. Recurse into child filters (`and`/`or`/`not`)
- * 2. Apply the corresponding visitor callback with already-traversed children
- * 3. For leaf nodes, call `leaf` directly
- */
+* Recursively traverses a FilterSpec tree bottom-up, applying visitor callbacks.
+*
+* Entries with `{ type: undefined }` inside `and`/`or` arrays are skipped
+* (these represent unfilled filter slots in the UI).
+*
+* Traversal order:
+* 1. Recurse into child filters (`and`/`or`/`not`)
+* 2. Apply the corresponding visitor callback with already-traversed children
+* 3. For leaf nodes, call `leaf` directly
+*/
 function traverseFilterSpec(filter, visitor) {
-    return traverseFilterSpecImpl(filter, visitor);
+	return traverseFilterSpecImpl(filter, visitor);
 }
 /** Internal implementation with simple generics for clean recursion. */
 function traverseFilterSpecImpl(filter, visitor) {
-    switch (filter.type) {
-        case "and":
-            return visitor.and(filter.filters
-                .filter((f) => f.type !== undefined)
-                .map((f) => traverseFilterSpecImpl(f, visitor)));
-        case "or":
-            return visitor.or(filter.filters
-                .filter((f) => f.type !== undefined)
-                .map((f) => traverseFilterSpecImpl(f, visitor)));
-        case "not":
-            return visitor.not(traverseFilterSpecImpl(filter.filter, visitor));
-        default:
-            return visitor.leaf(filter);
-    }
+	switch (filter.type) {
+		case "and": return visitor.and(filter.filters.filter((f) => f.type !== void 0).map((f) => traverseFilterSpecImpl(f, visitor)));
+		case "or": return visitor.or(filter.filters.filter((f) => f.type !== void 0).map((f) => traverseFilterSpecImpl(f, visitor)));
+		case "not": return visitor.not(traverseFilterSpecImpl(filter.filter, visitor));
+		default: return visitor.leaf(filter);
+	}
 }
 /** Collects all column references (`column` and `rhs` fields) from filter leaves. */
 function collectFilterSpecColumns(filter) {
-    return traverseFilterSpec(filter, {
-        leaf: (leaf) => {
-            const cols = [];
-            if ("column" in leaf && leaf.column !== undefined)
-                cols.push(leaf.column);
-            if ("rhs" in leaf && leaf.rhs !== undefined)
-                cols.push(leaf.rhs);
-            return cols;
-        },
-        and: (results) => results.flat(),
-        or: (results) => results.flat(),
-        not: (result) => result,
-    });
+	return traverseFilterSpec(filter, {
+		leaf: (leaf) => {
+			const cols = [];
+			if ("column" in leaf && leaf.column !== void 0) cols.push(leaf.column);
+			if ("rhs" in leaf && leaf.rhs !== void 0) cols.push(leaf.rhs);
+			return cols;
+		},
+		and: (results) => results.flat(),
+		or: (results) => results.flat(),
+		not: (result) => result
+	});
 }
 
+//#endregion
 export { collectFilterSpecColumns, traverseFilterSpec };
-//# sourceMappingURL=traverse.js.map
+//# sourceMappingURL=traverse.js.map

package/dist/filters/traverse.js.map

@@ -1 +1 @@
-{"version":3,"file":"traverse.js","sources":["../../src/filters/traverse.ts"],"sourcesContent":["import type {\n  FilterSpec,\n  FilterSpecLeaf,\n  FilterSpecNode,\n  InferFilterSpecLeafColumn,\n} from \"@milaboratories/pl-model-common\";\nimport type {\n  InferFilterSpecCommonLeaf,\n  InferFilterSpecLeaf,\n} from \"@milaboratories/pl-model-common\";\n\nexport type FilterSpecVisitor<LeafArg, R> = {\n  /** Handle a leaf filter node. */\n  leaf: (leaf: LeafArg) => R;\n  /** Handle an AND node after children have been traversed. */\n  and: (results: R[]) => R;\n  /** Handle an OR node after children have been traversed. */\n  or: (results: R[]) => R;\n  /** Handle a NOT node after the inner filter has been traversed. */\n  not: (result: R) => R;\n};\n\n/**\n * Recursively traverses a FilterSpec tree bottom-up, applying visitor callbacks.\n *\n * Entries with `{ type: undefined }` inside `and`/`or` arrays are skipped\n * (these represent unfilled filter slots in the UI).\n *\n * Traversal order:\n * 1. Recurse into child filters (`and`/`or`/`not`)\n * 2. Apply the corresponding visitor callback with already-traversed children\n * 3. For leaf nodes, call `leaf` directly\n */\nexport function traverseFilterSpec<\n  F extends FilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>,\n  R,\n>(\n  filter: F,\n  visitor: FilterSpecVisitor<InferFilterSpecCommonLeaf<F> & InferFilterSpecLeaf<F>, R>,\n): R {\n  return traverseFilterSpecImpl(filter, visitor as FilterSpecVisitor<unknown, R>);\n}\n/** Internal implementation with simple generics for clean recursion. */\nfunction traverseFilterSpecImpl<R>(\n  filter: FilterSpecNode<FilterSpecLeaf<unknown>, unknown, unknown>,\n  visitor: FilterSpecVisitor<unknown, R>,\n): R {\n  switch (filter.type) {\n    case \"and\":\n      return visitor.and(\n        filter.filters\n          .filter((f) => f.type !== undefined)\n          .map((f) => traverseFilterSpecImpl(f, visitor)),\n      );\n    case \"or\":\n      return visitor.or(\n        filter.filters\n          .filter((f) => f.type !== undefined)\n          .map((f) => traverseFilterSpecImpl(f, visitor)),\n      );\n    case \"not\":\n      return visitor.not(traverseFilterSpecImpl(filter.filter, visitor));\n    default:\n      return visitor.leaf(filter);\n  }\n}\n\n/** Collects all column references (`column` and `rhs` fields) from filter leaves. */\nexport function collectFilterSpecColumns<\n  F extends FilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>,\n  R extends InferFilterSpecLeafColumn<F> = InferFilterSpecLeafColumn<F>,\n>(filter: F): R[] {\n  return traverseFilterSpec(filter, {\n    leaf: (leaf) => {\n      const cols: R[] = [];\n      if (\"column\" in leaf && leaf.column !== undefined) cols.push(leaf.column as R);\n      if (\"rhs\" in leaf && leaf.rhs !== undefined) cols.push(leaf.rhs as R);\n      return cols;\n    },\n    and: (results) => results.flat(),\n    or: (results) => results.flat(),\n    not: (result) => result,\n  });\n}\n"],"names":[],"mappings":"AAsBA;;;;;;;;;;AAUG;AACG,SAAU,kBAAkB,CAIhC,MAAS,EACT,OAAoF,EAAA;AAEpF,IAAA,OAAO,sBAAsB,CAAC,MAAM,EAAE,OAAwC,CAAC;AACjF;AACA;AACA,SAAS,sBAAsB,CAC7B,MAAiE,EACjE,OAAsC,EAAA;AAEtC,IAAA,QAAQ,MAAM,CAAC,IAAI;AACjB,QAAA,KAAK,KAAK;AACR,YAAA,OAAO,OAAO,CAAC,GAAG,CAChB,MAAM,CAAC;iBACJ,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,SAAS;AAClC,iBAAA,GAAG,CAAC,CAAC,CAAC,KAAK,sBAAsB,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAClD;AACH,QAAA,KAAK,IAAI;AACP,YAAA,OAAO,OAAO,CAAC,EAAE,CACf,MAAM,CAAC;iBACJ,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,SAAS;AAClC,iBAAA,GAAG,CAAC,CAAC,CAAC,KAAK,sBAAsB,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAClD;AACH,QAAA,KAAK,KAAK;AACR,YAAA,OAAO,OAAO,CAAC,GAAG,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AACpE,QAAA;AACE,YAAA,OAAO,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;;AAEjC;AAEA;AACM,SAAU,wBAAwB,CAGtC,MAAS,EAAA;IACT,OAAO,kBAAkB,CAAC,MAAM,EAAE;AAChC,QAAA,IAAI,EAAE,CAAC,IAAI,KAAI;YACb,MAAM,IAAI,GAAQ,EAAE;YACpB,IAAI,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;AAAE,gBAAA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAW,CAAC;YAC9E,IAAI,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS;AAAE,gBAAA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAQ,CAAC;AACrE,YAAA,OAAO,IAAI;QACb,CAAC;QACD,GAAG,EAAE,CAAC,OAAO,KAAK,OAAO,CAAC,IAAI,EAAE;QAChC,EAAE,EAAE,CAAC,OAAO,KAAK,OAAO,CAAC,IAAI,EAAE;AAC/B,QAAA,GAAG,EAAE,CAAC,MAAM,KAAK,MAAM;AACxB,KAAA,CAAC;AACJ;;;;"}
+{"version":3,"file":"traverse.js","names":[],"sources":["../../src/filters/traverse.ts"],"sourcesContent":["import type {\n  FilterSpec,\n  FilterSpecLeaf,\n  FilterSpecNode,\n  InferFilterSpecLeafColumn,\n} from \"@milaboratories/pl-model-common\";\nimport type {\n  InferFilterSpecCommonLeaf,\n  InferFilterSpecLeaf,\n} from \"@milaboratories/pl-model-common\";\n\nexport type FilterSpecVisitor<LeafArg, R> = {\n  /** Handle a leaf filter node. */\n  leaf: (leaf: LeafArg) => R;\n  /** Handle an AND node after children have been traversed. */\n  and: (results: R[]) => R;\n  /** Handle an OR node after children have been traversed. */\n  or: (results: R[]) => R;\n  /** Handle a NOT node after the inner filter has been traversed. */\n  not: (result: R) => R;\n};\n\n/**\n * Recursively traverses a FilterSpec tree bottom-up, applying visitor callbacks.\n *\n * Entries with `{ type: undefined }` inside `and`/`or` arrays are skipped\n * (these represent unfilled filter slots in the UI).\n *\n * Traversal order:\n * 1. Recurse into child filters (`and`/`or`/`not`)\n * 2. Apply the corresponding visitor callback with already-traversed children\n * 3. For leaf nodes, call `leaf` directly\n */\nexport function traverseFilterSpec<\n  F extends FilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>,\n  R,\n>(\n  filter: F,\n  visitor: FilterSpecVisitor<InferFilterSpecCommonLeaf<F> & InferFilterSpecLeaf<F>, R>,\n): R {\n  return traverseFilterSpecImpl(filter, visitor as FilterSpecVisitor<unknown, R>);\n}\n/** Internal implementation with simple generics for clean recursion. */\nfunction traverseFilterSpecImpl<R>(\n  filter: FilterSpecNode<FilterSpecLeaf<unknown>, unknown, unknown>,\n  visitor: FilterSpecVisitor<unknown, R>,\n): R {\n  switch (filter.type) {\n    case \"and\":\n      return visitor.and(\n        filter.filters\n          .filter((f) => f.type !== undefined)\n          .map((f) => traverseFilterSpecImpl(f, visitor)),\n      );\n    case \"or\":\n      return visitor.or(\n        filter.filters\n          .filter((f) => f.type !== undefined)\n          .map((f) => traverseFilterSpecImpl(f, visitor)),\n      );\n    case \"not\":\n      return visitor.not(traverseFilterSpecImpl(filter.filter, visitor));\n    default:\n      return visitor.leaf(filter);\n  }\n}\n\n/** Collects all column references (`column` and `rhs` fields) from filter leaves. */\nexport function collectFilterSpecColumns<\n  F extends FilterSpec<FilterSpecLeaf<unknown>, unknown, unknown>,\n  R extends InferFilterSpecLeafColumn<F> = InferFilterSpecLeafColumn<F>,\n>(filter: F): R[] {\n  return traverseFilterSpec(filter, {\n    leaf: (leaf) => {\n      const cols: R[] = [];\n      if (\"column\" in leaf && leaf.column !== undefined) cols.push(leaf.column as R);\n      if (\"rhs\" in leaf && leaf.rhs !== undefined) cols.push(leaf.rhs as R);\n      return cols;\n    },\n    and: (results) => results.flat(),\n    or: (results) => results.flat(),\n    not: (result) => result,\n  });\n}\n"],"mappings":";;;;;;;;;;;;AAiCA,SAAgB,mBAId,QACA,SACG;AACH,QAAO,uBAAuB,QAAQ,QAAyC;;;AAGjF,SAAS,uBACP,QACA,SACG;AACH,SAAQ,OAAO,MAAf;EACE,KAAK,MACH,QAAO,QAAQ,IACb,OAAO,QACJ,QAAQ,MAAM,EAAE,SAAS,OAAU,CACnC,KAAK,MAAM,uBAAuB,GAAG,QAAQ,CAAC,CAClD;EACH,KAAK,KACH,QAAO,QAAQ,GACb,OAAO,QACJ,QAAQ,MAAM,EAAE,SAAS,OAAU,CACnC,KAAK,MAAM,uBAAuB,GAAG,QAAQ,CAAC,CAClD;EACH,KAAK,MACH,QAAO,QAAQ,IAAI,uBAAuB,OAAO,QAAQ,QAAQ,CAAC;EACpE,QACE,QAAO,QAAQ,KAAK,OAAO;;;;AAKjC,SAAgB,yBAGd,QAAgB;AAChB,QAAO,mBAAmB,QAAQ;EAChC,OAAO,SAAS;GACd,MAAM,OAAY,EAAE;AACpB,OAAI,YAAY,QAAQ,KAAK,WAAW,OAAW,MAAK,KAAK,KAAK,OAAY;AAC9E,OAAI,SAAS,QAAQ,KAAK,QAAQ,OAAW,MAAK,KAAK,KAAK,IAAS;AACrE,UAAO;;EAET,MAAM,YAAY,QAAQ,MAAM;EAChC,KAAK,YAAY,QAAQ,MAAM;EAC/B,MAAM,WAAW;EAClB,CAAC"}

package/dist/filters/types.d.ts

@@ -1,9 +1,12 @@
-import type { PColumnSpec, SUniversalPColumnId } from "@milaboratories/pl-model-common";
-export type SimplifiedPColumnSpec = Pick<PColumnSpec, "valueType" | "annotations">;
-export type SimplifiedUniversalPColumnEntry = {
-    id: SUniversalPColumnId;
-    label: string;
-    obj: SimplifiedPColumnSpec;
+import { FilterSpec as FilterSpec$1, FilterSpecLeaf as FilterSpecLeaf$1, FilterSpecNode, FilterSpecOfType, FilterSpecType, PColumnSpec, SUniversalPColumnId } from "@milaboratories/pl-model-common";
+
+//#region src/filters/types.d.ts
+type SimplifiedPColumnSpec = Pick<PColumnSpec, "valueType" | "annotations">;
+type SimplifiedUniversalPColumnEntry = {
+  id: SUniversalPColumnId;
+  label: string;
+  obj: SimplifiedPColumnSpec;
 };
-export type { FilterSpecNode, FilterSpecLeaf, FilterSpec, FilterSpecType, FilterSpecOfType, } from "@milaboratories/pl-model-common";
+//#endregion
+export { type FilterSpec$1 as FilterSpec, type FilterSpecLeaf$1 as FilterSpecLeaf, type FilterSpecNode, type FilterSpecOfType, type FilterSpecType, SimplifiedPColumnSpec, SimplifiedUniversalPColumnEntry };
 //# sourceMappingURL=types.d.ts.map