@ai-matrx/design-system 0.20.6 → 0.20.9

package/dist/data-table/filter-engine.cjs

@@ -32,6 +32,7 @@ __export(filter_engine_exports, {
   isColumnFilterActive: () => isColumnFilterActive,
   matchesTableSearch: () => matchesTableSearch,
   passesColumnFilter: () => passesColumnFilter,
+  selectCellValues: () => selectCellValues,
   stringifyCellValue: () => stringifyCellValue,
   tableSearchWords: () => tableSearchWords
 });
@@ -182,6 +183,9 @@ function compareValues(a, b) {
     sensitivity: "base"
   });
 }
+function selectCellValues(value) {
+  return (Array.isArray(value) ? value : [value]).map(stringifyCellValue).filter((item) => item !== "");
+}
 function passesColumnFilter(value, filter) {
   const matches = (() => {
     switch (filter.kind) {
@@ -198,9 +202,9 @@ function passesColumnFilter(value, filter) {
       case "select": {
         const selected = filter.values ?? (filter.value && filter.value !== "__all__" ? [filter.value] : []);
         if (selected.length === 0) return true;
-        const s = stringifyCellValue(value);
+        const values = selectCellValues(value);
         return selected.some(
-          (v) => v === SELECT_EMPTY_VALUE ? s === "" : v === SELECT_NOT_EMPTY_VALUE ? s !== "" : s === v
+          (v) => v === SELECT_EMPTY_VALUE ? values.length === 0 : v === SELECT_NOT_EMPTY_VALUE ? values.length > 0 : values.includes(v)
         );
       }
       case "boolean": {

package/dist/data-table/filter-engine.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/data-table/filter-engine.ts","../../src/data-table/layered-filters.ts"],"sourcesContent":["import type {\n  ColumnFilterValue,\n  ColumnFiltersState,\n  MatrxColumnDef,\n  SortState,\n  TableSearchMatchMode,\n} from \"./types\";\nimport {\n  completeLayeredFilterRules,\n  layeredFilterMatchesValue,\n  type LayeredFilterRule,\n} from \"./layered-filters\";\n\n/**\n * Sentinel select-filter values for \"no value\" / \"any value\" — every select\n * filter offers them automatically when the column has empty cells, so any\n * table can isolate rows missing a value (or having one) without extra config.\n */\nexport const SELECT_EMPTY_VALUE = \"__empty__\";\nexport const SELECT_NOT_EMPTY_VALUE = \"__not_empty__\";\n\nexport function columnId<T>(col: MatrxColumnDef<T>): string {\n  if (col.id) return col.id;\n  if (col.accessorKey) return String(col.accessorKey);\n  throw new Error(\"MatrxDataTable column requires `id` or `accessorKey`\");\n}\n\nexport function getCellValue<T>(row: T, col: MatrxColumnDef<T>): unknown {\n  if (col.accessorFn) return col.accessorFn(row);\n  if (col.accessorKey) {\n    return (row as Record<string, unknown>)[col.accessorKey];\n  }\n  return undefined;\n}\n\nexport function getFilterValue<T>(row: T, col: MatrxColumnDef<T>): unknown {\n  return col.filterValue ? col.filterValue(row) : getCellValue(row, col);\n}\n\nexport function getSortValue<T>(row: T, col: MatrxColumnDef<T>): unknown {\n  return col.sortValue ? col.sortValue(row) : getCellValue(row, col);\n}\n\nexport function stringifyCellValue(value: unknown): string {\n  if (value == null) return \"\";\n  if (typeof value === \"string\") return value;\n  if (typeof value === \"number\" || typeof value === \"boolean\") {\n    return String(value);\n  }\n  if (value instanceof Date) return value.toISOString();\n  try {\n    return JSON.stringify(value);\n  } catch {\n    return String(value);\n  }\n}\n\n/** Unicode-aware tokenization shared by whole-word table search. */\nexport function tableSearchWords(value: string): string[] {\n  return value\n    .toLocaleLowerCase()\n    .split(/[^\\p{L}\\p{N}]+/u)\n    .filter(Boolean);\n}\n\n/**\n * Match the primary table search against one row's searchable text. In\n * whole-word mode every entered word must exist as a complete token, so\n * `are` matches `we are ready` but never `hardware`.\n */\nexport function matchesTableSearch(\n  searchableText: string,\n  query: string,\n  mode: TableSearchMatchMode = \"contains\",\n): boolean {\n  const normalizedQuery = query.trim().toLocaleLowerCase();\n  if (!normalizedQuery) return true;\n  if (mode === \"contains\") {\n    return searchableText.toLocaleLowerCase().includes(normalizedQuery);\n  }\n  const actualWords = new Set(tableSearchWords(searchableText));\n  const expectedWords = tableSearchWords(normalizedQuery);\n  return (\n    expectedWords.length > 0 &&\n    expectedWords.every((word) => actualWords.has(word))\n  );\n}\n\nfunction compareValues(a: unknown, b: unknown): number {\n  if (a == null && b == null) return 0;\n  if (a == null) return -1;\n  if (b == null) return 1;\n  if (typeof a === \"number\" && typeof b === \"number\") return a - b;\n  if (typeof a === \"boolean\" && typeof b === \"boolean\") {\n    return Number(a) - Number(b);\n  }\n  return stringifyCellValue(a).localeCompare(stringifyCellValue(b), undefined, {\n    numeric: true,\n    sensitivity: \"base\",\n  });\n}\n\nexport function passesColumnFilter(\n  value: unknown,\n  filter: ColumnFilterValue,\n): boolean {\n  const matches = (() => {\n    switch (filter.kind) {\n    case \"text\": {\n      const s = stringifyCellValue(value);\n      if (filter.mode === \"null\") return value == null;\n      if (filter.mode === \"not_null\") return value != null;\n      if (filter.mode === \"empty\") return s.trim() === \"\";\n      if (filter.mode === \"not_empty\") return s.trim() !== \"\";\n      const q = filter.value.trim().toLowerCase();\n      if (!q) return true;\n      return s.toLowerCase().includes(q);\n    }\n    case \"select\": {\n      const selected =\n        filter.values ??\n        (filter.value && filter.value !== \"__all__\" ? [filter.value] : []);\n      if (selected.length === 0) return true;\n      const s = stringifyCellValue(value);\n      // OR semantics across the set; sentinels compose (\"A or (empty)\").\n      return selected.some((v) =>\n        v === SELECT_EMPTY_VALUE\n          ? s === \"\"\n          : v === SELECT_NOT_EMPTY_VALUE\n            ? s !== \"\"\n            : s === v,\n      );\n    }\n    case \"boolean\": {\n      return Boolean(value) === filter.value;\n    }\n    case \"number\": {\n      const n =\n        typeof value === \"number\"\n          ? value\n          : Number(stringifyCellValue(value).replace(/[^0-9.-]/g, \"\"));\n      if (Number.isNaN(n)) return false;\n      if (filter.min !== undefined && n < filter.min) return false;\n      if (filter.max !== undefined && n > filter.max) return false;\n      return true;\n    }\n    }\n  })();\n  return filter.negated ? !matches : matches;\n}\n\nexport function filterAndSortRows<T>(\n  rows: T[],\n  columns: MatrxColumnDef<T>[],\n  columnFilters: ColumnFiltersState,\n  sort: SortState | null,\n  globalSearch: string,\n  anyOf?: { columnIds: string[]; query: string },\n  layeredFilters?: readonly LayeredFilterRule[],\n  globalSearchMode: TableSearchMatchMode = \"contains\",\n  searchText?: (row: T) => string,\n): T[] {\n  const colById = new Map(columns.map((c) => [columnId(c), c]));\n  const q = globalSearch.trim().toLowerCase();\n  const anyQ = anyOf?.query.trim().toLowerCase() ?? \"\";\n  const activeLayeredFilters = completeLayeredFilterRules(layeredFilters);\n\n  let result = rows.filter((row) => {\n    for (const [id, filter] of Object.entries(columnFilters)) {\n      if (!filter) continue;\n      const col = colById.get(id);\n      if (!col || col.filter === false) continue;\n      if (!passesColumnFilter(getFilterValue(row, col), filter)) return false;\n    }\n\n    for (const rule of activeLayeredFilters) {\n      const col = colById.get(rule.field);\n      if (!col || !layeredFilterMatchesValue(getFilterValue(row, col), rule)) {\n        return false;\n      }\n    }\n\n    if (anyQ && anyOf) {\n      const hit = anyOf.columnIds.some((id) => {\n        const col = colById.get(id);\n        if (!col) return false;\n        return stringifyCellValue(getFilterValue(row, col))\n          .toLowerCase()\n          .includes(anyQ);\n      });\n      if (!hit) return false;\n    }\n\n    if (!q) return true;\n    const searchableValues = columns\n      .filter(\n        (col) =>\n          col.filter !== false || Boolean(col.accessorKey || col.accessorFn),\n      )\n      .map((col) => stringifyCellValue(getFilterValue(row, col)));\n    const additionalSearchText = searchText?.(row);\n    if (additionalSearchText) searchableValues.push(additionalSearchText);\n    if (globalSearchMode === \"contains\") {\n      return searchableValues.some((value) =>\n        matchesTableSearch(value, q, \"contains\"),\n      );\n    }\n    return matchesTableSearch(searchableValues.join(\" \"), q, \"whole_words\");\n  });\n\n  if (sort) {\n    const col = colById.get(sort.id);\n    if (col && col.sortable !== false) {\n      const dir = sort.direction === \"asc\" ? 1 : -1;\n      result = [...result].sort((a, b) => {\n        const va = getSortValue(a, col);\n        const vb = getSortValue(b, col);\n        // Empty cells (null / \"\") sort LAST in both directions — sorting a\n        // column should surface its values, never a wall of blanks.\n        const ea = va == null || stringifyCellValue(va) === \"\";\n        const eb = vb == null || stringifyCellValue(vb) === \"\";\n        if (ea !== eb) return ea ? 1 : -1;\n        return compareValues(va, vb) * dir;\n      });\n    }\n  }\n\n  return result;\n}\n\nexport function countActiveColumnFilters(filters: ColumnFiltersState): number {\n  let n = 0;\n  for (const f of Object.values(filters)) {\n    if (!f) continue;\n    switch (f.kind) {\n      case \"text\":\n        if (f.value.trim() || (f.mode && f.mode !== \"contains\")) n += 1;\n        break;\n      case \"select\":\n        if (f.values ? f.values.length > 0 : f.value && f.value !== \"__all__\")\n          n += 1;\n        break;\n      case \"boolean\":\n        n += 1;\n        break;\n      case \"number\":\n        if (f.min !== undefined || f.max !== undefined) n += 1;\n        break;\n    }\n  }\n  return n;\n}\n\nexport function isColumnFilterActive(\n  filter: ColumnFilterValue | undefined,\n): boolean {\n  if (!filter) return false;\n  switch (filter.kind) {\n    case \"text\":\n      return (\n        filter.value.trim().length > 0 ||\n        (filter.mode !== undefined && filter.mode !== \"contains\")\n      );\n    case \"select\":\n      return filter.values\n        ? filter.values.length > 0\n        : Boolean(filter.value) && filter.value !== \"__all__\";\n    case \"boolean\":\n      return true;\n    case \"number\":\n      return filter.min !== undefined || filter.max !== undefined;\n  }\n}\n\n/** Apply draft edits onto a row for display (shallow field merge). */\nexport function applyRowEdits<T>(\n  row: T,\n  edits: Record<string, unknown> | undefined,\n): T {\n  if (!edits || Object.keys(edits).length === 0) return row;\n  return { ...row, ...edits };\n}\n","/**\n * Shared vocabulary for ordered, AND-combined table filters. The same rule\n * shape is URL-safe, can be evaluated by local tables, and can be handed to a\n * controlled table's server query without a surface inventing another query\n * builder.\n */\n\nimport { z } from \"zod\";\nimport type { ColumnFiltersState } from \"./types\";\n\nexport const LAYERED_FILTER_OPERATORS = [\n  \"contains\",\n  \"not_contains\",\n  \"equals\",\n  \"not_equals\",\n  \"starts_with\",\n  \"ends_with\",\n  \"word\",\n  \"not_word\",\n  \"is_empty\",\n  \"is_not_empty\",\n  \"greater_than\",\n  \"greater_or_equal\",\n  \"less_than\",\n  \"less_or_equal\",\n  \"between\",\n] as const;\n\nexport type LayeredFilterOperator = (typeof LAYERED_FILTER_OPERATORS)[number];\n\nexport interface LayeredFilterRule {\n  id: string;\n  field: string;\n  operator: LayeredFilterOperator;\n  value: string;\n  valueTo?: string | undefined;\n}\n\nexport type LayeredFilterField =\n  | {\n      id: string;\n      label: string;\n      kind: \"text\";\n      operators?: LayeredFilterOperator[];\n    }\n  | {\n      id: string;\n      label: string;\n      kind: \"number\";\n      operators?: LayeredFilterOperator[];\n      placeholder?: string;\n    }\n  | {\n      id: string;\n      label: string;\n      kind: \"select\";\n      operators?: LayeredFilterOperator[];\n      options: Array<{ value: string; label: string }>;\n    };\n\nconst layeredFilterRuleSchema = z.object({\n  id: z.string().min(1),\n  field: z.string().min(1),\n  operator: z.enum(LAYERED_FILTER_OPERATORS),\n  value: z.string(),\n  valueTo: z.string().optional(),\n});\n\nconst layeredFilterRulesSchema = z.array(layeredFilterRuleSchema).max(20);\n\nconst TEXT_OPERATORS: LayeredFilterOperator[] = [\n  \"contains\",\n  \"not_contains\",\n  \"equals\",\n  \"not_equals\",\n  \"starts_with\",\n  \"ends_with\",\n  \"word\",\n  \"not_word\",\n  \"is_empty\",\n  \"is_not_empty\",\n];\n\nconst NUMBER_OPERATORS: LayeredFilterOperator[] = [\n  \"equals\",\n  \"not_equals\",\n  \"greater_than\",\n  \"greater_or_equal\",\n  \"less_than\",\n  \"less_or_equal\",\n  \"between\",\n  \"is_empty\",\n  \"is_not_empty\",\n];\n\nconst SELECT_OPERATORS: LayeredFilterOperator[] = [\n  \"equals\",\n  \"not_equals\",\n  \"is_empty\",\n  \"is_not_empty\",\n];\n\nexport const LAYERED_FILTER_OPERATOR_LABELS: Record<\n  LayeredFilterOperator,\n  string\n> = {\n  contains: \"contains\",\n  not_contains: \"doesn't contain\",\n  equals: \"is\",\n  not_equals: \"is not\",\n  starts_with: \"starts with\",\n  ends_with: \"ends with\",\n  word: \"has the word\",\n  not_word: \"doesn't have the word\",\n  is_empty: \"is empty\",\n  is_not_empty: \"is not empty\",\n  greater_than: \"is greater than\",\n  greater_or_equal: \"is at least\",\n  less_than: \"is less than\",\n  less_or_equal: \"is at most\",\n  between: \"is between\",\n};\n\nexport function operatorsForLayeredField(\n  field: LayeredFilterField,\n): LayeredFilterOperator[] {\n  if (field.operators) return field.operators;\n  if (field.kind === \"number\") return NUMBER_OPERATORS;\n  if (field.kind === \"select\") return SELECT_OPERATORS;\n  return TEXT_OPERATORS;\n}\n\nexport function layeredFilterNeedsValue(\n  operator: LayeredFilterOperator,\n): boolean {\n  return operator !== \"is_empty\" && operator !== \"is_not_empty\";\n}\n\nexport function isCompleteLayeredFilterRule(rule: LayeredFilterRule): boolean {\n  if (!layeredFilterNeedsValue(rule.operator)) return true;\n  if (rule.value.trim() === \"\") return false;\n  return rule.operator !== \"between\" || Boolean(rule.valueTo?.trim());\n}\n\nexport function completeLayeredFilterRules(\n  rules: readonly LayeredFilterRule[] | undefined,\n): LayeredFilterRule[] {\n  return (rules ?? []).filter(isCompleteLayeredFilterRule);\n}\n\nexport function isLayeredFilterOperator(\n  value: string,\n): value is LayeredFilterOperator {\n  return LAYERED_FILTER_OPERATORS.some((operator) => operator === value);\n}\n\n/** Decode URL-owned rules without trusting a hand-edited link. */\nexport function decodeLayeredFilterRules(\n  raw: string | null,\n): LayeredFilterRule[] {\n  if (!raw) return [];\n  try {\n    const parsed: unknown = JSON.parse(raw);\n    const result = layeredFilterRulesSchema.safeParse(parsed);\n    return result.success ? result.data : [];\n  } catch {\n    return [];\n  }\n}\n\n/** Stable compact URL/wire form; rule order is preserved. */\nexport function encodeLayeredFilterRules(\n  rules: readonly LayeredFilterRule[] | undefined,\n): string | null {\n  return rules?.length ? JSON.stringify(rules) : null;\n}\n\n/**\n * Translate ordinary per-column controls into the same ordered rule language\n * used by the advanced builder. Controlled tables can send these rules to one\n * server evaluator instead of rebuilding numeric/text filter semantics.\n * Select filters are intentionally omitted because their multi-select control\n * is OR-combined and should stay in its native query parameter.\n */\nexport function columnFiltersToLayeredRules(\n  filters: ColumnFiltersState,\n  fieldIds: readonly string[],\n): LayeredFilterRule[] {\n  const rules: LayeredFilterRule[] = [];\n  for (const field of fieldIds) {\n    const filter = filters[field];\n    if (!filter) continue;\n\n    if (filter.kind === \"text\") {\n      rules.push({\n        id: `column-${field}`,\n        field,\n        operator:\n          filter.mode === \"empty\"\n            ? \"is_empty\"\n            : filter.mode === \"not_empty\"\n              ? \"is_not_empty\"\n              : \"contains\",\n        value: filter.value,\n      });\n      continue;\n    }\n\n    if (filter.kind === \"number\") {\n      if (filter.min !== undefined && filter.max !== undefined) {\n        rules.push({\n          id: `column-${field}`,\n          field,\n          operator: \"between\",\n          value: String(filter.min),\n          valueTo: String(filter.max),\n        });\n      } else if (filter.min !== undefined) {\n        rules.push({\n          id: `column-${field}`,\n          field,\n          operator: \"greater_or_equal\",\n          value: String(filter.min),\n        });\n      } else if (filter.max !== undefined) {\n        rules.push({\n          id: `column-${field}`,\n          field,\n          operator: \"less_or_equal\",\n          value: String(filter.max),\n        });\n      }\n      continue;\n    }\n\n    if (filter.kind === \"boolean\") {\n      rules.push({\n        id: `column-${field}`,\n        field,\n        operator: \"equals\",\n        value: String(filter.value),\n      });\n    }\n  }\n  return rules;\n}\n\nfunction normalizedText(value: unknown): string {\n  if (value === null || value === undefined) return \"\";\n  return String(value).trim().toLocaleLowerCase();\n}\n\nfunction words(value: string): string[] {\n  return value.split(/[^\\p{L}\\p{N}]+/u).filter(Boolean);\n}\n\n/** Local-table evaluator. Controlled tables send the same rule shape server-side. */\nexport function layeredFilterMatchesValue(\n  value: unknown,\n  rule: LayeredFilterRule,\n): boolean {\n  const actual = normalizedText(value);\n  const expected = rule.value.trim().toLocaleLowerCase();\n  const expectedTo = rule.valueTo?.trim().toLocaleLowerCase() ?? \"\";\n\n  switch (rule.operator) {\n    case \"contains\":\n      return actual.includes(expected);\n    case \"not_contains\":\n      return !actual.includes(expected);\n    case \"equals\":\n      return actual === expected;\n    case \"not_equals\":\n      return actual !== expected;\n    case \"starts_with\":\n      return actual.startsWith(expected);\n    case \"ends_with\":\n      return actual.endsWith(expected);\n    case \"word\":\n      return words(actual).includes(expected);\n    case \"not_word\":\n      return !words(actual).includes(expected);\n    case \"is_empty\":\n      return actual === \"\";\n    case \"is_not_empty\":\n      return actual !== \"\";\n    case \"greater_than\":\n      return Number(actual) > Number(expected);\n    case \"greater_or_equal\":\n      return Number(actual) >= Number(expected);\n    case \"less_than\":\n      return Number(actual) < Number(expected);\n    case \"less_or_equal\":\n      return Number(actual) <= Number(expected);\n    case \"between\": {\n      const numeric = Number(actual);\n      return numeric >= Number(expected) && numeric <= Number(expectedTo);\n    }\n  }\n}\n\nexport function layeredFilterRuleSummary(\n  rule: LayeredFilterRule,\n  fields: readonly LayeredFilterField[],\n): string {\n  const field = fields.find((candidate) => candidate.id === rule.field);\n  const fieldLabel = field?.label ?? rule.field;\n  const operator = LAYERED_FILTER_OPERATOR_LABELS[rule.operator];\n  if (!layeredFilterNeedsValue(rule.operator))\n    return `${fieldLabel} ${operator}`;\n  const selectedLabel =\n    field?.kind === \"select\"\n      ? field.options.find((option) => option.value === rule.value)?.label\n      : undefined;\n  const value = selectedLabel ?? rule.value;\n  return rule.operator === \"between\"\n    ? `${fieldLabel} ${operator} ${value} and ${rule.valueTo ?? \"\"}`\n    : `${fieldLabel} ${operator} ${value}`;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACOA,iBAAkB;AAGX,IAAM,2BAA2B;AAAA,EACtC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAkCA,IAAM,0BAA0B,aAAE,OAAO;AAAA,EACvC,IAAI,aAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACpB,OAAO,aAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACvB,UAAU,aAAE,KAAK,wBAAwB;AAAA,EACzC,OAAO,aAAE,OAAO;AAAA,EAChB,SAAS,aAAE,OAAO,EAAE,SAAS;AAC/B,CAAC;AAED,IAAM,2BAA2B,aAAE,MAAM,uBAAuB,EAAE,IAAI,EAAE;AAgEjE,SAAS,wBACd,UACS;AACT,SAAO,aAAa,cAAc,aAAa;AACjD;AAEO,SAAS,4BAA4B,MAAkC;AAC5E,MAAI,CAAC,wBAAwB,KAAK,QAAQ,EAAG,QAAO;AACpD,MAAI,KAAK,MAAM,KAAK,MAAM,GAAI,QAAO;AACrC,SAAO,KAAK,aAAa,aAAa,QAAQ,KAAK,SAAS,KAAK,CAAC;AACpE;AAEO,SAAS,2BACd,OACqB;AACrB,UAAQ,SAAS,CAAC,GAAG,OAAO,2BAA2B;AACzD;AAmGA,SAAS,eAAe,OAAwB;AAC9C,MAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,SAAO,OAAO,KAAK,EAAE,KAAK,EAAE,kBAAkB;AAChD;AAEA,SAAS,MAAM,OAAyB;AACtC,SAAO,MAAM,MAAM,iBAAiB,EAAE,OAAO,OAAO;AACtD;AAGO,SAAS,0BACd,OACA,MACS;AACT,QAAM,SAAS,eAAe,KAAK;AACnC,QAAM,WAAW,KAAK,MAAM,KAAK,EAAE,kBAAkB;AACrD,QAAM,aAAa,KAAK,SAAS,KAAK,EAAE,kBAAkB,KAAK;AAE/D,UAAQ,KAAK,UAAU;AAAA,IACrB,KAAK;AACH,aAAO,OAAO,SAAS,QAAQ;AAAA,IACjC,KAAK;AACH,aAAO,CAAC,OAAO,SAAS,QAAQ;AAAA,IAClC,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,OAAO,WAAW,QAAQ;AAAA,IACnC,KAAK;AACH,aAAO,OAAO,SAAS,QAAQ;AAAA,IACjC,KAAK;AACH,aAAO,MAAM,MAAM,EAAE,SAAS,QAAQ;AAAA,IACxC,KAAK;AACH,aAAO,CAAC,MAAM,MAAM,EAAE,SAAS,QAAQ;AAAA,IACzC,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,OAAO,MAAM,IAAI,OAAO,QAAQ;AAAA,IACzC,KAAK;AACH,aAAO,OAAO,MAAM,KAAK,OAAO,QAAQ;AAAA,IAC1C,KAAK;AACH,aAAO,OAAO,MAAM,IAAI,OAAO,QAAQ;AAAA,IACzC,KAAK;AACH,aAAO,OAAO,MAAM,KAAK,OAAO,QAAQ;AAAA,IAC1C,KAAK,WAAW;AACd,YAAM,UAAU,OAAO,MAAM;AAC7B,aAAO,WAAW,OAAO,QAAQ,KAAK,WAAW,OAAO,UAAU;AAAA,IACpE;AAAA,EACF;AACF;;;ADzRO,IAAM,qBAAqB;AAC3B,IAAM,yBAAyB;AAE/B,SAAS,SAAY,KAAgC;AAC1D,MAAI,IAAI,GAAI,QAAO,IAAI;AACvB,MAAI,IAAI,YAAa,QAAO,OAAO,IAAI,WAAW;AAClD,QAAM,IAAI,MAAM,sDAAsD;AACxE;AAEO,SAAS,aAAgB,KAAQ,KAAiC;AACvE,MAAI,IAAI,WAAY,QAAO,IAAI,WAAW,GAAG;AAC7C,MAAI,IAAI,aAAa;AACnB,WAAQ,IAAgC,IAAI,WAAW;AAAA,EACzD;AACA,SAAO;AACT;AAEO,SAAS,eAAkB,KAAQ,KAAiC;AACzE,SAAO,IAAI,cAAc,IAAI,YAAY,GAAG,IAAI,aAAa,KAAK,GAAG;AACvE;AAEO,SAAS,aAAgB,KAAQ,KAAiC;AACvE,SAAO,IAAI,YAAY,IAAI,UAAU,GAAG,IAAI,aAAa,KAAK,GAAG;AACnE;AAEO,SAAS,mBAAmB,OAAwB;AACzD,MAAI,SAAS,KAAM,QAAO;AAC1B,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;AAC3D,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,MAAI,iBAAiB,KAAM,QAAO,MAAM,YAAY;AACpD,MAAI;AACF,WAAO,KAAK,UAAU,KAAK;AAAA,EAC7B,QAAQ;AACN,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;AAGO,SAAS,iBAAiB,OAAyB;AACxD,SAAO,MACJ,kBAAkB,EAClB,MAAM,iBAAiB,EACvB,OAAO,OAAO;AACnB;AAOO,SAAS,mBACd,gBACA,OACA,OAA6B,YACpB;AACT,QAAM,kBAAkB,MAAM,KAAK,EAAE,kBAAkB;AACvD,MAAI,CAAC,gBAAiB,QAAO;AAC7B,MAAI,SAAS,YAAY;AACvB,WAAO,eAAe,kBAAkB,EAAE,SAAS,eAAe;AAAA,EACpE;AACA,QAAM,cAAc,IAAI,IAAI,iBAAiB,cAAc,CAAC;AAC5D,QAAM,gBAAgB,iBAAiB,eAAe;AACtD,SACE,cAAc,SAAS,KACvB,cAAc,MAAM,CAAC,SAAS,YAAY,IAAI,IAAI,CAAC;AAEvD;AAEA,SAAS,cAAc,GAAY,GAAoB;AACrD,MAAI,KAAK,QAAQ,KAAK,KAAM,QAAO;AACnC,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI;AAC/D,MAAI,OAAO,MAAM,aAAa,OAAO,MAAM,WAAW;AACpD,WAAO,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,EAC7B;AACA,SAAO,mBAAmB,CAAC,EAAE,cAAc,mBAAmB,CAAC,GAAG,QAAW;AAAA,IAC3E,SAAS;AAAA,IACT,aAAa;AAAA,EACf,CAAC;AACH;AAEO,SAAS,mBACd,OACA,QACS;AACT,QAAM,WAAW,MAAM;AACrB,YAAQ,OAAO,MAAM;AAAA,MACrB,KAAK,QAAQ;AACX,cAAM,IAAI,mBAAmB,KAAK;AAClC,YAAI,OAAO,SAAS,OAAQ,QAAO,SAAS;AAC5C,YAAI,OAAO,SAAS,WAAY,QAAO,SAAS;AAChD,YAAI,OAAO,SAAS,QAAS,QAAO,EAAE,KAAK,MAAM;AACjD,YAAI,OAAO,SAAS,YAAa,QAAO,EAAE,KAAK,MAAM;AACrD,cAAM,IAAI,OAAO,MAAM,KAAK,EAAE,YAAY;AAC1C,YAAI,CAAC,EAAG,QAAO;AACf,eAAO,EAAE,YAAY,EAAE,SAAS,CAAC;AAAA,MACnC;AAAA,MACA,KAAK,UAAU;AACb,cAAM,WACJ,OAAO,WACN,OAAO,SAAS,OAAO,UAAU,YAAY,CAAC,OAAO,KAAK,IAAI,CAAC;AAClE,YAAI,SAAS,WAAW,EAAG,QAAO;AAClC,cAAM,IAAI,mBAAmB,KAAK;AAElC,eAAO,SAAS;AAAA,UAAK,CAAC,MACpB,MAAM,qBACF,MAAM,KACN,MAAM,yBACJ,MAAM,KACN,MAAM;AAAA,QACd;AAAA,MACF;AAAA,MACA,KAAK,WAAW;AACd,eAAO,QAAQ,KAAK,MAAM,OAAO;AAAA,MACnC;AAAA,MACA,KAAK,UAAU;AACb,cAAM,IACJ,OAAO,UAAU,WACb,QACA,OAAO,mBAAmB,KAAK,EAAE,QAAQ,aAAa,EAAE,CAAC;AAC/D,YAAI,OAAO,MAAM,CAAC,EAAG,QAAO;AAC5B,YAAI,OAAO,QAAQ,UAAa,IAAI,OAAO,IAAK,QAAO;AACvD,YAAI,OAAO,QAAQ,UAAa,IAAI,OAAO,IAAK,QAAO;AACvD,eAAO;AAAA,MACT;AAAA,IACA;AAAA,EACF,GAAG;AACH,SAAO,OAAO,UAAU,CAAC,UAAU;AACrC;AAEO,SAAS,kBACd,MACA,SACA,eACA,MACA,cACA,OACA,gBACA,mBAAyC,YACzC,YACK;AACL,QAAM,UAAU,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;AAC5D,QAAM,IAAI,aAAa,KAAK,EAAE,YAAY;AAC1C,QAAM,OAAO,OAAO,MAAM,KAAK,EAAE,YAAY,KAAK;AAClD,QAAM,uBAAuB,2BAA2B,cAAc;AAEtE,MAAI,SAAS,KAAK,OAAO,CAAC,QAAQ;AAChC,eAAW,CAAC,IAAI,MAAM,KAAK,OAAO,QAAQ,aAAa,GAAG;AACxD,UAAI,CAAC,OAAQ;AACb,YAAM,MAAM,QAAQ,IAAI,EAAE;AAC1B,UAAI,CAAC,OAAO,IAAI,WAAW,MAAO;AAClC,UAAI,CAAC,mBAAmB,eAAe,KAAK,GAAG,GAAG,MAAM,EAAG,QAAO;AAAA,IACpE;AAEA,eAAW,QAAQ,sBAAsB;AACvC,YAAM,MAAM,QAAQ,IAAI,KAAK,KAAK;AAClC,UAAI,CAAC,OAAO,CAAC,0BAA0B,eAAe,KAAK,GAAG,GAAG,IAAI,GAAG;AACtE,eAAO;AAAA,MACT;AAAA,IACF;AAEA,QAAI,QAAQ,OAAO;AACjB,YAAM,MAAM,MAAM,UAAU,KAAK,CAAC,OAAO;AACvC,cAAM,MAAM,QAAQ,IAAI,EAAE;AAC1B,YAAI,CAAC,IAAK,QAAO;AACjB,eAAO,mBAAmB,eAAe,KAAK,GAAG,CAAC,EAC/C,YAAY,EACZ,SAAS,IAAI;AAAA,MAClB,CAAC;AACD,UAAI,CAAC,IAAK,QAAO;AAAA,IACnB;AAEA,QAAI,CAAC,EAAG,QAAO;AACf,UAAM,mBAAmB,QACtB;AAAA,MACC,CAAC,QACC,IAAI,WAAW,SAAS,QAAQ,IAAI,eAAe,IAAI,UAAU;AAAA,IACrE,EACC,IAAI,CAAC,QAAQ,mBAAmB,eAAe,KAAK,GAAG,CAAC,CAAC;AAC5D,UAAM,uBAAuB,aAAa,GAAG;AAC7C,QAAI,qBAAsB,kBAAiB,KAAK,oBAAoB;AACpE,QAAI,qBAAqB,YAAY;AACnC,aAAO,iBAAiB;AAAA,QAAK,CAAC,UAC5B,mBAAmB,OAAO,GAAG,UAAU;AAAA,MACzC;AAAA,IACF;AACA,WAAO,mBAAmB,iBAAiB,KAAK,GAAG,GAAG,GAAG,aAAa;AAAA,EACxE,CAAC;AAED,MAAI,MAAM;AACR,UAAM,MAAM,QAAQ,IAAI,KAAK,EAAE;AAC/B,QAAI,OAAO,IAAI,aAAa,OAAO;AACjC,YAAM,MAAM,KAAK,cAAc,QAAQ,IAAI;AAC3C,eAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM;AAClC,cAAM,KAAK,aAAa,GAAG,GAAG;AAC9B,cAAM,KAAK,aAAa,GAAG,GAAG;AAG9B,cAAM,KAAK,MAAM,QAAQ,mBAAmB,EAAE,MAAM;AACpD,cAAM,KAAK,MAAM,QAAQ,mBAAmB,EAAE,MAAM;AACpD,YAAI,OAAO,GAAI,QAAO,KAAK,IAAI;AAC/B,eAAO,cAAc,IAAI,EAAE,IAAI;AAAA,MACjC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,yBAAyB,SAAqC;AAC5E,MAAI,IAAI;AACR,aAAW,KAAK,OAAO,OAAO,OAAO,GAAG;AACtC,QAAI,CAAC,EAAG;AACR,YAAQ,EAAE,MAAM;AAAA,MACd,KAAK;AACH,YAAI,EAAE,MAAM,KAAK,KAAM,EAAE,QAAQ,EAAE,SAAS,WAAa,MAAK;AAC9D;AAAA,MACF,KAAK;AACH,YAAI,EAAE,SAAS,EAAE,OAAO,SAAS,IAAI,EAAE,SAAS,EAAE,UAAU;AAC1D,eAAK;AACP;AAAA,MACF,KAAK;AACH,aAAK;AACL;AAAA,MACF,KAAK;AACH,YAAI,EAAE,QAAQ,UAAa,EAAE,QAAQ,OAAW,MAAK;AACrD;AAAA,IACJ;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,qBACd,QACS;AACT,MAAI,CAAC,OAAQ,QAAO;AACpB,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK;AACH,aACE,OAAO,MAAM,KAAK,EAAE,SAAS,KAC5B,OAAO,SAAS,UAAa,OAAO,SAAS;AAAA,IAElD,KAAK;AACH,aAAO,OAAO,SACV,OAAO,OAAO,SAAS,IACvB,QAAQ,OAAO,KAAK,KAAK,OAAO,UAAU;AAAA,IAChD,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO,OAAO,QAAQ,UAAa,OAAO,QAAQ;AAAA,EACtD;AACF;AAGO,SAAS,cACd,KACA,OACG;AACH,MAAI,CAAC,SAAS,OAAO,KAAK,KAAK,EAAE,WAAW,EAAG,QAAO;AACtD,SAAO,EAAE,GAAG,KAAK,GAAG,MAAM;AAC5B;","names":[]}
+{"version":3,"sources":["../../src/data-table/filter-engine.ts","../../src/data-table/layered-filters.ts"],"sourcesContent":["import type {\n  ColumnFilterValue,\n  ColumnFiltersState,\n  MatrxColumnDef,\n  SortState,\n  TableSearchMatchMode,\n} from \"./types\";\nimport {\n  completeLayeredFilterRules,\n  layeredFilterMatchesValue,\n  type LayeredFilterRule,\n} from \"./layered-filters\";\n\n/**\n * Sentinel select-filter values for \"no value\" / \"any value\" — every select\n * filter offers them automatically when the column has empty cells, so any\n * table can isolate rows missing a value (or having one) without extra config.\n */\nexport const SELECT_EMPTY_VALUE = \"__empty__\";\nexport const SELECT_NOT_EMPTY_VALUE = \"__not_empty__\";\n\nexport function columnId<T>(col: MatrxColumnDef<T>): string {\n  if (col.id) return col.id;\n  if (col.accessorKey) return String(col.accessorKey);\n  throw new Error(\"MatrxDataTable column requires `id` or `accessorKey`\");\n}\n\nexport function getCellValue<T>(row: T, col: MatrxColumnDef<T>): unknown {\n  if (col.accessorFn) return col.accessorFn(row);\n  if (col.accessorKey) {\n    return (row as Record<string, unknown>)[col.accessorKey];\n  }\n  return undefined;\n}\n\nexport function getFilterValue<T>(row: T, col: MatrxColumnDef<T>): unknown {\n  return col.filterValue ? col.filterValue(row) : getCellValue(row, col);\n}\n\nexport function getSortValue<T>(row: T, col: MatrxColumnDef<T>): unknown {\n  return col.sortValue ? col.sortValue(row) : getCellValue(row, col);\n}\n\nexport function stringifyCellValue(value: unknown): string {\n  if (value == null) return \"\";\n  if (typeof value === \"string\") return value;\n  if (typeof value === \"number\" || typeof value === \"boolean\") {\n    return String(value);\n  }\n  if (value instanceof Date) return value.toISOString();\n  try {\n    return JSON.stringify(value);\n  } catch {\n    return String(value);\n  }\n}\n\n/** Unicode-aware tokenization shared by whole-word table search. */\nexport function tableSearchWords(value: string): string[] {\n  return value\n    .toLocaleLowerCase()\n    .split(/[^\\p{L}\\p{N}]+/u)\n    .filter(Boolean);\n}\n\n/**\n * Match the primary table search against one row's searchable text. In\n * whole-word mode every entered word must exist as a complete token, so\n * `are` matches `we are ready` but never `hardware`.\n */\nexport function matchesTableSearch(\n  searchableText: string,\n  query: string,\n  mode: TableSearchMatchMode = \"contains\",\n): boolean {\n  const normalizedQuery = query.trim().toLocaleLowerCase();\n  if (!normalizedQuery) return true;\n  if (mode === \"contains\") {\n    return searchableText.toLocaleLowerCase().includes(normalizedQuery);\n  }\n  const actualWords = new Set(tableSearchWords(searchableText));\n  const expectedWords = tableSearchWords(normalizedQuery);\n  return (\n    expectedWords.length > 0 &&\n    expectedWords.every((word) => actualWords.has(word))\n  );\n}\n\nfunction compareValues(a: unknown, b: unknown): number {\n  if (a == null && b == null) return 0;\n  if (a == null) return -1;\n  if (b == null) return 1;\n  if (typeof a === \"number\" && typeof b === \"number\") return a - b;\n  if (typeof a === \"boolean\" && typeof b === \"boolean\") {\n    return Number(a) - Number(b);\n  }\n  return stringifyCellValue(a).localeCompare(stringifyCellValue(b), undefined, {\n    numeric: true,\n    sensitivity: \"base\",\n  });\n}\n\n/** Select filters treat array-valued cells as sets, never as serialized JSON choices. */\nexport function selectCellValues(value: unknown): string[] {\n  return (Array.isArray(value) ? value : [value])\n    .map(stringifyCellValue)\n    .filter((item) => item !== \"\");\n}\n\nexport function passesColumnFilter(\n  value: unknown,\n  filter: ColumnFilterValue,\n): boolean {\n  const matches = (() => {\n    switch (filter.kind) {\n    case \"text\": {\n      const s = stringifyCellValue(value);\n      if (filter.mode === \"null\") return value == null;\n      if (filter.mode === \"not_null\") return value != null;\n      if (filter.mode === \"empty\") return s.trim() === \"\";\n      if (filter.mode === \"not_empty\") return s.trim() !== \"\";\n      const q = filter.value.trim().toLowerCase();\n      if (!q) return true;\n      return s.toLowerCase().includes(q);\n    }\n    case \"select\": {\n      const selected =\n        filter.values ??\n        (filter.value && filter.value !== \"__all__\" ? [filter.value] : []);\n      if (selected.length === 0) return true;\n      const values = selectCellValues(value);\n      // OR semantics across the set; sentinels compose (\"A or (empty)\").\n      return selected.some((v) =>\n        v === SELECT_EMPTY_VALUE\n          ? values.length === 0\n          : v === SELECT_NOT_EMPTY_VALUE\n            ? values.length > 0\n            : values.includes(v),\n      );\n    }\n    case \"boolean\": {\n      return Boolean(value) === filter.value;\n    }\n    case \"number\": {\n      const n =\n        typeof value === \"number\"\n          ? value\n          : Number(stringifyCellValue(value).replace(/[^0-9.-]/g, \"\"));\n      if (Number.isNaN(n)) return false;\n      if (filter.min !== undefined && n < filter.min) return false;\n      if (filter.max !== undefined && n > filter.max) return false;\n      return true;\n    }\n    }\n  })();\n  return filter.negated ? !matches : matches;\n}\n\nexport function filterAndSortRows<T>(\n  rows: T[],\n  columns: MatrxColumnDef<T>[],\n  columnFilters: ColumnFiltersState,\n  sort: SortState | null,\n  globalSearch: string,\n  anyOf?: { columnIds: string[]; query: string },\n  layeredFilters?: readonly LayeredFilterRule[],\n  globalSearchMode: TableSearchMatchMode = \"contains\",\n  searchText?: (row: T) => string,\n): T[] {\n  const colById = new Map(columns.map((c) => [columnId(c), c]));\n  const q = globalSearch.trim().toLowerCase();\n  const anyQ = anyOf?.query.trim().toLowerCase() ?? \"\";\n  const activeLayeredFilters = completeLayeredFilterRules(layeredFilters);\n\n  let result = rows.filter((row) => {\n    for (const [id, filter] of Object.entries(columnFilters)) {\n      if (!filter) continue;\n      const col = colById.get(id);\n      if (!col || col.filter === false) continue;\n      if (!passesColumnFilter(getFilterValue(row, col), filter)) return false;\n    }\n\n    for (const rule of activeLayeredFilters) {\n      const col = colById.get(rule.field);\n      if (!col || !layeredFilterMatchesValue(getFilterValue(row, col), rule)) {\n        return false;\n      }\n    }\n\n    if (anyQ && anyOf) {\n      const hit = anyOf.columnIds.some((id) => {\n        const col = colById.get(id);\n        if (!col) return false;\n        return stringifyCellValue(getFilterValue(row, col))\n          .toLowerCase()\n          .includes(anyQ);\n      });\n      if (!hit) return false;\n    }\n\n    if (!q) return true;\n    const searchableValues = columns\n      .filter(\n        (col) =>\n          col.filter !== false || Boolean(col.accessorKey || col.accessorFn),\n      )\n      .map((col) => stringifyCellValue(getFilterValue(row, col)));\n    const additionalSearchText = searchText?.(row);\n    if (additionalSearchText) searchableValues.push(additionalSearchText);\n    if (globalSearchMode === \"contains\") {\n      return searchableValues.some((value) =>\n        matchesTableSearch(value, q, \"contains\"),\n      );\n    }\n    return matchesTableSearch(searchableValues.join(\" \"), q, \"whole_words\");\n  });\n\n  if (sort) {\n    const col = colById.get(sort.id);\n    if (col && col.sortable !== false) {\n      const dir = sort.direction === \"asc\" ? 1 : -1;\n      result = [...result].sort((a, b) => {\n        const va = getSortValue(a, col);\n        const vb = getSortValue(b, col);\n        // Empty cells (null / \"\") sort LAST in both directions — sorting a\n        // column should surface its values, never a wall of blanks.\n        const ea = va == null || stringifyCellValue(va) === \"\";\n        const eb = vb == null || stringifyCellValue(vb) === \"\";\n        if (ea !== eb) return ea ? 1 : -1;\n        return compareValues(va, vb) * dir;\n      });\n    }\n  }\n\n  return result;\n}\n\nexport function countActiveColumnFilters(filters: ColumnFiltersState): number {\n  let n = 0;\n  for (const f of Object.values(filters)) {\n    if (!f) continue;\n    switch (f.kind) {\n      case \"text\":\n        if (f.value.trim() || (f.mode && f.mode !== \"contains\")) n += 1;\n        break;\n      case \"select\":\n        if (f.values ? f.values.length > 0 : f.value && f.value !== \"__all__\")\n          n += 1;\n        break;\n      case \"boolean\":\n        n += 1;\n        break;\n      case \"number\":\n        if (f.min !== undefined || f.max !== undefined) n += 1;\n        break;\n    }\n  }\n  return n;\n}\n\nexport function isColumnFilterActive(\n  filter: ColumnFilterValue | undefined,\n): boolean {\n  if (!filter) return false;\n  switch (filter.kind) {\n    case \"text\":\n      return (\n        filter.value.trim().length > 0 ||\n        (filter.mode !== undefined && filter.mode !== \"contains\")\n      );\n    case \"select\":\n      return filter.values\n        ? filter.values.length > 0\n        : Boolean(filter.value) && filter.value !== \"__all__\";\n    case \"boolean\":\n      return true;\n    case \"number\":\n      return filter.min !== undefined || filter.max !== undefined;\n  }\n}\n\n/** Apply draft edits onto a row for display (shallow field merge). */\nexport function applyRowEdits<T>(\n  row: T,\n  edits: Record<string, unknown> | undefined,\n): T {\n  if (!edits || Object.keys(edits).length === 0) return row;\n  return { ...row, ...edits };\n}\n","/**\n * Shared vocabulary for ordered, AND-combined table filters. The same rule\n * shape is URL-safe, can be evaluated by local tables, and can be handed to a\n * controlled table's server query without a surface inventing another query\n * builder.\n */\n\nimport { z } from \"zod\";\nimport type { ColumnFiltersState } from \"./types\";\n\nexport const LAYERED_FILTER_OPERATORS = [\n  \"contains\",\n  \"not_contains\",\n  \"equals\",\n  \"not_equals\",\n  \"starts_with\",\n  \"ends_with\",\n  \"word\",\n  \"not_word\",\n  \"is_empty\",\n  \"is_not_empty\",\n  \"greater_than\",\n  \"greater_or_equal\",\n  \"less_than\",\n  \"less_or_equal\",\n  \"between\",\n] as const;\n\nexport type LayeredFilterOperator = (typeof LAYERED_FILTER_OPERATORS)[number];\n\nexport interface LayeredFilterRule {\n  id: string;\n  field: string;\n  operator: LayeredFilterOperator;\n  value: string;\n  valueTo?: string | undefined;\n}\n\nexport type LayeredFilterField =\n  | {\n      id: string;\n      label: string;\n      kind: \"text\";\n      operators?: LayeredFilterOperator[];\n    }\n  | {\n      id: string;\n      label: string;\n      kind: \"number\";\n      operators?: LayeredFilterOperator[];\n      placeholder?: string;\n    }\n  | {\n      id: string;\n      label: string;\n      kind: \"select\";\n      operators?: LayeredFilterOperator[];\n      options: Array<{ value: string; label: string }>;\n    };\n\nconst layeredFilterRuleSchema = z.object({\n  id: z.string().min(1),\n  field: z.string().min(1),\n  operator: z.enum(LAYERED_FILTER_OPERATORS),\n  value: z.string(),\n  valueTo: z.string().optional(),\n});\n\nconst layeredFilterRulesSchema = z.array(layeredFilterRuleSchema).max(20);\n\nconst TEXT_OPERATORS: LayeredFilterOperator[] = [\n  \"contains\",\n  \"not_contains\",\n  \"equals\",\n  \"not_equals\",\n  \"starts_with\",\n  \"ends_with\",\n  \"word\",\n  \"not_word\",\n  \"is_empty\",\n  \"is_not_empty\",\n];\n\nconst NUMBER_OPERATORS: LayeredFilterOperator[] = [\n  \"equals\",\n  \"not_equals\",\n  \"greater_than\",\n  \"greater_or_equal\",\n  \"less_than\",\n  \"less_or_equal\",\n  \"between\",\n  \"is_empty\",\n  \"is_not_empty\",\n];\n\nconst SELECT_OPERATORS: LayeredFilterOperator[] = [\n  \"equals\",\n  \"not_equals\",\n  \"is_empty\",\n  \"is_not_empty\",\n];\n\nexport const LAYERED_FILTER_OPERATOR_LABELS: Record<\n  LayeredFilterOperator,\n  string\n> = {\n  contains: \"contains\",\n  not_contains: \"doesn't contain\",\n  equals: \"is\",\n  not_equals: \"is not\",\n  starts_with: \"starts with\",\n  ends_with: \"ends with\",\n  word: \"has the word\",\n  not_word: \"doesn't have the word\",\n  is_empty: \"is empty\",\n  is_not_empty: \"is not empty\",\n  greater_than: \"is greater than\",\n  greater_or_equal: \"is at least\",\n  less_than: \"is less than\",\n  less_or_equal: \"is at most\",\n  between: \"is between\",\n};\n\nexport function operatorsForLayeredField(\n  field: LayeredFilterField,\n): LayeredFilterOperator[] {\n  if (field.operators) return field.operators;\n  if (field.kind === \"number\") return NUMBER_OPERATORS;\n  if (field.kind === \"select\") return SELECT_OPERATORS;\n  return TEXT_OPERATORS;\n}\n\nexport function layeredFilterNeedsValue(\n  operator: LayeredFilterOperator,\n): boolean {\n  return operator !== \"is_empty\" && operator !== \"is_not_empty\";\n}\n\nexport function isCompleteLayeredFilterRule(rule: LayeredFilterRule): boolean {\n  if (!layeredFilterNeedsValue(rule.operator)) return true;\n  if (rule.value.trim() === \"\") return false;\n  return rule.operator !== \"between\" || Boolean(rule.valueTo?.trim());\n}\n\nexport function completeLayeredFilterRules(\n  rules: readonly LayeredFilterRule[] | undefined,\n): LayeredFilterRule[] {\n  return (rules ?? []).filter(isCompleteLayeredFilterRule);\n}\n\nexport function isLayeredFilterOperator(\n  value: string,\n): value is LayeredFilterOperator {\n  return LAYERED_FILTER_OPERATORS.some((operator) => operator === value);\n}\n\n/** Decode URL-owned rules without trusting a hand-edited link. */\nexport function decodeLayeredFilterRules(\n  raw: string | null,\n): LayeredFilterRule[] {\n  if (!raw) return [];\n  try {\n    const parsed: unknown = JSON.parse(raw);\n    const result = layeredFilterRulesSchema.safeParse(parsed);\n    return result.success ? result.data : [];\n  } catch {\n    return [];\n  }\n}\n\n/** Stable compact URL/wire form; rule order is preserved. */\nexport function encodeLayeredFilterRules(\n  rules: readonly LayeredFilterRule[] | undefined,\n): string | null {\n  return rules?.length ? JSON.stringify(rules) : null;\n}\n\n/**\n * Translate ordinary per-column controls into the same ordered rule language\n * used by the advanced builder. Controlled tables can send these rules to one\n * server evaluator instead of rebuilding numeric/text filter semantics.\n * Select filters are intentionally omitted because their multi-select control\n * is OR-combined and should stay in its native query parameter.\n */\nexport function columnFiltersToLayeredRules(\n  filters: ColumnFiltersState,\n  fieldIds: readonly string[],\n): LayeredFilterRule[] {\n  const rules: LayeredFilterRule[] = [];\n  for (const field of fieldIds) {\n    const filter = filters[field];\n    if (!filter) continue;\n\n    if (filter.kind === \"text\") {\n      rules.push({\n        id: `column-${field}`,\n        field,\n        operator:\n          filter.mode === \"empty\"\n            ? \"is_empty\"\n            : filter.mode === \"not_empty\"\n              ? \"is_not_empty\"\n              : \"contains\",\n        value: filter.value,\n      });\n      continue;\n    }\n\n    if (filter.kind === \"number\") {\n      if (filter.min !== undefined && filter.max !== undefined) {\n        rules.push({\n          id: `column-${field}`,\n          field,\n          operator: \"between\",\n          value: String(filter.min),\n          valueTo: String(filter.max),\n        });\n      } else if (filter.min !== undefined) {\n        rules.push({\n          id: `column-${field}`,\n          field,\n          operator: \"greater_or_equal\",\n          value: String(filter.min),\n        });\n      } else if (filter.max !== undefined) {\n        rules.push({\n          id: `column-${field}`,\n          field,\n          operator: \"less_or_equal\",\n          value: String(filter.max),\n        });\n      }\n      continue;\n    }\n\n    if (filter.kind === \"boolean\") {\n      rules.push({\n        id: `column-${field}`,\n        field,\n        operator: \"equals\",\n        value: String(filter.value),\n      });\n    }\n  }\n  return rules;\n}\n\nfunction normalizedText(value: unknown): string {\n  if (value === null || value === undefined) return \"\";\n  return String(value).trim().toLocaleLowerCase();\n}\n\nfunction words(value: string): string[] {\n  return value.split(/[^\\p{L}\\p{N}]+/u).filter(Boolean);\n}\n\n/** Local-table evaluator. Controlled tables send the same rule shape server-side. */\nexport function layeredFilterMatchesValue(\n  value: unknown,\n  rule: LayeredFilterRule,\n): boolean {\n  const actual = normalizedText(value);\n  const expected = rule.value.trim().toLocaleLowerCase();\n  const expectedTo = rule.valueTo?.trim().toLocaleLowerCase() ?? \"\";\n\n  switch (rule.operator) {\n    case \"contains\":\n      return actual.includes(expected);\n    case \"not_contains\":\n      return !actual.includes(expected);\n    case \"equals\":\n      return actual === expected;\n    case \"not_equals\":\n      return actual !== expected;\n    case \"starts_with\":\n      return actual.startsWith(expected);\n    case \"ends_with\":\n      return actual.endsWith(expected);\n    case \"word\":\n      return words(actual).includes(expected);\n    case \"not_word\":\n      return !words(actual).includes(expected);\n    case \"is_empty\":\n      return actual === \"\";\n    case \"is_not_empty\":\n      return actual !== \"\";\n    case \"greater_than\":\n      return Number(actual) > Number(expected);\n    case \"greater_or_equal\":\n      return Number(actual) >= Number(expected);\n    case \"less_than\":\n      return Number(actual) < Number(expected);\n    case \"less_or_equal\":\n      return Number(actual) <= Number(expected);\n    case \"between\": {\n      const numeric = Number(actual);\n      return numeric >= Number(expected) && numeric <= Number(expectedTo);\n    }\n  }\n}\n\nexport function layeredFilterRuleSummary(\n  rule: LayeredFilterRule,\n  fields: readonly LayeredFilterField[],\n): string {\n  const field = fields.find((candidate) => candidate.id === rule.field);\n  const fieldLabel = field?.label ?? rule.field;\n  const operator = LAYERED_FILTER_OPERATOR_LABELS[rule.operator];\n  if (!layeredFilterNeedsValue(rule.operator))\n    return `${fieldLabel} ${operator}`;\n  const selectedLabel =\n    field?.kind === \"select\"\n      ? field.options.find((option) => option.value === rule.value)?.label\n      : undefined;\n  const value = selectedLabel ?? rule.value;\n  return rule.operator === \"between\"\n    ? `${fieldLabel} ${operator} ${value} and ${rule.valueTo ?? \"\"}`\n    : `${fieldLabel} ${operator} ${value}`;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACOA,iBAAkB;AAGX,IAAM,2BAA2B;AAAA,EACtC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAkCA,IAAM,0BAA0B,aAAE,OAAO;AAAA,EACvC,IAAI,aAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACpB,OAAO,aAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACvB,UAAU,aAAE,KAAK,wBAAwB;AAAA,EACzC,OAAO,aAAE,OAAO;AAAA,EAChB,SAAS,aAAE,OAAO,EAAE,SAAS;AAC/B,CAAC;AAED,IAAM,2BAA2B,aAAE,MAAM,uBAAuB,EAAE,IAAI,EAAE;AAgEjE,SAAS,wBACd,UACS;AACT,SAAO,aAAa,cAAc,aAAa;AACjD;AAEO,SAAS,4BAA4B,MAAkC;AAC5E,MAAI,CAAC,wBAAwB,KAAK,QAAQ,EAAG,QAAO;AACpD,MAAI,KAAK,MAAM,KAAK,MAAM,GAAI,QAAO;AACrC,SAAO,KAAK,aAAa,aAAa,QAAQ,KAAK,SAAS,KAAK,CAAC;AACpE;AAEO,SAAS,2BACd,OACqB;AACrB,UAAQ,SAAS,CAAC,GAAG,OAAO,2BAA2B;AACzD;AAmGA,SAAS,eAAe,OAAwB;AAC9C,MAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,SAAO,OAAO,KAAK,EAAE,KAAK,EAAE,kBAAkB;AAChD;AAEA,SAAS,MAAM,OAAyB;AACtC,SAAO,MAAM,MAAM,iBAAiB,EAAE,OAAO,OAAO;AACtD;AAGO,SAAS,0BACd,OACA,MACS;AACT,QAAM,SAAS,eAAe,KAAK;AACnC,QAAM,WAAW,KAAK,MAAM,KAAK,EAAE,kBAAkB;AACrD,QAAM,aAAa,KAAK,SAAS,KAAK,EAAE,kBAAkB,KAAK;AAE/D,UAAQ,KAAK,UAAU;AAAA,IACrB,KAAK;AACH,aAAO,OAAO,SAAS,QAAQ;AAAA,IACjC,KAAK;AACH,aAAO,CAAC,OAAO,SAAS,QAAQ;AAAA,IAClC,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,OAAO,WAAW,QAAQ;AAAA,IACnC,KAAK;AACH,aAAO,OAAO,SAAS,QAAQ;AAAA,IACjC,KAAK;AACH,aAAO,MAAM,MAAM,EAAE,SAAS,QAAQ;AAAA,IACxC,KAAK;AACH,aAAO,CAAC,MAAM,MAAM,EAAE,SAAS,QAAQ;AAAA,IACzC,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,OAAO,MAAM,IAAI,OAAO,QAAQ;AAAA,IACzC,KAAK;AACH,aAAO,OAAO,MAAM,KAAK,OAAO,QAAQ;AAAA,IAC1C,KAAK;AACH,aAAO,OAAO,MAAM,IAAI,OAAO,QAAQ;AAAA,IACzC,KAAK;AACH,aAAO,OAAO,MAAM,KAAK,OAAO,QAAQ;AAAA,IAC1C,KAAK,WAAW;AACd,YAAM,UAAU,OAAO,MAAM;AAC7B,aAAO,WAAW,OAAO,QAAQ,KAAK,WAAW,OAAO,UAAU;AAAA,IACpE;AAAA,EACF;AACF;;;ADzRO,IAAM,qBAAqB;AAC3B,IAAM,yBAAyB;AAE/B,SAAS,SAAY,KAAgC;AAC1D,MAAI,IAAI,GAAI,QAAO,IAAI;AACvB,MAAI,IAAI,YAAa,QAAO,OAAO,IAAI,WAAW;AAClD,QAAM,IAAI,MAAM,sDAAsD;AACxE;AAEO,SAAS,aAAgB,KAAQ,KAAiC;AACvE,MAAI,IAAI,WAAY,QAAO,IAAI,WAAW,GAAG;AAC7C,MAAI,IAAI,aAAa;AACnB,WAAQ,IAAgC,IAAI,WAAW;AAAA,EACzD;AACA,SAAO;AACT;AAEO,SAAS,eAAkB,KAAQ,KAAiC;AACzE,SAAO,IAAI,cAAc,IAAI,YAAY,GAAG,IAAI,aAAa,KAAK,GAAG;AACvE;AAEO,SAAS,aAAgB,KAAQ,KAAiC;AACvE,SAAO,IAAI,YAAY,IAAI,UAAU,GAAG,IAAI,aAAa,KAAK,GAAG;AACnE;AAEO,SAAS,mBAAmB,OAAwB;AACzD,MAAI,SAAS,KAAM,QAAO;AAC1B,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;AAC3D,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,MAAI,iBAAiB,KAAM,QAAO,MAAM,YAAY;AACpD,MAAI;AACF,WAAO,KAAK,UAAU,KAAK;AAAA,EAC7B,QAAQ;AACN,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;AAGO,SAAS,iBAAiB,OAAyB;AACxD,SAAO,MACJ,kBAAkB,EAClB,MAAM,iBAAiB,EACvB,OAAO,OAAO;AACnB;AAOO,SAAS,mBACd,gBACA,OACA,OAA6B,YACpB;AACT,QAAM,kBAAkB,MAAM,KAAK,EAAE,kBAAkB;AACvD,MAAI,CAAC,gBAAiB,QAAO;AAC7B,MAAI,SAAS,YAAY;AACvB,WAAO,eAAe,kBAAkB,EAAE,SAAS,eAAe;AAAA,EACpE;AACA,QAAM,cAAc,IAAI,IAAI,iBAAiB,cAAc,CAAC;AAC5D,QAAM,gBAAgB,iBAAiB,eAAe;AACtD,SACE,cAAc,SAAS,KACvB,cAAc,MAAM,CAAC,SAAS,YAAY,IAAI,IAAI,CAAC;AAEvD;AAEA,SAAS,cAAc,GAAY,GAAoB;AACrD,MAAI,KAAK,QAAQ,KAAK,KAAM,QAAO;AACnC,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI;AAC/D,MAAI,OAAO,MAAM,aAAa,OAAO,MAAM,WAAW;AACpD,WAAO,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,EAC7B;AACA,SAAO,mBAAmB,CAAC,EAAE,cAAc,mBAAmB,CAAC,GAAG,QAAW;AAAA,IAC3E,SAAS;AAAA,IACT,aAAa;AAAA,EACf,CAAC;AACH;AAGO,SAAS,iBAAiB,OAA0B;AACzD,UAAQ,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK,GAC1C,IAAI,kBAAkB,EACtB,OAAO,CAAC,SAAS,SAAS,EAAE;AACjC;AAEO,SAAS,mBACd,OACA,QACS;AACT,QAAM,WAAW,MAAM;AACrB,YAAQ,OAAO,MAAM;AAAA,MACrB,KAAK,QAAQ;AACX,cAAM,IAAI,mBAAmB,KAAK;AAClC,YAAI,OAAO,SAAS,OAAQ,QAAO,SAAS;AAC5C,YAAI,OAAO,SAAS,WAAY,QAAO,SAAS;AAChD,YAAI,OAAO,SAAS,QAAS,QAAO,EAAE,KAAK,MAAM;AACjD,YAAI,OAAO,SAAS,YAAa,QAAO,EAAE,KAAK,MAAM;AACrD,cAAM,IAAI,OAAO,MAAM,KAAK,EAAE,YAAY;AAC1C,YAAI,CAAC,EAAG,QAAO;AACf,eAAO,EAAE,YAAY,EAAE,SAAS,CAAC;AAAA,MACnC;AAAA,MACA,KAAK,UAAU;AACb,cAAM,WACJ,OAAO,WACN,OAAO,SAAS,OAAO,UAAU,YAAY,CAAC,OAAO,KAAK,IAAI,CAAC;AAClE,YAAI,SAAS,WAAW,EAAG,QAAO;AAClC,cAAM,SAAS,iBAAiB,KAAK;AAErC,eAAO,SAAS;AAAA,UAAK,CAAC,MACpB,MAAM,qBACF,OAAO,WAAW,IAClB,MAAM,yBACJ,OAAO,SAAS,IAChB,OAAO,SAAS,CAAC;AAAA,QACzB;AAAA,MACF;AAAA,MACA,KAAK,WAAW;AACd,eAAO,QAAQ,KAAK,MAAM,OAAO;AAAA,MACnC;AAAA,MACA,KAAK,UAAU;AACb,cAAM,IACJ,OAAO,UAAU,WACb,QACA,OAAO,mBAAmB,KAAK,EAAE,QAAQ,aAAa,EAAE,CAAC;AAC/D,YAAI,OAAO,MAAM,CAAC,EAAG,QAAO;AAC5B,YAAI,OAAO,QAAQ,UAAa,IAAI,OAAO,IAAK,QAAO;AACvD,YAAI,OAAO,QAAQ,UAAa,IAAI,OAAO,IAAK,QAAO;AACvD,eAAO;AAAA,MACT;AAAA,IACA;AAAA,EACF,GAAG;AACH,SAAO,OAAO,UAAU,CAAC,UAAU;AACrC;AAEO,SAAS,kBACd,MACA,SACA,eACA,MACA,cACA,OACA,gBACA,mBAAyC,YACzC,YACK;AACL,QAAM,UAAU,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;AAC5D,QAAM,IAAI,aAAa,KAAK,EAAE,YAAY;AAC1C,QAAM,OAAO,OAAO,MAAM,KAAK,EAAE,YAAY,KAAK;AAClD,QAAM,uBAAuB,2BAA2B,cAAc;AAEtE,MAAI,SAAS,KAAK,OAAO,CAAC,QAAQ;AAChC,eAAW,CAAC,IAAI,MAAM,KAAK,OAAO,QAAQ,aAAa,GAAG;AACxD,UAAI,CAAC,OAAQ;AACb,YAAM,MAAM,QAAQ,IAAI,EAAE;AAC1B,UAAI,CAAC,OAAO,IAAI,WAAW,MAAO;AAClC,UAAI,CAAC,mBAAmB,eAAe,KAAK,GAAG,GAAG,MAAM,EAAG,QAAO;AAAA,IACpE;AAEA,eAAW,QAAQ,sBAAsB;AACvC,YAAM,MAAM,QAAQ,IAAI,KAAK,KAAK;AAClC,UAAI,CAAC,OAAO,CAAC,0BAA0B,eAAe,KAAK,GAAG,GAAG,IAAI,GAAG;AACtE,eAAO;AAAA,MACT;AAAA,IACF;AAEA,QAAI,QAAQ,OAAO;AACjB,YAAM,MAAM,MAAM,UAAU,KAAK,CAAC,OAAO;AACvC,cAAM,MAAM,QAAQ,IAAI,EAAE;AAC1B,YAAI,CAAC,IAAK,QAAO;AACjB,eAAO,mBAAmB,eAAe,KAAK,GAAG,CAAC,EAC/C,YAAY,EACZ,SAAS,IAAI;AAAA,MAClB,CAAC;AACD,UAAI,CAAC,IAAK,QAAO;AAAA,IACnB;AAEA,QAAI,CAAC,EAAG,QAAO;AACf,UAAM,mBAAmB,QACtB;AAAA,MACC,CAAC,QACC,IAAI,WAAW,SAAS,QAAQ,IAAI,eAAe,IAAI,UAAU;AAAA,IACrE,EACC,IAAI,CAAC,QAAQ,mBAAmB,eAAe,KAAK,GAAG,CAAC,CAAC;AAC5D,UAAM,uBAAuB,aAAa,GAAG;AAC7C,QAAI,qBAAsB,kBAAiB,KAAK,oBAAoB;AACpE,QAAI,qBAAqB,YAAY;AACnC,aAAO,iBAAiB;AAAA,QAAK,CAAC,UAC5B,mBAAmB,OAAO,GAAG,UAAU;AAAA,MACzC;AAAA,IACF;AACA,WAAO,mBAAmB,iBAAiB,KAAK,GAAG,GAAG,GAAG,aAAa;AAAA,EACxE,CAAC;AAED,MAAI,MAAM;AACR,UAAM,MAAM,QAAQ,IAAI,KAAK,EAAE;AAC/B,QAAI,OAAO,IAAI,aAAa,OAAO;AACjC,YAAM,MAAM,KAAK,cAAc,QAAQ,IAAI;AAC3C,eAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM;AAClC,cAAM,KAAK,aAAa,GAAG,GAAG;AAC9B,cAAM,KAAK,aAAa,GAAG,GAAG;AAG9B,cAAM,KAAK,MAAM,QAAQ,mBAAmB,EAAE,MAAM;AACpD,cAAM,KAAK,MAAM,QAAQ,mBAAmB,EAAE,MAAM;AACpD,YAAI,OAAO,GAAI,QAAO,KAAK,IAAI;AAC/B,eAAO,cAAc,IAAI,EAAE,IAAI;AAAA,MACjC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,yBAAyB,SAAqC;AAC5E,MAAI,IAAI;AACR,aAAW,KAAK,OAAO,OAAO,OAAO,GAAG;AACtC,QAAI,CAAC,EAAG;AACR,YAAQ,EAAE,MAAM;AAAA,MACd,KAAK;AACH,YAAI,EAAE,MAAM,KAAK,KAAM,EAAE,QAAQ,EAAE,SAAS,WAAa,MAAK;AAC9D;AAAA,MACF,KAAK;AACH,YAAI,EAAE,SAAS,EAAE,OAAO,SAAS,IAAI,EAAE,SAAS,EAAE,UAAU;AAC1D,eAAK;AACP;AAAA,MACF,KAAK;AACH,aAAK;AACL;AAAA,MACF,KAAK;AACH,YAAI,EAAE,QAAQ,UAAa,EAAE,QAAQ,OAAW,MAAK;AACrD;AAAA,IACJ;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,qBACd,QACS;AACT,MAAI,CAAC,OAAQ,QAAO;AACpB,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK;AACH,aACE,OAAO,MAAM,KAAK,EAAE,SAAS,KAC5B,OAAO,SAAS,UAAa,OAAO,SAAS;AAAA,IAElD,KAAK;AACH,aAAO,OAAO,SACV,OAAO,OAAO,SAAS,IACvB,QAAQ,OAAO,KAAK,KAAK,OAAO,UAAU;AAAA,IAChD,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO,OAAO,QAAQ,UAAa,OAAO,QAAQ;AAAA,EACtD;AACF;AAGO,SAAS,cACd,KACA,OACG;AACH,MAAI,CAAC,SAAS,OAAO,KAAK,KAAK,EAAE,WAAW,EAAG,QAAO;AACtD,SAAO,EAAE,GAAG,KAAK,GAAG,MAAM;AAC5B;","names":[]}

package/dist/data-table/filter-engine.d.cts

@@ -24,6 +24,8 @@ declare function tableSearchWords(value: string): string[];
  * `are` matches `we are ready` but never `hardware`.
  */
 declare function matchesTableSearch(searchableText: string, query: string, mode?: TableSearchMatchMode): boolean;
+/** Select filters treat array-valued cells as sets, never as serialized JSON choices. */
+declare function selectCellValues(value: unknown): string[];
 declare function passesColumnFilter(value: unknown, filter: ColumnFilterValue): boolean;
 declare function filterAndSortRows<T>(rows: T[], columns: MatrxColumnDef<T>[], columnFilters: ColumnFiltersState, sort: SortState | null, globalSearch: string, anyOf?: {
     columnIds: string[];
@@ -34,4 +36,4 @@ declare function isColumnFilterActive(filter: ColumnFilterValue | undefined): bo
 /** Apply draft edits onto a row for display (shallow field merge). */
 declare function applyRowEdits<T>(row: T, edits: Record<string, unknown> | undefined): T;
 
-export { SELECT_EMPTY_VALUE, SELECT_NOT_EMPTY_VALUE, applyRowEdits, columnId, countActiveColumnFilters, filterAndSortRows, getCellValue, getFilterValue, getSortValue, isColumnFilterActive, matchesTableSearch, passesColumnFilter, stringifyCellValue, tableSearchWords };
+export { SELECT_EMPTY_VALUE, SELECT_NOT_EMPTY_VALUE, applyRowEdits, columnId, countActiveColumnFilters, filterAndSortRows, getCellValue, getFilterValue, getSortValue, isColumnFilterActive, matchesTableSearch, passesColumnFilter, selectCellValues, stringifyCellValue, tableSearchWords };

package/dist/data-table/filter-engine.d.ts

@@ -24,6 +24,8 @@ declare function tableSearchWords(value: string): string[];
  * `are` matches `we are ready` but never `hardware`.
  */
 declare function matchesTableSearch(searchableText: string, query: string, mode?: TableSearchMatchMode): boolean;
+/** Select filters treat array-valued cells as sets, never as serialized JSON choices. */
+declare function selectCellValues(value: unknown): string[];
 declare function passesColumnFilter(value: unknown, filter: ColumnFilterValue): boolean;
 declare function filterAndSortRows<T>(rows: T[], columns: MatrxColumnDef<T>[], columnFilters: ColumnFiltersState, sort: SortState | null, globalSearch: string, anyOf?: {
     columnIds: string[];
@@ -34,4 +36,4 @@ declare function isColumnFilterActive(filter: ColumnFilterValue | undefined): bo
 /** Apply draft edits onto a row for display (shallow field merge). */
 declare function applyRowEdits<T>(row: T, edits: Record<string, unknown> | undefined): T;
 
-export { SELECT_EMPTY_VALUE, SELECT_NOT_EMPTY_VALUE, applyRowEdits, columnId, countActiveColumnFilters, filterAndSortRows, getCellValue, getFilterValue, getSortValue, isColumnFilterActive, matchesTableSearch, passesColumnFilter, stringifyCellValue, tableSearchWords };
+export { SELECT_EMPTY_VALUE, SELECT_NOT_EMPTY_VALUE, applyRowEdits, columnId, countActiveColumnFilters, filterAndSortRows, getCellValue, getFilterValue, getSortValue, isColumnFilterActive, matchesTableSearch, passesColumnFilter, selectCellValues, stringifyCellValue, tableSearchWords };

package/dist/data-table/filter-engine.js

@@ -144,6 +144,9 @@ function compareValues(a, b) {
     sensitivity: "base"
   });
 }
+function selectCellValues(value) {
+  return (Array.isArray(value) ? value : [value]).map(stringifyCellValue).filter((item) => item !== "");
+}
 function passesColumnFilter(value, filter) {
   const matches = (() => {
     switch (filter.kind) {
@@ -160,9 +163,9 @@ function passesColumnFilter(value, filter) {
       case "select": {
         const selected = filter.values ?? (filter.value && filter.value !== "__all__" ? [filter.value] : []);
         if (selected.length === 0) return true;
-        const s = stringifyCellValue(value);
+        const values = selectCellValues(value);
         return selected.some(
-          (v) => v === SELECT_EMPTY_VALUE ? s === "" : v === SELECT_NOT_EMPTY_VALUE ? s !== "" : s === v
+          (v) => v === SELECT_EMPTY_VALUE ? values.length === 0 : v === SELECT_NOT_EMPTY_VALUE ? values.length > 0 : values.includes(v)
         );
       }
       case "boolean": {
@@ -286,6 +289,7 @@ export {
   isColumnFilterActive,
   matchesTableSearch,
   passesColumnFilter,
+  selectCellValues,
   stringifyCellValue,
   tableSearchWords
 };

package/dist/data-table/filter-engine.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/data-table/layered-filters.ts","../../src/data-table/filter-engine.ts"],"sourcesContent":["/**\n * Shared vocabulary for ordered, AND-combined table filters. The same rule\n * shape is URL-safe, can be evaluated by local tables, and can be handed to a\n * controlled table's server query without a surface inventing another query\n * builder.\n */\n\nimport { z } from \"zod\";\nimport type { ColumnFiltersState } from \"./types\";\n\nexport const LAYERED_FILTER_OPERATORS = [\n  \"contains\",\n  \"not_contains\",\n  \"equals\",\n  \"not_equals\",\n  \"starts_with\",\n  \"ends_with\",\n  \"word\",\n  \"not_word\",\n  \"is_empty\",\n  \"is_not_empty\",\n  \"greater_than\",\n  \"greater_or_equal\",\n  \"less_than\",\n  \"less_or_equal\",\n  \"between\",\n] as const;\n\nexport type LayeredFilterOperator = (typeof LAYERED_FILTER_OPERATORS)[number];\n\nexport interface LayeredFilterRule {\n  id: string;\n  field: string;\n  operator: LayeredFilterOperator;\n  value: string;\n  valueTo?: string | undefined;\n}\n\nexport type LayeredFilterField =\n  | {\n      id: string;\n      label: string;\n      kind: \"text\";\n      operators?: LayeredFilterOperator[];\n    }\n  | {\n      id: string;\n      label: string;\n      kind: \"number\";\n      operators?: LayeredFilterOperator[];\n      placeholder?: string;\n    }\n  | {\n      id: string;\n      label: string;\n      kind: \"select\";\n      operators?: LayeredFilterOperator[];\n      options: Array<{ value: string; label: string }>;\n    };\n\nconst layeredFilterRuleSchema = z.object({\n  id: z.string().min(1),\n  field: z.string().min(1),\n  operator: z.enum(LAYERED_FILTER_OPERATORS),\n  value: z.string(),\n  valueTo: z.string().optional(),\n});\n\nconst layeredFilterRulesSchema = z.array(layeredFilterRuleSchema).max(20);\n\nconst TEXT_OPERATORS: LayeredFilterOperator[] = [\n  \"contains\",\n  \"not_contains\",\n  \"equals\",\n  \"not_equals\",\n  \"starts_with\",\n  \"ends_with\",\n  \"word\",\n  \"not_word\",\n  \"is_empty\",\n  \"is_not_empty\",\n];\n\nconst NUMBER_OPERATORS: LayeredFilterOperator[] = [\n  \"equals\",\n  \"not_equals\",\n  \"greater_than\",\n  \"greater_or_equal\",\n  \"less_than\",\n  \"less_or_equal\",\n  \"between\",\n  \"is_empty\",\n  \"is_not_empty\",\n];\n\nconst SELECT_OPERATORS: LayeredFilterOperator[] = [\n  \"equals\",\n  \"not_equals\",\n  \"is_empty\",\n  \"is_not_empty\",\n];\n\nexport const LAYERED_FILTER_OPERATOR_LABELS: Record<\n  LayeredFilterOperator,\n  string\n> = {\n  contains: \"contains\",\n  not_contains: \"doesn't contain\",\n  equals: \"is\",\n  not_equals: \"is not\",\n  starts_with: \"starts with\",\n  ends_with: \"ends with\",\n  word: \"has the word\",\n  not_word: \"doesn't have the word\",\n  is_empty: \"is empty\",\n  is_not_empty: \"is not empty\",\n  greater_than: \"is greater than\",\n  greater_or_equal: \"is at least\",\n  less_than: \"is less than\",\n  less_or_equal: \"is at most\",\n  between: \"is between\",\n};\n\nexport function operatorsForLayeredField(\n  field: LayeredFilterField,\n): LayeredFilterOperator[] {\n  if (field.operators) return field.operators;\n  if (field.kind === \"number\") return NUMBER_OPERATORS;\n  if (field.kind === \"select\") return SELECT_OPERATORS;\n  return TEXT_OPERATORS;\n}\n\nexport function layeredFilterNeedsValue(\n  operator: LayeredFilterOperator,\n): boolean {\n  return operator !== \"is_empty\" && operator !== \"is_not_empty\";\n}\n\nexport function isCompleteLayeredFilterRule(rule: LayeredFilterRule): boolean {\n  if (!layeredFilterNeedsValue(rule.operator)) return true;\n  if (rule.value.trim() === \"\") return false;\n  return rule.operator !== \"between\" || Boolean(rule.valueTo?.trim());\n}\n\nexport function completeLayeredFilterRules(\n  rules: readonly LayeredFilterRule[] | undefined,\n): LayeredFilterRule[] {\n  return (rules ?? []).filter(isCompleteLayeredFilterRule);\n}\n\nexport function isLayeredFilterOperator(\n  value: string,\n): value is LayeredFilterOperator {\n  return LAYERED_FILTER_OPERATORS.some((operator) => operator === value);\n}\n\n/** Decode URL-owned rules without trusting a hand-edited link. */\nexport function decodeLayeredFilterRules(\n  raw: string | null,\n): LayeredFilterRule[] {\n  if (!raw) return [];\n  try {\n    const parsed: unknown = JSON.parse(raw);\n    const result = layeredFilterRulesSchema.safeParse(parsed);\n    return result.success ? result.data : [];\n  } catch {\n    return [];\n  }\n}\n\n/** Stable compact URL/wire form; rule order is preserved. */\nexport function encodeLayeredFilterRules(\n  rules: readonly LayeredFilterRule[] | undefined,\n): string | null {\n  return rules?.length ? JSON.stringify(rules) : null;\n}\n\n/**\n * Translate ordinary per-column controls into the same ordered rule language\n * used by the advanced builder. Controlled tables can send these rules to one\n * server evaluator instead of rebuilding numeric/text filter semantics.\n * Select filters are intentionally omitted because their multi-select control\n * is OR-combined and should stay in its native query parameter.\n */\nexport function columnFiltersToLayeredRules(\n  filters: ColumnFiltersState,\n  fieldIds: readonly string[],\n): LayeredFilterRule[] {\n  const rules: LayeredFilterRule[] = [];\n  for (const field of fieldIds) {\n    const filter = filters[field];\n    if (!filter) continue;\n\n    if (filter.kind === \"text\") {\n      rules.push({\n        id: `column-${field}`,\n        field,\n        operator:\n          filter.mode === \"empty\"\n            ? \"is_empty\"\n            : filter.mode === \"not_empty\"\n              ? \"is_not_empty\"\n              : \"contains\",\n        value: filter.value,\n      });\n      continue;\n    }\n\n    if (filter.kind === \"number\") {\n      if (filter.min !== undefined && filter.max !== undefined) {\n        rules.push({\n          id: `column-${field}`,\n          field,\n          operator: \"between\",\n          value: String(filter.min),\n          valueTo: String(filter.max),\n        });\n      } else if (filter.min !== undefined) {\n        rules.push({\n          id: `column-${field}`,\n          field,\n          operator: \"greater_or_equal\",\n          value: String(filter.min),\n        });\n      } else if (filter.max !== undefined) {\n        rules.push({\n          id: `column-${field}`,\n          field,\n          operator: \"less_or_equal\",\n          value: String(filter.max),\n        });\n      }\n      continue;\n    }\n\n    if (filter.kind === \"boolean\") {\n      rules.push({\n        id: `column-${field}`,\n        field,\n        operator: \"equals\",\n        value: String(filter.value),\n      });\n    }\n  }\n  return rules;\n}\n\nfunction normalizedText(value: unknown): string {\n  if (value === null || value === undefined) return \"\";\n  return String(value).trim().toLocaleLowerCase();\n}\n\nfunction words(value: string): string[] {\n  return value.split(/[^\\p{L}\\p{N}]+/u).filter(Boolean);\n}\n\n/** Local-table evaluator. Controlled tables send the same rule shape server-side. */\nexport function layeredFilterMatchesValue(\n  value: unknown,\n  rule: LayeredFilterRule,\n): boolean {\n  const actual = normalizedText(value);\n  const expected = rule.value.trim().toLocaleLowerCase();\n  const expectedTo = rule.valueTo?.trim().toLocaleLowerCase() ?? \"\";\n\n  switch (rule.operator) {\n    case \"contains\":\n      return actual.includes(expected);\n    case \"not_contains\":\n      return !actual.includes(expected);\n    case \"equals\":\n      return actual === expected;\n    case \"not_equals\":\n      return actual !== expected;\n    case \"starts_with\":\n      return actual.startsWith(expected);\n    case \"ends_with\":\n      return actual.endsWith(expected);\n    case \"word\":\n      return words(actual).includes(expected);\n    case \"not_word\":\n      return !words(actual).includes(expected);\n    case \"is_empty\":\n      return actual === \"\";\n    case \"is_not_empty\":\n      return actual !== \"\";\n    case \"greater_than\":\n      return Number(actual) > Number(expected);\n    case \"greater_or_equal\":\n      return Number(actual) >= Number(expected);\n    case \"less_than\":\n      return Number(actual) < Number(expected);\n    case \"less_or_equal\":\n      return Number(actual) <= Number(expected);\n    case \"between\": {\n      const numeric = Number(actual);\n      return numeric >= Number(expected) && numeric <= Number(expectedTo);\n    }\n  }\n}\n\nexport function layeredFilterRuleSummary(\n  rule: LayeredFilterRule,\n  fields: readonly LayeredFilterField[],\n): string {\n  const field = fields.find((candidate) => candidate.id === rule.field);\n  const fieldLabel = field?.label ?? rule.field;\n  const operator = LAYERED_FILTER_OPERATOR_LABELS[rule.operator];\n  if (!layeredFilterNeedsValue(rule.operator))\n    return `${fieldLabel} ${operator}`;\n  const selectedLabel =\n    field?.kind === \"select\"\n      ? field.options.find((option) => option.value === rule.value)?.label\n      : undefined;\n  const value = selectedLabel ?? rule.value;\n  return rule.operator === \"between\"\n    ? `${fieldLabel} ${operator} ${value} and ${rule.valueTo ?? \"\"}`\n    : `${fieldLabel} ${operator} ${value}`;\n}\n","import type {\n  ColumnFilterValue,\n  ColumnFiltersState,\n  MatrxColumnDef,\n  SortState,\n  TableSearchMatchMode,\n} from \"./types\";\nimport {\n  completeLayeredFilterRules,\n  layeredFilterMatchesValue,\n  type LayeredFilterRule,\n} from \"./layered-filters\";\n\n/**\n * Sentinel select-filter values for \"no value\" / \"any value\" — every select\n * filter offers them automatically when the column has empty cells, so any\n * table can isolate rows missing a value (or having one) without extra config.\n */\nexport const SELECT_EMPTY_VALUE = \"__empty__\";\nexport const SELECT_NOT_EMPTY_VALUE = \"__not_empty__\";\n\nexport function columnId<T>(col: MatrxColumnDef<T>): string {\n  if (col.id) return col.id;\n  if (col.accessorKey) return String(col.accessorKey);\n  throw new Error(\"MatrxDataTable column requires `id` or `accessorKey`\");\n}\n\nexport function getCellValue<T>(row: T, col: MatrxColumnDef<T>): unknown {\n  if (col.accessorFn) return col.accessorFn(row);\n  if (col.accessorKey) {\n    return (row as Record<string, unknown>)[col.accessorKey];\n  }\n  return undefined;\n}\n\nexport function getFilterValue<T>(row: T, col: MatrxColumnDef<T>): unknown {\n  return col.filterValue ? col.filterValue(row) : getCellValue(row, col);\n}\n\nexport function getSortValue<T>(row: T, col: MatrxColumnDef<T>): unknown {\n  return col.sortValue ? col.sortValue(row) : getCellValue(row, col);\n}\n\nexport function stringifyCellValue(value: unknown): string {\n  if (value == null) return \"\";\n  if (typeof value === \"string\") return value;\n  if (typeof value === \"number\" || typeof value === \"boolean\") {\n    return String(value);\n  }\n  if (value instanceof Date) return value.toISOString();\n  try {\n    return JSON.stringify(value);\n  } catch {\n    return String(value);\n  }\n}\n\n/** Unicode-aware tokenization shared by whole-word table search. */\nexport function tableSearchWords(value: string): string[] {\n  return value\n    .toLocaleLowerCase()\n    .split(/[^\\p{L}\\p{N}]+/u)\n    .filter(Boolean);\n}\n\n/**\n * Match the primary table search against one row's searchable text. In\n * whole-word mode every entered word must exist as a complete token, so\n * `are` matches `we are ready` but never `hardware`.\n */\nexport function matchesTableSearch(\n  searchableText: string,\n  query: string,\n  mode: TableSearchMatchMode = \"contains\",\n): boolean {\n  const normalizedQuery = query.trim().toLocaleLowerCase();\n  if (!normalizedQuery) return true;\n  if (mode === \"contains\") {\n    return searchableText.toLocaleLowerCase().includes(normalizedQuery);\n  }\n  const actualWords = new Set(tableSearchWords(searchableText));\n  const expectedWords = tableSearchWords(normalizedQuery);\n  return (\n    expectedWords.length > 0 &&\n    expectedWords.every((word) => actualWords.has(word))\n  );\n}\n\nfunction compareValues(a: unknown, b: unknown): number {\n  if (a == null && b == null) return 0;\n  if (a == null) return -1;\n  if (b == null) return 1;\n  if (typeof a === \"number\" && typeof b === \"number\") return a - b;\n  if (typeof a === \"boolean\" && typeof b === \"boolean\") {\n    return Number(a) - Number(b);\n  }\n  return stringifyCellValue(a).localeCompare(stringifyCellValue(b), undefined, {\n    numeric: true,\n    sensitivity: \"base\",\n  });\n}\n\nexport function passesColumnFilter(\n  value: unknown,\n  filter: ColumnFilterValue,\n): boolean {\n  const matches = (() => {\n    switch (filter.kind) {\n    case \"text\": {\n      const s = stringifyCellValue(value);\n      if (filter.mode === \"null\") return value == null;\n      if (filter.mode === \"not_null\") return value != null;\n      if (filter.mode === \"empty\") return s.trim() === \"\";\n      if (filter.mode === \"not_empty\") return s.trim() !== \"\";\n      const q = filter.value.trim().toLowerCase();\n      if (!q) return true;\n      return s.toLowerCase().includes(q);\n    }\n    case \"select\": {\n      const selected =\n        filter.values ??\n        (filter.value && filter.value !== \"__all__\" ? [filter.value] : []);\n      if (selected.length === 0) return true;\n      const s = stringifyCellValue(value);\n      // OR semantics across the set; sentinels compose (\"A or (empty)\").\n      return selected.some((v) =>\n        v === SELECT_EMPTY_VALUE\n          ? s === \"\"\n          : v === SELECT_NOT_EMPTY_VALUE\n            ? s !== \"\"\n            : s === v,\n      );\n    }\n    case \"boolean\": {\n      return Boolean(value) === filter.value;\n    }\n    case \"number\": {\n      const n =\n        typeof value === \"number\"\n          ? value\n          : Number(stringifyCellValue(value).replace(/[^0-9.-]/g, \"\"));\n      if (Number.isNaN(n)) return false;\n      if (filter.min !== undefined && n < filter.min) return false;\n      if (filter.max !== undefined && n > filter.max) return false;\n      return true;\n    }\n    }\n  })();\n  return filter.negated ? !matches : matches;\n}\n\nexport function filterAndSortRows<T>(\n  rows: T[],\n  columns: MatrxColumnDef<T>[],\n  columnFilters: ColumnFiltersState,\n  sort: SortState | null,\n  globalSearch: string,\n  anyOf?: { columnIds: string[]; query: string },\n  layeredFilters?: readonly LayeredFilterRule[],\n  globalSearchMode: TableSearchMatchMode = \"contains\",\n  searchText?: (row: T) => string,\n): T[] {\n  const colById = new Map(columns.map((c) => [columnId(c), c]));\n  const q = globalSearch.trim().toLowerCase();\n  const anyQ = anyOf?.query.trim().toLowerCase() ?? \"\";\n  const activeLayeredFilters = completeLayeredFilterRules(layeredFilters);\n\n  let result = rows.filter((row) => {\n    for (const [id, filter] of Object.entries(columnFilters)) {\n      if (!filter) continue;\n      const col = colById.get(id);\n      if (!col || col.filter === false) continue;\n      if (!passesColumnFilter(getFilterValue(row, col), filter)) return false;\n    }\n\n    for (const rule of activeLayeredFilters) {\n      const col = colById.get(rule.field);\n      if (!col || !layeredFilterMatchesValue(getFilterValue(row, col), rule)) {\n        return false;\n      }\n    }\n\n    if (anyQ && anyOf) {\n      const hit = anyOf.columnIds.some((id) => {\n        const col = colById.get(id);\n        if (!col) return false;\n        return stringifyCellValue(getFilterValue(row, col))\n          .toLowerCase()\n          .includes(anyQ);\n      });\n      if (!hit) return false;\n    }\n\n    if (!q) return true;\n    const searchableValues = columns\n      .filter(\n        (col) =>\n          col.filter !== false || Boolean(col.accessorKey || col.accessorFn),\n      )\n      .map((col) => stringifyCellValue(getFilterValue(row, col)));\n    const additionalSearchText = searchText?.(row);\n    if (additionalSearchText) searchableValues.push(additionalSearchText);\n    if (globalSearchMode === \"contains\") {\n      return searchableValues.some((value) =>\n        matchesTableSearch(value, q, \"contains\"),\n      );\n    }\n    return matchesTableSearch(searchableValues.join(\" \"), q, \"whole_words\");\n  });\n\n  if (sort) {\n    const col = colById.get(sort.id);\n    if (col && col.sortable !== false) {\n      const dir = sort.direction === \"asc\" ? 1 : -1;\n      result = [...result].sort((a, b) => {\n        const va = getSortValue(a, col);\n        const vb = getSortValue(b, col);\n        // Empty cells (null / \"\") sort LAST in both directions — sorting a\n        // column should surface its values, never a wall of blanks.\n        const ea = va == null || stringifyCellValue(va) === \"\";\n        const eb = vb == null || stringifyCellValue(vb) === \"\";\n        if (ea !== eb) return ea ? 1 : -1;\n        return compareValues(va, vb) * dir;\n      });\n    }\n  }\n\n  return result;\n}\n\nexport function countActiveColumnFilters(filters: ColumnFiltersState): number {\n  let n = 0;\n  for (const f of Object.values(filters)) {\n    if (!f) continue;\n    switch (f.kind) {\n      case \"text\":\n        if (f.value.trim() || (f.mode && f.mode !== \"contains\")) n += 1;\n        break;\n      case \"select\":\n        if (f.values ? f.values.length > 0 : f.value && f.value !== \"__all__\")\n          n += 1;\n        break;\n      case \"boolean\":\n        n += 1;\n        break;\n      case \"number\":\n        if (f.min !== undefined || f.max !== undefined) n += 1;\n        break;\n    }\n  }\n  return n;\n}\n\nexport function isColumnFilterActive(\n  filter: ColumnFilterValue | undefined,\n): boolean {\n  if (!filter) return false;\n  switch (filter.kind) {\n    case \"text\":\n      return (\n        filter.value.trim().length > 0 ||\n        (filter.mode !== undefined && filter.mode !== \"contains\")\n      );\n    case \"select\":\n      return filter.values\n        ? filter.values.length > 0\n        : Boolean(filter.value) && filter.value !== \"__all__\";\n    case \"boolean\":\n      return true;\n    case \"number\":\n      return filter.min !== undefined || filter.max !== undefined;\n  }\n}\n\n/** Apply draft edits onto a row for display (shallow field merge). */\nexport function applyRowEdits<T>(\n  row: T,\n  edits: Record<string, unknown> | undefined,\n): T {\n  if (!edits || Object.keys(edits).length === 0) return row;\n  return { ...row, ...edits };\n}\n"],"mappings":";;AAOA,SAAS,SAAS;AAGX,IAAM,2BAA2B;AAAA,EACtC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAkCA,IAAM,0BAA0B,EAAE,OAAO;AAAA,EACvC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACpB,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACvB,UAAU,EAAE,KAAK,wBAAwB;AAAA,EACzC,OAAO,EAAE,OAAO;AAAA,EAChB,SAAS,EAAE,OAAO,EAAE,SAAS;AAC/B,CAAC;AAED,IAAM,2BAA2B,EAAE,MAAM,uBAAuB,EAAE,IAAI,EAAE;AAgEjE,SAAS,wBACd,UACS;AACT,SAAO,aAAa,cAAc,aAAa;AACjD;AAEO,SAAS,4BAA4B,MAAkC;AAC5E,MAAI,CAAC,wBAAwB,KAAK,QAAQ,EAAG,QAAO;AACpD,MAAI,KAAK,MAAM,KAAK,MAAM,GAAI,QAAO;AACrC,SAAO,KAAK,aAAa,aAAa,QAAQ,KAAK,SAAS,KAAK,CAAC;AACpE;AAEO,SAAS,2BACd,OACqB;AACrB,UAAQ,SAAS,CAAC,GAAG,OAAO,2BAA2B;AACzD;AAmGA,SAAS,eAAe,OAAwB;AAC9C,MAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,SAAO,OAAO,KAAK,EAAE,KAAK,EAAE,kBAAkB;AAChD;AAEA,SAAS,MAAM,OAAyB;AACtC,SAAO,MAAM,MAAM,iBAAiB,EAAE,OAAO,OAAO;AACtD;AAGO,SAAS,0BACd,OACA,MACS;AACT,QAAM,SAAS,eAAe,KAAK;AACnC,QAAM,WAAW,KAAK,MAAM,KAAK,EAAE,kBAAkB;AACrD,QAAM,aAAa,KAAK,SAAS,KAAK,EAAE,kBAAkB,KAAK;AAE/D,UAAQ,KAAK,UAAU;AAAA,IACrB,KAAK;AACH,aAAO,OAAO,SAAS,QAAQ;AAAA,IACjC,KAAK;AACH,aAAO,CAAC,OAAO,SAAS,QAAQ;AAAA,IAClC,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,OAAO,WAAW,QAAQ;AAAA,IACnC,KAAK;AACH,aAAO,OAAO,SAAS,QAAQ;AAAA,IACjC,KAAK;AACH,aAAO,MAAM,MAAM,EAAE,SAAS,QAAQ;AAAA,IACxC,KAAK;AACH,aAAO,CAAC,MAAM,MAAM,EAAE,SAAS,QAAQ;AAAA,IACzC,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,OAAO,MAAM,IAAI,OAAO,QAAQ;AAAA,IACzC,KAAK;AACH,aAAO,OAAO,MAAM,KAAK,OAAO,QAAQ;AAAA,IAC1C,KAAK;AACH,aAAO,OAAO,MAAM,IAAI,OAAO,QAAQ;AAAA,IACzC,KAAK;AACH,aAAO,OAAO,MAAM,KAAK,OAAO,QAAQ;AAAA,IAC1C,KAAK,WAAW;AACd,YAAM,UAAU,OAAO,MAAM;AAC7B,aAAO,WAAW,OAAO,QAAQ,KAAK,WAAW,OAAO,UAAU;AAAA,IACpE;AAAA,EACF;AACF;;;ACzRO,IAAM,qBAAqB;AAC3B,IAAM,yBAAyB;AAE/B,SAAS,SAAY,KAAgC;AAC1D,MAAI,IAAI,GAAI,QAAO,IAAI;AACvB,MAAI,IAAI,YAAa,QAAO,OAAO,IAAI,WAAW;AAClD,QAAM,IAAI,MAAM,sDAAsD;AACxE;AAEO,SAAS,aAAgB,KAAQ,KAAiC;AACvE,MAAI,IAAI,WAAY,QAAO,IAAI,WAAW,GAAG;AAC7C,MAAI,IAAI,aAAa;AACnB,WAAQ,IAAgC,IAAI,WAAW;AAAA,EACzD;AACA,SAAO;AACT;AAEO,SAAS,eAAkB,KAAQ,KAAiC;AACzE,SAAO,IAAI,cAAc,IAAI,YAAY,GAAG,IAAI,aAAa,KAAK,GAAG;AACvE;AAEO,SAAS,aAAgB,KAAQ,KAAiC;AACvE,SAAO,IAAI,YAAY,IAAI,UAAU,GAAG,IAAI,aAAa,KAAK,GAAG;AACnE;AAEO,SAAS,mBAAmB,OAAwB;AACzD,MAAI,SAAS,KAAM,QAAO;AAC1B,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;AAC3D,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,MAAI,iBAAiB,KAAM,QAAO,MAAM,YAAY;AACpD,MAAI;AACF,WAAO,KAAK,UAAU,KAAK;AAAA,EAC7B,QAAQ;AACN,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;AAGO,SAAS,iBAAiB,OAAyB;AACxD,SAAO,MACJ,kBAAkB,EAClB,MAAM,iBAAiB,EACvB,OAAO,OAAO;AACnB;AAOO,SAAS,mBACd,gBACA,OACA,OAA6B,YACpB;AACT,QAAM,kBAAkB,MAAM,KAAK,EAAE,kBAAkB;AACvD,MAAI,CAAC,gBAAiB,QAAO;AAC7B,MAAI,SAAS,YAAY;AACvB,WAAO,eAAe,kBAAkB,EAAE,SAAS,eAAe;AAAA,EACpE;AACA,QAAM,cAAc,IAAI,IAAI,iBAAiB,cAAc,CAAC;AAC5D,QAAM,gBAAgB,iBAAiB,eAAe;AACtD,SACE,cAAc,SAAS,KACvB,cAAc,MAAM,CAAC,SAAS,YAAY,IAAI,IAAI,CAAC;AAEvD;AAEA,SAAS,cAAc,GAAY,GAAoB;AACrD,MAAI,KAAK,QAAQ,KAAK,KAAM,QAAO;AACnC,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI;AAC/D,MAAI,OAAO,MAAM,aAAa,OAAO,MAAM,WAAW;AACpD,WAAO,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,EAC7B;AACA,SAAO,mBAAmB,CAAC,EAAE,cAAc,mBAAmB,CAAC,GAAG,QAAW;AAAA,IAC3E,SAAS;AAAA,IACT,aAAa;AAAA,EACf,CAAC;AACH;AAEO,SAAS,mBACd,OACA,QACS;AACT,QAAM,WAAW,MAAM;AACrB,YAAQ,OAAO,MAAM;AAAA,MACrB,KAAK,QAAQ;AACX,cAAM,IAAI,mBAAmB,KAAK;AAClC,YAAI,OAAO,SAAS,OAAQ,QAAO,SAAS;AAC5C,YAAI,OAAO,SAAS,WAAY,QAAO,SAAS;AAChD,YAAI,OAAO,SAAS,QAAS,QAAO,EAAE,KAAK,MAAM;AACjD,YAAI,OAAO,SAAS,YAAa,QAAO,EAAE,KAAK,MAAM;AACrD,cAAM,IAAI,OAAO,MAAM,KAAK,EAAE,YAAY;AAC1C,YAAI,CAAC,EAAG,QAAO;AACf,eAAO,EAAE,YAAY,EAAE,SAAS,CAAC;AAAA,MACnC;AAAA,MACA,KAAK,UAAU;AACb,cAAM,WACJ,OAAO,WACN,OAAO,SAAS,OAAO,UAAU,YAAY,CAAC,OAAO,KAAK,IAAI,CAAC;AAClE,YAAI,SAAS,WAAW,EAAG,QAAO;AAClC,cAAM,IAAI,mBAAmB,KAAK;AAElC,eAAO,SAAS;AAAA,UAAK,CAAC,MACpB,MAAM,qBACF,MAAM,KACN,MAAM,yBACJ,MAAM,KACN,MAAM;AAAA,QACd;AAAA,MACF;AAAA,MACA,KAAK,WAAW;AACd,eAAO,QAAQ,KAAK,MAAM,OAAO;AAAA,MACnC;AAAA,MACA,KAAK,UAAU;AACb,cAAM,IACJ,OAAO,UAAU,WACb,QACA,OAAO,mBAAmB,KAAK,EAAE,QAAQ,aAAa,EAAE,CAAC;AAC/D,YAAI,OAAO,MAAM,CAAC,EAAG,QAAO;AAC5B,YAAI,OAAO,QAAQ,UAAa,IAAI,OAAO,IAAK,QAAO;AACvD,YAAI,OAAO,QAAQ,UAAa,IAAI,OAAO,IAAK,QAAO;AACvD,eAAO;AAAA,MACT;AAAA,IACA;AAAA,EACF,GAAG;AACH,SAAO,OAAO,UAAU,CAAC,UAAU;AACrC;AAEO,SAAS,kBACd,MACA,SACA,eACA,MACA,cACA,OACA,gBACA,mBAAyC,YACzC,YACK;AACL,QAAM,UAAU,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;AAC5D,QAAM,IAAI,aAAa,KAAK,EAAE,YAAY;AAC1C,QAAM,OAAO,OAAO,MAAM,KAAK,EAAE,YAAY,KAAK;AAClD,QAAM,uBAAuB,2BAA2B,cAAc;AAEtE,MAAI,SAAS,KAAK,OAAO,CAAC,QAAQ;AAChC,eAAW,CAAC,IAAI,MAAM,KAAK,OAAO,QAAQ,aAAa,GAAG;AACxD,UAAI,CAAC,OAAQ;AACb,YAAM,MAAM,QAAQ,IAAI,EAAE;AAC1B,UAAI,CAAC,OAAO,IAAI,WAAW,MAAO;AAClC,UAAI,CAAC,mBAAmB,eAAe,KAAK,GAAG,GAAG,MAAM,EAAG,QAAO;AAAA,IACpE;AAEA,eAAW,QAAQ,sBAAsB;AACvC,YAAM,MAAM,QAAQ,IAAI,KAAK,KAAK;AAClC,UAAI,CAAC,OAAO,CAAC,0BAA0B,eAAe,KAAK,GAAG,GAAG,IAAI,GAAG;AACtE,eAAO;AAAA,MACT;AAAA,IACF;AAEA,QAAI,QAAQ,OAAO;AACjB,YAAM,MAAM,MAAM,UAAU,KAAK,CAAC,OAAO;AACvC,cAAM,MAAM,QAAQ,IAAI,EAAE;AAC1B,YAAI,CAAC,IAAK,QAAO;AACjB,eAAO,mBAAmB,eAAe,KAAK,GAAG,CAAC,EAC/C,YAAY,EACZ,SAAS,IAAI;AAAA,MAClB,CAAC;AACD,UAAI,CAAC,IAAK,QAAO;AAAA,IACnB;AAEA,QAAI,CAAC,EAAG,QAAO;AACf,UAAM,mBAAmB,QACtB;AAAA,MACC,CAAC,QACC,IAAI,WAAW,SAAS,QAAQ,IAAI,eAAe,IAAI,UAAU;AAAA,IACrE,EACC,IAAI,CAAC,QAAQ,mBAAmB,eAAe,KAAK,GAAG,CAAC,CAAC;AAC5D,UAAM,uBAAuB,aAAa,GAAG;AAC7C,QAAI,qBAAsB,kBAAiB,KAAK,oBAAoB;AACpE,QAAI,qBAAqB,YAAY;AACnC,aAAO,iBAAiB;AAAA,QAAK,CAAC,UAC5B,mBAAmB,OAAO,GAAG,UAAU;AAAA,MACzC;AAAA,IACF;AACA,WAAO,mBAAmB,iBAAiB,KAAK,GAAG,GAAG,GAAG,aAAa;AAAA,EACxE,CAAC;AAED,MAAI,MAAM;AACR,UAAM,MAAM,QAAQ,IAAI,KAAK,EAAE;AAC/B,QAAI,OAAO,IAAI,aAAa,OAAO;AACjC,YAAM,MAAM,KAAK,cAAc,QAAQ,IAAI;AAC3C,eAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM;AAClC,cAAM,KAAK,aAAa,GAAG,GAAG;AAC9B,cAAM,KAAK,aAAa,GAAG,GAAG;AAG9B,cAAM,KAAK,MAAM,QAAQ,mBAAmB,EAAE,MAAM;AACpD,cAAM,KAAK,MAAM,QAAQ,mBAAmB,EAAE,MAAM;AACpD,YAAI,OAAO,GAAI,QAAO,KAAK,IAAI;AAC/B,eAAO,cAAc,IAAI,EAAE,IAAI;AAAA,MACjC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,yBAAyB,SAAqC;AAC5E,MAAI,IAAI;AACR,aAAW,KAAK,OAAO,OAAO,OAAO,GAAG;AACtC,QAAI,CAAC,EAAG;AACR,YAAQ,EAAE,MAAM;AAAA,MACd,KAAK;AACH,YAAI,EAAE,MAAM,KAAK,KAAM,EAAE,QAAQ,EAAE,SAAS,WAAa,MAAK;AAC9D;AAAA,MACF,KAAK;AACH,YAAI,EAAE,SAAS,EAAE,OAAO,SAAS,IAAI,EAAE,SAAS,EAAE,UAAU;AAC1D,eAAK;AACP;AAAA,MACF,KAAK;AACH,aAAK;AACL;AAAA,MACF,KAAK;AACH,YAAI,EAAE,QAAQ,UAAa,EAAE,QAAQ,OAAW,MAAK;AACrD;AAAA,IACJ;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,qBACd,QACS;AACT,MAAI,CAAC,OAAQ,QAAO;AACpB,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK;AACH,aACE,OAAO,MAAM,KAAK,EAAE,SAAS,KAC5B,OAAO,SAAS,UAAa,OAAO,SAAS;AAAA,IAElD,KAAK;AACH,aAAO,OAAO,SACV,OAAO,OAAO,SAAS,IACvB,QAAQ,OAAO,KAAK,KAAK,OAAO,UAAU;AAAA,IAChD,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO,OAAO,QAAQ,UAAa,OAAO,QAAQ;AAAA,EACtD;AACF;AAGO,SAAS,cACd,KACA,OACG;AACH,MAAI,CAAC,SAAS,OAAO,KAAK,KAAK,EAAE,WAAW,EAAG,QAAO;AACtD,SAAO,EAAE,GAAG,KAAK,GAAG,MAAM;AAC5B;","names":[]}
+{"version":3,"sources":["../../src/data-table/layered-filters.ts","../../src/data-table/filter-engine.ts"],"sourcesContent":["/**\n * Shared vocabulary for ordered, AND-combined table filters. The same rule\n * shape is URL-safe, can be evaluated by local tables, and can be handed to a\n * controlled table's server query without a surface inventing another query\n * builder.\n */\n\nimport { z } from \"zod\";\nimport type { ColumnFiltersState } from \"./types\";\n\nexport const LAYERED_FILTER_OPERATORS = [\n  \"contains\",\n  \"not_contains\",\n  \"equals\",\n  \"not_equals\",\n  \"starts_with\",\n  \"ends_with\",\n  \"word\",\n  \"not_word\",\n  \"is_empty\",\n  \"is_not_empty\",\n  \"greater_than\",\n  \"greater_or_equal\",\n  \"less_than\",\n  \"less_or_equal\",\n  \"between\",\n] as const;\n\nexport type LayeredFilterOperator = (typeof LAYERED_FILTER_OPERATORS)[number];\n\nexport interface LayeredFilterRule {\n  id: string;\n  field: string;\n  operator: LayeredFilterOperator;\n  value: string;\n  valueTo?: string | undefined;\n}\n\nexport type LayeredFilterField =\n  | {\n      id: string;\n      label: string;\n      kind: \"text\";\n      operators?: LayeredFilterOperator[];\n    }\n  | {\n      id: string;\n      label: string;\n      kind: \"number\";\n      operators?: LayeredFilterOperator[];\n      placeholder?: string;\n    }\n  | {\n      id: string;\n      label: string;\n      kind: \"select\";\n      operators?: LayeredFilterOperator[];\n      options: Array<{ value: string; label: string }>;\n    };\n\nconst layeredFilterRuleSchema = z.object({\n  id: z.string().min(1),\n  field: z.string().min(1),\n  operator: z.enum(LAYERED_FILTER_OPERATORS),\n  value: z.string(),\n  valueTo: z.string().optional(),\n});\n\nconst layeredFilterRulesSchema = z.array(layeredFilterRuleSchema).max(20);\n\nconst TEXT_OPERATORS: LayeredFilterOperator[] = [\n  \"contains\",\n  \"not_contains\",\n  \"equals\",\n  \"not_equals\",\n  \"starts_with\",\n  \"ends_with\",\n  \"word\",\n  \"not_word\",\n  \"is_empty\",\n  \"is_not_empty\",\n];\n\nconst NUMBER_OPERATORS: LayeredFilterOperator[] = [\n  \"equals\",\n  \"not_equals\",\n  \"greater_than\",\n  \"greater_or_equal\",\n  \"less_than\",\n  \"less_or_equal\",\n  \"between\",\n  \"is_empty\",\n  \"is_not_empty\",\n];\n\nconst SELECT_OPERATORS: LayeredFilterOperator[] = [\n  \"equals\",\n  \"not_equals\",\n  \"is_empty\",\n  \"is_not_empty\",\n];\n\nexport const LAYERED_FILTER_OPERATOR_LABELS: Record<\n  LayeredFilterOperator,\n  string\n> = {\n  contains: \"contains\",\n  not_contains: \"doesn't contain\",\n  equals: \"is\",\n  not_equals: \"is not\",\n  starts_with: \"starts with\",\n  ends_with: \"ends with\",\n  word: \"has the word\",\n  not_word: \"doesn't have the word\",\n  is_empty: \"is empty\",\n  is_not_empty: \"is not empty\",\n  greater_than: \"is greater than\",\n  greater_or_equal: \"is at least\",\n  less_than: \"is less than\",\n  less_or_equal: \"is at most\",\n  between: \"is between\",\n};\n\nexport function operatorsForLayeredField(\n  field: LayeredFilterField,\n): LayeredFilterOperator[] {\n  if (field.operators) return field.operators;\n  if (field.kind === \"number\") return NUMBER_OPERATORS;\n  if (field.kind === \"select\") return SELECT_OPERATORS;\n  return TEXT_OPERATORS;\n}\n\nexport function layeredFilterNeedsValue(\n  operator: LayeredFilterOperator,\n): boolean {\n  return operator !== \"is_empty\" && operator !== \"is_not_empty\";\n}\n\nexport function isCompleteLayeredFilterRule(rule: LayeredFilterRule): boolean {\n  if (!layeredFilterNeedsValue(rule.operator)) return true;\n  if (rule.value.trim() === \"\") return false;\n  return rule.operator !== \"between\" || Boolean(rule.valueTo?.trim());\n}\n\nexport function completeLayeredFilterRules(\n  rules: readonly LayeredFilterRule[] | undefined,\n): LayeredFilterRule[] {\n  return (rules ?? []).filter(isCompleteLayeredFilterRule);\n}\n\nexport function isLayeredFilterOperator(\n  value: string,\n): value is LayeredFilterOperator {\n  return LAYERED_FILTER_OPERATORS.some((operator) => operator === value);\n}\n\n/** Decode URL-owned rules without trusting a hand-edited link. */\nexport function decodeLayeredFilterRules(\n  raw: string | null,\n): LayeredFilterRule[] {\n  if (!raw) return [];\n  try {\n    const parsed: unknown = JSON.parse(raw);\n    const result = layeredFilterRulesSchema.safeParse(parsed);\n    return result.success ? result.data : [];\n  } catch {\n    return [];\n  }\n}\n\n/** Stable compact URL/wire form; rule order is preserved. */\nexport function encodeLayeredFilterRules(\n  rules: readonly LayeredFilterRule[] | undefined,\n): string | null {\n  return rules?.length ? JSON.stringify(rules) : null;\n}\n\n/**\n * Translate ordinary per-column controls into the same ordered rule language\n * used by the advanced builder. Controlled tables can send these rules to one\n * server evaluator instead of rebuilding numeric/text filter semantics.\n * Select filters are intentionally omitted because their multi-select control\n * is OR-combined and should stay in its native query parameter.\n */\nexport function columnFiltersToLayeredRules(\n  filters: ColumnFiltersState,\n  fieldIds: readonly string[],\n): LayeredFilterRule[] {\n  const rules: LayeredFilterRule[] = [];\n  for (const field of fieldIds) {\n    const filter = filters[field];\n    if (!filter) continue;\n\n    if (filter.kind === \"text\") {\n      rules.push({\n        id: `column-${field}`,\n        field,\n        operator:\n          filter.mode === \"empty\"\n            ? \"is_empty\"\n            : filter.mode === \"not_empty\"\n              ? \"is_not_empty\"\n              : \"contains\",\n        value: filter.value,\n      });\n      continue;\n    }\n\n    if (filter.kind === \"number\") {\n      if (filter.min !== undefined && filter.max !== undefined) {\n        rules.push({\n          id: `column-${field}`,\n          field,\n          operator: \"between\",\n          value: String(filter.min),\n          valueTo: String(filter.max),\n        });\n      } else if (filter.min !== undefined) {\n        rules.push({\n          id: `column-${field}`,\n          field,\n          operator: \"greater_or_equal\",\n          value: String(filter.min),\n        });\n      } else if (filter.max !== undefined) {\n        rules.push({\n          id: `column-${field}`,\n          field,\n          operator: \"less_or_equal\",\n          value: String(filter.max),\n        });\n      }\n      continue;\n    }\n\n    if (filter.kind === \"boolean\") {\n      rules.push({\n        id: `column-${field}`,\n        field,\n        operator: \"equals\",\n        value: String(filter.value),\n      });\n    }\n  }\n  return rules;\n}\n\nfunction normalizedText(value: unknown): string {\n  if (value === null || value === undefined) return \"\";\n  return String(value).trim().toLocaleLowerCase();\n}\n\nfunction words(value: string): string[] {\n  return value.split(/[^\\p{L}\\p{N}]+/u).filter(Boolean);\n}\n\n/** Local-table evaluator. Controlled tables send the same rule shape server-side. */\nexport function layeredFilterMatchesValue(\n  value: unknown,\n  rule: LayeredFilterRule,\n): boolean {\n  const actual = normalizedText(value);\n  const expected = rule.value.trim().toLocaleLowerCase();\n  const expectedTo = rule.valueTo?.trim().toLocaleLowerCase() ?? \"\";\n\n  switch (rule.operator) {\n    case \"contains\":\n      return actual.includes(expected);\n    case \"not_contains\":\n      return !actual.includes(expected);\n    case \"equals\":\n      return actual === expected;\n    case \"not_equals\":\n      return actual !== expected;\n    case \"starts_with\":\n      return actual.startsWith(expected);\n    case \"ends_with\":\n      return actual.endsWith(expected);\n    case \"word\":\n      return words(actual).includes(expected);\n    case \"not_word\":\n      return !words(actual).includes(expected);\n    case \"is_empty\":\n      return actual === \"\";\n    case \"is_not_empty\":\n      return actual !== \"\";\n    case \"greater_than\":\n      return Number(actual) > Number(expected);\n    case \"greater_or_equal\":\n      return Number(actual) >= Number(expected);\n    case \"less_than\":\n      return Number(actual) < Number(expected);\n    case \"less_or_equal\":\n      return Number(actual) <= Number(expected);\n    case \"between\": {\n      const numeric = Number(actual);\n      return numeric >= Number(expected) && numeric <= Number(expectedTo);\n    }\n  }\n}\n\nexport function layeredFilterRuleSummary(\n  rule: LayeredFilterRule,\n  fields: readonly LayeredFilterField[],\n): string {\n  const field = fields.find((candidate) => candidate.id === rule.field);\n  const fieldLabel = field?.label ?? rule.field;\n  const operator = LAYERED_FILTER_OPERATOR_LABELS[rule.operator];\n  if (!layeredFilterNeedsValue(rule.operator))\n    return `${fieldLabel} ${operator}`;\n  const selectedLabel =\n    field?.kind === \"select\"\n      ? field.options.find((option) => option.value === rule.value)?.label\n      : undefined;\n  const value = selectedLabel ?? rule.value;\n  return rule.operator === \"between\"\n    ? `${fieldLabel} ${operator} ${value} and ${rule.valueTo ?? \"\"}`\n    : `${fieldLabel} ${operator} ${value}`;\n}\n","import type {\n  ColumnFilterValue,\n  ColumnFiltersState,\n  MatrxColumnDef,\n  SortState,\n  TableSearchMatchMode,\n} from \"./types\";\nimport {\n  completeLayeredFilterRules,\n  layeredFilterMatchesValue,\n  type LayeredFilterRule,\n} from \"./layered-filters\";\n\n/**\n * Sentinel select-filter values for \"no value\" / \"any value\" — every select\n * filter offers them automatically when the column has empty cells, so any\n * table can isolate rows missing a value (or having one) without extra config.\n */\nexport const SELECT_EMPTY_VALUE = \"__empty__\";\nexport const SELECT_NOT_EMPTY_VALUE = \"__not_empty__\";\n\nexport function columnId<T>(col: MatrxColumnDef<T>): string {\n  if (col.id) return col.id;\n  if (col.accessorKey) return String(col.accessorKey);\n  throw new Error(\"MatrxDataTable column requires `id` or `accessorKey`\");\n}\n\nexport function getCellValue<T>(row: T, col: MatrxColumnDef<T>): unknown {\n  if (col.accessorFn) return col.accessorFn(row);\n  if (col.accessorKey) {\n    return (row as Record<string, unknown>)[col.accessorKey];\n  }\n  return undefined;\n}\n\nexport function getFilterValue<T>(row: T, col: MatrxColumnDef<T>): unknown {\n  return col.filterValue ? col.filterValue(row) : getCellValue(row, col);\n}\n\nexport function getSortValue<T>(row: T, col: MatrxColumnDef<T>): unknown {\n  return col.sortValue ? col.sortValue(row) : getCellValue(row, col);\n}\n\nexport function stringifyCellValue(value: unknown): string {\n  if (value == null) return \"\";\n  if (typeof value === \"string\") return value;\n  if (typeof value === \"number\" || typeof value === \"boolean\") {\n    return String(value);\n  }\n  if (value instanceof Date) return value.toISOString();\n  try {\n    return JSON.stringify(value);\n  } catch {\n    return String(value);\n  }\n}\n\n/** Unicode-aware tokenization shared by whole-word table search. */\nexport function tableSearchWords(value: string): string[] {\n  return value\n    .toLocaleLowerCase()\n    .split(/[^\\p{L}\\p{N}]+/u)\n    .filter(Boolean);\n}\n\n/**\n * Match the primary table search against one row's searchable text. In\n * whole-word mode every entered word must exist as a complete token, so\n * `are` matches `we are ready` but never `hardware`.\n */\nexport function matchesTableSearch(\n  searchableText: string,\n  query: string,\n  mode: TableSearchMatchMode = \"contains\",\n): boolean {\n  const normalizedQuery = query.trim().toLocaleLowerCase();\n  if (!normalizedQuery) return true;\n  if (mode === \"contains\") {\n    return searchableText.toLocaleLowerCase().includes(normalizedQuery);\n  }\n  const actualWords = new Set(tableSearchWords(searchableText));\n  const expectedWords = tableSearchWords(normalizedQuery);\n  return (\n    expectedWords.length > 0 &&\n    expectedWords.every((word) => actualWords.has(word))\n  );\n}\n\nfunction compareValues(a: unknown, b: unknown): number {\n  if (a == null && b == null) return 0;\n  if (a == null) return -1;\n  if (b == null) return 1;\n  if (typeof a === \"number\" && typeof b === \"number\") return a - b;\n  if (typeof a === \"boolean\" && typeof b === \"boolean\") {\n    return Number(a) - Number(b);\n  }\n  return stringifyCellValue(a).localeCompare(stringifyCellValue(b), undefined, {\n    numeric: true,\n    sensitivity: \"base\",\n  });\n}\n\n/** Select filters treat array-valued cells as sets, never as serialized JSON choices. */\nexport function selectCellValues(value: unknown): string[] {\n  return (Array.isArray(value) ? value : [value])\n    .map(stringifyCellValue)\n    .filter((item) => item !== \"\");\n}\n\nexport function passesColumnFilter(\n  value: unknown,\n  filter: ColumnFilterValue,\n): boolean {\n  const matches = (() => {\n    switch (filter.kind) {\n    case \"text\": {\n      const s = stringifyCellValue(value);\n      if (filter.mode === \"null\") return value == null;\n      if (filter.mode === \"not_null\") return value != null;\n      if (filter.mode === \"empty\") return s.trim() === \"\";\n      if (filter.mode === \"not_empty\") return s.trim() !== \"\";\n      const q = filter.value.trim().toLowerCase();\n      if (!q) return true;\n      return s.toLowerCase().includes(q);\n    }\n    case \"select\": {\n      const selected =\n        filter.values ??\n        (filter.value && filter.value !== \"__all__\" ? [filter.value] : []);\n      if (selected.length === 0) return true;\n      const values = selectCellValues(value);\n      // OR semantics across the set; sentinels compose (\"A or (empty)\").\n      return selected.some((v) =>\n        v === SELECT_EMPTY_VALUE\n          ? values.length === 0\n          : v === SELECT_NOT_EMPTY_VALUE\n            ? values.length > 0\n            : values.includes(v),\n      );\n    }\n    case \"boolean\": {\n      return Boolean(value) === filter.value;\n    }\n    case \"number\": {\n      const n =\n        typeof value === \"number\"\n          ? value\n          : Number(stringifyCellValue(value).replace(/[^0-9.-]/g, \"\"));\n      if (Number.isNaN(n)) return false;\n      if (filter.min !== undefined && n < filter.min) return false;\n      if (filter.max !== undefined && n > filter.max) return false;\n      return true;\n    }\n    }\n  })();\n  return filter.negated ? !matches : matches;\n}\n\nexport function filterAndSortRows<T>(\n  rows: T[],\n  columns: MatrxColumnDef<T>[],\n  columnFilters: ColumnFiltersState,\n  sort: SortState | null,\n  globalSearch: string,\n  anyOf?: { columnIds: string[]; query: string },\n  layeredFilters?: readonly LayeredFilterRule[],\n  globalSearchMode: TableSearchMatchMode = \"contains\",\n  searchText?: (row: T) => string,\n): T[] {\n  const colById = new Map(columns.map((c) => [columnId(c), c]));\n  const q = globalSearch.trim().toLowerCase();\n  const anyQ = anyOf?.query.trim().toLowerCase() ?? \"\";\n  const activeLayeredFilters = completeLayeredFilterRules(layeredFilters);\n\n  let result = rows.filter((row) => {\n    for (const [id, filter] of Object.entries(columnFilters)) {\n      if (!filter) continue;\n      const col = colById.get(id);\n      if (!col || col.filter === false) continue;\n      if (!passesColumnFilter(getFilterValue(row, col), filter)) return false;\n    }\n\n    for (const rule of activeLayeredFilters) {\n      const col = colById.get(rule.field);\n      if (!col || !layeredFilterMatchesValue(getFilterValue(row, col), rule)) {\n        return false;\n      }\n    }\n\n    if (anyQ && anyOf) {\n      const hit = anyOf.columnIds.some((id) => {\n        const col = colById.get(id);\n        if (!col) return false;\n        return stringifyCellValue(getFilterValue(row, col))\n          .toLowerCase()\n          .includes(anyQ);\n      });\n      if (!hit) return false;\n    }\n\n    if (!q) return true;\n    const searchableValues = columns\n      .filter(\n        (col) =>\n          col.filter !== false || Boolean(col.accessorKey || col.accessorFn),\n      )\n      .map((col) => stringifyCellValue(getFilterValue(row, col)));\n    const additionalSearchText = searchText?.(row);\n    if (additionalSearchText) searchableValues.push(additionalSearchText);\n    if (globalSearchMode === \"contains\") {\n      return searchableValues.some((value) =>\n        matchesTableSearch(value, q, \"contains\"),\n      );\n    }\n    return matchesTableSearch(searchableValues.join(\" \"), q, \"whole_words\");\n  });\n\n  if (sort) {\n    const col = colById.get(sort.id);\n    if (col && col.sortable !== false) {\n      const dir = sort.direction === \"asc\" ? 1 : -1;\n      result = [...result].sort((a, b) => {\n        const va = getSortValue(a, col);\n        const vb = getSortValue(b, col);\n        // Empty cells (null / \"\") sort LAST in both directions — sorting a\n        // column should surface its values, never a wall of blanks.\n        const ea = va == null || stringifyCellValue(va) === \"\";\n        const eb = vb == null || stringifyCellValue(vb) === \"\";\n        if (ea !== eb) return ea ? 1 : -1;\n        return compareValues(va, vb) * dir;\n      });\n    }\n  }\n\n  return result;\n}\n\nexport function countActiveColumnFilters(filters: ColumnFiltersState): number {\n  let n = 0;\n  for (const f of Object.values(filters)) {\n    if (!f) continue;\n    switch (f.kind) {\n      case \"text\":\n        if (f.value.trim() || (f.mode && f.mode !== \"contains\")) n += 1;\n        break;\n      case \"select\":\n        if (f.values ? f.values.length > 0 : f.value && f.value !== \"__all__\")\n          n += 1;\n        break;\n      case \"boolean\":\n        n += 1;\n        break;\n      case \"number\":\n        if (f.min !== undefined || f.max !== undefined) n += 1;\n        break;\n    }\n  }\n  return n;\n}\n\nexport function isColumnFilterActive(\n  filter: ColumnFilterValue | undefined,\n): boolean {\n  if (!filter) return false;\n  switch (filter.kind) {\n    case \"text\":\n      return (\n        filter.value.trim().length > 0 ||\n        (filter.mode !== undefined && filter.mode !== \"contains\")\n      );\n    case \"select\":\n      return filter.values\n        ? filter.values.length > 0\n        : Boolean(filter.value) && filter.value !== \"__all__\";\n    case \"boolean\":\n      return true;\n    case \"number\":\n      return filter.min !== undefined || filter.max !== undefined;\n  }\n}\n\n/** Apply draft edits onto a row for display (shallow field merge). */\nexport function applyRowEdits<T>(\n  row: T,\n  edits: Record<string, unknown> | undefined,\n): T {\n  if (!edits || Object.keys(edits).length === 0) return row;\n  return { ...row, ...edits };\n}\n"],"mappings":";;AAOA,SAAS,SAAS;AAGX,IAAM,2BAA2B;AAAA,EACtC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAkCA,IAAM,0BAA0B,EAAE,OAAO;AAAA,EACvC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACpB,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACvB,UAAU,EAAE,KAAK,wBAAwB;AAAA,EACzC,OAAO,EAAE,OAAO;AAAA,EAChB,SAAS,EAAE,OAAO,EAAE,SAAS;AAC/B,CAAC;AAED,IAAM,2BAA2B,EAAE,MAAM,uBAAuB,EAAE,IAAI,EAAE;AAgEjE,SAAS,wBACd,UACS;AACT,SAAO,aAAa,cAAc,aAAa;AACjD;AAEO,SAAS,4BAA4B,MAAkC;AAC5E,MAAI,CAAC,wBAAwB,KAAK,QAAQ,EAAG,QAAO;AACpD,MAAI,KAAK,MAAM,KAAK,MAAM,GAAI,QAAO;AACrC,SAAO,KAAK,aAAa,aAAa,QAAQ,KAAK,SAAS,KAAK,CAAC;AACpE;AAEO,SAAS,2BACd,OACqB;AACrB,UAAQ,SAAS,CAAC,GAAG,OAAO,2BAA2B;AACzD;AAmGA,SAAS,eAAe,OAAwB;AAC9C,MAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,SAAO,OAAO,KAAK,EAAE,KAAK,EAAE,kBAAkB;AAChD;AAEA,SAAS,MAAM,OAAyB;AACtC,SAAO,MAAM,MAAM,iBAAiB,EAAE,OAAO,OAAO;AACtD;AAGO,SAAS,0BACd,OACA,MACS;AACT,QAAM,SAAS,eAAe,KAAK;AACnC,QAAM,WAAW,KAAK,MAAM,KAAK,EAAE,kBAAkB;AACrD,QAAM,aAAa,KAAK,SAAS,KAAK,EAAE,kBAAkB,KAAK;AAE/D,UAAQ,KAAK,UAAU;AAAA,IACrB,KAAK;AACH,aAAO,OAAO,SAAS,QAAQ;AAAA,IACjC,KAAK;AACH,aAAO,CAAC,OAAO,SAAS,QAAQ;AAAA,IAClC,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,OAAO,WAAW,QAAQ;AAAA,IACnC,KAAK;AACH,aAAO,OAAO,SAAS,QAAQ;AAAA,IACjC,KAAK;AACH,aAAO,MAAM,MAAM,EAAE,SAAS,QAAQ;AAAA,IACxC,KAAK;AACH,aAAO,CAAC,MAAM,MAAM,EAAE,SAAS,QAAQ;AAAA,IACzC,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO,OAAO,MAAM,IAAI,OAAO,QAAQ;AAAA,IACzC,KAAK;AACH,aAAO,OAAO,MAAM,KAAK,OAAO,QAAQ;AAAA,IAC1C,KAAK;AACH,aAAO,OAAO,MAAM,IAAI,OAAO,QAAQ;AAAA,IACzC,KAAK;AACH,aAAO,OAAO,MAAM,KAAK,OAAO,QAAQ;AAAA,IAC1C,KAAK,WAAW;AACd,YAAM,UAAU,OAAO,MAAM;AAC7B,aAAO,WAAW,OAAO,QAAQ,KAAK,WAAW,OAAO,UAAU;AAAA,IACpE;AAAA,EACF;AACF;;;ACzRO,IAAM,qBAAqB;AAC3B,IAAM,yBAAyB;AAE/B,SAAS,SAAY,KAAgC;AAC1D,MAAI,IAAI,GAAI,QAAO,IAAI;AACvB,MAAI,IAAI,YAAa,QAAO,OAAO,IAAI,WAAW;AAClD,QAAM,IAAI,MAAM,sDAAsD;AACxE;AAEO,SAAS,aAAgB,KAAQ,KAAiC;AACvE,MAAI,IAAI,WAAY,QAAO,IAAI,WAAW,GAAG;AAC7C,MAAI,IAAI,aAAa;AACnB,WAAQ,IAAgC,IAAI,WAAW;AAAA,EACzD;AACA,SAAO;AACT;AAEO,SAAS,eAAkB,KAAQ,KAAiC;AACzE,SAAO,IAAI,cAAc,IAAI,YAAY,GAAG,IAAI,aAAa,KAAK,GAAG;AACvE;AAEO,SAAS,aAAgB,KAAQ,KAAiC;AACvE,SAAO,IAAI,YAAY,IAAI,UAAU,GAAG,IAAI,aAAa,KAAK,GAAG;AACnE;AAEO,SAAS,mBAAmB,OAAwB;AACzD,MAAI,SAAS,KAAM,QAAO;AAC1B,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;AAC3D,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,MAAI,iBAAiB,KAAM,QAAO,MAAM,YAAY;AACpD,MAAI;AACF,WAAO,KAAK,UAAU,KAAK;AAAA,EAC7B,QAAQ;AACN,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;AAGO,SAAS,iBAAiB,OAAyB;AACxD,SAAO,MACJ,kBAAkB,EAClB,MAAM,iBAAiB,EACvB,OAAO,OAAO;AACnB;AAOO,SAAS,mBACd,gBACA,OACA,OAA6B,YACpB;AACT,QAAM,kBAAkB,MAAM,KAAK,EAAE,kBAAkB;AACvD,MAAI,CAAC,gBAAiB,QAAO;AAC7B,MAAI,SAAS,YAAY;AACvB,WAAO,eAAe,kBAAkB,EAAE,SAAS,eAAe;AAAA,EACpE;AACA,QAAM,cAAc,IAAI,IAAI,iBAAiB,cAAc,CAAC;AAC5D,QAAM,gBAAgB,iBAAiB,eAAe;AACtD,SACE,cAAc,SAAS,KACvB,cAAc,MAAM,CAAC,SAAS,YAAY,IAAI,IAAI,CAAC;AAEvD;AAEA,SAAS,cAAc,GAAY,GAAoB;AACrD,MAAI,KAAK,QAAQ,KAAK,KAAM,QAAO;AACnC,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI;AAC/D,MAAI,OAAO,MAAM,aAAa,OAAO,MAAM,WAAW;AACpD,WAAO,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,EAC7B;AACA,SAAO,mBAAmB,CAAC,EAAE,cAAc,mBAAmB,CAAC,GAAG,QAAW;AAAA,IAC3E,SAAS;AAAA,IACT,aAAa;AAAA,EACf,CAAC;AACH;AAGO,SAAS,iBAAiB,OAA0B;AACzD,UAAQ,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK,GAC1C,IAAI,kBAAkB,EACtB,OAAO,CAAC,SAAS,SAAS,EAAE;AACjC;AAEO,SAAS,mBACd,OACA,QACS;AACT,QAAM,WAAW,MAAM;AACrB,YAAQ,OAAO,MAAM;AAAA,MACrB,KAAK,QAAQ;AACX,cAAM,IAAI,mBAAmB,KAAK;AAClC,YAAI,OAAO,SAAS,OAAQ,QAAO,SAAS;AAC5C,YAAI,OAAO,SAAS,WAAY,QAAO,SAAS;AAChD,YAAI,OAAO,SAAS,QAAS,QAAO,EAAE,KAAK,MAAM;AACjD,YAAI,OAAO,SAAS,YAAa,QAAO,EAAE,KAAK,MAAM;AACrD,cAAM,IAAI,OAAO,MAAM,KAAK,EAAE,YAAY;AAC1C,YAAI,CAAC,EAAG,QAAO;AACf,eAAO,EAAE,YAAY,EAAE,SAAS,CAAC;AAAA,MACnC;AAAA,MACA,KAAK,UAAU;AACb,cAAM,WACJ,OAAO,WACN,OAAO,SAAS,OAAO,UAAU,YAAY,CAAC,OAAO,KAAK,IAAI,CAAC;AAClE,YAAI,SAAS,WAAW,EAAG,QAAO;AAClC,cAAM,SAAS,iBAAiB,KAAK;AAErC,eAAO,SAAS;AAAA,UAAK,CAAC,MACpB,MAAM,qBACF,OAAO,WAAW,IAClB,MAAM,yBACJ,OAAO,SAAS,IAChB,OAAO,SAAS,CAAC;AAAA,QACzB;AAAA,MACF;AAAA,MACA,KAAK,WAAW;AACd,eAAO,QAAQ,KAAK,MAAM,OAAO;AAAA,MACnC;AAAA,MACA,KAAK,UAAU;AACb,cAAM,IACJ,OAAO,UAAU,WACb,QACA,OAAO,mBAAmB,KAAK,EAAE,QAAQ,aAAa,EAAE,CAAC;AAC/D,YAAI,OAAO,MAAM,CAAC,EAAG,QAAO;AAC5B,YAAI,OAAO,QAAQ,UAAa,IAAI,OAAO,IAAK,QAAO;AACvD,YAAI,OAAO,QAAQ,UAAa,IAAI,OAAO,IAAK,QAAO;AACvD,eAAO;AAAA,MACT;AAAA,IACA;AAAA,EACF,GAAG;AACH,SAAO,OAAO,UAAU,CAAC,UAAU;AACrC;AAEO,SAAS,kBACd,MACA,SACA,eACA,MACA,cACA,OACA,gBACA,mBAAyC,YACzC,YACK;AACL,QAAM,UAAU,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;AAC5D,QAAM,IAAI,aAAa,KAAK,EAAE,YAAY;AAC1C,QAAM,OAAO,OAAO,MAAM,KAAK,EAAE,YAAY,KAAK;AAClD,QAAM,uBAAuB,2BAA2B,cAAc;AAEtE,MAAI,SAAS,KAAK,OAAO,CAAC,QAAQ;AAChC,eAAW,CAAC,IAAI,MAAM,KAAK,OAAO,QAAQ,aAAa,GAAG;AACxD,UAAI,CAAC,OAAQ;AACb,YAAM,MAAM,QAAQ,IAAI,EAAE;AAC1B,UAAI,CAAC,OAAO,IAAI,WAAW,MAAO;AAClC,UAAI,CAAC,mBAAmB,eAAe,KAAK,GAAG,GAAG,MAAM,EAAG,QAAO;AAAA,IACpE;AAEA,eAAW,QAAQ,sBAAsB;AACvC,YAAM,MAAM,QAAQ,IAAI,KAAK,KAAK;AAClC,UAAI,CAAC,OAAO,CAAC,0BAA0B,eAAe,KAAK,GAAG,GAAG,IAAI,GAAG;AACtE,eAAO;AAAA,MACT;AAAA,IACF;AAEA,QAAI,QAAQ,OAAO;AACjB,YAAM,MAAM,MAAM,UAAU,KAAK,CAAC,OAAO;AACvC,cAAM,MAAM,QAAQ,IAAI,EAAE;AAC1B,YAAI,CAAC,IAAK,QAAO;AACjB,eAAO,mBAAmB,eAAe,KAAK,GAAG,CAAC,EAC/C,YAAY,EACZ,SAAS,IAAI;AAAA,MAClB,CAAC;AACD,UAAI,CAAC,IAAK,QAAO;AAAA,IACnB;AAEA,QAAI,CAAC,EAAG,QAAO;AACf,UAAM,mBAAmB,QACtB;AAAA,MACC,CAAC,QACC,IAAI,WAAW,SAAS,QAAQ,IAAI,eAAe,IAAI,UAAU;AAAA,IACrE,EACC,IAAI,CAAC,QAAQ,mBAAmB,eAAe,KAAK,GAAG,CAAC,CAAC;AAC5D,UAAM,uBAAuB,aAAa,GAAG;AAC7C,QAAI,qBAAsB,kBAAiB,KAAK,oBAAoB;AACpE,QAAI,qBAAqB,YAAY;AACnC,aAAO,iBAAiB;AAAA,QAAK,CAAC,UAC5B,mBAAmB,OAAO,GAAG,UAAU;AAAA,MACzC;AAAA,IACF;AACA,WAAO,mBAAmB,iBAAiB,KAAK,GAAG,GAAG,GAAG,aAAa;AAAA,EACxE,CAAC;AAED,MAAI,MAAM;AACR,UAAM,MAAM,QAAQ,IAAI,KAAK,EAAE;AAC/B,QAAI,OAAO,IAAI,aAAa,OAAO;AACjC,YAAM,MAAM,KAAK,cAAc,QAAQ,IAAI;AAC3C,eAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM;AAClC,cAAM,KAAK,aAAa,GAAG,GAAG;AAC9B,cAAM,KAAK,aAAa,GAAG,GAAG;AAG9B,cAAM,KAAK,MAAM,QAAQ,mBAAmB,EAAE,MAAM;AACpD,cAAM,KAAK,MAAM,QAAQ,mBAAmB,EAAE,MAAM;AACpD,YAAI,OAAO,GAAI,QAAO,KAAK,IAAI;AAC/B,eAAO,cAAc,IAAI,EAAE,IAAI;AAAA,MACjC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,yBAAyB,SAAqC;AAC5E,MAAI,IAAI;AACR,aAAW,KAAK,OAAO,OAAO,OAAO,GAAG;AACtC,QAAI,CAAC,EAAG;AACR,YAAQ,EAAE,MAAM;AAAA,MACd,KAAK;AACH,YAAI,EAAE,MAAM,KAAK,KAAM,EAAE,QAAQ,EAAE,SAAS,WAAa,MAAK;AAC9D;AAAA,MACF,KAAK;AACH,YAAI,EAAE,SAAS,EAAE,OAAO,SAAS,IAAI,EAAE,SAAS,EAAE,UAAU;AAC1D,eAAK;AACP;AAAA,MACF,KAAK;AACH,aAAK;AACL;AAAA,MACF,KAAK;AACH,YAAI,EAAE,QAAQ,UAAa,EAAE,QAAQ,OAAW,MAAK;AACrD;AAAA,IACJ;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,qBACd,QACS;AACT,MAAI,CAAC,OAAQ,QAAO;AACpB,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK;AACH,aACE,OAAO,MAAM,KAAK,EAAE,SAAS,KAC5B,OAAO,SAAS,UAAa,OAAO,SAAS;AAAA,IAElD,KAAK;AACH,aAAO,OAAO,SACV,OAAO,OAAO,SAAS,IACvB,QAAQ,OAAO,KAAK,KAAK,OAAO,UAAU;AAAA,IAChD,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO,OAAO,QAAQ,UAAa,OAAO,QAAQ;AAAA,EACtD;AACF;AAGO,SAAS,cACd,KACA,OACG;AACH,MAAI,CAAC,SAAS,OAAO,KAAK,KAAK,EAAE,WAAW,EAAG,QAAO;AACtD,SAAO,EAAE,GAAG,KAAK,GAAG,MAAM;AAC5B;","names":[]}