{"version":3,"file":"distill.cjs","names":["traverseFilterSpec","isNil","isEmpty"],"sources":["../../src/filters/distill.ts"],"sourcesContent":["import { DistributiveKeys, isNil, 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/**\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\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/** Returns true if the leaf is filled — type is defined and every required field per-type is filled. */\nfunction isFilledLeaf<T>(node: FilterSpecLeaf<T>): boolean {\n  if (isNil(node.type)) return false;\n  const required = REQUIRED_KEYS_BY_TYPE[node.type];\n  const record = node as Record<string, unknown>;\n  return required.every((key) => isFilledValue(record[key]));\n}\n\n/**\n * Returns true if the value is considered \"filled\":\n * - primitives (number, boolean): always true\n * - string: non-empty after trim\n * - array: non-empty AND every item is filled\n * - plain object: non-empty AND every field value is filled\n * - null/undefined: false\n */\nfunction isFilledValue(value: unknown): boolean {\n  if (isNil(value)) return false;\n  switch (typeof value) {\n    case \"number\":\n    case \"boolean\":\n      return true;\n    case \"string\":\n      return value.trim() !== \"\";\n    default:\n      if (isEmpty(value)) return false;\n      if (Array.isArray(value)) return value.every(isFilledValue);\n      return Object.values(value as Record<string, unknown>).every(isFilledValue);\n  }\n}\n\n/** All possible field names that can appear in any FilterSpecLeaf variant. */\ntype FilterSpecLeafKey = DistributiveKeys<FilterSpecLeaf<string>>;\n\n/** Leaf type discriminators (excludes the placeholder `undefined` variant). */\ntype FilterSpecLeafType = Exclude<FilterSpecLeaf<unknown>, { type: undefined }>[\"type\"];\n\ntype LeafOfType<T extends FilterSpecLeafType> = Extract<FilterSpecLeaf<unknown>, { type: T }>;\n\ntype RequiredKeys<O> = { [K in keyof O]-?: {} extends Pick<O, K> ? never : K }[keyof O];\n\n/** Required field keys of a given leaf variant (excluding the `type` discriminator). */\ntype RequiredLeafKeys<T extends FilterSpecLeafType> = Exclude<RequiredKeys<LeafOfType<T>>, \"type\">;\n\n/** Exact per-type shape — adding a key not required by that variant becomes a type error. */\ntype RequiredKeysByType = { readonly [T in FilterSpecLeafType]: readonly RequiredLeafKeys<T>[] };\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/** Required fields per leaf type. Optional fields (e.g. minDiff, maxEdits) excluded. */\nconst REQUIRED_KEYS_BY_TYPE = {\n  isNA: [\"column\"],\n  isNotNA: [\"column\"],\n  ifNa: [\"column\", \"replacement\"],\n  patternEquals: [\"column\", \"value\"],\n  patternNotEquals: [\"column\", \"value\"],\n  patternContainSubsequence: [\"column\", \"value\"],\n  patternNotContainSubsequence: [\"column\", \"value\"],\n  patternMatchesRegularExpression: [\"column\", \"value\"],\n  patternFuzzyContainSubsequence: [\"column\", \"value\"],\n  inSet: [\"column\", \"value\"],\n  notInSet: [\"column\", \"value\"],\n  topN: [\"column\", \"n\"],\n  bottomN: [\"column\", \"n\"],\n  equal: [\"column\", \"x\"],\n  notEqual: [\"column\", \"x\"],\n  lessThan: [\"column\", \"x\"],\n  greaterThan: [\"column\", \"x\"],\n  lessThanOrEqual: [\"column\", \"x\"],\n  greaterThanOrEqual: [\"column\", \"x\"],\n  equalToColumn: [\"column\", \"rhs\"],\n  lessThanColumn: [\"column\", \"rhs\"],\n  greaterThanColumn: [\"column\", \"rhs\"],\n  lessThanColumnOrEqual: [\"column\", \"rhs\"],\n  greaterThanColumnOrEqual: [\"column\", \"rhs\"],\n} as const satisfies RequiredKeysByType;\n"],"mappings":";;;;;;;;AAcA,SAAgB,kBAKd,QAAyC;CACzC,IAAI,UAAU,MAAM,OAAO;CAC3B,OAAOA,iBAAAA,mBAAiC,QAAQ;EAC9C,OAAO,SAAS;GACd,MAAM,YAAY,YAAY,IAAI;GAClC,OAAO,aAAa,SAAS,IAAK,YAAkB;EACtD;EACA,MAAM,YAAY;GAChB,MAAM,WAAW,QAAQ,QAAQ,MAAkC,MAAM,IAAI;GAC7E,OAAO,SAAS,WAAW,IAAI,OAAQ;IAAE,MAAM;IAAO,SAAS;GAAS;EAC1E;EACA,KAAK,YAAY;GACf,MAAM,WAAW,QAAQ,QAAQ,MAAkC,MAAM,IAAI;GAC7E,OAAO,SAAS,WAAW,IAAI,OAAQ;IAAE,MAAM;IAAM,SAAS;GAAS;EACzE;EACA,MAAM,WAAY,WAAW,OAAO,OAAQ;GAAE,MAAM;GAAO,QAAQ;EAAO;CAC5E,CAAC;AACH;AAEA,SAAS,YAAe,MAA4C;CAClE,MAAM,SAAkC,CAAC;CACzC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,IAAI,GAC5C,IAAI,gBAAgB,IAAI,GAAwB,GAC9C,OAAO,OAAO;CAGlB,OAAO;AACT;;AAGA,SAAS,aAAgB,MAAkC;CACzD,KAAA,GAAIC,wBAAAA,MAAAA,CAAM,KAAK,IAAI,GAAG,OAAO;CAC7B,MAAM,WAAW,sBAAsB,KAAK;CAC5C,MAAM,SAAS;CACf,OAAO,SAAS,OAAO,QAAQ,cAAc,OAAO,IAAI,CAAC;AAC3D;;;;;;;;;AAUA,SAAS,cAAc,OAAyB;CAC9C,KAAA,GAAIA,wBAAAA,MAAAA,CAAM,KAAK,GAAG,OAAO;CACzB,QAAQ,OAAO,OAAf;EACE,KAAK;EACL,KAAK,WACH,OAAO;EACT,KAAK,UACH,OAAO,MAAM,KAAK,MAAM;EAC1B;GACE,KAAA,GAAIC,kBAAAA,QAAAA,CAAQ,KAAK,GAAG,OAAO;GAC3B,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,MAAM,aAAa;GAC1D,OAAO,OAAO,OAAO,KAAgC,CAAC,CAAC,MAAM,aAAa;CAC9E;AACF;AAgCA,MAAM,kCAA0C,IAAI,IAAI;CAZtD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AAE0E,CAAC;;AAG7E,MAAM,wBAAwB;CAC5B,MAAM,CAAC,QAAQ;CACf,SAAS,CAAC,QAAQ;CAClB,MAAM,CAAC,UAAU,aAAa;CAC9B,eAAe,CAAC,UAAU,OAAO;CACjC,kBAAkB,CAAC,UAAU,OAAO;CACpC,2BAA2B,CAAC,UAAU,OAAO;CAC7C,8BAA8B,CAAC,UAAU,OAAO;CAChD,iCAAiC,CAAC,UAAU,OAAO;CACnD,gCAAgC,CAAC,UAAU,OAAO;CAClD,OAAO,CAAC,UAAU,OAAO;CACzB,UAAU,CAAC,UAAU,OAAO;CAC5B,MAAM,CAAC,UAAU,GAAG;CACpB,SAAS,CAAC,UAAU,GAAG;CACvB,OAAO,CAAC,UAAU,GAAG;CACrB,UAAU,CAAC,UAAU,GAAG;CACxB,UAAU,CAAC,UAAU,GAAG;CACxB,aAAa,CAAC,UAAU,GAAG;CAC3B,iBAAiB,CAAC,UAAU,GAAG;CAC/B,oBAAoB,CAAC,UAAU,GAAG;CAClC,eAAe,CAAC,UAAU,KAAK;CAC/B,gBAAgB,CAAC,UAAU,KAAK;CAChC,mBAAmB,CAAC,UAAU,KAAK;CACnC,uBAAuB,CAAC,UAAU,KAAK;CACvC,0BAA0B,CAAC,UAAU,KAAK;AAC5C"}