@dynatrace/strato-components 3.13.2 → 3.14.0

package/esm/filters/filter-field/utils/value-operations/add-filter.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../src/filters/filter-field/utils/value-operations/add-filter.ts"],
-  "sourcesContent": ["import {\n  DURATION_REGEX,\n  VARIABLE_REGEX,\n  findIdenticalStatement,\n  findSearchStatement,\n  leafEquals,\n  mapInputOperator,\n  statementPolarity,\n  type OperatorDescriptor,\n} from './value-operation-utils.js';\nimport type { FilterFieldProps } from '../../FilterField.types.js';\nimport { getNumberParser } from '../../parser/getNumberParser.js';\nimport type {\n  SimpleFilterFieldBooleanNode,\n  SimpleFilterFieldDurationNode,\n  SimpleFilterFieldGroupNode,\n  SimpleFilterFieldIPAddressNode,\n  SimpleFilterFieldInclusionOperatorNode,\n  SimpleFilterFieldJSONPathNode,\n  SimpleFilterFieldKeyNode,\n  SimpleFilterFieldLeafNode,\n  SimpleFilterFieldListNode,\n  SimpleFilterFieldNode,\n  SimpleFilterFieldNumberNode,\n  SimpleFilterFieldSmartscapeIdNode,\n  SimpleFilterFieldStatementNode,\n  SimpleFilterFieldStringNode,\n  SimpleFilterFieldTimestampNode,\n  SimpleFilterFieldTree,\n  SimpleFilterFieldUIDNode,\n  SimpleFilterFieldVariableNode,\n} from '../../types/conversion-tree-nodes.js';\nimport type {\n  FilterFieldValueOperationResult,\n  FilterFieldValueOperationStatement,\n} from '../../types/value-operations.js';\nimport { convertStringToFilterFieldTree } from '../conversion/string-tree-conversion.js';\nimport { convertFilterFieldTreeToString } from '../conversion/tree-string-conversion.js';\nimport {\n  isFilterFieldGroupNode,\n  isFilterFieldListNode,\n  isFilterFieldStatementNode,\n} from '../tree-node-guards.js';\nimport { FILTERFIELD_ALL_OPERATORS } from '../validation-utils/operator-specification.js';\nimport {\n  isValidIPAddress,\n  isValidSmartscapeId,\n  isValidTimestamp,\n  isValidUID,\n} from '../validation-utils/type-validators.js';\n\n/**\n * Adds a filter statement or value to an existing FilterField value string.\n *\n * - If no statement with the given key exists, a new one is appended at the end.\n * - If a matching `key = value` statement exists, it is converted to `key in (existingValue, newValue)`.\n * - If a matching `key in (...)` statement exists, the new value is appended to the list.\n * - The same merge logic applies to `!=` / `not in`.\n * - When multiple statements with the same key exist, the rightmost one (in document order) wins.\n *\n * @public\n * @param currentValue - The current FilterField value string.\n * @param filter - The filter statement or value to add.\n * @param options - Optional configuration. `parserConfig` controls how `currentValue` is parsed\n *                  and which leaf types are constructed for new keys / values.\n * @returns The new FilterField value string and whether the operation produced a change.\n */\nexport function addFilter(\n  currentValue: string,\n  filter: FilterFieldValueOperationStatement,\n  options?: {\n    /** Parser config to apply when interpreting the existing value and constructing new nodes. */\n    parserConfig?: FilterFieldProps['parserConfig'];\n  },\n): FilterFieldValueOperationResult {\n  const parserConfig: FilterFieldProps['parserConfig'] = {\n    searchConversion: true,\n    ...options?.parserConfig,\n  };\n  const { tree } = convertStringToFilterFieldTree(currentValue, {\n    validatorMap: { comparisonOperators: FILTERFIELD_ALL_OPERATORS },\n    // Always recognize search statements when scanning the existing value, regardless\n    // of the caller's parserConfig. The caller's config only affects new node construction.\n    parserConfig: { ...parserConfig, searchConversion: true },\n  });\n  const rootGroup = prepareRoot(tree);\n\n  const operator = mapInputOperator(filter.comparisonOperator);\n\n  if (\n    operator.node.type === 'SearchOperator' &&\n    filter.value !== undefined &&\n    findSearchStatement(rootGroup, filter.value) !== undefined\n  ) {\n    return { updatedStatement: false, value: currentValue };\n  }\n\n  const match =\n    operator.polarity === 'none' || filter.key === undefined\n      ? undefined\n      : findRightmostMatchingStatement(\n          rootGroup,\n          filter.key,\n          operator.polarity,\n        );\n\n  if (match) {\n    const inputValue = filter.value;\n    const existingValue = match.value;\n\n    // Case 1: existing statement is already a list \u2014 `key in (...)` or `key not in (...)`.\n    // Append the new value, or deduplicate if it's already present.\n    if (isFilterFieldListNode(existingValue) && inputValue !== undefined) {\n      const list = existingValue as SimpleFilterFieldListNode;\n      if (list.value.some((leaf) => leafEquals(leaf, inputValue))) {\n        return { updatedStatement: false, value: currentValue };\n      }\n      list.value.push(makeLeaf(inputValue, parserConfig));\n      return {\n        updatedStatement: true,\n        value: convertFilterFieldTreeToString(rootGroup),\n      };\n    }\n\n    // Case 2: existing statement has a single leaf \u2014 `key = X` or `key != X`.\n    // Promote to a list, or deduplicate if the value is already present and the\n    // caller did not explicitly request the list form via `in` / `not in`.\n    if (\n      existingValue &&\n      !isFilterFieldListNode(existingValue) &&\n      existingValue.type !== 'Error' &&\n      inputValue !== undefined\n    ) {\n      const existingLeaf = existingValue as SimpleFilterFieldLeafNode;\n      const valuesEqual = leafEquals(existingLeaf, inputValue);\n      const inputIsInclusion = operator.node.type === 'InclusionOperator';\n\n      // Skip when the input operator matches the existing one and the value\n      // is already present. When the input operator is `in` / `not in` the\n      // caller has explicitly asked for the list form, so promote even if the\n      // value would be a duplicate \u2014 the resulting list keeps just that value.\n      if (valuesEqual && !inputIsInclusion) {\n        return { updatedStatement: false, value: currentValue };\n      }\n\n      // Promote `key = X` \u2192 `key in (X, new)` (or `key in (X)` when deduplicating with inclusion).\n      const promotionList: SimpleFilterFieldListNode = {\n        type: 'List',\n        value: valuesEqual\n          ? [existingLeaf]\n          : [existingLeaf, makeLeaf(inputValue, parserConfig)],\n      };\n      match.comparisonOperator = {\n        type: 'InclusionOperator',\n        value: operator.polarity === 'positive' ? 'in' : 'not in',\n      } as SimpleFilterFieldInclusionOperatorNode;\n      match.value = promotionList;\n      return {\n        updatedStatement: true,\n        value: convertFilterFieldTreeToString(rootGroup),\n      };\n    }\n  }\n\n  // For non-merging operators (polarity 'none'), still deduplicate exact-match statements.\n  // Search deduplicate is handled above; merging-polarity deduplicate is handled via `match`.\n  if (\n    operator.polarity === 'none' &&\n    filter.key !== undefined &&\n    findIdenticalStatement(\n      rootGroup,\n      filter.key,\n      operator.node,\n      filter.value,\n    ) !== undefined\n  ) {\n    return { updatedStatement: false, value: currentValue };\n  }\n\n  appendStatement(rootGroup, createStatement(filter, operator, parserConfig));\n  return {\n    updatedStatement: true,\n    value: convertFilterFieldTreeToString(rootGroup),\n  };\n}\n\nfunction prepareRoot(tree: SimpleFilterFieldTree): SimpleFilterFieldGroupNode {\n  if (!tree) {\n    return {\n      type: 'Group',\n      logicalOperator: 'AND',\n      explicit: false,\n      explicitLogicalOperator: false,\n      children: [],\n    };\n  }\n  if (tree.explicit || tree.logicalOperator === 'OR') {\n    return {\n      type: 'Group',\n      logicalOperator: 'AND',\n      explicit: false,\n      explicitLogicalOperator: false,\n      children: [{ ...tree, explicit: true }],\n    };\n  }\n  return tree;\n}\n\nfunction appendStatement(\n  group: SimpleFilterFieldGroupNode,\n  statement: SimpleFilterFieldStatementNode,\n): void {\n  const previousSibling = group.children.at(-1);\n  group.children.push(statement);\n  // Only make the logical operator explicit when the previous sibling is a group\n  // AND the group had exactly one child before this push (length is now 2).\n  // Setting explicitLogicalOperator on the root affects the separator between ALL\n  // children, so we must not set it retroactively when the root already had multiple\n  // children with their own implicit separators.\n  if (\n    previousSibling &&\n    isFilterFieldGroupNode(previousSibling) &&\n    group.children.length === 2\n  ) {\n    group.explicitLogicalOperator = true;\n  }\n}\n\nfunction createStatement(\n  filter: FilterFieldValueOperationStatement,\n  operator: OperatorDescriptor,\n  parserConfig: FilterFieldProps['parserConfig'],\n): SimpleFilterFieldStatementNode {\n  const statement: SimpleFilterFieldStatementNode = {\n    type: 'Statement',\n    comparisonOperator: operator.node,\n  };\n  if (filter.key !== undefined) {\n    statement.key = createKey(filter.key, parserConfig);\n  }\n  if (filter.value !== undefined) {\n    const leaf = makeLeaf(filter.value, parserConfig);\n    statement.value =\n      operator.node.type === 'InclusionOperator'\n        ? { type: 'List', value: [leaf] }\n        : leaf;\n  }\n  return statement;\n}\n\nfunction findRightmostMatchingStatement(\n  group: SimpleFilterFieldGroupNode,\n  key: string,\n  polarity: 'positive' | 'negative',\n): SimpleFilterFieldStatementNode | undefined {\n  for (let i = group.children.length - 1; i >= 0; i--) {\n    const child: SimpleFilterFieldNode = group.children[i];\n    if (isFilterFieldGroupNode(child)) {\n      const nested = findRightmostMatchingStatement(child, key, polarity);\n      if (nested) {\n        return nested;\n      }\n    } else if (isFilterFieldStatementNode(child)) {\n      const childKey = child.key;\n      if (\n        childKey &&\n        (childKey.type === 'Key' || childKey.type === 'JSONPath') &&\n        childKey.value === key &&\n        statementPolarity(child) === polarity\n      ) {\n        return child;\n      }\n    }\n  }\n  return undefined;\n}\n\nfunction makeLeaf(\n  value: string | number | boolean,\n  parserConfig: FilterFieldProps['parserConfig'],\n):\n  | SimpleFilterFieldStringNode\n  | SimpleFilterFieldNumberNode\n  | SimpleFilterFieldBooleanNode\n  | SimpleFilterFieldDurationNode\n  | SimpleFilterFieldVariableNode\n  | SimpleFilterFieldIPAddressNode\n  | SimpleFilterFieldTimestampNode\n  | SimpleFilterFieldUIDNode\n  | SimpleFilterFieldSmartscapeIdNode {\n  if (typeof value === 'number') {\n    return { type: 'Number', value };\n  }\n  if (typeof value === 'boolean') {\n    return { type: 'Boolean', value };\n  }\n\n  const durationMatch = DURATION_REGEX.exec(value);\n  if (durationMatch) {\n    return {\n      type: 'Duration',\n      value: parseInt(durationMatch[1], 10),\n      unit: durationMatch[2].toLowerCase() as SimpleFilterFieldDurationNode['unit'],\n    };\n  }\n  if (value === 'true' || value === 'false') {\n    return { type: 'Boolean', value: value === 'true' };\n  }\n  const parsedNumber = getNumberParser().parse(value);\n  if (!isNaN(parsedNumber)) {\n    return { type: 'Number', value: parsedNumber };\n  }\n  if (VARIABLE_REGEX.test(value)) {\n    return { type: 'Variable', value, variableType: 'Any' };\n  }\n\n  // Opt-in detections gated on parserConfig flags.\n  // oxlint-disable-next-line typescript/no-deprecated\n  if (parserConfig?.ipAddressConversion && isValidIPAddress(value)) {\n    return { type: 'IPAddress', value, textValue: value };\n  }\n  // oxlint-disable-next-line typescript/no-deprecated\n  if (parserConfig?.timestampConversion && isValidTimestamp(value)) {\n    return { type: 'Timestamp', value, textValue: value };\n  }\n  // oxlint-disable-next-line typescript/no-deprecated\n  if (parserConfig?.uidConversion && isValidUID(value)) {\n    return { type: 'UID', value, textValue: value };\n  }\n  // oxlint-disable-next-line typescript/no-deprecated\n  if (parserConfig?.smartscapeIdConversion && isValidSmartscapeId(value)) {\n    return { type: 'SmartscapeId', value, textValue: value };\n  }\n  return { type: 'String', value };\n}\n\nfunction createKey(\n  keyString: string,\n  parserConfig: FilterFieldProps['parserConfig'],\n): SimpleFilterFieldKeyNode | SimpleFilterFieldJSONPathNode {\n  // When the caller opts in via `jsonPathConversion`, run a synthetic parse so\n  // the lezer grammar decides whether the key is a JSONPath. Falls back to a\n  // plain `Key` when the synthetic statement doesn't produce a JSONPath.\n  // oxlint-disable-next-line typescript/no-deprecated\n  if (parserConfig?.jsonPathConversion && keyString.includes('$')) {\n    const { tree } = convertStringToFilterFieldTree(`${keyString} = x`, {\n      parserConfig,\n    });\n    const statement = tree?.children.find(isFilterFieldStatementNode);\n    if (statement?.key?.type === 'JSONPath') {\n      return statement.key;\n    }\n  }\n  return { type: 'Key', value: keyString };\n}\n"],
-  "mappings": "AAAA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAEK;AAEP,SAAS,uBAAuB;AAyBhC,SAAS,sCAAsC;AAC/C,SAAS,sCAAsC;AAC/C;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,iCAAiC;AAC1C;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAkBA,SAAS,UACd,cACA,QACA,SAIiC;AACjC,QAAM,eAAiD;AAAA,IACrD,kBAAkB;AAAA,IAClB,GAAG,SAAS;AAAA,EACd;AACA,QAAM,EAAE,KAAK,IAAI,+BAA+B,cAAc;AAAA,IAC5D,cAAc,EAAE,qBAAqB,0BAA0B;AAAA;AAAA;AAAA,IAG/D,cAAc,EAAE,GAAG,cAAc,kBAAkB,KAAK;AAAA,EAC1D,CAAC;AACD,QAAM,YAAY,YAAY,IAAI;AAElC,QAAM,WAAW,iBAAiB,OAAO,kBAAkB;AAE3D,MACE,SAAS,KAAK,SAAS,oBACvB,OAAO,UAAU,UACjB,oBAAoB,WAAW,OAAO,KAAK,MAAM,QACjD;AACA,WAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACxD;AAEA,QAAM,QACJ,SAAS,aAAa,UAAU,OAAO,QAAQ,SAC3C,SACA;AAAA,IACE;AAAA,IACA,OAAO;AAAA,IACP,SAAS;AAAA,EACX;AAEN,MAAI,OAAO;AACT,UAAM,aAAa,OAAO;AAC1B,UAAM,gBAAgB,MAAM;AAI5B,QAAI,sBAAsB,aAAa,KAAK,eAAe,QAAW;AACpE,YAAM,OAAO;AACb,UAAI,KAAK,MAAM,KAAK,CAAC,SAAS,WAAW,MAAM,UAAU,CAAC,GAAG;AAC3D,eAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,MACxD;AACA,WAAK,MAAM,KAAK,SAAS,YAAY,YAAY,CAAC;AAClD,aAAO;AAAA,QACL,kBAAkB;AAAA,QAClB,OAAO,+BAA+B,SAAS;AAAA,MACjD;AAAA,IACF;AAKA,QACE,iBACA,CAAC,sBAAsB,aAAa,KACpC,cAAc,SAAS,WACvB,eAAe,QACf;AACA,YAAM,eAAe;AACrB,YAAM,cAAc,WAAW,cAAc,UAAU;AACvD,YAAM,mBAAmB,SAAS,KAAK,SAAS;AAMhD,UAAI,eAAe,CAAC,kBAAkB;AACpC,eAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,MACxD;AAGA,YAAM,gBAA2C;AAAA,QAC/C,MAAM;AAAA,QACN,OAAO,cACH,CAAC,YAAY,IACb,CAAC,cAAc,SAAS,YAAY,YAAY,CAAC;AAAA,MACvD;AACA,YAAM,qBAAqB;AAAA,QACzB,MAAM;AAAA,QACN,OAAO,SAAS,aAAa,aAAa,OAAO;AAAA,MACnD;AACA,YAAM,QAAQ;AACd,aAAO;AAAA,QACL,kBAAkB;AAAA,QAClB,OAAO,+BAA+B,SAAS;AAAA,MACjD;AAAA,IACF;AAAA,EACF;AAIA,MACE,SAAS,aAAa,UACtB,OAAO,QAAQ,UACf;AAAA,IACE;AAAA,IACA,OAAO;AAAA,IACP,SAAS;AAAA,IACT,OAAO;AAAA,EACT,MAAM,QACN;AACA,WAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACxD;AAEA,kBAAgB,WAAW,gBAAgB,QAAQ,UAAU,YAAY,CAAC;AAC1E,SAAO;AAAA,IACL,kBAAkB;AAAA,IAClB,OAAO,+BAA+B,SAAS;AAAA,EACjD;AACF;AAEA,SAAS,YAAY,MAAyD;AAC5E,MAAI,CAAC,MAAM;AACT,WAAO;AAAA,MACL,MAAM;AAAA,MACN,iBAAiB;AAAA,MACjB,UAAU;AAAA,MACV,yBAAyB;AAAA,MACzB,UAAU,CAAC;AAAA,IACb;AAAA,EACF;AACA,MAAI,KAAK,YAAY,KAAK,oBAAoB,MAAM;AAClD,WAAO;AAAA,MACL,MAAM;AAAA,MACN,iBAAiB;AAAA,MACjB,UAAU;AAAA,MACV,yBAAyB;AAAA,MACzB,UAAU,CAAC,EAAE,GAAG,MAAM,UAAU,KAAK,CAAC;AAAA,IACxC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gBACP,OACA,WACM;AACN,QAAM,kBAAkB,MAAM,SAAS,GAAG,EAAE;AAC5C,QAAM,SAAS,KAAK,SAAS;AAM7B,MACE,mBACA,uBAAuB,eAAe,KACtC,MAAM,SAAS,WAAW,GAC1B;AACA,UAAM,0BAA0B;AAAA,EAClC;AACF;AAEA,SAAS,gBACP,QACA,UACA,cACgC;AAChC,QAAM,YAA4C;AAAA,IAChD,MAAM;AAAA,IACN,oBAAoB,SAAS;AAAA,EAC/B;AACA,MAAI,OAAO,QAAQ,QAAW;AAC5B,cAAU,MAAM,UAAU,OAAO,KAAK,YAAY;AAAA,EACpD;AACA,MAAI,OAAO,UAAU,QAAW;AAC9B,UAAM,OAAO,SAAS,OAAO,OAAO,YAAY;AAChD,cAAU,QACR,SAAS,KAAK,SAAS,sBACnB,EAAE,MAAM,QAAQ,OAAO,CAAC,IAAI,EAAE,IAC9B;AAAA,EACR;AACA,SAAO;AACT;AAEA,SAAS,+BACP,OACA,KACA,UAC4C;AAC5C,WAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,UAAM,QAA+B,MAAM,SAAS,CAAC;AACrD,QAAI,uBAAuB,KAAK,GAAG;AACjC,YAAM,SAAS,+BAA+B,OAAO,KAAK,QAAQ;AAClE,UAAI,QAAQ;AACV,eAAO;AAAA,MACT;AAAA,IACF,WAAW,2BAA2B,KAAK,GAAG;AAC5C,YAAM,WAAW,MAAM;AACvB,UACE,aACC,SAAS,SAAS,SAAS,SAAS,SAAS,eAC9C,SAAS,UAAU,OACnB,kBAAkB,KAAK,MAAM,UAC7B;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,SACP,OACA,cAUoC;AACpC,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,EAAE,MAAM,UAAU,MAAM;AAAA,EACjC;AACA,MAAI,OAAO,UAAU,WAAW;AAC9B,WAAO,EAAE,MAAM,WAAW,MAAM;AAAA,EAClC;AAEA,QAAM,gBAAgB,eAAe,KAAK,KAAK;AAC/C,MAAI,eAAe;AACjB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO,SAAS,cAAc,CAAC,GAAG,EAAE;AAAA,MACpC,MAAM,cAAc,CAAC,EAAE,YAAY;AAAA,IACrC;AAAA,EACF;AACA,MAAI,UAAU,UAAU,UAAU,SAAS;AACzC,WAAO,EAAE,MAAM,WAAW,OAAO,UAAU,OAAO;AAAA,EACpD;AACA,QAAM,eAAe,gBAAgB,EAAE,MAAM,KAAK;AAClD,MAAI,CAAC,MAAM,YAAY,GAAG;AACxB,WAAO,EAAE,MAAM,UAAU,OAAO,aAAa;AAAA,EAC/C;AACA,MAAI,eAAe,KAAK,KAAK,GAAG;AAC9B,WAAO,EAAE,MAAM,YAAY,OAAO,cAAc,MAAM;AAAA,EACxD;AAIA,MAAI,cAAc,uBAAuB,iBAAiB,KAAK,GAAG;AAChE,WAAO,EAAE,MAAM,aAAa,OAAO,WAAW,MAAM;AAAA,EACtD;AAEA,MAAI,cAAc,uBAAuB,iBAAiB,KAAK,GAAG;AAChE,WAAO,EAAE,MAAM,aAAa,OAAO,WAAW,MAAM;AAAA,EACtD;AAEA,MAAI,cAAc,iBAAiB,WAAW,KAAK,GAAG;AACpD,WAAO,EAAE,MAAM,OAAO,OAAO,WAAW,MAAM;AAAA,EAChD;AAEA,MAAI,cAAc,0BAA0B,oBAAoB,KAAK,GAAG;AACtE,WAAO,EAAE,MAAM,gBAAgB,OAAO,WAAW,MAAM;AAAA,EACzD;AACA,SAAO,EAAE,MAAM,UAAU,MAAM;AACjC;AAEA,SAAS,UACP,WACA,cAC0D;AAK1D,MAAI,cAAc,sBAAsB,UAAU,SAAS,GAAG,GAAG;AAC/D,UAAM,EAAE,KAAK,IAAI,+BAA+B,GAAG,SAAS,QAAQ;AAAA,MAClE;AAAA,IACF,CAAC;AACD,UAAM,YAAY,MAAM,SAAS,KAAK,0BAA0B;AAChE,QAAI,WAAW,KAAK,SAAS,YAAY;AACvC,aAAO,UAAU;AAAA,IACnB;AAAA,EACF;AACA,SAAO,EAAE,MAAM,OAAO,OAAO,UAAU;AACzC;",
+  "sourcesContent": ["import {\n  findIdenticalStatement,\n  findSearchStatement,\n  leafEquals,\n  makeLeaf,\n  mapInputOperator,\n  statementPolarity,\n  type OperatorDescriptor,\n} from './value-operation-utils.js';\nimport type { FilterFieldProps } from '../../FilterField.types.js';\nimport type {\n  SimpleFilterFieldGroupNode,\n  SimpleFilterFieldInclusionOperatorNode,\n  SimpleFilterFieldJSONPathNode,\n  SimpleFilterFieldKeyNode,\n  SimpleFilterFieldLeafNode,\n  SimpleFilterFieldListNode,\n  SimpleFilterFieldNode,\n  SimpleFilterFieldStatementNode,\n  SimpleFilterFieldTree,\n} from '../../types/conversion-tree-nodes.js';\nimport type {\n  FilterFieldValueOperationResult,\n  FilterFieldValueOperationStatement,\n} from '../../types/value-operations.js';\nimport { convertStringToFilterFieldTree } from '../conversion/string-tree-conversion.js';\nimport { convertFilterFieldTreeToString } from '../conversion/tree-string-conversion.js';\nimport {\n  isFilterFieldGroupNode,\n  isFilterFieldListNode,\n  isFilterFieldStatementNode,\n} from '../tree-node-guards.js';\nimport { FILTERFIELD_ALL_OPERATORS } from '../validation-utils/operator-specification.js';\n\n/**\n * Adds a filter statement or value to an existing FilterField value string.\n *\n * - If no statement with the given key exists, a new one is appended at the end.\n * - If a matching `key = value` statement exists, it is converted to `key in (existingValue, newValue)`.\n * - If a matching `key in (...)` statement exists, the new value is appended to the list.\n * - The same merge logic applies to `!=` / `not in`.\n * - When multiple statements with the same key exist, the rightmost one (in document order) wins.\n *\n * @public\n * @param currentValue - The current FilterField value string.\n * @param filter - The filter statement or value to add. Pass `valueType` on the filter to control\n *                 how the value is typed (e.g. `valueType: 'String'` prevents `'true'` from being\n *                 stored as a Boolean). Defaults to `'Any'` (type is inferred from the value).\n * @param options - Optional configuration. `parserConfig` controls how `currentValue` is parsed\n *                  and which leaf types are constructed for new keys / values.\n * @returns The new FilterField value string and whether the operation produced a change.\n */\nexport function addFilter(\n  currentValue: string,\n  filter: FilterFieldValueOperationStatement,\n  options?: {\n    /** Parser config to apply when interpreting the existing value and constructing new nodes. */\n    parserConfig?: FilterFieldProps['parserConfig'];\n  },\n): FilterFieldValueOperationResult {\n  const parserConfig: FilterFieldProps['parserConfig'] = {\n    searchConversion: true,\n    ...options?.parserConfig,\n  };\n  const { tree } = convertStringToFilterFieldTree(currentValue, {\n    validatorMap: { comparisonOperators: FILTERFIELD_ALL_OPERATORS },\n    // Always recognize search statements when scanning the existing value, regardless\n    // of the caller's parserConfig. The caller's config only affects new node construction.\n    parserConfig: { ...parserConfig, searchConversion: true },\n  });\n  const rootGroup = prepareRoot(tree);\n\n  const operator = mapInputOperator(filter.comparisonOperator);\n  const valueType = filter.valueType;\n  const leafOptions = { valueType, parserConfig };\n\n  if (\n    operator.node.type === 'SearchOperator' &&\n    filter.value !== undefined &&\n    findSearchStatement(rootGroup, filter.value, leafOptions) !== undefined\n  ) {\n    return { updatedStatement: false, value: currentValue };\n  }\n\n  const match =\n    operator.polarity === 'none' || filter.key === undefined\n      ? undefined\n      : findRightmostMatchingStatement(\n          rootGroup,\n          filter.key,\n          operator.polarity,\n        );\n\n  if (match) {\n    const inputValue = filter.value;\n    const existingValue = match.value;\n\n    // Case 1: existing statement is already a list \u2014 `key in (...)` or `key not in (...)`.\n    // Append the new value, or deduplicate if it's already present.\n    if (isFilterFieldListNode(existingValue) && inputValue !== undefined) {\n      const list = existingValue as SimpleFilterFieldListNode;\n      if (\n        list.value.some((leaf) => leafEquals(leaf, inputValue, leafOptions))\n      ) {\n        return { updatedStatement: false, value: currentValue };\n      }\n      list.value.push(makeLeaf(inputValue, parserConfig, valueType));\n      return {\n        updatedStatement: true,\n        value: convertFilterFieldTreeToString(rootGroup),\n      };\n    }\n\n    // Case 2: existing statement has a single leaf \u2014 `key = X` or `key != X`.\n    // Promote to a list, or deduplicate if the value is already present and the\n    // caller did not explicitly request the list form via `in` / `not in`.\n    if (\n      existingValue &&\n      !isFilterFieldListNode(existingValue) &&\n      existingValue.type !== 'Error' &&\n      inputValue !== undefined\n    ) {\n      const existingLeaf = existingValue as SimpleFilterFieldLeafNode;\n      const valuesEqual = leafEquals(existingLeaf, inputValue, leafOptions);\n      const inputIsInclusion = operator.node.type === 'InclusionOperator';\n\n      // Skip when the input operator matches the existing one and the value\n      // is already present. When the input operator is `in` / `not in` the\n      // caller has explicitly asked for the list form, so promote even if the\n      // value would be a duplicate \u2014 the resulting list keeps just that value.\n      if (valuesEqual && !inputIsInclusion) {\n        return { updatedStatement: false, value: currentValue };\n      }\n\n      // Promote `key = X` \u2192 `key in (X, new)` (or `key in (X)` when deduplicating with inclusion).\n      const promotionList: SimpleFilterFieldListNode = {\n        type: 'List',\n        value: valuesEqual\n          ? [existingLeaf]\n          : [existingLeaf, makeLeaf(inputValue, parserConfig, valueType)],\n      };\n      match.comparisonOperator = {\n        type: 'InclusionOperator',\n        value: operator.polarity === 'positive' ? 'in' : 'not in',\n      } as SimpleFilterFieldInclusionOperatorNode;\n      match.value = promotionList;\n      return {\n        updatedStatement: true,\n        value: convertFilterFieldTreeToString(rootGroup),\n      };\n    }\n  }\n\n  // For non-merging operators (polarity 'none'), still deduplicate exact-match statements.\n  // Search deduplicate is handled above; merging-polarity deduplicate is handled via `match`.\n  if (\n    operator.polarity === 'none' &&\n    filter.key !== undefined &&\n    findIdenticalStatement(\n      rootGroup,\n      filter.key,\n      operator.node,\n      filter.value,\n      leafOptions,\n    ) !== undefined\n  ) {\n    return { updatedStatement: false, value: currentValue };\n  }\n\n  appendStatement(rootGroup, createStatement(filter, operator, parserConfig));\n  return {\n    updatedStatement: true,\n    value: convertFilterFieldTreeToString(rootGroup),\n  };\n}\n\nfunction prepareRoot(tree: SimpleFilterFieldTree): SimpleFilterFieldGroupNode {\n  if (!tree) {\n    return {\n      type: 'Group',\n      logicalOperator: 'AND',\n      explicit: false,\n      explicitLogicalOperator: false,\n      children: [],\n    };\n  }\n  if (tree.explicit || tree.logicalOperator === 'OR') {\n    return {\n      type: 'Group',\n      logicalOperator: 'AND',\n      explicit: false,\n      explicitLogicalOperator: false,\n      children: [{ ...tree, explicit: true }],\n    };\n  }\n  return tree;\n}\n\nfunction appendStatement(\n  group: SimpleFilterFieldGroupNode,\n  statement: SimpleFilterFieldStatementNode,\n): void {\n  const previousSibling = group.children.at(-1);\n  group.children.push(statement);\n  // Only make the logical operator explicit when the previous sibling is a group\n  // AND the group had exactly one child before this push (length is now 2).\n  // Setting explicitLogicalOperator on the root affects the separator between ALL\n  // children, so we must not set it retroactively when the root already had multiple\n  // children with their own implicit separators.\n  if (\n    previousSibling &&\n    isFilterFieldGroupNode(previousSibling) &&\n    group.children.length === 2\n  ) {\n    group.explicitLogicalOperator = true;\n  }\n}\n\nfunction createStatement(\n  filter: FilterFieldValueOperationStatement,\n  operator: OperatorDescriptor,\n  parserConfig: FilterFieldProps['parserConfig'],\n): SimpleFilterFieldStatementNode {\n  const statement: SimpleFilterFieldStatementNode = {\n    type: 'Statement',\n    comparisonOperator: operator.node,\n  };\n  if (filter.key !== undefined) {\n    statement.key = createKey(filter.key, parserConfig);\n  }\n  if (filter.value !== undefined) {\n    const leaf = makeLeaf(filter.value, parserConfig, filter.valueType);\n    statement.value =\n      operator.node.type === 'InclusionOperator'\n        ? { type: 'List', value: [leaf] }\n        : leaf;\n  }\n  return statement;\n}\n\nfunction findRightmostMatchingStatement(\n  group: SimpleFilterFieldGroupNode,\n  key: string,\n  polarity: 'positive' | 'negative',\n): SimpleFilterFieldStatementNode | undefined {\n  for (let i = group.children.length - 1; i >= 0; i--) {\n    const child: SimpleFilterFieldNode = group.children[i];\n    if (isFilterFieldGroupNode(child)) {\n      const nested = findRightmostMatchingStatement(child, key, polarity);\n      if (nested) {\n        return nested;\n      }\n    } else if (isFilterFieldStatementNode(child)) {\n      const childKey = child.key;\n      if (\n        childKey &&\n        (childKey.type === 'Key' || childKey.type === 'JSONPath') &&\n        childKey.value === key &&\n        statementPolarity(child) === polarity\n      ) {\n        return child;\n      }\n    }\n  }\n  return undefined;\n}\n\nfunction createKey(\n  keyString: string,\n  parserConfig: FilterFieldProps['parserConfig'],\n): SimpleFilterFieldKeyNode | SimpleFilterFieldJSONPathNode {\n  // When the caller opts in via `jsonPathConversion`, run a synthetic parse so\n  // the lezer grammar decides whether the key is a JSONPath. Falls back to a\n  // plain `Key` when the synthetic statement doesn't produce a JSONPath.\n  // oxlint-disable-next-line typescript/no-deprecated\n  if (parserConfig?.jsonPathConversion && keyString.includes('$')) {\n    const { tree } = convertStringToFilterFieldTree(`${keyString} = x`, {\n      parserConfig,\n    });\n    const statement = tree?.children.find(isFilterFieldStatementNode);\n    if (statement?.key?.type === 'JSONPath') {\n      return statement.key;\n    }\n  }\n  return { type: 'Key', value: keyString };\n}\n"],
+  "mappings": "AAAA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAEK;AAiBP,SAAS,sCAAsC;AAC/C,SAAS,sCAAsC;AAC/C;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,iCAAiC;AAoBnC,SAAS,UACd,cACA,QACA,SAIiC;AACjC,QAAM,eAAiD;AAAA,IACrD,kBAAkB;AAAA,IAClB,GAAG,SAAS;AAAA,EACd;AACA,QAAM,EAAE,KAAK,IAAI,+BAA+B,cAAc;AAAA,IAC5D,cAAc,EAAE,qBAAqB,0BAA0B;AAAA;AAAA;AAAA,IAG/D,cAAc,EAAE,GAAG,cAAc,kBAAkB,KAAK;AAAA,EAC1D,CAAC;AACD,QAAM,YAAY,YAAY,IAAI;AAElC,QAAM,WAAW,iBAAiB,OAAO,kBAAkB;AAC3D,QAAM,YAAY,OAAO;AACzB,QAAM,cAAc,EAAE,WAAW,aAAa;AAE9C,MACE,SAAS,KAAK,SAAS,oBACvB,OAAO,UAAU,UACjB,oBAAoB,WAAW,OAAO,OAAO,WAAW,MAAM,QAC9D;AACA,WAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACxD;AAEA,QAAM,QACJ,SAAS,aAAa,UAAU,OAAO,QAAQ,SAC3C,SACA;AAAA,IACE;AAAA,IACA,OAAO;AAAA,IACP,SAAS;AAAA,EACX;AAEN,MAAI,OAAO;AACT,UAAM,aAAa,OAAO;AAC1B,UAAM,gBAAgB,MAAM;AAI5B,QAAI,sBAAsB,aAAa,KAAK,eAAe,QAAW;AACpE,YAAM,OAAO;AACb,UACE,KAAK,MAAM,KAAK,CAAC,SAAS,WAAW,MAAM,YAAY,WAAW,CAAC,GACnE;AACA,eAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,MACxD;AACA,WAAK,MAAM,KAAK,SAAS,YAAY,cAAc,SAAS,CAAC;AAC7D,aAAO;AAAA,QACL,kBAAkB;AAAA,QAClB,OAAO,+BAA+B,SAAS;AAAA,MACjD;AAAA,IACF;AAKA,QACE,iBACA,CAAC,sBAAsB,aAAa,KACpC,cAAc,SAAS,WACvB,eAAe,QACf;AACA,YAAM,eAAe;AACrB,YAAM,cAAc,WAAW,cAAc,YAAY,WAAW;AACpE,YAAM,mBAAmB,SAAS,KAAK,SAAS;AAMhD,UAAI,eAAe,CAAC,kBAAkB;AACpC,eAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,MACxD;AAGA,YAAM,gBAA2C;AAAA,QAC/C,MAAM;AAAA,QACN,OAAO,cACH,CAAC,YAAY,IACb,CAAC,cAAc,SAAS,YAAY,cAAc,SAAS,CAAC;AAAA,MAClE;AACA,YAAM,qBAAqB;AAAA,QACzB,MAAM;AAAA,QACN,OAAO,SAAS,aAAa,aAAa,OAAO;AAAA,MACnD;AACA,YAAM,QAAQ;AACd,aAAO;AAAA,QACL,kBAAkB;AAAA,QAClB,OAAO,+BAA+B,SAAS;AAAA,MACjD;AAAA,IACF;AAAA,EACF;AAIA,MACE,SAAS,aAAa,UACtB,OAAO,QAAQ,UACf;AAAA,IACE;AAAA,IACA,OAAO;AAAA,IACP,SAAS;AAAA,IACT,OAAO;AAAA,IACP;AAAA,EACF,MAAM,QACN;AACA,WAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACxD;AAEA,kBAAgB,WAAW,gBAAgB,QAAQ,UAAU,YAAY,CAAC;AAC1E,SAAO;AAAA,IACL,kBAAkB;AAAA,IAClB,OAAO,+BAA+B,SAAS;AAAA,EACjD;AACF;AAEA,SAAS,YAAY,MAAyD;AAC5E,MAAI,CAAC,MAAM;AACT,WAAO;AAAA,MACL,MAAM;AAAA,MACN,iBAAiB;AAAA,MACjB,UAAU;AAAA,MACV,yBAAyB;AAAA,MACzB,UAAU,CAAC;AAAA,IACb;AAAA,EACF;AACA,MAAI,KAAK,YAAY,KAAK,oBAAoB,MAAM;AAClD,WAAO;AAAA,MACL,MAAM;AAAA,MACN,iBAAiB;AAAA,MACjB,UAAU;AAAA,MACV,yBAAyB;AAAA,MACzB,UAAU,CAAC,EAAE,GAAG,MAAM,UAAU,KAAK,CAAC;AAAA,IACxC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gBACP,OACA,WACM;AACN,QAAM,kBAAkB,MAAM,SAAS,GAAG,EAAE;AAC5C,QAAM,SAAS,KAAK,SAAS;AAM7B,MACE,mBACA,uBAAuB,eAAe,KACtC,MAAM,SAAS,WAAW,GAC1B;AACA,UAAM,0BAA0B;AAAA,EAClC;AACF;AAEA,SAAS,gBACP,QACA,UACA,cACgC;AAChC,QAAM,YAA4C;AAAA,IAChD,MAAM;AAAA,IACN,oBAAoB,SAAS;AAAA,EAC/B;AACA,MAAI,OAAO,QAAQ,QAAW;AAC5B,cAAU,MAAM,UAAU,OAAO,KAAK,YAAY;AAAA,EACpD;AACA,MAAI,OAAO,UAAU,QAAW;AAC9B,UAAM,OAAO,SAAS,OAAO,OAAO,cAAc,OAAO,SAAS;AAClE,cAAU,QACR,SAAS,KAAK,SAAS,sBACnB,EAAE,MAAM,QAAQ,OAAO,CAAC,IAAI,EAAE,IAC9B;AAAA,EACR;AACA,SAAO;AACT;AAEA,SAAS,+BACP,OACA,KACA,UAC4C;AAC5C,WAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,UAAM,QAA+B,MAAM,SAAS,CAAC;AACrD,QAAI,uBAAuB,KAAK,GAAG;AACjC,YAAM,SAAS,+BAA+B,OAAO,KAAK,QAAQ;AAClE,UAAI,QAAQ;AACV,eAAO;AAAA,MACT;AAAA,IACF,WAAW,2BAA2B,KAAK,GAAG;AAC5C,YAAM,WAAW,MAAM;AACvB,UACE,aACC,SAAS,SAAS,SAAS,SAAS,SAAS,eAC9C,SAAS,UAAU,OACnB,kBAAkB,KAAK,MAAM,UAC7B;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,UACP,WACA,cAC0D;AAK1D,MAAI,cAAc,sBAAsB,UAAU,SAAS,GAAG,GAAG;AAC/D,UAAM,EAAE,KAAK,IAAI,+BAA+B,GAAG,SAAS,QAAQ;AAAA,MAClE;AAAA,IACF,CAAC;AACD,UAAM,YAAY,MAAM,SAAS,KAAK,0BAA0B;AAChE,QAAI,WAAW,KAAK,SAAS,YAAY;AACvC,aAAO,UAAU;AAAA,IACnB;AAAA,EACF;AACA,SAAO,EAAE,MAAM,OAAO,OAAO,UAAU;AACzC;",
   "names": []
 }

package/esm/filters/filter-field/utils/value-operations/remove-filter.js

@@ -12,20 +12,41 @@ import {
 } from "../tree-node-guards.js";
 import { FILTERFIELD_ALL_OPERATORS } from "../validation-utils/operator-specification.js";
 function removeFilter(currentValue, filter, options) {
+  const parserConfig = {
+    ...options?.parserConfig,
+    // Search and mid-value wildcard statements must always be recognized so they
+    // can be targeted for removal regardless of the caller's config.
+    searchConversion: true,
+    matchesWildcardConversion: true
+  };
   const { tree } = convertStringToFilterFieldTree(currentValue, {
     validatorMap: {
       comparisonOperators: [...FILTERFIELD_ALL_OPERATORS]
     },
-    parserConfig: {
-      searchConversion: true,
-      matchesWildcardConversion: true
-    }
+    parserConfig
   });
   if (!tree) {
     return { updatedStatement: false, value: currentValue };
   }
-  const operator = mapInputOperator(filter.comparisonOperator);
   let updatedStatement = false;
+  if (filter.key !== void 0 && !("value" in filter) && !("comparisonOperator" in filter)) {
+    do {
+      const found = removeRightmostMatch(tree, (statement) => {
+        const statementKey = statement.key;
+        return !!statementKey && (statementKey.type === "Key" || statementKey.type === "JSONPath") && statementKey.value === filter.key;
+      });
+      if (!found) {
+        break;
+      }
+      updatedStatement = true;
+    } while (options?.removeAll);
+    return updatedStatement ? { updatedStatement: true, value: convertFilterFieldTreeToString(tree) } : { updatedStatement: false, value: currentValue };
+  }
+  const operator = mapInputOperator(filter.comparisonOperator);
+  const leafOptions = {
+    valueType: filter.valueType,
+    parserConfig
+  };
   if (operator.node.type === "SearchOperator") {
     if (filter.value === void 0) {
       return { updatedStatement: false, value: currentValue };
@@ -36,7 +57,8 @@ function removeFilter(currentValue, filter, options) {
         const statementValue = statement.value;
         return statementOperator?.type === "SearchOperator" && statementValue !== void 0 && !isFilterFieldListNode(statementValue) && leafEquals(
           statementValue,
-          filter.value
+          filter.value,
+          leafOptions
         );
       });
       if (!found) {
@@ -64,7 +86,11 @@ function removeFilter(currentValue, filter, options) {
           return true;
         }
         const statementValue = statement.value;
-        return statementValue !== void 0 && !isFilterFieldListNode(statementValue) && statementValue.type !== "Error" && leafEquals(statementValue, filter.value);
+        return statementValue !== void 0 && !isFilterFieldListNode(statementValue) && statementValue.type !== "Error" && leafEquals(
+          statementValue,
+          filter.value,
+          leafOptions
+        );
       });
       if (!found) {
         break;
@@ -78,7 +104,8 @@ function removeFilter(currentValue, filter, options) {
       tree,
       filter.key,
       operator.polarity,
-      filter.value
+      filter.value,
+      leafOptions
     );
     if (!found) {
       break;
@@ -110,11 +137,17 @@ function removeRightmostMatch(group, predicate) {
   }
   return false;
 }
-function removeOrMutateRightmostPolarityMatch(group, key, polarity, value) {
+function removeOrMutateRightmostPolarityMatch(group, key, polarity, value, leafOptions) {
   for (let i = group.children.length - 1; i >= 0; i--) {
     const child = group.children[i];
     if (isFilterFieldGroupNode(child)) {
-      if (removeOrMutateRightmostPolarityMatch(child, key, polarity, value)) {
+      if (removeOrMutateRightmostPolarityMatch(
+        child,
+        key,
+        polarity,
+        value,
+        leafOptions
+      )) {
         if (child.children.length === 0) {
           group.children.splice(i, 1);
         }
@@ -135,7 +168,7 @@ function removeOrMutateRightmostPolarityMatch(group, key, polarity, value) {
       if (isFilterFieldListNode(statementValue)) {
         const list = statementValue;
         const valueIndex = list.value.findIndex(
-          (leaf) => leafEquals(leaf, value)
+          (leaf) => leafEquals(leaf, value, leafOptions)
         );
         if (valueIndex === -1) {
           continue;
@@ -157,7 +190,11 @@ function removeOrMutateRightmostPolarityMatch(group, key, polarity, value) {
           list.value.splice(valueIndex, 1);
         }
         return true;
-      } else if (statementValue.type !== "Error" && leafEquals(statementValue, value)) {
+      } else if (statementValue.type !== "Error" && leafEquals(
+        statementValue,
+        value,
+        leafOptions
+      )) {
         group.children.splice(i, 1);
         if (group.children.length === 1) {
           recursiveClearExplicitGroup(group);

package/esm/filters/filter-field/utils/value-operations/remove-filter.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../src/filters/filter-field/utils/value-operations/remove-filter.ts"],
-  "sourcesContent": ["import {\n  leafEquals,\n  mapInputOperator,\n  statementPolarity,\n} from './value-operation-utils.js';\nimport type {\n  SimpleFilterFieldComparisonOperatorNode,\n  SimpleFilterFieldGroupNode,\n  SimpleFilterFieldLeafNode,\n  SimpleFilterFieldListNode,\n  SimpleFilterFieldNode,\n  SimpleFilterFieldStatementNode,\n} from '../../types/conversion-tree-nodes.js';\nimport type {\n  FilterFieldValueOperationResult,\n  FilterFieldValueOperationStatement,\n} from '../../types/value-operations.js';\nimport { convertStringToFilterFieldTree } from '../conversion/string-tree-conversion.js';\nimport { convertFilterFieldTreeToString } from '../conversion/tree-string-conversion.js';\nimport {\n  isFilterFieldGroupNode,\n  isFilterFieldListNode,\n  isFilterFieldStatementNode,\n} from '../tree-node-guards.js';\nimport { FILTERFIELD_ALL_OPERATORS } from '../validation-utils/operator-specification.js';\n\n/**\n * Removes a filter statement or value from an existing FilterField value string.\n *\n * - If the value is not present for the specified key, the statement is not changed.\n * - If removing a value from `key in (v1, v2)` leaves one value, the statement collapses to `key = v1`.\n * - When multiple statements with the same key, operator and value exist, the rightmost one (in document order) is removed.\n * - When `options.removeAll` is `true`, all matching occurrences are removed instead of only the rightmost one.\n *\n * @public\n * @param currentValue - The current FilterField value string.\n * @param filter - The filter statement or value to remove.\n * @param options - Optional configuration for the remove operation.\n * @returns The new FilterField value string and whether the operation produced a change.\n */\nexport function removeFilter(\n  currentValue: string,\n  filter: FilterFieldValueOperationStatement,\n  options?: { removeAll?: boolean },\n): FilterFieldValueOperationResult {\n  // Parse with a permissive validatorMap so all operators (including !~ / ~,\n  // which are absent from the default set) are preserved as valid nodes rather\n  // than being down-converted to Error nodes by the parser.\n  const { tree } = convertStringToFilterFieldTree(currentValue, {\n    validatorMap: {\n      comparisonOperators: [...FILTERFIELD_ALL_OPERATORS],\n    },\n    parserConfig: {\n      searchConversion: true,\n      matchesWildcardConversion: true,\n    },\n  });\n\n  if (!tree) {\n    return { updatedStatement: false, value: currentValue };\n  }\n\n  const operator = mapInputOperator(filter.comparisonOperator);\n  let updatedStatement = false;\n\n  // Search operator: find and remove a matching `* ~ value` statement.\n  if (operator.node.type === 'SearchOperator') {\n    if (filter.value === undefined) {\n      return { updatedStatement: false, value: currentValue };\n    }\n    do {\n      const found = removeRightmostMatch(tree, (statement) => {\n        const statementOperator = statement.comparisonOperator;\n        const statementValue = statement.value;\n        return (\n          statementOperator?.type === 'SearchOperator' &&\n          statementValue !== undefined &&\n          !isFilterFieldListNode(statementValue) &&\n          leafEquals(\n            statementValue as SimpleFilterFieldLeafNode,\n            filter.value as string | number | boolean,\n          )\n        );\n      });\n      if (!found) {\n        break;\n      }\n      updatedStatement = true;\n    } while (options?.removeAll);\n    return updatedStatement\n      ? { updatedStatement: true, value: convertFilterFieldTreeToString(tree) }\n      : { updatedStatement: false, value: currentValue };\n  }\n\n  if (filter.key === undefined) {\n    return { updatedStatement: false, value: currentValue };\n  }\n\n  // Polarity 'none' operators (exists, not-exists, comparison operators like <, >, \u2026):\n  // require an exact key+operator(+value) match and remove the whole statement.\n  if (operator.polarity === 'none') {\n    do {\n      const found = removeRightmostMatch(tree, (statement) => {\n        const statementKey = statement.key;\n        if (\n          !statementKey ||\n          (statementKey.type !== 'Key' && statementKey.type !== 'JSONPath') ||\n          statementKey.value !== filter.key\n        ) {\n          return false;\n        }\n        const statementOperator = statement.comparisonOperator;\n        if (\n          !statementOperator ||\n          statementOperator.type !== operator.node.type ||\n          statementOperator.value !== operator.node.value\n        ) {\n          return false;\n        }\n        if (\n          operator.node.type === 'ExistsOperator' ||\n          filter.value === undefined\n        ) {\n          return true;\n        }\n        const statementValue = statement.value;\n        return (\n          statementValue !== undefined &&\n          !isFilterFieldListNode(statementValue) &&\n          statementValue.type !== 'Error' &&\n          leafEquals(statementValue as SimpleFilterFieldLeafNode, filter.value)\n        );\n      });\n      if (!found) {\n        break;\n      }\n      updatedStatement = true;\n    } while (options?.removeAll);\n    return updatedStatement\n      ? { updatedStatement: true, value: convertFilterFieldTreeToString(tree) }\n      : { updatedStatement: false, value: currentValue };\n  }\n\n  // Polarity-based operators (equals/in or not-equals/not-in): target the\n  // rightmost statement with matching key, polarity, and containing the target value.\n  do {\n    const found = removeOrMutateRightmostPolarityMatch(\n      tree,\n      filter.key,\n      operator.polarity,\n      filter.value as string | number | boolean,\n    );\n    if (!found) {\n      break;\n    }\n    updatedStatement = true;\n  } while (options?.removeAll);\n\n  return updatedStatement\n    ? { updatedStatement: true, value: convertFilterFieldTreeToString(tree) }\n    : { updatedStatement: false, value: currentValue };\n}\n\n// Traverses the tree in reverse and removes the rightmost statement for which\n// `predicate` returns `true`. Propagates empty-group cleanup as it unwinds.\nfunction removeRightmostMatch(\n  group: SimpleFilterFieldGroupNode,\n  predicate: (statement: SimpleFilterFieldStatementNode) => boolean,\n): boolean {\n  for (let i = group.children.length - 1; i >= 0; i--) {\n    const child: SimpleFilterFieldNode = group.children[i];\n    if (isFilterFieldGroupNode(child)) {\n      if (removeRightmostMatch(child, predicate)) {\n        if (child.children.length === 0) {\n          group.children.splice(i, 1);\n        }\n        if (group.children.length === 1) {\n          recursiveClearExplicitGroup(group);\n        }\n        return true;\n      }\n    } else if (isFilterFieldStatementNode(child) && predicate(child)) {\n      group.children.splice(i, 1);\n      if (group.children.length === 1) {\n        recursiveClearExplicitGroup(group);\n      }\n      return true;\n    }\n  }\n  return false;\n}\n\n// Traverses the tree in reverse and, at the rightmost statement matching the\n// given key + polarity + value, either:\n//   - splices a value from the list (\u2265 3 elements),\n//   - downgrades a 2-element list to a single-leaf statement, or\n//   - removes the statement entirely (1-element list or plain leaf).\n// Returns true if a match was found and acted on.\nfunction removeOrMutateRightmostPolarityMatch(\n  group: SimpleFilterFieldGroupNode,\n  key: string,\n  polarity: 'positive' | 'negative',\n  value: string | number | boolean,\n): boolean {\n  for (let i = group.children.length - 1; i >= 0; i--) {\n    const child: SimpleFilterFieldNode = group.children[i];\n    if (isFilterFieldGroupNode(child)) {\n      if (removeOrMutateRightmostPolarityMatch(child, key, polarity, value)) {\n        if (child.children.length === 0) {\n          group.children.splice(i, 1);\n        }\n        if (group.children.length === 1) {\n          recursiveClearExplicitGroup(group);\n        }\n        return true;\n      }\n    } else if (isFilterFieldStatementNode(child)) {\n      const statementKey = child.key;\n      if (\n        !statementKey ||\n        (statementKey.type !== 'Key' && statementKey.type !== 'JSONPath') ||\n        statementKey.value !== key ||\n        statementPolarity(child) !== polarity\n      ) {\n        continue;\n      }\n      const statementValue = child.value;\n      if (!statementValue) {\n        continue;\n      }\n      if (isFilterFieldListNode(statementValue)) {\n        const list = statementValue as SimpleFilterFieldListNode;\n        const valueIndex = list.value.findIndex((leaf) =>\n          leafEquals(leaf, value),\n        );\n        if (valueIndex === -1) {\n          continue;\n        }\n        if (list.value.length === 1) {\n          // Only one value left \u2014 remove the whole statement.\n          group.children.splice(i, 1);\n          if (group.children.length === 1) {\n            recursiveClearExplicitGroup(group);\n          }\n        } else if (list.value.length === 2) {\n          // Downgrade `key in (a, b)` \u2192 `key = a` (the remaining value).\n          const remaining = list.value[valueIndex === 0 ? 1 : 0];\n          const statement = child as SimpleFilterFieldStatementNode;\n          statement.comparisonOperator = {\n            type: 'ComparisonOperator',\n            value: polarity === 'positive' ? '=' : '!=',\n          } as SimpleFilterFieldComparisonOperatorNode;\n          statement.value = remaining;\n        } else {\n          list.value.splice(valueIndex, 1);\n        }\n        return true;\n      } else if (\n        statementValue.type !== 'Error' &&\n        leafEquals(statementValue as SimpleFilterFieldLeafNode, value)\n      ) {\n        // Single-leaf statement \u2014 remove it.\n        group.children.splice(i, 1);\n        if (group.children.length === 1) {\n          recursiveClearExplicitGroup(group);\n        }\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\nfunction recursiveClearExplicitGroup(group: SimpleFilterFieldGroupNode): void {\n  group.explicit = false;\n  if (group.children.length <= 1) {\n    group.explicitLogicalOperator = false;\n  }\n  if (\n    group.children.length === 1 &&\n    isFilterFieldGroupNode(group.children[0])\n  ) {\n    recursiveClearExplicitGroup(group.children[0]);\n  }\n}\n"],
-  "mappings": "AAAA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAaP,SAAS,sCAAsC;AAC/C,SAAS,sCAAsC;AAC/C;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,iCAAiC;AAgBnC,SAAS,aACd,cACA,QACA,SACiC;AAIjC,QAAM,EAAE,KAAK,IAAI,+BAA+B,cAAc;AAAA,IAC5D,cAAc;AAAA,MACZ,qBAAqB,CAAC,GAAG,yBAAyB;AAAA,IACpD;AAAA,IACA,cAAc;AAAA,MACZ,kBAAkB;AAAA,MAClB,2BAA2B;AAAA,IAC7B;AAAA,EACF,CAAC;AAED,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACxD;AAEA,QAAM,WAAW,iBAAiB,OAAO,kBAAkB;AAC3D,MAAI,mBAAmB;AAGvB,MAAI,SAAS,KAAK,SAAS,kBAAkB;AAC3C,QAAI,OAAO,UAAU,QAAW;AAC9B,aAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,IACxD;AACA,OAAG;AACD,YAAM,QAAQ,qBAAqB,MAAM,CAAC,cAAc;AACtD,cAAM,oBAAoB,UAAU;AACpC,cAAM,iBAAiB,UAAU;AACjC,eACE,mBAAmB,SAAS,oBAC5B,mBAAmB,UACnB,CAAC,sBAAsB,cAAc,KACrC;AAAA,UACE;AAAA,UACA,OAAO;AAAA,QACT;AAAA,MAEJ,CAAC;AACD,UAAI,CAAC,OAAO;AACV;AAAA,MACF;AACA,yBAAmB;AAAA,IACrB,SAAS,SAAS;AAClB,WAAO,mBACH,EAAE,kBAAkB,MAAM,OAAO,+BAA+B,IAAI,EAAE,IACtE,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACrD;AAEA,MAAI,OAAO,QAAQ,QAAW;AAC5B,WAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACxD;AAIA,MAAI,SAAS,aAAa,QAAQ;AAChC,OAAG;AACD,YAAM,QAAQ,qBAAqB,MAAM,CAAC,cAAc;AACtD,cAAM,eAAe,UAAU;AAC/B,YACE,CAAC,gBACA,aAAa,SAAS,SAAS,aAAa,SAAS,cACtD,aAAa,UAAU,OAAO,KAC9B;AACA,iBAAO;AAAA,QACT;AACA,cAAM,oBAAoB,UAAU;AACpC,YACE,CAAC,qBACD,kBAAkB,SAAS,SAAS,KAAK,QACzC,kBAAkB,UAAU,SAAS,KAAK,OAC1C;AACA,iBAAO;AAAA,QACT;AACA,YACE,SAAS,KAAK,SAAS,oBACvB,OAAO,UAAU,QACjB;AACA,iBAAO;AAAA,QACT;AACA,cAAM,iBAAiB,UAAU;AACjC,eACE,mBAAmB,UACnB,CAAC,sBAAsB,cAAc,KACrC,eAAe,SAAS,WACxB,WAAW,gBAA6C,OAAO,KAAK;AAAA,MAExE,CAAC;AACD,UAAI,CAAC,OAAO;AACV;AAAA,MACF;AACA,yBAAmB;AAAA,IACrB,SAAS,SAAS;AAClB,WAAO,mBACH,EAAE,kBAAkB,MAAM,OAAO,+BAA+B,IAAI,EAAE,IACtE,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACrD;AAIA,KAAG;AACD,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA,OAAO;AAAA,MACP,SAAS;AAAA,MACT,OAAO;AAAA,IACT;AACA,QAAI,CAAC,OAAO;AACV;AAAA,IACF;AACA,uBAAmB;AAAA,EACrB,SAAS,SAAS;AAElB,SAAO,mBACH,EAAE,kBAAkB,MAAM,OAAO,+BAA+B,IAAI,EAAE,IACtE,EAAE,kBAAkB,OAAO,OAAO,aAAa;AACrD;AAIA,SAAS,qBACP,OACA,WACS;AACT,WAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,UAAM,QAA+B,MAAM,SAAS,CAAC;AACrD,QAAI,uBAAuB,KAAK,GAAG;AACjC,UAAI,qBAAqB,OAAO,SAAS,GAAG;AAC1C,YAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,gBAAM,SAAS,OAAO,GAAG,CAAC;AAAA,QAC5B;AACA,YAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,sCAA4B,KAAK;AAAA,QACnC;AACA,eAAO;AAAA,MACT;AAAA,IACF,WAAW,2BAA2B,KAAK,KAAK,UAAU,KAAK,GAAG;AAChE,YAAM,SAAS,OAAO,GAAG,CAAC;AAC1B,UAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,oCAA4B,KAAK;AAAA,MACnC;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAQA,SAAS,qCACP,OACA,KACA,UACA,OACS;AACT,WAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,UAAM,QAA+B,MAAM,SAAS,CAAC;AACrD,QAAI,uBAAuB,KAAK,GAAG;AACjC,UAAI,qCAAqC,OAAO,KAAK,UAAU,KAAK,GAAG;AACrE,YAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,gBAAM,SAAS,OAAO,GAAG,CAAC;AAAA,QAC5B;AACA,YAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,sCAA4B,KAAK;AAAA,QACnC;AACA,eAAO;AAAA,MACT;AAAA,IACF,WAAW,2BAA2B,KAAK,GAAG;AAC5C,YAAM,eAAe,MAAM;AAC3B,UACE,CAAC,gBACA,aAAa,SAAS,SAAS,aAAa,SAAS,cACtD,aAAa,UAAU,OACvB,kBAAkB,KAAK,MAAM,UAC7B;AACA;AAAA,MACF;AACA,YAAM,iBAAiB,MAAM;AAC7B,UAAI,CAAC,gBAAgB;AACnB;AAAA,MACF;AACA,UAAI,sBAAsB,cAAc,GAAG;AACzC,cAAM,OAAO;AACb,cAAM,aAAa,KAAK,MAAM;AAAA,UAAU,CAAC,SACvC,WAAW,MAAM,KAAK;AAAA,QACxB;AACA,YAAI,eAAe,IAAI;AACrB;AAAA,QACF;AACA,YAAI,KAAK,MAAM,WAAW,GAAG;AAE3B,gBAAM,SAAS,OAAO,GAAG,CAAC;AAC1B,cAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,wCAA4B,KAAK;AAAA,UACnC;AAAA,QACF,WAAW,KAAK,MAAM,WAAW,GAAG;AAElC,gBAAM,YAAY,KAAK,MAAM,eAAe,IAAI,IAAI,CAAC;AACrD,gBAAM,YAAY;AAClB,oBAAU,qBAAqB;AAAA,YAC7B,MAAM;AAAA,YACN,OAAO,aAAa,aAAa,MAAM;AAAA,UACzC;AACA,oBAAU,QAAQ;AAAA,QACpB,OAAO;AACL,eAAK,MAAM,OAAO,YAAY,CAAC;AAAA,QACjC;AACA,eAAO;AAAA,MACT,WACE,eAAe,SAAS,WACxB,WAAW,gBAA6C,KAAK,GAC7D;AAEA,cAAM,SAAS,OAAO,GAAG,CAAC;AAC1B,YAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,sCAA4B,KAAK;AAAA,QACnC;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,4BAA4B,OAAyC;AAC5E,QAAM,WAAW;AACjB,MAAI,MAAM,SAAS,UAAU,GAAG;AAC9B,UAAM,0BAA0B;AAAA,EAClC;AACA,MACE,MAAM,SAAS,WAAW,KAC1B,uBAAuB,MAAM,SAAS,CAAC,CAAC,GACxC;AACA,gCAA4B,MAAM,SAAS,CAAC,CAAC;AAAA,EAC/C;AACF;",
+  "sourcesContent": ["import {\n  leafEquals,\n  mapInputOperator,\n  statementPolarity,\n  type FilterFieldValueTypeHint,\n} from './value-operation-utils.js';\nimport type { FilterFieldProps } from '../../FilterField.types.js';\nimport type {\n  SimpleFilterFieldComparisonOperatorNode,\n  SimpleFilterFieldGroupNode,\n  SimpleFilterFieldLeafNode,\n  SimpleFilterFieldListNode,\n  SimpleFilterFieldNode,\n  SimpleFilterFieldStatementNode,\n} from '../../types/conversion-tree-nodes.js';\nimport type {\n  FilterFieldRemoveStatement,\n  FilterFieldValueOperationResult,\n} from '../../types/value-operations.js';\nimport { convertStringToFilterFieldTree } from '../conversion/string-tree-conversion.js';\nimport { convertFilterFieldTreeToString } from '../conversion/tree-string-conversion.js';\nimport {\n  isFilterFieldGroupNode,\n  isFilterFieldListNode,\n  isFilterFieldStatementNode,\n} from '../tree-node-guards.js';\nimport { FILTERFIELD_ALL_OPERATORS } from '../validation-utils/operator-specification.js';\n\n/**\n * Removes a filter statement or value from an existing FilterField value string.\n *\n * - If the value is not present for the specified key, the statement is not changed.\n * - If removing a value from `key in (v1, v2)` leaves one value, the statement collapses to `key = v1`.\n * - When multiple statements with the same key, operator and value exist, the rightmost one (in document order) is removed.\n * - When `options.removeAll` is `true`, all matching occurrences are removed instead of only the rightmost one.\n * - Passing a key-only statement (`{ key }`, without `value` or `comparisonOperator`) matches every\n *   statement for that key regardless of operator or value \u2014 combine with `removeAll` to clear the key.\n *\n * @public\n * @param currentValue - The current FilterField value string.\n * @param filter - The filter statement or value to remove. Pass `valueType` on the filter to match\n *                 against values added with the same type hint \u2014 e.g. `valueType: 'String'` removes\n *                 only a `String` leaf, not a Boolean leaf of the same value. For the flag-gated\n *                 types (`'IPAddress'`, `'Timestamp'`, `'UID'`, `'SmartscapeId'`) pass the matching\n *                 `options.parserConfig` flag as well, otherwise the value resolves to a `String`.\n * @param options - Optional configuration for the remove operation. `parserConfig` controls how\n *                  `currentValue` is parsed and how `valueType` is resolved; pass the same config\n *                  used for the corresponding `addFilter` call so removal stays symmetric.\n * @returns The new FilterField value string and whether the operation produced a change.\n */\nexport function removeFilter(\n  currentValue: string,\n  filter: FilterFieldRemoveStatement,\n  options?: {\n    removeAll?: boolean;\n    /** Parser config to apply when interpreting the existing value and resolving `valueType`. */\n    parserConfig?: FilterFieldProps['parserConfig'];\n  },\n): FilterFieldValueOperationResult {\n  const parserConfig: FilterFieldProps['parserConfig'] = {\n    ...options?.parserConfig,\n    // Search and mid-value wildcard statements must always be recognized so they\n    // can be targeted for removal regardless of the caller's config.\n    searchConversion: true,\n    matchesWildcardConversion: true,\n  };\n  // Parse with a permissive validatorMap so all operators (including !~ / ~,\n  // which are absent from the default set) are preserved as valid nodes rather\n  // than being down-converted to Error nodes by the parser.\n  const { tree } = convertStringToFilterFieldTree(currentValue, {\n    validatorMap: {\n      comparisonOperators: [...FILTERFIELD_ALL_OPERATORS],\n    },\n    parserConfig,\n  });\n\n  if (!tree) {\n    return { updatedStatement: false, value: currentValue };\n  }\n\n  let updatedStatement = false;\n\n  // Key-only statement: remove statements matching this key regardless of operator or value.\n  // Check with `'value' in filter` rather than `filter.value === undefined` so a caller who\n  // accidentally passes `{ key, value: undefined }` \u2014 which the `value?: never` arm makes\n  // structurally assignable \u2014 falls through to the normal path and no-ops, rather than\n  // silently clearing all statements for the key.\n  if (\n    filter.key !== undefined &&\n    !('value' in filter) &&\n    !('comparisonOperator' in filter)\n  ) {\n    do {\n      const found = removeRightmostMatch(tree, (statement) => {\n        const statementKey = statement.key;\n        return (\n          !!statementKey &&\n          (statementKey.type === 'Key' || statementKey.type === 'JSONPath') &&\n          statementKey.value === filter.key\n        );\n      });\n      if (!found) {\n        break;\n      }\n      updatedStatement = true;\n    } while (options?.removeAll);\n    return updatedStatement\n      ? { updatedStatement: true, value: convertFilterFieldTreeToString(tree) }\n      : { updatedStatement: false, value: currentValue };\n  }\n\n  const operator = mapInputOperator(filter.comparisonOperator);\n  const leafOptions = {\n    valueType: filter.valueType,\n    parserConfig,\n  };\n\n  // Search operator: find and remove a matching `* ~ value` statement.\n  if (operator.node.type === 'SearchOperator') {\n    if (filter.value === undefined) {\n      return { updatedStatement: false, value: currentValue };\n    }\n    do {\n      const found = removeRightmostMatch(tree, (statement) => {\n        const statementOperator = statement.comparisonOperator;\n        const statementValue = statement.value;\n        return (\n          statementOperator?.type === 'SearchOperator' &&\n          statementValue !== undefined &&\n          !isFilterFieldListNode(statementValue) &&\n          leafEquals(\n            statementValue as SimpleFilterFieldLeafNode,\n            filter.value as string | number | boolean,\n            leafOptions,\n          )\n        );\n      });\n      if (!found) {\n        break;\n      }\n      updatedStatement = true;\n    } while (options?.removeAll);\n    return updatedStatement\n      ? { updatedStatement: true, value: convertFilterFieldTreeToString(tree) }\n      : { updatedStatement: false, value: currentValue };\n  }\n\n  if (filter.key === undefined) {\n    return { updatedStatement: false, value: currentValue };\n  }\n\n  // Polarity 'none' operators (exists, not-exists, comparison operators like <, >, \u2026):\n  // require an exact key+operator(+value) match and remove the whole statement.\n  if (operator.polarity === 'none') {\n    do {\n      const found = removeRightmostMatch(tree, (statement) => {\n        const statementKey = statement.key;\n        if (\n          !statementKey ||\n          (statementKey.type !== 'Key' && statementKey.type !== 'JSONPath') ||\n          statementKey.value !== filter.key\n        ) {\n          return false;\n        }\n        const statementOperator = statement.comparisonOperator;\n        if (\n          !statementOperator ||\n          statementOperator.type !== operator.node.type ||\n          statementOperator.value !== operator.node.value\n        ) {\n          return false;\n        }\n        if (\n          operator.node.type === 'ExistsOperator' ||\n          filter.value === undefined\n        ) {\n          return true;\n        }\n        const statementValue = statement.value;\n        return (\n          statementValue !== undefined &&\n          !isFilterFieldListNode(statementValue) &&\n          statementValue.type !== 'Error' &&\n          leafEquals(\n            statementValue as SimpleFilterFieldLeafNode,\n            filter.value,\n            leafOptions,\n          )\n        );\n      });\n      if (!found) {\n        break;\n      }\n      updatedStatement = true;\n    } while (options?.removeAll);\n    return updatedStatement\n      ? { updatedStatement: true, value: convertFilterFieldTreeToString(tree) }\n      : { updatedStatement: false, value: currentValue };\n  }\n\n  // Polarity-based operators (equals/in or not-equals/not-in): target the\n  // rightmost statement with matching key, polarity, and containing the target value.\n  do {\n    const found = removeOrMutateRightmostPolarityMatch(\n      tree,\n      filter.key,\n      operator.polarity,\n      filter.value as string | number | boolean,\n      leafOptions,\n    );\n    if (!found) {\n      break;\n    }\n    updatedStatement = true;\n  } while (options?.removeAll);\n\n  return updatedStatement\n    ? { updatedStatement: true, value: convertFilterFieldTreeToString(tree) }\n    : { updatedStatement: false, value: currentValue };\n}\n\n// Traverses the tree in reverse and removes the rightmost statement for which\n// `predicate` returns `true`. Propagates empty-group cleanup as it unwinds.\nfunction removeRightmostMatch(\n  group: SimpleFilterFieldGroupNode,\n  predicate: (statement: SimpleFilterFieldStatementNode) => boolean,\n): boolean {\n  for (let i = group.children.length - 1; i >= 0; i--) {\n    const child: SimpleFilterFieldNode = group.children[i];\n    if (isFilterFieldGroupNode(child)) {\n      if (removeRightmostMatch(child, predicate)) {\n        if (child.children.length === 0) {\n          group.children.splice(i, 1);\n        }\n        if (group.children.length === 1) {\n          recursiveClearExplicitGroup(group);\n        }\n        return true;\n      }\n    } else if (isFilterFieldStatementNode(child) && predicate(child)) {\n      group.children.splice(i, 1);\n      if (group.children.length === 1) {\n        recursiveClearExplicitGroup(group);\n      }\n      return true;\n    }\n  }\n  return false;\n}\n\n// Traverses the tree in reverse and, at the rightmost statement matching the\n// given key + polarity + value, either:\n//   - splices a value from the list (\u2265 3 elements),\n//   - downgrades a 2-element list to a single-leaf statement, or\n//   - removes the statement entirely (1-element list or plain leaf).\n// Returns true if a match was found and acted on.\nfunction removeOrMutateRightmostPolarityMatch(\n  group: SimpleFilterFieldGroupNode,\n  key: string,\n  polarity: 'positive' | 'negative',\n  value: string | number | boolean,\n  leafOptions?: {\n    valueType?: FilterFieldValueTypeHint;\n    parserConfig?: FilterFieldProps['parserConfig'];\n  },\n): boolean {\n  for (let i = group.children.length - 1; i >= 0; i--) {\n    const child: SimpleFilterFieldNode = group.children[i];\n    if (isFilterFieldGroupNode(child)) {\n      if (\n        removeOrMutateRightmostPolarityMatch(\n          child,\n          key,\n          polarity,\n          value,\n          leafOptions,\n        )\n      ) {\n        if (child.children.length === 0) {\n          group.children.splice(i, 1);\n        }\n        if (group.children.length === 1) {\n          recursiveClearExplicitGroup(group);\n        }\n        return true;\n      }\n    } else if (isFilterFieldStatementNode(child)) {\n      const statementKey = child.key;\n      if (\n        !statementKey ||\n        (statementKey.type !== 'Key' && statementKey.type !== 'JSONPath') ||\n        statementKey.value !== key ||\n        statementPolarity(child) !== polarity\n      ) {\n        continue;\n      }\n      const statementValue = child.value;\n      if (!statementValue) {\n        continue;\n      }\n      if (isFilterFieldListNode(statementValue)) {\n        const list = statementValue as SimpleFilterFieldListNode;\n        const valueIndex = list.value.findIndex((leaf) =>\n          leafEquals(leaf, value, leafOptions),\n        );\n        if (valueIndex === -1) {\n          continue;\n        }\n        if (list.value.length === 1) {\n          // Only one value left \u2014 remove the whole statement.\n          group.children.splice(i, 1);\n          if (group.children.length === 1) {\n            recursiveClearExplicitGroup(group);\n          }\n        } else if (list.value.length === 2) {\n          // Downgrade `key in (a, b)` \u2192 `key = a` (the remaining value).\n          const remaining = list.value[valueIndex === 0 ? 1 : 0];\n          const statement = child as SimpleFilterFieldStatementNode;\n          statement.comparisonOperator = {\n            type: 'ComparisonOperator',\n            value: polarity === 'positive' ? '=' : '!=',\n          } as SimpleFilterFieldComparisonOperatorNode;\n          statement.value = remaining;\n        } else {\n          list.value.splice(valueIndex, 1);\n        }\n        return true;\n      } else if (\n        statementValue.type !== 'Error' &&\n        leafEquals(\n          statementValue as SimpleFilterFieldLeafNode,\n          value,\n          leafOptions,\n        )\n      ) {\n        // Single-leaf statement \u2014 remove it.\n        group.children.splice(i, 1);\n        if (group.children.length === 1) {\n          recursiveClearExplicitGroup(group);\n        }\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\nfunction recursiveClearExplicitGroup(group: SimpleFilterFieldGroupNode): void {\n  group.explicit = false;\n  if (group.children.length <= 1) {\n    group.explicitLogicalOperator = false;\n  }\n  if (\n    group.children.length === 1 &&\n    isFilterFieldGroupNode(group.children[0])\n  ) {\n    recursiveClearExplicitGroup(group.children[0]);\n  }\n}\n"],
+  "mappings": "AAAA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OAEK;AAcP,SAAS,sCAAsC;AAC/C,SAAS,sCAAsC;AAC/C;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,iCAAiC;AAwBnC,SAAS,aACd,cACA,QACA,SAKiC;AACjC,QAAM,eAAiD;AAAA,IACrD,GAAG,SAAS;AAAA;AAAA;AAAA,IAGZ,kBAAkB;AAAA,IAClB,2BAA2B;AAAA,EAC7B;AAIA,QAAM,EAAE,KAAK,IAAI,+BAA+B,cAAc;AAAA,IAC5D,cAAc;AAAA,MACZ,qBAAqB,CAAC,GAAG,yBAAyB;AAAA,IACpD;AAAA,IACA;AAAA,EACF,CAAC;AAED,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACxD;AAEA,MAAI,mBAAmB;AAOvB,MACE,OAAO,QAAQ,UACf,EAAE,WAAW,WACb,EAAE,wBAAwB,SAC1B;AACA,OAAG;AACD,YAAM,QAAQ,qBAAqB,MAAM,CAAC,cAAc;AACtD,cAAM,eAAe,UAAU;AAC/B,eACE,CAAC,CAAC,iBACD,aAAa,SAAS,SAAS,aAAa,SAAS,eACtD,aAAa,UAAU,OAAO;AAAA,MAElC,CAAC;AACD,UAAI,CAAC,OAAO;AACV;AAAA,MACF;AACA,yBAAmB;AAAA,IACrB,SAAS,SAAS;AAClB,WAAO,mBACH,EAAE,kBAAkB,MAAM,OAAO,+BAA+B,IAAI,EAAE,IACtE,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACrD;AAEA,QAAM,WAAW,iBAAiB,OAAO,kBAAkB;AAC3D,QAAM,cAAc;AAAA,IAClB,WAAW,OAAO;AAAA,IAClB;AAAA,EACF;AAGA,MAAI,SAAS,KAAK,SAAS,kBAAkB;AAC3C,QAAI,OAAO,UAAU,QAAW;AAC9B,aAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,IACxD;AACA,OAAG;AACD,YAAM,QAAQ,qBAAqB,MAAM,CAAC,cAAc;AACtD,cAAM,oBAAoB,UAAU;AACpC,cAAM,iBAAiB,UAAU;AACjC,eACE,mBAAmB,SAAS,oBAC5B,mBAAmB,UACnB,CAAC,sBAAsB,cAAc,KACrC;AAAA,UACE;AAAA,UACA,OAAO;AAAA,UACP;AAAA,QACF;AAAA,MAEJ,CAAC;AACD,UAAI,CAAC,OAAO;AACV;AAAA,MACF;AACA,yBAAmB;AAAA,IACrB,SAAS,SAAS;AAClB,WAAO,mBACH,EAAE,kBAAkB,MAAM,OAAO,+BAA+B,IAAI,EAAE,IACtE,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACrD;AAEA,MAAI,OAAO,QAAQ,QAAW;AAC5B,WAAO,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACxD;AAIA,MAAI,SAAS,aAAa,QAAQ;AAChC,OAAG;AACD,YAAM,QAAQ,qBAAqB,MAAM,CAAC,cAAc;AACtD,cAAM,eAAe,UAAU;AAC/B,YACE,CAAC,gBACA,aAAa,SAAS,SAAS,aAAa,SAAS,cACtD,aAAa,UAAU,OAAO,KAC9B;AACA,iBAAO;AAAA,QACT;AACA,cAAM,oBAAoB,UAAU;AACpC,YACE,CAAC,qBACD,kBAAkB,SAAS,SAAS,KAAK,QACzC,kBAAkB,UAAU,SAAS,KAAK,OAC1C;AACA,iBAAO;AAAA,QACT;AACA,YACE,SAAS,KAAK,SAAS,oBACvB,OAAO,UAAU,QACjB;AACA,iBAAO;AAAA,QACT;AACA,cAAM,iBAAiB,UAAU;AACjC,eACE,mBAAmB,UACnB,CAAC,sBAAsB,cAAc,KACrC,eAAe,SAAS,WACxB;AAAA,UACE;AAAA,UACA,OAAO;AAAA,UACP;AAAA,QACF;AAAA,MAEJ,CAAC;AACD,UAAI,CAAC,OAAO;AACV;AAAA,MACF;AACA,yBAAmB;AAAA,IACrB,SAAS,SAAS;AAClB,WAAO,mBACH,EAAE,kBAAkB,MAAM,OAAO,+BAA+B,IAAI,EAAE,IACtE,EAAE,kBAAkB,OAAO,OAAO,aAAa;AAAA,EACrD;AAIA,KAAG;AACD,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA,OAAO;AAAA,MACP,SAAS;AAAA,MACT,OAAO;AAAA,MACP;AAAA,IACF;AACA,QAAI,CAAC,OAAO;AACV;AAAA,IACF;AACA,uBAAmB;AAAA,EACrB,SAAS,SAAS;AAElB,SAAO,mBACH,EAAE,kBAAkB,MAAM,OAAO,+BAA+B,IAAI,EAAE,IACtE,EAAE,kBAAkB,OAAO,OAAO,aAAa;AACrD;AAIA,SAAS,qBACP,OACA,WACS;AACT,WAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,UAAM,QAA+B,MAAM,SAAS,CAAC;AACrD,QAAI,uBAAuB,KAAK,GAAG;AACjC,UAAI,qBAAqB,OAAO,SAAS,GAAG;AAC1C,YAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,gBAAM,SAAS,OAAO,GAAG,CAAC;AAAA,QAC5B;AACA,YAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,sCAA4B,KAAK;AAAA,QACnC;AACA,eAAO;AAAA,MACT;AAAA,IACF,WAAW,2BAA2B,KAAK,KAAK,UAAU,KAAK,GAAG;AAChE,YAAM,SAAS,OAAO,GAAG,CAAC;AAC1B,UAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,oCAA4B,KAAK;AAAA,MACnC;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAQA,SAAS,qCACP,OACA,KACA,UACA,OACA,aAIS;AACT,WAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,UAAM,QAA+B,MAAM,SAAS,CAAC;AACrD,QAAI,uBAAuB,KAAK,GAAG;AACjC,UACE;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,GACA;AACA,YAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,gBAAM,SAAS,OAAO,GAAG,CAAC;AAAA,QAC5B;AACA,YAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,sCAA4B,KAAK;AAAA,QACnC;AACA,eAAO;AAAA,MACT;AAAA,IACF,WAAW,2BAA2B,KAAK,GAAG;AAC5C,YAAM,eAAe,MAAM;AAC3B,UACE,CAAC,gBACA,aAAa,SAAS,SAAS,aAAa,SAAS,cACtD,aAAa,UAAU,OACvB,kBAAkB,KAAK,MAAM,UAC7B;AACA;AAAA,MACF;AACA,YAAM,iBAAiB,MAAM;AAC7B,UAAI,CAAC,gBAAgB;AACnB;AAAA,MACF;AACA,UAAI,sBAAsB,cAAc,GAAG;AACzC,cAAM,OAAO;AACb,cAAM,aAAa,KAAK,MAAM;AAAA,UAAU,CAAC,SACvC,WAAW,MAAM,OAAO,WAAW;AAAA,QACrC;AACA,YAAI,eAAe,IAAI;AACrB;AAAA,QACF;AACA,YAAI,KAAK,MAAM,WAAW,GAAG;AAE3B,gBAAM,SAAS,OAAO,GAAG,CAAC;AAC1B,cAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,wCAA4B,KAAK;AAAA,UACnC;AAAA,QACF,WAAW,KAAK,MAAM,WAAW,GAAG;AAElC,gBAAM,YAAY,KAAK,MAAM,eAAe,IAAI,IAAI,CAAC;AACrD,gBAAM,YAAY;AAClB,oBAAU,qBAAqB;AAAA,YAC7B,MAAM;AAAA,YACN,OAAO,aAAa,aAAa,MAAM;AAAA,UACzC;AACA,oBAAU,QAAQ;AAAA,QACpB,OAAO;AACL,eAAK,MAAM,OAAO,YAAY,CAAC;AAAA,QACjC;AACA,eAAO;AAAA,MACT,WACE,eAAe,SAAS,WACxB;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,MACF,GACA;AAEA,cAAM,SAAS,OAAO,GAAG,CAAC;AAC1B,YAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,sCAA4B,KAAK;AAAA,QACnC;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,4BAA4B,OAAyC;AAC5E,QAAM,WAAW;AACjB,MAAI,MAAM,SAAS,UAAU,GAAG;AAC9B,UAAM,0BAA0B;AAAA,EAClC;AACA,MACE,MAAM,SAAS,WAAW,KAC1B,uBAAuB,MAAM,SAAS,CAAC,CAAC,GACxC;AACA,gCAA4B,MAAM,SAAS,CAAC,CAAC;AAAA,EAC/C;AACF;",
   "names": []
 }

package/esm/filters/filter-field/utils/value-operations/value-operation-utils.js

@@ -4,6 +4,12 @@ import {
   isFilterFieldListNode,
   isFilterFieldStatementNode
 } from "../tree-node-guards.js";
+import {
+  isValidIPAddress,
+  isValidSmartscapeId,
+  isValidTimestamp,
+  isValidUID
+} from "../validation-utils/type-validators.js";
 const DURATION_REGEX = /^(\d+)(ns|ms|s|m|h|d)$/i;
 const VARIABLE_REGEX = /^\$[A-Za-z_]\w*$/;
 const OPERATOR_MAP = {
@@ -82,7 +88,150 @@ function statementPolarity(statement) {
   }
   return "none";
 }
-function leafEquals(leaf, value) {
+function isExplicitValueType(hint) {
+  return hint !== void 0 && hint !== "Any" && hint !== "JSONPath" && // Built-in primitives: String, Number, Boolean, Duration, IPAddress, UID, Timestamp, SmartscapeId
+  (hint === "String" || hint === "Number" || hint === "Boolean" || hint === "Duration" || hint === "IPAddress" || hint === "Timestamp" || hint === "UID" || hint === "SmartscapeId");
+}
+function makeTypedLeaf(value, parserConfig, valueType) {
+  if (!isExplicitValueType(valueType)) {
+    return void 0;
+  }
+  switch (valueType) {
+    case "String":
+      return { type: "String", value: String(value) };
+    case "Boolean": {
+      if (typeof value === "boolean") {
+        return { type: "Boolean", value };
+      }
+      if (value === "true" || value === "false") {
+        return { type: "Boolean", value: value === "true" };
+      }
+      return void 0;
+    }
+    case "Number": {
+      if (typeof value === "number") {
+        return { type: "Number", value };
+      }
+      if (typeof value === "string") {
+        const parsed = getNumberParser().parse(value);
+        if (!isNaN(parsed)) {
+          return { type: "Number", value: parsed };
+        }
+      }
+      return void 0;
+    }
+    case "Duration": {
+      const match = DURATION_REGEX.exec(String(value));
+      if (match) {
+        return {
+          type: "Duration",
+          value: parseInt(match[1], 10),
+          unit: match[2].toLowerCase()
+        };
+      }
+      return void 0;
+    }
+    case "IPAddress": {
+      const str = String(value);
+      if (parserConfig?.ipAddressConversion && isValidIPAddress(str)) {
+        return { type: "IPAddress", value: str, textValue: str };
+      }
+      return void 0;
+    }
+    case "Timestamp": {
+      const str = String(value);
+      if (parserConfig?.timestampConversion && isValidTimestamp(str)) {
+        return { type: "Timestamp", value: str, textValue: str };
+      }
+      return void 0;
+    }
+    case "UID": {
+      const str = String(value);
+      if (parserConfig?.uidConversion && isValidUID(str)) {
+        return { type: "UID", value: str, textValue: str };
+      }
+      return void 0;
+    }
+    case "SmartscapeId": {
+      const str = String(value);
+      if (parserConfig?.smartscapeIdConversion && isValidSmartscapeId(str)) {
+        return { type: "SmartscapeId", value: str, textValue: str };
+      }
+      return void 0;
+    }
+  }
+}
+function inferLeaf(value, parserConfig) {
+  if (typeof value === "number") {
+    return { type: "Number", value };
+  }
+  if (typeof value === "boolean") {
+    return { type: "Boolean", value };
+  }
+  const durationMatch = DURATION_REGEX.exec(value);
+  if (durationMatch) {
+    return {
+      type: "Duration",
+      value: parseInt(durationMatch[1], 10),
+      unit: durationMatch[2].toLowerCase()
+    };
+  }
+  if (value === "true" || value === "false") {
+    return { type: "Boolean", value: value === "true" };
+  }
+  const parsedNumber = getNumberParser().parse(value);
+  if (!isNaN(parsedNumber)) {
+    return { type: "Number", value: parsedNumber };
+  }
+  if (VARIABLE_REGEX.test(value)) {
+    return { type: "Variable", value, variableType: "Any" };
+  }
+  if (parserConfig?.ipAddressConversion && isValidIPAddress(value)) {
+    return { type: "IPAddress", value, textValue: value };
+  }
+  if (parserConfig?.timestampConversion && isValidTimestamp(value)) {
+    return { type: "Timestamp", value, textValue: value };
+  }
+  if (parserConfig?.uidConversion && isValidUID(value)) {
+    return { type: "UID", value, textValue: value };
+  }
+  if (parserConfig?.smartscapeIdConversion && isValidSmartscapeId(value)) {
+    return { type: "SmartscapeId", value, textValue: value };
+  }
+  return { type: "String", value };
+}
+function makeLeaf(value, parserConfig, valueType) {
+  if (valueType !== void 0) {
+    const typed = makeTypedLeaf(value, parserConfig, valueType);
+    if (typed !== void 0) {
+      return typed;
+    }
+  }
+  return inferLeaf(value, parserConfig);
+}
+function leafScalar(leaf) {
+  if (leaf.type === "Duration") {
+    return `${leaf.value}${leaf.unit}`;
+  }
+  const { value } = leaf;
+  if (typeof value === "string" || typeof value === "number" || typeof value === "boolean") {
+    return value;
+  }
+  return void 0;
+}
+function leafEquals(leaf, value, options) {
+  const { valueType, parserConfig } = options ?? {};
+  if (!isExplicitValueType(valueType)) {
+    return leafValueMatches(leaf, value);
+  }
+  const candidate = makeLeaf(value, parserConfig, valueType);
+  if (leaf.type !== candidate.type) {
+    return false;
+  }
+  const candidateScalar = leafScalar(candidate);
+  return candidateScalar !== void 0 && leafScalar(leaf) === candidateScalar;
+}
+function leafValueMatches(leaf, value) {
   switch (leaf.type) {
     case "Number":
       if (typeof value === "number") {
@@ -116,29 +265,35 @@ function leafEquals(leaf, value) {
       return false;
   }
 }
-function findSearchStatement(group, value) {
+function findSearchStatement(group, value, options) {
   for (let i = group.children.length - 1; i >= 0; i--) {
     const child = group.children[i];
     if (isFilterFieldGroupNode(child)) {
-      const nested = findSearchStatement(child, value);
+      const nested = findSearchStatement(child, value, options);
       if (nested) {
         return nested;
       }
     } else if (isFilterFieldStatementNode(child)) {
       const op = child.comparisonOperator;
       const leafValue = child.value;
-      if (op?.type === "SearchOperator" && leafValue !== void 0 && !isFilterFieldListNode(leafValue) && leafEquals(leafValue, value)) {
+      if (op?.type === "SearchOperator" && leafValue !== void 0 && !isFilterFieldListNode(leafValue) && leafEquals(leafValue, value, options)) {
         return child;
       }
     }
   }
   return void 0;
 }
-function findIdenticalStatement(group, key, operatorNode, value) {
+function findIdenticalStatement(group, key, operatorNode, value, options) {
   for (let i = group.children.length - 1; i >= 0; i--) {
     const child = group.children[i];
     if (isFilterFieldGroupNode(child)) {
-      const nested = findIdenticalStatement(child, key, operatorNode, value);
+      const nested = findIdenticalStatement(
+        child,
+        key,
+        operatorNode,
+        value,
+        options
+      );
       if (nested) {
         return nested;
       }
@@ -155,7 +310,7 @@ function findIdenticalStatement(group, key, operatorNode, value) {
         return child;
       }
       const childValue = child.value;
-      if (childValue && !isFilterFieldListNode(childValue) && childValue.type !== "Error" && leafEquals(childValue, value)) {
+      if (childValue && !isFilterFieldListNode(childValue) && childValue.type !== "Error" && leafEquals(childValue, value, options)) {
         return child;
       }
     }
@@ -169,6 +324,7 @@ export {
   findIdenticalStatement,
   findSearchStatement,
   leafEquals,
+  makeLeaf,
   mapInputOperator,
   statementPolarity
 };

package/esm/filters/filter-field/utils/value-operations/value-operation-utils.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../src/filters/filter-field/utils/value-operations/value-operation-utils.ts"],
-  "sourcesContent": ["import { getNumberParser } from '../../parser/getNumberParser.js';\nimport type {\n  SimpleFilterFieldComparisonOperatorNode,\n  SimpleFilterFieldExistsOperatorNode,\n  SimpleFilterFieldGroupNode,\n  SimpleFilterFieldInclusionOperatorNode,\n  SimpleFilterFieldLeafNode,\n  SimpleFilterFieldSearchOperatorNode,\n  SimpleFilterFieldStatementNode,\n} from '../../types/conversion-tree-nodes.js';\nimport {\n  isFilterFieldGroupNode,\n  isFilterFieldListNode,\n  isFilterFieldStatementNode,\n} from '../tree-node-guards.js';\n\n/** @internal */\nexport const DURATION_REGEX = /^(\\d+)(ns|ms|s|m|h|d)$/i;\n/** @internal */\nexport const VARIABLE_REGEX = /^\\$[A-Za-z_]\\w*$/;\n\n/** @internal */\nexport type NewOperatorNode =\n  | SimpleFilterFieldComparisonOperatorNode\n  | SimpleFilterFieldInclusionOperatorNode\n  | SimpleFilterFieldExistsOperatorNode\n  | SimpleFilterFieldSearchOperatorNode;\n\n/** @internal */\nexport type Polarity = 'positive' | 'negative' | 'none';\n\n/** @internal */\nexport type OperatorDescriptor = {\n  node: NewOperatorNode;\n  polarity: Polarity;\n};\n\n/** @internal */\nexport const OPERATOR_MAP: Partial<Record<string, OperatorDescriptor>> = {\n  equals: {\n    node: { type: 'ComparisonOperator', value: '=' },\n    polarity: 'positive',\n  },\n  'not-equals': {\n    node: { type: 'ComparisonOperator', value: '!=' },\n    polarity: 'negative',\n  },\n  in: {\n    node: { type: 'InclusionOperator', value: 'in' },\n    polarity: 'positive',\n  },\n  'not in': {\n    node: { type: 'InclusionOperator', value: 'not in' },\n    polarity: 'negative',\n  },\n  'less-than': {\n    node: { type: 'ComparisonOperator', value: '<' },\n    polarity: 'none',\n  },\n  'less-or-equal': {\n    node: { type: 'ComparisonOperator', value: '<=' },\n    polarity: 'none',\n  },\n  'greater-than': {\n    node: { type: 'ComparisonOperator', value: '>' },\n    polarity: 'none',\n  },\n  'greater-or-equal': {\n    node: { type: 'ComparisonOperator', value: '>=' },\n    polarity: 'none',\n  },\n  exists: { node: { type: 'ExistsOperator', value: true }, polarity: 'none' },\n  'not-exists': {\n    node: { type: 'ExistsOperator', value: false },\n    polarity: 'none',\n  },\n  search: {\n    node: { type: 'SearchOperator', value: 'search' },\n    polarity: 'none',\n  },\n};\n\n/** @internal */\nexport function mapInputOperator(\n  operator: string | undefined,\n): OperatorDescriptor {\n  const op = operator ?? 'equals';\n  return (\n    OPERATOR_MAP[op] ?? {\n      node: {\n        type: 'ComparisonOperator',\n        value: op as SimpleFilterFieldComparisonOperatorNode['value'],\n      },\n      polarity: 'none',\n    }\n  );\n}\n\n/** @internal */\nexport function statementPolarity(\n  statement: SimpleFilterFieldStatementNode,\n): Polarity {\n  const op = statement.comparisonOperator;\n  if (!op) {\n    return 'none';\n  }\n  if (op.type === 'ComparisonOperator') {\n    if (op.value === '=') {\n      return 'positive';\n    }\n    if (op.value === '!=') {\n      return 'negative';\n    }\n  }\n  if (op.type === 'InclusionOperator') {\n    if (op.value === 'in') {\n      return 'positive';\n    }\n    if (op.value === 'not in') {\n      return 'negative';\n    }\n  }\n  return 'none';\n}\n\n/** @internal */\nexport function leafEquals(\n  leaf: SimpleFilterFieldLeafNode,\n  value: string | number | boolean,\n): boolean {\n  switch (leaf.type) {\n    case 'Number':\n      if (typeof value === 'number') {\n        return leaf.value === value;\n      }\n      if (typeof value === 'string') {\n        const asNumber = getNumberParser().parse(value);\n        return !isNaN(asNumber) && leaf.value === asNumber;\n      }\n      return false;\n    case 'Boolean':\n      if (typeof value === 'boolean') {\n        return leaf.value === value;\n      }\n      if (value === 'true' || value === 'false') {\n        return leaf.value === (value === 'true');\n      }\n      return false;\n    // Duration compares against its rendered form (`30m`) so a string input\n    // and an existing Duration leaf deduplicate correctly.\n    case 'Duration':\n      return typeof value === 'string' && value === `${leaf.value}${leaf.unit}`;\n    case 'String':\n    case 'IPAddress':\n    case 'Timestamp':\n    case 'UID':\n    case 'SmartscapeId':\n    case 'Variable':\n      return typeof value === 'string' && leaf.value === value;\n    default:\n      return false;\n  }\n}\n\n/** @internal */\nexport function findSearchStatement(\n  group: SimpleFilterFieldGroupNode,\n  value: string | number | boolean,\n): SimpleFilterFieldStatementNode | undefined {\n  for (let i = group.children.length - 1; i >= 0; i--) {\n    const child = group.children[i];\n    if (isFilterFieldGroupNode(child)) {\n      const nested = findSearchStatement(child, value);\n      if (nested) {\n        return nested;\n      }\n    } else if (isFilterFieldStatementNode(child)) {\n      const op = child.comparisonOperator;\n      const leafValue = child.value;\n      if (\n        op?.type === 'SearchOperator' &&\n        leafValue !== undefined &&\n        !isFilterFieldListNode(leafValue) &&\n        leafEquals(leafValue as SimpleFilterFieldLeafNode, value)\n      ) {\n        return child;\n      }\n    }\n  }\n  return undefined;\n}\n\n/** @internal */\nexport function findIdenticalStatement(\n  group: SimpleFilterFieldGroupNode,\n  key: string,\n  operatorNode: NewOperatorNode,\n  value: string | number | boolean | undefined,\n): SimpleFilterFieldStatementNode | undefined {\n  for (let i = group.children.length - 1; i >= 0; i--) {\n    const child = group.children[i];\n    if (isFilterFieldGroupNode(child)) {\n      const nested = findIdenticalStatement(child, key, operatorNode, value);\n      if (nested) {\n        return nested;\n      }\n    } else if (isFilterFieldStatementNode(child)) {\n      const childKey = child.key;\n      if (\n        !childKey ||\n        (childKey.type !== 'Key' && childKey.type !== 'JSONPath') ||\n        childKey.value !== key\n      ) {\n        continue;\n      }\n      const childOp = child.comparisonOperator;\n      if (\n        !childOp ||\n        childOp.type !== operatorNode.type ||\n        childOp.value !== operatorNode.value\n      ) {\n        continue;\n      }\n      if (operatorNode.type === 'ExistsOperator' || value === undefined) {\n        return child;\n      }\n      const childValue = child.value;\n      if (\n        childValue &&\n        !isFilterFieldListNode(childValue) &&\n        childValue.type !== 'Error' &&\n        leafEquals(childValue as SimpleFilterFieldLeafNode, value)\n      ) {\n        return child;\n      }\n    }\n  }\n  return undefined;\n}\n"],
-  "mappings": "AAAA,SAAS,uBAAuB;AAUhC;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAGA,MAAM,iBAAiB;AAEvB,MAAM,iBAAiB;AAmBvB,MAAM,eAA4D;AAAA,EACvE,QAAQ;AAAA,IACN,MAAM,EAAE,MAAM,sBAAsB,OAAO,IAAI;AAAA,IAC/C,UAAU;AAAA,EACZ;AAAA,EACA,cAAc;AAAA,IACZ,MAAM,EAAE,MAAM,sBAAsB,OAAO,KAAK;AAAA,IAChD,UAAU;AAAA,EACZ;AAAA,EACA,IAAI;AAAA,IACF,MAAM,EAAE,MAAM,qBAAqB,OAAO,KAAK;AAAA,IAC/C,UAAU;AAAA,EACZ;AAAA,EACA,UAAU;AAAA,IACR,MAAM,EAAE,MAAM,qBAAqB,OAAO,SAAS;AAAA,IACnD,UAAU;AAAA,EACZ;AAAA,EACA,aAAa;AAAA,IACX,MAAM,EAAE,MAAM,sBAAsB,OAAO,IAAI;AAAA,IAC/C,UAAU;AAAA,EACZ;AAAA,EACA,iBAAiB;AAAA,IACf,MAAM,EAAE,MAAM,sBAAsB,OAAO,KAAK;AAAA,IAChD,UAAU;AAAA,EACZ;AAAA,EACA,gBAAgB;AAAA,IACd,MAAM,EAAE,MAAM,sBAAsB,OAAO,IAAI;AAAA,IAC/C,UAAU;AAAA,EACZ;AAAA,EACA,oBAAoB;AAAA,IAClB,MAAM,EAAE,MAAM,sBAAsB,OAAO,KAAK;AAAA,IAChD,UAAU;AAAA,EACZ;AAAA,EACA,QAAQ,EAAE,MAAM,EAAE,MAAM,kBAAkB,OAAO,KAAK,GAAG,UAAU,OAAO;AAAA,EAC1E,cAAc;AAAA,IACZ,MAAM,EAAE,MAAM,kBAAkB,OAAO,MAAM;AAAA,IAC7C,UAAU;AAAA,EACZ;AAAA,EACA,QAAQ;AAAA,IACN,MAAM,EAAE,MAAM,kBAAkB,OAAO,SAAS;AAAA,IAChD,UAAU;AAAA,EACZ;AACF;AAGO,SAAS,iBACd,UACoB;AACpB,QAAM,KAAK,YAAY;AACvB,SACE,aAAa,EAAE,KAAK;AAAA,IAClB,MAAM;AAAA,MACJ,MAAM;AAAA,MACN,OAAO;AAAA,IACT;AAAA,IACA,UAAU;AAAA,EACZ;AAEJ;AAGO,SAAS,kBACd,WACU;AACV,QAAM,KAAK,UAAU;AACrB,MAAI,CAAC,IAAI;AACP,WAAO;AAAA,EACT;AACA,MAAI,GAAG,SAAS,sBAAsB;AACpC,QAAI,GAAG,UAAU,KAAK;AACpB,aAAO;AAAA,IACT;AACA,QAAI,GAAG,UAAU,MAAM;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AACA,MAAI,GAAG,SAAS,qBAAqB;AACnC,QAAI,GAAG,UAAU,MAAM;AACrB,aAAO;AAAA,IACT;AACA,QAAI,GAAG,UAAU,UAAU;AACzB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,WACd,MACA,OACS;AACT,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,UAAI,OAAO,UAAU,UAAU;AAC7B,eAAO,KAAK,UAAU;AAAA,MACxB;AACA,UAAI,OAAO,UAAU,UAAU;AAC7B,cAAM,WAAW,gBAAgB,EAAE,MAAM,KAAK;AAC9C,eAAO,CAAC,MAAM,QAAQ,KAAK,KAAK,UAAU;AAAA,MAC5C;AACA,aAAO;AAAA,IACT,KAAK;AACH,UAAI,OAAO,UAAU,WAAW;AAC9B,eAAO,KAAK,UAAU;AAAA,MACxB;AACA,UAAI,UAAU,UAAU,UAAU,SAAS;AACzC,eAAO,KAAK,WAAW,UAAU;AAAA,MACnC;AACA,aAAO;AAAA;AAAA;AAAA,IAGT,KAAK;AACH,aAAO,OAAO,UAAU,YAAY,UAAU,GAAG,KAAK,KAAK,GAAG,KAAK,IAAI;AAAA,IACzE,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,OAAO,UAAU,YAAY,KAAK,UAAU;AAAA,IACrD;AACE,aAAO;AAAA,EACX;AACF;AAGO,SAAS,oBACd,OACA,OAC4C;AAC5C,WAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,UAAM,QAAQ,MAAM,SAAS,CAAC;AAC9B,QAAI,uBAAuB,KAAK,GAAG;AACjC,YAAM,SAAS,oBAAoB,OAAO,KAAK;AAC/C,UAAI,QAAQ;AACV,eAAO;AAAA,MACT;AAAA,IACF,WAAW,2BAA2B,KAAK,GAAG;AAC5C,YAAM,KAAK,MAAM;AACjB,YAAM,YAAY,MAAM;AACxB,UACE,IAAI,SAAS,oBACb,cAAc,UACd,CAAC,sBAAsB,SAAS,KAChC,WAAW,WAAwC,KAAK,GACxD;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,uBACd,OACA,KACA,cACA,OAC4C;AAC5C,WAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,UAAM,QAAQ,MAAM,SAAS,CAAC;AAC9B,QAAI,uBAAuB,KAAK,GAAG;AACjC,YAAM,SAAS,uBAAuB,OAAO,KAAK,cAAc,KAAK;AACrE,UAAI,QAAQ;AACV,eAAO;AAAA,MACT;AAAA,IACF,WAAW,2BAA2B,KAAK,GAAG;AAC5C,YAAM,WAAW,MAAM;AACvB,UACE,CAAC,YACA,SAAS,SAAS,SAAS,SAAS,SAAS,cAC9C,SAAS,UAAU,KACnB;AACA;AAAA,MACF;AACA,YAAM,UAAU,MAAM;AACtB,UACE,CAAC,WACD,QAAQ,SAAS,aAAa,QAC9B,QAAQ,UAAU,aAAa,OAC/B;AACA;AAAA,MACF;AACA,UAAI,aAAa,SAAS,oBAAoB,UAAU,QAAW;AACjE,eAAO;AAAA,MACT;AACA,YAAM,aAAa,MAAM;AACzB,UACE,cACA,CAAC,sBAAsB,UAAU,KACjC,WAAW,SAAS,WACpB,WAAW,YAAyC,KAAK,GACzD;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;",
+  "sourcesContent": ["import type { FilterFieldProps } from '../../FilterField.types.js';\nimport { getNumberParser } from '../../parser/getNumberParser.js';\nimport type {\n  SimpleFilterFieldBooleanNode,\n  SimpleFilterFieldComparisonOperatorNode,\n  SimpleFilterFieldDurationNode,\n  SimpleFilterFieldExistsOperatorNode,\n  SimpleFilterFieldGroupNode,\n  SimpleFilterFieldIPAddressNode,\n  SimpleFilterFieldInclusionOperatorNode,\n  SimpleFilterFieldLeafNode,\n  SimpleFilterFieldNumberNode,\n  SimpleFilterFieldSearchOperatorNode,\n  SimpleFilterFieldSmartscapeIdNode,\n  SimpleFilterFieldStatementNode,\n  SimpleFilterFieldStringNode,\n  SimpleFilterFieldTimestampNode,\n  SimpleFilterFieldUIDNode,\n  SimpleFilterFieldVariableNode,\n} from '../../types/conversion-tree-nodes.js';\nimport type { FilterFieldPrimitive } from '../../types/validation.js';\nimport {\n  isFilterFieldGroupNode,\n  isFilterFieldListNode,\n  isFilterFieldStatementNode,\n} from '../tree-node-guards.js';\nimport {\n  isValidIPAddress,\n  isValidSmartscapeId,\n  isValidTimestamp,\n  isValidUID,\n} from '../validation-utils/type-validators.js';\n\n/** @internal */\nexport const DURATION_REGEX = /^(\\d+)(ns|ms|s|m|h|d)$/i;\n/** @internal */\nexport const VARIABLE_REGEX = /^\\$[A-Za-z_]\\w*$/;\n\n/** @internal */\nexport type NewOperatorNode =\n  | SimpleFilterFieldComparisonOperatorNode\n  | SimpleFilterFieldInclusionOperatorNode\n  | SimpleFilterFieldExistsOperatorNode\n  | SimpleFilterFieldSearchOperatorNode;\n\n/** @internal */\nexport type Polarity = 'positive' | 'negative' | 'none';\n\n/** @internal */\nexport type OperatorDescriptor = {\n  node: NewOperatorNode;\n  polarity: Polarity;\n};\n\n/** @internal */\nexport const OPERATOR_MAP: Partial<Record<string, OperatorDescriptor>> = {\n  equals: {\n    node: { type: 'ComparisonOperator', value: '=' },\n    polarity: 'positive',\n  },\n  'not-equals': {\n    node: { type: 'ComparisonOperator', value: '!=' },\n    polarity: 'negative',\n  },\n  in: {\n    node: { type: 'InclusionOperator', value: 'in' },\n    polarity: 'positive',\n  },\n  'not in': {\n    node: { type: 'InclusionOperator', value: 'not in' },\n    polarity: 'negative',\n  },\n  'less-than': {\n    node: { type: 'ComparisonOperator', value: '<' },\n    polarity: 'none',\n  },\n  'less-or-equal': {\n    node: { type: 'ComparisonOperator', value: '<=' },\n    polarity: 'none',\n  },\n  'greater-than': {\n    node: { type: 'ComparisonOperator', value: '>' },\n    polarity: 'none',\n  },\n  'greater-or-equal': {\n    node: { type: 'ComparisonOperator', value: '>=' },\n    polarity: 'none',\n  },\n  exists: { node: { type: 'ExistsOperator', value: true }, polarity: 'none' },\n  'not-exists': {\n    node: { type: 'ExistsOperator', value: false },\n    polarity: 'none',\n  },\n  search: {\n    node: { type: 'SearchOperator', value: 'search' },\n    polarity: 'none',\n  },\n};\n\n/** @internal */\nexport function mapInputOperator(\n  operator: string | undefined,\n): OperatorDescriptor {\n  const op = operator ?? 'equals';\n  return (\n    OPERATOR_MAP[op] ?? {\n      node: {\n        type: 'ComparisonOperator',\n        value: op as SimpleFilterFieldComparisonOperatorNode['value'],\n      },\n      polarity: 'none',\n    }\n  );\n}\n\n/** @internal */\nexport function statementPolarity(\n  statement: SimpleFilterFieldStatementNode,\n): Polarity {\n  const op = statement.comparisonOperator;\n  if (!op) {\n    return 'none';\n  }\n  if (op.type === 'ComparisonOperator') {\n    if (op.value === '=') {\n      return 'positive';\n    }\n    if (op.value === '!=') {\n      return 'negative';\n    }\n  }\n  if (op.type === 'InclusionOperator') {\n    if (op.value === 'in') {\n      return 'positive';\n    }\n    if (op.value === 'not in') {\n      return 'negative';\n    }\n  }\n  return 'none';\n}\n\n/**\n * Accepted shape for the value-type hint on `addFilter` / `removeFilter`.\n *\n * `'Any'`, `'JSONPath'`, and unrecognized custom type names fall back to the\n * default inference behavior.\n * @internal\n */\nexport type FilterFieldValueTypeHint = FilterFieldPrimitive | (string & {});\n\ntype LeafNode =\n  | SimpleFilterFieldStringNode\n  | SimpleFilterFieldNumberNode\n  | SimpleFilterFieldBooleanNode\n  | SimpleFilterFieldDurationNode\n  | SimpleFilterFieldVariableNode\n  | SimpleFilterFieldIPAddressNode\n  | SimpleFilterFieldTimestampNode\n  | SimpleFilterFieldUIDNode\n  | SimpleFilterFieldSmartscapeIdNode;\n\n/** Returns true when `hint` identifies a concrete type that the builder should honour. */\nfunction isExplicitValueType(\n  hint: FilterFieldValueTypeHint | undefined,\n): hint is FilterFieldPrimitive {\n  return (\n    hint !== undefined &&\n    hint !== 'Any' &&\n    hint !== 'JSONPath' &&\n    // Built-in primitives: String, Number, Boolean, Duration, IPAddress, UID, Timestamp, SmartscapeId\n    (hint === 'String' ||\n      hint === 'Number' ||\n      hint === 'Boolean' ||\n      hint === 'Duration' ||\n      hint === 'IPAddress' ||\n      hint === 'Timestamp' ||\n      hint === 'UID' ||\n      hint === 'SmartscapeId')\n  );\n}\n\n/**\n * Builds a leaf from an explicit `valueType` hint.\n *\n * Returns `undefined` when the hint should be ignored (i.e. fall back to inference).\n * @internal\n */\nfunction makeTypedLeaf(\n  value: string | number | boolean,\n  parserConfig: FilterFieldProps['parserConfig'],\n  valueType: FilterFieldValueTypeHint,\n): LeafNode | undefined {\n  if (!isExplicitValueType(valueType)) {\n    return undefined;\n  }\n  switch (valueType) {\n    case 'String':\n      return { type: 'String', value: String(value) };\n    case 'Boolean': {\n      if (typeof value === 'boolean') {\n        return { type: 'Boolean', value };\n      }\n      if (value === 'true' || value === 'false') {\n        return { type: 'Boolean', value: value === 'true' };\n      }\n      return undefined;\n    }\n    case 'Number': {\n      if (typeof value === 'number') {\n        return { type: 'Number', value };\n      }\n      if (typeof value === 'string') {\n        const parsed = getNumberParser().parse(value);\n        if (!isNaN(parsed)) {\n          return { type: 'Number', value: parsed };\n        }\n      }\n      return undefined;\n    }\n    case 'Duration': {\n      const match = DURATION_REGEX.exec(String(value));\n      if (match) {\n        return {\n          type: 'Duration',\n          value: parseInt(match[1], 10),\n          unit: match[2].toLowerCase() as SimpleFilterFieldDurationNode['unit'],\n        };\n      }\n      return undefined;\n    }\n    case 'IPAddress': {\n      const str = String(value);\n      // oxlint-disable-next-line typescript/no-deprecated\n      if (parserConfig?.ipAddressConversion && isValidIPAddress(str)) {\n        return { type: 'IPAddress', value: str, textValue: str };\n      }\n      return undefined;\n    }\n    case 'Timestamp': {\n      const str = String(value);\n      // oxlint-disable-next-line typescript/no-deprecated\n      if (parserConfig?.timestampConversion && isValidTimestamp(str)) {\n        return { type: 'Timestamp', value: str, textValue: str };\n      }\n      return undefined;\n    }\n    case 'UID': {\n      const str = String(value);\n      // oxlint-disable-next-line typescript/no-deprecated\n      if (parserConfig?.uidConversion && isValidUID(str)) {\n        return { type: 'UID', value: str, textValue: str };\n      }\n      return undefined;\n    }\n    case 'SmartscapeId': {\n      const str = String(value);\n      // oxlint-disable-next-line typescript/no-deprecated\n      if (parserConfig?.smartscapeIdConversion && isValidSmartscapeId(str)) {\n        return { type: 'SmartscapeId', value: str, textValue: str };\n      }\n      return undefined;\n    }\n  }\n}\n\nfunction inferLeaf(\n  value: string | number | boolean,\n  parserConfig: FilterFieldProps['parserConfig'],\n): LeafNode {\n  if (typeof value === 'number') {\n    return { type: 'Number', value };\n  }\n  if (typeof value === 'boolean') {\n    return { type: 'Boolean', value };\n  }\n\n  const durationMatch = DURATION_REGEX.exec(value);\n  if (durationMatch) {\n    return {\n      type: 'Duration',\n      value: parseInt(durationMatch[1], 10),\n      unit: durationMatch[2].toLowerCase() as SimpleFilterFieldDurationNode['unit'],\n    };\n  }\n  if (value === 'true' || value === 'false') {\n    return { type: 'Boolean', value: value === 'true' };\n  }\n  const parsedNumber = getNumberParser().parse(value);\n  if (!isNaN(parsedNumber)) {\n    return { type: 'Number', value: parsedNumber };\n  }\n  if (VARIABLE_REGEX.test(value)) {\n    return { type: 'Variable', value, variableType: 'Any' };\n  }\n\n  // Opt-in detections gated on parserConfig flags.\n  // oxlint-disable-next-line typescript/no-deprecated\n  if (parserConfig?.ipAddressConversion && isValidIPAddress(value)) {\n    return { type: 'IPAddress', value, textValue: value };\n  }\n  // oxlint-disable-next-line typescript/no-deprecated\n  if (parserConfig?.timestampConversion && isValidTimestamp(value)) {\n    return { type: 'Timestamp', value, textValue: value };\n  }\n  // oxlint-disable-next-line typescript/no-deprecated\n  if (parserConfig?.uidConversion && isValidUID(value)) {\n    return { type: 'UID', value, textValue: value };\n  }\n  // oxlint-disable-next-line typescript/no-deprecated\n  if (parserConfig?.smartscapeIdConversion && isValidSmartscapeId(value)) {\n    return { type: 'SmartscapeId', value, textValue: value };\n  }\n  return { type: 'String', value };\n}\n\n/**\n * Builds the appropriate leaf node for the given `value`, optionally constrained\n * by a `valueType` hint. When no hint is given (or the hint is `'Any'` /\n * `'JSONPath'` / an unrecognized custom name), the type is inferred from the\n * value's content \u2014 matching the historical behavior.\n * @internal\n */\nexport function makeLeaf(\n  value: string | number | boolean,\n  parserConfig: FilterFieldProps['parserConfig'],\n  valueType?: FilterFieldValueTypeHint,\n): LeafNode {\n  if (valueType !== undefined) {\n    const typed = makeTypedLeaf(value, parserConfig, valueType);\n    if (typed !== undefined) {\n      return typed;\n    }\n  }\n  return inferLeaf(value, parserConfig);\n}\n\n/**\n * The scalar a leaf compares by. `Duration` reports its rendered form (`30m`) so\n * that two Duration leaves compare by value and unit together.\n */\nfunction leafScalar(\n  leaf: SimpleFilterFieldLeafNode,\n): string | number | boolean | undefined {\n  if (leaf.type === 'Duration') {\n    return `${leaf.value}${leaf.unit}`;\n  }\n  const { value } = leaf;\n  if (\n    typeof value === 'string' ||\n    typeof value === 'number' ||\n    typeof value === 'boolean'\n  ) {\n    return value;\n  }\n  return undefined;\n}\n\n/** @internal */\nexport function leafEquals(\n  leaf: SimpleFilterFieldLeafNode,\n  value: string | number | boolean,\n  options?: {\n    valueType?: FilterFieldValueTypeHint;\n    parserConfig?: FilterFieldProps['parserConfig'];\n  },\n): boolean {\n  const { valueType, parserConfig } = options ?? {};\n  if (!isExplicitValueType(valueType)) {\n    return leafValueMatches(leaf, value);\n  }\n  // With an explicit type the input is compared as the leaf it would build, not\n  // as the raw value: `makeTypedLeaf` coerces (e.g. `42` \u2192 the String `'42'`),\n  // so comparing the raw input would make add/remove asymmetric.\n  const candidate = makeLeaf(value, parserConfig, valueType);\n  if (leaf.type !== candidate.type) {\n    return false;\n  }\n  const candidateScalar = leafScalar(candidate);\n  return candidateScalar !== undefined && leafScalar(leaf) === candidateScalar;\n}\n\nfunction leafValueMatches(\n  leaf: SimpleFilterFieldLeafNode,\n  value: string | number | boolean,\n): boolean {\n  switch (leaf.type) {\n    case 'Number':\n      if (typeof value === 'number') {\n        return leaf.value === value;\n      }\n      if (typeof value === 'string') {\n        const asNumber = getNumberParser().parse(value);\n        return !isNaN(asNumber) && leaf.value === asNumber;\n      }\n      return false;\n    case 'Boolean':\n      if (typeof value === 'boolean') {\n        return leaf.value === value;\n      }\n      if (value === 'true' || value === 'false') {\n        return leaf.value === (value === 'true');\n      }\n      return false;\n    // Duration compares against its rendered form (`30m`) so a string input\n    // and an existing Duration leaf deduplicate correctly.\n    case 'Duration':\n      return typeof value === 'string' && value === `${leaf.value}${leaf.unit}`;\n    case 'String':\n    case 'IPAddress':\n    case 'Timestamp':\n    case 'UID':\n    case 'SmartscapeId':\n    case 'Variable':\n      return typeof value === 'string' && leaf.value === value;\n    default:\n      return false;\n  }\n}\n\n/** @internal */\nexport function findSearchStatement(\n  group: SimpleFilterFieldGroupNode,\n  value: string | number | boolean,\n  options?: {\n    valueType?: FilterFieldValueTypeHint;\n    parserConfig?: FilterFieldProps['parserConfig'];\n  },\n): SimpleFilterFieldStatementNode | undefined {\n  for (let i = group.children.length - 1; i >= 0; i--) {\n    const child = group.children[i];\n    if (isFilterFieldGroupNode(child)) {\n      const nested = findSearchStatement(child, value, options);\n      if (nested) {\n        return nested;\n      }\n    } else if (isFilterFieldStatementNode(child)) {\n      const op = child.comparisonOperator;\n      const leafValue = child.value;\n      if (\n        op?.type === 'SearchOperator' &&\n        leafValue !== undefined &&\n        !isFilterFieldListNode(leafValue) &&\n        leafEquals(leafValue as SimpleFilterFieldLeafNode, value, options)\n      ) {\n        return child;\n      }\n    }\n  }\n  return undefined;\n}\n\n/** @internal */\nexport function findIdenticalStatement(\n  group: SimpleFilterFieldGroupNode,\n  key: string,\n  operatorNode: NewOperatorNode,\n  value: string | number | boolean | undefined,\n  options?: {\n    valueType?: FilterFieldValueTypeHint;\n    parserConfig?: FilterFieldProps['parserConfig'];\n  },\n): SimpleFilterFieldStatementNode | undefined {\n  for (let i = group.children.length - 1; i >= 0; i--) {\n    const child = group.children[i];\n    if (isFilterFieldGroupNode(child)) {\n      const nested = findIdenticalStatement(\n        child,\n        key,\n        operatorNode,\n        value,\n        options,\n      );\n      if (nested) {\n        return nested;\n      }\n    } else if (isFilterFieldStatementNode(child)) {\n      const childKey = child.key;\n      if (\n        !childKey ||\n        (childKey.type !== 'Key' && childKey.type !== 'JSONPath') ||\n        childKey.value !== key\n      ) {\n        continue;\n      }\n      const childOp = child.comparisonOperator;\n      if (\n        !childOp ||\n        childOp.type !== operatorNode.type ||\n        childOp.value !== operatorNode.value\n      ) {\n        continue;\n      }\n      if (operatorNode.type === 'ExistsOperator' || value === undefined) {\n        return child;\n      }\n      const childValue = child.value;\n      if (\n        childValue &&\n        !isFilterFieldListNode(childValue) &&\n        childValue.type !== 'Error' &&\n        leafEquals(childValue as SimpleFilterFieldLeafNode, value, options)\n      ) {\n        return child;\n      }\n    }\n  }\n  return undefined;\n}\n"],
+  "mappings": "AACA,SAAS,uBAAuB;AAoBhC;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAGA,MAAM,iBAAiB;AAEvB,MAAM,iBAAiB;AAmBvB,MAAM,eAA4D;AAAA,EACvE,QAAQ;AAAA,IACN,MAAM,EAAE,MAAM,sBAAsB,OAAO,IAAI;AAAA,IAC/C,UAAU;AAAA,EACZ;AAAA,EACA,cAAc;AAAA,IACZ,MAAM,EAAE,MAAM,sBAAsB,OAAO,KAAK;AAAA,IAChD,UAAU;AAAA,EACZ;AAAA,EACA,IAAI;AAAA,IACF,MAAM,EAAE,MAAM,qBAAqB,OAAO,KAAK;AAAA,IAC/C,UAAU;AAAA,EACZ;AAAA,EACA,UAAU;AAAA,IACR,MAAM,EAAE,MAAM,qBAAqB,OAAO,SAAS;AAAA,IACnD,UAAU;AAAA,EACZ;AAAA,EACA,aAAa;AAAA,IACX,MAAM,EAAE,MAAM,sBAAsB,OAAO,IAAI;AAAA,IAC/C,UAAU;AAAA,EACZ;AAAA,EACA,iBAAiB;AAAA,IACf,MAAM,EAAE,MAAM,sBAAsB,OAAO,KAAK;AAAA,IAChD,UAAU;AAAA,EACZ;AAAA,EACA,gBAAgB;AAAA,IACd,MAAM,EAAE,MAAM,sBAAsB,OAAO,IAAI;AAAA,IAC/C,UAAU;AAAA,EACZ;AAAA,EACA,oBAAoB;AAAA,IAClB,MAAM,EAAE,MAAM,sBAAsB,OAAO,KAAK;AAAA,IAChD,UAAU;AAAA,EACZ;AAAA,EACA,QAAQ,EAAE,MAAM,EAAE,MAAM,kBAAkB,OAAO,KAAK,GAAG,UAAU,OAAO;AAAA,EAC1E,cAAc;AAAA,IACZ,MAAM,EAAE,MAAM,kBAAkB,OAAO,MAAM;AAAA,IAC7C,UAAU;AAAA,EACZ;AAAA,EACA,QAAQ;AAAA,IACN,MAAM,EAAE,MAAM,kBAAkB,OAAO,SAAS;AAAA,IAChD,UAAU;AAAA,EACZ;AACF;AAGO,SAAS,iBACd,UACoB;AACpB,QAAM,KAAK,YAAY;AACvB,SACE,aAAa,EAAE,KAAK;AAAA,IAClB,MAAM;AAAA,MACJ,MAAM;AAAA,MACN,OAAO;AAAA,IACT;AAAA,IACA,UAAU;AAAA,EACZ;AAEJ;AAGO,SAAS,kBACd,WACU;AACV,QAAM,KAAK,UAAU;AACrB,MAAI,CAAC,IAAI;AACP,WAAO;AAAA,EACT;AACA,MAAI,GAAG,SAAS,sBAAsB;AACpC,QAAI,GAAG,UAAU,KAAK;AACpB,aAAO;AAAA,IACT;AACA,QAAI,GAAG,UAAU,MAAM;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AACA,MAAI,GAAG,SAAS,qBAAqB;AACnC,QAAI,GAAG,UAAU,MAAM;AACrB,aAAO;AAAA,IACT;AACA,QAAI,GAAG,UAAU,UAAU;AACzB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAuBA,SAAS,oBACP,MAC8B;AAC9B,SACE,SAAS,UACT,SAAS,SACT,SAAS;AAAA,GAER,SAAS,YACR,SAAS,YACT,SAAS,aACT,SAAS,cACT,SAAS,eACT,SAAS,eACT,SAAS,SACT,SAAS;AAEf;AAQA,SAAS,cACP,OACA,cACA,WACsB;AACtB,MAAI,CAAC,oBAAoB,SAAS,GAAG;AACnC,WAAO;AAAA,EACT;AACA,UAAQ,WAAW;AAAA,IACjB,KAAK;AACH,aAAO,EAAE,MAAM,UAAU,OAAO,OAAO,KAAK,EAAE;AAAA,IAChD,KAAK,WAAW;AACd,UAAI,OAAO,UAAU,WAAW;AAC9B,eAAO,EAAE,MAAM,WAAW,MAAM;AAAA,MAClC;AACA,UAAI,UAAU,UAAU,UAAU,SAAS;AACzC,eAAO,EAAE,MAAM,WAAW,OAAO,UAAU,OAAO;AAAA,MACpD;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,UAAU;AACb,UAAI,OAAO,UAAU,UAAU;AAC7B,eAAO,EAAE,MAAM,UAAU,MAAM;AAAA,MACjC;AACA,UAAI,OAAO,UAAU,UAAU;AAC7B,cAAM,SAAS,gBAAgB,EAAE,MAAM,KAAK;AAC5C,YAAI,CAAC,MAAM,MAAM,GAAG;AAClB,iBAAO,EAAE,MAAM,UAAU,OAAO,OAAO;AAAA,QACzC;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,YAAY;AACf,YAAM,QAAQ,eAAe,KAAK,OAAO,KAAK,CAAC;AAC/C,UAAI,OAAO;AACT,eAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAAA,UAC5B,MAAM,MAAM,CAAC,EAAE,YAAY;AAAA,QAC7B;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,aAAa;AAChB,YAAM,MAAM,OAAO,KAAK;AAExB,UAAI,cAAc,uBAAuB,iBAAiB,GAAG,GAAG;AAC9D,eAAO,EAAE,MAAM,aAAa,OAAO,KAAK,WAAW,IAAI;AAAA,MACzD;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,aAAa;AAChB,YAAM,MAAM,OAAO,KAAK;AAExB,UAAI,cAAc,uBAAuB,iBAAiB,GAAG,GAAG;AAC9D,eAAO,EAAE,MAAM,aAAa,OAAO,KAAK,WAAW,IAAI;AAAA,MACzD;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,OAAO;AACV,YAAM,MAAM,OAAO,KAAK;AAExB,UAAI,cAAc,iBAAiB,WAAW,GAAG,GAAG;AAClD,eAAO,EAAE,MAAM,OAAO,OAAO,KAAK,WAAW,IAAI;AAAA,MACnD;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,gBAAgB;AACnB,YAAM,MAAM,OAAO,KAAK;AAExB,UAAI,cAAc,0BAA0B,oBAAoB,GAAG,GAAG;AACpE,eAAO,EAAE,MAAM,gBAAgB,OAAO,KAAK,WAAW,IAAI;AAAA,MAC5D;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,UACP,OACA,cACU;AACV,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,EAAE,MAAM,UAAU,MAAM;AAAA,EACjC;AACA,MAAI,OAAO,UAAU,WAAW;AAC9B,WAAO,EAAE,MAAM,WAAW,MAAM;AAAA,EAClC;AAEA,QAAM,gBAAgB,eAAe,KAAK,KAAK;AAC/C,MAAI,eAAe;AACjB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO,SAAS,cAAc,CAAC,GAAG,EAAE;AAAA,MACpC,MAAM,cAAc,CAAC,EAAE,YAAY;AAAA,IACrC;AAAA,EACF;AACA,MAAI,UAAU,UAAU,UAAU,SAAS;AACzC,WAAO,EAAE,MAAM,WAAW,OAAO,UAAU,OAAO;AAAA,EACpD;AACA,QAAM,eAAe,gBAAgB,EAAE,MAAM,KAAK;AAClD,MAAI,CAAC,MAAM,YAAY,GAAG;AACxB,WAAO,EAAE,MAAM,UAAU,OAAO,aAAa;AAAA,EAC/C;AACA,MAAI,eAAe,KAAK,KAAK,GAAG;AAC9B,WAAO,EAAE,MAAM,YAAY,OAAO,cAAc,MAAM;AAAA,EACxD;AAIA,MAAI,cAAc,uBAAuB,iBAAiB,KAAK,GAAG;AAChE,WAAO,EAAE,MAAM,aAAa,OAAO,WAAW,MAAM;AAAA,EACtD;AAEA,MAAI,cAAc,uBAAuB,iBAAiB,KAAK,GAAG;AAChE,WAAO,EAAE,MAAM,aAAa,OAAO,WAAW,MAAM;AAAA,EACtD;AAEA,MAAI,cAAc,iBAAiB,WAAW,KAAK,GAAG;AACpD,WAAO,EAAE,MAAM,OAAO,OAAO,WAAW,MAAM;AAAA,EAChD;AAEA,MAAI,cAAc,0BAA0B,oBAAoB,KAAK,GAAG;AACtE,WAAO,EAAE,MAAM,gBAAgB,OAAO,WAAW,MAAM;AAAA,EACzD;AACA,SAAO,EAAE,MAAM,UAAU,MAAM;AACjC;AASO,SAAS,SACd,OACA,cACA,WACU;AACV,MAAI,cAAc,QAAW;AAC3B,UAAM,QAAQ,cAAc,OAAO,cAAc,SAAS;AAC1D,QAAI,UAAU,QAAW;AACvB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO,UAAU,OAAO,YAAY;AACtC;AAMA,SAAS,WACP,MACuC;AACvC,MAAI,KAAK,SAAS,YAAY;AAC5B,WAAO,GAAG,KAAK,KAAK,GAAG,KAAK,IAAI;AAAA,EAClC;AACA,QAAM,EAAE,MAAM,IAAI;AAClB,MACE,OAAO,UAAU,YACjB,OAAO,UAAU,YACjB,OAAO,UAAU,WACjB;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGO,SAAS,WACd,MACA,OACA,SAIS;AACT,QAAM,EAAE,WAAW,aAAa,IAAI,WAAW,CAAC;AAChD,MAAI,CAAC,oBAAoB,SAAS,GAAG;AACnC,WAAO,iBAAiB,MAAM,KAAK;AAAA,EACrC;AAIA,QAAM,YAAY,SAAS,OAAO,cAAc,SAAS;AACzD,MAAI,KAAK,SAAS,UAAU,MAAM;AAChC,WAAO;AAAA,EACT;AACA,QAAM,kBAAkB,WAAW,SAAS;AAC5C,SAAO,oBAAoB,UAAa,WAAW,IAAI,MAAM;AAC/D;AAEA,SAAS,iBACP,MACA,OACS;AACT,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,UAAI,OAAO,UAAU,UAAU;AAC7B,eAAO,KAAK,UAAU;AAAA,MACxB;AACA,UAAI,OAAO,UAAU,UAAU;AAC7B,cAAM,WAAW,gBAAgB,EAAE,MAAM,KAAK;AAC9C,eAAO,CAAC,MAAM,QAAQ,KAAK,KAAK,UAAU;AAAA,MAC5C;AACA,aAAO;AAAA,IACT,KAAK;AACH,UAAI,OAAO,UAAU,WAAW;AAC9B,eAAO,KAAK,UAAU;AAAA,MACxB;AACA,UAAI,UAAU,UAAU,UAAU,SAAS;AACzC,eAAO,KAAK,WAAW,UAAU;AAAA,MACnC;AACA,aAAO;AAAA;AAAA;AAAA,IAGT,KAAK;AACH,aAAO,OAAO,UAAU,YAAY,UAAU,GAAG,KAAK,KAAK,GAAG,KAAK,IAAI;AAAA,IACzE,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,OAAO,UAAU,YAAY,KAAK,UAAU;AAAA,IACrD;AACE,aAAO;AAAA,EACX;AACF;AAGO,SAAS,oBACd,OACA,OACA,SAI4C;AAC5C,WAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,UAAM,QAAQ,MAAM,SAAS,CAAC;AAC9B,QAAI,uBAAuB,KAAK,GAAG;AACjC,YAAM,SAAS,oBAAoB,OAAO,OAAO,OAAO;AACxD,UAAI,QAAQ;AACV,eAAO;AAAA,MACT;AAAA,IACF,WAAW,2BAA2B,KAAK,GAAG;AAC5C,YAAM,KAAK,MAAM;AACjB,YAAM,YAAY,MAAM;AACxB,UACE,IAAI,SAAS,oBACb,cAAc,UACd,CAAC,sBAAsB,SAAS,KAChC,WAAW,WAAwC,OAAO,OAAO,GACjE;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,uBACd,OACA,KACA,cACA,OACA,SAI4C;AAC5C,WAAS,IAAI,MAAM,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AACnD,UAAM,QAAQ,MAAM,SAAS,CAAC;AAC9B,QAAI,uBAAuB,KAAK,GAAG;AACjC,YAAM,SAAS;AAAA,QACb;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,UAAI,QAAQ;AACV,eAAO;AAAA,MACT;AAAA,IACF,WAAW,2BAA2B,KAAK,GAAG;AAC5C,YAAM,WAAW,MAAM;AACvB,UACE,CAAC,YACA,SAAS,SAAS,SAAS,SAAS,SAAS,cAC9C,SAAS,UAAU,KACnB;AACA;AAAA,MACF;AACA,YAAM,UAAU,MAAM;AACtB,UACE,CAAC,WACD,QAAQ,SAAS,aAAa,QAC9B,QAAQ,UAAU,aAAa,OAC/B;AACA;AAAA,MACF;AACA,UAAI,aAAa,SAAS,oBAAoB,UAAU,QAAW;AACjE,eAAO;AAAA,MACT;AACA,YAAM,aAAa,MAAM;AACzB,UACE,cACA,CAAC,sBAAsB,UAAU,KACjC,WAAW,SAAS,WACpB,WAAW,YAAyC,OAAO,OAAO,GAClE;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;",
   "names": []
 }